it.unimi.dsi.fastutil.bytes.Byte2IntArrayMap Maven / Gradle / Ivy
Show all versions of fastutil Show documentation
/* Generic definitions */
/* Assertions (useful to generate conditional code) */
/* Current type and class (and size, if applicable) */
/* Value methods */
/* Interfaces (keys) */
/* Interfaces (values) */
/* Abstract implementations (keys) */
/* Abstract implementations (values) */
/* Static containers (keys) */
/* Static containers (values) */
/* Implementations */
/* Synchronized wrappers */
/* Unmodifiable wrappers */
/* Other wrappers */
/* Methods (keys) */
/* Methods (values) */
/* Methods (keys/values) */
/* Methods that have special names depending on keys (but the special names depend on values) */
/* Equality */
/* Object/Reference-only definitions (keys) */
/* Primitive-type-only definitions (keys) */
/* Object/Reference-only definitions (values) */
/* Primitive-type-only definitions (values) */
/*
* Copyright (C) 2007-2016 Sebastiano Vigna
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package it.unimi.dsi.fastutil.bytes;
import java.util.Map;
import java.util.NoSuchElementException;
import it.unimi.dsi.fastutil.objects.AbstractObjectIterator;
import it.unimi.dsi.fastutil.objects.AbstractObjectSet;
import it.unimi.dsi.fastutil.objects.ObjectIterator;
import it.unimi.dsi.fastutil.ints.IntCollection;
import it.unimi.dsi.fastutil.ints.IntCollections;
import it.unimi.dsi.fastutil.ints.IntArraySet;
import it.unimi.dsi.fastutil.ints.IntArrays;
/**
* A simple, brute-force implementation of a map based on two parallel backing
* arrays.
*
*
* The main purpose of this implementation is that of wrapping cleanly the
* brute-force approach to the storage of a very small number of pairs: just put
* them into two parallel arrays and scan linearly to find an item.
*/
public class Byte2IntArrayMap extends AbstractByte2IntMap
implements
java.io.Serializable,
Cloneable {
private static final long serialVersionUID = 1L;
/** The keys (valid up to {@link #size}, excluded). */
private transient byte[] key;
/** The values (parallel to {@link #key}). */
private transient int[] value;
/** The number of valid entries in {@link #key} and {@link #value}. */
private int size;
/**
* Creates a new empty array map with given key and value backing arrays.
* The resulting map will have as many entries as the given arrays.
*
*
* It is responsibility of the caller that the elements of key
* are distinct.
*
* @param key
* the key array.
* @param value
* the value array (it must have the same length as
* key).
*/
public Byte2IntArrayMap(final byte[] key, final int[] value) {
this.key = key;
this.value = value;
size = key.length;
if (key.length != value.length)
throw new IllegalArgumentException(
"Keys and values have different lengths (" + key.length
+ ", " + value.length + ")");
}
/**
* Creates a new empty array map.
*/
public Byte2IntArrayMap() {
this.key = ByteArrays.EMPTY_ARRAY;
this.value = IntArrays.EMPTY_ARRAY;
}
/**
* Creates a new empty array map of given capacity.
*
* @param capacity
* the initial capacity.
*/
public Byte2IntArrayMap(final int capacity) {
this.key = new byte[capacity];
this.value = new int[capacity];
}
/**
* Creates a new empty array map copying the entries of a given map.
*
* @param m
* a map.
*/
public Byte2IntArrayMap(final Byte2IntMap m) {
this(m.size());
putAll(m);
}
/**
* Creates a new empty array map copying the entries of a given map.
*
* @param m
* a map.
*/
public Byte2IntArrayMap(final Map m) {
this(m.size());
putAll(m);
}
/**
* Creates a new array map with given key and value backing arrays, using
* the given number of elements.
*
*
* It is responsibility of the caller that the first size
* elements of key are distinct.
*
* @param key
* the key array.
* @param value
* the value array (it must have the same length as
* key).
* @param size
* the number of valid elements in key and
* value.
*/
public Byte2IntArrayMap(final byte[] key, final int[] value, final int size) {
this.key = key;
this.value = value;
this.size = size;
if (key.length != value.length)
throw new IllegalArgumentException(
"Keys and values have different lengths (" + key.length
+ ", " + value.length + ")");
if (size > key.length)
throw new IllegalArgumentException("The provided size (" + size
+ ") is larger than or equal to the backing-arrays size ("
+ key.length + ")");
}
private final class EntrySet extends AbstractObjectSet
implements
FastEntrySet {
@Override
public ObjectIterator iterator() {
return new AbstractObjectIterator() {
int curr = -1, next = 0;
public boolean hasNext() {
return next < size;
}
public Entry next() {
if (!hasNext())
throw new NoSuchElementException();
return new AbstractByte2IntMap.BasicEntry(key[curr = next],
value[next++]);
}
public void remove() {
if (curr == -1)
throw new IllegalStateException();
curr = -1;
final int tail = size-- - next--;
System.arraycopy(key, next + 1, key, next, tail);
System.arraycopy(value, next + 1, value, next, tail);
}
};
}
public ObjectIterator fastIterator() {
return new AbstractObjectIterator() {
int next = 0, curr = -1;
final BasicEntry entry = new BasicEntry(((byte) 0), (0));
public boolean hasNext() {
return next < size;
}
public Entry next() {
if (!hasNext())
throw new NoSuchElementException();
entry.key = key[curr = next];
entry.value = value[next++];
return entry;
}
public void remove() {
if (curr == -1)
throw new IllegalStateException();
curr = -1;
final int tail = size-- - next--;
System.arraycopy(key, next + 1, key, next, tail);
System.arraycopy(value, next + 1, value, next, tail);
}
};
}
public int size() {
return size;
}
public boolean contains(Object o) {
if (!(o instanceof Map.Entry))
return false;
final Map.Entry e = (Map.Entry) o;
if (e.getKey() == null || !(e.getKey() instanceof Byte))
return false;
if (e.getValue() == null || !(e.getValue() instanceof Integer))
return false;
final byte k = ((((Byte) (e.getKey())).byteValue()));
return Byte2IntArrayMap.this.containsKey(k)
&& ((Byte2IntArrayMap.this.get(k)) == (((((Integer) (e
.getValue())).intValue()))));
}
@Override
public boolean remove(final Object o) {
if (!(o instanceof Map.Entry))
return false;
final Map.Entry e = (Map.Entry) o;
if (e.getKey() == null || !(e.getKey() instanceof Byte))
return false;
if (e.getValue() == null || !(e.getValue() instanceof Integer))
return false;
final byte k = ((((Byte) (e.getKey())).byteValue()));
final int v = ((((Integer) (e.getValue())).intValue()));
final int oldPos = Byte2IntArrayMap.this.findKey(k);
if (oldPos == -1 || !((v) == (Byte2IntArrayMap.this.value[oldPos])))
return false;
final int tail = size - oldPos - 1;
System.arraycopy(Byte2IntArrayMap.this.key, oldPos + 1,
Byte2IntArrayMap.this.key, oldPos, tail);
System.arraycopy(Byte2IntArrayMap.this.value, oldPos + 1,
Byte2IntArrayMap.this.value, oldPos, tail);
Byte2IntArrayMap.this.size--;
return true;
}
}
public FastEntrySet byte2IntEntrySet() {
return new EntrySet();
}
private int findKey(final byte k) {
final byte[] key = this.key;
for (int i = size; i-- != 0;)
if (((key[i]) == (k)))
return i;
return -1;
}
public int get(final byte k) {
final byte[] key = this.key;
for (int i = size; i-- != 0;)
if (((key[i]) == (k)))
return value[i];
return defRetValue;
}
public int size() {
return size;
}
@Override
public void clear() {
size = 0;
}
@Override
public boolean containsKey(final byte k) {
return findKey(k) != -1;
}
@Override
public boolean containsValue(int v) {
for (int i = size; i-- != 0;)
if (((value[i]) == (v)))
return true;
return false;
}
@Override
public boolean isEmpty() {
return size == 0;
}
@Override
public int put(byte k, int v) {
final int oldKey = findKey(k);
if (oldKey != -1) {
final int oldValue = value[oldKey];
value[oldKey] = v;
return oldValue;
}
if (size == key.length) {
final byte[] newKey = new byte[size == 0 ? 2 : size * 2];
final int[] newValue = new int[size == 0 ? 2 : size * 2];
for (int i = size; i-- != 0;) {
newKey[i] = key[i];
newValue[i] = value[i];
}
key = newKey;
value = newValue;
}
key[size] = k;
value[size] = v;
size++;
return defRetValue;
}
@Override
public int remove(final byte k) {
final int oldPos = findKey(k);
if (oldPos == -1)
return defRetValue;
final int oldValue = value[oldPos];
final int tail = size - oldPos - 1;
System.arraycopy(key, oldPos + 1, key, oldPos, tail);
System.arraycopy(value, oldPos + 1, value, oldPos, tail);
size--;
return oldValue;
}
@Override
public ByteSet keySet() {
return new ByteArraySet(key, size);
}
@Override
public IntCollection values() {
return IntCollections.unmodifiable(new IntArraySet(value, size));
}
/**
* Returns a deep copy of this map.
*
*
* This method performs a deep copy of this hash map; the data stored in the
* map, however, is not cloned. Note that this makes a difference only for
* object keys.
*
* @return a deep copy of this map.
*/
public Byte2IntArrayMap clone() {
Byte2IntArrayMap c;
try {
c = (Byte2IntArrayMap) super.clone();
} catch (CloneNotSupportedException cantHappen) {
throw new InternalError();
}
c.key = key.clone();
c.value = value.clone();
return c;
}
private void writeObject(java.io.ObjectOutputStream s)
throws java.io.IOException {
s.defaultWriteObject();
for (int i = 0; i < size; i++) {
s.writeByte(key[i]);
s.writeInt(value[i]);
}
}
private void readObject(java.io.ObjectInputStream s)
throws java.io.IOException, ClassNotFoundException {
s.defaultReadObject();
key = new byte[size];
value = new int[size];
for (int i = 0; i < size; i++) {
key[i] = s.readByte();
value[i] = s.readInt();
}
}
}