ArrayMap

ArrayMap

ArrayMap ()

Create a new empty ArrayMap. The default capacity of an array map is 0, and will grow once items are added to it.

ArrayMap

ArrayMap (int capacity)

Create a new ArrayMap with a given initial capacity.

ArrayMap

ArrayMap (ArrayMap<K, V> map)

Create a new ArrayMap with the mappings from the given ArrayMap.

clear

void clear ()

Make the array map empty. All storage is released.

containsAll

boolean containsAll (Collection<?> collection)

Determine if the array map contains all of the keys in the given collection.

containsKey

boolean containsKey (Object key)

Check whether a key exists in the array.

containsValue

boolean containsValue (Object value)

Check whether a value exists in the array. This requires a linear search through the entire array.

ensureCapacity

void ensureCapacity (int minimumCapacity)

Ensure the array map can hold at least minimumCapacity items.

entrySet

Set<Entry<K, V>> entrySet ()

Return a Set for iterating over and interacting with all mappings in the array map.

Note: this is a very inefficient way to access the array contents, it requires generating a number of temporary objects and allocates additional state information associated with the container that will remain for the life of the container.

Note:

equals

boolean equals (Object object)

Indicates whether some other object is "equal to" this one.

The equals method implements an equivalence relation on non-null object references:

• It is reflexive: for any non-null reference value x, x.equals(x) should return true.
• It is symmetric: for any non-null reference values x and y, x.equals(y) should return true if and only if y.equals(x) returns true.
• It is transitive: for any non-null reference values x, y, and z, if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.
• It is consistent: for any non-null reference values x and y, multiple invocations of x.equals(y) consistently return true or consistently return false, provided no information used in equals comparisons on the objects is modified.
• For any non-null reference value x, x.equals(null) should return false.

The equals method for class Object implements the most discriminating possible equivalence relation on objects; that is, for any non-null reference values x and y, this method returns true if and only if x and y refer to the same object (x == y has the value true).

Note that it is generally necessary to override the hashCode method whenever this method is overridden, so as to maintain the general contract for the hashCode method, which states that equal objects must have equal hash codes.

This implementation returns false if the object is not a map, or if the maps have different sizes. Otherwise, for each key in this map, values of both maps are compared. If the values for any key are not equal, the method returns false, otherwise it returns true.

get

V get (Object key)

Retrieve a value from the array.

hashCode

int hashCode ()

Returns a hash code value for the object. This method is supported for the benefit of hash tables such as those provided by HashMap.

The general contract of hashCode is:

• Whenever it is invoked on the same object more than once during an execution of a Java application, the hashCode method must consistently return the same integer, provided no information used in equals comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application.
• If two objects are equal according to the equals(Object) method, then calling the hashCode method on each of the two objects must produce the same integer result.
• It is not required that if two objects are unequal according to the equals(java.lang.Object) method, then calling the hashCode method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.

As much as is reasonably practical, the hashCode method defined by class Object does return distinct integers for distinct objects. (This is typically implemented by converting the internal address of the object into an integer, but this implementation technique is not required by the Java^TM programming language.)

indexOfKey

int indexOfKey (Object key)

Returns the index of a key in the set.

isEmpty

boolean isEmpty ()

Return true if the array map contains no items.

keyAt

K keyAt (int index)

Return the key at the given index in the array.

keySet

Set<K> keySet ()

Return a Set for iterating over and interacting with all keys in the array map.

Note: this is a fairly inefficient way to access the array contents, it requires generating a number of temporary objects and allocates additional state information associated with the container that will remain for the life of the container.

put

V put (K key, 
                V value)

Add a new value to the array map.

putAll

void putAll (ArrayMap<? extends K, ? extends V> array)

Perform a put(Object, Object) of all key/value pairs in array

putAll

void putAll (Map<? extends K, ? extends V> map)

Perform a put(Object, Object) of all key/value pairs in map

remove

V remove (Object key)

Remove an existing key from the array map.

removeAll

boolean removeAll (Collection<?> collection)

Remove all keys in the array map that exist in the given collection.

removeAt

V removeAt (int index)

Remove the key/value mapping at the given index.

retainAll

boolean retainAll (Collection<?> collection)

Remove all keys in the array map that do not exist in the given collection.

setValueAt

V setValueAt (int index, 
                V value)

Set the value at a given index in the array.

size

int size ()

Return the number of items in this array map.

toString

String toString ()

Returns a string representation of the object. In general, the toString method returns a string that "textually represents" this object. The result should be a concise but informative representation that is easy for a person to read. It is recommended that all subclasses override this method.

The toString method for class Object returns a string consisting of the name of the class of which the object is an instance, the at-sign character `@', and the unsigned hexadecimal representation of the hash code of the object. In other words, this method returns a string equal to the value of:

 getClass().getName() + '@' + Integer.toHexString(hashCode())
 

This implementation composes a string by iterating over its mappings. If this map contains itself as a key or a value, the string "(this Map)" will appear in its place.

valueAt

V valueAt (int index)

Return the value at the given index in the array.

values

Collection<V> values ()

Return a Collection for iterating over and interacting with all values in the array map.

Note: this is a fairly inefficient way to access the array contents, it requires generating a number of temporary objects and allocates additional state information associated with the container that will remain for the life of the container.