| /external/mesa3d/src/gallium/state_trackers/clover/core/ |
| base.hpp | 257 keys(const std::pair<T, S> &ent) { function in namespace:clover
|
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/ |
| Amf0Track.java | 70 LinkedList<Long> keys = new LinkedList<Long>(rawSamples.keySet()); local
71 Collections.sort(keys);
73 for (Long key : keys) {
|
| /external/smali/dexlib/src/main/java/org/jf/dexlib/Util/ |
| SparseArray.java | 106 int[] keys = mKeys; local
114 keys[o] = keys[i];
246 * specified key, or a negative number if no keys map to the
249 * and that multiple keys can map to the same value and this will
281 * the key is greater than all existing keys in the array.
|
| /external/stlport/test/unit/ |
| find_test.cpp | 90 Key keys[10] = { {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0} }; local
91 Key const* k = find(keys + 0, keys + 10, 5);
92 CPPUNIT_ASSERT( k == keys + 10 );
|
| /external/v8/test/mjsunit/ |
| keyed-call-ic.js | 58 var keys = variable
|
| /external/wpa_supplicant_8/src/eap_server/ |
| ikev2.h | 35 struct ikev2_keys keys; member in struct:ikev2_initiator_data
|
| /frameworks/av/media/libmediaplayerservice/nuplayer/ |
| NuPlayerDecoder.cpp | 163 const char * keys[] = { "channel-count", "sample-rate", "is-adts" }; local
164 for (unsigned int i = 0; i < sizeof(keys) / sizeof(keys[0]); i++) {
166 if (!mFormat->findInt32(keys[i], &oldVal) || !targetFormat->findInt32(keys[i], &newVal)
|
| /frameworks/base/core/java/android/util/ |
| LongSparseArray.java | 25 * auto-boxing keys and its data structure doesn't rely on an extra entry object
29 * using a binary search to find keys. The implementation is not intended to be appropriate for
37 * keys: instead of compacting its array immediately, it leaves the removed entry marked
44 * {@link #keyAt(int)} and {@link #valueAt(int)}. Iterating over the keys using
46 * keys in ascending order, or the values corresponding to the keys in ascending
156 long[] keys = mKeys; local
164 keys[o] = keys[i];
248 * <p>The keys corresponding to indices in ascending order are guaranteed t
[all...] |
| /frameworks/ml/bordeaux/service/src/android/bordeaux/services/ |
| Learning_StochasticLinearRanker.java | 77 String[] keys = new String[temp.size()]; local
80 keys[i] = temp.get(i).key;
85 return mLearningSlRanker.scoreSample(keys,values);
|
| /libcore/json/src/test/java/org/json/ |
| JSONObjectTest.java | 888 assertFalse(object.keys().hasNext());
890 object.keys().next();
903 Iterator<String> keys = (Iterator<String>) object.keys(); local
905 assertTrue(keys.hasNext());
906 result.add(keys.next());
907 assertTrue(keys.hasNext());
908 result.add(keys.next());
909 assertFalse(keys.hasNext());
913 keys.next()
922 Iterator keys = object.keys(); local
[all...] |
| /libcore/luni/src/main/java/java/io/ |
| SerializationHandleMap.java | 28 private Object[] keys; field in class:SerializationHandleMap
45 Object[] oldKeys = keys;
48 this.keys = new Object[newSize];
55 int index = findIndex(key, keys);
56 keys[index] = key;
63 int index = findIndex(key, keys);
64 if (keys[index] == key) {
99 int index = findIndex(_key, keys);
102 if (keys[index] != _key) {
105 index = findIndex(_key, keys);
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| find_test.cpp | 90 Key keys[10] = { {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0} }; local
91 Key const* k = find(keys + 0, keys + 10, 5);
92 CPPUNIT_ASSERT( k == keys + 10 );
|
| /ndk/tests/device/test-stlport/unit/ |
| find_test.cpp | 90 Key keys[10] = { {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0} }; local
91 Key const* k = find(keys + 0, keys + 10, 5);
92 CPPUNIT_ASSERT( k == keys + 10 );
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| UserDict.py | 39 def keys(self): return self.data.keys() member in class:UserDict
90 # and keys. Without knowledge of the subclass constructor, the mixin
97 for k in self.keys():
124 for key in self.keys():
158 elif hasattr(other, 'keys'):
159 for k in other.keys():
180 return len(self.keys())
|
| shelve.py | 4 with dbm databases is that the values (not the keys!) in a shelf can
7 types, and objects containing lots of shared sub-objects. The keys
24 list = d.keys() # a list of all existing keys (slow!)
80 __getitem__ = __setitem__ = __delitem__ = keys = closed
100 def keys(self): member in class:Shelf
101 return self.dict.keys()
|
| weakref.py | 233 """ Mapping class that references keys weakly.
315 """Return an iterator that yields the weak references to the keys.
321 keep the keys around longer than needed.
339 """Return a list of weak references to the keys.
345 keep the keys around longer than needed.
348 return self.data.keys()
350 def keys(self): member in class:WeakKeyDictionary
352 for wr in self.data.keys():
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_userdict.py | 91 # Test keys, items, values
92 self.assertEqual(u2.keys(), d2.keys())
97 for i in u2.keys():
118 for i in u2.keys():
129 keys = u2.keys()
130 self.assertEqual(set(ikeys), set(keys))
166 self.assertNotIn(2, d.keys())
236 def keys(self) member in class:SeqDict
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| UserDict.py | 39 def keys(self): return self.data.keys() member in class:UserDict
90 # and keys. Without knowledge of the subclass constructor, the mixin
97 for k in self.keys():
124 for key in self.keys():
158 elif hasattr(other, 'keys'):
159 for k in other.keys():
180 return len(self.keys())
|
| shelve.py | 4 with dbm databases is that the values (not the keys!) in a shelf can
7 types, and objects containing lots of shared sub-objects. The keys
24 list = d.keys() # a list of all existing keys (slow!)
80 __getitem__ = __setitem__ = __delitem__ = keys = closed
100 def keys(self): member in class:Shelf
101 return self.dict.keys()
|
| weakref.py | 233 """ Mapping class that references keys weakly.
315 """Return an iterator that yields the weak references to the keys.
321 keep the keys around longer than needed.
339 """Return a list of weak references to the keys.
345 keep the keys around longer than needed.
348 return self.data.keys()
350 def keys(self): member in class:WeakKeyDictionary
352 for wr in self.data.keys():
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_userdict.py | 91 # Test keys, items, values
92 self.assertEqual(u2.keys(), d2.keys())
97 for i in u2.keys():
118 for i in u2.keys():
129 keys = u2.keys()
130 self.assertEqual(set(ikeys), set(keys))
166 self.assertNotIn(2, d.keys())
236 def keys(self) member in class:SeqDict
[all...] |
| /libcore/luni/src/test/java/org/apache/harmony/security/tests/java/security/ |
| KeyFactory2Test.java | 117 KeyPair keys = keyGen.generateKeyPair(); local
122 KeySpec privateKeySpec = fact.getKeySpec(keys.getPrivate(),
126 Arrays.toString(keys.getPrivate().getEncoded()),
128 privateKey = fact.generatePrivate(new PKCS8EncodedKeySpec(keys.getPrivate().getEncoded()));
130 Arrays.toString(keys.getPrivate().getEncoded()),
147 KeyPair keys = keyGen.generateKeyPair(); local
151 KeySpec publicKeySpec = fact.getKeySpec(keys.getPublic(),
158 Arrays.toString(keys.getPublic().getEncoded()),
239 KeyPair keys = keyGen.generateKeyPair(); local
243 KeySpec privateKeySpec = fact.getKeySpec(keys.getPrivate()
296 KeyPair keys = keyGen.generateKeyPair(); local
[all...] |
| /external/chromium_org/third_party/protobuf/java/src/test/java/com/google/protobuf/ |
| SmallSortedMapTest.java | 401 Iterator<Integer> keys = keySet.iterator(); local
402 while (keys.hasNext()) {
403 Integer key = keys.next();
410 keys.remove();
417 private Set<Integer> makeSortedKeySet(Integer... keys) {
418 return new TreeSet<Integer>(Arrays.<Integer>asList(keys));
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| MapsTransformValuesTest.java | 207 Set<String> keys = map.keySet(); local
208 keys.remove("b");
211 Iterator<String> keyIterator = keys.iterator();
237 assertTrue(keys.isEmpty());
|
| /bionic/tests/ |
| pthread_test.cpp | 32 #if !defined(__GLIBC__) // glibc uses keys internally that its sysconf value doesn't account for.
34 // We can allocate _SC_THREAD_KEYS_MAX keys.
35 std::vector<pthread_key_t> keys; local
40 keys.push_back(key);
47 // (Don't leak all those keys!)
48 for (size_t i = 0; i < keys.size(); ++i) {
49 ASSERT_EQ(0, pthread_key_delete(keys[i]));
|
