it.unimi.dsi.fastutil.doubles
Class DoubleOpenHashBigSet

java.lang.Object
  extended by java.util.AbstractCollection<Double>
      extended by it.unimi.dsi.fastutil.doubles.AbstractDoubleCollection
          extended by it.unimi.dsi.fastutil.doubles.AbstractDoubleSet
              extended by it.unimi.dsi.fastutil.doubles.DoubleOpenHashBigSet
All Implemented Interfaces:
DoubleCollection, DoubleIterable, DoubleSet, Hash, Size64, Serializable, Cloneable, Iterable<Double>, Collection<Double>, Set<Double>

public class DoubleOpenHashBigSet
extends AbstractDoubleSet
implements Serializable, Cloneable, Hash, Size64

A type-specific hash big set with with a fast, small-footprint implementation.

Instances of this class use a hash table to represent a big set: the number of elements in the set is limited only by the amount of core memory. The table is backed by a big array and 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 method lets you control the size of the table; this is particularly useful if you reuse instances of this class.

The methods of this class are about 30% slower than those of the corresponding non-big set.

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
protected  int baseMask
          The mask for wrapping a base counter.
protected  float f
          The acceptable load factor.
protected  double[][] key
          The big array of keys.
protected  long mask
          The mask for wrapping a position counter.
protected  long maxFill
          Threshold after which we rehash.
protected  long n
          The current table size (always a power of 2).
protected  int segmentMask
          The mask for wrapping a segment counter.
static long serialVersionUID
           
protected  long size
          Number of entries in the set.
protected  boolean[][] used
          The big array telling whether a position is used.
 
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
DoubleOpenHashBigSet()
          Creates a new hash big set with initial expected Hash.DEFAULT_INITIAL_SIZE elements and Hash.DEFAULT_LOAD_FACTOR as load factor.
DoubleOpenHashBigSet(Collection<? extends Double> c)
          Creates a new hash big set with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given collection.
DoubleOpenHashBigSet(Collection<? extends Double> c, float f)
          Creates a new hash big set copying a given collection.
DoubleOpenHashBigSet(double[] a)
          Creates a new hash big set with Hash.DEFAULT_LOAD_FACTOR as load factor copying the elements of an array.
DoubleOpenHashBigSet(double[] a, float f)
          Creates a new hash big set copying the elements of an array.
DoubleOpenHashBigSet(double[] a, int offset, int length)
          Creates a new hash big set with Hash.DEFAULT_LOAD_FACTOR as load factor and fills it with the elements of a given array.
DoubleOpenHashBigSet(double[] a, int offset, int length, float f)
          Creates a new hash big set and fills it with the elements of a given array.
DoubleOpenHashBigSet(DoubleCollection c)
          Creates a new hash big set with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific collection.
DoubleOpenHashBigSet(DoubleCollection c, float f)
          Creates a new hash big set copying a given type-specific collection.
DoubleOpenHashBigSet(DoubleIterator i)
          Creates a new hash big set with Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by a type-specific iterator.
DoubleOpenHashBigSet(DoubleIterator i, float f)
          Creates a new hash big set using elements provided by a type-specific iterator.
DoubleOpenHashBigSet(Iterator<?> i)
          Creates a new hash big set with Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by an iterator.
DoubleOpenHashBigSet(Iterator<?> i, float f)
          Creates a new hash big set using elements provided by an iterator.
DoubleOpenHashBigSet(long expected)
          Creates a new hash big set with Hash.DEFAULT_LOAD_FACTOR as load factor.
DoubleOpenHashBigSet(long expected, float f)
          Creates a new hash big set.
 
Method Summary
 boolean add(double k)
           
 void clear()
           
 DoubleOpenHashBigSet clone()
          Returns a deep copy of this big set.
 boolean contains(double k)
           
 int hashCode()
          Returns a hash code for this set.
 boolean isEmpty()
           
 DoubleIterator iterator()
          Returns a type-specific iterator on the elements of this collection.
 boolean rehash()
          Deprecated. A no-op.
