/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/webp/src/utils/ |
D | huffman_utils.c | 82 uint16_t sorted[]) { in BuildHuffmanTable() 223 uint16_t sorted[SORTED_SIZE_CUTOFF]; in VP8LBuildHuffmanTable() local 227 uint16_t* const sorted = in VP8LBuildHuffmanTable() local
|
/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/skia/docs/examples/ |
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 | Rect_right.cpp | 9 SkRect sorted = unsorted.makeSorted(); in draw() local
|
D | IRect_x.cpp | 9 SkIRect sorted = unsorted.makeSorted(); in draw() local
|
D | IRect_equal_operator.cpp | 8 SkIRect sorted = test.makeSorted(); in draw() local
|
D | IRect_y.cpp | 9 SkIRect sorted = unsorted.makeSorted(); in draw() local
|
D | Rect_x.cpp | 9 SkRect sorted = unsorted.makeSorted(); in draw() local
|
D | IRect_top.cpp | 9 SkIRect sorted = unsorted.makeSorted(); in draw() local
|
D | Rect_y.cpp | 9 SkRect sorted = unsorted.makeSorted(); in draw() local
|
D | Rect_bottom.cpp | 9 SkRect sorted = unsorted.makeSorted(); in draw() local
|
D | IRect_notequal_operator.cpp | 8 SkIRect sorted = test.makeSorted(); in draw() local
|
D | Rect_left.cpp | 9 SkRect sorted = unsorted.makeSorted(); in draw() local
|
D | IRect_right.cpp | 9 SkIRect sorted = unsorted.makeSorted(); in draw() local
|
D | IRect_left.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/cldr/tools/cldr-unittest/src/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
|
D | XLocaleMatcherTest.java | 121 TreeSet<ULocale> sorted = new TreeSet<ULocale>(); in testExactMatches() local 134 private void check(Set<ULocale> sorted) { in check() 148 private void check2(Set<ULocale> sorted) { in check2()
|
/external/llvm-project/libcxx/test/libcxx/fuzzing/ |
D | partial_sort_copy.pass.cpp | 35 std::vector<std::uint8_t> sorted(data + 1, data + size); in LLVMFuzzerTestOneInput() local
|
/external/cldr/tools/java/org/unicode/cldr/tool/ |
D | CheckAnnotations.java | 15 Set<String> sorted = new TreeSet<>(config.getCollator()); in main() local
|
D | GenerateScriptMetadata.java | 28 Set<R3<Integer, String, Info>> sorted = new TreeSet<>(); in main() local
|
/external/tensorflow/tensorflow/core/common_runtime/ |
D | device_set_test.cc | 145 PrioritizedDeviceVector sorted{ in TEST_F() local 159 PrioritizedDeviceTypeVector sorted{std::make_pair(DeviceType("d3"), 20), in TEST_F() local
|