| /third_party/node/deps/v8/tools/ |
| H A D | profile_view.js | 118 * Sorts the profile view using the specified sort function.
122 * functions. Must comply with Array.sort sorting function requirements.
124 ProfileView.prototype.sort = function(sortFunc) {
196 * functions. Must comply with Array.sort sorting function requirements.
200 this.children.sort(sortFunc);
|
| /third_party/python/Tools/scripts/ |
| H A D | analyze_dxp.py | 92 result.sort(key=operator.itemgetter(2), reverse=True)
112 result.sort(key=operator.itemgetter(2), reverse=True)
|
| /third_party/skia/third_party/externals/angle2/src/tests/egl_tests/ |
| H A D | EGLAndroidFrameBufferTargetTest.cpp | 65 // sort configs by increaing ID in TEST_P()
66 std::sort(filterConfigs.begin(), filterConfigs.end(), [this](EGLConfig a, EGLConfig b) -> bool { in TEST_P()
82 // sort configs by increasing ID in TEST_P()
83 std::sort(matchConfigs.begin(), matchConfigs.end(), [this](EGLConfig a, EGLConfig b) -> bool { in TEST_P()
|
| /third_party/skia/tools/skqp/ |
| H A D | gn_to_bp.py | 178 def bpfmt(indent, lst, sort=True):
179 if sort:
|
| /foundation/multimedia/av_codec/test/unittest/codeclist_test/inner/ |
| H A D | codeclist_inner_mock.cpp | 95 std::sort(ret.begin(), ret.end()); in GetAudioSupportedSampleRates()
217 std::sort(ret.begin(), ret.end()); in GetVideoSupportedPixelFormats()
237 std::sort(ret.begin(), ret.end()); in GetSupportedProfiles()
253 std::sort(levelsmatch->second.begin(), levelsmatch->second.end()); in GetSupportedLevelsForProfile()
|
| /third_party/musl/tools/api_cmp_tool/ |
| H A D | compare.py | 118 LIB_FILE_NAME_LIST.sort()
195 HEAD_FILE_NAME_LIST.sort()
288 only_lib_have.sort()
289 only_head_have.sort()
|
| /third_party/node/deps/npm/node_modules/ini/lib/ |
| H A D | ini.js | 9 opt.sort = opt.sort === true
21 const keys = opt.sort ? Object.keys(obj).sort() : Object.keys(obj)
|
| /third_party/python/Lib/ |
| H A D | heapq.py | 29 without surprises: heap[0] is the smallest item, and heap.sort()
74 By iterating over all items, you get an O(n ln n) sort.
76 A nice feature of this sort is that you can efficiently insert new
77 items while the sort is going on, provided that the inserted items are
93 know that a big sort implies producing "runs" (which are pre-sorted
97 sort produces the longest runs possible. Tournaments are a good way
255 # The total compares needed by list.sort() on the same lists were 8627,
257 # heappop() compares): list.sort() is (unsurprisingly!) more efficient
327 its sort order.
421 # 4 k * lg2(k) - (k/2) final sort o
[all...] |
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/ |
| H A D | Parallel.h | 97 // Do a sequential sort for small inputs. in parallel_quick_sort()
99 llvm::sort(Start, End, Comp); in parallel_quick_sort()
175 void sort(Policy policy, RandomAccessIterator Start, RandomAccessIterator End, in sort() function
179 llvm::sort(Start, End, Comp); in sort()
202 void sort(parallel_execution_policy policy, RandomAccessIterator Start, in sort() function
|
| /third_party/node/deps/openssl/openssl/util/ |
| H A D | find-doc-nits | 184 my $tags_as_key = join(':', sort keys %tags);
251 ( sort { basename($a) cmp basename($b) }
258 ( sort { basename($a) cmp basename($b) }
317 sort keys %foundfilenames)
482 )/x; # (the x allows this sort of split up regexp)
894 foreach ( grep { $_ =~ /\(3\)$/ } sort keys %names ) {
954 foreach my $func ( grep { $state{$_} eq $type } sort keys %state ) {
1032 foreach my $filename ( sort keys %link_map ) {
1120 my @undocced = sort grep { !defined $docopts{$_} } @cmdopts;
1126 my @unimpl = sort gre
[all...] |
| /third_party/openssl/util/ |
| H A D | find-doc-nits | 184 my $tags_as_key = join(':', sort keys %tags);
251 ( sort { basename($a) cmp basename($b) }
258 ( sort { basename($a) cmp basename($b) }
317 sort keys %foundfilenames)
482 )/x; # (the x allows this sort of split up regexp)
894 foreach ( grep { $_ =~ /\(3\)$/ } sort keys %names ) {
954 foreach my $func ( grep { $state{$_} eq $type } sort keys %state ) {
1032 foreach my $filename ( sort keys %link_map ) {
1120 my @undocced = sort grep { !defined $docopts{$_} } @cmdopts;
1126 my @unimpl = sort gre
[all...] |
| /test/testfwk/arkxtest/uitest/core/ |
| H A D | rect_algorithm.cpp | 32 sort(px.begin(), px.end()); in ComputeIntersection()
33 sort(py.begin(), py.end()); in ComputeIntersection()
127 // sort grid points and use double-pointer traversing, to resuce time-complexity in FindMaxVisibleRegion()
128 sort(g_Points, g_Points + g_PCount, [](const Point& pa, const Point& pb) { in FindMaxVisibleRegion()
|
| /third_party/musl/scripts/ |
| H A D | search_source_files.py | 51 base_srcs.sort()
73 arch_srcs.sort()
145 all_header.sort()
|
| /third_party/skia/experimental/sorttoy/ |
| H A D | Fake.cpp | 135 this->sort(); in finalize()
149 void FakeDevice::sort() { in sort() function in FakeDevice
156 std::sort(fSortedCmds.begin(), fSortedCmds.end(), in sort()
|
| /third_party/vk-gl-cts/scripts/log/ |
| H A D | bottleneck_report.py | 68 self.list.sort(key = sortKey, reverse = True)
103 self.list.sort(key = sortKey, reverse = True)
117 self.list.sort(key = sortKeyTimePerTest, reverse = True)
|
| /third_party/node/tools/gyp/pylib/gyp/generator/ |
| H A D | analyzer.py | 555 values["targets"].sort()
560 values["invalid_targets"].sort()
565 values["build_targets"].sort()
570 values["compile_targets"].sort()
575 values["test_targets"].sort()
|
| /third_party/node/deps/npm/node_modules/node-gyp/gyp/pylib/gyp/generator/ |
| H A D | analyzer.py | 555 values["targets"].sort()
560 values["invalid_targets"].sort()
565 values["build_targets"].sort()
570 values["compile_targets"].sort()
575 values["test_targets"].sort()
|
| /third_party/python/Lib/test/ |
| H A D | list_tests.py | 437 u.sort()
441 u.sort()
444 self.assertRaises(TypeError, u.sort, 42, 42)
453 u.sort(key=cmp_to_key(revcmp))
466 z.sort(key=cmp_to_key(myComparison))
468 self.assertRaises(TypeError, z.sort, 2)
478 self.assertRaises(ValueError, z.sort,
481 self.assertRaises(TypeError, z.sort, 42, 42, 42, 42)
|
| /third_party/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/ |
| H A D | DecompTable.java | 74 // Straight insertion sort from Knuth vol. III, pg. 81
76 public static void sort(DecompEntry[] table, Vector decompVector) in sort() method in DecompTable.DecompEntry
141 DecompEntry.sort(decompEntries, decompVector); in snapshot()
|
| /third_party/ltp/testcases/kernel/controllers/cpuset/ |
| H A D | cpuset_regression_test.sh | 43 sort -n | cut -d " " -f 2-
54 sort -nr | cut -d " " -f 2-
|
| /third_party/node/test/parallel/ |
| H A D | test-event-emitter-remove-all-listeners.js | 31 assert.deepStrictEqual(actual.sort(), expected.sort());
|
| /third_party/node/deps/v8/tools/heap-stats/ |
| H A D | model.js | 53 [...data_set.non_empty_instance_types].sort((a, b) => {
91 entries.sort((a, b) => {return b[1] - a[1]});
|
| /third_party/node/deps/npm/node_modules/negotiator/lib/ |
| H A D | encoding.js | 145 .sort(compareSpecs)
154 return priorities.filter(isQuality).sort(compareSpecs).map(function getEncoding(priority) {
|
| H A D | language.js | 140 .sort(compareSpecs)
149 return priorities.filter(isQuality).sort(compareSpecs).map(function getLanguage(priority) {
|
| H A D | charset.js | 130 .sort(compareSpecs)
139 return priorities.filter(isQuality).sort(compareSpecs).map(function getCharset(priority) {
|