HomeSort by relevance Sort by last modified time
    Searched defs:KEYS (Results 1 - 25 of 33) sorted by null

1 2

  /frameworks/base/services/core/jni/
com_android_server_tv_TvKeys.h 9 // Map the keys specified in virtual-remote.kl.
10 // Only specify the keys actually used in the layout here.
17 static Key KEYS[] = {
  /cts/tests/tests/util/src/android/util/cts/
ArraySetTest.java 62 private static int[] KEYS = new int[] {
205 assertEquals("OPS and KEYS must be equal length", OPS.length, KEYS.length);
213 ControlledHash key = KEYS[i] < 0 ? null : new ControlledHash(KEYS[i]);
214 String strKey = KEYS[i] < 0 ? null : Integer.toString(KEYS[i]);
LongSparseArrayTest.java 27 private static final long[] KEYS = {12, 23, 4, 6, 8, 1, 3, -12, 0, -3, 11, 14, -23};
40 sparseArray.put(KEYS[i], VALUES[i]);
45 assertEquals(new Integer(i), sparseArray.get(KEYS[i]));
49 assertEquals(sparseArray.indexOfValue(VALUES[i]), sparseArray.indexOfKey(KEYS[i]));
53 long existKey = KEYS[0];
79 assertEquals(VALUES[1], sparseArray.get(KEYS[1]));
81 sparseArray.delete(KEYS[1]);
83 sparseArray.get(KEYS[1], VALUE_FOR_NON_EXISTED_KEY));
87 assertEquals(VALUES[2], sparseArray.get(KEYS[2]));
89 sparseArray.remove(KEYS[2])
    [all...]
SparseArrayTest.java 23 private static final int[] KEYS = {12, 23, 4, 6, 8, 1, 3, -12, 0, -3, 11, 14, -23};
36 sparseArray.put(KEYS[i], VALUES[i]);
41 assertEquals(new Integer(i), sparseArray.get(KEYS[i]));
45 assertEquals(sparseArray.indexOfValue(VALUES[i]), sparseArray.indexOfKey(KEYS[i]));
49 int existKey = KEYS[0];
75 assertEquals(VALUES[1], sparseArray.get(KEYS[1]));
77 sparseArray.delete(KEYS[1]);
79 sparseArray.get(KEYS[1], VALUE_FOR_NON_EXISTED_KEY));
83 assertEquals(VALUES[2], sparseArray.get(KEYS[2]));
85 sparseArray.remove(KEYS[2])
    [all...]
SparseBooleanArrayTest.java 23 private static final int[] KEYS = {12, 23, 4, 6, 8, 1, 3, -12, 0, -3, 11, 14, -23};
40 sparseBooleanArray.put(KEYS[i], VALUES[i]);
44 assertEquals(VALUES[i], sparseBooleanArray.get(KEYS[i]));
51 keyIndex = sparseBooleanArray.indexOfKey(KEYS[i]);
58 int existKey = KEYS[0];
80 assertEquals(VALUES[1], sparseBooleanArray.get(KEYS[1]));
82 sparseBooleanArray.delete(KEYS[1]);
84 sparseBooleanArray.get(KEYS[1], VALUE_FOR_NON_EXISTED_KEY));
96 sparseBooleanArray.put(KEYS[i], VALUES[i]);
100 assertEquals(VALUES[i], sparseBooleanArray.get(KEYS[i]))
    [all...]
SparseLongArrayTest.java 27 private static final int[] KEYS = {12, 23, 4, 6, 8, 1, 3, -12, 0, -3, 11, 14, -23};
40 sparseArray.put(KEYS[i], VALUES[i]);
45 assertEquals(i, sparseArray.get(KEYS[i]));
49 assertEquals(sparseArray.indexOfValue(VALUES[i]), sparseArray.indexOfKey(KEYS[i]));
53 int existKey = KEYS[0];
75 assertEquals(VALUES[1], sparseArray.get(KEYS[1]));
77 sparseArray.delete(KEYS[1]);
79 sparseArray.get(KEYS[1], VALUE_FOR_NON_EXISTED_KEY));
83 assertEquals(VALUES[2], sparseArray.get(KEYS[2]));
85 sparseArray.delete(KEYS[2])
    [all...]
ArrayMapTest.java 63 static int[] KEYS = new int[] {
343 ControlledHash key = KEYS[i] < 0 ? null : new ControlledHash(KEYS[i]);
344 String strKey = KEYS[i] < 0 ? null : Integer.toString(KEYS[i]);
465 * Test creating a malformed array map with duplicated keys and that we will catch this
SparseIntArrayTest.java 26 private static final int[] KEYS = {12, 23, 4, 6, 8, 1, 3, -12, 0, -3, 11, 14, -23};
42 sparseIntArray.put(KEYS[i], VALUES[i]);
46 assertEquals(VALUES[i], sparseIntArray.get(KEYS[i]));
50 sparseIntArray.indexOfKey(KEYS[i]));
54 int existKey = KEYS[0];
75 assertEquals(VALUES[1], sparseIntArray.get(KEYS[1]));
77 sparseIntArray.delete(KEYS[1]);
79 sparseIntArray.get(KEYS[1], VALUE_FOR_NON_EXISTED_KEY));
91 sparseIntArray.put(KEYS[i], VALUES[i]);
95 assertEquals(VALUES[i], sparseIntArray.get(KEYS[i]))
    [all...]
  /external/robolectric/v1/src/test/java/com/xtremelabs/robolectric/shadows/
