Lines Matching refs:search
146 // search is performed. put() simply saves the parameters in case we do
230 // Linear search of the sorted list of children.
271 // Linear search of the sorted list of children.
286 // 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,
324 search(fNodes, text, start, start, handler, status);
328 TextTrieMap::search(CharacterNode *node, const UnicodeString &text, int32_t start,
359 search(node, text, start, index+1, handler, status);
1290 fNamesTrie.search(text, start, (TextTrieMapSearchResultHandler *)&handler, status);
1341 fNamesTrie.search(text, start, (TextTrieMapSearchResultHandler *)&handler, status);
