org.robovm.objc

Class LongMap<V>

java.lang.Object

org.robovm.objc.LongMap<V>

All Implemented Interfaces:

Iterable<LongMap.Entry<V>>

public class LongMap<V>
extends Object
implements Iterable<LongMap.Entry<V>>

An unordered map that uses long keys. This implementation is a cuckoo hash map using 3 hashes, random walking, and a small stash for problematic keys. Null values are allowed. No allocation is done except when growing the table size.

This map performs very fast get, containsKey, and remove (typically O(1), worst case O(log(n))). Put may be a bit slower, depending on hash collisions. Load factors greater than 0.91 greatly increase the chances the map will have to rehash to the next higher POT size.

Author:

Nathan Sweet

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	LongMap.Entries<V>
static class	LongMap.Entry<V> Returns an iterator for the keys in the map.

Field Summary

Fields

Modifier and Type	Field and Description
static org.robovm.objc.RandomXS128	random
int	size

Constructor Summary

Constructors

Constructor and Description
LongMap() Creates a new map with an initial capacity of 32 and a load factor of 0.8.
LongMap(int initialCapacity) Creates a new map with a load factor of 0.8.
LongMap(int initialCapacity, float loadFactor) Creates a new map with the specified initial capacity and load factor.
LongMap(LongMap<? extends V> map) Creates a new map identical to the specified map.

Method Summary

Modifier and Type	Method and Description
void	clear()
void	clear(int maximumCapacity) Clears the map and reduces the size of the backing arrays to be the specified capacity if they are larger.
boolean	containsKey(long key)
boolean	containsValue(Object value, boolean identity) Returns true if the specified value is in the map.
void	ensureCapacity(int additionalCapacity) Increases the size of the backing array to accommodate the specified number of additional items.
LongMap.Entries<V>	entries() Returns an iterator for the entries in the map.
long	findKey(Object value, boolean identity, long notFound) Returns the key for the specified value, or notFound if it is not in the map.
V	get(long key)
V	get(long key, V defaultValue)
Iterator<LongMap.Entry<V>>	iterator()
static int	nextPowerOfTwo(int value) Returns the next power of two.
V	put(long key, V value)
void	putAll(LongMap<V> map)
V	remove(long key)
void	shrink(int maximumCapacity) Reduces the size of the backing arrays to be the specified capacity or less.
String	toString()

Methods inherited from class java.lang.Object

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

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Field Detail

size

public int size

random

public static org.robovm.objc.RandomXS128 random

Constructor Detail

LongMap

public LongMap()

Creates a new map with an initial capacity of 32 and a load factor of 0.8. This map will hold 25 items before growing the backing table.

LongMap

public LongMap(int initialCapacity)

Creates a new map with a load factor of 0.8. This map will hold initialCapacity * 0.8 items before growing the backing table.

LongMap

public LongMap(int initialCapacity,
               float loadFactor)

Creates a new map with the specified initial capacity and load factor. This map will hold initialCapacity * loadFactor items before growing the backing table.

LongMap

public LongMap(LongMap<? extends V> map)

Creates a new map identical to the specified map.

Method Detail

nextPowerOfTwo

public static int nextPowerOfTwo(int value)

Returns the next power of two. Returns the specified value if the value is already a power of two.

put

public V put(long key,
             V value)

putAll

public void putAll(LongMap<V> map)

get

public V get(long key)

get

public V get(long key,
             V defaultValue)

remove

public V remove(long key)

shrink

public void shrink(int maximumCapacity)

Reduces the size of the backing arrays to be the specified capacity or less. If the capacity is already less, nothing is done. If the map contains more items than the specified capacity, the next highest power of two capacity is used instead.

clear

public void clear(int maximumCapacity)

Clears the map and reduces the size of the backing arrays to be the specified capacity if they are larger.

clear

public void clear()

containsValue

public boolean containsValue(Object value,
                             boolean identity)

Returns true if the specified value is in the map. Note this traverses the entire map and compares every value, which may be an expensive operation.

containsKey

public boolean containsKey(long key)

findKey

public long findKey(Object value,
                    boolean identity,
                    long notFound)

Returns the key for the specified value, or notFound if it is not in the map. Note this traverses the entire map and compares every value, which may be an expensive operation.

Parameters:

identity - If true, uses == to compare the specified value with values in the map. If false, uses Object.equals(Object).

ensureCapacity

public void ensureCapacity(int additionalCapacity)

Increases the size of the backing array to accommodate the specified number of additional items. Useful before adding many items to avoid multiple backing array resizes.

toString

public String toString()

Overrides:

toString in class Object

iterator

public Iterator<LongMap.Entry<V>> iterator()

Specified by:

iterator in interface Iterable<LongMap.Entry<V>>

entries

public LongMap.Entries<V> entries()

Returns an iterator for the entries in the map. Remove is supported. Note that the same iterator instance is returned each time this method is called. Use the LongMap.Entries constructor for nested or multithreaded iteration.