SparseArrayTest.java 39 private static final int[] KEYS = {12, 23, 4, 6, 8, 1, 3, -12, 0, -3, 11, 14, -23};
54 sparseArray.put(KEYS[i], VALUES[i]);
59 assertEquals(new Integer(i), sparseArray.get(KEYS[i]));
63 assertEquals(sparseArray.indexOfValue(VALUES[i]), sparseArray.indexOfKey(KEYS[i]));
67 int existKey = KEYS[0];
93 assertEquals(VALUES[1], sparseArray.get(KEYS[1]));
95 sparseArray.delete(KEYS[1]);
97 sparseArray.get(KEYS[1], VALUE_FOR_NON_EXISTED_KEY));
101 assertEquals(VALUES[2], sparseArray.get(KEYS[2]));
103 sparseArray.remove(KEYS[2])
    [all...]
  /external/icu/android_icu4j/src/main/java/android/icu/impl/
TZDBTimeZoneNames.java 144 private static final String[] KEYS = {"ss", "sd"};
164 String[] names = new String[KEYS.length];
167 names[i] = table.getString(KEYS[i]);
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
TZDBTimeZoneNames.java 142 private static final String[] KEYS = {"ss", "sd"};
162 String[] names = new String[KEYS.length];
165 names[i] = table.getString(KEYS[i]);
  /frameworks/base/core/tests/coretests/src/android/app/backup/
BackupDataTest.java 49 private static final String[] KEYS = {KEY1, KEY2, KEY3, KEY4};
104 for(int i = 0; i < KEYS.length; i++) {
105 writeEntity(bdo, KEYS[i], DATA[i].getBytes());
114 readAndVerifyEntity(bdi, KEYS[count], DATA[count].getBytes());
117 assertEquals("four entities in this stream", KEYS.length, count);
125 for(int i = 0; i < KEYS.length; i++) {
126 deleteEntity(bdo, KEYS[i]);
135 readAndVerifyDeletedEntity(bdi, KEYS[count]);
138 assertEquals("four deletes in this stream", KEYS.length, count);
148 deleteEntity(bdo, KEYS[i]); i++
    [all...]
  /frameworks/base/tests/ActivityTests/src/com/google/android/test/activity/
ArrayMapTests.java 57 static int[] KEYS = new int[] {
346 ControlledHash key = KEYS[i] < 0 ? null : new ControlledHash(KEYS[i]);
349 Log.i("test", "Adding key: " + KEYS[i]);
356 Log.i("test", "Removing key: " + KEYS[i]);
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/javax/xml/parsers/
SAXParserTestSupport.java 33 * Support for SAXParserTest. Shares the element keys used in the golden files.
71 static String [] KEYS = {KEY_IS_START_DOC, KEY_IS_END_DOC, KEY_TEXT,
105 if(i < KEYS.length) {
106 storage.put(KEYS[i], str.toString());
150 for(int i = 0; i < KEYS.length; i++) {
151 if(!original.get(KEYS[i]).equals(result.get(KEYS[i]))) {
152 System.out.println("for "+KEYS[i]+": original:" +
153 original.get(KEYS[i]));
155 System.out.println(" result:" + result.get(KEYS[i]))
    [all...]
  /libcore/ojluni/src/main/java/java/util/
Hashtable.java 35 * This class implements a hash table, which maps keys to values. Any
39 * objects used as keys must implement the <code>hashCode</code>
72 * the numbers as keys:
95 * The Enumerations returned by Hashtable's keys and elements methods are
233 * Returns the number of keys in this hashtable.
235 * @return the number of keys in this hashtable.
242 * Tests if this hashtable maps no keys to values.
244 * @return <code>true</code> if this hashtable maps no keys to values;
252 * Returns an enumeration of the keys in this hashtable.
254 * @return an enumeration of the keys in this hashtable
260 public synchronized Enumeration<K> keys() { method in class:Hashtable
    [all...]
  /external/icu/icu4c/source/i18n/
tznames_impl.cpp 40 static const char* KEYS[] = {"lg", "ls", "ld", "sg", "ss", "sd"};
41 static const int32_t KEYS_SIZE = (sizeof KEYS / sizeof KEYS[0]);
608 const UChar *value = ures_getStringByKeyWithFallback(rbTable, KEYS[i], &len, &status);
    [all...]
  /prebuilts/devtools/tools/lib/
monkeyrunner.jar 
  /prebuilts/gradle-plugin/com/android/tools/monkeyrunner/24.4.0-beta6/
monkeyrunner-24.4.0-beta6.jar 
  /prebuilts/gradle-plugin/com/android/tools/monkeyrunner/24.5.0/
monkeyrunner-24.5.0.jar 
  /prebuilts/gradle-plugin/com/android/tools/monkeyrunner/25.0.0-alpha1/
monkeyrunner-25.0.0-alpha1.jar 
  /external/guice/extensions/struts2/lib/
freemarker-2.3.16.jar 
  /prebuilts/tools/common/m2/repository/org/freemarker/freemarker/2.3.20/
freemarker-2.3.20.jar 
  /prebuilts/eclipse/maven/apache-maven-3.2.1/lib/
aether-util-0.9.0.M2.jar 
  /prebuilts/tools/common/m2/repository/org/eclipse/aether/aether-util/0.9.0.M2/
aether-util-0.9.0.M2.jar 
  /prebuilts/tools/common/m2/repository/org/eclipse/aether/aether-util/0.9.0.M3/
aether-util-0.9.0.M3.jar 

Completed in 1021 milliseconds

1 2