| /build/tools/releasetools/ |
| edify_generator.py | 52 m = x.search(cmd)
|
| check_target_files_signatures | 226 m = re.search('A: (\S*?)(?:\(0x[0-9a-f]+\))?="(.*?)" \(Raw', line)
|
| /external/gtest/test/ |
| gtest_filter_unittest.py | 271 param_tests_present = PARAM_TEST_REGEX.search(
|
| /external/guava/src/com/google/common/primitives/ |
| generate.sh | 182 * @param array the array to search for the sequence {@code target}
183 * @param target the array to search for as a sub-sequence of {@code array}
|
| /external/libvpx/vp8/encoder/ |
| onyx_int.h | 229 vp8_search_rtcd_vtable_t search; member in struct:VP8_ENCODER_RTCD
289 int alt_is_last; // Alt reference frame same as last ( short circuit altref search)
290 int gold_is_alt; // don't do both alt and gold search ( just do gold).
|
| /external/protobuf/gtest/test/ |
| gtest_filter_unittest.py | 311 param_tests_present = PARAM_TEST_REGEX.search(
|
| /external/webkit/WebCore/dom/ |
| Element.h | 92 DEFINE_ATTRIBUTE_EVENT_LISTENER(search);
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| algorithmfwd.h | 337 search(_FIter1, _FIter1, _FIter2, _FIter2, __gnu_parallel::sequential_tag);
341 search(_FIter1, _FIter1, _FIter2, _FIter2);
345 search(_FIter1, _FIter1, _FIter2, _FIter2, _BiPredicate,
350 search(_FIter1, _FIter1, _FIter2, _FIter2, _BiPredicate);
|
| algo.h | 54 #include <parallel/search.h>
1028 search(ForwardIterator1 begin1, ForwardIterator1 end1, function in namespace:std::__parallel
1067 search(ForwardIterator1 begin1, ForwardIterator1 end1, function in namespace:std::__parallel
1083 search(ForwardIterator1 begin1, ForwardIterator1 end1, function in namespace:std::__parallel
1120 search(ForwardIterator1 begin1, ForwardIterator1 end1, function in namespace:std::__parallel
[all...] |
| /external/chromium/net/http/ |
| http_response_headers.cc | 588 const std::string& search) const {
594 if (static_cast<size_t>(name_end - name_begin) == search.size() &&
595 std::equal(name_begin, name_end, search.begin(),
[all...] |
| /frameworks/base/docs/html/guide/ |
| guide_toc.cs | 254 <div><a href="<?cs var:toroot?>guide/topics/search/index.html">
255 <span class="en">Search</span>
258 <li><a href="<?cs var:toroot?>guide/topics/search/search-dialog.html">Using the Android Search Dialog</a></li>
259 <li><a href="<?cs var:toroot?>guide/topics/search/adding-recent-query-suggestions.html">Adding Recent Query Suggestions</a></li>
260 <li><a href="<?cs var:toroot?>guide/topics/search/adding-custom-suggestions.html">Adding Custom Suggestions</a></li>
261 <li><a href="<?cs var:toroot?>guide/topics/search/searchable-config.html">Searchable Configuration</a></li>
[all...] |
| /external/chromium/third_party/icu/source/i18n/ |
| zstrfmt.cpp | 275 // Linear search of the sorted list of children.
316 // Linear search of the sorted list of children.
332 TextTrieMap::search(const UnicodeString &text, int32_t start, function in class:TextTrieMap
337 search(fNodes, text, start, start, handler, status);
341 TextTrieMap::search(CharacterNode *node, const UnicodeString &text, int32_t start, function in class:TextTrieMap
372 search(node, text, start, index+1, handler, status);
[all...] |
| /external/icu4c/i18n/ |
| zstrfmt.cpp | 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, function in class:TextTrieMap
407 search(fNodes, text, start, start, handler, status);
411 TextTrieMap::search(CharacterNode *node, const UnicodeString &text, int32_t start, function in class:TextTrieMap
442 search(node, text, start, index+1, handler, status);
[all...] |
| /external/chromium/third_party/icu/source/test/intltest/ |
| ssearch.cpp | 311 // Do the search, check the match result against the expected results.
342 // Do the backwards search, check the match result against the expected results.
463 errln("Could not open search object for %s", testCases[t].locale);
657 // Do the search, check the match result against the expected results.
[all...] |
| /external/icu4c/test/intltest/ |
| ssearch.cpp | 312 // Do the search, check the match result against the expected results.
341 // Do the backwards search, check the match result against the expected results.
456 errln("Could not open search object for %s", testCases[t].locale);
650 // Do the search, check the match result against the expected results.
[all...] |
| /external/chromium/third_party/libevent/ |
| event_rpcgen.py | [all...] |
| /external/icu4c/common/ |
| triedict.cpp | 82 // cuts a special case out of the search/insertion functions.
110 MutableTrieDictionary::search( UText *text, function in class:MutableTrieDictionary
177 matched = search(fIter, length, NULL, count, 0, parent, pMatched);
225 return search(text, maxLength, lengths, count, limit, parent, pMatched);
513 // Horizontal node; do binary search
[all...] |
| /build/tools/droiddoc/templates/assets/ |
| android-developer-reference.js | 369 /* Expand all inherited members in the class. Used when initiating page search */
380 * - Listen for Ctrl+F (Cmd on Mac) and expand all inherited members (to aid page search)
|
| /external/chromium/base/ |
| win_util.cc | 431 searching for "download windows sdk 2008" in your favorite web search engine. \
|
| /external/v8/tools/ |
| stats-viewer.py | 105 m = re.search(r"/dev/shm/\S*", maps_file.read())
|
| /external/webkit/WebCore/html/ |
| HTMLAnchorElement.cpp | 505 String HTMLAnchorElement::search() const function in class:WebCore::HTMLAnchorElement
|
| /external/webkit/WebCore/page/ |
| DOMWindow.h | 309 DEFINE_ATTRIBUTE_EVENT_LISTENER(search);
|
| /external/webkit/WebKitTools/Scripts/ |
| bisect-builds | 100 print STDERR "Search WebKit nightly builds for changes in behavior.\n";
108 [-r|--revision M[:N]] specify starting (and optional ending) revisions to search
|
| /external/bluetooth/bluez/lib/ |
| sdp.c | [all...] |
| /external/v8/src/ |
| array.js | 674 // binary search
677 // The search interval is a[min..max[
994 // If index is still negative, search the entire array.
1016 // If index is still negative, do not search the array.
[all...] |
