How to use

SimpleArrayMap

in

com.lody.virtual.helper.collection

if (key == null) {
  hash = 0;
  index = indexOfNull();
} else {
  hash = key.hashCode();
  index = indexOf(key, hash);
  allocArrays(n);
  freeArrays(ohashes, oarray, mSize);

/**
 * Perform a {@link #put(Object, Object)} of all key/value pairs in <var>array</var>
 * @param array The array whose contents are to be retrieved.
 */
public void putAll(SimpleArrayMap<? extends K, ? extends V> array) {
  final int N = array.mSize;
  ensureCapacity(mSize + N);
  if (mSize == 0) {
    if (N > 0) {
      System.arraycopy(array.mHashes, 0, mHashes, 0, N);
      System.arraycopy(array.mArray, 0, mArray, 0, N<<1);
      mSize = N;
    }
  } else {
    for (int i=0; i<N; i++) {
      put(array.keyAt(i), array.valueAt(i));
    }
  }
}

/**
 * Remove an existing key from the array map.
 * @param key The key of the mapping to remove.
 * @return Returns the value that was stored under the key, or null if there
 * was no such key.
 */
public V remove(Object key) {
  final int index = indexOfKey(key);
  if (index >= 0) {
    return removeAt(index);
  }
  return null;
}

/**
 * Returns the index of a key in the set.
 *
 * @param key The key to search for.
 * @return Returns the index of the key if it exists, else a negative integer.
 */
public int indexOfKey(Object key) {
  return key == null ? indexOfNull() : indexOf(key, key.hashCode());
}

if (isEmpty()) {
  return "{}";
    buffer.append(", ");
  Object key = keyAt(i);
  if (key != this) {
    buffer.append(key);
  Object value = valueAt(i);
  if (value != this) {
    buffer.append(value);

if (size() != map.size()) {
  return false;
    K key = keyAt(i);
    V mine = valueAt(i);
    Object theirs = map.get(key);
    if (mine == null) {

/**
 * Ensure the array map can hold at least <var>minimumCapacity</var>
 * items.
 */
public void ensureCapacity(int minimumCapacity) {
  if (mHashes.length < minimumCapacity) {
    final int[] ohashes = mHashes;
    final Object[] oarray = mArray;
    allocArrays(minimumCapacity);
    if (mSize > 0) {
      System.arraycopy(ohashes, 0, mHashes, 0, mSize);
      System.arraycopy(oarray, 0, mArray, 0, mSize<<1);
    }
    freeArrays(ohashes, oarray, mSize);
  }
}

/**
 * Check whether a key exists in the array.
 *
 * @param key The key to search for.
 * @return Returns true if the key exists, else false.
 */
public boolean containsKey(Object key) {
  return indexOfKey(key) >= 0;
}

/**
 * Make the array map empty.  All storage is released.
 */
public void clear() {
  if (mSize != 0) {
    freeArrays(mHashes, mArray, mSize);
    mHashes = ContainerHelpers.EMPTY_INTS;
    mArray = ContainerHelpers.EMPTY_OBJECTS;
    mSize = 0;
  }
}

/**
 * Check whether a value exists in the array.  This requires a linear search
 * through the entire array.
 *
 * @param value The value to search for.
 * @return Returns true if the value exists, else false.
 */
public boolean containsValue(Object value) {
  return indexOfValue(value) >= 0;
}

/**
 * Create a new ArrayMap with a given initial capacity.
 */
public SimpleArrayMap(int capacity) {
  if (capacity == 0) {
    mHashes = ContainerHelpers.EMPTY_INTS;
    mArray = ContainerHelpers.EMPTY_OBJECTS;
  } else {
    allocArrays(capacity);
  }
  mSize = 0;
}

if (isEmpty()) {
  return "{}";
    buffer.append(", ");
  Object key = keyAt(i);
  if (key != this) {
    buffer.append(key);
  Object value = valueAt(i);
  if (value != this) {
    buffer.append(value);

if (size() != map.size()) {
  return false;
    K key = keyAt(i);
    V mine = valueAt(i);
    Object theirs = map.get(key);
    if (mine == null) {

freeArrays(mHashes, mArray, mSize);
mHashes = ContainerHelpers.EMPTY_INTS;
mArray = ContainerHelpers.EMPTY_OBJECTS;
  allocArrays(n);

/**
 * Returns the index of a key in the set.
 *
 * @param key The key to search for.
 * @return Returns the index of the key if it exists, else a negative integer.
 */
public int indexOfKey(Object key) {
  return key == null ? indexOfNull() : indexOf(key, key.hashCode());
}

/**
 * Retrieve a value from the array.
 * @param key The key of the value to retrieve.
 * @return Returns the value associated with the given key,
 * or null if there is no such key.
 */
public V get(Object key) {
  final int index = indexOfKey(key);
  return index >= 0 ? (V)mArray[(index<<1)+1] : null;
}

/**
 * Make the array map empty.  All storage is released.
 */
public void clear() {
  if (mSize != 0) {
    freeArrays(mHashes, mArray, mSize);
    mHashes = ContainerHelpers.EMPTY_INTS;
    mArray = ContainerHelpers.EMPTY_OBJECTS;
    mSize = 0;
  }
}

/**
 * Check whether a value exists in the array.  This requires a linear search
 * through the entire array.
 *
 * @param value The value to search for.
 * @return Returns true if the value exists, else false.
 */
public boolean containsValue(Object value) {
  return indexOfValue(value) >= 0;
}

/**
 * Create a new ArrayMap with a given initial capacity.
 */
public SimpleArrayMap(int capacity) {
  if (capacity == 0) {
    mHashes = ContainerHelpers.EMPTY_INTS;
    mArray = ContainerHelpers.EMPTY_OBJECTS;
  } else {
    allocArrays(capacity);
  }
  mSize = 0;
}

/**
 * Perform a {@link #put(Object, Object)} of all key/value pairs in <var>array</var>
 * @param array The array whose contents are to be retrieved.
 */
public void putAll(SimpleArrayMap<? extends K, ? extends V> array) {
  final int N = array.mSize;
  ensureCapacity(mSize + N);
  if (mSize == 0) {
    if (N > 0) {
      System.arraycopy(array.mHashes, 0, mHashes, 0, N);
      System.arraycopy(array.mArray, 0, mArray, 0, N<<1);
      mSize = N;
    }
  } else {
    for (int i=0; i<N; i++) {
      put(array.keyAt(i), array.valueAt(i));
    }
  }
}