8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #ifndef SHARE_VM_LIBADT_SET_HPP
  26 #define SHARE_VM_LIBADT_SET_HPP
  27 
  28 #include "libadt/port.hpp"
  29 #include "memory/allocation.hpp"
  30 
  31 // Sets - An Abstract Data Type
  32 
  33 //INTERFACE
  34 
  35 class SparseSet;
  36 class VectorSet;
  37 class ListSet;
  38 class CoSet;
  39 
  40 class ostream;
  41 class SetI_;
  42 
  43 // These sets can grow or shrink, based on the initial size and the largest
  44 // element currently in them.  Basically, they allow a bunch of bits to be
  45 // grouped together, tested, set & cleared, intersected, etc.  The basic
  46 // Set class is an abstract class, and cannot be constructed.  Instead,
  47 // one of VectorSet, SparseSet, or ListSet is created.  Each variation has
  48 // different asymptotic running times for different operations, and different
  49 // constants of proportionality as well.
  50 // {n = number of elements, N = largest element}
  51 
  52 //              VectorSet       SparseSet       ListSet
  53 // Create       O(N)            O(1)            O(1)
  54 // Clear        O(N)            O(1)            O(1)

   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #ifndef SHARE_VM_LIBADT_SET_HPP
  26 #define SHARE_VM_LIBADT_SET_HPP
  27 

  28 #include "memory/allocation.hpp"
  29 
  30 // Sets - An Abstract Data Type
  31 


  32 class SparseSet;
  33 class VectorSet;
  34 class ListSet;
  35 class CoSet;
  36 
  37 class ostream;
  38 class SetI_;
  39 
  40 // These sets can grow or shrink, based on the initial size and the largest
  41 // element currently in them.  Basically, they allow a bunch of bits to be
  42 // grouped together, tested, set & cleared, intersected, etc.  The basic
  43 // Set class is an abstract class, and cannot be constructed.  Instead,
  44 // one of VectorSet, SparseSet, or ListSet is created.  Each variation has
  45 // different asymptotic running times for different operations, and different
  46 // constants of proportionality as well.
  47 // {n = number of elements, N = largest element}
  48 
  49 //              VectorSet       SparseSet       ListSet
  50 // Create       O(N)            O(1)            O(1)
  51 // Clear        O(N)            O(1)            O(1)