| /external/marisa-trie/tools/ |
| marisa-find.cc | 15 FIND_FIRST,
56 void find_first(const marisa::Trie &trie, const std::string &str) { function in namespace:__anon15907
58 const marisa::UInt32 key_id = trie.find_first(str, &length);
116 case FIND_FIRST: {
117 find_first(trie, str);
179 find_mode = FIND_FIRST;
|
| /external/marisa-trie/v0_1_5/tools/ |
| marisa_alpha-find.cc | 15 FIND_FIRST,
56 void find_first(const marisa_alpha::Trie &trie, const std::string &str) { function in namespace:__anon15920
58 const marisa_alpha::UInt32 key_id = trie.find_first(str, &length);
116 case FIND_FIRST: {
117 find_first(trie, str);
180 find_mode = FIND_FIRST;
|
| /external/llvm/unittests/ADT/ |
| BitVectorTest.cpp | 77 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) {
96 EXPECT_TRUE(Vec.find_first() == 3);
107 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) {
398 EXPECT_EQ(50, C.find_first());
|
| /system/core/run-as/ |
| package.c | 308 find_first(const char* p, const char* end, char ch) function
461 const char* end = find_first(p, buffer_end, '\n');
|
| /system/media/camera/docs/ |
| CameraMetadataEnums.mako | 54 % if section.find_first(lambda x: isinstance(x, metadata_model.Entry) and x.kind == xml_name) and \
|
| CameraMetadataKeys.mako | 77 % if section.find_first(lambda x: isinstance(x, metadata_model.Entry) and x.kind == xml_name) and \
|
| metadata_helpers.py | 141 return bool(node.find_first(lambda x: isinstance(x, metadata_model.Enum)))
916 node = metadata.find_first(name_match(candidate2.replace('\n','')))
921 node = metadata.find_first(name_match(candidate2b))
932 node = metadata.find_first(name_match(candidate3.replace('\n','')))
938 node = metadata.find_first(name_match(candidate3b))
[all...] |
| /external/llvm/include/llvm/ADT/ |
| SparseBitVector.h | 131 /// find_first - Returns the index of the first set bit.
132 int find_first() const {
336 unsigned BitPos = Iter->find_first();
368 NextSetBitNumber = Iter->find_first();
772 int find_first() const {
776 return (First.index() * ElementSize) + First.find_first();
|
| SmallBitVector.h | 211 /// find_first - Returns the index of the first set bit, -1 if none
213 int find_first() const { function in class:llvm::SmallBitVector
220 return getPointer()->find_first();
|
| /external/marisa-trie/tests/ |
| trie-test.cc | 127 ASSERT(trie.find_first("ap") == trie.notfound());
128 ASSERT(trie.find_first("applex") == trie["app"]);
325 ASSERT(trie.find_first("ca") == trie.notfound());
326 ASSERT(trie.find_first("car") == trie["car"]);
327 ASSERT(trie.find_first("card", &length) == trie["car"]);
529 ASSERT(trie.find_first("") == 0);
530 ASSERT(trie.find_first("x") == 0);
|
| /external/marisa-trie/v0_1_5/tests/ |
| trie-test.cc | 129 ASSERT(trie.find_first("ap") == trie.notfound());
130 ASSERT(trie.find_first("applex") == trie["app"]);
327 ASSERT(trie.find_first("ca") == trie.notfound());
328 ASSERT(trie.find_first("car") == trie["car"]);
329 ASSERT(trie.find_first("card", &length) == trie["car"]);
547 ASSERT(trie.find_first("") == 0);
548 ASSERT(trie.find_first("x") == 0);
|
| /external/llvm/lib/CodeGen/ |
| RegisterScavenging.cpp | 59 for (int I = PR.find_first(); I>0; I = PR.find_next(I))
296 int Survivor = Candidates.find_first();
345 Survivor = Candidates.find_first();
|
| SpillPlacement.cpp | 304 for (int n = ActiveNodes->find_first(); n>=0; n = ActiveNodes->find_next(n)) {
384 for (int n = ActiveNodes->find_first(); n>=0; n = ActiveNodes->find_next(n))
|
| StackSlotColoring.cpp | 214 NextColor = AllColors.find_first();
237 Color = UsedColors.find_first();
|
| StackColoring.cpp | 410 for (int pos = MBBLiveness.LiveIn.find_first(); pos != -1;
414 for (int pos = MBBLiveness.LiveOut.find_first(); pos != -1;
|
| /external/llvm/lib/Target/Mips/ |
| Mips16InstrInfo.cpp | 373 Reg = Available.find_first();
376 Reg = Candidates.find_first();
389 SpReg = Available.find_first();
391 SpReg = Candidates.find_first();
|
| /external/marisa-trie/lib/marisa/ |
| trie-c.cc | 215 *key_id = h->trie.find_first(ptr, key_length);
217 *key_id = h->trie.find_first(ptr, length, key_length);
|
| trie.h | 91 UInt32 find_first(const char *str,
93 UInt32 find_first(const char *ptr, std::size_t length,
95 UInt32 find_first(const std::string &str,
|
| trie-inline.h | 42 inline UInt32 Trie::find_first(const std::string &str, function in class:marisa::Trie
44 return find_first(str.c_str(), str.length(), key_length);
|
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| trie.h | 91 UInt32 find_first(const char *str,
93 UInt32 find_first(const char *ptr, std::size_t length,
95 UInt32 find_first(const std::string &str,
|
| trie-c.cc | 242 *key_id = h->trie.find_first(ptr, key_length);
244 *key_id = h->trie.find_first(ptr, length, key_length);
|
| trie-inline.h | 42 inline UInt32 Trie::find_first(const std::string &str, function in class:marisa_alpha::Trie
44 return find_first(str.c_str(), str.length(), key_length);
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopRerollPass.cpp | [all...] |
| /external/llvm/lib/Analysis/ |
| DependenceAnalysis.cpp | [all...] |
| /external/llvm/lib/ProfileData/ |
| CoverageMapping.cpp | 367 int I = IsNotExpandedFile.find_first();
378 int I = IsNotExpandedFile.find_first();
|
