io.sirix.utils.IntSet Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of sirix-core Show documentation
Show all versions of sirix-core Show documentation
SirixDB is a hybrid on-disk and in-memory document oriented, versioned database system. It has a lightweight buffer manager, stores everything in a huge persistent and durable tree and allows efficient reconstruction of every revision. Furthermore, SirixDB implements change tracking, diffing and supports time travel queries.
package io.sirix.utils;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
/**
* This is an efficient and memory-saving hash set for storing primitive integers.
*
* @author BaseX Team 2005-22, BSD License
* @author Christian Gruen
*/
public class IntSet extends ASet {
/**
* Hashed keys.
*/
int[] keys;
/**
* Default constructor.
*/
public IntSet() {
this(Array.INITIAL_CAPACITY);
}
/**
* Constructor with initial capacity.
*
* @param capacity array capacity (will be resized to a power of two)
*/
public IntSet(final long capacity) {
super(capacity);
keys = new int[capacity()];
}
/**
* Stores the specified key if it has not been stored before.
*
* @param key key to be added
* @return {@code true} if the key did not exist yet and was stored
*/
public final boolean add(final int key) {
return index(key) > 0;
}
/**
* Stores the specified key and returns its id.
*
* @param key key to be added
* @return unique id of stored key (larger than zero)
*/
final int put(final int key) {
final int id = index(key);
return Math.abs(id);
}
/**
* Checks if the set contains the specified key.
*
* @param key key to be looked up
* @return result of check
*/
public final boolean contains(final int key) {
return id(key) > 0;
}
/**
* Returns the id of the specified key, or {@code 0} if the key does not exist.
*
* @param key key to be looked up
* @return id, or {@code 0} if key does not exist
*/
final int id(final int key) {
final int b = key & capacity() - 1;
for (int id = buckets[b]; id != 0; id = next[id]) {
if (key == keys[id])
return id;
}
return 0;
}
/**
* Returns the key with the specified id.
* All ids starts with {@code 1} instead of {@code 0}.
*
* @param id id of the key to return
* @return key
*/
public final int key(final int id) {
return keys[id];
}
/**
* Stores the specified key and returns its id, or returns the negative id if the
* key has already been stored.
*
* @param key key to be found
* @return id, or negative id if key has already been stored
*/
private int index(final int key) {
checkSize();
final int b = key & capacity() - 1;
for (int id = buckets[b]; id != 0; id = next[id]) {
if (key == keys[id])
return -id;
}
final int s = size++;
next[s] = buckets[b];
keys[s] = key;
buckets[b] = s;
return s;
}
@Override
protected int hash(final int id) {
return keys[id];
}
@Override
protected void rehash(final int newSize) {
keys = Arrays.copyOf(keys, newSize);
}
/**
* Returns an array with all elements.
*
* @return array
*/
public final int[] toArray() {
return Arrays.copyOfRange(keys, 1, size);
}
@Override
public String toString() {
final List
© 2015 - 2024 Weber Informatics LLC | Privacy Policy