Memory-efficient map of keys to values with list-style random-access semantics.
Supports null keys and values. Conceptually, the keys and values are stored in a simpler array
in order to minimize memory use and provide for fast access to a key/value at a certain index
(for example #getKey(int)). However, traditional mapping operations like #get(Object) and #put(Object, Object) are slower because they need to look up all
key/value pairs in the worst case.
Implementation is not thread-safe. For a thread-safe choice instead use an implementation of
ConcurrentMap.
Returns a new instance of an array map with initial capacity of zero. Equivalent to calling the
default constructor, except without the need to specify the type parameters. For example:
ArrayMap<String, String> map = ArrayMap.create();.
Returns a new instance of an array map of the given key value pairs in alternating order. For
example: ArrayMap<String, String> map = ArrayMap.of("key1", "value1", "key2", "value2",
...);.
WARNING: there is no compile-time checking of the keyValuePairs parameter to ensure
that the keys or values have the correct type, so if the wrong type is passed in, any problems
will occur at runtime. Also, there is no checking that the keys are unique, which the caller
must ensure is true.
Sets the key/value mapping at the given index, overriding any existing key/value mapping.
There is no checking done to ensure that the key does not already exist. Therefore, this
method is dangerous to call unless the caller can be certain the key does not already exist in
the map.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Hard to understand","hardToUnderstand","thumb-down"],["Incorrect information or sample code","incorrectInformationOrSampleCode","thumb-down"],["Missing the information/samples I need","missingTheInformationSamplesINeed","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2025-01-21 UTC."],[],[]]
