| /external/chromium_org/third_party/skia/src/gpu/gl/ |
| GrGpuGL_program.cpp | 88 int GrGpuGL::ProgramCache::search(const GrGLProgramDesc& desc) const { function in class:GrGpuGL::ProgramCache
117 entryIdx = this->search(desc);
|
| /external/chromium_org/third_party/skia/src/pdf/ |
| SkPDFGraphicState.cpp | 187 GSCanonicalEntry search(&paint);
188 return CanonicalPaints().find(search);
|
| /external/chromium_org/tools/page_cycler/common/ |
| head.js | 87 var s = document.location.search;
|
| /external/chromium_org/v8/benchmarks/spinning-balls/ |
| splay-tree.js | 30 * search tree with the additional property that recently accessed
70 // Splay on the key to move the last node on the search path for
162 // node on the search path to the top of the tree.
191 * key, the last node on the search path is moved to the top of the
193 * "Self-adjusting Binary Search Trees" by Sleator and Tarjan
|
| /external/chromium_org/v8/test/promises-aplus/lib/ |
| require.js | 36 if (name.search('./helpers/') === 0) {
|
| /external/chromium_org/v8/tools/ |
| splaytree.js | 31 * search tree with the additional property that recently accessed
72 // Splay on the key to move the last node on the search path for
179 // node on the search path to the top of the tree.
217 * key, the last node on the search path is moved to the top of the
219 * "Self-adjusting Binary Search Trees" by Sleator and Tarjan
|
| /external/clang/utils/ |
| token-delta.py | 71 res = self.search(c, sets)
82 def search(self, c, sets): member in class:DeltaAlgorithm
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.build.tools/src_rss/org/eclipse/releng/util/rss/ |
| messages.properties | 20 RSSFeedCommon.XpathError=Error: no xpath string to search for, eg., /*/*[name() = 'entry'][1]/*[name() = 'updated']/text()
|
| /external/chromium_org/chrome/common/extensions/docs/examples/extensions/buildbot/ |
| bg.js | 236 var url = "https://codereview.chromium.org/search" +
245 var searchBaseURL = "https://codereview.chromium.org/search";
249 var usernameScrapingURL = "https://codereview.chromium.org/search";
|
| /external/chromium_org/testing/gtest/scripts/ |
| pump.py | 172 m = regex.search(line)
245 m = regex.search(line)
263 m = re.search(regex, line)
272 m = re.search(regex, line)
780 return re.search(r'/\* IWYU pragma: ', line)
787 re.search(r'// IWYU pragma: ', line))
|
| /external/chromium_org/third_party/skia/gm/rebaseline_server/static/ |
| live-loader.js | 136 $scope.setADir = $location.search().setADir;
137 $scope.setASection = $location.search().setASection;
138 $scope.setBDir = $location.search().setBDir;
139 $scope.setBSection = $location.search().setBSection;
486 var nameValuePairs = $location.search();
521 $location.search(nameValuePairs);
[all...] |
| /external/chromium_org/third_party/sqlite/src/src/ |
| test_malloc.c | 776 Tcl_HashSearch search; local
779 pEntry=Tcl_FirstHashEntry(&aMallocLog, &search);
781 pEntry=Tcl_NextHashEntry(&search)
829 Tcl_HashSearch search; local
836 pEntry=Tcl_FirstHashEntry(&aMallocLog, &search);
838 pEntry=Tcl_NextHashEntry(&search)
[all...] |
| /external/chromium_org/third_party/re2/re2/testing/ |
| regexp_benchmark.cc | 61 fprintf(stderr, "Search: %7lld bytes (peak=%lld)\n", mc.HeapGrowth(), mc.PeakHeapGrowth());
133 // Benchmark: failed search for regexp in random text.
135 // Generate random text that won't contain the search string,
136 // to test worst-case search behavior.
148 // Makes text of size nbytes, then calls run to search
150 void Search(int iters, int nbytes, const char* regexp, SearchImpl* search) {
156 search(iters, regexp, s, Prog::kUnanchored, false);
161 // giving the search loop something to memchr for.
179 void Search_Easy0_CachedDFA(int i, int n) { Search(i, n, EASY0, SearchCachedDFA);
[all...] |
| /build/tools/droiddoc/templates-sdk/ |
| customizations.cs | 482 <div class="search" id="search-container">
483 <div class="search-inner">
484 <div id="search-btn"></div>
496 </div><!-- end search-inner -->
497 </div><!-- end search-container -->
527 </div><!-- end menu-container (search and menu widget) -->
|
| /build/tools/droiddoc/templates-sdk-dyn/ |
| customizations.cs | 450 <div class="search" id="search-container">
451 <div class="search-inner">
452 <div id="search-btn"></div>
464 </div><!-- end search-inner -->
465 </div><!-- end search-container -->
495 </div><!-- end menu-container (search and menu widget) -->
|
| /build/tools/droiddoc/templates-sdk/assets/css/ |
| default.css | 1553 Header, Login, Nav-X, Search
[all...] |
| /art/tools/ |
| cpplint.py | 374 matched = _RE_SUPPRESSION.search(raw_line)
411 # The regexp compilation caching is inlined in both Match and Search for
419 def Search(pattern, s):
423 return _regexp_compile_cache[pattern].search(s)
[all...] |
| /external/compiler-rt/lib/sanitizer_common/scripts/ |
| cpplint.py | 374 matched = _RE_SUPPRESSION.search(raw_line)
411 # The regexp compilation caching is inlined in both Match and Search for
419 def Search(pattern, s):
423 return _regexp_compile_cache[pattern].search(s)
[all...] |
| /build/tools/droiddoc/templates-ds/assets/ |
| android-developer-core.css | 321 #search {
484 /* SEARCH FILTER */
490 #search-button {
543 /* SEARCH */
545 /* restrict global search form width */
605 /* Disable built in search forms */
606 .gsc-control form.gsc-search-box {
609 table.gsc-search-box {
627 td.gsc-search-button {
633 #search-button
[all...] |
| /build/tools/droiddoc/templates-pdk/assets/ |
| android-developer-core.css | 320 #search {
483 /* SEARCH FILTER */
489 #search-button {
542 /* SEARCH */
544 /* restrict global search form width */
604 /* Disable built in search forms */
605 .gsc-control form.gsc-search-box {
608 table.gsc-search-box {
626 td.gsc-search-button {
632 #search-button
[all...] |
| /external/chromium_org/chrome/browser/resources/chromeos/ |
| keyboard_overlay.js | 26 'SEARCH': 'modifier-search'
33 'E0 5B': 'is-search'
37 'search': 'E0 5B',
60 91: 'search',
61 92: 'search',
207 91: 'SEARCH',
214 'SEARCH': searchIsPressed
219 searchIsPressed = isPressed['SEARCH'];
222 return ['SHIFT', 'CTRL', 'ALT', 'SEARCH'].filter
[all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/ |
| webrunner.js | 237 var search = window.limitSearch || (window.location.search || "?").substr(1); variable
239 search = search.replace(/&runStyle=([^&]+)/, function(all, type){
244 var parts = search.split("&");
277 var id = search.match(/id=([\d,]+)/);
[all...] |
| /external/chromium_org/tools/auto_bisect/ |
| bisect_perf_regression.py | 8 This script bisects a series of changelists using binary search. It starts at
10 known-good revision. It will then binary search across this revision range by
456 re_results = rxp.search(deps_file_contents)
546 if re.search(v8_branch_pattern, deps_content):
556 if re.search(v8_src_pattern, deps_content):
579 match = re.search(angle_rev_pattern % deps_var, deps_contents)
590 match = re.search(angle_rev_pattern, deps_contents)
669 single_result_match = single_result_re.search(current_line)
670 multi_results_match = multi_results_re.search(current_line)
671 mean_stddev_match = mean_stddev_re.search(current_line
[all...] |
| /external/chromium_org/third_party/icu/source/i18n/ |
| tznames_impl.cpp | 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, function in class:TextTrieMap
324 search(fNodes, text, start, start, handler, status);
328 TextTrieMap::search(CharacterNode *node, const UnicodeString &text, int32_t start, function in class:TextTrieMap
359 search(node, text, start, index+1, handler, status);
[all...] |
| /external/icu/icu4c/source/i18n/ |
| tznames_impl.cpp | 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, function in class:TextTrieMap
324 search(fNodes, text, start, start, handler, status);
328 TextTrieMap::search(CharacterNode *node, const UnicodeString &text, int32_t start, function in class:TextTrieMap
359 search(node, text, start, index+1, handler, status);
[all...] |
