gnu.trove.TLongHashSet Maven / Gradle / Ivy
///////////////////////////////////////////////////////////////////////////////
// Copyright (c) 2001, Eric D. Friedman All Rights Reserved.
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
//
// This library 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 for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
///////////////////////////////////////////////////////////////////////////////
package gnu.trove;
import java.io.IOException;
import java.io.ObjectInput;
import java.io.ObjectOutput;
import java.io.Externalizable;
import java.util.Arrays;
//////////////////////////////////////////////////
// THIS IS A GENERATED CLASS. DO NOT HAND EDIT! //
//////////////////////////////////////////////////
/**
* An open addressed set implementation for long primitives.
*
* @author Eric D. Friedman
* @author Rob Eden
*/
public class TLongHashSet extends TLongHash implements Externalizable {
static final long serialVersionUID = 1L;
/**
* Creates a new TLongHashSet instance with the default
* capacity and load factor.
*/
public TLongHashSet() {
super();
}
/**
* Creates a new TLongHashSet instance with a prime
* capacity equal to or greater than initialCapacity and
* with the default load factor.
*
* @param initialCapacity an int value
*/
public TLongHashSet(int initialCapacity) {
super(initialCapacity);
}
/**
* Creates a new TLongHashSet instance with a prime
* capacity equal to or greater than initialCapacity and
* with the specified load factor.
*
* @param initialCapacity an int value
* @param loadFactor a float value
*/
public TLongHashSet(int initialCapacity, float loadFactor) {
super(initialCapacity, loadFactor);
}
/**
* Creates a new TLongHashSet instance containing the
* elements of array.
*
* @param array an array of long primitives
*/
public TLongHashSet(long[] array) {
this(array.length);
addAll(array);
}
/**
* Creates a new TLongHash instance with the default
* capacity and load factor.
* @param strategy used to compute hash codes and to compare keys.
*/
public TLongHashSet(TLongHashingStrategy strategy) {
super(strategy);
}
/**
* Creates a new TLongHash instance whose capacity
* is the next highest prime above initialCapacity + 1
* unless that value is already prime.
*
* @param initialCapacity an int value
* @param strategy used to compute hash codes and to compare keys.
*/
public TLongHashSet(int initialCapacity, TLongHashingStrategy strategy) {
super(initialCapacity, strategy);
}
/**
* Creates a new TLongHash instance with a prime
* value at or near the specified capacity and load factor.
*
* @param initialCapacity used to find a prime capacity for the table.
* @param loadFactor used to calculate the threshold over which
* rehashing takes place.
* @param strategy used to compute hash codes and to compare keys.
*/
public TLongHashSet(int initialCapacity, float loadFactor, TLongHashingStrategy strategy) {
super(initialCapacity, loadFactor, strategy);
}
/**
* Creates a new TLongHashSet instance containing the
* elements of array.
*
* @param array an array of long primitives
* @param strategy used to compute hash codes and to compare keys.
*/
public TLongHashSet(long[] array, TLongHashingStrategy strategy) {
this(array.length, strategy);
addAll(array);
}
/**
* @return a TLongIterator with access to the values in this set
*/
public TLongIterator iterator() {
return new TLongIterator(this);
}
/**
* Inserts a value into the set.
*
* @param val an long value
* @return true if the set was modified by the add operation
*/
public boolean add(long val) {
int index = insertionIndex(val);
if (index < 0) {
return false; // already present in set, nothing to add
}
byte previousState = _states[index];
_set[index] = val;
_states[index] = FULL;
postInsertHook(previousState == FREE);
return true; // yes, we added something
}
/**
* Expands the set to accommodate new values.
*
* @param newCapacity an int value
*/
protected void rehash(int newCapacity) {
int oldCapacity = _set.length;
long oldSet[] = _set;
byte oldStates[] = _states;
_set = new long[newCapacity];
_states = new byte[newCapacity];
for (int i = oldCapacity; i-- > 0;) {
if(oldStates[i] == FULL) {
long o = oldSet[i];
int index = insertionIndex(o);
_set[index] = o;
_states[index] = FULL;
}
}
}
/**
* Returns a new array containing the values in the set.
*
* @return an long[] value
*/
public long[] toArray() {
long[] result = new long[size()];
long[] set = _set;
byte[] states = _states;
for (int i = states.length, j = 0; i-- > 0;) {
if (states[i] == FULL) {
result[j++] = set[i];
}
}
return result;
}
/**
* Empties the set.
*/
public void clear() {
super.clear();
long[] set = _set;
byte[] states = _states;
for (int i = set.length; i-- > 0;) {
set[i] = (long)0;
states[i] = FREE;
}
}
/**
* Compares this set with another set for equality of their stored
* entries.
*
* @param other an Object value
* @return a boolean value
*/
public boolean equals(Object other) {
if (! (other instanceof TLongHashSet)) {
return false;
}
final TLongHashSet that = (TLongHashSet)other;
if (that.size() != this.size()) {
return false;
}
return forEach(new TLongProcedure() {
public final boolean execute(long value) {
return that.contains(value);
}
});
}
public int hashCode() {
HashProcedure p = new HashProcedure();
forEach(p);
return p.getHashCode();
}
private final class HashProcedure implements TLongProcedure {
private int h = 0;
public int getHashCode() {
return h;
}
public final boolean execute(long key) {
h += _hashingStrategy.computeHashCode(key);
return true;
}
}
/**
* Removes val from the set.
*
* @param val an long value
* @return true if the set was modified by the remove operation.
*/
public boolean remove(long val) {
int index = index(val);
if (index >= 0) {
removeAt(index);
return true;
}
return false;
}
/**
* Tests the set to determine if all of the elements in
* array are present.
*
* @param array an array of long primitives.
* @return true if all elements were present in the set.
*/
public boolean containsAll(long[] array) {
for (int i = array.length; i-- > 0;) {
if (! contains(array[i])) {
return false;
}
}
return true;
}
/**
* Adds all of the elements in array to the set.
*
* @param array an array of long primitives.
* @return true if the set was modified by the add all operation.
*/
public boolean addAll(long[] array) {
boolean changed = false;
for (int i = array.length; i-- > 0;) {
if (add(array[i])) {
changed = true;
}
}
return changed;
}
/**
* Removes all of the elements in array from the set.
*
* @param array an array of long primitives.
* @return true if the set was modified by the remove all operation.
*/
public boolean removeAll(long[] array) {
boolean changed = false;
for (int i = array.length; i-- > 0;) {
if (remove(array[i])) {
changed = true;
}
}
return changed;
}
/**
* Removes any values in the set which are not contained in
* array.
*
* @param array an array of long primitives.
* @return true if the set was modified by the retain all operation
*/
public boolean retainAll(long[] array) {
boolean changed = false;
Arrays.sort(array);
long[] set = _set;
byte[] states = _states;
for (int i = set.length; i-- > 0;) {
if (states[i] == FULL && (Arrays.binarySearch(array,set[i]) < 0)) {
remove(set[i]);
changed = true;
}
}
return changed;
}
public void writeExternal( ObjectOutput out ) throws IOException {
// VERSION
out.writeByte( 0 );
// NUMBER OF ENTRIES
out.writeInt( _size );
// ENTRIES
SerializationProcedure writeProcedure = new SerializationProcedure(out);
if (! forEach(writeProcedure)) {
throw writeProcedure.exception;
}
}
public void readExternal( ObjectInput in )
throws IOException, ClassNotFoundException {
// VERSION
in.readByte();
// NUMBER OF ENTRIES
int size = in.readInt();
// ENTRIES
setUp(size);
while (size-- > 0) {
long val = in.readLong();
add(val);
}
}
} // TLongHashSet