com.gemstone.gemfire.internal.cache.TStatelessIntHashSet Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of gemfire-trove Show documentation
Show all versions of gemfire-trove Show documentation
SnappyData store based off Pivotal GemFireXD
The newest version!
/*
* Copyright (c) 2010-2015 Pivotal Software, Inc. 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.
*/
/*
* Contains code from GNU Trove having the license below.
*
* 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 com.gemstone.gemfire.internal.cache;
import com.gemstone.gnu.trove.*;
import java.util.Arrays;
/**
* An open addressed set implementation for int primitives.
*
* @author darrel
*/
public class TStatelessIntHashSet extends TStatelessIntHash {
/**
* Creates a new TStatelessIntHashSet instance with the default
* capacity and load factor.
*/
public TStatelessIntHashSet(int freeValue) {
super(freeValue);
}
/**
* Creates a new TStatelessIntHashSet instance with a prime
* capacity equal to or greater than initialCapacity and
* with the default load factor.
*
* @param initialCapacity an int value
*/
public TStatelessIntHashSet(int freeValue, int initialCapacity) {
super(freeValue, initialCapacity);
}
/**
* Creates a new TStatelessIntHashSet 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 TStatelessIntHashSet(int freeValue, int initialCapacity, float loadFactor) {
super(freeValue, initialCapacity, loadFactor);
}
/**
* Creates a new TStatelessIntHashSet instance containing the
* elements of array.
*
* @param array an array of int primitives
*/
public TStatelessIntHashSet(int freeValue, int[] array) {
this(freeValue, array.length);
addAll(array);
}
/**
* Creates a new TStatelessIntHash instance with the default
* capacity and load factor.
* @param strategy used to compute hash codes and to compare keys.
*/
public TStatelessIntHashSet(int freeValue, TIntHashingStrategy strategy) {
super(freeValue, strategy);
}
/**
* Creates a new TStatelessIntHash 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 TStatelessIntHashSet(int freeValue, int initialCapacity, TIntHashingStrategy strategy) {
super(freeValue, initialCapacity, strategy);
}
/**
* Creates a new TStatelessIntHash 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 TStatelessIntHashSet(int freeValue, int initialCapacity, float loadFactor, TIntHashingStrategy strategy) {
super(freeValue, initialCapacity, loadFactor, strategy);
}
/**
* Creates a new TStatelessIntHashSet instance containing the
* elements of array.
*
* @param array an array of int primitives
* @param strategy used to compute hash codes and to compare keys.
*/
public TStatelessIntHashSet(int freeValue, int[] array, TIntHashingStrategy strategy) {
this(freeValue, array.length, strategy);
addAll(array);
}
/**
* @return a TIntIterator with access to the values in this set
*/
public TStatelessIntIterator iterator() {
return new TStatelessIntIterator(this);
}
/**
* Inserts a value into the set.
*
* @param val an int value
* @return true if the set was modified by the add operation
*/
public boolean add(int val) {
int index = insertionIndex(val);
if (index < 0) {
return false; // already present in set, nothing to add
}
int previousState = _set[index];
_set[index] = val;
postInsertHook(previousState == this._FREE);
return true; // yes, we added something
}
/**
* Expands the set to accomodate new values.
*
* @param newCapacity an int value
*/
@Override
protected void rehash(int newCapacity) {
int oldCapacity = _set.length;
int oldSet[] = _set;
_set = new int[newCapacity];
if (this._FREE != 0) {
Arrays.fill(_set, this._FREE);
}
for (int i = oldCapacity; i-- > 0;) {
int o = oldSet[i];
if (o != this._FREE) {
int index = insertionIndex(o);
_set[index] = o;
}
}
}
/**
* Returns a new array containing the values in the set.
*
* @return an int[] value
*/
public int[] toArray() {
int[] result = new int[size()];
int[] set = _set;
for (int i = set.length, j = 0; i-- > 0;) {
int o = set[i];
if (o != this._FREE) {
result[j++] = o;
}
}
return result;
}
/**
* Empties the set.
*/
@Override
public void clear() {
super.clear();
java.util.Arrays.fill(_set, this._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 TStatelessIntHashSet)) {
return false;
}
final TStatelessIntHashSet that = (TStatelessIntHashSet)other;
if (that.size() != this.size()) {
return false;
}
return forEach(new TIntProcedure() {
public final boolean execute(int value) {
return that.contains(value);
}
});
}
@Override
public int hashCode() {
HashProcedure p = new HashProcedure();
forEach(p);
return p.getHashCode();
}
protected final class HashProcedure implements TIntProcedure {
private int h = 0;
public int getHashCode() {
return h;
}
public final boolean execute(int key) {
h += _hashingStrategy.computeHashCode(key);
return true;
}
}
// /**
// * Removes val from the set.
// *
// * @param val an int value
// * @return true if the set was modified by the remove operation.
// */
// public boolean remove(int 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 int primitives.
* @return true if all elements were present in the set.
*/
public boolean containsAll(int[] 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 int primitives.
* @return true if the set was modified by the add all operation.
*/
public boolean addAll(int[] 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 int primitives.
// * @return true if the set was modified by the remove all operation.
// */
// public boolean removeAll(int[] 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 int primitives.
// * @return true if the set was modified by the retain all operation
// */
// public boolean retainAll(int[] array) {
// boolean changed = false;
// Arrays.sort(array);
// int[] set = _set;
// for (int i = set.length; i-- > 0;) {
// if (set[i] != this._FREE && (Arrays.binarySearch(array,set[i]) < 0)) {
// remove(set[i]);
// changed = true;
// }
// }
// return changed;
// }
} // TStatelessIntHashSet