| /external/toybox/tests/ |
| 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 …]
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| 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 …]
|
| D | sort_simplifier.cc | 30 // If the sort instruction has a tuple shape then looks for unused output
31 // values and removes them from the sort instruction. Returns true if the
33 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 i = 0; i < sort->operand_count() * 2; ++i) { in RemoveUnusedOperandFromSort()
64 if (used_indices.size() == sort->operand_count()) { in RemoveUnusedOperandFromSort()
[all …]
|
| D | stable_sort_expander_test.cc | 98 sort = (f32[64,8732]{1,0}, s32[64,8732]{1,0}) sort(keys, values), in TEST_F()
100 ROOT gte = f32[64,8732]{1,0} get-tuple-element(sort), index=0 in TEST_F()
109 m::Sort(m::Parameter(0), m::Iota()), 0))); in TEST_F()
144 sort = (f32[64,8732]{1,0}, s32[64,8732]{1,0}) sort(keys, values), in TEST_F()
146 ROOT gte = f32[64,8732]{1,0} get-tuple-element(sort), index=0 in TEST_F()
155 m::Sort(m::Parameter(0), m::Iota()), 0))); in TEST_F()
175 ROOT sort = (f32[64,8732]{1,0}, s32[64,8732]{1,0}) sort(keys, values), in TEST_F()
187 m::Sort(m::Parameter(0), m::Parameter(1), m::Iota()), 0), in TEST_F()
189 m::Sort(m::Parameter(0), m::Parameter(1), m::Iota()), 1)))); in TEST_F()
210 sort = (f32[64,8732]{1,0}, s32[64,8732]{1,0}) sort(keys, values), in TEST_F()
[all …]
|
| D | sort_simplifier_test.cc | 48 sort = (f32[64,8732]{1,0}, s32[64,8732]{1,0}) sort(keys, values), in TEST_F()
50 ROOT gte = f32[64,8732]{1,0} get-tuple-element(sort), index=0 in TEST_F()
62 EXPECT_THAT(root, GmockMatch(m::Sort(m::Parameter(0)))); in TEST_F()
83 sort = (f32[64,87], s32[64,87], u32[64,87]) sort( in TEST_F()
86 gte.0 = f32[64,87] get-tuple-element(sort), index=0 in TEST_F()
87 gte.1 = u32[64,87] get-tuple-element(sort), index=2 in TEST_F()
99 m::GetTupleElement(m::Sort(m::Parameter(0), m::Parameter(2)), 0), in TEST_F()
100 m::GetTupleElement(m::Sort(m::Parameter(0), m::Parameter(2)), 1)))); in TEST_F()
118 … sort = (f32[64,8732]{1,0}, s32[64,8732]{1,0}) sort(keys, values), dimensions={1}, to_apply=compare in TEST_F()
119 ROOT gte = s32[64,8732]{1,0} get-tuple-element(sort), index=1 in TEST_F()
[all …]
|
| /external/python/cpython3/Lib/test/ |
| D | sortperf.py | 1 """Sort performance test.
61 L.sort()
67 r"""Tabulate sort speed for lists of various sizes.
71 The output displays i, 2**i, and the time to sort arrays of 2**i
74 *sort: random data
75 \sort: descending data
76 /sort: ascending data
77 3sort: ascending, then 3 random exchanges
78 +sort: ascending, then 10 random at the end
79 %sort: ascending, then randomly replace 1% of the elements w/ random values
[all …]
|
| 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 …]
|
| /external/python/cpython2/Lib/test/ |
| D | sortperf.py | 1 """Sort performance test.
61 L.sort()
67 """Tabulate sort speed for lists of various sizes.
71 The output displays i, 2**i, and the time to sort arrays of 2**i
74 *sort: random data
75 \sort: descending data
76 /sort: ascending data
77 3sort: ascending, then 3 random exchanges
78 +sort: ascending, then 10 random at the end
79 %sort: ascending, then randomly replace 1% of the elements w/ random values
[all …]
|
| 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 …]
|
| /external/clang/unittests/Format/ |
| D | SortIncludesTest.cpp | 1 //===- unittest/Format/SortIncludesTest.cpp - Include sort unit tests -----===//
27 std::string sort(StringRef Code, StringRef FileName = "input.cpp") { in sort() function in clang::format::__anonbe85486f0111::SortIncludesTest
51 sort("#include \"a.h\"\n" in TEST_F()
57 // Identical #includes have led to a failure with an unstable sort. 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()
[all …]
|
| /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 …]
|
| /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 …]
|
| /external/selinux/libsepol/cil/src/ |
| D | cil_post.c | 330 /* sort ipv4 before ipv6 */ in cil_post_nodecon_compare()
711 struct cil_sort *sort = db->netifcon; in __cil_post_db_array_helper() local
712 uint32_t count = sort->count; in __cil_post_db_array_helper()
713 uint32_t i = sort->index; in __cil_post_db_array_helper()
714 if (sort->array == NULL) { in __cil_post_db_array_helper()
715 sort->array = cil_malloc(sizeof(*sort->array)*count); in __cil_post_db_array_helper()
717 sort->array[i] = node->data; in __cil_post_db_array_helper()
718 sort->index++; in __cil_post_db_array_helper()
722 struct cil_sort *sort = db->ibendportcon; in __cil_post_db_array_helper() local
723 uint32_t count = sort->count; in __cil_post_db_array_helper()
[all …]
|
| /external/python/cpython3/Doc/howto/ |
| D | sorting.rst | 10 Python lists have a built-in :meth:`list.sort` method that modifies the list
20 A simple ascending sort is very easy: just call the :func:`sorted` function. It
26 You can also use the :meth:`list.sort` method. It modifies the list
32 >>> a.sort()
36 Another difference is that the :meth:`list.sort` method is only defined for
45 Both :meth:`list.sort` and :func:`sorted` have a *key* parameter to specify a
57 A common pattern is to sort complex objects using some of the object's indices
65 >>> sorted(student_tuples, key=lambda student: student[2]) # sort by age
83 >>> sorted(student_objects, key=lambda student: student.age) # sort by age
105 sort by *grade* then by *age*:
[all …]
|
| /external/python/cpython2/Doc/howto/ |
| D | sorting.rst | 10 Python lists have a built-in :meth:`list.sort` method that modifies the list
20 A simple ascending sort is very easy: just call the :func:`sorted` function. It
26 You can also use the :meth:`list.sort` method of a list. It modifies the list
32 >>> a.sort()
36 Another difference is that the :meth:`list.sort` method is only defined for
45 Starting with Python 2.4, both :meth:`list.sort` and :func:`sorted` added a
58 A common pattern is to sort complex objects using some of the object's indices
66 >>> sorted(student_tuples, key=lambda student: student[2]) # sort by age
84 >>> sorted(student_objects, key=lambda student: student.age) # sort by age
106 sort by *grade* then by *age*:
[all …]
|
| /external/tensorflow/tensorflow/python/ops/ |
| D | sort_ops_test.py | 15 """Tests for the sort wrapper."""
56 np.sort(arr, axis=sort_axis),
57 sort_ops.sort(constant_op.constant(arr), axis=sort_axis).eval())
69 np.sort(arr, axis=sort_axis),
70 sort_ops.sort(constant_op.constant(arr), axis=sort_axis).eval())
80 sort = sort_ops.sort(scalar)
83 sort.eval()
89 sort_ops.sort(arr, axis=-4)
96 np.sort(arr, axis=0)[::-1],
97 sort_ops.sort(
[all …]
|
| D | sort_ops.py | 18 @@sort
36 @tf_export('sort')
37 def sort(values, axis=-1, direction='ASCENDING', name=None): function
42 axis: The axis along which to sort. The default is -1, which sorts the last
44 direction: The direction in which to sort the values (`'ASCENDING'` or
55 with framework_ops.name_scope(name, 'sort'):
64 `tf.sort(values)`. For higher dimensions, the output has the same shape as
70 axis: The axis along which to sort. The default is -1, which sorts the last
72 direction: The direction in which to sort the values (`'ASCENDING'` or
75 re-ordered in the returned order. Unstable sort is not yet implemented,
[all …]
|
| /external/tensorflow/tensorflow/contrib/factorization/python/kernel_tests/ |
| D | masked_matmul_benchmark.py | 40 def _make_sparse_mask(self, mask_shape, nnz, sort=False): argument
46 sort: boolean, whether to sort the indices of the mask (in lexicographic
60 return sparse_ops.sparse_reorder(unordered_mask) if sort else unordered_mask
62 def _run_graph(self, a_shape, b_shape, nnz, num_iters, sort=False, argument
72 sort: Boolean, whether to sort the indices in the mask.
90 mask = self._make_sparse_mask(mask_shape, nnz, sort)
111 "tr_b:{tr_b} sort:{sort}"
118 sort=int(sort)
136 for sort in [False, True]:
139 self._run_graph(a_shape, b_shape, nnz, num_iters, sort, transpose_a,
|
| /external/python/cpython2/Tools/pybench/ |
| D | Lookups.py | 771 l.sort
772 l.sort
773 l.sort
774 l.sort
775 l.sort
807 l.sort
808 l.sort
809 l.sort
810 l.sort
811 l.sort
[all …]
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| D | ElemSort.java | 30 * Implement xsl:sort.
32 * <!ELEMENT xsl:sort EMPTY>
33 * <!ATTLIST xsl:sort
40 * <!-- xsl:sort cannot occur after any other elements or
51 * xsl:sort has a select attribute whose value is an expression.
58 * xsl:sort has a select attribute whose value is an expression.
64 * sort key for that node. The default value of the select attribute
66 * be used as the sort key.
81 * xsl:sort has a select attribute whose value is an expression.
87 * sort key for that node. The default value of the select attribute
[all …]
|
| /external/skqp/src/compute/hs/cuda/bench/ |
| D | sort.cpp | 10 // Sort 1m 64-bit keys on Intel Core i7-7820HQ
12 // std::sort(std::execution::par_unseq)() : 23 msecs
13 // std::sort() : 88 msecs
106 std::sort(std::execution::par_unseq,a,a+count); in hs_cpu_sort_u32()
107 char const * const algo = "std::sort(std::execution::par_unseq)()"; in hs_cpu_sort_u32()
109 std::sort(a,a+count); in hs_cpu_sort_u32()
110 char const * const algo = "std:sort()"; in hs_cpu_sort_u32()
133 std::sort(std::execution::par_unseq,a,a+count); in hs_cpu_sort_u64()
134 char const * const algo = "std::sort(std::execution::par_unseq)()"; in hs_cpu_sort_u64()
136 std::sort(a,a+count); in hs_cpu_sort_u64()
[all …]
|
| /external/skia/src/compute/hs/cl/bench/ |
| D | sort.cpp | 10 // Sort 1m 64-bit keys on Intel Core i7-7820HQ
12 // std::sort(std::execution::par_unseq)() : 23 msecs
13 // std::sort() : 88 msecs
105 std::sort(std::execution::par_unseq,a,a+count); in hs_cpu_sort_u32()
106 char const * const algo = "std::sort(std::execution::par_unseq)()"; in hs_cpu_sort_u32()
108 std::sort(a,a+count); in hs_cpu_sort_u32()
109 char const * const algo = "std:sort()"; in hs_cpu_sort_u32()
132 std::sort(std::execution::par_unseq,a,a+count); in hs_cpu_sort_u64()
133 char const * const algo = "std::sort(std::execution::par_unseq)()"; in hs_cpu_sort_u64()
135 std::sort(a,a+count); in hs_cpu_sort_u64()
[all …]
|
| /external/skqp/src/compute/hs/vk/bench/ |
| D | sort.cpp | 10 // Sort 1m 64-bit keys on Intel Core i7-7820HQ
12 // std::sort(std::execution::par_unseq)() : 23 msecs
13 // std::sort() : 88 msecs
105 std::sort(std::execution::par_unseq,a,a+count); in hs_cpu_sort_u32()
106 char const * const algo = "std::sort(std::execution::par_unseq)()"; in hs_cpu_sort_u32()
108 std::sort(a,a+count); in hs_cpu_sort_u32()
109 char const * const algo = "std:sort()"; in hs_cpu_sort_u32()
132 std::sort(std::execution::par_unseq,a,a+count); in hs_cpu_sort_u64()
133 char const * const algo = "std::sort(std::execution::par_unseq)()"; in hs_cpu_sort_u64()
135 std::sort(a,a+count); in hs_cpu_sort_u64()
[all …]
|
| /external/skqp/src/compute/hs/cl/bench/ |
| D | sort.cpp | 10 // Sort 1m 64-bit keys on Intel Core i7-7820HQ
12 // std::sort(std::execution::par_unseq)() : 23 msecs
13 // std::sort() : 88 msecs
105 std::sort(std::execution::par_unseq,a,a+count); in hs_cpu_sort_u32()
106 char const * const algo = "std::sort(std::execution::par_unseq)()"; in hs_cpu_sort_u32()
108 std::sort(a,a+count); in hs_cpu_sort_u32()
109 char const * const algo = "std:sort()"; in hs_cpu_sort_u32()
132 std::sort(std::execution::par_unseq,a,a+count); in hs_cpu_sort_u64()
133 char const * const algo = "std::sort(std::execution::par_unseq)()"; in hs_cpu_sort_u64()
135 std::sort(a,a+count); in hs_cpu_sort_u64()
[all …]
|
| /external/skia/src/compute/hs/cuda/bench/ |
| D | sort.cpp | 10 // Sort 1m 64-bit keys on Intel Core i7-7820HQ
12 // std::sort(std::execution::par_unseq)() : 23 msecs
13 // std::sort() : 88 msecs
106 std::sort(std::execution::par_unseq,a,a+count); in hs_cpu_sort_u32()
107 char const * const algo = "std::sort(std::execution::par_unseq)()"; in hs_cpu_sort_u32()
109 std::sort(a,a+count); in hs_cpu_sort_u32()
110 char const * const algo = "std:sort()"; in hs_cpu_sort_u32()
133 std::sort(std::execution::par_unseq,a,a+count); in hs_cpu_sort_u64()
134 char const * const algo = "std::sort(std::execution::par_unseq)()"; in hs_cpu_sort_u64()
136 std::sort(a,a+count); in hs_cpu_sort_u64()
[all …]
|