Home
last modified time | relevance | path

Searched refs:sort (Results 1 – 25 of 5208) sorted by relevance

12345678910>>...209

/external/apache-commons-lang/src/main/java/org/apache/commons/lang3/
DArraySorter.java36 public static byte[] sort(final byte[] array) { in sort() method in ArraySorter
37 Arrays.sort(array); in sort()
48 public static char[] sort(final char[] array) { in sort() method in ArraySorter
49 Arrays.sort(array); in sort()
60 public static double[] sort(final double[] array) { in sort() method in ArraySorter
61 Arrays.sort(array); in sort()
72 public static float[] sort(final float[] array) { in sort() method in ArraySorter
73 Arrays.sort(array); in sort()
84 public static int[] sort(final int[] array) { in sort() method in ArraySorter
85 Arrays.sort(array); in sort()
[all …]
/external/clang/unittests/Format/
DSortIncludesTest.cpp27 std::string sort(StringRef Code, StringRef FileName = "input.cpp") { in sort() function in clang::format::__anon67712d250111::SortIncludesTest
51 sort("#include \"a.h\"\n" in TEST_F()
76 sort("#include <b>\n" in TEST_F()
91 sort("#include \"a.h\"\n" in TEST_F()
100 sort("#include \"a.h\"\n" in TEST_F()
109 sort("#include \"a.h\" // comment\n" in TEST_F()
118 sort(" #include \"a.h\"\n" in TEST_F()
124 sort("# include \"a.h\"\n" in TEST_F()
133 sort("#include \"a.h\"\n" in TEST_F()
143 sort("#include \"a.h\"\n" in TEST_F()
[all …]
/external/apache-commons-lang/src/test/java/org/apache/commons/lang3/
DArraySorterTest.java32 Arrays.sort(array1); in testSortByteArray()
33 assertArrayEquals(array1, ArraySorter.sort(array2)); in testSortByteArray()
40 Arrays.sort(array1); in testSortCharArray()
41 assertArrayEquals(array1, ArraySorter.sort(array2)); in testSortCharArray()
48 Arrays.sort(array1); in testSortComparable()
49 assertArrayEquals(array1, ArraySorter.sort(array2, String::compareTo)); in testSortComparable()
56 Arrays.sort(array1); in testSortDoubleArray()
57 assertArrayEquals(array1, ArraySorter.sort(array2)); in testSortDoubleArray()
64 Arrays.sort(array1); in testSortFloatArray()
65 assertArrayEquals(array1, ArraySorter.sort(array2)); in testSortFloatArray()
[all …]
/external/tensorflow/tensorflow/compiler/xla/service/
Dstable_sort_expander.cc39 auto* sort = Cast<HloSortInstruction>(instruction); in ExpandInstruction() local
40 HloComputation* computation = sort->parent(); in ExpandInstruction()
45 for (const HloInstruction* operand : sort->operands()) { in ExpandInstruction()
54 sort->sort_dimension() && in ExpandInstruction()
56 iota_index = sort->operand_index(operand); in ExpandInstruction()
64 Shape iota_shape = sort->operand(0)->shape(); in ExpandInstruction()
69 if (iota_shape.dimensions(sort->sort_dimension()) > in ExpandInstruction()
76 HloInstruction::CreateIota(iota_shape, sort->sort_dimension())); in ExpandInstruction()
79 auto comparator = sort->to_apply(); in ExpandInstruction()
86 sort->operand_count() * 2, scalar_shape, in ExpandInstruction()
[all …]
Dsort_simplifier.cc33 StatusOr<bool> RemoveUnusedOperandFromSort(HloInstruction* sort) { in RemoveUnusedOperandFromSort() argument
34 if (!sort->shape().IsTuple()) { in RemoveUnusedOperandFromSort()
38 HloComputation* computation = sort->parent(); in RemoveUnusedOperandFromSort()
40 if (computation->root_instruction() == sort) { in RemoveUnusedOperandFromSort()
46 for (const HloInstruction* user : sort->users()) { in RemoveUnusedOperandFromSort()
55 auto comparator = sort->to_apply(); in RemoveUnusedOperandFromSort()
56 for (int64_t i = 0; i < sort->operand_count() * 2; ++i) { in RemoveUnusedOperandFromSort()
64 if (used_indices.size() == sort->operand_count()) { in RemoveUnusedOperandFromSort()
71 for (int64_t i = 0; i < sort->operand_count(); ++i) { in RemoveUnusedOperandFromSort()
73 operands.push_back(sort->mutable_operand(i)); in RemoveUnusedOperandFromSort()
[all …]
Dtopk_rewriter.cc116 HloSortInstruction* sort = DynCast<HloSortInstruction>(inst); in SortIsInTopK() local
117 if (sort == nullptr) { in SortIsInTopK()
120 if (sort->operand_count() != 1 && sort->operand_count() != 2) { in SortIsInTopK()
123 HloInstruction* data = sort->mutable_operand(0); in SortIsInTopK()
125 if (sort->operand_count() == 2) { in SortIsInTopK()
127 DynCast<HloIotaInstruction>(sort->mutable_operand(1)); in SortIsInTopK()
131 iota->iota_dimension() != sort->sort_dimension()) { in SortIsInTopK()
135 if (!IsNanSafeGt(sort->to_apply())) { in SortIsInTopK()
138 const int64_t sort_dim = sort->sort_dimension(); in SortIsInTopK()
144 for (HloInstruction* user : sort->users()) { in SortIsInTopK()
[all …]
/external/aws-sdk-java-v2/services-custom/dynamodb-enhanced/src/test/java/software/amazon/awssdk/enhanced/dynamodb/functionaltests/models/
DFakeItemWithNumericSort.java42 private Integer sort; field in FakeItemWithNumericSort
47 public FakeItemWithNumericSort(String id, Integer sort) { in FakeItemWithNumericSort() argument
49 this.sort = sort; in FakeItemWithNumericSort()
63 .sort(RANDOM.nextInt()) in createUniqueFakeItemWithSort()
76 return sort; in getSort()
79 public void setSort(Integer sort) { in setSort() argument
80 this.sort = sort; in setSort()
85 private Integer sort; field in FakeItemWithNumericSort.Builder
92 public Builder sort(Integer sort) { in sort() method in FakeItemWithNumericSort.Builder
93 this.sort = sort; in sort()
[all …]
DFakeItemWithSort.java47 private String sort; field in FakeItemWithSort
54 … public FakeItemWithSort(String id, String sort, String otherAttribute1, String otherAttribute2) { in FakeItemWithSort() argument
56 this.sort = sort; in FakeItemWithSort()
76 .sort(UUID.randomUUID().toString()) in createUniqueFakeItemWithSort()
95 return sort; in getSort()
98 public void setSort(String sort) { in setSort() argument
99 this.sort = sort; in setSort()
128 Objects.equals(sort, that.sort) && in equals()
135 return Objects.hash(id, sort, otherAttribute1, otherAttribute2); in hashCode()
140 private String sort; field in FakeItemWithSort.Builder
[all …]
DFakeItemWithIndices.java53 private String sort; field in FakeItemWithIndices
61 … public FakeItemWithIndices(String id, String sort, String gsiId, String gsiSort, String lsiSort) { in FakeItemWithIndices() argument
63 this.sort = sort; in FakeItemWithIndices()
80 .sort(UUID.randomUUID().toString()) in createUniqueFakeItemWithIndices()
96 return sort; in getSort()
99 public void setSort(String sort) { in setSort() argument
100 this.sort = sort; in setSort()
129 private String sort; field in FakeItemWithIndices.Builder
139 public Builder sort(String sort) { in sort() method in FakeItemWithIndices.Builder
140 this.sort = sort; in sort()
[all …]
DNestedTestRecord.java9 private Integer sort; field in NestedTestRecord
26 return sort; in getSort()
29 public void setSort(Integer sort) { in setSort() argument
30 this.sort = sort; in setSort()
57 ", sort=" + sort + in toString()
/external/python/cpython3/Lib/test/
Dtest_sort.py18 raw.sort(key=cmp_to_key(compare))
20 raw.sort()
103 s.sort(key=cmp_to_key(lambda a, b: int(random.random() * 3) - 1))
110 self.assertRaises(RuntimeError, s.sort, key=bad_key)
118 s.sort()
127 augmented.sort() # forced stable because ties broken by index
170 self.assertRaises(ValueError, L.sort)
181 self.assertRaises(ValueError, L.sort, key=cmp_to_key(mutating_cmp))
186 self.assertRaises(ValueError, L.sort, key=cmp_to_key(mutating_cmp))
197 data.sort(key=str.lower)
[all …]
/external/sdv/vsomeip/third_party/boost/range/include/boost/range/algorithm/
Dsort.hpp30 inline RandomAccessRange& sort(RandomAccessRange& rng) in sort() function
33 std::sort(boost::begin(rng), boost::end(rng)); in sort()
39 inline const RandomAccessRange& sort(const RandomAccessRange& rng) in sort() function
42 std::sort(boost::begin(rng), boost::end(rng)); in sort()
48 inline RandomAccessRange& sort(RandomAccessRange& rng, BinaryPredicate pred) in sort() function
51 std::sort(boost::begin(rng), boost::end(rng), pred); in sort()
57 inline const RandomAccessRange& sort(const RandomAccessRange& rng, BinaryPredicate pred) in sort() function
60 std::sort(boost::begin(rng), boost::end(rng), pred); in sort()
65 using range::sort;
/external/sdv/vsomeip/third_party/boost/range/doc/reference/algorithm/
Dsort.qbk6 [section:sort sort]
12 RandomAccessRange& sort(RandomAccessRange& rng);
15 const RandomAccessRange& sort(const RandomAccessRange& rng);
18 RandomAccessRange& sort(RandomAccessRange& rng, BinaryPredicate pred);
21 const RandomAccessRange& sort(const RandomAccessRange& rng, BinaryPredicate pred);
26 `sort` sorts the elements in `rng` into ascending order. `sort` is not guaranteed to be stable. Ret…
28 For versions of the `sort` function without a predicate, ascending order is defined by `operator<()…
30 For versions of the `sort` function with a predicate, ascending order is defined by `pred` such tha…
34 Defined in the header file `boost/range/algorithm/sort.hpp`
38 [*For versions of sort without a predicate:]
[all …]
/external/cronet/stable/third_party/icu/source/data/lang/
Dhi_Latn.txt47 non-ignorable{"Symbols ko sort karein"}
48 shifted{"Symbols ko ignore karte hue sort karein"}
51 no{"Accents ko normally sort karein"}
52 yes{"Accents ko reverse mein sort karein"}
55 lower{"Pahle lowercase walon ko sort karein"}
56 no{"Normal case order mein sort karein"}
57 upper{"Pahle uppercase walon ko sort karein"}
64 no{"Bina normalization ke sort karein"}
68 no{"Digits ko alag-alag sort karein"}
69 yes{"Digits ko numerically sort karein"}
[all …]
/external/cronet/tot/third_party/icu/source/data/lang/
Dhi_Latn.txt47 non-ignorable{"Symbols ko sort karein"}
48 shifted{"Symbols ko ignore karte hue sort karein"}
51 no{"Accents ko normally sort karein"}
52 yes{"Accents ko reverse mein sort karein"}
55 lower{"Pahle lowercase walon ko sort karein"}
56 no{"Normal case order mein sort karein"}
57 upper{"Pahle uppercase walon ko sort karein"}
64 no{"Bina normalization ke sort karein"}
68 no{"Digits ko alag-alag sort karein"}
69 yes{"Digits ko numerically sort karein"}
[all …]
/external/icu/icu4c/source/data/lang/
Dhi_Latn.txt47 non-ignorable{"Symbols ko sort karein"}
48 shifted{"Symbols ko ignore karte hue sort karein"}
51 no{"Accents ko normally sort karein"}
52 yes{"Accents ko reverse mein sort karein"}
55 lower{"Pahle lowercase walon ko sort karein"}
56 no{"Normal case order mein sort karein"}
57 upper{"Pahle uppercase walon ko sort karein"}
64 no{"Bina normalization ke sort karein"}
68 no{"Digits ko alag-alag sort karein"}
69 yes{"Digits ko numerically sort karein"}
[all …]
/external/selinux/libsepol/cil/src/
Dcil_post.c732 struct cil_sort *sort = db->netifcon; in __cil_post_db_array_helper() local
733 uint32_t count = sort->count; in __cil_post_db_array_helper()
734 uint32_t i = sort->index; in __cil_post_db_array_helper()
735 if (sort->array == NULL) { in __cil_post_db_array_helper()
736 sort->array = cil_malloc(sizeof(*sort->array)*count); in __cil_post_db_array_helper()
738 sort->array[i] = node->data; in __cil_post_db_array_helper()
739 sort->index++; in __cil_post_db_array_helper()
743 struct cil_sort *sort = db->ibendportcon; in __cil_post_db_array_helper() local
744 uint32_t count = sort->count; in __cil_post_db_array_helper()
745 uint32_t i = sort->index; in __cil_post_db_array_helper()
[all …]
/external/bazelbuild-rules_testing/lib/private/
Dfailure_messages.bzl24 def format_actual_collection(actual, name = "values", sort = True):
30 sort: ([`bool`]) If true, the collection will be sorted for display.
34 actual = maybe_sorted(actual, sort)
46 sort = True):
54 sort: ([`bool`]) if True, then missing and actual are sorted. If False, they
61 missing = maybe_sorted(missing, sort)
68 actual_msg = format_actual_collection(actual, name = container_name, sort = sort)
71 def format_failure_unexpected_values(*, none_of, unexpected, actual, sort = True):
79 sort: ([`bool`]) True if the collections should be sorted for output.
85 unexpected = maybe_sorted(unexpected, sort)
[all …]
/external/aws-sdk-java-v2/services-custom/dynamodb-enhanced/src/it/java/software/amazon/awssdk/enhanced/dynamodb/model/
DRecord.java23 private Integer sort; field in Record
40 return sort; in getSort()
43 public Record setSort(Integer sort) { in setSort() argument
44 this.sort = sort; in setSort()
90 Objects.equals(sort, record.sort) && in equals()
99 return Objects.hash(id, sort, value, gsiId, gsiSort, stringAttribute); in hashCode()
/external/ow2-asm/asm/src/main/java/org/objectweb/asm/
DTypeReference.java205 public static TypeReference newTypeReference(final int sort) { in newTypeReference() argument
206 return new TypeReference(sort << 24); in newTypeReference()
216 public static TypeReference newTypeParameterReference(final int sort, final int paramIndex) { in newTypeParameterReference() argument
217 return new TypeReference((sort << 24) | (paramIndex << 16)); in newTypeParameterReference()
229 final int sort, final int paramIndex, final int boundIndex) { in newTypeParameterBoundReference() argument
230 return new TypeReference((sort << 24) | (paramIndex << 16) | (boundIndex << 8)); in newTypeParameterBoundReference()
286 public static TypeReference newTypeArgumentReference(final int sort, final int argIndex) { in newTypeArgumentReference() argument
287 return new TypeReference((sort << 24) | argIndex); in newTypeArgumentReference()
/external/cronet/stable/third_party/libc++/src/test/std/algorithms/alg.sorting/alg.sort/sort/
Dpstl.sort.pass.cpp40 std::sort(policy, Iter(std::begin(in)), Iter(std::end(in))); in operator ()()
46 std::sort(policy, Iter(std::begin(in)), Iter(std::begin(in))); in operator ()()
52 std::sort(policy, Iter(std::begin(in)), Iter(std::begin(in))); in operator ()()
58 std::sort(policy, Iter(std::begin(in)), Iter(std::end(in))); in operator ()()
64 std::sort(policy, Iter(std::begin(in)), Iter(std::end(in))); in operator ()()
70 std::sort(policy, Iter(std::begin(in)), Iter(std::end(in))); in operator ()()
76 std::sort(policy, Iter(std::begin(in)), Iter(std::end(in))); in operator ()()
82 std::sort(policy, Iter(std::begin(in)), Iter(std::end(in))); in operator ()()
88 std::sort(policy, Iter(std::begin(in)), Iter(std::end(in))); in operator ()()
94 std::sort(policy, Iter(std::begin(in)), Iter(std::end(in)), std::greater{}); in operator ()()
[all …]
/external/cronet/tot/third_party/libc++/src/test/std/algorithms/alg.sorting/alg.sort/sort/
Dpstl.sort.pass.cpp40 std::sort(policy, Iter(std::begin(in)), Iter(std::end(in))); in operator ()()
46 std::sort(policy, Iter(std::begin(in)), Iter(std::begin(in))); in operator ()()
52 std::sort(policy, Iter(std::begin(in)), Iter(std::begin(in))); in operator ()()
58 std::sort(policy, Iter(std::begin(in)), Iter(std::end(in))); in operator ()()
64 std::sort(policy, Iter(std::begin(in)), Iter(std::end(in))); in operator ()()
70 std::sort(policy, Iter(std::begin(in)), Iter(std::end(in))); in operator ()()
76 std::sort(policy, Iter(std::begin(in)), Iter(std::end(in))); in operator ()()
82 std::sort(policy, Iter(std::begin(in)), Iter(std::end(in))); in operator ()()
88 std::sort(policy, Iter(std::begin(in)), Iter(std::end(in))); in operator ()()
94 std::sort(policy, Iter(std::begin(in)), Iter(std::end(in)), std::greater{}); in operator ()()
[all …]
/external/curl/tests/
Dmk-bundle-hints.sh52 | grep -E '\.(c|pl):(static|struct)( +[a-zA-Z_* ]+)? +[a-zA-Z_][a-zA-Z0-9_]+ *' | sort -u \
55 | sort | uniq -c | sort -k 2 | grep -v -E '^ +1 ' \
66 | grep -o -E '.+\.(c|pl): *# *define +[A-Z_][A-Z0-9_]+' | sort -u \
68 | sort | uniq -c | sort -k 2 | grep -v -E '^ +1 ' \
/external/toybox/scripts/probes/
Dbloatcheck51 echo "$STUFF" | sort -k4,4nr
56 diff -U 0 <(nm --size-sort "$1"|sort -k 3,3) <(nm --size-sort "$2"|sort -k 3,3)\
57 | tail -n +3 | sed -n 's/^\([-+]\)/\1 /p' | sort -k4,4 | do_bloatcheck
/external/skia/docs/examples/
DRect_makeSorted.cpp8 SkRect sort = rect.makeSorted(); in draw() local
9 SkDebugf("sorted: %g, %g, %g, %g\n", sort.fLeft, sort.fTop, sort.fRight, sort.fBottom); in draw()

12345678910>>...209