Home
last modified time | relevance | path

Searched refs:sorted (Results 26 - 50 of 771) sorted by relevance

12345678910>>...31

/third_party/skia/docs/examples/
H A DIRect_right.cpp9 SkIRect sorted = unsorted.makeSorted(); in REG_FIDDLE() local
10 SkDebugf("sorted.fRight: %d sorted.right(): %d\n", sorted.fRight, sorted.right()); in REG_FIDDLE()
H A DIRect_top.cpp9 SkIRect sorted = unsorted.makeSorted(); in REG_FIDDLE() local
10 SkDebugf("sorted.fTop: %d sorted.top(): %d\n", sorted.fTop, sorted.top()); in REG_FIDDLE()
H A DIRect_x.cpp9 SkIRect sorted = unsorted.makeSorted(); in REG_FIDDLE() local
10 SkDebugf("sorted.fLeft: %d sorted.x(): %d\n", sorted.fLeft, sorted.x()); in REG_FIDDLE()
H A DIRect_y.cpp9 SkIRect sorted = unsorted.makeSorted(); in REG_FIDDLE() local
10 SkDebugf("sorted.fTop: %d sorted.y(): %d\n", sorted.fTop, sorted.y()); in REG_FIDDLE()
H A DIRect_left.cpp9 SkIRect sorted = unsorted.makeSorted(); in REG_FIDDLE() local
10 SkDebugf("sorted.fLeft: %d sorted.left(): %d\n", sorted.fLeft, sorted.left()); in REG_FIDDLE()
H A DIRect_bottom.cpp9 SkIRect sorted = unsorted.makeSorted(); in REG_FIDDLE() local
10 SkDebugf("sorted.fBottom: %d sorted.bottom(): %d\n", sorted.fBottom, sorted.bottom()); in REG_FIDDLE()
/third_party/skia/third_party/externals/angle2/src/libANGLE/renderer/d3d/d3d11/
H A Dgen_texture_format_table.py88 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/libabigail/src/
H A Dabg-comparison-priv.h1362 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...]
/kernel/linux/linux-5.10/drivers/md/bcache/
H A Ddebug.c34 struct bset *ondisk, *sorted, *inmemory; in bch_btree_verify() local
44 sorted = b->c->verify_data->keys.set->data; in bch_btree_verify()
57 bch_bio_map(bio, sorted); in bch_btree_verify()
62 memcpy(ondisk, sorted, KEY_SIZE(&v->key) << 9); in bch_btree_verify()
65 sorted = v->keys.set->data; in bch_btree_verify()
67 if (inmemory->keys != sorted->keys || in bch_btree_verify()
69 sorted->start, in bch_btree_verify()
81 bch_dump_bset(&v->keys, sorted, 0); in bch_btree_verify()
95 if (inmemory->d[j] != sorted->d[j]) in bch_btree_verify()
/kernel/linux/linux-6.6/drivers/md/bcache/
H A Ddebug.c34 struct bset *ondisk, *sorted, *inmemory; in bch_btree_verify() local
44 sorted = b->c->verify_data->keys.set->data; in bch_btree_verify()
57 bch_bio_map(bio, sorted); in bch_btree_verify()
62 memcpy(ondisk, sorted, KEY_SIZE(&v->key) << 9); in bch_btree_verify()
65 sorted = v->keys.set->data; in bch_btree_verify()
67 if (inmemory->keys != sorted->keys || in bch_btree_verify()
69 sorted->start, in bch_btree_verify()
81 bch_dump_bset(&v->keys, sorted, 0); in bch_btree_verify()
95 if (inmemory->d[j] != sorted->d[j]) in bch_btree_verify()
/third_party/libwebsockets/lib/misc/
H A Ddiskcache.c55 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()
251 * and are sorted into the correct order. In this way no matter the number
255 * The oldest subset of BATCH_COUNT files are sorted into the cd->batch
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()
[all...]
/third_party/libevdev/libevdev/
H A Dmake-event-names.py73 for val, name in sorted(list(getattr(bits, prefix).items())):
76 for val, name in sorted(list(getattr(bits, "btn").items())):
121 names = sorted(list(getattr(bits, prefix).items()))
131 for val, name in sorted(names, key=lambda e: e[1]):
151 for prefix in sorted(code_prefixes, key=lambda e: e):
/third_party/python/Tools/scripts/
H A Dparse_html5_entities.py37 for name in sorted(added):
42 for name in sorted(removed):
50 for item in sorted(changed):
55 # The keys in the generated dictionary should be sorted
63 keys = sorted(entities.keys())
64 keys = sorted(keys, key=str.lower)
/third_party/vk-gl-cts/external/vulkan-docs/src/scripts/
H A Dinterfacedocgenerator.py53 # Loop through required blocks, sorted so they start with "core" features
54 for required in sorted(dict, key = interfaceDocSortKey):
75 for api in sorted(dict[required]):
79 # Loop through parents, sorted so they start with unparented items
80 for parent in sorted(dict[required], key = interfaceDocSortKey):
85 for api in sorted(dict[required][parent]):
88 for api in sorted(dict[required][parent]):
H A Djsgenerator.py39 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])
H A Dpygenerator.py32 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])
H A Drubygenerator.py40 for key in sorted(dict):
86 for baseType in sorted(self.mapDict):
93 self.writeList(sorted(self.features), 'features')
101 for api in sorted(self.apimap):
103 deps = sorted(self.apimap[api], key = lambda dep: dep[0])
/third_party/skia/third_party/externals/brotli/java/org/brotli/dec/
H A DHuffman.java68 int[] sorted = new int[codeLengthsSize]; // Symbols sorted by code length. in buildHuffmanTable()
71 int[] offset = new int[MAX_LENGTH + 1]; // Offsets in sorted table for each length. in buildHuffmanTable()
79 // Generate offsets into sorted symbol table by code length. in buildHuffmanTable()
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/skia/third_party/externals/brotli/csharp/org/brotli/dec/
H A DHuffman.cs76 int[] sorted = new int[codeLengthsSize]; in BuildHuffmanTable()
77 // Symbols sorted by code length. in BuildHuffmanTable()
82 // Offsets in sorted table for each length. in BuildHuffmanTable()
89 // Generate offsets into sorted symbol table by code length. 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 ReplicateValue(rootTable, currentOffset + (key >> rootBits), step, tableSize, (len - rootBits) << 16 | sorted[symbol++]); in BuildHuffmanTable()
/third_party/mbedtls/tests/scripts/
H A Dgenerate_psa_tests.py121 for key_type in sorted(self.constructors.key_types):
128 for curve_family in sorted(self.constructors.ecc_curves):
135 for dh_family in sorted(self.constructors.dh_groups):
212 for key_type in sorted(self.constructors.key_types):
219 for curve_family in sorted(self.constructors.ecc_curves):
223 for dh_family in sorted(self.constructors.dh_groups):
241 sorted(self.constructors.key_types)
261 pretty_reason = '!' + '&'.join(sorted(short_deps))
362 algorithms = sorted(self.constructors.algorithms)
390 for flag in sorted(usage_flag
[all...]
/third_party/nghttp2/
H A Dgentokenlookup.py29 for k in sorted(tokens):
41 for size in sorted(b.keys()):
47 for c in sorted(ents.keys()):
48 headers = sorted(ents[c])
/third_party/skia/tools/
H A DStats.h50 std::vector<double> sorted(samples.begin(), samples.end()); in Stats()
51 std::sort(sorted.begin(), sorted.end()); in Stats()
52 median = sorted[n/2]; in Stats()
/third_party/skia/infra/bots/task_drivers/perf_puppeteer_render_skps/
H A Dperf_puppeteer_render_skps.go346 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)))))
[all...]
/third_party/mbedtls/scripts/mbedtls_dev/
H A Dmacro_collector.py137 self.arguments_for['hash_alg'] = sorted(self.hash_algorithms)
138 self.arguments_for['mac_alg'] = sorted(self.mac_algorithms)
139 self.arguments_for['ka_alg'] = sorted(self.ka_algorithms)
140 self.arguments_for['kdf_alg'] = sorted(self.kdf_algorithms)
141 self.arguments_for['aead_alg'] = sorted(self.aead_algorithms)
142 self.arguments_for['sign_alg'] = sorted(self.sign_algorithms)
143 self.arguments_for['curve'] = sorted(self.ecc_curves)
144 self.arguments_for['group'] = sorted(self.dh_groups)
145 self.arguments_for['persistence'] = sorted(self.persistence_levels)
146 self.arguments_for['location'] = sorted(sel
[all...]
/third_party/node/deps/openssl/openssl/crypto/stack/
H A Dstack.c27 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 in OPENSSL_sk_sort()
[all...]

Completed in 13 milliseconds

12345678910>>...31