org.mini2Dx.core.collections

Class ShortMap<V>

java.lang.Object

org.mini2Dx.core.collections.ShortMap<V>

All Implemented Interfaces:

java.lang.Iterable<ShortMap.Entry<V>>

Direct Known Subclasses:

ShortTreeMap

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

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	ShortMap.Entries<V>
static class	ShortMap.Entry<V>
static class	ShortMap.Keys
static class	ShortMap.Values<V>

Field Summary

Fields

Modifier and Type	Field and Description
int	size

Constructor Summary

Constructors

Constructor and Description
ShortMap() Creates a new map with an initial capacity of 51 and a load factor of 0.8.
ShortMap(int initialCapacity) Creates a new map with a load factor of 0.8.
ShortMap(int initialCapacity, float loadFactor) Creates a new map with the specified initial capacity and load factor.
ShortMap(ShortMap<? 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(short key)
boolean	containsValue(java.lang.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.
ShortMap.Entries<V>	entries() Returns an iterator for the entries in the map.
boolean	equals(java.lang.Object obj)
short	findKey(java.lang.Object value, boolean identity, short notFound) Returns the key for the specified value, or notFound if it is not in the map.
V	get(short key)
V	get(short key, V defaultValue)
int	hashCode()
java.util.Iterator<ShortMap.Entry<V>>	iterator()
ShortMap.Keys	keys() Returns an iterator for the keys in the map.
V	put(short key, V value)
void	putAll(ShortMap<V> map)
V	remove(short key)
void	shrink(int maximumCapacity) Reduces the size of the backing arrays to be the specified capacity or less.
java.lang.String	toString()
ShortMap.Values<V>	values() Returns an iterator for the values in the map.

Methods inherited from class java.lang.Object

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

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Field Detail

size

public int size

Constructor Detail

ShortMap

public ShortMap()

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

ShortMap

public ShortMap(int initialCapacity)

Creates a new map with a load factor of 0.8.

Parameters:

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

ShortMap

public ShortMap(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.

Parameters:

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

ShortMap

public ShortMap(ShortMap<? extends V> map)

Creates a new map identical to the specified map.

Method Detail

put

public V put(short key,
             V value)

putAll

public void putAll(ShortMap<V> map)

get

public V get(short key)

get

public V get(short key,
             V defaultValue)

remove

public V remove(short 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(java.lang.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(short key)

findKey

public short findKey(java.lang.Object value,
                     boolean identity,
                     short 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 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.

hashCode

public int hashCode()

Overrides:

hashCode in class java.lang.Object

equals

public boolean equals(java.lang.Object obj)

Overrides:

equals in class java.lang.Object

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object

iterator

public java.util.Iterator<ShortMap.Entry<V>> iterator()

Specified by:

iterator in interface java.lang.Iterable<ShortMap.Entry<V>>

entries

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

values

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

keys

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