Home
last modified time | relevance | path

Searched refs:sort (Results 2251 - 2275 of 2360) sorted by relevance

1...<<9192939495

/third_party/skia/third_party/externals/spirv-cross/
H A Dspirv_hlsl.cpp1480 sort(input_variables.begin(), input_variables.end(), variable_compare); in emit_resources()
1499 sort(output_variables.begin(), output_variables.end(), variable_compare); in emit_resources()
/third_party/json/tests/thirdparty/doctest/
H A Ddoctest.h6359 // sort the collected records
6362 std::sort(testArray.begin(), testArray.end(), fileOrderComparator);
6364 std::sort(testArray.begin(), testArray.end(), suiteOrderComparator);
6366 std::sort(testArray.begin(), testArray.end(), nameOrderComparator);
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp1518 // Unstable sort by host order ok, because this is only used for uniquifying. in HasFormulaWithSameRegs()
1519 llvm::sort(Key); in HasFormulaWithSameRegs()
1542 // Unstable sort by host order ok, because this is only used for uniquifying. in InsertFormula()
1543 llvm::sort(Key); in InsertFormula()
4364 // Unstable sort by host order ok, because this is only used for in FilterOutUndesirableDedicatedRegisters()
4366 llvm::sort(Key); in FilterOutUndesirableDedicatedRegisters()
4902 // - sort the formula so that the most profitable solutions are found first in SolveRecurse()
4903 // - sort the uses too in SolveRecurse()
H A DRewriteStatepointsForGC.cpp1821 llvm::sort(Uses); in relocationViaAlloca()
1880 /// Implement a unique function which doesn't require we sort the input
H A DSimpleLoopUnswitch.cpp1376 // Copy the cloned exits and sort them in ascending loop depth, we'll work in buildClonedLoops()
1381 llvm::sort(OrderedClonedExitsInLoops, [&](BasicBlock *LHS, BasicBlock *RHS) { in buildClonedLoops()
2266 // a list and sort them by loop depth to achieve this without updating in unswitchNontrivialInvariants()
/third_party/python/Lib/test/
H A D_test_multiprocessing.py3721 all.sort()
4810 messages.sort()
5710 obj.sort()
H A Dtest_descr.py4756 list.sort(thing)
5030 keys.sort()
5050 keys.sort()
/third_party/vk-gl-cts/modules/gles31/functional/
H A Des31fTessellationTests.cpp1095 std::sort(result.begin(), result.end(), pred);
1103 std::sort(result.begin(), result.end());
1489 std::sort(triangle.getPtr(), triangle.getPtr()+3, VecLexLessThan<3>());
H A Des31fTessellationGeometryInteractionTests.cpp1258 std::sort(vertices.begin(), vertices.end(), feedbackResultCompare);
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DBidi.java5550 Arrays.sort(keys); in getLogicalToVisualRunsMap()
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DBidi.java5462 Arrays.sort(keys); in getLogicalToVisualRunsMap()
/third_party/node/deps/v8/src/wasm/
H A Dwasm-code-manager.cc1731 std::sort(new_owned_code_.begin(), new_owned_code_.end(), in TransferNewOwnedCodeLocked()
/third_party/nghttp2/src/
H A Dnghttp.cc2204 std::sort(std::begin(reqs), std::end(reqs), in print_stats()
/third_party/node/deps/v8/src/wasm/baseline/
H A Dliftoff-assembler.h1693 std::sort(slots_.begin(), slots_.end(), [](const Slot& a, const Slot& b) { in SortInPushOrder()
/third_party/python/Lib/
H A Dtarfile.py2289 # Reverse sort directories.
2290 directories.sort(key=lambda a: a.name, reverse=True)
/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/shaderrender/
H A DvktShaderRenderBuiltinVarTests.cpp1399 std::sort(locations.begin(), locations.end(), pixelOffsetCompare); in validateSampleLocations()
/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/tessellation/
H A DvktTessellationInvarianceTests.cpp1202 std::sort(triangle.getPtr(), triangle.getPtr()+3, VecLexLessThan<3>()); in compareTriangleSets()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/GlobalISel/
H A DIRTranslator.cpp766 llvm::sort(W.FirstCluster, W.LastCluster + 1, in lowerSwitchWorkItem()
/third_party/skia/third_party/externals/opengl-registry/xml/
H A Dreadme.tex831 a {\em client-side alias} or something of the sort).
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
H A DScalarEvolutionExpander.cpp325 // Let ScalarEvolution sort and simplify the non-addrecs list. in SimplifyAddOperands()
700 // Sort by loop. Use a stable sort so that constants follow non-constants and in visitAddExpr()
770 // Sort by loop. Use a stable sort so that constants follow non-constants. in visitMulExpr()
1958 llvm::sort(Phis, [](Value *LHS, Value *RHS) { in replaceCongruentIVs()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
H A DVirtualFileSystem.cpp2048 llvm::sort(Mappings, [](const YAMLVFSEntry &LHS, const YAMLVFSEntry &RHS) { in write()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
H A DHexagonConstExtenders.cpp1962 llvm::sort(Extenders, [this](const ExtDesc &A, const ExtDesc &B) { in runOnMachineFunction()
/third_party/protobuf/src/google/protobuf/
H A Dgenerated_message_reflection.cc1100 // ListFields() must sort output by field number. in ListFieldsMayFailOnStripped()
1101 std::sort(output->begin(), output->end(), FieldNumberSorter()); in ListFieldsMayFailOnStripped()
H A Drepeated_field_unittest.cc1845 std::sort(proto_array_.pointer_begin(), proto_array_.pointer_end(), in TEST_F()
H A Dtext_format.cc2032 std::sort(fields.begin(), fields.end(), FieldIndexSorter()); in Print()
2135 // for each element, just store map keys and sort them. in SortMap()

Completed in 125 milliseconds

1...<<9192939495