protected  void rehash(long newN)
          Resizes the set.
 boolean remove(double k)
          Removes an element from this set.
protected  long shiftKeys(long pos)
          Shifts left entries with the specified hash code, starting at the specified position, and empties the resulting free entry.
 int size()
          Deprecated. 
 long size64()
          Returns the size of this data structure as a long.
 boolean trim()
          Rehashes this set, making the table as small as possible.
 boolean trim(long n)
          Rehashes this set if the table is too large.
 
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDoubleSet
equals, rem, remove
 
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDoubleCollection
add, addAll, addAll, contains, containsAll, containsAll, doubleIterator, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toDoubleArray, toDoubleArray, toString
 
Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait
 
Methods inherited from interface it.unimi.dsi.fastutil.doubles.DoubleCollection
addAll, containsAll, doubleIterator, removeAll, retainAll, toArray, toArray, toDoubleArray, toDoubleArray
 
Methods inherited from interface java.util.Set
add, addAll, contains, containsAll, removeAll, retainAll, toArray, toArray
 

Field Detail

serialVersionUID

public static final long serialVersionUID
See Also:
Constant Field Values

key

protected transient double[][] key
The big array of keys.


used

protected transient boolean[][] used
The big array telling whether a position is used.


f

protected final float f
The acceptable load factor.


n

protected transient long n
The current table size (always a power of 2).


maxFill

protected transient long maxFill
Threshold after which we rehash. It must be the table size times f.


mask

protected transient long mask
The mask for wrapping a position counter.


segmentMask

protected transient int segmentMask
The mask for wrapping a segment counter.


baseMask

protected transient int baseMask
The mask for wrapping a base counter.


size

protected long size
Number of entries in the set.

Constructor Detail

DoubleOpenHashBigSet

public DoubleOpenHashBigSet(long expected,
                            float f)
Creates a new hash big 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 set.
f - the load factor.

DoubleOpenHashBigSet

public DoubleOpenHashBigSet(long expected)
Creates a new hash big set with Hash.DEFAULT_LOAD_FACTOR as load factor.

Parameters:
expected - the expected number of elements in the hash big set.

DoubleOpenHashBigSet

public DoubleOpenHashBigSet()
Creates a new hash big set with initial expected Hash.DEFAULT_INITIAL_SIZE elements and Hash.DEFAULT_LOAD_FACTOR as load factor.


DoubleOpenHashBigSet

public DoubleOpenHashBigSet(Collection<? extends Double> c,
                            float f)
Creates a new hash big set copying a given collection.

Parameters:
c - a Collection to be copied into the new hash big set.
f - the load factor.

DoubleOpenHashBigSet

public DoubleOpenHashBigSet(Collection<? extends Double> c)
Creates a new hash big set with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given collection.

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

DoubleOpenHashBigSet

public DoubleOpenHashBigSet(DoubleCollection c,
                            float f)
Creates a new hash big set copying a given type-specific collection.

Parameters:
c - a type-specific collection to be copied into the new hash big set.
f - the load factor.

DoubleOpenHashBigSet

public DoubleOpenHashBigSet(DoubleCollection c)
Creates a new hash big 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 big set.

DoubleOpenHashBigSet

public DoubleOpenHashBigSet(DoubleIterator i,
                            float f)
Creates a new hash big set using elements provided by a type-specific iterator.

Parameters:
i - a type-specific iterator whose elements will fill the new hash big set.
f - the load factor.

DoubleOpenHashBigSet

public DoubleOpenHashBigSet(DoubleIterator i)
Creates a new hash big 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 new hash big set.

DoubleOpenHashBigSet

public DoubleOpenHashBigSet(Iterator<?> i,
                            float f)
Creates a new hash big set using elements provided by an iterator.

Parameters:
i - an iterator whose elements will fill the new hash big set.
f - the load factor.

DoubleOpenHashBigSet

public DoubleOpenHashBigSet(Iterator<?> i)
Creates a new hash big set with Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by an iterator.

