com.fr.stable.collections.map

类 IntIntMap

java.lang.Object

com.fr.stable.collections.map.IntIntMap

所有已实现的接口:

java.lang.Iterable<IntIntMap.Entry>

public class IntIntMap
extends java.lang.Object
implements java.lang.Iterable<IntIntMap.Entry>

An unordered map where the keys and values are ints. This implementation is a cuckoo hash map using 3 hashes, random walking, and a small stash for problematic keys. 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.

作者:

Nathan Sweet

嵌套类概要

嵌套类

限定符和类型	类和说明
static class	IntIntMap.Entries
static class	IntIntMap.Entry
static class	IntIntMap.Keys
static class	IntIntMap.Values

字段概要

字段

限定符和类型	字段和说明
int	size

构造器概要

构造器

构造器和说明
IntIntMap() Creates a new map with an initial capacity of 51 and a load factor of 0.8.
IntIntMap(int initialCapacity) Creates a new map with a load factor of 0.8.
IntIntMap(int initialCapacity, float loadFactor) Creates a new map with the specified initial capacity and load factor.
IntIntMap(IntIntMap map) Creates a new map identical to the specified map.

方法概要

方法

限定符和类型	方法和说明
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(int key)
boolean	containsValue(int value) 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.
IntIntMap.Entries	entries() Returns an iterator for the entries in the map.
boolean	equals(java.lang.Object obj)
int	findKey(int value, int notFound) Returns the key for the specified value, or null if it is not in the map.
int	get(int key, int defaultValue)
int	getAndIncrement(int key, int defaultValue, int increment) Returns the key's current value and increments the stored value.
int	hashCode()
java.util.Iterator<IntIntMap.Entry>	iterator()
IntIntMap.Keys	keys() Returns an iterator for the keys in the map.
void	put(int key, int value)
void	putAll(IntIntMap map)
int	remove(int key, int defaultValue)
void	shrink(int maximumCapacity) Reduces the size of the backing arrays to be the specified capacity or less.
java.lang.String	toString()
IntIntMap.Values	values() Returns an iterator for the values in the map.

从类继承的方法 java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

字段详细资料

size

public int size

构造器详细资料

IntIntMap

public IntIntMap()

Creates a new map with an initial capacity of 51 and a load factor of 0.8.

IntIntMap

public IntIntMap(int initialCapacity)

Creates a new map with a load factor of 0.8.

参数:

initialCapacity - If not a power of two, it is increased to the next nearest power of two.

IntIntMap

public IntIntMap(int initialCapacity,
         float loadFactor)

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

参数:

initialCapacity - If not a power of two, it is increased to the next nearest power of two.

IntIntMap

public IntIntMap(IntIntMap map)

Creates a new map identical to the specified map.

方法详细资料

put

public void put(int key,
       int value)

putAll

public void putAll(IntIntMap map)

get

public int get(int key,
      int defaultValue)

参数:

defaultValue - Returned if the key was not associated with a value.

getAndIncrement

public int getAndIncrement(int key,
                  int defaultValue,
                  int increment)

Returns the key's current value and increments the stored value. If the key is not in the map, defaultValue + increment is put into the map.

remove

public int remove(int key,
         int defaultValue)

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(int value)

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(int key)

findKey

public int findKey(int value,
          int notFound)

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

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.

hashCode

public int hashCode()

覆盖:

hashCode 在类中 java.lang.Object

equals

public boolean equals(java.lang.Object obj)

覆盖:

equals 在类中 java.lang.Object

toString

public java.lang.String toString()

覆盖:

toString 在类中 java.lang.Object

iterator

public java.util.Iterator<IntIntMap.Entry> iterator()

指定者:

iterator 在接口中 java.lang.Iterable<IntIntMap.Entry>

entries

public IntIntMap.Entries 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 IntIntMap.Entries constructor for nested or multithreaded iteration.

values

public IntIntMap.Values values()

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

keys

public IntIntMap.Keys keys()

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