org.greenrobot.essentials.collections

Class LongHashMap<T>

java.lang.Object

org.greenrobot.essentials.collections.LongHashMap<T>

Type Parameters:

T - The value class to store.

Direct Known Subclasses:

LongHashMap.Synchronized

public class LongHashMap<T>
extends java.lang.Object

An minimalistic hash map optimized for long keys. The default implementation is not thread-safe, but you can get a synchronized variant using one of the static createSynchronized methods.

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	LongHashMap.Entry<T>
protected static class	LongHashMap.Synchronized<T>

Field Summary

Fields

Modifier and Type	Field and Description
protected static int	DEFAULT_CAPACITY

Constructor Summary

Constructors

Constructor and Description
LongHashMap()
LongHashMap(int capacity)

Method Summary

Modifier and Type	Method and Description
void	clear()
boolean	containsKey(long key)
static <T> LongHashMap<T>	createSynchronized() Creates a synchronized (thread-safe) LongHashSet.
static <T> LongHashMap<T>	createSynchronized(int capacity) Creates a synchronized (thread-safe) LongHashSet using the given initial capacity.
LongHashMap.Entry<T>[]	entries() Returns all entries in no particular order.
T	get(long key)
long[]	keys() Returns all keys in no particular order.
T	put(long key, T value)
T	remove(long key)
void	reserveRoom(int entryCount) Target load: 0,6
void	setCapacity(int newCapacity)
int	size()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

DEFAULT_CAPACITY

protected static final int DEFAULT_CAPACITY

See Also:

Constant Field Values

Constructor Detail

LongHashMap

public LongHashMap()

LongHashMap

public LongHashMap(int capacity)

Method Detail

createSynchronized

public static <T> LongHashMap<T> createSynchronized()

Creates a synchronized (thread-safe) LongHashSet.

createSynchronized

public static <T> LongHashMap<T> createSynchronized(int capacity)

Creates a synchronized (thread-safe) LongHashSet using the given initial capacity.

containsKey

public boolean containsKey(long key)

get

public T get(long key)

put

public T put(long key,
             T value)

remove

public T remove(long key)

keys

public long[] keys()

Returns all keys in no particular order.

entries

public LongHashMap.Entry<T>[] entries()

Returns all entries in no particular order.

clear

public void clear()

size

public int size()

setCapacity

public void setCapacity(int newCapacity)

reserveRoom

public void reserveRoom(int entryCount)

Target load: 0,6