| /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:
|
| /kernel/linux/linux-5.10/drivers/net/ethernet/mellanox/mlx4/ |
| H A D | qp.c | 798 int sort[MLX4_NUM_QP_REGION]; in mlx4_init_qp_table() local
803 sort[i] = i; in mlx4_init_qp_table()
807 if (dev->caps.reserved_qps_cnt[sort[j]] > in mlx4_init_qp_table()
808 dev->caps.reserved_qps_cnt[sort[j - 1]]) in mlx4_init_qp_table()
809 swap(sort[j], sort[j - 1]); in mlx4_init_qp_table()
814 last_base -= dev->caps.reserved_qps_cnt[sort[i]]; in mlx4_init_qp_table()
815 dev->caps.reserved_qps_base[sort[i]] = last_base; in mlx4_init_qp_table()
817 dev->caps.reserved_qps_cnt[sort[i]]; in mlx4_init_qp_table()
|
| /kernel/linux/linux-6.6/drivers/net/ethernet/mellanox/mlx4/ |
| H A D | qp.c | 802 int sort[MLX4_NUM_QP_REGION]; in mlx4_init_qp_table() local
807 sort[i] = i; in mlx4_init_qp_table()
811 if (dev->caps.reserved_qps_cnt[sort[j]] > in mlx4_init_qp_table()
812 dev->caps.reserved_qps_cnt[sort[j - 1]]) in mlx4_init_qp_table()
813 swap(sort[j], sort[j - 1]); in mlx4_init_qp_table()
818 last_base -= dev->caps.reserved_qps_cnt[sort[i]]; in mlx4_init_qp_table()
819 dev->caps.reserved_qps_base[sort[i]] = last_base; in mlx4_init_qp_table()
821 dev->caps.reserved_qps_cnt[sort[i]]; in mlx4_init_qp_table()
|
| /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...] |
| /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
|
| /kernel/linux/linux-5.10/tools/testing/selftests/kvm/ |
| H A D | Makefile | 122 x := $(shell mkdir -p $(sort $(dir $(LIBKVM_C_OBJ) $(LIBKVM_S_OBJ))))
133 x := $(shell mkdir -p $(sort $(dir $(TEST_GEN_PROGS))))
143 -exec realpath --relative-base=$(PWD) {} \;) | sort -u > cscope.files
|
| /kernel/linux/linux-5.10/scripts/dtc/ |
| H A D | dtc.c | 65 {"sort", no_argument, NULL, 's'},
167 bool force = false, sort = false; in main() local
239 sort = true; in main()
338 if (sort) in main()
|
| /kernel/linux/linux-5.10/drivers/power/supply/ |
| H A D | twl4030_madc_battery.c | 20 #include <linux/sort.h>
222 /* sort charging and discharging calibration data */ in twl4030_madc_battery_probe()
223 sort(pdata->charging, pdata->charging_size, in twl4030_madc_battery_probe()
226 sort(pdata->discharging, pdata->discharging_size, in twl4030_madc_battery_probe()
|
| /kernel/linux/linux-6.6/drivers/power/supply/ |
| H A D | twl4030_madc_battery.c | 20 #include <linux/sort.h>
216 /* sort charging and discharging calibration data */ in twl4030_madc_battery_probe()
217 sort(pdata->charging, pdata->charging_size, in twl4030_madc_battery_probe()
220 sort(pdata->discharging, pdata->discharging_size, in twl4030_madc_battery_probe()
|
| /kernel/linux/linux-6.6/lib/ |
| H A D | sort.c | 3 * A fast, small, non-recursive O(n log n) sort for the Linux kernel
17 #include <linux/sort.h>
192 * sort_r - sort an array of elements
193 * @base: pointer to data to sort
222 /* called from 'sort' without swap function, let's pick the default */ in sort_r()
281 void sort(void *base, size_t num, size_t size, in sort() function
292 EXPORT_SYMBOL(sort); variable
|
| /kernel/linux/linux-6.6/scripts/dtc/ |
| H A D | dtc.c | 65 {"sort", no_argument, NULL, 's'},
169 bool force = false, sort = false; in main() local
241 sort = true; in main()
340 if (sort) in main()
|
| /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)
|
| /kernel/linux/linux-5.10/tools/lib/bpf/ |
| H A D | Makefile | 10 sort -rV | head -n1 | cut -d'_' -f2)
147 sort -u | wc -l)
151 grep -Eo '[^ ]+@LIBBPF_' | cut -d@ -f1 | sort -u | wc -l)
216 sort -u > $(OUTPUT)libbpf_global_syms.tmp; \
221 sort -u > $(OUTPUT)libbpf_versioned_syms.tmp; \
|
| /kernel/linux/linux-6.6/tools/lib/bpf/ |
| H A D | Makefile | 10 sort -rV | head -n1 | cut -d'_' -f2)
131 sort -u | wc -l)
135 grep -Eo '[^ ]+@LIBBPF_' | cut -d@ -f1 | sort -u | wc -l)
194 sort -u > $(OUTPUT)libbpf_global_syms.tmp; \
199 sort -u > $(OUTPUT)libbpf_versioned_syms.tmp; \
|
| /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()
|