| /dalvik/dx/src/com/android/dx/io/instructions/ |
| SparseSwitchPayloadDecodedInstruction.java | 26 private final int[] keys; field in class:SparseSwitchPayloadDecodedInstruction
38 int opcode, int[] keys, int[] targets) {
41 if (keys.length != targets.length) {
42 throw new IllegalArgumentException("keys/targets length mismatch");
45 this.keys = keys;
55 return keys;
|
| /external/skia/src/core/ |
| SkScalar.cpp | 12 SkScalar SkScalarInterpFunc(SkScalar searchKey, const SkScalar keys[],
15 SkASSERT(keys != nullptr);
19 SkASSERT(keys[i] >= keys[i-1]);
22 while (right < length && searchKey > keys[right])
31 SkScalar rightKey = keys[right];
32 SkScalar leftKey = keys[right-1];
|
| /device/google/wahoo/ |
| init.ramoops.sh | 3 # Decrypt the keys and write them to the kernel
16 # Generate keys (if none exist), and load the keys to carveout
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Demo/cgi/ |
| cgi2.py | 14 print "<h1>No Form Keys</h1>"
16 print "<h1>Form Keys</h1>"
17 for key in form.keys():
|
| /external/libbrillo/brillo/ |
| map_utils.h | 15 // Given an STL map, returns a set containing all keys from the map.
18 std::set<typename T::key_type> keys; local
20 keys.insert(keys.end(), pair.first); // Map keys are already sorted.
21 return keys;
24 // Given an STL map, returns a vector containing all keys from the map.
25 // The keys in the vector are sorted.
28 std::vector<typename T::key_type> keys; local
29 keys.reserve(map.size())
[all...] |
| /external/python/cpython2/Demo/cgi/ |
| cgi2.py | 14 print "<h1>No Form Keys</h1>"
16 print "<h1>Form Keys</h1>"
17 for key in form.keys():
|
| /external/r8/src/main/java/com/android/tools/r8/code/ |
| SparseSwitchPayload.java | 15 public final int[] keys; field in class:SparseSwitchPayload
21 keys = new int[size];
23 keys[i] = readSigned32BitValue(stream);
32 public SparseSwitchPayload(int[] keys, int[] targets) {
35 this.keys = keys;
47 write32BitValue(keys[i], dest);
60 return size == that.size && Arrays.equals(keys, that.keys) && Arrays
68 result = 31 * result + Arrays.hashCode(keys);
83 public int[] keys() { method in class:SparseSwitchPayload
[all...] |
| /libcore/ojluni/src/main/java/sun/nio/ch/ |
| MembershipRegistry.java | 34 * Simple registry of membership keys for a MulticastChannel.
41 // map multicast group to keys
55 List<MembershipKeyImpl> keys = groups.get(group); local
56 if (keys != null) {
57 for (MembershipKeyImpl key: keys) {
85 List<MembershipKeyImpl> keys; local
88 keys = null;
90 keys = groups.get(group);
92 if (keys == null) {
93 keys = new LinkedList<MembershipKeyImpl>()
104 List<MembershipKeyImpl> keys = groups.get(group); local
[all...] |
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| MapBenchmark.java | 45 @Override Map<Element, Element> create(Collection<Element> keys) {
47 for (Element element: keys) {
54 @Override Map<Element, Element> create(Collection<Element> keys) {
56 for (Element element: keys) {
63 @Override Map<Element, Element> create(Collection<Element> keys) {
64 return Collections.unmodifiableMap(Hash.create(keys));
68 @Override Map<Element, Element> create(Collection<Element> keys) {
69 return Collections.synchronizedMap(Hash.create(keys));
73 @Override Map<Element, Element> create(Collection<Element> keys) {
75 for (Element element: keys) {
[all...] |
| /external/autotest/server/site_tests/firmware_UpdateKernelDataKeyVersion/files/ |
| make_keys.sh | 7 pushd /var/tmp/faft/autest/keys
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/ |
| PBKDFKey.java | 6 * Base interface for keys associated with various password based key derivation functions (PBKDF).
|
| /external/jemalloc/test/unit/ |
| rtree.c | 62 uintptr_t keys[] = {0, 1, local
70 for (j = 0; j < sizeof(keys)/sizeof(uintptr_t); j++) {
71 assert_false(rtree_set(&rtree, keys[j], &node),
73 for (k = 0; k < sizeof(keys)/sizeof(uintptr_t); k++) {
74 assert_ptr_eq(rtree_get(&rtree, keys[k], true),
79 j, k, keys[j], keys[k]); local
85 assert_false(rtree_set(&rtree, keys[j], NULL),
103 uintptr_t keys[NSET]; local
112 keys[j] = (uintptr_t)gen_rand64(sfmt)
[all...] |
| /external/linux-kselftest/tools/testing/selftests/static_keys/ |
| Makefile | 1 # Makefile for static keys selftests
|
| /external/v8/tools/ |
| gc-nvp-to-csv.py | 20 keys = trace[0].keys()
21 print ', '.join(keys)
23 print ', '.join(map(lambda key: str(entry[key]), keys))
|
| /external/icu/icu4c/source/samples/legacy/ |
| legacy.cpp | 31 extern "C" void test_current(UChar data[][5], uint32_t size, uint32_t maxLen, uint8_t keys[][32]);
32 extern "C" void test_legacy(UChar data[][5], uint32_t size, uint32_t maxlen, uint8_t keys[][32]);
55 void printKeys(const char *comment, uint8_t keys[][32], int32_t keySize) {
60 currentKey = keys[i];
94 static uint8_t keys[4][32]; local
102 test_current(uTest, 4, 5, keys);
104 printKeys("Current keys", keys, 4);
110 test_legacy(uTest, 4, 5, keys);
112 printKeys("Legacy keys", keys, 4)
[all...] |
| /packages/apps/Car/LatinIME/res/values/ |
| strings.xml | 26 <!-- Alternative keys for a. [DO NOT TRANSLATE] -->
28 <!-- Alternative keys for c. [DO NOT TRANSLATE] -->
30 <!-- Alternative keys for e. [DO NOT TRANSLATE] -->
32 <!-- Alternative keys for i. [DO NOT TRANSLATE] -->
34 <!-- Alternative keys for l. [DO NOT TRANSLATE] -->
36 <!-- Alternative keys for n. [DO NOT TRANSLATE] -->
38 <!-- Alternative keys for o. [DO NOT TRANSLATE] -->
40 <!-- Alternative keys for s. [DO NOT TRANSLATE] -->
42 <!-- Alternative keys for u. [DO NOT TRANSLATE] -->
44 <!-- Alternative keys for y. [DO NOT TRANSLATE] --
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/ |
| AsymmetricCipherKeyPairGenerator.java | 16 * return an AsymmetricCipherKeyPair containing the generated keys.
18 * @return an AsymmetricCipherKeyPair containing the generated keys.
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_key_create/ |
| 1-1.c | 17 * 1. Define an array of keys
18 * 2. Use pthread_key_create() and create those keys
19 * 3. Verify that you can set and get specific values for those keys without errors.
32 pthread_key_t keys[NUM_OF_KEYS]; variable
40 if (pthread_key_create(&keys[i], NULL) != 0) {
45 (keys[i], (void *)(long)(i + KEY_VALUE)) != 0) {
54 rc = pthread_getspecific(keys[i]);
61 if (pthread_key_delete(keys[i]) != 0) {
|
| /art/tools/dexfuzz/src/dexfuzz/program/ |
| MSwitchInsn.java | 33 public int[] keys; field in class:MSwitchInsn
46 newInsn.keys = new int[keys.length];
47 System.arraycopy(keys, 0, newInsn.keys, 0, keys.length);
|
| /external/r8/src/main/java/com/android/tools/r8/ir/code/ |
| Switch.java | 18 private final int[] keys; field in class:Switch
24 int[] keys,
28 this.keys = keys;
35 assert keys.length <= Constants.U16BIT_MAX;
36 // Keys must be acceding, and cannot target the fallthrough.
37 assert keys.length == targetBlockIndices.length;
38 for (int i = 1; i < keys.length - 1; i++) {
39 assert keys[i - 1] < keys[i]
[all...] |
| /test/vts/runners/host/ |
| keys.py | 24 # Keys used to look up values from test config files.
25 # These keys define the wording of test configs and their internal
34 # Keys in test suite
39 # Keys for binary tests
50 # Internal keys, used internally, not exposed to user's config files.
77 # Keys for web
80 # Keys for profiling
87 # Keys for systrace (for hal tests)
95 # Keys for coverage
103 # Keys for the HAL HIDL GTest type (see VtsMultiDeviceTest.java)
[all...] |
| /cts/tests/tests/util/src/android/util/cts/ |
| LongSparseArrayTest.java | 37 private static final long[] KEYS = {12, 23, 4, 6, 8, 1, 3, -12, 0, -3, 11, 14, -23};
51 sparseArray.put(KEYS[i], VALUES[i]);
56 assertEquals(new Integer(i), sparseArray.get(KEYS[i]));
60 assertEquals(sparseArray.indexOfValue(VALUES[i]), sparseArray.indexOfKey(KEYS[i]));
64 long existKey = KEYS[0];
90 assertEquals(VALUES[1], sparseArray.get(KEYS[1]));
92 sparseArray.delete(KEYS[1]);
94 sparseArray.get(KEYS[1], VALUE_FOR_NON_EXISTED_KEY));
98 assertEquals(VALUES[2], sparseArray.get(KEYS[2]));
100 sparseArray.remove(KEYS[2])
[all...] |
| SparseArrayTest.java | 34 private static final int[] KEYS = {12, 23, 4, 6, 8, 1, 3, -12, 0, -3, 11, 14, -23};
48 sparseArray.put(KEYS[i], VALUES[i]);
53 assertEquals(new Integer(i), sparseArray.get(KEYS[i]));
57 assertEquals(sparseArray.indexOfValue(VALUES[i]), sparseArray.indexOfKey(KEYS[i]));
61 int existKey = KEYS[0];
87 assertEquals(VALUES[1], sparseArray.get(KEYS[1]));
89 sparseArray.delete(KEYS[1]);
91 sparseArray.get(KEYS[1], VALUE_FOR_NON_EXISTED_KEY));
95 assertEquals(VALUES[2], sparseArray.get(KEYS[2]));
97 sparseArray.remove(KEYS[2])
[all...] |
| SparseLongArrayTest.java | 35 private static final int[] KEYS = {12, 23, 4, 6, 8, 1, 3, -12, 0, -3, 11, 14, -23};
49 sparseArray.put(KEYS[i], VALUES[i]);
54 assertEquals(i, sparseArray.get(KEYS[i]));
58 assertEquals(sparseArray.indexOfValue(VALUES[i]), sparseArray.indexOfKey(KEYS[i]));
62 int existKey = KEYS[0];
84 assertEquals(VALUES[1], sparseArray.get(KEYS[1]));
86 sparseArray.delete(KEYS[1]);
88 sparseArray.get(KEYS[1], VALUE_FOR_NON_EXISTED_KEY));
92 assertEquals(VALUES[2], sparseArray.get(KEYS[2]));
94 sparseArray.delete(KEYS[2])
[all...] |
| /external/v8/src/ |
| keys.h | 16 // This is a helper class for JSReceiver::GetKeys which collects and sorts keys.
17 // GetKeys needs to sort keys per prototype level, first showing the integer
19 // does not apply to proxies which are in full control of how the keys are
22 // For performance reasons the KeyAccumulator internally separates integer keys
23 // in |elements_| into sorted lists per prototype level. String keys are
25 // Symbols in |symbol_properties_|. To separate the keys per level later when
27 // String and Symbol keys per level.
29 // Only unique keys are kept by the KeyAccumulator, strings are stored in a
30 // HashSet for inexpensive lookups. Integer keys are kept in sorted lists which
68 // Filter keys based on their property descriptors
100 Handle<OrderedHashSet> keys() { return Handle<OrderedHashSet>::cast(keys_); } function in class:v8::internal::BASE_EMBEDDED
[all...] |
