Home
last modified time | relevance | path

Searched refs:sort (Results 1126 - 1150 of 3069) sorted by relevance

1...<<41424344454647484950>>...123

/third_party/protobuf/src/google/protobuf/compiler/cpp/
H A Dcpp_file.cc89 std::sort(sorted.begin(), sorted.end(), CompareSortKeys<T>); in Sorted()
147 std::sort(sccs_.begin(), sccs_.end(), CompareSortKeys<SCC>); in FileGenerator()
/third_party/protobuf/src/google/protobuf/util/
H A Dfield_mask_util_test.cc97 std::sort(name.begin(), name.end()); in TEST_F()
108 std::sort(name.begin(), name.end()); in TEST_F()
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/str_format/
H A Dconvert_test.cc672 std::sort(floats.begin(), floats.end()); in TEST_F()
746 std::sort(doubles.begin(), doubles.end()); in TEST_F()
/third_party/spirv-tools/source/opt/
H A Dir_context.cpp1080 std::sort(preds.begin(), preds.end()); in CheckCFG()
1081 std::sort(real.begin(), real.end()); in CheckCFG()
/third_party/skia/third_party/externals/angle2/src/libANGLE/
H A DVaryingPacking.cpp934 std::sort(mPackedVaryings.begin(), mPackedVaryings.end(), ComparePackedVarying); in collectAndPackUserVaryings()
971 std::sort(mRegisterList.begin(), mRegisterList.end()); in packUserVaryings()
/kernel/linux/linux-5.10/drivers/crypto/marvell/octeontx/
H A Dotx_cptvf_algs.c20 #include <linux/sort.h>
1681 sort(se_devices.desc, count, sizeof(struct cpt_device_desc), in otx_cpt_crypto_init()
1696 sort(ae_devices.desc, count, sizeof(struct cpt_device_desc), in otx_cpt_crypto_init()
/kernel/linux/linux-5.10/tools/perf/util/
H A Dcallchain.c6 * sort them in an rbtree.
28 #include "sort.h"
346 if (!strcmp(var, "sort-key")){ in perf_callchain_config()
350 pr_err("Invalid callchain sort key: %s\n", value); in perf_callchain_config()
433 * sort them by hit
505 param->sort = sort_chain_graph_abs; in callchain_register_param()
508 param->sort = sort_chain_graph_rel; in callchain_register_param()
512 param->sort = sort_chain_flat; in callchain_register_param()
692 * binary but with some sort of address randomization technique, thus we need
/kernel/linux/linux-5.10/fs/gfs2/
H A Dquota.c44 #include <linux/sort.h>
918 sort(qda, num_qd, sizeof(struct gfs2_quota_data *), sort_qd, NULL); in do_sync()
1080 sort(ip->i_qadata->qa_qd, ip->i_qadata->qa_qd_num, in gfs2_quota_lock()
/kernel/linux/linux-6.6/fs/gfs2/
H A Dquota.c44 #include <linux/sort.h>
929 sort(qda, num_qd, sizeof(struct gfs2_quota_data *), sort_qd, NULL); in do_sync()
1094 sort(ip->i_qadata->qa_qd, ip->i_qadata->qa_qd_num, in gfs2_quota_lock()
/kernel/linux/linux-6.6/drivers/crypto/marvell/octeontx/
H A Dotx_cptvf_algs.c21 #include <linux/sort.h>
1680 sort(se_devices.desc, count, sizeof(struct cpt_device_desc), in otx_cpt_crypto_init()
1695 sort(ae_devices.desc, count, sizeof(struct cpt_device_desc), in otx_cpt_crypto_init()
/kernel/linux/linux-6.6/tools/perf/
H A Dbuiltin-kwork.c189 "Unknown --sort key: `%s'", tok); in setup_sorting()
253 struct sort_dimension *sort; in work_cmp() local
257 list_for_each_entry(sort, list, list) { in work_cmp()
258 ret = sort->cmp(l, r); in work_cmp()
1738 OPT_STRING('s', "sort", &kwork.sort_order, "key[,key2...]", in cmd_kwork()
1739 "sort by key(s): runtime, max, count"), in cmd_kwork()
1757 OPT_STRING('s', "sort", &kwork.sort_order, "key[,key2...]", in cmd_kwork()
1758 "sort by key(s): avg, max, count"), in cmd_kwork()
/kernel/linux/linux-6.6/tools/perf/util/
H A Dcallchain.c6 * sort them in an rbtree.
28 #include "sort.h"
353 if (!strcmp(var, "sort-key")){ in perf_callchain_config()
357 pr_err("Invalid callchain sort key: %s\n", value); in perf_callchain_config()
440 * sort them by hit
512 param->sort = sort_chain_graph_abs; in callchain_register_param()
515 param->sort = sort_chain_graph_rel; in callchain_register_param()
519 param->sort = sort_chain_flat; in callchain_register_param()
701 * binary but with some sort of address randomization technique, thus we need
/third_party/icu/icu4c/source/common/
H A Dlocid.cpp1538 // We need to sort the tfields by tkey
1559 tfields.sort([](UElement e1, UElement e2) -> int32_t {
1602 variants.sort([](UElement e1, UElement e2) -> int32_t {
1663 variants.sort([](UElement e1, UElement e2) -> int32_t {
/third_party/node/tools/
H A Dtest.py898 result.sort(key=lambda x: x.GetName())
1758 cases_to_run.sort(key=lambda c: (c.arch, c.mode, c.file))
1782 timed_tests.sort(key=lambda x: x.duration)
/third_party/node/deps/icu-small/source/common/
H A Dlocid.cpp1545 // We need to sort the tfields by tkey
1566 tfields.sort([](UElement e1, UElement e2) -> int32_t {
1609 variants.sort([](UElement e1, UElement e2) -> int32_t {
1676 variants.sort([](UElement e1, UElement e2) -> int32_t {
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
H A DMemoryDependenceAnalysis.cpp813 llvm::sort(Cache); in getNonLocalCallDependency()
1074 // Added many values, do a full scale sort. in SortNonLocalDepInfoCache()
1075 llvm::sort(Cache); in SortNonLocalDepInfoCache()
1225 // entries will all be sorted. The entries we add we only sort on demand (we in getNonLocalPointerDepFromBB()
1475 // Okay, we're done now. If we added new values to the cache, re-sort it. in getNonLocalPointerDepFromBB()
1680 // Re-sort the NonLocalDepInfo. Changing the dirty entry to its in removeInstruction()
1682 llvm::sort(NLPDI); in removeInstruction()
/third_party/skia/third_party/externals/icu/source/common/
H A Dlocid.cpp1565 // We need to sort the tfields by tkey
1585 tfields.sort([](UElement e1, UElement e2) -> int8_t {
1630 variants.sort([](UElement e1, UElement e2) -> int8_t {
1696 variants.sort([](UElement e1, UElement e2) -> int8_t {
/third_party/protobuf/ruby/compatibility_tests/v3.0.0/tests/
H A Dbasic.rb662 assert m.values.map{|msg| msg.optional_int32}.sort == [42, 84]
708 assert m.map_string_int32.keys.sort == ["a", "b"]
789 field_names = o.map{|f| f.name}.sort
/third_party/vk-gl-cts/modules/gles31/functional/
H A Des31fSynchronizationTests.cpp69 std::sort(chainDelta.begin(), chainDelta.end()); in validateSortedAtomicRampAdditionValueChain()
2327 std::sort(valueChain.begin(), valueChain.end());
2548 std::sort(intermediateResults.begin(), intermediateResults.end());
2831 std::sort(valueChain.begin(), valueChain.end());
2837 std::sort(chainDelta.begin(), chainDelta.end());
/kernel/linux/linux-5.10/tools/lib/traceevent/
H A Devent-parse.c6293 int (*sort)(const void *a, const void *b); in list_events_sort()
6297 sort = events_id_cmp; in list_events_sort()
6300 sort = events_name_cmp; in list_events_sort()
6303 sort = events_system_cmp; in list_events_sort()
6306 sort = NULL; in list_events_sort()
6309 if (sort) in list_events_sort()
6310 qsort(events, nr_events, sizeof(*events), sort); in list_events_sort()
6316 * @sort_type: desired sort order of the events in the array
6359 * @sort_type: desired sort order of the events in the array
/kernel/linux/linux-5.10/drivers/base/regmap/
H A Dregcache.c13 #include <linux/sort.h>
/kernel/linux/linux-6.6/arch/s390/mm/
H A Dvmem.c14 #include <linux/sort.h>
/kernel/linux/linux-5.10/drivers/md/bcache/
H A Dbcache.h11 * it's about 95% plumbed through. A cache set and its cache devices is sort of
687 struct bset_sort_state sort; member
/kernel/linux/linux-5.10/drivers/net/wireless/rsi/
H A Drsi_mgmt.h20 #include <linux/sort.h>
/kernel/linux/linux-5.10/drivers/soc/bcm/brcmstb/pm/
H A Dpm-arm.c37 #include <linux/sort.h>

Completed in 55 milliseconds

1...<<41424344454647484950>>...123