gnu.trove.TShortHashSet Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of trove4j Show documentation
Show all versions of trove4j Show documentation
The Trove library provides high speed regular and primitive
collections for Java.
///////////////////////////////////////////////////////////////////////////////
// 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 short primitives.
*
* @author Eric D. Friedman
* @author Rob Eden
*/
public class TShortHashSet extends TShortHash implements Externalizable {
static final long serialVersionUID = 1L;
/**
* Creates a new TShortHashSet instance with the default
* capacity and load factor.
*/
public TShortHashSet() {
super();
}
/**
* Creates a new TShortHashSet instance with a prime
* capacity equal to or greater than initialCapacity and
* with the default load factor.
*
* @param initialCapacity an int value
*/
public TShortHashSet(int initialCapacity) {
super(initialCapacity);
}
/**
* Creates a new TShortHashSet 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 TShortHashSet(int initialCapacity, float loadFactor) {
super(initialCapacity, loadFactor);
}
/**
* Creates a new TShortHashSet instance containing the
* elements of array.
*
* @param array an array of short primitives
*/
public TShortHashSet(short[] array) {
this(array.length);
addAll(array);
}
/**
* Creates a new TShortHash instance with the default
* capacity and load factor.
* @param strategy used to compute hash codes and to compare keys.
*/
public TShortHashSet(TShortHashingStrategy strategy) {
super(strategy);
}
/**
* Creates a new TShortHash 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 TShortHashSet(int initialCapacity, TShortHashingStrategy strategy) {
super(initialCapacity, strategy);
}
/**
* Creates a new TShortHash 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 TShortHashSet(int initialCapacity, float loadFactor, TShortHashingStrategy strategy) {
super(initialCapacity, loadFactor, strategy);
}
/**
* Creates a new TShortHashSet instance containing the
* elements of array.
*
* @param array an array of short primitives
* @param strategy used to compute hash codes and to compare keys.
*/
public TShortHashSet(short[] array, TShortHashingStrategy strategy) {
this(array.length, strategy);
addAll(array);
}
/**
* @return a TShortIterator with access to the values in this set
*/
public TShortIterator iterator() {
return new TShortIterator(this);
}
/**
* Inserts a value into the set.
*
* @param val an short value
* @return true if the set was modified by the add operation
*/
public boolean add(short 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;
short oldSet[] = _set;
byte oldStates[] = _states;
_set = new short[newCapacity];
_states = new byte[newCapacity];
for (int i = oldCapacity; i-- > 0;) {
if(oldStates[i] == FULL) {
short 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 short[] value
*/
public short[] toArray() {
short[] result = new short[size()];
short[] 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();
short[] set = _set;
byte[] states = _states;
for (int i = set.length; i-- > 0;) {
set[i] = (short)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 TShortHashSet)) {
return false;
}
final TShortHashSet that = (TShortHashSet)other;
if (that.size() != this.size()) {
return false;
}
return forEach(new TShortProcedure() {
public final boolean execute(short value) {
return that.contains(value);
}
});
}
public int hashCode() {
HashProcedure p = new HashProcedure();
forEach(p);
return p.getHashCode();
}
private final class HashProcedure implements TShortProcedure {
private int h = 0;
public int getHashCode() {
return h;
}
public final boolean execute(short key) {
h += _hashingStrategy.computeHashCode(key);
return true;
}
}
/**
* Removes val from the set.
*
* @param val an short value
* @return true if the set was modified by the remove operation.
*/
public boolean remove(short 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 short primitives.
* @return true if all elements were present in the set.
*/
public boolean containsAll(short[] 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 short primitives.
* @return true if the set was modified by the add all operation.
*/
public boolean addAll(short[] 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 short primitives.
* @return true if the set was modified by the remove all operation.
*/
public boolean removeAll(short[] 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 short primitives.
* @return true if the set was modified by the retain all operation
*/
public boolean retainAll(short[] array) {
boolean changed = false;
Arrays.sort(array);
short[] 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) {
short val = in.readShort();
add(val);
}
}
} // TShortHashSet