Lines Matching refs:search
144 // search is performed. put() simply saves the parameters in case we do
228 // Linear search of the sorted list of children.
269 // Linear search of the sorted list of children.
284 // Mutex for protecting the lazy creation of the Trie node structure on the first call to search().
307 TextTrieMap::search(const UnicodeString &text, int32_t start,
318 search(fNodes, text, start, start, handler, status);
322 TextTrieMap::search(CharacterNode *node, const UnicodeString &text, int32_t start,
353 search(node, text, start, index+1, handler, status);
1251 fNamesTrie.search(text, start, (TextTrieMapSearchResultHandler *)&handler, status);
1302 fNamesTrie.search(text, start, (TextTrieMapSearchResultHandler *)&handler, status);
