| /external/ComputeLibrary/src/core/CL/cl_kernels/ |
| D | non_linear_filter5x5.cl | 29 /** Sorting network to sort 8 disks of diameter 5 and return their median.
63 SORT(p0, p1);
64 SORT(p2, p3);
65 SORT(p4, p5);
66 SORT(p6, p7);
67 SORT(p8, p9);
68 SORT(p10, p11);
69 SORT(p12, p13);
70 SORT(p14, p15);
71 SORT(p16, p17);
[all …]
|
| D | non_linear_filter_helpers.h | 30 #define SORT(a, b) \ macro
40 /** Sorting network to sort 5 vectors of 8 elements and return their median.
52 SORT(p0, p1); in sort5()
53 SORT(p2, p3); in sort5()
54 SORT(p0, p2); in sort5()
55 SORT(p1, p3); in sort5()
56 SORT(p1, p2); in sort5()
57 SORT(p0, p4); in sort5()
58 SORT(p1, p4); in sort5()
59 SORT(p2, p4); in sort5()
[all …]
|
| /external/ComputeLibrary/src/core/NEON/kernels/ |
| D | NENonLinearFilterKernel.cpp | 75 inline void sort(uint8x8_t &a, uint8x8_t &b) in sort() function
87 sort(p0, p1); in sort5()
88 sort(p2, p3); in sort5()
89 sort(p0, p2); in sort5()
90 sort(p1, p3); in sort5()
91 sort(p1, p2); in sort5()
92 sort(p0, p4); in sort5()
93 sort(p1, p4); in sort5()
94 sort(p2, p4); in sort5()
101 sort(p1, p2); in sort9()
[all …]
|
| D | NEMedian3x3Kernel.cpp | 42 inline void sort(uint8x8_t &a, uint8x8_t &b) in sort() function
108 sort(p1, p2); in run()
109 sort(p4, p5); in run()
110 sort(p7, p8); in run()
112 sort(p0, p1); in run()
113 sort(p3, p4); in run()
114 sort(p6, p7); in run()
116 sort(p1, p2); in run()
117 sort(p4, p5); in run()
118 sort(p7, p8); in run()
[all …]
|
| /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/ComputeLibrary/build/android-arm64v8a/src/core/CL/cl_kernels/ |
| D | non_linear_filter_helpers.hembed | 32 #define SORT(a, b) \
42 /** Sorting network to sort 5 vectors of 8 elements and return their median.
54 SORT(p0, p1);
55 SORT(p2, p3);
56 SORT(p0, p2);
57 SORT(p1, p3);
58 SORT(p1, p2);
59 SORT(p0, p4);
60 SORT(p1, p4);
61 SORT(p2, p4);
[all …]
|
| D | non_linear_filter5x5.clembed | 1520 #define SORT(a, b) \
1530 /** Sorting network to sort 5 vectors of 8 elements and return their median.
1542 SORT(p0, p1);
1543 SORT(p2, p3);
1544 SORT(p0, p2);
1545 SORT(p1, p3);
1546 SORT(p1, p2);
1547 SORT(p0, p4);
1548 SORT(p1, p4);
1549 SORT(p2, p4);
[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_t 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 | topk_rewriter.cc | 108 HloSortInstruction* sort = DynCast<HloSortInstruction>(inst); in SortIsInTopK() local
109 if (sort == nullptr) { in SortIsInTopK()
112 if (sort->operand_count() != 1 && sort->operand_count() != 2) { in SortIsInTopK()
115 HloInstruction* data = sort->mutable_operand(0); in SortIsInTopK()
117 if (sort->operand_count() == 2) { in SortIsInTopK()
119 DynCast<HloIotaInstruction>(sort->mutable_operand(1)); in SortIsInTopK()
123 iota->iota_dimension() != sort->sort_dimension()) { in SortIsInTopK()
127 if (!IsNanSafeGt(sort->to_apply())) { in SortIsInTopK()
130 const int64_t sort_dim = sort->sort_dimension(); in SortIsInTopK()
136 for (HloInstruction* user : sort->users()) { in SortIsInTopK()
[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/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/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/tensorflow/tensorflow/python/ops/ |
| D | sort_ops.py | 33 @tf_export('sort')
35 def sort(values, axis=-1, direction='ASCENDING', name=None): function
41 >>> tf.sort(a).numpy()
44 >>> tf.sort(a, direction='DESCENDING').numpy()
47 For multidimensional inputs you can control which axis the sort is applied
53 >>> tf.sort(mat, axis=-1).numpy()
57 >>> tf.sort(mat, axis=0).numpy()
64 * `tf.argsort`: Like sort, but it returns the sort indices.
65 * `tf.math.top_k`: A partial sort that returns a fixed number of top values
71 axis: The axis along which to sort. The default is -1, which sorts the last
[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::__anon3fd4619b0111::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/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| D | Z3Solver.cpp | 65 /// Wrapper for Z3 Sort
71 Z3_sort Sort; member in __anon526ea7540111::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 …]
|
| /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
28 You can also use the :meth:`list.sort` method. It modifies the list
36 >>> a.sort()
40 Another difference is that the :meth:`list.sort` method is only defined for
51 Both :meth:`list.sort` and :func:`sorted` have a *key* parameter to specify a
67 A common pattern is to sort complex objects using some of the object's indices
77 >>> sorted(student_tuples, key=lambda student: student[2]) # sort by age
97 >>> sorted(student_objects, key=lambda student: student.age) # sort by age
121 sort by *grade* then by *age*:
[all …]
|
| /external/selinux/libsepol/cil/src/ |
| D | cil_post.c | 344 /* sort ipv4 before ipv6 */ in cil_post_nodecon_compare()
725 struct cil_sort *sort = db->netifcon; in __cil_post_db_array_helper() local
726 uint32_t count = sort->count; in __cil_post_db_array_helper()
727 uint32_t i = sort->index; in __cil_post_db_array_helper()
728 if (sort->array == NULL) { in __cil_post_db_array_helper()
729 sort->array = cil_malloc(sizeof(*sort->array)*count); in __cil_post_db_array_helper()
731 sort->array[i] = node->data; in __cil_post_db_array_helper()
732 sort->index++; in __cil_post_db_array_helper()
736 struct cil_sort *sort = db->ibendportcon; in __cil_post_db_array_helper() local
737 uint32_t count = sort->count; in __cil_post_db_array_helper()
[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/cldr/common/testData/localeIdentifiers/ |
| D | localeDisplayName.txt | 56 en-u-co-big5han; English (Traditional Chinese Sort Order - Big5)
57 en-u-co-compat; English (Previous Sort Order, for compatibility)
58 en-u-co-dict; English (Dictionary Sort Order)
59 en-u-co-ducet; English (Default Unicode Sort Order)
60 en-u-co-emoji; English (Emoji Sort Order)
62 en-u-co-gb2312; English (Simplified Chinese Sort Order - GB2312)
63 en-u-co-phonebk; English (Phonebook Sort Order)
64 en-u-co-phonetic; English (Phonetic Sort Order)
65 en-u-co-pinyin; English (Pinyin Sort Order)
66 en-u-co-reformed; English (Reformed Sort Order)
[all …]
|