Home
last modified time | relevance | path

Searched refs:sort (Results 1 - 25 of 1950) sorted by relevance

12345678910>>...78

/base/customization/enterprise_device_management/interfaces/inner_api/plugin_kits/src/utils/
H A Darray_string_serializer.cpp38 std::sort(data.begin(), data.end()); in SetUnionPolicyData()
39 std::sort(currentData.begin(), currentData.end()); in SetUnionPolicyData()
48 std::sort(data.begin(), data.end()); in SetDifferencePolicyData()
49 std::sort(currentData.begin(), currentData.end()); in SetDifferencePolicyData()
/test/testfwk/developer_test/src/core/command/
H A Ddisplay.py313 subsystem_name_list.sort()
325 sub_list.sort()
352 sub_list.sort()
367 subsystem_name_list.sort()
372 part_name_list.sort()
/kernel/linux/linux-5.10/drivers/net/wireless/ath/ath9k/
H A Dcalib.c27 int16_t sort[ATH9K_NF_CAL_HIST_MAX]; in ath9k_hw_get_nf_hist_mid() local
31 sort[i] = nfCalBuffer[i]; in ath9k_hw_get_nf_hist_mid()
35 if (sort[j] > sort[j - 1]) { in ath9k_hw_get_nf_hist_mid()
36 nfval = sort[j]; in ath9k_hw_get_nf_hist_mid()
37 sort[j] = sort[j - 1]; in ath9k_hw_get_nf_hist_mid()
38 sort[j - 1] = nfval; in ath9k_hw_get_nf_hist_mid()
42 nfval = sort[(ATH9K_NF_CAL_HIST_MAX - 1) >> 1]; in ath9k_hw_get_nf_hist_mid()
/kernel/linux/linux-6.6/drivers/net/wireless/ath/ath9k/
H A Dcalib.c27 int16_t sort[ATH9K_NF_CAL_HIST_MAX]; in ath9k_hw_get_nf_hist_mid() local
31 sort[i] = nfCalBuffer[i]; in ath9k_hw_get_nf_hist_mid()
35 if (sort[j] > sort[j - 1]) { in ath9k_hw_get_nf_hist_mid()
36 nfval = sort[j]; in ath9k_hw_get_nf_hist_mid()
37 sort[j] = sort[j - 1]; in ath9k_hw_get_nf_hist_mid()
38 sort[j - 1] = nfval; in ath9k_hw_get_nf_hist_mid()
42 nfval = sort[(ATH9K_NF_CAL_HIST_MAX - 1) >> 1]; in ath9k_hw_get_nf_hist_mid()
/kernel/linux/build/test/moduletest/runtest/bin/mem_debug_t/testcases/bin/
H A Dmem_debug08.sh33 local pid=$(cat /proc/ashmem_process_info | awk 'NR>3 && $2!="" {print $2}' | sort -u)
34 local line=$(cat /proc/ashmem_process_info | awk 'NR>3 && $2!="" {print $2}' | sort -u | wc -l)
/kernel/linux/linux-5.10/lib/
H A Dtest_sort.c2 #include <linux/sort.h>
28 sort(a, TEST_LEN, sizeof(*a), cmpint, NULL); in test_sort_init()
H A Dsort.c3 * A fast, small, non-recursive O(n log n) sort for the Linux kernel
17 #include <linux/sort.h>
181 * sort_r - sort an array of elements
182 * @base: pointer to data to sort
266 void sort(void *base, size_t num, size_t size, in sort() function
272 EXPORT_SYMBOL(sort); variable
H A Dextable.c11 #include <linux/sort.h>
67 sort(start, finish - start, sizeof(struct exception_table_entry), in sort_extable()
/kernel/linux/linux-6.6/lib/
H A Dtest_sort.c5 #include <linux/sort.h>
30 sort(a, TEST_LEN, sizeof(*a), cmpint, NULL); in test_sort()
/base/customization/enterprise_device_management/services/edm_plugin/src/utils/
H A Darray_usb_device_type_serializer.cpp34 std::sort(data.begin(), data.end()); in SetUnionPolicyData()
35 std::sort(currentData.begin(), currentData.end()); in SetUnionPolicyData()
44 std::sort(data.begin(), data.end()); in SetDifferencePolicyData()
45 std::sort(currentData.begin(), currentData.end()); in SetDifferencePolicyData()
H A Darray_usb_device_id_serializer.cpp29 std::sort(data.begin(), data.end(), Comp()); in SetUnionPolicyData()
30 std::sort(currentData.begin(), currentData.end(), Comp()); in SetUnionPolicyData()
39 std::sort(data.begin(), data.end(), Comp()); in SetDifferencePolicyData()
40 std::sort(currentData.begin(), currentData.end(), Comp()); in SetDifferencePolicyData()
/base/update/packaging_tools/
H A Dblocks_manager.py75 data.sort()
115 range_d.sort()
132 sort_list.sort()
147 new_data.sort()
/kernel/linux/linux-5.10/tools/testing/selftests/net/forwarding/
H A Dethtool_lib.sh67 <(printf '%s\n' "${dev1_speeds[@]}" | sort -u) \
68 <(printf '%s\n' "${dev2_speeds[@]}" | sort -u)
/kernel/linux/linux-6.6/tools/perf/trace/beauty/
H A Darch_errno_names.sh51 |sort -t, -k2 -nu \
79 for arch in $(find $toolsdir/arch -maxdepth 1 -mindepth 1 -type d -printf "%f\n" | sort -r); do
/kernel/linux/linux-5.10/arch/s390/kernel/syscalls/
H A Dsyscalltbl100 |sort -k1 -n \
145 |sort -k1 -n \
160 |sort -n \
/kernel/linux/linux-6.6/arch/s390/kernel/syscalls/
H A Dsyscalltbl100 |sort -k1 -n \
145 |sort -k1 -n \
160 |sort -n \
/kernel/linux/linux-5.10/kernel/
H A Drange.c8 #include <linux/sort.h>
155 /* sort them */ in clean_sort_range()
156 sort(range, nr_range, sizeof(struct range), cmp_range, NULL); in clean_sort_range()
163 /* sort them */ in sort_range()
164 sort(range, nr_range, sizeof(struct range), cmp_range, NULL); in sort_range()
/kernel/linux/linux-5.10/drivers/gpu/drm/i915/gt/
H A Dselftest_gt_pm.c8 #include <linux/sort.h>
60 sort(cycles, 5, sizeof(*cycles), cmp_u32, NULL); in measure_clocks()
63 sort(dt, 5, sizeof(*dt), cmp_u64, NULL); in measure_clocks()
/kernel/linux/linux-6.6/drivers/gpu/drm/i915/gt/
H A Dselftest_gt_pm.c6 #include <linux/sort.h>
72 sort(cycles, 5, sizeof(*cycles), cmp_u32, NULL); in measure_clocks()
75 sort(dt, 5, sizeof(*dt), cmp_u64, NULL); in measure_clocks()
/kernel/linux/linux-6.6/kernel/
H A Drange.c8 #include <linux/sort.h>
155 /* sort them */ in clean_sort_range()
156 sort(range, nr_range, sizeof(struct range), cmp_range, NULL); in clean_sort_range()
163 /* sort them */ in sort_range()
164 sort(range, nr_range, sizeof(struct range), cmp_range, NULL); in sort_range()
/kernel/linux/linux-6.6/rust/alloc/
H A Dslice.rs25 use core::slice::sort;
181 /// This sort is stable (i.e., does not reorder equal elements) and *O*(*n* \* log(*n*)) worst-case.
189 /// The current algorithm is an adaptive, iterative merge sort inspired by
195 /// non-allocating insertion sort is used instead.
202 /// v.sort();
209 pub fn sort(&mut self) in sort() functions
218 /// This sort is stable (i.e., does not reorder equal elements) and *O*(*n* \* log(*n*)) worst-case.
228 /// `partial_cmp` as our sort function when we know the slice doesn't contain a `NaN`.
242 /// The current algorithm is an adaptive, iterative merge sort inspired by
248 /// non-allocating insertion sort i
[all...]
/kernel/linux/linux-5.10/arch/sparc/prom/
H A Dmemory.c10 #include <linux/sort.h>
79 sort(sp_banks, num_ents, sizeof(struct sparc_phys_banks), in prom_meminit()
/kernel/linux/linux-6.6/arch/sparc/prom/
H A Dmemory.c10 #include <linux/sort.h>
79 sort(sp_banks, num_ents, sizeof(struct sparc_phys_banks), in prom_meminit()
/kernel/linux/linux-5.10/tools/perf/trace/beauty/
H A Darch_errno_names.sh63 |sort -t, -k2 -nu \
93 for arch in $(find $toolsdir/arch -maxdepth 1 -mindepth 1 -type d -printf "%f\n" | grep -v x86 | sort); do
/kernel/linux/linux-6.6/tools/perf/tests/shell/lib/
H A Dcoresight.sh104 uniq | sort | uniq)
110 uniq | sort | uniq)

Completed in 9 milliseconds

12345678910>>...78