| /external/rust/crates/serde_cbor/tests/ |
| D | canonical.rs | 29 let mut sorted = expected.clone(); in integer_canonical_sort_order() localVariable
42 let mut sorted = expected.clone(); in string_canonical_sort_order() localVariable
55 let mut sorted = expected.clone(); in bytes_canonical_sort_order() localVariable
65 let mut sorted = expected.clone(); in simple_data_canonical_sort_order() localVariable
81 let mut sorted = expected.clone(); in major_type_canonical_sort_order() localVariable
100 let mut sorted = expected.clone(); in test_rfc_example() localVariable
|
| /external/armnn/samples/ObjectDetection/test/ |
| D | NMSTests.cpp | 55 auto sorted = od::NonMaxSuppression(expectedResults, 0.49); variable
83 auto sorted = od::NonMaxSuppression(expectedResults, 0.5); variable
|
| /external/antlr/tool/src/main/java/org/antlr/misc/ |
| D | Graph.java | 84 ArrayList<T> sorted = new ArrayList<T>(); in sort() local
97 public void DFS(Node<T> n, Set<Node<T>> visited, ArrayList<T> sorted) { in DFS()
|
| /external/webp/src/utils/ |
| D | huffman_utils.c | 82 uint16_t sorted[]) { in BuildHuffmanTable()
252 uint16_t sorted[SORTED_SIZE_CUTOFF]; in VP8LBuildHuffmanTable() local
256 uint16_t* const sorted = in VP8LBuildHuffmanTable() local
|
| /external/cldr/tools/cldr-code/src/test/java/org/unicode/cldr/unittest/ |
| D | TestAliases.java | 88 Set<String> sorted = new TreeSet<>(); in testCountFull() local
131 Set<String> sorted = new TreeSet<>(); in checkEmitChanged() local
|
| /external/skia/docs/examples/ |
| D | Rect_left.cpp | 9 SkRect sorted = unsorted.makeSorted(); in draw() local
|
| D | Rect_y.cpp | 9 SkRect sorted = unsorted.makeSorted(); in draw() local
|
| D | Rect_top.cpp | 9 SkRect sorted = unsorted.makeSorted(); in draw() local
|
| D | IRect_bottom.cpp | 9 SkIRect sorted = unsorted.makeSorted(); in draw() local
|
| D | IRect_top.cpp | 9 SkIRect sorted = unsorted.makeSorted(); in draw() local
|
| D | Rect_bottom.cpp | 9 SkRect sorted = unsorted.makeSorted(); in draw() local
|
| D | IRect_x.cpp | 9 SkIRect sorted = unsorted.makeSorted(); in draw() local
|
| D | IRect_y.cpp | 9 SkIRect sorted = unsorted.makeSorted(); in draw() local
|
| D | IRect_equal_operator.cpp | 8 SkIRect sorted = test.makeSorted(); in draw() local
|
| D | IRect_notequal_operator.cpp | 8 SkIRect sorted = test.makeSorted(); in draw() local
|
| D | Rect_x.cpp | 9 SkRect sorted = unsorted.makeSorted(); in draw() local
|
| D | IRect_left.cpp | 9 SkIRect sorted = unsorted.makeSorted(); in draw() local
|
| D | Rect_right.cpp | 9 SkRect sorted = unsorted.makeSorted(); in draw() local
|
| D | IRect_right.cpp | 9 SkIRect sorted = unsorted.makeSorted(); in draw() local
|
| D | Rect_joinNonEmptyArg.cpp | 8 SkRect sorted = rect.makeSorted(); in draw() local
|
| D | Rect_joinPossiblyEmptyRect.cpp | 8 SkRect sorted = rect.makeSorted(); in draw() local
|
| /external/perfetto/src/trace_processor/prelude/table_functions/ |
| D | experimental_flat_slice_unittest.cc | 96 auto sorted = out->Sort({out->track_id().ascending(), out->ts().ascending()}); in TEST() local
178 auto sorted = out->Sort({out->track_id().ascending(), out->ts().ascending()}); in TEST() local
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.sorting/alg.sort/partial.sort/ |
| D | ranges_partial_sort.pass.cpp | 66 constexpr void test_one(std::array<int, N> input, std::size_t mid_index, std::array<int, N> sorted)… in test_one()
94 auto sorted = input; in test_all_subsequences() local
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/libcxx/fuzzing/ |
| D | partial_sort_copy.pass.cpp | 35 std::vector<std::uint8_t> sorted(data + 1, data + size); in LLVMFuzzerTestOneInput() local
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| D | ranges_sort_heap.pass.cpp | 63 constexpr void verify_sorted(const std::array<T, N>& sorted, Iter last, std::array<T, N> expected) { in verify_sorted()
74 auto sorted = input; in test_one() local
83 auto sorted = input; in test_one() local
|