| /third_party/gn/src/gn/ |
| D | vector_utils_unittest.cc | 12 VectorSetSorter<std::string> sorter; in TEST() local
18 sorter.Add(input.begin(), input.end()); in TEST()
19 auto result = sorter.AsVector(); in TEST()
29 VectorSetSorter<std::string> sorter; in TEST() local
35 sorter.Add(input.begin(), input.end()); in TEST()
39 sorter.IterateOver( in TEST()
|
| D | json_project_writer.cc | 403 VectorSetSorter<base::FilePath> sorter( in GenerateJSON() local
406 input_file_manager->AddAllPhysicalInputFileNamesToVectorSetSorter(&sorter); in GenerateJSON()
408 sorter.Add(other_files.begin(), other_files.end()); in GenerateJSON()
419 sorter.IterateOver(item_callback); in GenerateJSON()
|
| D | ninja_build_writer.cc | 315 VectorSetSorter<base::FilePath> sorter( in WriteNinjaRules() local
318 input_file_manager->AddAllPhysicalInputFileNamesToVectorSetSorter(&sorter); in WriteNinjaRules()
319 sorter.Add(other_files.begin(), other_files.end()); in WriteNinjaRules()
336 sorter.IterateOver(item_callback); in WriteNinjaRules()
|
| D | input_file_manager.cc | 268 VectorSetSorter<base::FilePath>* sorter) const { in AddAllPhysicalInputFileNamesToVectorSetSorter()
273 sorter->Add(file.second->file.physical_name()); in AddAllPhysicalInputFileNamesToVectorSetSorter()
|
| D | input_file_manager.h | 103 VectorSetSorter<base::FilePath>* sorter) const;
|
| /third_party/boost/libs/thread/example/ |
| D | parallel_quick_sort.cpp | 27 struct sorter struct
49 …boost::future<std::list<T> > new_lower = boost::async(pool, &sorter::do_sort, this, std::move(new_… in do_sort() argument
73 sorter<T> s; in parallel_quick_sort()
|
| /third_party/grpc/third_party/upb/upb/ |
| D | text_encode.c | 20 _upb_mapsorter sorter; member
236 _upb_mapsorter_pushmap(&e->sorter, upb_fielddef_descriptortype(key_f), map, in txtenc_map()
238 while (_upb_sortedmap_next(&e->sorter, map, &sorted, &ent)) { in txtenc_map()
244 _upb_mapsorter_popmap(&e->sorter, &sorted); in txtenc_map()
416 _upb_mapsorter_init(&e.sorter); in upb_text_encode()
419 _upb_mapsorter_destroy(&e.sorter); in upb_text_encode()
|
| D | encode.c | 37 _upb_mapsorter sorter; member
380 _upb_mapsorter_pushmap(&e->sorter, layout->fields[0].descriptortype, map, in encode_map()
383 while (_upb_sortedmap_next(&e->sorter, map, &sorted, &ent)) { in encode_map()
386 _upb_mapsorter_popmap(&e->sorter, &sorted); in encode_map()
458 _upb_mapsorter_init(&e.sorter); in upb_encode_ex()
476 _upb_mapsorter_destroy(&e.sorter); in upb_encode_ex()
|
| /third_party/node/deps/npm/node_modules/unique-filename/coverage/ |
| D | sorter.js | 73 sorter = function (a, b) {
78 finalSorter = sorter,
86 return -1 * sorter(a, b);
|
| D | base.css | 141 div.coverage-summary .sorter {
148 div.coverage-summary .sorted .sorter {
151 div.coverage-summary .sorted-desc .sorter {
|
| /third_party/node/deps/npm/node_modules/mute-stream/coverage/lcov-report/ |
| D | sorter.js | 73 sorter = function (a, b) {
78 finalSorter = sorter,
86 return -1 * sorter(a, b);
|
| D | base.css | 141 .coverage-summary .sorter {
148 .coverage-summary .sorted .sorter {
151 .coverage-summary .sorted-desc .sorter {
|
| /third_party/mindspore/mindspore/_extends/parse/ |
| D | standard_method.py | 985 def searchsorted(x, v, side='left', sorter=None): argument
1019 if sorter is not None:
1020 if sorter.ndim != 1 or sorter.size != a.size:
1022 sorter = const_utils.make_tensor(sorter)
1023 sorter = sorter.reshape(sorter.shape + (1,))
1024 a = F.gather_nd(a, sorter)
|
| /third_party/icu/tools/colprobe/ |
| D | colprobe.cpp | 1026 Line **sorter = new Line*[size*10]; in detectExpansions() local
1068 setArray(sorter, doubles, newSize); in detectExpansions()
1069 qsort(sorter, newSize, sizeof(Line*), comparer); in detectExpansions()
1070 analyzeStrength(sorter, newSize, comparer); in detectExpansions()
1072 printOrdering(sorter, newSize, log); in detectExpansions()
1075 while(**(sorter+i) != *current) { in detectExpansions()
1079 if((*(sorter+i))->strength == UCOL_IDENTICAL) { in detectExpansions()
1081 origin = *(gLines+((*(sorter+i-1))->suffix)); in detectExpansions()
1084 } else if(i < newSize-1 && (*(sorter+i+1))->strength == UCOL_IDENTICAL) { in detectExpansions()
1085 origin = *(gLines+((*(sorter+i+1))->suffix)); in detectExpansions()
[all …]
|
| /third_party/mindspore/mindspore/common/ |
| D | tensor.py | 1612 def searchsorted(self, v, side='left', sorter=None): argument
1648 if sorter is not None:
1649 if sorter.ndim != 1 or sorter.size != a.size:
1651 sorter = tensor_operator_registry.get('make_tensor')(sorter)
1652 sorter = sorter.reshape(sorter.shape + (1,))
1653 a = tensor_operator_registry.get('gather_nd')(a, sorter)
|
| /third_party/mindspore/mindspore/numpy/ |
| D | math_ops.py | 4283 def searchsorted(a, v, side='left', sorter=None): argument
4326 if sorter is not None:
4327 if F.rank(sorter) != 1 or sorter.size != a.size:
4329 sorter = _to_tensor(sorter)
4330 sorter = F.expand_dims(sorter, -1)
4331 a = F.gather_nd(a, sorter)
|
| /third_party/mindspore/tests/st/numpy_native/ |
| D | test_math_ops.py | 2094 sorter = onp.random.shuffle(onp.arange(20))
2095 match_res(mnp.searchsorted, onp.searchsorted, x, y, side='right', sorter=sorter)
2700 sorter = onp.random.shuffle(onp.arange(20))
2703 match_res(mnp_x.searchsorted, x.searchsorted, y, sorter=sorter)
2704 match_res(mnp_x.searchsorted, x.searchsorted, y, side='right', sorter=sorter)
|
| /third_party/grpc/doc/ |
| D | environment_variables.md | 51 resolver's resolved address sorter
|
| /third_party/boost/libs/graph/doc/ |
| D | minimum_degree_ordering.w | 99 @d Insert vertices into bucket sorter (bucket number equals degree) @{
|
| /third_party/boost/libs/thread/doc/ |
| D | async_executors.qbk | 64 struct sorter
87 boost::async(pool, &sorter::do_sort, this, std::move(new_lower_chunk));
103 sorter<T> s;
|
| /third_party/gettext/gettext-runtime/po/ |
| D | nb.po | 1455 #~ " -F, --sort-by-file sorter utdata etter fillokasjon\n"
1605 #~ " -F, --sort-by-file sorter utdata etter fillokasjon\n"
1667 #~ " -s, --sort-output sorter utdata og fjern duplikater\n"
|
| /third_party/mesa3d/src/mesa/state_tracker/ |
| D | st_glsl_to_tgsi.cpp | 6621 sort_inout_decls sorter; in sort_inout_decls_by_slot() local
6622 sorter.mapping = mapping; in sort_inout_decls_by_slot()
6623 std::sort(decls, decls + count, sorter); in sort_inout_decls_by_slot()
|
| /third_party/gettext/gettext-tools/po/ |
| D | nn.po | 4668 #~ " -F, --sort-by-file sorter utdata etter fil-lokasjon\n"
4866 #~ " -F, --sort-by-file sorter utdata etter fil-lokasjon\n"
|
| /third_party/glib/ |
| D | NEWS | 5362 711756 gthreadpool: Don't pass bad data to GThreadPool sorter
|
| /third_party/chromium/patch/ |
| D | 0003-3.2-Beta3-1115.patch | 92773 u32 szSorterRef; /* Min size in bytes to use sorter-refs */
102037 /* Open the sorter cursor if we are to use one. */
103680 ** can be more efficient than storing them directly in the sorter records.
103684 ** for which the sorter-reference optimization should be enabled.
130414 u32 szSorterRef; /* Min size in bytes to use sorter-refs */
139678 /* Open the sorter cursor if we are to use one. */
141321 ** can be more efficient than storing them directly in the sorter records.
141325 ** for which the sorter-reference optimization should be enabled.
164527 /* Open the sorter cursor if we are to use one. */
170129 ** can be more efficient than storing them directly in the sorter records.
[all …]
|