| /foundation/graphic/graphic_3d/lume/Lume_3D/src/util/ |
| H A D | picking.cpp | 404 std::sort( in RayCast()
460 std::sort( in RayCast()
|
| /foundation/communication/netmanager_base/services/netmanagernative/src/netsys/dnsresolv/ |
| H A D | dns_param_cache.cpp | 103 std::sort(oldDnsServers.begin(), oldDnsServers.end()); in SetResolverConfig()
106 std::sort(newDnsServers.begin(), newDnsServers.end()); in SetResolverConfig()
|
| /foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/storage/src/multiver/ |
| H A D | multi_ver_natural_store_commit_storage.cpp | 292 commits.sort([] (const MultiVerCommitNode &thisNode, const MultiVerCommitNode &thatNode) { in GetAllCommitsInTree()
863 commits.sort(CompareCommit); in RefreshCommitTree()
|
| /third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
| H A D | AlphabeticIndex.java | 282 Collections.sort(firstCharsInScripts, collatorPrimaryOnly); in AlphabeticIndex()
442 * and sort differently, and that the overall list is small enough.
473 // Ignore a multi-code point index character that does not sort distinctly in initLabels()
590 * <p>This is used to test whether contractions sort differently from their components.
669 * Add a record (name and data) to the index. The name will be used to sort the items into buckets, and to sort
670 * within the bucket. Two records may have the same name. When they do, the sort order is according to the order added:
694 * information, it can put the name into the right bucket, and sort it within that bucket, without having access to
697 * Note that the bucket number (and sort key) are only valid for the settings of the current AlphabeticIndex; if
698 * those are changed, then the bucket number and sort ke
[all...] |
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/ |
| H A D | AlphabeticIndex.java | 274 Collections.sort(firstCharsInScripts, collatorPrimaryOnly); in AlphabeticIndex()
423 * and sort differently, and that the overall list is small enough.
454 // Ignore a multi-code point index character that does not sort distinctly in initLabels()
571 * <p>This is used to test whether contractions sort differently from their components.
647 * Add a record (name and data) to the index. The name will be used to sort the items into buckets, and to sort
648 * within the bucket. Two records may have the same name. When they do, the sort order is according to the order added:
671 * information, it can put the name into the right bucket, and sort it within that bucket, without having access to
674 * Note that the bucket number (and sort key) are only valid for the settings of the current AlphabeticIndex; if
675 * those are changed, then the bucket number and sort ke
[all...] |
| /third_party/node/deps/v8/tools/ |
| H A D | callstats.py | 451 sort_func = sort_asc_func if args.sort == "asc" else sort_desc_func
458 elif args.sort == "desc":
718 "-s", "--sort", choices=["asc", "desc"], default="asc",
|
| /third_party/node/deps/v8/src/debug/ |
| H A D | debug-coverage.cc | 68 std::sort(v.begin(), v.end(), CompareCoverageBlock); in SortBlockData()
575 // A {SFI, count} tuple is used to sort by source range (stored on
656 std::sort(sorted.begin(), sorted.end()); in Collect()
|
| /third_party/musl/ |
| H A D | configure | 589 tryldflag LDFLAGS_AUTO -Wl,--sort-section,alignment
590 tryldflag LDFLAGS_AUTO -Wl,--sort-common
|
| /third_party/skia/third_party/externals/spirv-tools/source/opt/ |
| H A D | ir_context.cpp | 1006 std::sort(preds.begin(), preds.end()); in CheckCFG()
1007 std::sort(real.begin(), real.end()); in CheckCFG()
|
| H A D | types.cpp | 56 std::sort(a_ptrs.begin(), a_ptrs.end(), cmp); in CompareTwoVectors()
57 std::sort(b_ptrs.begin(), b_ptrs.end(), cmp); in CompareTwoVectors()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| H A D | ir_context.cpp | 1006 std::sort(preds.begin(), preds.end()); in CheckCFG()
1007 std::sort(real.begin(), real.end()); in CheckCFG()
|
| H A D | types.cpp | 56 std::sort(a_ptrs.begin(), a_ptrs.end(), cmp); in CompareTwoVectors()
57 std::sort(b_ptrs.begin(), b_ptrs.end(), cmp); in CompareTwoVectors()
|
| /third_party/skia/third_party/externals/dawn/generator/ |
| H A D | dawn_json_generator.py | 319 obj.methods.sort(key=lambda method: method.name.canonical_case())
348 # This is a form of topological sort where we try to keep the order reasonably
349 # similar to the original order (though the sort isn't technically stable).
352 # dependents, then re-sorting based on that depth using Python's stable sort.
529 commands.sort(key=lambda c: c.name.canonical_case())
|
| /third_party/python/Lib/test/ |
| H A D | test_generators.py | 1760 candidates.sort()
1790 candidates.sort()
|
| /third_party/python/Lib/logging/ |
| H A D | config.py | 232 existing.sort()
567 # As handlers can refer to other handlers, sort the keys
609 existing.sort()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| H A D | CFLAndersAliasAnalysis.cpp | 400 llvm::sort(AliasList); in populateAliasMap()
484 llvm::sort(ExtRelations); in populateExternalRelations()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/XCore/ |
| H A D | XCoreFrameLowering.cpp | 30 #include <algorithm> // std::sort
153 llvm::sort(SpillList, CompareSSIOffset); in GetSpillList()
172 llvm::sort(SpillList, CompareSSIOffset); in GetEHSpillList()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| H A D | LoopInfoImpl.h | 623 llvm::sort(BB1); in compareVectors()
624 llvm::sort(BB2); in compareVectors()
|
| /third_party/protobuf/ruby/compatibility_tests/v3.0.0/tests/ |
| H A D | repeated_field_test.rb | 511 arr.sort!
514 arr.sort! { |x,y| y <=> x }
|
| /third_party/protobuf/ruby/tests/ |
| H A D | repeated_field_test.rb | 533 arr.sort!
536 arr.sort! { |x,y| y <=> x }
|
| /third_party/skia/include/core/ |
| H A D | SkRect.h | 84 /** Returns constructed SkIRect set to (l, t, r, b). Does not sort input; SkIRect may
113 Call sort() to reverse fLeft and fRight if needed.
120 and sort() to reverse fTop and fBottom if needed.
127 Call sort() to reverse fLeft and fRight if needed.
134 and sort() to reverse fTop and fBottom if needed.
141 and sort() to reverse fLeft and fRight if needed.
148 and sort() to reverse fTop and fBottom if needed.
195 to or greater than fBottom. Call sort() to reverse rectangles with negative
440 greater than right, the SkIRect will be considered empty. Call sort() after this call
555 void sort() {
1323 void sort() { sort() function
[all...] |
| /third_party/spirv-tools/source/opt/ |
| H A D | types.cpp | 57 std::sort(a_ptrs.begin(), a_ptrs.end(), cmp); in CompareTwoVectors()
58 std::sort(b_ptrs.begin(), b_ptrs.end(), cmp); in CompareTwoVectors()
|
| /third_party/libabigail/ |
| H A D | ltmain.sh | 3390 if sort -k 3 </dev/null >/dev/null 2>&1; then
3391 sort -k 3
3393 sort +2
3710 if ($AR t "$f_ex_an_ar_oldlib" | sort | sort -uc >/dev/null 2>&1); then
3776 darwin_filelist=`find unfat-$$ -type f -name \*.o -print -o -name \*.lo -print | $SED -e "$basename" | sort -u`
3780 darwin_files=`find unfat-$$ -name $darwin_file -print | sort | $NL2SP`
3795 my_oldobjs="$my_oldobjs "`find $my_xdir -name \*.$objext -print -o -name \*.lo -print | sort | $NL2SP`
9116 done | sort | sort
[all...] |
| /third_party/skia/third_party/externals/microhttpd/ |
| H A D | ltmain.sh | 3410 if sort -k 3 </dev/null >/dev/null 2>&1; then
3411 sort -k 3
3413 sort +2
3730 if ($AR t "$f_ex_an_ar_oldlib" | sort | sort -uc >/dev/null 2>&1); then
3796 darwin_filelist=`find unfat-$$ -type f -name \*.o -print -o -name \*.lo -print | $SED -e "$basename" | sort -u`
3800 darwin_files=`find unfat-$$ -name $darwin_file -print | sort | $NL2SP`
3815 my_oldobjs="$my_oldobjs "`find $my_xdir -name \*.$objext -print -o -name \*.lo -print | sort | $NL2SP`
9142 done | sort | sort
[all...] |
| /third_party/ffmpeg/libavcodec/ |
| H A D | vorbisenc.c | 756 int begin = fc->list[fc->list[FFMAX(i-1, 0)].sort].x; in get_floor_average()
757 int end = fc->list[fc->list[FFMIN(i+1, fc->values - 1)].sort].x; in get_floor_average()
781 int position = fc->list[fc->list[i].sort].x; in floor_fit()
789 posts[fc->list[i].sort] = j; in floor_fit()
|