gnu.trove.TDoubleHashSet 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
Fork of trove4j library used in IntelliJ Platform.
The newest version!
///////////////////////////////////////////////////////////////////////////////
// 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.
///////////////////////////////////////////////////////////////////////////////
// THIS FILE IS AUTOGENERATED, PLEASE DO NOT EDIT OR ELSE
package gnu.trove;
import java.io.IOException;
import java.io.ObjectInputStream;
import java.io.ObjectOutputStream;
import java.util.Arrays;
/**
* An open addressed set implementation for double primitives.
*
* Created: Sat Nov 3 10:38:17 2001
*
* @author Eric D. Friedman
*/
public class TDoubleHashSet extends TDoubleHash {
/**
* Creates a new TDoubleHashSet instance with the default
* capacity and load factor.
*/
public TDoubleHashSet() {
}
/**
* Creates a new TDoubleHashSet instance with a prime
* capacity equal to or greater than initialCapacity and
* with the default load factor.
*
* @param initialCapacity an int value
*/
public TDoubleHashSet(int initialCapacity) {
super(initialCapacity);
}
/**
* Creates a new TDoubleHashSet 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 TDoubleHashSet(int initialCapacity, float loadFactor) {
super(initialCapacity, loadFactor);
}
/**
* Creates a new TDoubleHashSet instance containing the
* elements of array.
*
* @param array an array of double primitives
*/
public TDoubleHashSet(double[] array) {
this(array.length);
addAll(array);
}
/**
* Creates a new TDoubleHash instance with the default
* capacity and load factor.
* @param strategy used to compute hash codes and to compare keys.
*/
public TDoubleHashSet(TDoubleHashingStrategy strategy) {
super(strategy);
}
/**
* Creates a new TDoubleHash 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 TDoubleHashSet(int initialCapacity, TDoubleHashingStrategy strategy) {
super(initialCapacity, strategy);
}
/**
* Creates a new TDoubleHash 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 TDoubleHashSet(int initialCapacity, float loadFactor, TDoubleHashingStrategy strategy) {
super(initialCapacity, loadFactor, strategy);
}
/**
* Creates a new TDoubleHashSet instance containing the
* elements of array.
*
* @param array an array of double primitives
* @param strategy used to compute hash codes and to compare keys.
*/
public TDoubleHashSet(double[] array, TDoubleHashingStrategy strategy) {
this(array.length, strategy);
addAll(array);
}
/**
* @return a TDoubleIterator with access to the values in this set
*/
public TDoubleIterator iterator() {
return new TDoubleIterator(this);
}
/**
* Inserts a value into the set.
*
* @param val an double value
* @return true if the set was modified by the add operation
*/
public boolean add(double 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
*/
@Override
protected void rehash(int newCapacity) {
int oldCapacity = capacity();
double[] oldSet = _set;
byte[] oldStates = _states;
_set = new double[newCapacity];
_states = new byte[newCapacity];
for (int i = oldCapacity; i-- > 0;) {
if(oldStates[i] == FULL) {
double 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 double[] value
*/
public double[] toArray() {
double[] result = new double[size()];
double[] set = _set;
byte[] states = _states;
if (states != null) {
for (int i = states.length, j = 0; i-- > 0;) {
if (states[i] == FULL) {
result[j++] = set[i];
}
}
}
return result;
}
/**
* Empties the set.
*/
@Override
public void clear() {
super.clear();
double[] set = _set;
byte[] states = _states;
if (states != null) {
for (int i = set.length; i-- > 0;) {
set[i] = (double)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
*/
@Override
public boolean equals(Object other) {
if (!(other instanceof TDoubleHashSet)) {
return false;
}
final TDoubleHashSet that = (TDoubleHashSet)other;
if (that.size() != size()) {
return false;
}
return forEach(new TDoubleProcedure() {
public final boolean execute(double value) {
return that.contains(value);
}
});
}
@Override
public int hashCode() {
HashProcedure p = new HashProcedure();
forEach(p);
return p.getHashCode();
}
private final class HashProcedure implements TDoubleProcedure {
private int h;
HashProcedure() {
}
public int getHashCode() {
return h;
}
public final boolean execute(double key) {
h += _hashingStrategy.computeHashCode(key);
return true;
}
}
/**
* Removes val from the set.
*
* @param val an double value
* @return true if the set was modified by the remove operation.
*/
public boolean remove(double 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 double primitives.
* @return true if all elements were present in the set.
*/
public boolean containsAll(double[] 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 double primitives.
* @return true if the set was modified by the add all operation.
*/
public boolean addAll(double[] 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 double primitives.
* @return true if the set was modified by the remove all operation.
*/
public boolean removeAll(double[] 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 double primitives.
* @return true if the set was modified by the retain all operation
*/
public boolean retainAll(double[] array) {
Arrays.sort(array);
double[] set = _set;
byte[] states = _states;
boolean changed = false;
if (set != null) {
for (int i = set.length; i-- > 0;) {
if (states[i] == FULL && Arrays.binarySearch(array,set[i]) < 0) {
remove(set[i]);
changed = true;
}
}
}
return changed;
}
private void writeObject(ObjectOutputStream stream)
throws IOException {
stream.defaultWriteObject();
// number of entries
stream.writeInt(_size);
SerializationProcedure writeProcedure = new SerializationProcedure(stream);
if (!forEach(writeProcedure)) {
throw writeProcedure.exception;
}
}
private void readObject(ObjectInputStream stream)
throws IOException, ClassNotFoundException {
stream.defaultReadObject();
int size = stream.readInt();
setUp(size);
while (size-- > 0) {
double val = stream.readDouble();
add(val);
}
}
@Override
public String toString() {
final StringBuilder sb = new StringBuilder();
forEach(new TDoubleProcedure() {
public boolean execute(double value) {
if (sb.length() != 0) {
sb.append(',').append(' ');
}
sb.append(value);
return true;
}
});
sb.append(']');
sb.insert(0, '[');
return sb.toString();
}
} // TDoubleHashSet
© 2015 - 2025 Weber Informatics LLC | Privacy Policy