| /aosp_15_r20/libcore/ojluni/src/test/java/util/Arrays/ |
| H A D | SortingHelper.java | 48 public void sort(Object a) { in sort() method
53 DualPivotQuicksort.sort((int[]) a, SEQUENTIAL, 0, ((int[]) a).length); in sort()
55 DualPivotQuicksort.sort((long[]) a, SEQUENTIAL, 0, ((long[]) a).length); in sort()
57 DualPivotQuicksort.sort((byte[]) a, 0, ((byte[]) a).length); in sort()
59 DualPivotQuicksort.sort((char[]) a, SEQUENTIAL, 0, ((char[]) a).length); in sort()
61 DualPivotQuicksort.sort((short[]) a, SEQUENTIAL, 0, ((short[]) a).length); in sort()
63 DualPivotQuicksort.sort((float[]) a, SEQUENTIAL, 0, ((float[]) a).length); in sort()
65 DualPivotQuicksort.sort((double[]) a, SEQUENTIAL, 0, ((double[]) a).length); in sort()
106 public void sort(Object a, int low, int high) { in sort() method
111 DualPivotQuicksort.sort((int[]) a, SEQUENTIAL, low, high); in sort()
[all …]
|
| /aosp_15_r20/external/aws-sdk-java-v2/services-custom/dynamodb-enhanced/src/test/java/software/amazon/awssdk/enhanced/dynamodb/functionaltests/document/ |
| H A D | BasicScanTest.java | 90 … .addIndexSortKey(TableMetadata.primaryIndexName(), "sort", in createTable()
104 … .addIndexSortKey(TableMetadata.primaryIndexName(), "sort", in createTable()
114 .putNumber("sort", i)
125 .putNumber("sort", i)
193 docMappedtable.scan(b -> b.attributesToProject("sort")).iterator(); in queryAllRecordsDefaultSettings_withProjection()
203 assertThat(firstRecord.getNumber("sort").intValue(), is(0)); in queryAllRecordsDefaultSettings_withProjection()
221 .expression("sort >= :min_value AND sort <= :max_value") in scanAllRecordsWithFilter()
233 …MENTS_WITH_PROVIDERS.stream().filter(r -> r.getNumber("sort").intValue() >= 3 && r.getNumber("sort… in scanAllRecordsWithFilter()
246 .expression("#sort >= :min_value AND #sort <= :max_value") in scanAllRecordsWithFilterAndProjection()
248 .putExpressionName("#sort", "sort") in scanAllRecordsWithFilterAndProjection()
[all …]
|
| /aosp_15_r20/external/apache-commons-lang/src/main/java/org/apache/commons/lang3/ |
| H A D | ArraySorter.java | 32 * @param array the array to sort.
34 * @see Arrays#sort(byte[])
36 public static byte[] sort(final byte[] array) { in sort() method in ArraySorter
37 Arrays.sort(array); in sort()
44 * @param array the array to sort.
46 * @see Arrays#sort(char[])
48 public static char[] sort(final char[] array) { in sort() method in ArraySorter
49 Arrays.sort(array); in sort()
56 * @param array the array to sort.
58 * @see Arrays#sort(double[])
[all …]
|
| /aosp_15_r20/external/aws-sdk-java-v2/services-custom/dynamodb-enhanced/src/test/java/software/amazon/awssdk/enhanced/dynamodb/functionaltests/ |
| H A D | BasicScanTest.java | 59 private Integer sort; field in BasicScanTest.Record
71 return sort; in getSort()
74 private Record setSort(Integer sort) { in setSort() argument
75 this.sort = sort; in setSort()
85 Objects.equals(sort, record.sort); in equals()
90 return Objects.hash(id, sort); in hashCode()
101 .addAttribute(Integer.class, a -> a.name("sort")
184 mappedTable.scan(b -> b.attributesToProject("sort")).iterator(); in queryAllRecordsDefaultSettings_withProjection()
194 assertThat(firstRecord.sort, is(0)); in queryAllRecordsDefaultSettings_withProjection()
212 .expression("sort >= :min_value AND sort <= :max_value") in scanAllRecordsWithFilter()
[all …]
|
| H A D | AsyncBasicCrudTest.java | 53 private String sort; field in AsyncBasicCrudTest.Record
68 return sort; in getSort()
71 private Record setSort(String sort) { in setSort() argument
72 this.sort = sort; in setSort()
109 Objects.equals(sort, record.sort) && in equals()
117 return Objects.hash(id, sort, attribute, attribute2, attribute3); in hashCode()
123 private String sort; field in AsyncBasicCrudTest.ShortRecord
136 return sort; in getSort()
139 private ShortRecord setSort(String sort) { in setSort() argument
140 this.sort = sort; in setSort()
[all …]
|
| H A D | BasicCrudTest.java | 52 private String sort; field in BasicCrudTest.Record
67 return sort; in getSort()
70 private Record setSort(String sort) { in setSort() argument
71 this.sort = sort; in setSort()
108 Objects.equals(sort, record.sort) && in equals()
116 return Objects.hash(id, sort, attribute, attribute2, attribute3); in hashCode()
122 private String sort; field in BasicCrudTest.ShortRecord
135 return sort; in getSort()
138 private ShortRecord setSort(String sort) { in setSort() argument
139 this.sort = sort; in setSort()
[all …]
|
| /aosp_15_r20/external/tensorflow/tensorflow/compiler/xla/service/ |
| H A D | stable_sort_expander.cc | 34 // If no matching iota operand is found, a iota operand is added to Sort. The
39 auto* sort = Cast<HloSortInstruction>(instruction); in ExpandInstruction() local
40 HloComputation* computation = sort->parent(); in ExpandInstruction()
45 for (const HloInstruction* operand : sort->operands()) { in ExpandInstruction()
47 // same as the dimension to sort. Also it should have an integral type that in ExpandInstruction()
48 // is large enough for the number of elements in the sort dimension. For in ExpandInstruction()
50 // all Sort ops which are created by TopK. in ExpandInstruction()
54 sort->sort_dimension() && in ExpandInstruction()
56 iota_index = sort->operand_index(operand); in ExpandInstruction()
62 // sort stable, we will have to add a new such operand. in ExpandInstruction()
[all …]
|
| /aosp_15_r20/external/toybox/tests/ |
| H A D | sort.test | 3 # SUSv4 compliant sort tests.
10 testing "unknown argument" 'sort --oops 2>/dev/null ; echo $?' "2\n" "" ""
11 testing "sort" "sort input" "a\nb\nc\n" "c\na\nb\n" ""
12 testing "#2" "sort input" "010\n1\n3\n" "3\n1\n010\n" ""
13 testing "stdin" "sort" "a\nb\nc\n" "" "b\na\nc\n"
14 testing "numeric" "sort -n input" "1\n3\n010\n" "3\n1\n010\n" ""
15 testing "reverse" "sort -r input" "wook\nwalrus\npoint\npabst\naargh\n" \
17 testing "sort -o" "sort input -o output && cat output" "a\nb\nc\n" "c\na\nb\n" ""
18 testing "sort -o same" "sort input -o input && cat input" "a\nb\nc\n" "c\na\nb\n" ""
32 testing "one key" "sort -k4,4 input" \
[all …]
|
| /aosp_15_r20/external/selinux/libsepol/cil/src/ |
| H A D | cil_post.c | 351 /* sort ipv4 before ipv6 */ in cil_post_nodecon_compare()
732 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()
[all …]
|
| /aosp_15_r20/external/ow2-asm/asm/src/main/java/org/objectweb/asm/ |
| H A D | TypeReference.java | 42 * The sort of type references that target a type parameter of a generic class. See {@link
48 * The sort of type references that target a type parameter of a generic method. See {@link
54 * The sort of type references that target the super class of a class or one of the interfaces it
60 * The sort of type references that target a bound of a type parameter of a generic class. See
66 * The sort of type references that target a bound of a type parameter of a generic method. See
71 /** The sort of type references that target the type of a field. See {@link #getSort}. */
74 /** The sort of type references that target the return type of a method. See {@link #getSort}. */
78 * The sort of type references that target the receiver type of a method. See {@link #getSort}.
83 * The sort of type references that target the type of a formal parameter of a method. See {@link
89 * The sort of type references that target the type of an exception declared in the throws clause
[all …]
|
| /aosp_15_r20/external/python/cpython2/Objects/ |
| D | listsort.txt | 51 someone has suggested "and it would be cool if list.sort() had a special
58 *sort: random data
59 \sort: descending data
60 /sort: ascending data
61 3sort: ascending, then 3 random exchanges
62 +sort: ascending, then 10 random at the end
63 %sort: ascending, then randomly replace 1% of elements w/ random values
64 ~sort: many duplicates
65 =sort: all equal
66 !sort: worst case scenario
[all …]
|
| /aosp_15_r20/external/python/cpython3/Objects/ |
| D | listsort.txt | 51 someone has suggested "and it would be cool if list.sort() had a special
58 *sort: random data
59 \sort: descending data
60 /sort: ascending data
61 3sort: ascending, then 3 random exchanges
62 +sort: ascending, then 10 random at the end
63 %sort: ascending, then randomly replace 1% of elements w/ random values
64 ~sort: many duplicates
65 =sort: all equal
66 !sort: worst case scenario
[all …]
|
| /aosp_15_r20/external/bazelbuild-rules_testing/lib/private/ |
| H A D | failure_messages.bzl | 24 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 …]
|
| /aosp_15_r20/external/python/cpython3/Lib/test/ |
| D | test_sort.py | 18 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()
123 check("exception during sort left some permutation", x, s)
127 augmented.sort() # forced stable because ties broken by index
128 x = [e for e, i in augmented] # a stable sort of s
136 # bug 453523 -- list.sort() crasher.
138 # Mutations during a list sort should raise a ValueError.
[all …]
|
| /aosp_15_r20/external/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| H A D | Z3Solver.cpp | 65 /// Wrapper for Z3 Sort
71 Z3_sort Sort; member in __anone9dc615e0111::Z3Sort
75 Z3Sort(Z3Context &C, Z3_sort ZS) : Context(C), Sort(ZS) { in Z3Sort()
76 Z3_inc_ref(Context.Context, reinterpret_cast<Z3_ast>(Sort)); in Z3Sort()
80 Z3Sort(const Z3Sort &Other) : Context(Other.Context), Sort(Other.Sort) { in Z3Sort()
81 Z3_inc_ref(Context.Context, reinterpret_cast<Z3_ast>(Sort)); in Z3Sort()
87 Z3_inc_ref(Context.Context, reinterpret_cast<Z3_ast>(Other.Sort)); in operator =()
88 Z3_dec_ref(Context.Context, reinterpret_cast<Z3_ast>(Sort)); in operator =()
89 Sort = Other.Sort; in operator =()
97 if (Sort) in ~Z3Sort()
[all …]
|
| /aosp_15_r20/external/tensorflow/tensorflow/python/ops/ |
| H A D | sort_ops.py | 29 @tf_export('sort')
31 def sort(values, axis=-1, direction='ASCENDING', name=None): function
37 >>> tf.sort(a).numpy()
40 >>> tf.sort(a, direction='DESCENDING').numpy()
43 For multidimensional inputs you can control which axis the sort is applied
49 >>> tf.sort(mat, axis=-1).numpy()
53 >>> tf.sort(mat, axis=0).numpy()
60 * `tf.argsort`: Like sort, but it returns the sort indices.
61 * `tf.math.top_k`: A partial sort that returns a fixed number of top values
67 axis: The axis along which to sort. The default is -1, which sorts the last
[all …]
|
| /aosp_15_r20/external/python/cpython2/Lib/test/ |
| D | test_sort.py | 17 raw.sort(compare)
19 raw.sort()
103 s.sort(lambda a, b: int(random.random() * 3) - 1)
112 s.sort()
117 check("exception during sort left some permutation", x, s)
121 augmented.sort() # forced stable because ties broken by index
122 x = [e for e, i in augmented] # a stable sort of s
130 # bug 453523 -- list.sort() crasher.
132 # Mutations during a list sort should raise a ValueError.
143 self.assertRaises(ValueError, L.sort)
[all …]
|
| /aosp_15_r20/libcore/ojluni/src/main/java/java/util/ |
| H A D | DualPivotQuicksort.java | 39 * Quicksort, such as mixed insertion sort, merging of runs and heap
40 * sort, counting sort and parallel merge sort.
59 * Max array size to use mixed insertion sort.
64 * Max array size to use insertion sort.
104 * Min size of a byte array to use counting sort.
109 * Min size of a short or char array to use counting sort.
114 * Threshold of mixed insertion sort is incremented by this value.
119 * Max recursive partitioning depth before using heap sort.
142 * sort and/or Dual-Pivot Quicksort.
144 * To balance the faster splitting and parallelism of merge sort
[all …]
|
| /aosp_15_r20/out/soong/.intermediates/libcore/core_oj_api_files/gen/18/libcore/ojluni/src/main/java/java/util/ |
| D | DualPivotQuicksort.java | 39 * Quicksort, such as mixed insertion sort, merging of runs and heap
40 * sort, counting sort and parallel merge sort.
59 * Max array size to use mixed insertion sort.
64 * Max array size to use insertion sort.
104 * Min size of a byte array to use counting sort.
109 * Min size of a short or char array to use counting sort.
114 * Threshold of mixed insertion sort is incremented by this value.
119 * Max recursive partitioning depth before using heap sort.
142 * sort and/or Dual-Pivot Quicksort.
144 * To balance the faster splitting and parallelism of merge sort
[all …]
|
| /aosp_15_r20/out/soong/.intermediates/libcore/core_oj_api_files/gen/gensrcs/libcore/ojluni/src/main/java/java/util/ |
| D | DualPivotQuicksort.java | 39 * Quicksort, such as mixed insertion sort, merging of runs and heap
40 * sort, counting sort and parallel merge sort.
59 * Max array size to use mixed insertion sort.
64 * Max array size to use insertion sort.
104 * Min size of a byte array to use counting sort.
109 * Min size of a short or char array to use counting sort.
114 * Threshold of mixed insertion sort is incremented by this value.
119 * Max recursive partitioning depth before using heap sort.
142 * sort and/or Dual-Pivot Quicksort.
144 * To balance the faster splitting and parallelism of merge sort
[all …]
|
| /aosp_15_r20/external/swiftshader/third_party/llvm-16.0/llvm/lib/Support/ |
| H A D | Z3Solver.cpp | 68 /// Wrapper for Z3 Sort
74 Z3_sort Sort; member in __anon512af9640111::Z3Sort
78 Z3Sort(Z3Context &C, Z3_sort ZS) : Context(C), Sort(ZS) { in Z3Sort()
79 Z3_inc_ref(Context.Context, reinterpret_cast<Z3_ast>(Sort)); in Z3Sort()
83 Z3Sort(const Z3Sort &Other) : Context(Other.Context), Sort(Other.Sort) { in Z3Sort()
84 Z3_inc_ref(Context.Context, reinterpret_cast<Z3_ast>(Sort)); in Z3Sort()
90 Z3_inc_ref(Context.Context, reinterpret_cast<Z3_ast>(Other.Sort)); in operator =()
91 Z3_dec_ref(Context.Context, reinterpret_cast<Z3_ast>(Sort)); in operator =()
92 Sort = Other.Sort; in operator =()
100 if (Sort) in ~Z3Sort()
[all …]
|
| /aosp_15_r20/prebuilts/rust/linux-musl-x86/1.81.0/lib/rustlib/src/rust/library/alloc/benches/ |
| H A D | slice.rs | 231 macro_rules! sort { macro
287 sort!(sort, sort_small_ascending, gen_ascending, 10);
288 sort!(sort, sort_small_descending, gen_descending, 10);
289 sort!(sort, sort_small_random, gen_random, 10);
290 sort!(sort, sort_small_big, gen_big_random, 10);
291 sort!(sort, sort_medium_random, gen_random, 100);
292 sort!(sort, sort_large_ascending, gen_ascending, 10000);
293 sort!(sort, sort_large_descending, gen_descending, 10000);
294 sort!(sort, sort_large_mostly_ascending, gen_mostly_ascending, 10000);
295 sort!(sort, sort_large_mostly_descending, gen_mostly_descending, 10000);
[all …]
|
| /aosp_15_r20/prebuilts/rust/linux-x86/1.81.0/lib/rustlib/src/rust/library/alloc/benches/ |
| H A D | slice.rs | 231 macro_rules! sort { macro
287 sort!(sort, sort_small_ascending, gen_ascending, 10);
288 sort!(sort, sort_small_descending, gen_descending, 10);
289 sort!(sort, sort_small_random, gen_random, 10);
290 sort!(sort, sort_small_big, gen_big_random, 10);
291 sort!(sort, sort_medium_random, gen_random, 100);
292 sort!(sort, sort_large_ascending, gen_ascending, 10000);
293 sort!(sort, sort_large_descending, gen_descending, 10000);
294 sort!(sort, sort_large_mostly_ascending, gen_mostly_ascending, 10000);
295 sort!(sort, sort_large_mostly_descending, gen_mostly_descending, 10000);
[all …]
|
| /aosp_15_r20/prebuilts/rust/linux-x86/1.81.0.u1/lib/rustlib/src/rust/library/alloc/benches/ |
| H A D | slice.rs | 231 macro_rules! sort { macro
287 sort!(sort, sort_small_ascending, gen_ascending, 10);
288 sort!(sort, sort_small_descending, gen_descending, 10);
289 sort!(sort, sort_small_random, gen_random, 10);
290 sort!(sort, sort_small_big, gen_big_random, 10);
291 sort!(sort, sort_medium_random, gen_random, 100);
292 sort!(sort, sort_large_ascending, gen_ascending, 10000);
293 sort!(sort, sort_large_descending, gen_descending, 10000);
294 sort!(sort, sort_large_mostly_ascending, gen_mostly_ascending, 10000);
295 sort!(sort, sort_large_mostly_descending, gen_mostly_descending, 10000);
[all …]
|
| /aosp_15_r20/prebuilts/rust/linux-x86/1.80.1/lib/rustlib/src/rust/library/alloc/benches/ |
| H A D | slice.rs | 231 macro_rules! sort { macro
287 sort!(sort, sort_small_ascending, gen_ascending, 10);
288 sort!(sort, sort_small_descending, gen_descending, 10);
289 sort!(sort, sort_small_random, gen_random, 10);
290 sort!(sort, sort_small_big, gen_big_random, 10);
291 sort!(sort, sort_medium_random, gen_random, 100);
292 sort!(sort, sort_large_ascending, gen_ascending, 10000);
293 sort!(sort, sort_large_descending, gen_descending, 10000);
294 sort!(sort, sort_large_mostly_ascending, gen_mostly_ascending, 10000);
295 sort!(sort, sort_large_mostly_descending, gen_mostly_descending, 10000);
[all …]
|