it.unimi.dsi.fastutil.longs

Class LongOpenHashSet

java.lang.Object

java.util.AbstractCollection<Long>

it.unimi.dsi.fastutil.longs.AbstractLongCollection

it.unimi.dsi.fastutil.longs.AbstractLongSet

it.unimi.dsi.fastutil.longs.LongOpenHashSet

All Implemented Interfaces:

Hash, LongCollection, LongIterable, LongSet, Serializable, Cloneable, Iterable<Long>, Collection<Long>, Set<Long>

public class LongOpenHashSet
extends AbstractLongSet
implements Serializable, Cloneable, Hash

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 by doubling its size 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.

Warning: The implementation of this class has significantly changed in fastutil 6.1.0. Please read the comments about this issue in the section “Faster Hash Tables” of the overview.

See Also:

Hash, HashCommon, Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.Hash

Hash.Strategy<K>

Field Summary

Fields inherited from interface it.unimi.dsi.fastutil.Hash

DEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR

Constructor Summary

Constructors

Constructor and Description
LongOpenHashSet() Creates a new hash set with initial expected Hash.DEFAULT_INITIAL_SIZE elements and Hash.DEFAULT_LOAD_FACTOR as load factor.
LongOpenHashSet(Collection<? extends Long> c) Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given collection.
LongOpenHashSet(Collection<? extends Long> c, float f) Creates a new hash set copying a given collection.
LongOpenHashSet(int expected) Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor.
LongOpenHashSet(int expected, float f) Creates a new hash set.
LongOpenHashSet(Iterator<?> i) Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by an iterator.
LongOpenHashSet(Iterator<?> i, float f) Creates a new hash set using elements provided by an iterator.
LongOpenHashSet(long[] a) Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor copying the elements of an array.
LongOpenHashSet(long[] a, float f) Creates a new hash set copying the elements of an array.
LongOpenHashSet(long[] a, int offset, int length) Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor and fills it with the elements of a given array.
LongOpenHashSet(long[] a, int offset, int length, float f) Creates a new hash set and fills it with the elements of a given array.
LongOpenHashSet(LongCollection c) Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific collection.
LongOpenHashSet(LongCollection c, float f) Creates a new hash set copying a given type-specific collection.
LongOpenHashSet(LongIterator i) Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by a type-specific iterator.
LongOpenHashSet(LongIterator i, float f) Creates a new hash set using elements provided by a type-specific iterator.

Method Summary

Methods

Modifier and Type	Method and Description
boolean	add(long k)
void	clear()
LongOpenHashSet	clone() Returns a deep copy of this set.
boolean	contains(long k)
int	growthFactor() Deprecated. Since fastutil 6.1.0, hash tables are doubled when they are too full.
void	growthFactor(int growthFactor) Deprecated. Since fastutil 6.1.0, hash tables are doubled when they are too full.
int	hashCode() Returns a hash code for this set.
boolean	isEmpty()
LongIterator	iterator() Returns a type-specific iterator on the elements of this collection.
boolean	rehash() Deprecated. A no-op.
boolean	remove(long k) Removes an element from this set.
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.longs.AbstractLongSet

equals, rem, remove

Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLongCollection

add, addAll, addAll, contains, containsAll, containsAll, longIterator, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toLongArray, toLongArray, toString

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface it.unimi.dsi.fastutil.longs.LongCollection

addAll, containsAll, longIterator, removeAll, retainAll, toArray, toArray, toLongArray, toLongArray

Methods inherited from interface java.util.Set

add, addAll, contains, containsAll, removeAll, retainAll, toArray, toArray

Constructor Detail

LongOpenHashSet

public LongOpenHashSet(int expected,
               float f)

Creates a new hash set.

The actual table size will be the least power of two greater than expected/f.

Parameters:

expected - the expected number of elements in the hash set.

f - the load factor.

LongOpenHashSet

public LongOpenHashSet(int expected)

Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor.

Parameters:

expected - the expected number of elements in the hash set.

LongOpenHashSet

public LongOpenHashSet()

Creates a new hash set with initial expected Hash.DEFAULT_INITIAL_SIZE elements and Hash.DEFAULT_LOAD_FACTOR as load factor.

LongOpenHashSet

public LongOpenHashSet(Collection<? extends Long> c,
               float f)

Creates a new hash set copying a given collection.

Parameters:

c - a Collection to be copied into the new hash set.

f - the load factor.

LongOpenHashSet

public LongOpenHashSet(Collection<? extends Long> c)

Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given collection.

Parameters:

c - a Collection to be copied into the new hash set.

LongOpenHashSet

public LongOpenHashSet(LongCollection c,
               float f)

Creates a new hash set copying a given type-specific collection.

Parameters:

c - a type-specific collection to be copied into the new hash set.

f - the load factor.

LongOpenHashSet

public LongOpenHashSet(LongCollection c)

Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific collection.

Parameters:

c - a type-specific collection to be copied into the new hash set.

LongOpenHashSet

public LongOpenHashSet(LongIterator i,
               float f)

Creates a new hash set using elements provided by a type-specific iterator.

Parameters:

i - a type-specific iterator whose elements will fill the set.

f - the load factor.

