Home
last modified time | relevance | path

Searched refs:sorted (Results 1 - 25 of 789) sorted by relevance

12345678910>>...32

/kernel/linux/linux-5.10/tools/perf/util/
H A Drb_resort.h15 * fields to be present in each of the entries in the new, sorted, rb_tree.
19 * the rb_tree used as a source for the entries to be sorted:
76 static void __name##_sorted__insert(struct __name##_sorted *sorted, \
79 struct rb_node **p = &sorted->entries.rb_node, *parent = NULL; \
88 rb_insert_color(sorted_nd, &sorted->entries); \
91 static void __name##_sorted__sort(struct __name##_sorted *sorted, \
97 struct __name##_sorted_entry *snd = &sorted->nd[i++]; \
99 __name##_sorted__insert(sorted, &snd->rb_node); \
106 struct __name##_sorted *sorted; \
107 sorted
[all...]
/kernel/linux/linux-6.6/tools/perf/util/
H A Drb_resort.h15 * fields to be present in each of the entries in the new, sorted, rb_tree.
19 * the rb_tree used as a source for the entries to be sorted:
76 static void __name##_sorted__insert(struct __name##_sorted *sorted, \
79 struct rb_node **p = &sorted->entries.rb_node, *parent = NULL; \
88 rb_insert_color(sorted_nd, &sorted->entries); \
91 static void __name##_sorted__sort(struct __name##_sorted *sorted, \
97 struct __name##_sorted_entry *snd = &sorted->nd[i++]; \
99 __name##_sorted__insert(sorted, &snd->rb_node); \
106 struct __name##_sorted *sorted; \
107 sorted
[all...]
/third_party/skia/docs/examples/
H A DRect_joinPossiblyEmptyRect.cpp8 SkRect sorted = rect.makeSorted(); in REG_FIDDLE() local
12 sorted.joinPossiblyEmptyRect(toJoin); in REG_FIDDLE()
13 SkDebugf("sorted: %g, %g, %g, %g\n", sorted.fLeft, sorted.fTop, sorted.fRight, sorted.fBottom); in REG_FIDDLE()
H A DRect_joinNonEmptyArg.cpp8 SkRect sorted = rect.makeSorted(); in REG_FIDDLE() local
12 sorted.joinNonEmptyArg(toJoin); in REG_FIDDLE()
13 SkDebugf("sorted: %g, %g, %g, %g\n", sorted.fLeft, sorted.fTop, sorted.fRight, sorted.fBottom); in REG_FIDDLE()
H A DRect_y.cpp9 SkRect sorted = unsorted.makeSorted(); in REG_FIDDLE() local
10 SkDebugf("sorted.fTop: %g sorted.y(): %g\n", sorted.fTop, sorted.y()); in REG_FIDDLE()
H A DRect_right.cpp9 SkRect sorted = unsorted.makeSorted(); in REG_FIDDLE() local
10 SkDebugf("sorted.fRight: %g sorted.right(): %g\n", sorted.fRight, sorted.right()); in REG_FIDDLE()
H A DRect_bottom.cpp9 SkRect sorted = unsorted.makeSorted(); in REG_FIDDLE() local
10 SkDebugf("sorted.fBottom: %g sorted.bottom(): %g\n", sorted.fBottom, sorted.bottom()); in REG_FIDDLE()
H A DRect_top.cpp9 SkRect sorted = unsorted.makeSorted(); in REG_FIDDLE() local
10 SkDebugf("sorted.fTop: %g sorted.top(): %g\n", sorted.fTop, sorted.top()); in REG_FIDDLE()
H A DRect_x.cpp9 SkRect sorted = unsorted.makeSorted(); in REG_FIDDLE() local
10 SkDebugf("sorted.fLeft: %g sorted.x(): %g\n", sorted.fLeft, sorted.x()); in REG_FIDDLE()
H A DRect_left.cpp9 SkRect sorted = unsorted.makeSorted(); in REG_FIDDLE() local
10 SkDebugf("sorted.fLeft: %g sorted.left(): %g\n", sorted.fLeft, sorted.left()); in REG_FIDDLE()
/third_party/mbedtls/scripts/
H A Dgenerate_psa_constants.py247 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(
[all...]
/third_party/skia/third_party/externals/libwebp/src/utils/
H A Dhuffman_utils.c78 // sorted[code_lengths_size] is a pre-allocated array for sorting symbols
82 uint16_t sorted[]) { in BuildHuffmanTable()
86 int symbol; // symbol index in original or sorted table in BuildHuffmanTable()
89 // offsets in sorted table for each length: in BuildHuffmanTable()
94 assert((root_table != NULL && sorted != NULL) || in BuildHuffmanTable()
95 (root_table == NULL && sorted == NULL)); in BuildHuffmanTable()
111 // Generate offsets into sorted symbol table by code length. in BuildHuffmanTable()
124 if (sorted != NULL) { in BuildHuffmanTable()
125 sorted[offset[symbol_code_length]++] = symbol; in BuildHuffmanTable()
134 if (sorted ! in BuildHuffmanTable()
80 BuildHuffmanTable(HuffmanCode* const root_table, int root_bits, const int code_lengths[], int code_lengths_size, uint16_t sorted[]) BuildHuffmanTable() argument
252 uint16_t sorted[SORTED_SIZE_CUTOFF]; VP8LBuildHuffmanTable() local
256 uint16_t* const sorted = VP8LBuildHuffmanTable() local
[all...]
/third_party/rust/crates/cxx/gen/cmd/src/syntax/
H A Dtoposort.rs11 let mut sorted = Vec::new(); in sort() variables
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/rust/crates/cxx/gen/lib/src/syntax/
H A Dtoposort.rs11 let mut sorted = Vec::new(); in sort() variables
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/rust/crates/cxx/gen/build/src/syntax/
H A Dtoposort.rs11 let mut sorted = Vec::new(); in sort() variables
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/rust/crates/cxx/syntax/
H A Dtoposort.rs11 let mut sorted = Vec::new(); in sort() variables
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/rust/crates/cxx/macro/src/syntax/
H A Dtoposort.rs11 let mut sorted = Vec::new(); in sort() variables
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/skia/third_party/externals/angle2/src/libANGLE/renderer/metal/
H A Dgen_mtl_format_table.py387 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_ma
[all...]
/third_party/skia/infra/bots/task_drivers/perf_puppeteer_skottie_frames/
H A Dperf_puppeteer_skottie_frames.go369 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)))))
[all...]
/third_party/skia/infra/bots/task_drivers/perf_puppeteer_canvas/
H A Dperf_puppeteer_canvas.go273 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)))))
[all...]
/third_party/mesa3d/src/intel/genxml/
H A Dgen_sort_tags.py111 enums = sorted(genxml.findall('enum'), key=get_name)
115 e[:] = sorted(e, key=get_value)
120 # through the alphabetically sorted list and print out dependencies first.
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/
H A Dgenerate_gl_dispatch_table.py172 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_requirement
[all...]
/third_party/cups-filters/fontembed/
H A Dfrequent.c10 char sorted; member
24 ret->sorted=1; in frequent_new()
43 freq->sorted=0; in frequent_add()
53 // if it was sorted, the free entries are at the end. zero points to the first free entry, because of the loop direction in frequent_add()
72 if (!freq->sorted) { in frequent_get()
75 freq->sorted=1; in frequent_get()
/third_party/skia/third_party/externals/angle2/src/libANGLE/
H A Dgen_format_map.py120 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/python/Doc/includes/
H A Dmp_newtype.py61 assert sorted(f1._exposed_) == sorted(['f', 'g'])
69 assert sorted(f2._exposed_) == sorted(['g', '_h'])

Completed in 7 milliseconds

12345678910>>...32