| /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/clang/unittests/Format/ |
| D | SortIncludesTest.cpp | 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()
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/tensorflow/tensorflow/compiler/xla/service/ |
| D | stable_sort_expander.cc | 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()
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 …]
|
| D | sort_simplifier.cc | 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()
71 for (int64_t i = 0; i < sort->operand_count(); ++i) { in RemoveUnusedOperandFromSort()
73 operands.push_back(sort->mutable_operand(i)); in RemoveUnusedOperandFromSort()
[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 …]
|
| /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()
127 augmented.sort() # forced stable because ties broken by index
149 self.assertRaises(ValueError, L.sort)
160 self.assertRaises(ValueError, L.sort, key=cmp_to_key(mutating_cmp))
165 self.assertRaises(ValueError, L.sort, key=cmp_to_key(mutating_cmp))
176 data.sort(key=str.lower)
[all …]
|
| /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()
121 augmented.sort() # forced stable because ties broken by index
143 self.assertRaises(ValueError, L.sort)
150 L.sort(None)
162 self.assertRaises(ValueError, L.sort, mutating_cmp)
167 self.assertRaises(ValueError, L.sort, mutating_cmp)
178 data.sort(key=str.lower)
[all …]
|
| /external/selinux/libsepol/cil/src/ |
| D | cil_post.c | 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()
738 uint32_t i = sort->index; in __cil_post_db_array_helper()
[all …]
|
| /external/slf4j/slf4j-api/src/test/java/org/slf4j/helpers/ |
| D | BubbleSortTest.java | 42 BubbleSort.sort(a); in testSmoke()
52 BubbleSort.sort(a); in testEmpty()
57 BubbleSort.sort(a); in testSorted()
67 BubbleSort.sort(a); in testInverted()
77 BubbleSort.sort(a); in testWithSameEntry()
95 BubbleSort.sort(a); in testRandom()
96 Arrays.sort(witness); in testRandom()
|
| /external/python/setuptools/setuptools/tests/ |
| D | test_manifest.py | 422 file_list.sort()
439 file_list.sort()
457 file_list.sort()
482 file_list.sort()
487 file_list.sort()
498 file_list.sort()
503 file_list.sort()
514 file_list.sort()
519 file_list.sort()
530 file_list.sort()
[all …]
|
| /external/skia/docs/examples/ |
| D | IRect_makeSorted.cpp | 9 SkIRect sort = rect.makeSorted(); in draw() local
10 SkDebugf("sorted: %d, %d, %d, %d\n", sort.fLeft, sort.fTop, sort.fRight, sort.fBottom); in draw()
|
| D | Rect_makeSorted.cpp | 9 SkRect sort = rect.makeSorted(); in draw() local
10 SkDebugf("sorted: %g, %g, %g, %g\n", sort.fLeft, sort.fTop, sort.fRight, sort.fBottom); in draw()
|
| /external/toybox/scripts/ |
| D | bloatcheck | 56 echo "$STUFF" | sort -k4,4nr
64 nm --size-sort "$1" | sort -k3,3 > $DIFF1
65 nm --size-sort "$2" | sort -k3,3 > $DIFF2
67 | sort -k4,4 | do_bloatcheck
|
| /external/compiler-rt/make/ |
| D | lib_info.mk | 18 AvailableModules := $(sort $(foreach key,$(SubDirKeys),\
25 AvailableArchs := $(sort $(foreach key,$(SubDirKeys),\
28 AvailableFunctions := $(sort $(foreach key,$(SubDirKeys),\
31 CommonFunctions := $(sort\
40 $(call Append,ArchFunctions.$(arch),$(sort \
45 $(call Set,ArchFunctions.$(arch),$(sort $(ArchFunctions.$(arch))))\
|
| /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/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/ |
| D | sort.pass.cpp | 39 std::sort(save, save+len); in test_sort_helper()
95 std::sort(array, array+N); in test_larger_sorts()
99 std::sort(array, array+N); in test_larger_sorts()
102 std::sort(array, array+N); in test_larger_sorts()
106 std::sort(array, array+N); in test_larger_sorts()
110 std::sort(array, array+N); in test_larger_sorts()
115 std::sort(array, array+N); in test_larger_sorts()
138 std::sort(&d, &d); in main()
|
| /external/bcc/scripts/ |
| D | check-helpers.sh | 4 libbpf=$(grep -oP '(?<={")\w+(?=", "\d\.\d+")' src/cc/libbpf.c | sort)
5 doc=$(grep -oP "(?<=BPF_FUNC_)\w+" docs/kernel-versions.md | sort)
13 compat=$(grep -oP "(?<=^\sFN\()\w+" src/cc/compat/linux/bpf.h | tail -n +2 | sort)
21 virtual=$(grep -oP "(?<=^\sFN\()\w+" src/cc/compat/linux/virtual_bpf.h | tail -n +2 | sort -u)
29 export=$(grep -oP "(?<=BPF_FUNC_)\w+" src/cc/export/helpers.h | sort -u)
|
| /external/rust/crates/serde_cbor/tests/ |
| D | canonical.rs | 30 sorted.sort(); in integer_canonical_sort_order()
43 sorted.sort(); in string_canonical_sort_order()
56 sorted.sort(); in bytes_canonical_sort_order()
66 sorted.sort(); in simple_data_canonical_sort_order()
82 sorted.sort(); in major_type_canonical_sort_order()
101 sorted.sort(); in test_rfc_example()
|
| /external/python/cpython3/Tools/c-analyzer/cpython/ |
| D | _capi.py | 414 def _get_sortkey(sort, _groupby, _columns): argument
415 if sort is True or sort is None:
429 elif isinstance(sort, str):
430 sortfields = sort.replace(',', ' ').strip().split()
431 elif callable(sort):
432 return sort
485 sort=True, argument
544 if sort:
545 sortkey = _get_sortkey(sort, groupby, columns)
557 if sort:
[all …]
|
| /external/mesa3d/src/amd/registers/ |
| D | makeregheader.py | 175 lines.sort(key=lambda line: (line.address, line.name))
188 lines.sort(key=lambda line: (line.address, line.name))
231 lines.sort(key=lambda line: (line.address, line.name))
259 def print(self, filp, sort='address'): argument
263 if sort == 'address':
264 self.register_lines.sort(key=lambda line: (line.address, line.name))
266 assert sort == 'name'
267 self.register_lines.sort(key=lambda line: (line.name, line.address))
274 if sort == 'address':
275 field_lines.sort(key=lambda line: (line.bits[0], line.name))
[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/one-true-awk/bugs-fixed/ |
| D | space.awk | 11 sort = "LC_ALL=C sort"
15 i ~ /[[:space:]]/ ? "~" : "!~") | sort
19 i ~ /[[:blank:]]/ ? "~" : "!~") | sort
21 close(sort)
|
| /external/protobuf/python/compatibility_tests/v2.5.0/tests/google/protobuf/internal/ |
| D | message_test.py | 319 message.repeated_int32.sort()
327 message.repeated_float.sort()
335 message.repeated_string.sort()
343 message.repeated_bytes.sort()
355 message.repeated_int32.sort(lambda x,y: cmp(abs(x), abs(y)))
363 message.repeated_string.sort(lambda x,y: cmp(len(x), len(y)))
378 message.repeated_nested_message.sort(lambda x,y: cmp(x.bb, y.bb))
398 message.repeated_nested_message.sort(key=get_bb)
401 message.repeated_nested_message.sort(key=get_bb, reverse=True)
404 message.repeated_nested_message.sort(sort_function=cmp_bb)
[all …]
|
| /external/toybox/toys/posix/ |
| D | ls.c | 262 struct dirtree *dt, **sort; in listfiles() local
299 for (sort = 0;;sort = xmalloc(dtlen*sizeof(void *))) { in listfiles()
301 if (sort) sort[dtlen] = dt; in listfiles()
302 if (sort || !dtlen) break; in listfiles()
318 qsort(sort, dtlen, sizeof(void *), (void *)compare); in listfiles()
320 entrylen(sort[ul], len); in listfiles()
323 blocks += sort[ul]->st.st_blocks; in listfiles()
349 entrylen(sort[cc], len); in listfiles()
368 struct stat *st = &((dt = sort[next_column(ul,dtlen,columns,&curcol)])->st); in listfiles()
489 for (ul = 0; ul<dtlen; free(sort[ul++])) { in listfiles()
[all …]
|