src/share/vm/libadt/vectset.hpp

*** 1,7 ****
  /*
!  * Copyright (c) 1997, Oracle and/or its affiliates. All rights reserved.
   * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   *
   * This code is free software; you can redistribute it and/or modify it
   * under the terms of the GNU General Public License version 2 only, as
   * published by the Free Software Foundation.
--- 1,7 ----
  /*
!  * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved.
   * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   *
   * This code is free software; you can redistribute it and/or modify it
   * under the terms of the GNU General Public License version 2 only, as
   * published by the Free Software Foundation.
*** 20,31 ****
   * or visit www.oracle.com if you need additional information or have any
   * questions.
   *
   */
  
! #ifndef _VECTOR_SET_
! #define _VECTOR_SET_
  // Vector Sets - An Abstract Data Type
  //INTERFACE
  
  // These sets can grow or shrink, based on the initial size and the largest
  // element currently in them.  Slow and bulky for sparse sets, these sets
--- 20,34 ----
   * or visit www.oracle.com if you need additional information or have any
   * questions.
   *
   */
  
! #ifndef SHARE_VM_LIBADT_VECTSET_HPP
! #define SHARE_VM_LIBADT_VECTSET_HPP
! 
! #include "libadt/set.hpp"
! 
  // Vector Sets - An Abstract Data Type
  //INTERFACE
  
  // These sets can grow or shrink, based on the initial size and the largest
  // element currently in them.  Slow and bulky for sparse sets, these sets
*** 171,176 ****
    VectorSetI( const VectorSet *s ) : SetI(s) { }
    void operator ++(void) { elem = ((VSetI_*)impl)->next(); }
    int test(void) { return ((VSetI_*)impl)->test(); }
  };
  
! #endif // _VECTOR_SET_
--- 174,179 ----
    VectorSetI( const VectorSet *s ) : SetI(s) { }
    void operator ++(void) { elem = ((VSetI_*)impl)->next(); }
    int test(void) { return ((VSetI_*)impl)->test(); }
  };
  
! #endif // SHARE_VM_LIBADT_VECTSET_HPP