| /external/perfetto/ui/src/controller/aggregation/ |
| D | aggregation_controller.ts | 83 this.previousSorting !== aggregatePreferences.sorting;
91 if (sortingChanged) this.previousSorting = aggregatePreferences.sorting;
121 let sorting = `${this.getDefaultSorting().column} ${ variable
123 if (pref && pref.sorting) {
124 sorting = `${pref.sorting.column} ${pref.sorting.direction}`;
126 const query = `select ${colIds} from ${this.kind} order by ${sorting}`;
|
| /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/harfbuzz_ng/docs/ |
| D | repacker.md | 48 * [Topological sorting algorithm](https://en.wikipedia.org/wiki/Topological_sorting): an algorithm
49 which given a graph gives a linear sorting of the nodes such that all offsets will be positive.
51 * Overflow check: given a graph and a topological sorting it checks if there will be any overflows
81 The harfbuzz repacker uses two different algorithms for topological sorting:
87 sort will be used for all subsequent topological sorting operations.
109 The topological sorting operation is the core of the repacker and is run on each iteration so it ne…
110 to be as fast as possible. There's a few things that are done to speed up subsequent sorting
124 the topological sorting algorithm. Currently a basic heap based queue is used. Heap based queue's
132 If a graph contains multiple 32 bit offsets then the shortest distance sorting will be likely be
174 The sorting algorithm incorporates this via a "space" modifier that can be applied to nodes in the
|
| /external/python/cpython3/Doc/howto/ |
| D | sorting.rst | 14 In this document, we explore the various techniques for sorting data using Python.
63 takes a single argument and returns a key to use for sorting purposes. This
120 The operator module functions allow multiple levels of sorting. For example, to
162 This wonderful property lets you build complex sorts in a series of sorting
227 Now that Python sorting provides key-functions, this technique is not often needed.
311 * 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/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/test/CodeGen/X86/ |
| D | x86-64-sret-return-2.ll | 8 ; This used to crash due to topological sorting issues in selection DAG.
|
| /external/fonttools/Tests/feaLib/data/ |
| D | spec5d2.fea | 6 # must do the appropriate sorting.
|
| /external/perfetto/ui/src/common/ |
| D | actions.ts | 308 if (!prefs.sorting || prefs.sorting.column !== args.column) {
310 state.aggregatePreferences[args.id].sorting = {
314 } else if (prefs.sorting.direction === 'DESC') {
316 state.aggregatePreferences[args.id].sorting = {
322 state.aggregatePreferences[args.id].sorting = undefined;
|
| /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/bzip2/ |
| D | bzip2.txt | 3 bzip2, bunzip2 - a block-sorting file compressor, v1.0.8
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.
|
| D | Makefile-libbz2_so | 11 # lossless, block-sorting data compression.
|
| D | bzip2.1.preformatted | 6 bzip2, bunzip2 − a block‐sorting file compressor, v1.0.8
20 sorting text compression algorithm, and Huffman coding.
202 behaviour of the sorting algorithm in earlier ver
321 The sorting phase of compression gathers together similar
381 block sorting transformation), David Wheeler (again, for
389 for faster sorting algorithms, so as to speed up compres
|
| /external/perfetto/protos/perfetto/trace/track_event/ |
| D | chrome_thread_descriptor.proto | 84 // 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.
|
| D | process_descriptor.proto | 54 // To support old UI. New UI should determine default sorting by process_type.
|
| D | chrome_process_descriptor.proto | 73 // To support old UI. New UI should determine default sorting by process_type.
|
| /external/tensorflow/tensorflow/compiler/xla/client/lib/ |
| D | BUILD | 376 name = "sorting",
377 srcs = ["sorting.cc"],
378 hdrs = ["sorting.h"],
396 ":sorting",
|
| /external/eigen/doc/ |
| D | TutorialSTL.dox | 54 Here is an example sorting each row of a matrix:
|