Searched defs:find (Results 1 - 5 of 5) sorted by relevance
/system/core/include/utils/ |
H A D | BasicHashtable.h | 33 // may need to seek further along the chain to find the entry. 69 ssize_t find(ssize_t index, hash_t hash, const void* __restrict__ key) const; 276 * find the first matching entry. 280 inline ssize_t find(ssize_t index, hash_t hash, const TKey& key) const { function in class:android::BasicHashtable 281 return BasicHashtableImpl::find(index, hash, &key); 302 * to continue iterating over the hashtable using next() or find().
|
/system/core/libutils/ |
H A D | BasicHashtable.cpp | 113 ssize_t BasicHashtableImpl::find(ssize_t index, hash_t hash, function in class:android::BasicHashtableImpl
|
H A D | String8.cpp | 400 ssize_t String8::find(const char* other, size_t start) const function in class:android::String8 412 ssize_t index = find(other); 422 ssize_t next = find(other, index + skip); 587 // find the last dot
|
/system/core/libutils/tests/ |
H A D | BasicHashtable_test.cpp | 128 static ssize_t find(BasicHashtable<TKey, key_value_pair_t<TKey, TValue> >& h, function in namespace:android 130 return h.find(index, hash_type(key), key); 136 ssize_t index = find(h, -1, key); 216 ssize_t index = find(h, -1, 8); 222 ASSERT_EQ(index, find(h, -1, 8)); 226 index = find(h, index, 8); 232 index = find(h, -1, 8); 241 ssize_t index = find(h, -1, int(i)); 247 ASSERT_EQ(index, find(h, -1, int(i))); 251 index = find( [all...] |
/system/keymaster/ |
H A D | authorization_set.cpp | 106 int AuthorizationSet::find(keymaster_tag_t tag, int begin) const { function in class:keymaster::AuthorizationSet 447 int pos = find(tag); 460 pos = find(tag, pos); 471 int pos = find(tag); 484 pos = find(tag, pos); 495 int pos = find(tag); 504 int pos = find(tag); 513 int pos = find(tag);
|
Completed in 227 milliseconds