| /external/rust/crates/serde_cbor/tests/ |
| D | canonical.rs | 29 let mut sorted = expected.clone(); in integer_canonical_sort_order() localVariable
30 sorted.sort(); in integer_canonical_sort_order()
32 assert_eq!(expected, sorted); in integer_canonical_sort_order()
42 let mut sorted = expected.clone(); in string_canonical_sort_order() localVariable
43 sorted.sort(); in string_canonical_sort_order()
45 assert_eq!(expected, sorted); in string_canonical_sort_order()
55 let mut sorted = expected.clone(); in bytes_canonical_sort_order() localVariable
56 sorted.sort(); in bytes_canonical_sort_order()
58 assert_eq!(expected, sorted); in bytes_canonical_sort_order()
65 let mut sorted = expected.clone(); in simple_data_canonical_sort_order() localVariable
[all …]
|
| /external/selinux/prebuilts/bin/ |
| D | sediff.py | 138 for name, added, removed in sorted(diff.modified_properties, key=lambda x: x.property):
149 for c in sorted(diff.added_commons):
153 for c in sorted(diff.removed_commons):
157 for name, mod in sorted(diff.modified_commons.items()):
165 for p in sorted(mod.added_perms):
167 for p in sorted(mod.removed_perms):
177 for c in sorted(diff.added_classes):
181 for c in sorted(diff.removed_classes):
185 for name, mod in sorted(diff.modified_classes.items()):
193 for p in sorted(mod.added_perms):
[all …]
|
| /external/webp/src/utils/ |
| D | huffman_utils.c | 82 uint16_t sorted[]) { in BuildHuffmanTable() argument
94 assert((root_table != NULL && sorted != NULL) || in BuildHuffmanTable()
95 (root_table == NULL && sorted == NULL)); in BuildHuffmanTable()
124 if (sorted != NULL) { in BuildHuffmanTable()
125 sorted[offset[symbol_code_length]++] = symbol; in BuildHuffmanTable()
134 if (sorted != NULL) { in BuildHuffmanTable()
137 code.value = (uint16_t)sorted[0]; in BuildHuffmanTable()
165 code.value = (uint16_t)sorted[symbol++]; in BuildHuffmanTable()
193 code.value = (uint16_t)sorted[symbol++]; in BuildHuffmanTable()
223 uint16_t sorted[SORTED_SIZE_CUTOFF]; in VP8LBuildHuffmanTable() local
[all …]
|
| /external/rust/crates/remain/tests/ |
| D | order.rs | 3 #[remain::sorted]
10 #[remain::sorted]
17 #[remain::sorted]
23 #[remain::sorted]
30 #[remain::sorted]
37 #[remain::sorted]
53 #[remain::sorted]
|
| /external/skia/infra/bots/task_drivers/perf_puppeteer_canvas/ |
| D | perf_puppeteer_canvas.go | 273 sorted := make([]float32, len(input))
274 copy(sorted, input)
275 sort.Slice(sorted, func(i, j int) bool {
276 return sorted[i] < sorted[j]
279 avg := computeAverage(sorted)
281 for i := 0; i < len(sorted); i++ {
282 variance += (sorted[i] - avg) * (sorted[i] - avg)
284 stddev := float32(math.Sqrt(float64(variance / float32(len(sorted)))))
286 medIdx := (len(sorted) * 50) / 100
287 percentile90Idx := (len(sorted) * 90) / 100
[all …]
|
| /external/skia/docs/examples/ |
| D | Rect_joinNonEmptyArg.cpp | 8 SkRect sorted = rect.makeSorted(); in draw() local
12 sorted.joinNonEmptyArg(toJoin); in draw()
13 SkDebugf("sorted: %g, %g, %g, %g\n", sorted.fLeft, sorted.fTop, sorted.fRight, sorted.fBottom); in draw()
|
| D | Rect_joinPossiblyEmptyRect.cpp | 8 SkRect sorted = rect.makeSorted(); in draw() local
12 sorted.joinPossiblyEmptyRect(toJoin); in draw()
13 SkDebugf("sorted: %g, %g, %g, %g\n", sorted.fLeft, sorted.fTop, sorted.fRight, sorted.fBottom); in draw()
|
| /external/autotest/server/ |
| D | site_utils_unittest.py | 88 self.assertEqual(sorted(test_views.keys()),
89 sorted(expected_test_views.keys()),
91 (sorted(test_views.keys()),
92 sorted(expected_test_views.keys())))
95 self.assertEqual(sorted(test_status_list),
96 sorted(expected_test_views[test_name]),
100 sorted(test_status_list),
101 sorted(expected_test_views[test_name])))
|
| /external/python/cpython3/Doc/howto/ |
| D | sorting.rst | 11 in-place. There is also a :func:`sorted` built-in function that builds a new
12 sorted list from an iterable.
20 A simple ascending sort is very easy: just call the :func:`sorted` function. It
21 returns a new sorted list::
23 >>> sorted([5, 2, 3, 1, 4])
28 than :func:`sorted` - but if you don't need the original list, it's slightly
37 lists. In contrast, the :func:`sorted` function accepts any iterable.
39 >>> sorted({1: 'D', 2: 'B', 3: 'B', 4: 'E', 5: 'A'})
45 Both :meth:`list.sort` and :func:`sorted` have a *key* parameter to specify a
51 >>> sorted("This is a test string from Andrew".split(), key=str.lower)
[all …]
|
| /external/skia/infra/bots/task_drivers/perf_puppeteer_skottie_frames/ |
| D | perf_puppeteer_skottie_frames.go | 345 sorted := make([]float32, len(input))
346 copy(sorted, input)
347 sort.Slice(sorted, func(i, j int) bool {
348 return sorted[i] < sorted[j]
351 avg := computeAverage(sorted)
353 for i := 0; i < len(sorted); i++ {
354 variance += (sorted[i] - avg) * (sorted[i] - avg)
356 stddev := float32(math.Sqrt(float64(variance / float32(len(sorted)))))
358 medIdx := (len(sorted) * 50) / 100
359 p90Idx := (len(sorted) * 90) / 100
[all …]
|
| /external/python/cpython2/Doc/howto/ |
| D | sorting.rst | 11 in-place. There is also a :func:`sorted` built-in function that builds a new
12 sorted list from an iterable.
20 A simple ascending sort is very easy: just call the :func:`sorted` function. It
21 returns a new sorted list::
23 >>> sorted([5, 2, 3, 1, 4])
28 than :func:`sorted` - but if you don't need the original list, it's slightly
37 lists. In contrast, the :func:`sorted` function accepts any iterable.
39 >>> sorted({1: 'D', 2: 'B', 3: 'B', 4: 'E', 5: 'A'})
45 Starting with Python 2.4, both :meth:`list.sort` and :func:`sorted` added a
51 >>> sorted("This is a test string from Andrew".split(), key=str.lower)
[all …]
|
| /external/skqp/docs/ |
| D | SkIRect_Reference.bmh | 19 May contain any value. The smaller of the horizontal values when sorted.
25 May contain any value. The smaller of the horizontal values when sorted.
31 May contain any value. The larger of the vertical values when sorted.
37 May contain any value. The larger of the vertical values when sorted.
178 #Line # returns smaller bounds in x, if sorted ##
184 SkIRect sorted = unsorted.makeSorted();
185 SkDebugf("sorted.fLeft: %d sorted.left(): %d\n", sorted.fLeft, sorted.left());
188 sorted.fLeft: 10 sorted.left(): 10
201 #Line # returns smaller bounds in y, if sorted ##
207 SkIRect sorted = unsorted.makeSorted();
[all …]
|
| D | SkRect_Reference.bmh | 24 horizontal values when sorted. When equal to or greater than fRight, Rect is empty.
30 vertical values when sorted. When equal to or greater than fBottom, Rect is empty.
36 horizontal values when sorted. When equal to or less than fLeft, Rect is empty.
42 vertical values when sorted. When equal to or less than fTop, Rect is empty.
264 SkDebugf("sorted: {%g, %g, %g, %g} is" "%s empty\n", rect.left(), rect.top(), rect.right(),
269 sorted: {10, 40, 20, 50} is not empty
271 sorted: {20, 40, 20, 50} is empty
290 SkDebugf("rect: {%g, %g, %g, %g} is" "%s sorted\n", rect.left(), rect.top(), rect.right(),
293 SkDebugf("sorted: {%g, %g, %g, %g} is" "%s sorted\n", rect.left(), rect.top(), rect.right(),
297 rect: {20, 40, 10, 50} is not sorted
[all …]
|
| /external/cldr/tools/cldr-unittest/src/org/unicode/cldr/unittest/ |
| D | XLocaleMatcherTest.java | 121 TreeSet<ULocale> sorted = new TreeSet<ULocale>(); in testExactMatches() local
125 check(sorted); in testExactMatches()
126 sorted.clear(); in testExactMatches()
129 sorted.add(loc); in testExactMatches()
131 check(sorted); in testExactMatches()
134 private void check(Set<ULocale> sorted) { in check() argument
135 if (sorted.isEmpty()) { in check()
138 check2(sorted); in check()
139 ULocale first = sorted.iterator().next(); in check()
141 sorted.add(max); in check()
[all …]
|
| /external/angle/src/libANGLE/renderer/metal/ |
| D | gen_mtl_format_table.py | 386 for angle_format in sorted(angle_to_mtl.keys()):
388 for angle_format in sorted(angle_override.keys()):
393 for angle_format in sorted(mac_specific_map.keys()):
396 for angle_format in sorted(mac_override_bc1.keys()):
405 for angle_format in sorted(mac_override_es3.keys()):
413 for angle_format in sorted(ios_specific_map.keys()):
416 for angle_format in sorted(ios_override.keys()):
419 for angle_format in sorted(astc_tpl_map.keys()):
425 for angle_format in sorted(ios_specific_map.keys()):
435 for angle_format in sorted(astc_tpl_map.keys()):
[all …]
|
| /external/rust/cxx/syntax/ |
| D | toposort.rs | 11 let mut sorted = Vec::new(); in sort() localVariable
15 let _ = visit(cx, strct, &mut sorted, marks, types); in sort()
18 sorted in sort()
24 sorted: &mut Vec<&'a Struct>, in visit()
41 if visit(cx, inner, sorted, marks, types).is_err() { in visit()
49 sorted.push(strct); in visit()
|
| /external/antlr/tool/src/main/java/org/antlr/misc/ |
| D | Graph.java | 84 ArrayList<T> sorted = new ArrayList<T>(); in sort() local
92 DFS(n, visited, sorted); in sort()
94 return sorted; in sort()
97 public void DFS(Node<T> n, Set<Node<T>> visited, ArrayList<T> sorted) { in DFS() argument
102 DFS(target, visited, sorted); in DFS()
105 sorted.add(n.payload); in DFS()
|
| /external/mesa3d/src/intel/genxml/ |
| D | gen_sort_tags.py | 111 enums = sorted(genxml.findall('enum'), key=get_name)
115 e[:] = sorted(e, key=get_value)
121 structs = sorted(xml.findall('./struct'), key=get_name)
124 s[:] = sorted(s, key=get_start)
136 instructions = sorted(xml.findall('./instruction'), key=get_name)
138 i[:] = sorted(i, key=get_start)
140 registers = sorted(xml.findall('./register'), key=get_name)
142 r[:] = sorted(r, key=get_start)
|
| /external/tensorflow/tensorflow/python/data/experimental/kernel_tests/ |
| D | shuffle_and_repeat_test.py | 52 sorted(output), sorted(
55 self.assertSequenceEqual(sorted(output[i * 20:(i + 1) * 20]), range(20))
77 self.assertEqual(sorted(output1), sorted(output2))
86 self.assertEqual(sorted(output1), sorted(output2))
95 self.assertEqual(sorted(output1), sorted(output2))
132 sorted_epoch = sorted(
|
| /external/llvm-project/lld/ELF/ |
| D | CallGraphSort.cpp | 182 std::vector<int> sorted(clusters.size()); in run() local
186 std::iota(sorted.begin(), sorted.end(), 0); in run()
187 llvm::stable_sort(sorted, [&](int a, int b) { in run()
191 for (int l : sorted) { in run()
216 sorted.clear(); in run()
219 sorted.push_back(i); in run()
220 llvm::stable_sort(sorted, [&](int a, int b) { in run()
226 for (int leader : sorted) { in run()
244 for (int leader : sorted) in run()
|
| /external/llvm-project/lld/COFF/ |
| D | CallGraphSort.cpp | 153 std::vector<int> sorted(clusters.size()); in run() local
157 std::iota(sorted.begin(), sorted.end(), 0); in run()
158 llvm::stable_sort(sorted, [&](int a, int b) { in run()
162 for (int l : sorted) { in run()
187 sorted.clear(); in run()
190 sorted.push_back(i); in run()
191 llvm::stable_sort(sorted, [&](int a, int b) { in run()
199 for (int leader : sorted) { in run()
216 for (int leader : sorted) in run()
|
| /external/libcups/cgi-bin/ |
| D | help.c | 197 si->sorted, cupsArrayCount(si->sorted)); in main()
199 for (i = 0, n = (help_node_t *)cupsArrayFirst(si->sorted); in main()
201 i ++, n = (help_node_t *)cupsArrayNext(si->sorted)) in main()
241 for (i = 0, section = NULL, n = (help_node_t *)cupsArrayFirst(hi->sorted); in main()
243 n = (help_node_t *)cupsArrayNext(hi->sorted)) in main()
291 cupsArraySave(hi->sorted); in main()
293 for (nn = (help_node_t *)cupsArrayFirst(hi->sorted); in main()
295 nn = (help_node_t *)cupsArrayNext(hi->sorted)) in main()
310 cupsArrayRestore(hi->sorted); in main()
|
| /external/rust/crates/grpcio-sys/grpc/third_party/upb/upb/ |
| D | msg.c | 193 const upb_map *map, _upb_sortedmap *sorted) { in _upb_mapsorter_pushmap() argument
195 sorted->start = s->size; in _upb_mapsorter_pushmap()
196 sorted->pos = sorted->start; in _upb_mapsorter_pushmap()
197 sorted->end = sorted->start + map_size; in _upb_mapsorter_pushmap()
200 if (sorted->end > s->cap) { in _upb_mapsorter_pushmap()
201 s->cap = _upb_lg2ceilsize(sorted->end); in _upb_mapsorter_pushmap()
206 s->size = sorted->end; in _upb_mapsorter_pushmap()
209 upb_tabent const**dst = &s->entries[sorted->start]; in _upb_mapsorter_pushmap()
218 UPB_ASSERT(dst == &s->entries[sorted->end]); in _upb_mapsorter_pushmap()
254 qsort(&s->entries[sorted->start], map_size, sizeof(*s->entries), compar); in _upb_mapsorter_pushmap()
|
| /external/perfetto/tools/ |
| D | gen_bazel | 115 label.srcs += [re.sub('^//', '', x) for x in sorted(target.inputs)]
124 label.srcs += [re.sub('^//', '', x) for x in sorted(target.inputs)]
187 for k, v in sorted(iteritems(self.__dict__), key=key_sorter):
206 for entry in sorted(v):
269 sources_label.srcs = sorted([x[2:] for x in target.sources]) # Strip //.
280 sources_label.deps = sorted(deps)
396 for dep in sorted(gn_target.deps):
411 label.srcs = sorted(label.srcs, key=lambda x: x.replace(':', '|'))
413 label.deps = sorted(label.deps)
414 label.hdrs = sorted(label.hdrs)
[all …]
|
| /external/grpc-grpc/src/boringssl/ |
| D | gen_build_yaml.py | 64 'src': sorted(
68 'headers': sorted(
86 for f in sorted(files['test_support'])
104 for test in list(sorted(set(files['ssl_test'] + files['crypto_test'])))
123 for test in list(sorted(set(files['ssl_test'] + files['crypto_test'])))
139 for test in list(sorted(set(files['ssl_test'] + files['crypto_test'])))
|