| /external/libffi/ |
| ltconfig | [all...] |
| /external/valgrind/main/callgrind/ |
| callgrind_annotate.in | 216 -I --include=<dir> add <dir> to list of directories to search for
[all...] |
| /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
| regexp-dna.js | [all...] |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Tools.pas | 341 /// This could be done using hashing or binary search, but this is inefficient
343 /// scenarios, we use simple linear search here.
|
| /external/elfutils/src/ |
| nm.c | 46 #include <search.h>
700 gettext ("cannot create search tree"));
[all...] |
| /external/harfbuzz_ng/src/ |
| hb-open-type-private.hh | 952 inline int search (const SearchType &x) const { function in struct:OT::SortedArrayOf
954 /* Linear search is *much* faster for small counts. */
|
| /external/libvpx/libvpx/vpx_mem/memory_manager/include/ |
| cavl_impl.h | 348 /* Last unbalanced node encountered in search for insertion point. */
481 L_SC AVL_HANDLE L_(search)(L_(avl) *l_tree, AVL_KEY k, avl_search_type st)
808 /* Search for node already in tree with same key. */
|
| /external/protobuf/python/ |
| mox.py | 914 # pattern is the regular expression to search for
929 return self.regex.search(rhs) is not None
[all...] |
| /external/stlport/stlport/stl/ |
| _algo.h | 124 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
127 // search_n. Search for __count consecutive copies of __val.
479 // Binary search (lower_bound, upper_bound, equal_range, binary_search).
|
| _algobase.h | 672 // search.
674 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
|
| _string.c | 432 _STLP_STD::search(this->_M_Start() + __pos, this->_M_Finish(),
|
| /external/webkit/PerformanceTests/SunSpider/tests/parse-only/ |
| mootools-1.2.2-core-nc.js | 99 'String': ["charAt", "charCodeAt", "concat", "indexOf", "lastIndexOf", "match", "replace", "search", "slice", "split", "substr", "substring", "toLowerCase", "toUpperCase", "valueOf"]
[all...] |
| /external/webkit/Source/WebCore/dom/ |
| Document.h | 292 DEFINE_ATTRIBUTE_EVENT_LISTENER(search);
[all...] |
| /external/webkit/Source/WebCore/platform/graphics/android/context/ |
| PlatformGraphicsContextRecording.cpp | 446 m_recording->m_tree.search(iclip, nodes);
[all...] |
| /external/webkit/Source/WebKit/win/ |
| WebView.h | 644 BSTR search, BOOL caseSensitive, BOOL highlight, UINT limit, UINT* matches);
[all...] |
| /frameworks/base/services/java/com/android/server/ |
| SystemServer.java | 65 import com.android.server.search.SearchManagerService;
583 Slog.i(TAG, "Search Service");
587 reportWtf("starting Search Service", e);
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.h | 124 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
127 // search_n. Search for __count consecutive copies of __val.
479 // Binary search (lower_bound, upper_bound, equal_range, binary_search).
|
| _algobase.h | 672 // search.
674 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
|
| _string.c | 432 _STLP_STD::search(this->_M_Start() + __pos, this->_M_Finish(),
|
| /packages/apps/Browser/src/com/android/browser/provider/ |
| BrowserProvider.java | 47 import com.android.browser.search.SearchEngine;
92 // SHORT..LONG: filled by search suggestions
186 // search_client_id includes search prefix, legacy client_id does not include prefix
288 "search TEXT," +
448 * "Search the web".
451 * "Search the web";
452 * 2. If bookmark/history entries has a match, "Search the web" shows up at
453 * the second place. Otherwise, "Search the web" shows up at the first
546 int type = -1; // 0: web search; 1: history; 2: suggestion
634 // global search for query rewriting
[all...] |
| /packages/apps/Mms/src/com/android/mms/ui/ |
| ConversationList.java | 390 mSearchItem = menu.findItem(R.id.search);
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.h | 124 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
127 // search_n. Search for __count consecutive copies of __val.
479 // Binary search (lower_bound, upper_bound, equal_range, binary_search).
|
| _algobase.h | 672 // search.
674 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
|
| _string.c | 432 _STLP_STD::search(this->_M_Start() + __pos, this->_M_Finish(),
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.h | 124 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
127 // search_n. Search for __count consecutive copies of __val.
479 // Binary search (lower_bound, upper_bound, equal_range, binary_search).
|
