Lines Matching refs:value
177 * Adds a mapping from the specified key to the specified value,
181 public void put(int key, E value) {
185 mValues[i] = value;
191 mValues[i] = value;
223 mValues[i] = value;
229 * Returns the number of key-value mappings that this SparseArray
242 * the key from the <code>index</code>th key-value mapping that this
255 * the value from the <code>index</code>th key-value mapping that this
269 * value for the <code>index</code>th key-value mapping that this
272 public void setValueAt(int index, E value) {
277 mValues[index] = value;
296 * specified value.
298 * and that multiple keys can map to the same value and this will
303 public int indexOfValue(E value) {
309 if (mValues[i] == value)
316 * Removes all key-value mappings from this SparseArray.
331 * Puts a key/value pair into the array, optimizing for the case where
334 public void append(int key, E value) {
336 put(key, value);
360 mValues[pos] = value;
368 * this map contains itself as a value, the string "(this Map)"
386 Object value = valueAt(i);
387 if (value != this) {
388 buffer.append(value);
440 static int binarySearch(int[] array, int size, int value) {
448 if (midVal < value) {
450 } else if (midVal > value) {
453 return mid; // value found
456 return ~lo; // value not present