/**@class android.util.ArrayMap
 implements java.util.Map

@extends java.lang.Object

 ArrayMap is a generic key->value mapping data structure that is
 designed to be more memory efficient than a traditional {@link java.util.HashMap}.
 It keeps its mappings in an array data structure -- an integer array of hash
 codes for each item, and an Object array of the key/value pairs.  This allows it to
 avoid having to create an extra object for every entry put in to the map, and it
 also tries to control the growth of the size of these arrays more aggressively
 (since growing them only requires copying the entries in the array, not rebuilding
 a hash map).

 <p>Note that this implementation is not intended to be appropriate for data structures
 that may contain large numbers of items.  It is generally slower than a traditional
 HashMap, since lookups require a binary search and adds and removes require inserting
 and deleting entries in the array.  For containers holding up to hundreds of items,
 the performance difference is not significant, less than 50%.</p>

 <p>Because this container is intended to better balance memory use, unlike most other
 standard Java containers it will shrink its array as items are removed from it.  Currently
 you have no control over this shrinking -- if you set a capacity and then remove an
 item, it may reduce the capacity to better match the current size.  In the future an
 explicit call to set the capacity should turn off this aggressive shrinking behavior.</p>
*/
var ArrayMap = {

/** @hide Special immutable empty ArrayMap.
*/
EMPTY : "null",
/**Make the array map empty.  All storage is released.
*/
clear : function(  ) {},

/**
@hide Like {@link #clear}, but doesn't reduce the capacity of the ArrayMap.
*/
erase : function(  ) {},

/**Ensure the array map can hold at least <var>minimumCapacity</var>
 items.
*/
ensureCapacity : function(  ) {},

/**Check whether a key exists in the array.
@param {Object {Object}} key The key to search for.
@return {Boolean} Returns true if the key exists, else false.
*/
containsKey : function(  ) {},

/**Returns the index of a key in the set.
@param {Object {Object}} key The key to search for.
@return {Number} Returns the index of the key if it exists, else a negative integer.
*/
indexOfKey : function(  ) {},

/**Returns an index for which {@link #valueAt} would return the
 specified value, or a negative number if no keys map to the
 specified value.
 Beware that this is a linear search, unlike lookups by key,
 and that multiple keys can map to the same value and this will
 find only one of them.
*/
indexOfValue : function(  ) {},

/**Check whether a value exists in the array.  This requires a linear search
 through the entire array.
@param {Object {Object}} value The value to search for.
@return {Boolean} Returns true if the value exists, else false.
*/
containsValue : function(  ) {},

/**Retrieve a value from the array.
@param {Object {Object}} key The key of the value to retrieve.
@return {Object {java.lang.Object}} Returns the value associated with the given key,
 or null if there is no such key.
*/
get : function(  ) {},

/**Return the key at the given index in the array.

 <p>For indices outside of the range <code>0...size()-1</code>, the behavior is undefined for
 apps targeting {@link android.os.Build.VERSION_CODES#P} and earlier, and an
 {@link ArrayIndexOutOfBoundsException} is thrown for apps targeting
 {@link android.os.Build.VERSION_CODES#Q} and later.</p>
@param {Number} index The desired index, must be between 0 and {@link #size()}-1.
@return {Object {java.lang.Object}} Returns the key stored at the given index.
*/
keyAt : function(  ) {},

/**Return the value at the given index in the array.

 <p>For indices outside of the range <code>0...size()-1</code>, the behavior is undefined for
 apps targeting {@link android.os.Build.VERSION_CODES#P} and earlier, and an
 {@link ArrayIndexOutOfBoundsException} is thrown for apps targeting
 {@link android.os.Build.VERSION_CODES#Q} and later.</p>
@param {Number} index The desired index, must be between 0 and {@link #size()}-1.
@return {Object {java.lang.Object}} Returns the value stored at the given index.
*/
valueAt : function(  ) {},

/**Set the value at a given index in the array.

 <p>For indices outside of the range <code>0...size()-1</code>, the behavior is undefined for
 apps targeting {@link android.os.Build.VERSION_CODES#P} and earlier, and an
 {@link ArrayIndexOutOfBoundsException} is thrown for apps targeting
 {@link android.os.Build.VERSION_CODES#Q} and later.</p>
@param {Number} index The desired index, must be between 0 and {@link #size()}-1.
@param {Object {Object}} value The new value to store at this index.
@return {Object {java.lang.Object}} Returns the previous value at the given index.
*/
setValueAt : function(  ) {},

/**Return true if the array map contains no items.
*/
isEmpty : function(  ) {},

/**Add a new value to the array map.
@param {Object {Object}} key The key under which to store the value.  If
 this key already exists in the array, its value will be replaced.
@param {Object {Object}} value The value to store for the given key.
@return {Object {java.lang.Object}} Returns the old value that was stored for the given key, or null if there
 was no such key.
*/
put : function(  ) {},

/**Special fast path for appending items to the end of the array without validation.
 The array must already be large enough to contain the item.
@hide 
*/
append : function(  ) {},

/**The use of the {@link #append} function can result in invalid array maps, in particular
 an array map where the same key appears multiple times.  This function verifies that
 the array map is valid, throwing IllegalArgumentException if a problem is found.  The
 main use for this method is validating an array map after unpacking from an IPC, to
 protect against malicious callers.
@hide 
*/
validate : function(  ) {},

/**Perform a {@link #put(Object, Object)} of all key/value pairs in <var>array</var>
@param {Object {android.util.ArrayMap}} array The array whose contents are to be retrieved.
*/
putAll : function(  ) {},

/**Remove an existing key from the array map.
@param {Object {Object}} key The key of the mapping to remove.
@return {Object {java.lang.Object}} Returns the value that was stored under the key, or null if there
 was no such key.
*/
remove : function(  ) {},

/**Remove the key/value mapping at the given index.

 <p>For indices outside of the range <code>0...size()-1</code>, the behavior is undefined for
 apps targeting {@link android.os.Build.VERSION_CODES#P} and earlier, and an
 {@link ArrayIndexOutOfBoundsException} is thrown for apps targeting
 {@link android.os.Build.VERSION_CODES#Q} and later.</p>
@param {Number} index The desired index, must be between 0 and {@link #size()}-1.
@return {Object {java.lang.Object}} Returns the value that was stored at this index.
*/
removeAt : function(  ) {},

/**Return the number of items in this array map.
*/
size : function(  ) {},

/**{@inheritDoc}

 <p>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.
*/
equals : function(  ) {},

/**{@inheritDoc}
*/
hashCode : function(  ) {},

/**{@inheritDoc}

 <p>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.
*/
toString : function(  ) {},

/**Determine if the array map contains all of the keys in the given collection.
@param {Object {java.util.Collection}} collection The collection whose contents are to be checked against.
@return {Boolean} Returns true if this array map contains a key for every entry
 in <var>collection</var>, else returns false.
*/
containsAll : function(  ) {},

/**Perform a {@link #put(Object, Object)} of all key/value pairs in <var>map</var>
@param {Object {java.util.Map}} map The map whose contents are to be retrieved.
*/
putAll : function(  ) {},

/**Remove all keys in the array map that exist in the given collection.
@param {Object {java.util.Collection}} collection The collection whose contents are to be used to remove keys.
@return {Boolean} Returns true if any keys were removed from the array map, else false.
*/
removeAll : function(  ) {},

/**Remove all keys in the array map that do <b>not</b> exist in the given collection.
@param {Object {java.util.Collection}} collection The collection whose contents are to be used to determine which
 keys to keep.
@return {Boolean} Returns true if any keys were removed from the array map, else false.
*/
retainAll : function(  ) {},

/**Return a {@link java.util.Set} for iterating over and interacting with all mappings
 in the array map.

 <p><b>Note:</b> 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.</p>

 <p><b>Note:</b></p> the semantics of this
 Set are subtly different than that of a {@link java.util.HashMap}: most important,
 the {@link java.util.Map.Entry Map.Entry} object returned by its iterator is a single
 object that exists for the entire iterator, so you can <b>not</b> hold on to it
 after calling {@link java.util.Iterator#next() Iterator.next}.</p>
*/
entrySet : function(  ) {},

/**Return a {@link java.util.Set} for iterating over and interacting with all keys
 in the array map.

 <p><b>Note:</b> 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.</p>
*/
keySet : function(  ) {},

/**Return a {@link java.util.Collection} for iterating over and interacting with all values
 in the array map.

 <p><b>Note:</b> 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.</p>
*/
values : function(  ) {},


};