Parameters:
i - an iterator whose elements will fill the new hash big set.

DoubleOpenHashBigSet

public DoubleOpenHashBigSet(double[] a,
                            int offset,
                            int length,
                            float f)
Creates a new hash big set and fills it with the elements of a given array.

Parameters:
a - an array whose elements will be used to fill the new hash big set.
offset - the first element to use.
length - the number of elements to use.
f - the load factor.

DoubleOpenHashBigSet

public DoubleOpenHashBigSet(double[] a,
                            int offset,
                            int length)
Creates a new hash big 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 new hash big set.
offset - the first element to use.
length - the number of elements to use.

DoubleOpenHashBigSet

public DoubleOpenHashBigSet(double[] a,
                            float f)
Creates a new hash big set copying the elements of an array.

Parameters:
a - an array to be copied into the new hash big set.
f - the load factor.

DoubleOpenHashBigSet

public DoubleOpenHashBigSet(double[] a)
Creates a new hash big 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 big set.
Method Detail

add

public boolean add(double k)
Specified by:
add in interface DoubleCollection
Overrides:
add in class AbstractDoubleCollection
See Also:
Collection.add(Object)

shiftKeys

protected final long shiftKeys(long pos)
Shifts left entries with the specified hash code, starting at the specified position, and empties the resulting free entry.

Parameters:
pos - a starting position.
Returns:
the position cleared by the shifting process.

remove

public boolean remove(double k)
Description copied from interface: DoubleSet
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 DoubleSet
Overrides:
remove in class AbstractDoubleSet
See Also:
Collection.remove(Object)

contains

public boolean contains(double k)
Specified by:
contains in interface DoubleCollection
Overrides:
contains in class AbstractDoubleCollection
See Also:
Collection.contains(Object)

clear

public void clear()
Specified by:
clear in interface Collection<Double>
Specified by:
clear in interface Set<Double>
Overrides:
clear in class AbstractCollection<Double>

iterator

public DoubleIterator iterator()
Description copied from interface: DoubleCollection
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 DoubleCollection
Specified by:
iterator in interface DoubleIterable
Specified by:
iterator in interface DoubleSet
Specified by:
iterator in interface Iterable<Double>
Specified by:
iterator in interface Collection<Double>
Specified by:
iterator in interface Set<Double>
Specified by:
iterator in class AbstractDoubleSet
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(long)

trim

public boolean trim(long n)
Rehashes this set if the table is too large.

Let N be the smallest table size that can hold max(n,size64()) 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()

rehash

protected void rehash(long newN)
Resizes the set.

This method implements the basic rehashing strategy, and may be overriden by subclasses implementing different rehashing strategies (e.g., disk-based rehashing). However, you should not override this method unless you understand the internal workings of this class.

Parameters:
newN - the new size

size

@Deprecated
public int size()
Deprecated. 

Description copied from interface: Size64
Returns the size of this data structure, minimized with Integer.MAX_VALUE.

Specified by:
size in interface Size64
Specified by:
size in interface Collection<Double>
Specified by:
size in interface Set<Double>
Specified by:
size in class AbstractCollection<Double>
Returns:
the size of this data structure, minimized with Integer.MAX_VALUE.
See Also:
Collection.size()

size64

public long size64()
Description copied from interface: Size64
Returns the size of this data structure as a long.

Specified by:
size64 in interface Size64
Returns:
the size of this data structure.

isEmpty

public boolean isEmpty()
Specified by:
isEmpty in interface Collection<Double>
Specified by:
isEmpty in interface Set<Double>
Overrides:
isEmpty in class AbstractDoubleCollection

clone

public DoubleOpenHashBigSet clone()
Returns a deep copy of this big set.

This method performs a deep copy of this big 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 big 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<Double>
Specified by:
hashCode in interface Set<Double>
Overrides:
hashCode in class AbstractDoubleSet
Returns:
a hash code for this set.


Copyright © 2011. All Rights Reserved.