/external/qemu/ |
gen-charmap.py | 46 specials = { 'COMMA': 'Comma', variable 125 if specials.has_key(keycode): 126 keycode = specials[keycode]
|
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
Arrays2Test.java | 36 double[] specials = new double[] { Double.NEGATIVE_INFINITY, local 41 for (int i = 0; i < specials.length; i++) { 42 int result = Arrays.binarySearch(specials, specials[i]); 43 assertTrue("Assert 0: " + specials[i] + " invalid: " + result, 47 -4, Arrays.binarySearch(specials, -1d)); 49 -8, Arrays.binarySearch(specials, 1d)); 56 float[] specials = new float[] { Float.NEGATIVE_INFINITY, local 61 for (int i = 0; i < specials.length; i++) { 62 int result = Arrays.binarySearch(specials, specials[i]) [all...] |
ArraysTest.java | 167 double[] specials = new double[] { Double.NEGATIVE_INFINITY, local 171 for (int i = 0; i < specials.length; i++) { 172 int result = Arrays.binarySearch(specials, specials[i]); 173 assertTrue(specials[i] + " invalid: " + result, result == i); 175 assertEquals("-1d", -4, Arrays.binarySearch(specials, -1d)); 176 assertEquals("1d", -8, Arrays.binarySearch(specials, 1d)); 201 float[] specials = new float[] { Float.NEGATIVE_INFINITY, local 205 for (int i = 0; i < specials.length; i++) { 206 int result = Arrays.binarySearch(specials, specials[i]) 2086 double[] specials = new double[] { Double.NEGATIVE_INFINITY, local 2173 float[] specials = new float[] { Float.NEGATIVE_INFINITY, local [all...] |
/external/mksh/src/ |
var.c | 42 static struct table specials; variable in typeref:struct:table 132 ktinit(APERM, &specials, 133 /* currently 14 specials: 75% of 32 = 2^5 */ 136 tp = ktenter(&specials, initvar_names[i], 1076 tp = ktsearch(&specials, name, hash(name)); 1086 tp = ktsearch(&specials, name, hash(name)); [all...] |
/libcore/luni/src/test/java/tests/api/java/util/ |
ArraysTest.java | 155 double[] specials = new double[] { Double.NEGATIVE_INFINITY, local 159 for (int i = 0; i < specials.length; i++) { 160 int result = Arrays.binarySearch(specials, specials[i]); 161 assertTrue(specials[i] + " invalid: " + result, result == i); 163 assertEquals("-1d", -4, Arrays.binarySearch(specials, -1d)); 164 assertEquals("1d", -8, Arrays.binarySearch(specials, 1d)); 189 float[] specials = new float[] { Float.NEGATIVE_INFINITY, local 193 for (int i = 0; i < specials.length; i++) { 194 int result = Arrays.binarySearch(specials, specials[i]) [all...] |