|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.booleans.AbstractBooleanCollection
it.unimi.dsi.fastutil.booleans.AbstractBooleanSet
it.unimi.dsi.fastutil.booleans.BooleanOpenHashSet
A type-specific hash set with with a fast, small-footprint implementation.
Instances of this class use a hash table to represent a set. The table is
enlarged as needed when new entries are created, but it is never made
smaller (even on a clear()
). A family of trimming
methods lets you control the size of the table; this is particularly useful
if you reuse instances of this class.
The enlargement speed is controlled by the growth factor, a
positive number. If the growth factor is p, then the table is
enlarged each time roughly by a factor 2p/16. By default, p is
Hash.DEFAULT_GROWTH_FACTOR
, which means that the table is doubled at
each enlargement, but one can easily set more or less aggressive policies by
calling growthFactor(int)
(note that the growth factor is not serialised:
deserialised tables gets the default growth factor).
Hash
,
HashCommon
,
Serialized FormField Summary | |
static long |
serialVersionUID
|
Fields inherited from interface it.unimi.dsi.fastutil.Hash |
DEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED |
Constructor Summary | |
BooleanOpenHashSet()
Creates a new hash set with Hash.DEFAULT_INITIAL_SIZE elements
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
|
BooleanOpenHashSet(boolean[] a)
Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor
copying the elements of an array. |
|
BooleanOpenHashSet(boolean[] a,
float f)
Creates a new set copying the elements of an array. |
|
BooleanOpenHashSet(BooleanCollection c)
Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given type-specific collection. |
|
BooleanOpenHashSet(BooleanCollection c,
float f)
Creates a new hash set copying a given type-specific collection. |
|
BooleanOpenHashSet(BooleanIterator i)
Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by a type-specific iterator. |
|
BooleanOpenHashSet(BooleanIterator i,
float f)
Creates a new hash set using elements provided by a type-specific iterator. |
|
BooleanOpenHashSet(Collection c)
Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given collection. |
|
BooleanOpenHashSet(Collection c,
float f)
Creates a new hash set copying a given collection. |
|
BooleanOpenHashSet(int n)
Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor. |
|
BooleanOpenHashSet(int n,
float f)
Creates a new hash set. |
|
BooleanOpenHashSet(Iterator i)
Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by an iterator. |
|
BooleanOpenHashSet(Iterator i,
float f)
Creates a new hash set using elements provided by an iterator. |
Method Summary | |
boolean |
add(boolean k)
|
BooleanIterator |
booleanIterator()
Returns a type-specific iterator on the collection. |
void |
clear()
|
Object |
clone()
Returns a deep copy of this set. |
boolean |
contains(boolean k)
|
int |
growthFactor()
Gets the growth factor. |
void |
growthFactor(int growthFactor)
Sets the growth factor. |
int |
hashCode()
Returns a hash code for this set. |
boolean |
isEmpty()
|
boolean |
rehash()
Rehashes this set without changing the table size. |
boolean |
remove(boolean k)
|
int |
size()
|
boolean |
trim()
Rehashes this set, making the table as small as possible. |
boolean |
trim(int n)
Rehashes this set if the table is too large. |
Methods inherited from class it.unimi.dsi.fastutil.booleans.AbstractBooleanSet |
equals, iterator |
Methods inherited from class it.unimi.dsi.fastutil.booleans.AbstractBooleanCollection |
add, addAll, addAll, contains, containsAll, containsAll, iterator, remove, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toBooleanArray, toBooleanArray, toString |
Methods inherited from class java.lang.Object |
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface java.util.Set |
add, addAll, contains, containsAll, equals, iterator, remove, removeAll, retainAll, toArray, toArray |
Methods inherited from interface it.unimi.dsi.fastutil.booleans.BooleanCollection |
addAll, containsAll, removeAll, retainAll, toArray, toBooleanArray, toBooleanArray |
Field Detail |
public static final long serialVersionUID
Constructor Detail |
public BooleanOpenHashSet(int n, float f)
n
/f
.
n
- the expected number of elements in the hash set.f
- the load factor.Hash.PRIMES
public BooleanOpenHashSet(int n)
Hash.DEFAULT_LOAD_FACTOR
as load factor.
n
- the expected number of elements in the hash set.public BooleanOpenHashSet()
Hash.DEFAULT_INITIAL_SIZE
elements
and Hash.DEFAULT_LOAD_FACTOR
as load factor.
public BooleanOpenHashSet(Collection c, float f)
c
- a Collection
to be copied into the new hash set.f
- the load factor.public BooleanOpenHashSet(Collection c)
Hash.DEFAULT_LOAD_FACTOR
as load factor
copying a given collection.
c
- a Collection
to be copied into the new hash set.public BooleanOpenHashSet(BooleanCollection c, float f)
c
- a type-specific collection to be copied into the new hash set.f
- the load factor.public BooleanOpenHashSet(BooleanCollection c)
Hash.DEFAULT_LOAD_FACTOR
as load factor
copying a given type-specific collection.
c
- a type-specific collection to be copied into the new hash set.public BooleanOpenHashSet(BooleanIterator i, float f)
i
- a type-specific iterator whose elements will fill the set.f
- the load factor.public BooleanOpenHashSet(BooleanIterator i)
Hash.DEFAULT_LOAD_FACTOR
as load factor using elements provided by a type-specific iterator.
i
- a type-specific iterator whose elements will fill the set.public BooleanOpenHashSet(Iterator i, float f)
i
- an iterator whose elements will fill the set.f
- the load factor.public BooleanOpenHashSet(Iterator i)
Hash.DEFAULT_LOAD_FACTOR
as load factor using elements provided by an iterator.
i
- an iterator whose elements will fill the set.public BooleanOpenHashSet(boolean[] a, float f)
a
- an array to be copied into the new hash set.f
- the load factor.public BooleanOpenHashSet(boolean[] a)
Hash.DEFAULT_LOAD_FACTOR
as load factor
copying the elements of an array.
a
- an array to be copied into the new hash set.Method Detail |
public void growthFactor(int growthFactor)
growthFactor
- the new growth factor; it must be positive.public int growthFactor()
public boolean add(boolean k)
add
in interface BooleanCollection
add
in class AbstractBooleanCollection
public boolean remove(boolean k)
remove
in interface BooleanCollection
remove
in class AbstractBooleanCollection
public boolean contains(boolean k)
contains
in interface BooleanCollection
Collection.contains(Object)
public void clear()
clear
in interface Set
public BooleanIterator booleanIterator()
BooleanCollection
The iterator returned by the Collection.iterator()
method and by this
method are identical; however, using this method you can save a type casting.
booleanIterator
in interface BooleanCollection
Collection.iterator()
public boolean rehash()
This method should be called when the set underwent numerous deletions and insertions. In this case, free entries become rare, and unsuccessful searches require probing all entries. For reasonable load factors this method is linear in the number of entries. You will need as much additional free memory as that occupied by the table.
If you need to reduce the table siza to fit exactly
this set, you must use trim()
.
trim()
public boolean trim()
This method rehashes the table to the smallest size satisfying the load factor. It can be used when the set will not be changed anymore, so to optimise access speed (by collecting deleted entries) and size.
If the table size is already the minimum possible, this method
does nothing. If you want to guarantee rehashing, use rehash()
.
trim(int)
,
rehash()
public boolean trim(int n)
Let N be the smallest table size that can hold
n
entries, still satisfying the load factor. If the current
table size is smaller than or equal to N, or if the number of
elements of this set is larger than n
, this method does
nothing. Otherwise, it rehashes this set in a table of size
N.
This method is useful when reusing sets. Clearing a set leaves the table size untouched. If you are reusing a set many times, you can call this method with a typical size to avoid keeping around a very large table just because of a few large transient sets.
n
- the threshold for the trimming.
trim()
,
rehash()
public int size()
size
in interface Set
public boolean isEmpty()
isEmpty
in interface Set
isEmpty
in class AbstractBooleanCollection
public Object clone()
This method performs a deep copy of this hash set; the data stored in the set, however, is not cloned. Note that this makes a difference only for object keys.
public int hashCode()
equals()
is not overriden, it is important
that the value returned by this method is the same value as
the one returned by the overriden method.
hashCode
in interface Set
hashCode
in class AbstractBooleanSet
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |