Lines Matching refs:search
240 // search is performed. put() simply saves the parameters in case we do
316 // Linear search of the sorted list of children.
357 // Linear search of the sorted list of children.
372 // Mutex for protecting the lazy creation of the Trie node structure on the first call to search().
396 TextTrieMap::search(const UnicodeString &text, int32_t start,
407 search(fNodes, text, start, start, handler, status);
411 TextTrieMap::search(CharacterNode *node, const UnicodeString &text, int32_t start,
442 search(node, text, start, index+1, handler, status);
1493 fZoneStringsTrie.search(text, start, (TextTrieMapSearchResultHandler*)&handler, status);
1815 // Search the cache entry list
