| /third_party/boost/libs/sort/doc/html/ |
| D | standalone_HTML.manifest | 2 sort/single_thread.html
3 sort/single_thread/spreadsort.html
4 sort/single_thread/spreadsort/sort_hpp.html
5 sort/single_thread/spreadsort/sort_hpp/integer_sort.html
6 sort/single_thread/spreadsort/sort_hpp/float_sort.html
7 sort/single_thread/spreadsort/sort_hpp/string_sort.html
8 sort/single_thread/spreadsort/sort_hpp/rationale.html
9 sort/single_thread/spreadsort/sort_hpp/rationale/hybrid_radix.html
10 sort/single_thread/spreadsort/sort_hpp/rationale/why_spreadsort.html
11 sort/single_thread/spreadsort/sort_hpp/rationale/unstable_sort.html
[all …]
|
| /third_party/jerryscript/tests/jerry/ |
| D | array-prototype-sort.js | 16 array.sort();
29 array.sort();
45 array.sort(f);
54 array.sort();
66 arr.sort(obj);
73 var obj = { sort : Array.prototype.sort} property
77 obj.sort();
85 var obj = { sort : Array.prototype.sort, length : 1} property
89 obj.sort();
97 var obj = { sort : Array.prototype.sort, length : 2}; property
[all …]
|
| /third_party/boost/libs/sort/test/ |
| D | test.log | 9 compile-c-c++ ..\..\..\bin.v2\libs\sort\test\integer_sort.test\msvc-12.0\debug\threading-multi\inte…
11 msvc.link ..\..\..\bin.v2\libs\sort\test\integer_sort.test\msvc-12.0\debug\threading-multi\integer_…
12 msvc.manifest ..\..\..\bin.v2\libs\sort\test\integer_sort.test\msvc-12.0\debug\threading-multi\inte…
13 testing.capture-output ..\..\..\bin.v2\libs\sort\test\integer_sort.test\msvc-12.0\debug\threading-m…
15 **passed** ..\..\..\bin.v2\libs\sort\test\integer_sort.test\msvc-12.0\debug\threading-multi\integer…
16 compile-c-c++ ..\..\..\bin.v2\libs\sort\test\float_sort.test\msvc-12.0\debug\threading-multi\float_…
18 msvc.link ..\..\..\bin.v2\libs\sort\test\float_sort.test\msvc-12.0\debug\threading-multi\float_sort…
19 msvc.manifest ..\..\..\bin.v2\libs\sort\test\float_sort.test\msvc-12.0\debug\threading-multi\float_…
20 testing.capture-output ..\..\..\bin.v2\libs\sort\test\float_sort.test\msvc-12.0\debug\threading-mul…
22 **passed** ..\..\..\bin.v2\libs\sort\test\float_sort.test\msvc-12.0\debug\threading-multi\float_sor…
[all …]
|
| D | string_sort_test.cpp | 21 using namespace boost::sort::spreadsort;
22 using boost::sort::spreadsort::detail::offset_less_than;
23 using boost::sort::spreadsort::detail::offset_greater_than;
24 using boost::sort::spreadsort::detail::update_offset;
111 std::sort(sorted_vec.begin(), sorted_vec.end()); in string_test()
117 boost::sort::spreadsort::spreadsort(test_vec.begin(), test_vec.end()); in string_test()
129 std::sort(sorted_vec.begin(), sorted_vec.end(), greater<string>()); in string_test()
142 boost::sort::spreadsort::spreadsort(test_vec.begin(), test_vec.end()); in corner_test()
144 boost::sort::spreadsort::spreadsort(test_vec.begin(), test_vec.end()); in corner_test()
147 boost::sort::spreadsort::spreadsort(test_vec.begin(), test_vec.end()); in corner_test()
|
| /third_party/jerryscript/tests/jerry/es2015/ |
| D | typedArray-sort.js | 18 assert(a.sort().toString() === '1,2,3,4,4,5');
23 assert(b.subarray(2, 4).sort().toString() === '3,4');
28 assert(c.sort().toString() === '');
32 assert(d.sort().toString() === '-Infinity,1,2,3,Infinity');
36 assert(e.sort().toString() === '-1,0,0,1');
40 assert(f.sort().toString() === '-Infinity,-1,0,1,Infinity,NaN,NaN');
49 assert(h.subarray(0, 2).sort().toString() === '0,255');
50 assert(h.subarray(2, 4).sort().toString() === '0,255');
52 assert(g.sort().toString() === '4278255360');
58 i.sort({});
[all …]
|
| /third_party/python/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 …]
|
| /third_party/typescript_eslint/packages/eslint-plugin/docs/rules/ |
| D | require-array-sort-compare.md | 1 # Requires `Array#sort` calls to always provide a `compareFunction` (`require-array-sort-compare`)
3 This rule prevents invoking the `Array#sort()` method without providing a `compare` argument.
5 When called without a compare function, `Array#sort()` converts all non-undefined array elements in…
11 [1, 2, 3, 10, 20, 30].sort(); //→ [1, 10, 2, 20, 3, 30]
14 This also means that `Array#sort` does not always sort consistently, as elements may have custom `#…
20 …re all calls of the native `Array#sort` method provide a `compareFunction`, while ignoring calls t…
28 array.sort();
31 stringArray.sort();
38 const userDefinedType: { sort(): void };
40 array.sort((a, b) => a - b);
[all …]
|
| /third_party/boost/boost/range/algorithm/ |
| D | sort.hpp | 30 inline RandomAccessRange& sort(RandomAccessRange& rng) in sort() function
33 std::sort(boost::begin(rng), boost::end(rng)); in sort()
39 inline const RandomAccessRange& sort(const RandomAccessRange& rng) in sort() function
42 std::sort(boost::begin(rng), boost::end(rng)); in sort()
48 inline RandomAccessRange& sort(RandomAccessRange& rng, BinaryPredicate pred) in sort() function
51 std::sort(boost::begin(rng), boost::end(rng), pred); in sort()
57 inline const RandomAccessRange& sort(const RandomAccessRange& rng, BinaryPredicate pred) in sort() function
60 std::sort(boost::begin(rng), boost::end(rng), pred); in sort()
65 using range::sort;
|
| /third_party/boost/libs/sort/doc/ |
| D | linux_parallel.qbk | 38 OMP parallel sort | 1.1990 | 1564 MB |
42 OMP parallel stable sort | 1.5814 | 1972 MB |
43 TBB parallel stable sort | 1.1745 | 1570 MB |
44 sample sort | 1.2872 | 1566 MB |
45 parallel stable sort | 1.7158 | 1176 MB |
58 OMP parallel sort | 1.5738 | 2023 MB |
62 OMP parallel stable sort | 2.3214 | 2024 MB |
63 TBB parallel stable sort | 1.4383 | 1143 MB |
64 sample sort | 1.5097 | 1135 MB |
65 parallel stable sort | 2.0970 | 978 MB |
[all …]
|
| D | flat_stable_sort.qbk | 16 [*Flat_stable_sort] is a new stable sort algorithm, designed and implemented by Francisco Jose Tapi…
18 The goal of the algorithm is to stably sort with little additional memory (about 1% of the memory u…
20 …efault stable sort algorithms provided by most compilers and libraries use substantial additional …
22 This new algorithm provides around 80%-90% of the speed of the spinsort and the stable sort algorit…
42 Memory used by the stable sort algorithms measured on Linux x64
99 You only need to include the file boost/sort/sort.hpp.
101 The flat_stable_sort function is in the namespace boost::sort.
106 #include <boost/sort/sort.hpp>
113 This algorithm uses a [*comparison object], in the same way as the standard library sort
118 guarantee the integrity of the objects to sort, but not their relative order. If the exception
|
| /third_party/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 …]
|
| /third_party/boost/libs/hana/test/_include/auto/ |
| D | sort.hpp | 29 hana::sort(MAKE_TUPLE()), in __anon31d6dae00102()
33 hana::sort(MAKE_TUPLE(ct_ord<0>{})), in __anon31d6dae00102()
37 hana::sort(MAKE_TUPLE(ct_ord<0>{}, ct_ord<1>{})), in __anon31d6dae00102()
41 hana::sort(MAKE_TUPLE(ct_ord<1>{}, ct_ord<0>{})), in __anon31d6dae00102()
45 hana::sort(MAKE_TUPLE(ct_ord<1>{}, ct_ord<0>{}, ct_ord<4>{}, ct_ord<2>{})), in __anon31d6dae00102()
49 hana::sort(MAKE_TUPLE(ct_ord<1>{}, ct_ord<0>{}, ct_ord<-4>{}, ct_ord<2>{})), in __anon31d6dae00102()
65 hana::sort.by(pred) in __anon31d6dae00102()
79 hana::sort(MAKE_TUPLE(a(ct_ord<1>{}), b(ct_ord<1>{})), pred), in __anon31d6dae00102()
83 hana::sort(MAKE_TUPLE(b(ct_ord<1>{}), a(ct_ord<1>{})), pred), in __anon31d6dae00102()
88 … hana::sort(MAKE_TUPLE(a(ct_ord<1>{}), b(ct_ord<1>{}), a(ct_ord<2>{}), b(ct_ord<2>{})), pred), in __anon31d6dae00102()
[all …]
|
| /third_party/boost/libs/range/doc/reference/algorithm/ |
| D | sort.qbk | 6 [section:sort sort]
12 RandomAccessRange& sort(RandomAccessRange& rng);
15 const RandomAccessRange& sort(const RandomAccessRange& rng);
18 RandomAccessRange& sort(RandomAccessRange& rng, BinaryPredicate pred);
21 const RandomAccessRange& sort(const RandomAccessRange& rng, BinaryPredicate pred);
26 `sort` sorts the elements in `rng` into ascending order. `sort` is not guaranteed to be stable. Ret…
28 For versions of the `sort` function without a predicate, ascending order is defined by `operator<()…
30 For versions of the `sort` function with a predicate, ascending order is defined by `pred` such tha…
34 Defined in the header file `boost/range/algorithm/sort.hpp`
38 [*For versions of sort without a predicate:]
[all …]
|
| /third_party/node/deps/npm/node_modules/qs/lib/ |
| D | stringify.js | 40 sort, argument
78 objKeys = sort ? keys.sort(sort) : keys;
97 sort,
112 sort,
137 var sort = typeof options.sort === 'function' ? options.sort : null;
179 if (sort) {
180 objKeys.sort(sort);
198 sort,
|
| /third_party/mindspore/tests/st/ops/gpu/ |
| D | test_topk_op.py | 33 np_output = np.sort(x_np, axis=-1)[..., ::-1][..., 0:k]
39 np_output = np.sort(x_np, axis=-1)[..., ::-1][..., 0:k]
51 np_output = np.sort(x_np, axis=-1)[..., ::-1][..., 0:k]
57 np_output = np.sort(x_np, axis=-1)[..., ::-1][..., 0:k]
69 np_output = np.sort(x_np, axis=-1)[..., ::-1][..., 0:k]
76 np_output = np.sort(x_np, axis=-1)[..., ::-1][..., 0:k]
82 np_output = np.sort(x_np, axis=-1)[..., ::-1][..., 0:k]
89 np_output = np.sort(x_np, axis=-1)[..., ::-1][..., 0:k]
101 np_output = np.sort(x_np, axis=-1)[..., ::-1][..., 0:k]
113 np_output = np.sort(x_np)[::-1][0:k]
[all …]
|
| /third_party/flutter/skia/third_party/externals/icu/scripts/ |
| D | update.sh | 65 find source/i18n -maxdepth 1 ! -type d | egrep '\.(c|cpp|h)$' |sort | \
67 ls source/i18n/unicode/*h | sort | sed 's/^\(.*\)$/ "\1",/' > i18n_hdr.list
69 find source/common -maxdepth 1 ! -type d | egrep '\.(c|cpp|h)$' |sort | \
71 ls source/common/unicode/*h | sort | \
94 ls source/i18n/unicode/*h | sort | \
96 ls source/common/unicode/*h | sort | \
101 sort | sed "s/^\(.*\)$/ '\1',/" > i18n_src.list
103 sort | sed "s/^\(.*\)$/ '\1',/" > common_src.list
|
| /third_party/skia/third_party/externals/icu/scripts/ |
| D | update.sh | 72 find source/i18n -maxdepth 1 ! -type d | egrep '\.(c|cpp|h)$' |sort | \
74 ls source/i18n/unicode/*h | sort | sed 's/^\(.*\)$/ "\1",/' > i18n_hdr.list
76 find source/common -maxdepth 1 ! -type d | egrep '\.(c|cpp|h)$' |sort | \
78 ls source/common/unicode/*h | sort | \
101 ls source/i18n/unicode/*h | sort | \
103 ls source/common/unicode/*h | sort | \
108 sort | sed "s/^\(.*\)$/ '\1',/" > i18n_src.list
110 sort | sed "s/^\(.*\)$/ '\1',/" > common_src.list
|
| /third_party/boost/boost/polygon/detail/ |
| D | polygon_sort_adaptor.hpp | 32 static void sort(RandomAccessIterator_Type _First, in sort() function
35 std::sort(_First, _Last); in sort()
40 static void sort(RandomAccessIterator_Type _First, in sort() function
44 std::sort(_First, _Last, _Comp); in sort()
52 … polygon_sort_adaptor<typename dummy_to_delay_instantiation<iter_type>::unit_type>::sort(_b_, _e_); in polygon_sort()
60 …polygon_sort_adaptor<typename dummy_to_delay_instantiation<iter_type>::unit_type>::sort(_b_, _e_, … in polygon_sort()
|
| /third_party/boost/libs/bimap/test/ |
| D | test_bimap_sequenced.cpp | 56 c.sort(); in test_list_operations()
86 b.sort(); in test_list_operations()
87 c.sort(); in test_list_operations()
144 c.sort(std::less<bm_type::value_type>()); in test_bimap()
145 b.sort(std::less<bm_type::value_type>()); in test_bimap()
152 c.left.sort(std::less<std::string>()); in test_bimap()
153 b.left.sort(std::less<std::string>()); in test_bimap()
160 c.right.sort(std::less<long>()); in test_bimap()
161 b.right.sort(std::less<long>()); in test_bimap()
200 c.sort(std::less<bm_type::value_type>()); in test_bimap()
[all …]
|
| /third_party/flutter/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()
|
| /third_party/skia/docs/examples/ |
| 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()
|
| 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()
|
| /third_party/toybox/porting/liteos_a/toys/posix/ |
| D | ls.c | 299 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()
406 struct stat *st = &(sort[next]->st); in listfiles()
417 entrylen(sort[next], len); in listfiles()
[all …]
|
| /third_party/toybox/toys/posix/ |
| D | ls.c | 307 struct dirtree *dt, **sort; in listfiles() local
345 for (sort = 0;;sort = xmalloc(dtlen*sizeof(void *))) { in listfiles()
347 if (sort) sort[dtlen] = dt; in listfiles()
348 if (sort || !dtlen) break; in listfiles()
365 qsort(sort, dtlen, sizeof(void *), (void *)compare); in listfiles()
367 entrylen(sort[ul], len); in listfiles()
370 blocks += sort[ul]->st.st_blocks; in listfiles()
393 entrylen(sort[next_column(ul, dtlen, columns, &c)], len); in listfiles()
415 struct stat *st = &(sort[next]->st); in listfiles()
427 entrylen(sort[next], len); in listfiles()
[all …]
|