LongOpenHashSet

public LongOpenHashSet(LongIterator i)

Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by a type-specific iterator.

Parameters:

i - a type-specific iterator whose elements will fill the set.

LongOpenHashSet

public LongOpenHashSet(Iterator<?> i,
               float f)

Creates a new hash set using elements provided by an iterator.

Parameters:

i - an iterator whose elements will fill the set.

f - the load factor.

LongOpenHashSet

public LongOpenHashSet(Iterator<?> i)

Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by an iterator.

Parameters:

i - an iterator whose elements will fill the set.

LongOpenHashSet

public LongOpenHashSet(long[] a,
               int offset,
               int length,
               float f)

Creates a new hash set and fills it with the elements of a given array.

Parameters:

a - an array whose elements will be used to fill the set.

offset - the first element to use.

length - the number of elements to use.

f - the load factor.

LongOpenHashSet

public LongOpenHashSet(long[] a,
               int offset,
               int length)

Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor and fills it with the elements of a given array.

Parameters:

a - an array whose elements will be used to fill the set.

offset - the first element to use.

length - the number of elements to use.

LongOpenHashSet

public LongOpenHashSet(long[] a,
               float f)

Creates a new hash set copying the elements of an array.

Parameters:

a - an array to be copied into the new hash set.

f - the load factor.

LongOpenHashSet

public LongOpenHashSet(long[] a)

Creates a new hash set with Hash.DEFAULT_LOAD_FACTOR as load factor copying the elements of an array.

Parameters:

a - an array to be copied into the new hash set.

Method Detail

add

public boolean add(long k)

Specified by:

add in interface LongCollection

Overrides:

add in class AbstractLongCollection

See Also:

Collection.add(Object)

remove

public boolean remove(long k)

Description copied from interface: LongSet

Removes an element from this set.

Note that the corresponding method of the type-specific collection is rem(). This unfortunate situation is caused by the clash with the similarly named index-based method in the List interface.

Specified by:

remove in interface LongSet

Overrides:

remove in class AbstractLongSet

See Also:

Collection.remove(Object)

contains

public boolean contains(long k)

Specified by:

contains in interface LongCollection

Overrides:

contains in class AbstractLongCollection

See Also:

Collection.contains(Object)

clear

public void clear()

Specified by:

clear in interface Collection<Long>

Specified by:

clear in interface Set<Long>

Overrides:

clear in class AbstractCollection<Long>

size

public int size()

Specified by:

size in interface Collection<Long>

Specified by:

size in interface Set<Long>

Specified by:

size in class AbstractCollection<Long>

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Collection<Long>

Specified by:

isEmpty in interface Set<Long>

Overrides:

isEmpty in class AbstractLongCollection

growthFactor

@Deprecated
public void growthFactor(int growthFactor)

Deprecated. Since fastutil 6.1.0, hash tables are doubled when they are too full.

A no-op for backward compatibility.

Parameters:

growthFactor - unused.

growthFactor

@Deprecated
public int growthFactor()

Deprecated. Since fastutil 6.1.0, hash tables are doubled when they are too full.

Gets the growth factor (2).

Returns:

the growth factor of this set, which is fixed (2).

See Also:

growthFactor(int)

iterator

public LongIterator iterator()

Description copied from interface: LongCollection

Returns a type-specific iterator on the elements of this collection.

Note that this specification strengthens the one given in Iterable.iterator(), which was already strengthened in the corresponding type-specific class, but was weakened by the fact that this interface extends Collection.

Specified by:

iterator in interface LongCollection

Specified by:

iterator in interface LongIterable

Specified by:

iterator in interface LongSet

Specified by:

iterator in interface Iterable<Long>

Specified by:

iterator in interface Collection<Long>

Specified by:

iterator in interface Set<Long>

Specified by:

iterator in class AbstractLongSet

Returns:

a type-specific iterator on the elements of this collection.

rehash

@Deprecated
public boolean rehash()

Deprecated. A no-op.

A no-op for backward compatibility. The kind of tables implemented by this class never need rehashing.

If you need to reduce the table size to fit exactly this set, use trim().

Returns:

true.

See Also:

trim()

trim

public boolean trim()

Rehashes this set, making the table as small as possible.

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 optimize access speed and size.

If the table size is already the minimum possible, this method does nothing.

Returns:

true if there was enough memory to trim the set.

See Also:

trim(int)

trim

public boolean trim(int n)

Rehashes this set if the table is too large.

Let N be the smallest table size that can hold max(n,size()) entries, still satisfying the load factor. If the current table size is smaller than or equal to 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.

Parameters:

n - the threshold for the trimming.

Returns:

true if there was enough memory to trim the set.

See Also:

trim()

clone

public LongOpenHashSet clone()

Returns a deep copy of this set.

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.

Overrides:

clone in class Object

Returns:

a deep copy of this set.

hashCode

public int hashCode()

Returns a hash code for this set. This method overrides the generic method provided by the superclass. Since 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.

Specified by:

hashCode in interface Collection<Long>

Specified by:

hashCode in interface Set<Long>

Overrides:

hashCode in class AbstractLongSet

Returns:

a hash code for this set.