Lines Matching refs:search
176 // search is performed. put() simply saves the parameters in case we do
260 // Linear search of the sorted list of children.
301 // Linear search of the sorted list of children.
316 // Mutex for protecting the lazy creation of the Trie node structure on the first call to search().
337 TextTrieMap::search(const UnicodeString &text, int32_t start,
354 search(fNodes, text, start, start, handler, status);
358 TextTrieMap::search(CharacterNode *node, const UnicodeString &text, int32_t start,
389 search(node, text, start, index+1, handler, status);
1347 fNamesTrie.search(text, start, (TextTrieMapSearchResultHandler *)&handler, status);
1398 fNamesTrie.search(text, start, (TextTrieMapSearchResultHandler *)&handler, status);
1945 gTZDBNamesTrie->search(text, start, (TextTrieMapSearchResultHandler *)&handler, status);
