Mercurial > hg > truffle
view graal/com.oracle.max.base/src/com/sun/max/collect/PoolBitSet.java @ 4266:e2499e6d8aa7
Merge
author | Lukas Stadler <lukas.stadler@jku.at> |
---|---|
date | Wed, 11 Jan 2012 16:31:46 +0100 |
parents | bc8527f3071c |
children |
line wrap: on
line source
/* * Copyright (c) 2007, 2011, 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. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ package com.sun.max.collect; import java.util.*; /** * An implementation of a {@link PoolSet} based on a {@link BitSet}. * * While it's possible to create an instance of this class directly, the preferred way to create a pool set is described * {@linkplain PoolSet here}. */ public class PoolBitSet<T extends PoolObject> extends PoolSet<T> { private final BitSet set; /** * Creates an empty pool bit set. */ public PoolBitSet(Pool<T> pool) { super(pool); set = new BitSet(pool.length()); } /** * Constructor to be used by subclasses for implementing {@link #clone()}. */ protected PoolBitSet(PoolBitSet<T> toBeCloned) { super(toBeCloned.pool()); set = (BitSet) toBeCloned.set.clone(); } @Override public boolean contains(T value) { if (value == null) { return false; } assert pool.get(value.serial()) == value; return set.get(value.serial()); } @Override public int size() { return set.cardinality(); } @Override public void clear() { set.clear(); } @Override public boolean isEmpty() { return set.isEmpty(); } @Override public void add(T value) { assert pool.get(value.serial()) == value; set.set(value.serial()); } @Override public PoolBitSet<T> addAll() { set.set(0, pool.length()); return this; } @Override public void or(PoolSet<T> others) { if (others instanceof PoolBitSet) { final PoolBitSet otherPoolBitSet = (PoolBitSet) others; set.or(otherPoolBitSet.set); } else { for (T element : others) { add(element); } } } @Override public boolean remove(T value) { assert pool.get(value.serial()) == value; final boolean present = set.get(value.serial()); set.clear(value.serial()); return present; } @Override public T removeOne() { final int index = set.nextSetBit(0); if (index < 0) { throw new NoSuchElementException(); } set.clear(index); return pool.get(index); } @Override public void and(PoolSet<T> others) { if (others instanceof PoolBitSet) { final PoolBitSet otherPoolBitSet = (PoolBitSet) others; set.and(otherPoolBitSet.set); } else { for (int i = set.nextSetBit(0); i >= 0; i = set.nextSetBit(i + 1)) { if (!others.contains(pool.get(i))) { set.clear(i); } } } } @Override public boolean containsAll(PoolSet<T> others) { for (T value : others) { if (!contains(value)) { return false; } } return true; } @Override public PoolSet<T> clone() { return new PoolBitSet<>(this); } /** * Gets an iterator over all the values in this set. */ public Iterator<T> iterator() { return new Iterator<T>() { private int currentBit = -1; private int nextSetBit = set.nextSetBit(0); public boolean hasNext() { return nextSetBit != -1; } public T next() { if (!hasNext()) { throw new NoSuchElementException(); } currentBit = nextSetBit; nextSetBit = set.nextSetBit(nextSetBit + 1); return pool.get(currentBit); } public void remove() { if (currentBit == -1) { throw new IllegalStateException(); } set.clear(currentBit); currentBit = -1; } }; } }