Home
last modified time | relevance | path

Searched defs:sorted (Results 1 – 25 of 195) sorted by relevance

12345678

/external/rust/crates/serde_cbor/tests/
Dcanonical.rs29 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/
Dhuffman_utils.c82 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/
DGraph.java84 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/
DRect_top.cpp9 SkRect sorted = unsorted.makeSorted(); in draw() local
DIRect_bottom.cpp9 SkIRect sorted = unsorted.makeSorted(); in draw() local
DRect_right.cpp9 SkRect sorted = unsorted.makeSorted(); in draw() local
DIRect_x.cpp9 SkIRect sorted = unsorted.makeSorted(); in draw() local
DIRect_equal_operator.cpp8 SkIRect sorted = test.makeSorted(); in draw() local
DIRect_y.cpp9 SkIRect sorted = unsorted.makeSorted(); in draw() local
DRect_x.cpp9 SkRect sorted = unsorted.makeSorted(); in draw() local
DIRect_top.cpp9 SkIRect sorted = unsorted.makeSorted(); in draw() local
DRect_y.cpp9 SkRect sorted = unsorted.makeSorted(); in draw() local
DRect_bottom.cpp9 SkRect sorted = unsorted.makeSorted(); in draw() local
DIRect_notequal_operator.cpp8 SkIRect sorted = test.makeSorted(); in draw() local
DRect_left.cpp9 SkRect sorted = unsorted.makeSorted(); in draw() local
DIRect_right.cpp9 SkIRect sorted = unsorted.makeSorted(); in draw() local
DIRect_left.cpp9 SkIRect sorted = unsorted.makeSorted(); in draw() local
DRect_joinNonEmptyArg.cpp8 SkRect sorted = rect.makeSorted(); in draw() local
DRect_joinPossiblyEmptyRect.cpp8 SkRect sorted = rect.makeSorted(); in draw() local
/external/cldr/tools/cldr-unittest/src/org/unicode/cldr/unittest/
DTestAliases.java88 Set<String> sorted = new TreeSet<>(); in testCountFull() local
131 Set<String> sorted = new TreeSet<>(); in checkEmitChanged() local
DXLocaleMatcherTest.java121 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/
Dpartial_sort_copy.pass.cpp35 std::vector<std::uint8_t> sorted(data + 1, data + size); in LLVMFuzzerTestOneInput() local
/external/cldr/tools/java/org/unicode/cldr/tool/
DCheckAnnotations.java15 Set<String> sorted = new TreeSet<>(config.getCollator()); in main() local
DGenerateScriptMetadata.java28 Set<R3<Integer, String, Info>> sorted = new TreeSet<>(); in main() local
/external/tensorflow/tensorflow/core/common_runtime/
Ddevice_set_test.cc145 PrioritizedDeviceVector sorted{ in TEST_F() local
159 PrioritizedDeviceTypeVector sorted{std::make_pair(DeviceType("d3"), 20), in TEST_F() local

12345678