| /external/perfetto/ui/src/controller/aggregation/ |
| D | aggregation_controller.ts | 74 this.previousSorting !== aggregatePreferences.sorting;
81 if (sortingChanged) this.previousSorting = aggregatePreferences.sorting;
114 let sorting = `${this.getDefaultSorting().column} ${ variable
116 if (pref && pref.sorting) {
117 sorting = `${pref.sorting.column} ${pref.sorting.direction}`;
119 const query = `select ${colIds} from ${this.kind} order by ${sorting}`;
|
| /external/skqp/src/compute/hs/ |
| D | README.md | 4 HotSort is a high-performance GPU-accelerated integer sorting library
9 * Ultra-fast sorting of 32‑bit or 64‑bit keys
11 * In-place sorting for low-memory environments
18 implementations when sorting arrays of smaller than 500K-2M keys.
24 Here is a throughput plot for HotSort on Vulkan and CUDA sorting
40 Note that these sorting rates translate to sub-millisecond to
52 Note that HotSort is a comparison sort and supports in-place sorting.
100 hs_vk_ds_bind(hs,hs_ds,cb,vin,vout); // or (...,vin,VK_NULL_HANDLE) for in-place sorting
154 hs_cuda_sort_u32(vin,vout, // or (vin,NULL,...) for in-place sorting
198 hs_cl_sort(hs,cq,...,vin,vout,...); // or (...,vin,NULL,...) for in-place sorting
[all …]
|
| /external/llvm-project/lld/test/ELF/linkerscript/ |
| D | sort-nested.s | 6 ## Check sorting first by alignment and then by name.
16 ## Check sorting first by name and then by alignment.
26 ## If the section sorting command in linker script isn't nested, the
|
| /external/tensorflow/tensorflow/core/util/sparse/ |
| D | sparse_tensor_test.cc | 65 std::vector<int64> sorting(N); in TEST() local
66 for (std::size_t n = 0; n < N; ++n) sorting[n] = n; in TEST()
72 std::sort(sorting.begin(), sorting.end(), sorter); in TEST()
73 EXPECT_EQ(sorting, std::vector<int64>({0, 4, 3, 2, 1})); in TEST()
76 std::sort(sorting.begin(), sorting.end(), sorter_fixed); in TEST()
77 EXPECT_EQ(sorting, std::vector<int64>({0, 4, 3, 2, 1})); in TEST()
82 for (std::size_t n = 0; n < N; ++n) sorting[n] = n; in TEST()
83 std::sort(sorting.begin(), sorting.end(), sorter1); in TEST()
84 EXPECT_EQ(sorting, std::vector<int64>({0, 3, 2, 1, 4})); in TEST()
87 for (std::size_t n = 0; n < N; ++n) sorting[n] = n; in TEST()
[all …]
|
| /external/perfetto/ui/src/frontend/ |
| D | aggregation_panel.ts | 61 if (pref && pref.sorting && pref.sorting.column === col.columnId) {
62 sortIcon = pref.sorting.direction === 'DESC' ? 'arrow_drop_down' :
|
| /external/python/cpython3/Doc/howto/ |
| D | sorting.rst | 14 In this document, we explore the various techniques for sorting data using Python.
55 takes a single argument and returns a key to use for sorting purposes. This
106 The operator module functions allow multiple levels of sorting. For example, to
142 This wonderful property lets you build complex sorts in a series of sorting
203 Now that Python sorting provides key-functions, this technique is not often needed.
275 * For locale aware sorting, use :func:`locale.strxfrm` for a key function or
|
| D | index.rst | 25 sorting.rst
|
| /external/strace/ |
| D | strace-log-merge | 39 option which prints timestamps (otherwise sorting won't do any good).
|
| /external/bsdiff/ |
| D | README.chromium | 10 files. By using suffix sorting and taking advantage of how executable files
|
| /external/skia/src/gpu/effects/ |
| D | GrRGBToHSLFilterEffect.fp | 12 // - minimize the number of branches by sorting and computing the hue phase in parallel (vec4s)
14 // - trade the third sorting branch for a potentially faster std::min and leaving 2nd/3rd
|
| /external/libdivsufsort/ |
| D | CHANGELOG.md | 14 * Improve the performance of the suffix-sorting algorithm
|
| /external/python/cpython2/Doc/howto/ |
| D | index.rst | 26 sorting.rst
|
| D | sorting.rst | 14 In this document, we explore the various techniques for sorting data using Python.
55 and returns a key to use for sorting purposes. This technique is fast because
105 The operator module functions allow multiple levels of sorting. For example, to
151 This wonderful property lets you build complex sorts in a series of sorting
275 * For locale aware sorting, use :func:`locale.strxfrm` for a key function or
|
| /external/llvm-project/llvm/test/CodeGen/X86/ |
| D | x86-64-sret-return-2.ll | 8 ; This used to crash due to topological sorting issues in selection DAG.
|
| /external/llvm/test/CodeGen/X86/ |
| D | x86-64-sret-return-2.ll | 8 ; This used to crash due to topological sorting issues in selection DAG.
|
| /external/perfetto/ui/src/common/ |
| D | actions.ts | 301 if (!prefs.sorting || prefs.sorting.column !== args.column) {
303 state.aggregatePreferences[args.id].sorting = {
307 } else if (prefs.sorting.direction === 'DESC') {
309 state.aggregatePreferences[args.id].sorting = {
315 state.aggregatePreferences[args.id].sorting = undefined;
|
| /external/vm_tools/p9/ |
| D | .clang-format | 17 # cpplint.py does smarter #include sorting than clang-format (the former ignores
|
| /external/fonttools/Tests/feaLib/data/ |
| D | spec5d2.fea | 6 # must do the appropriate sorting.
|
| /external/perfetto/protos/perfetto/common/ |
| D | android_energy_consumer_descriptor.proto | 28 // For a group of energy consumers of the same logical type, sorting by
|
| /external/perfetto/protos/perfetto/trace/track_event/ |
| D | process_descriptor.proto | 54 // To support old UI. New UI should determine default sorting by process_type.
|
| D | chrome_thread_descriptor.proto | 83 // To support old UI. New UI should determine default sorting by thread_type.
|
| D | thread_descriptor.proto | 73 // To support old UI. New UI should determine default sorting by thread_type.
|
| /external/tensorflow/tensorflow/compiler/xla/client/lib/ |
| D | BUILD | 358 name = "sorting",
359 srcs = ["sorting.cc"],
360 hdrs = ["sorting.h"],
378 ":sorting",
|
| /external/bzip2/ |
| D | bzip2.txt | 3 bzip2, bunzip2 - a block-sorting file compressor, v1.0.6
17 sorting text compression algorithm, and Huffman coding.
199 behaviour of the sorting algorithm in earlier ver-
318 The sorting phase of compression gathers together similar
376 block sorting transformation), David Wheeler (again, for
384 for faster sorting algorithms, so as to speed up compres-
|
| D | README.XML.STUFF | 3 lossless, block-sorting data compression.
|