How to use

gc

method

in

com.lody.virtual.helper.collection.SparseArray

/**
 * Given an index in the range <code>0...size()-1</code>, returns
 * the key from the <code>index</code>th key-value mapping that this
 * SparseArray stores.
 */
public int keyAt(int index) {
  if (mGarbage) {
    gc();
  }
  return mKeys[index];
}

/**
 * Given an index in the range <code>0...size()-1</code>, sets a new
 * value for the <code>index</code>th key-value mapping that this
 * SparseArray stores.
 */
public void setValueAt(int index, E value) {
  if (mGarbage) {
    gc();
  }
  mValues[index] = value;
}

/**
 * Returns the number of key-value mappings that this SparseArray
 * currently stores.
 */
public int size() {
  if (mGarbage) {
    gc();
  }
  return mSize;
}

/**
 * Given an index in the range <code>0...size()-1</code>, returns
 * the value from the <code>index</code>th key-value mapping that this
 * SparseArray stores.
 */
@SuppressWarnings("unchecked")
public E valueAt(int index) {
  if (mGarbage) {
    gc();
  }
  return (E) mValues[index];
}

/**
 * Returns an index for which {@link #valueAt} would return the
 * specified key, or a negative number if no keys map to the
 * specified value.
 * <p>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.
 * <p>Note also that unlike most collections' {@code indexOf} methods,
 * this method compares values using {@code ==} rather than {@code equals}.
 */
public int indexOfValue(E value) {
  if (mGarbage) {
    gc();
  }
  for (int i = 0; i < mSize; i++)
    if (mValues[i] == value)
      return i;
  return -1;
}

/**
 * Returns the index for which {@link #keyAt} would return the
 * specified key, or a negative number if the specified
 * key is not mapped.
 */
public int indexOfKey(int key) {
  if (mGarbage) {
    gc();
  }
  return  ContainerHelpers.binarySearch(mKeys, mSize, key);
}

/**
 * Puts a key/value pair into the array, optimizing for the case where
 * the key is greater than all existing keys in the array.
 */
public void append(int key, E value) {
  if (mSize != 0 && key <= mKeys[mSize - 1]) {
    put(key, value);
    return;
  }
  if (mGarbage && mSize >= mKeys.length) {
    gc();
  }
  int pos = mSize;
  if (pos >= mKeys.length) {
    int n =  ContainerHelpers.idealIntArraySize(pos + 1);
    int[] nkeys = new int[n];
    Object[] nvalues = new Object[n];
    // Log.e("SparseArray", "grow " + mKeys.length + " to " + n);
    System.arraycopy(mKeys, 0, nkeys, 0, mKeys.length);
    System.arraycopy(mValues, 0, nvalues, 0, mValues.length);
    mKeys = nkeys;
    mValues = nvalues;
  }
  mKeys[pos] = key;
  mValues[pos] = value;
  mSize = pos + 1;
}

gc();

/**
 * Returns the number of key-value mappings that this SparseArray
 * currently stores.
 */
public int size() {
  if (mGarbage) {
    gc();
  }
  return mSize;
}

/**
 * Returns the number of key-value mappings that this SparseArray
 * currently stores.
 */
public int size() {
  if (mGarbage) {
    gc();
  }
  return mSize;
}

/**
 * Given an index in the range <code>0...size()-1</code>, returns
 * the key from the <code>index</code>th key-value mapping that this
 * SparseArray stores.
 */
public int keyAt(int index) {
  if (mGarbage) {
    gc();
  }
  return mKeys[index];
}

/**
 * Given an index in the range <code>0...size()-1</code>, sets a new
 * value for the <code>index</code>th key-value mapping that this
 * SparseArray stores.
 */
public void setValueAt(int index, E value) {
  if (mGarbage) {
    gc();
  }
  mValues[index] = value;
}

/**
 * Given an index in the range <code>0...size()-1</code>, returns
 * the value from the <code>index</code>th key-value mapping that this
 * SparseArray stores.
 */
@SuppressWarnings("unchecked")
public E valueAt(int index) {
  if (mGarbage) {
    gc();
  }
  return (E) mValues[index];
}

/**
 * Given an index in the range <code>0...size()-1</code>, returns
 * the key from the <code>index</code>th key-value mapping that this
 * SparseArray stores.
 */
public int keyAt(int index) {
  if (mGarbage) {
    gc();
  }
  return mKeys[index];
}

/**
 * Given an index in the range <code>0...size()-1</code>, returns
 * the value from the <code>index</code>th key-value mapping that this
 * SparseArray stores.
 */
@SuppressWarnings("unchecked")
public E valueAt(int index) {
  if (mGarbage) {
    gc();
  }
  return (E) mValues[index];
}

/**
 * Given an index in the range <code>0...size()-1</code>, sets a new
 * value for the <code>index</code>th key-value mapping that this
 * SparseArray stores.
 */
public void setValueAt(int index, E value) {
  if (mGarbage) {
    gc();
  }
  mValues[index] = value;
}

/**
 * Returns an index for which {@link #valueAt} would return the
 * specified key, or a negative number if no keys map to the
 * specified value.
 * <p>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.
 * <p>Note also that unlike most collections' {@code indexOf} methods,
 * this method compares values using {@code ==} rather than {@code equals}.
 */
public int indexOfValue(E value) {
  if (mGarbage) {
    gc();
  }
  for (int i = 0; i < mSize; i++)
    if (mValues[i] == value)
      return i;
  return -1;
}

/**
 * Returns an index for which {@link #valueAt} would return the
 * specified key, or a negative number if no keys map to the
 * specified value.
 * <p>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.
 * <p>Note also that unlike most collections' {@code indexOf} methods,
 * this method compares values using {@code ==} rather than {@code equals}.
 */
public int indexOfValue(E value) {
  if (mGarbage) {
    gc();
  }
  for (int i = 0; i < mSize; i++)
    if (mValues[i] == value)
      return i;
  return -1;
}

/**
 * Returns the index for which {@link #keyAt} would return the
 * specified key, or a negative number if the specified
 * key is not mapped.
 */
public int indexOfKey(int key) {
  if (mGarbage) {
    gc();
  }
  return  ContainerHelpers.binarySearch(mKeys, mSize, key);
}

/**
 * Returns the index for which {@link #keyAt} would return the
 * specified key, or a negative number if the specified
 * key is not mapped.
 */
public int indexOfKey(int key) {
  if (mGarbage) {
    gc();
  }
  return  ContainerHelpers.binarySearch(mKeys, mSize, key);
}