| /third_party/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 …]
|
| /third_party/skia/third_party/externals/libwebp/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()
195 code.value = (uint16_t)sorted[symbol++]; in BuildHuffmanTable()
252 uint16_t sorted[SORTED_SIZE_CUTOFF]; in VP8LBuildHuffmanTable() local
[all …]
|
| /third_party/mbedtls/scripts/ |
| D | generate_psa_constants.py | 247 sorted(self.statuses)))
251 sorted(self.ecc_curves)))
255 sorted(self.dh_groups)))
259 sorted(self.key_types)))
276 return ''.join([make(k, d[k]) for k in sorted(d.keys())])
281 return ''.join([make(k, d[k]) for k in sorted(d.keys())])
285 sorted(self.hash_algorithms)))
289 sorted(self.ka_algorithms)))
293 sorted(self.algorithms)))
304 return ''.join([make(k, d[k]) for k in sorted(d.keys())])
[all …]
|
| /third_party/python/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:
25 >>> sorted([5, 2, 3, 1, 4])
30 than :func:`sorted` - but if you don't need the original list, it's slightly
41 lists. In contrast, the :func:`sorted` function accepts any iterable.
45 >>> sorted({1: 'D', 2: 'B', 3: 'B', 4: 'E', 5: 'A'})
51 Both :meth:`list.sort` and :func:`sorted` have a *key* parameter to specify a
59 >>> sorted("This is a test string from Andrew".split(), key=str.lower)
[all …]
|
| /third_party/skia/infra/bots/task_drivers/perf_puppeteer_skottie_frames/ |
| D | perf_puppeteer_skottie_frames.go | 369 sorted := make([]float32, len(input))
370 copy(sorted, input)
371 sort.Slice(sorted, func(i, j int) bool {
372 return sorted[i] < sorted[j]
375 avg := computeAverage(sorted)
377 for i := 0; i < len(sorted); i++ {
378 variance += (sorted[i] - avg) * (sorted[i] - avg)
380 stddev := float32(math.Sqrt(float64(variance / float32(len(sorted)))))
382 medIdx := (len(sorted) * 50) / 100
383 p90Idx := (len(sorted) * 90) / 100
[all …]
|
| /third_party/skia/docs/examples/ |
| 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()
|
| 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()
|
| /third_party/skia/third_party/externals/angle2/src/libANGLE/renderer/metal/ |
| D | gen_mtl_format_table.py | 387 for angle_format in sorted(angle_to_mtl.keys()):
389 for angle_format in sorted(angle_override.keys()):
394 for angle_format in sorted(mac_specific_map.keys()):
397 for angle_format in sorted(mac_override.keys()):
400 for angle_format in sorted(mac_override_bc1.keys()):
409 for angle_format in sorted(mac_override_es3.keys()):
417 for angle_format in sorted(ios_specific_map.keys()):
420 for angle_format in sorted(ios_override.keys()):
423 for angle_format in sorted(astc_tpl_map.keys()):
429 for angle_format in sorted(ios_specific_map.keys()):
[all …]
|
| /third_party/rust/crates/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()
|
| /third_party/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)
|
| /third_party/skia/third_party/externals/angle2/src/libANGLE/renderer/gl/ |
| D | generate_gl_dispatch_table.py | 172 lines += [format_assign_ep(entry_point, entry_point) for entry_point in sorted(entry_points)]
179 lines += [format_assign_ep(entry_point, ep) for entry_point, ep in sorted(entry_points)]
334 for comment, entry_points in sorted(json_data.items()):
401 for comment, entry_points in sorted(json_data.items()):
403 formatted += [format_ep_decl(entry_point) for entry_point in sorted(entry_points)]
417 for gl_required, entry_points in sorted(gl_requirements.items()):
421 for extension, entry_points in sorted(gl_extension_requirements.items()):
426 for gles2_required, entry_points in sorted(gles2_requirements.items()):
430 for extension, entry_points in sorted(gles2_extension_requirements.items()):
435 for extension, entry_points in sorted(both_extension_requirements.items()):
[all …]
|
| /third_party/skia/infra/bots/task_drivers/perf_puppeteer_render_skps/ |
| D | perf_puppeteer_render_skps.go | 346 sorted := make([]float32, len(input))
347 copy(sorted, input)
348 sort.Slice(sorted, func(i, j int) bool {
349 return sorted[i] < sorted[j]
352 avg := computeAverage(sorted)
354 for i := 0; i < len(sorted); i++ {
355 variance += (sorted[i] - avg) * (sorted[i] - avg)
357 stddev := float32(math.Sqrt(float64(variance / float32(len(sorted)))))
359 medIdx := (len(sorted) * 50) / 100
361 return avg, sorted[medIdx], stddev
|
| /third_party/skia/third_party/externals/angle2/src/libANGLE/ |
| D | gen_format_map.py | 120 for type, internal_format in sorted(type_map.items()):
149 for format, type_map in sorted(format_map.items()):
172 for format in sorted(formats):
177 for type in sorted(types):
182 for format, type_combos in sorted(combos.items()):
184 for type, combos in sorted(type_combos.items()):
|
| /third_party/node/deps/openssl/openssl/crypto/stack/ |
| D | stack.c | 27 int sorted; member
38 sk->sorted = 0; in OPENSSL_sk_set_cmp_func()
53 ret->sorted = 0; in OPENSSL_sk_dup()
92 ret->sorted = 0; in OPENSSL_sk_deep_copy()
282 st->sorted = 0; in OPENSSL_sk_insert()
340 if (!st->sorted) { in internal_find()
343 st->sorted = 1; /* empty or single-element stack is considered sorted */ in internal_find()
462 st->sorted = 0; in OPENSSL_sk_set()
468 if (st != NULL && !st->sorted && st->comp != NULL) { in OPENSSL_sk_sort()
471 st->sorted = 1; /* empty or single-element stack is considered sorted */ in OPENSSL_sk_sort()
[all …]
|
| /third_party/openssl/crypto/stack/ |
| D | stack.c | 27 int sorted; member
38 sk->sorted = 0; in OPENSSL_sk_set_cmp_func()
53 ret->sorted = 0; in OPENSSL_sk_dup()
92 ret->sorted = 0; in OPENSSL_sk_deep_copy()
282 st->sorted = 0; in OPENSSL_sk_insert()
340 if (!st->sorted) { in internal_find()
343 st->sorted = 1; /* empty or single-element stack is considered sorted */ in internal_find()
462 st->sorted = 0; in OPENSSL_sk_set()
468 if (st != NULL && !st->sorted && st->comp != NULL) { in OPENSSL_sk_sort()
471 st->sorted = 1; /* empty or single-element stack is considered sorted */ in OPENSSL_sk_sort()
[all …]
|
| /third_party/libabigail/src/ |
| D | abg-comparison-priv.h | 1362 enum_type_decl::enumerators& sorted);
1366 changed_enumerators_type& sorted);
1370 vector<decl_base_sptr>& sorted);
1377 vector<function_decl*>& sorted);
1381 class_or_union::member_functions& sorted);
1385 vector<type_base_sptr>& sorted);
1390 function_decl_diff_sptrs_type& sorted);
1394 var_diff_sptrs_type& sorted);
1398 vector<elf_symbol_sptr>& sorted);
1402 vector<var_decl*>& sorted);
[all …]
|
| /third_party/cups-filters/fontembed/ |
| D | frequent.c | 10 char sorted; member
24 ret->sorted=1; in frequent_new()
43 freq->sorted=0; in frequent_add()
72 if (!freq->sorted) { in frequent_get()
75 freq->sorted=1; in frequent_get()
|
| /third_party/libwebsockets/lib/misc/ |
| D | diskcache.c | 55 lws_list_ptr sorted; member
90 struct file_entry *p1 = lp_to_fe(a, sorted), *p2 = lp_to_fe(b, sorted); in fe_modified_sort()
349 if (lp_to_fe(lds->head, sorted)->modified < s.st_mtime) in lws_diskcache_trim()
358 lds->head = p->sorted; in lws_diskcache_trim()
364 p->sorted = NULL; in lws_diskcache_trim()
370 lws_list_ptr_insert(&lds->head, &p->sorted, fe_modified_sort); in lws_diskcache_trim()
391 p = lp_to_fe(lp, sorted); in lws_diskcache_trim()
395 lp = p->sorted; in lws_diskcache_trim()
|
| /third_party/python/Tools/scripts/ |
| D | parse_html5_entities.py | 37 for name in sorted(added):
42 for name in sorted(removed):
50 for item in sorted(changed):
63 keys = sorted(entities.keys())
64 keys = sorted(keys, key=str.lower)
|
| /third_party/skia/third_party/externals/angle2/src/libANGLE/renderer/d3d/d3d11/ |
| D | gen_texture_format_table.py | 88 bits_iter = iter(list(sorted(bits.values())))
200 for k, v in sorted(json.items()):
221 for k, v in sorted(angle_format.items()):
225 for k2, v2 in sorted(v.items()):
229 for k2, v2 in sorted(v.items()):
254 for internal_format, format_name in sorted(json_map.items()):
|
| /third_party/skia/third_party/externals/brotli/java/org/brotli/dec/ |
| D | Huffman.java | 68 int[] sorted = new int[codeLengthsSize]; // Symbols sorted by code length. in buildHuffmanTable() local
88 sorted[offset[codeLengths[symbol]]++] = symbol; in buildHuffmanTable()
99 tableGroup[tableOffset + key] = sorted[0]; in buildHuffmanTable()
110 len << 16 | sorted[symbol++]); in buildHuffmanTable()
131 (len - rootBits) << 16 | sorted[symbol++]); in buildHuffmanTable()
|
| /third_party/vk-gl-cts/external/vulkan-docs/src/scripts/ |
| D | jsgenerator.py | 39 for key in sorted(dict):
78 for baseType in sorted(self.mapDict):
85 self.writeList(sorted(self.features), 'features')
93 for api in sorted(self.apimap):
95 deps = sorted(self.apimap[api], key = lambda dep: dep[0])
|
| D | pygenerator.py | 32 for key in sorted(dict):
73 for baseType in sorted(self.mapDict.keys()):
79 self.writeList(sorted(self.features), 'features')
87 for api in sorted(self.apimap):
89 deps = sorted(self.apimap[api], key = lambda dep: dep[0])
|
| /third_party/skia/third_party/externals/brotli/csharp/org/brotli/dec/ |
| D | Huffman.cs | 76 int[] sorted = new int[codeLengthsSize]; in BuildHuffmanTable()
100 sorted[offset[codeLengths[symbol]]++] = symbol; in BuildHuffmanTable()
111 rootTable[tableOffset + key] = sorted[0]; in BuildHuffmanTable()
122 ReplicateValue(rootTable, tableOffset + key, step, tableSize, len << 16 | sorted[symbol++]); in BuildHuffmanTable()
143 …le, currentOffset + (key >> rootBits), step, tableSize, (len - rootBits) << 16 | sorted[symbol++]); in BuildHuffmanTable()
|
| /third_party/python/Doc/includes/ |
| D | mp_newtype.py | 61 assert sorted(f1._exposed_) == sorted(['f', 'g'])
69 assert sorted(f2._exposed_) == sorted(['g', '_h'])
|