| /external/clang/unittests/Format/ |
| D | SortIncludesTest.cpp | 27 std::string sort(StringRef Code, StringRef FileName = "input.cpp") { in sort() function in clang::format::__anonf039d0ac0111::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/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 | 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()
724 uint32_t i = sort->index; in __cil_post_db_array_helper()
[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/tensorflow/tensorflow/contrib/framework/python/ops/ |
| D | sort_ops_test.py | 51 np.sort(arr, axis=sort_axis),
52 sort_ops.sort(constant_op.constant(arr), axis=sort_axis).eval())
63 np.sort(arr, axis=sort_axis),
64 sort_ops.sort(constant_op.constant(arr), axis=sort_axis).eval())
73 sort = sort_ops.sort(scalar)
76 sort.eval()
81 sort_ops.sort(arr, axis=-4)
87 np.sort(arr, axis=0)[::-1],
88 sort_ops.sort(
|
| /external/toybox/toys/posix/ |
| D | ls.c | 298 struct dirtree *dt, **sort; in listfiles() local
336 for (sort = 0;;sort = xmalloc(dtlen*sizeof(void *))) { in listfiles()
338 if (sort) sort[dtlen] = dt; in listfiles()
339 if (sort || !dtlen) break; in listfiles()
356 qsort(sort, dtlen, sizeof(void *), (void *)compare); in listfiles()
358 entrylen(sort[ul], len); in listfiles()
361 blocks += sort[ul]->st.st_blocks; in listfiles()
384 entrylen(sort[next_column(ul, dtlen, columns, &c)], len); in listfiles()
405 struct stat *st = &(sort[next]->st); in listfiles()
414 entrylen(sort[next], len); in listfiles()
[all …]
|
| /external/webrtc/webrtc/modules/remote_bitrate_estimator/test/ |
| D | plot_bars.sh | 35 figures=($(echo "$bars" | cut -f 2 | sort | uniq))
67 | cut -f 1 | sort | uniq | head -n 1 )
71 | cut -f 1 | sort | uniq | sed -n 2p)
120 sed 's/_/\t/g' | cut -f 1 | sort | uniq)
133 sort | uniq)
144 data_sets=$(echo "$bars" | grep "BAR.$figure" | cut -f 3 | sort | uniq)
163 data_sets=$(echo "$bars" | grep "BAR.$figure" | cut -f 3 | sort | uniq)
199 data_sets=$(echo "$log" | grep "BASELINE.$figure" | cut -f 3 | sort | uniq)
228 data_sets=$(echo "$bars" | grep "ERRORBAR.$figure" | cut -f 3 | sort | uniq)
259 | sort | uniq)
[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/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
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/cpython3/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/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/tensorflow/tensorflow/contrib/factorization/python/kernel_tests/ |
| D | masked_matmul_benchmark.py | 40 def _make_sparse_mask(self, mask_shape, nnz, sort=False): argument
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
90 mask = self._make_sparse_mask(mask_shape, nnz, 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/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/annotation-tools/asmx/src/org/objectweb/asm/ |
| D | Type.java | 165 private final int sort; field in Type
202 private Type(final int sort, final char[] buf, final int off, final int len) { in Type() argument
203 this.sort = sort; in Type()
345 off += args[size].len + (args[size].sort == OBJECT ? 2 : 0); in getArgumentTypes()
505 return sort; in getSort()
539 switch (sort) { in getClassName()
668 } else if (sort == OBJECT) { in getDescriptor()
855 if (sort != t.sort) { in equals()
858 if (sort >= ARRAY) { in equals()
878 int hc = 13 * sort; in hashCode()
[all …]
|
| /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/v8/ |
| D | genmakefiles.py | 57 sources.sort()
91 sources.sort()
117 arm_src.sort()
118 arm64_src.sort()
119 x86_src.sort()
120 x86_64_src.sort()
121 mips_src.sort()
122 mips64_src.sort()
241 sources.sort()
288 sources.sort()
|
| /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/autotest/client/deps/glbench/ |
| D | update_glbench_image_filelists.sh | 4 ls *.png | sort > ../../glbench/glbench_reference_images.txt
5 ls *.png | sort > index.html
12 ls */*.png 2>/dev/null | sort > ../../glbench/${images}.txt
13 ls */*.png 2>/dev/null | sort > index.html
|
| /external/python/cpython2/Tools/scripts/ |
| D | objgraph.py | 90 flist.sort()
94 elist.sort()
109 files.sort()
116 callers.sort()
135 elist.sort()
139 flist.sort()
149 names.sort()
|
| /external/python/cpython2/Lib/ |
| D | cProfile.py | 14 def run(statement, filename=None, sort=-1): argument
36 result = prof.print_stats(sort)
39 def runctx(statement, globals, locals, filename=None, sort=-1): argument
56 result = prof.print_stats(sort)
79 def print_stats(self, sort=-1): argument
81 pstats.Stats(self).strip_dirs().sort_stats(sort).print_stats()
192 runctx(code, globs, None, options.outfile, options.sort)
|
| /external/python/cpython3/Lib/ |
| D | cProfile.py | 15 def run(statement, filename=None, sort=-1): argument
16 return _pyprofile._Utils(Profile).run(statement, filename, sort)
18 def runctx(statement, globals, locals, filename=None, sort=-1): argument
20 filename, sort)
40 def print_stats(self, sort=-1): argument
42 pstats.Stats(self).strip_dirs().sort_stats(sort).print_stats()
153 runctx(code, globs, None, options.outfile, options.sort)
|
| /external/icu/icu4c/source/tools/genren/ |
| D | Makefile | 85 sorts: urename.sort urename.old.sort
89 urename.sort: urename.h
90 sort urename.h > $@
92 urename.old.sort: $(top_srcdir)/common/unicode/urename.h
93 sort $(top_srcdir)/common/unicode/urename.h > $@
|