Home
last modified time | relevance | path

Searched refs:sort (Results 1451 - 1475 of 1845) sorted by relevance

1...<<51525354555657585960>>...74

/kernel/linux/linux-6.6/drivers/md/bcache/
H A Dsuper.c1684 bch_bset_sort_state_free(&c->sort); in cache_set_free()
1955 if (bch_bset_sort_state_init(&c->sort, ilog2(c->btree_pages))) in bch_cache_set_alloc()
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
H A DULocale.java1717 Collections.sort(tfields); in replaceTransformedExtensions()
3559 Collections.sort(variants); in toLanguageTag()
/third_party/mksh/
H A DBuild.sh196 echo "$o_str" | sort | while IFS='|' read x opts cond; do
2455 sed 's/^.*[ ]SIG\([A-Z0-9][A-Z0-9]*\)[ ].*$/\1/' | sort`
/third_party/libphonenumber/java/libphonenumber/src/com/google/i18n/phonenumbers/
H A DPhoneNumberUtil.java769 * @return true if the number could be a phone number of some sort, otherwise false
2637 // The current list is sorted; we need to merge in the new list and re-sort (duplicates in testNumberLength()
2639 Collections.sort(possibleLengths); in testNumberLength()
2646 Collections.sort(localLengths); in testNumberLength()
3265 // Check the region supplied is valid, or that the extracted number starts with some sort of + in parseHelper()
/third_party/libphonenumber/javascript/i18n/phonenumbers/
H A Dphonenumberutil.js1191 * @return {boolean} true if the number could be a phone number of some sort,
3525 // re-sort (duplicates are okay). Sorting isn't so expensive because the
3527 possibleLengths.sort();
3534 localLengths.sort();
4269 // with some sort of + sign so the number's region can be determined.
/third_party/python/Lib/test/
H A Dtest_minidom.py657 keys1.sort()
658 keys2.sort()
H A Dtest_weakref.py1283 items1.sort()
1284 items2.sort()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/ARM/
H A DARMFrameLowering.cpp1019 llvm::sort(Regs, [&](const RegAndKill &LHS, const RegAndKill &RHS) { in emitPushInst()
1115 llvm::sort(Regs, [&](unsigned LHS, unsigned RHS) { in emitPopInst()
H A DARMLoadStoreOptimizer.cpp1829 // Check offset and sort memory operation into the current chain.
1885 llvm::sort(Candidates, LessThan);
2229 llvm::sort(Ops, [](const MachineInstr *LHS, const MachineInstr *RHS) {
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
H A DIndVarSimplify.cpp2724 llvm::sort(ExitingBlocks, in optimizeLoopExits()
2726 // std::sort sorts in ascending order, so we want the inverse of in optimizeLoopExits()
2886 llvm::sort(ExitingBlocks, in predicateLoopExits()
2888 // std::sort sorts in ascending order, so we want the inverse of in predicateLoopExits()
/third_party/skia/third_party/externals/tint/src/reader/spirv/
H A Dparser_impl.cc898 std::sort(sorted_inputs.begin(), sorted_inputs.end()); in RegisterEntryPoints()
900 std::sort(sorted_outputs.begin(), sorted_outputs.end()); in RegisterEntryPoints()
/third_party/typescript/tests/baselines/reference/
H A DunderscoreTest1.js160 sort(compareFn?: (a: T, b: T) => number): T[];
320 sort(compareFn?: (a: T, b: T) => number): ChainedArray<T>;
683 _.invoke([[5, 1, 7], [3, 2, 1]], 'sort');
923 _.invoke([[5, 1, 7], [3, 2, 1]], 'sort');
/third_party/protobuf/ruby/tests/
H A Dcommon_tests.rb525 assert m.values.map{|msg| msg.optional_int32}.sort == [42, 84]
575 field_names = o.map{|f| f.name}.sort
/third_party/vk-gl-cts/modules/gles3/performance/
H A Des3pShaderOperatorTests.cpp285 std::sort(times.begin(), times.end()); in getMedianTime()
953 std::sort(records.begin(), records.end());
/third_party/vk-gl-cts/modules/gles2/performance/
H A Des2pShaderOperatorTests.cpp285 std::sort(times.begin(), times.end()); in getMedianTime()
953 std::sort(records.begin(), records.end());
/foundation/ability/ability_runtime/frameworks/simulator/ability_simulator/src/bundle_parser/
H A Dinner_bundle_info.cpp1075 std::sort(name.begin(), name.end()); in RemoveDuplicateName()
/foundation/arkui/ace_engine/frameworks/core/components_ng/pattern/data_panel/
H A Ddata_panel_modifier.cpp725 std::sort( in SortGradientColorsOffset()
/foundation/arkui/ace_engine/frameworks/bridge/common/dom/
H A Ddom_list.cpp879 children_.sort([](const RefPtr<DOMNode>& node1, const RefPtr<DOMNode>& node2) { in UpdateAccessibilityOrder()
/foundation/arkui/ace_engine/frameworks/core/components_ng/pattern/slider/
H A Dslider_content_modifier.cpp885 std::sort( in SortGradientColorsByOffset()
/foundation/graphic/graphic_3d/lume/LumeEcsSerializer/EcsSerializer/src/ecs_serializer/
H A Decs_serializer.cpp588 std::sort(managerUids.begin(), managerUids.end()); in WriteComponents()
/foundation/graphic/graphic_3d/lume/LumeRender/src/gles/
H A Dgpu_program_gles.cpp551 // has sort inside
558 // has sort inside
562 // has sort inside
716 std::sort(constants_.begin(), constants_.end(), in GpuComputeProgramGLES()
/foundation/graphic/graphic_3d/lume/scenewidgetplugin/plugin/src/
H A Decs_serializer.cpp650 std::sort(managerUids.begin(), managerUids.end()); in WriteComponents()
/foundation/multimedia/audio_framework/frameworks/native/hdiadapter/sink/remote/
H A Dremote_audio_renderer_sink.cpp355 sort(splitStreamVector.begin(), splitStreamVector.end()); in splitStreamInit()
/foundation/multimedia/media_library/frameworks/innerkitsimpl/medialibrary_data_extension/src/
H A Dmedialibrary_analysis_album_operations.cpp634 std::sort(splitResult.begin(), splitResult.end()); in ReorderTagId()
/foundation/resourceschedule/resource_schedule_service/ressched/services/resschedmgr/resschedfwk/src/
H A Dplugin_mgr.cpp880 sortPluginList.sort([&](const std::string& a, const std::string& b) -> bool { in SortPluginList()

Completed in 73 milliseconds

1...<<51525354555657585960>>...74