|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectjava.util.AbstractMap<K,V>
org.apache.myfaces.trinidad.util.ArrayMap<K,V>
public class ArrayMap<K,V>
A Map implementation that stores its contents in a single array. This approach is significantly faster for small sets of data than the use of a HashMap or Hashtable, though potentially much slower for very large sets.
ArrayMap is optimized for many-reads-few-write. In particular, it reallocates its array on any insertion or deletion.
ArrayMap also includes a series of static methods for managing the
Object array. These may be used in place of instantiating an
ArrayMap for clients that don't need a Map implementation.
Clients using these methods must be careful to store the returned
Object array on any mutator method. They also must provide their
own synchronization, if needed. When using these static methods,
clients can opt to search for objects by identity (via
getByIdentity()
) instead of equality, while the static
get()
method will try identity before equality. This
latter approach is extremely fast but still safe for retrieval of
Strings that have all been interned, especially if misses are
infrequent (since misses do require a scan using Object.equals()).
It's worth remembering that String constants are always interned,
as required by the language specification.
Nested Class Summary |
---|
Nested classes/interfaces inherited from class java.util.AbstractMap |
---|
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V> |
Nested classes/interfaces inherited from interface java.util.Map |
---|
Map.Entry<K,V> |
Constructor Summary | |
---|---|
ArrayMap()
Creates an empty ArrayMap, preallocating nothing. |
|
ArrayMap(int size)
Creates an ArrayMap, preallocating for a certain size. |
|
ArrayMap(int size,
int increment)
Creates an ArrayMap, preallocating for a certain size. |
Method Summary | |
---|---|
void |
clear()
Removes all elements from the ArrayMap. |
Object |
clone()
Clones the map. |
boolean |
containsKey(Object key)
|
boolean |
containsValue(Object value)
|
Set<Map.Entry<K,V>> |
entrySet()
|
V |
get(Object key)
|
static Object |
get(Object[] array,
Object key)
Gets the object stored with the given key. |
static Object |
getByEquality(Object[] array,
Object key)
Gets the object stored with the given key, using only object equality. |
V |
getByIdentity(Object key)
|
static Object |
getByIdentity(Object[] array,
Object key)
Gets the object stored with the given key, using only object identity. |
K |
getKey(int index)
Returns the key at a specific index in the map. |
static Iterator<Object> |
getKeys(Object[] array)
Returns an Iterator of keys in the array. |
V |
getValue(int index)
Returns the value at a specific index in the map. |
static Iterator<Object> |
getValues(Object[] array)
Returns an Iterator of values in the array. |
Iterator<K> |
keys()
Returns an enumeration of the keys in this map. |
V |
put(K key,
V value)
|
static Object[] |
put(Object[] array,
Object key,
Object value)
Adds the key/value pair to the array, returning a new array if necessary. |
V |
remove(Object key)
|
static Object[] |
remove(Object[] array,
Object key)
Removes the value for the key from the array, returning a new array if necessary. |
static Object[] |
remove(Object[] array,
Object key,
boolean reallocate)
Removes the value for the key from the array, returning a new array if necessary. |
int |
size()
|
Methods inherited from class java.util.AbstractMap |
---|
equals, hashCode, isEmpty, keySet, putAll, toString, values |
Methods inherited from class java.lang.Object |
---|
finalize, getClass, notify, notifyAll, wait, wait, wait |
Constructor Detail |
---|
public ArrayMap()
public ArrayMap(int size)
size
- the number of elements to pre-allocate forpublic ArrayMap(int size, int increment)
size
- the number of elements to pre-allocate forincrement
- the number of additional elements to
allocate for when overruningMethod Detail |
---|
public K getKey(int index)
public V getValue(int index)
public static Object get(Object[] array, Object key)
public static Object getByIdentity(Object[] array, Object key)
public static Object getByEquality(Object[] array, Object key)
public static Object[] put(Object[] array, Object key, Object value)
public static Object[] remove(Object[] array, Object key)
public static Object[] remove(Object[] array, Object key, boolean reallocate)
public int size()
size
in interface Map<K,V>
size
in class AbstractMap<K,V>
public boolean containsValue(Object value)
containsValue
in interface Map<K,V>
containsValue
in class AbstractMap<K,V>
public boolean containsKey(Object key)
containsKey
in interface Map<K,V>
containsKey
in class AbstractMap<K,V>
public Iterator<K> keys()
public static Iterator<Object> getKeys(Object[] array)
public static Iterator<Object> getValues(Object[] array)
public Object clone()
clone
in class AbstractMap<K,V>
public Set<Map.Entry<K,V>> entrySet()
entrySet
in interface Map<K,V>
entrySet
in class AbstractMap<K,V>
public V get(Object key)
get
in interface Map<K,V>
get
in class AbstractMap<K,V>
public V getByIdentity(Object key)
public V put(K key, V value)
put
in interface Map<K,V>
put
in class AbstractMap<K,V>
public V remove(Object key)
remove
in interface Map<K,V>
remove
in class AbstractMap<K,V>
public void clear()
clear
in interface Map<K,V>
clear
in class AbstractMap<K,V>
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |