Home
last modified time | relevance | path

Searched refs:partition_point (Results 1 – 25 of 71) sorted by relevance

123

/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/
H A Dpartition_point.pass.cpp31 return (std::partition_point(std::begin(ia), std::end(ia), is_odd()) == ia+3) in test_constexpr()
32 && (std::partition_point(std::begin(ib), std::end(ib), is_odd()) == ib+1) in test_constexpr()
42 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), in main()
48 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), in main()
54 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), in main()
60 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), in main()
66 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), in main()
72 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), in main()
78 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), in main()
84 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), in main()
H A Dranges_partition_point.pass.cpp41 …std::ranges::partition_point(std::forward<Iter>(iter), std::forward<Sent>(sent), std::forward<Pred…
64 std::ranges::partition_point(std::forward<Range>(range), std::forward<Pred>(pred));
81 constexpr void test_one(std::array<int, N> input, Pred pred, size_t partition_point) { in test_one() argument
89 std::same_as<Iter> decltype(auto) result = std::ranges::partition_point(begin, end, pred); in test_one()
91 assert(base(result) == input.data() + partition_point); in test_one()
98 std::same_as<Iter> decltype(auto) result = std::ranges::partition_point(range, pred); in test_one()
100 assert(base(result) == input.data() + partition_point); in test_one()
161 auto result_no_proj = std::ranges::partition_point(in.begin(), in.end(), is_odd); in test()
163 auto result_with_proj = std::ranges::partition_point(in.begin(), in.end(), is_odd, x2); in test()
168 auto result_no_proj = std::ranges::partition_point(in, is_odd); in test()
[all …]
H A Dranges_partition.pass.cpp87 constexpr void test_one(std::array<int, N> input, Pred pred, size_t partition_point) { in test_one() argument
97 assert(base(result.begin()) == partitioned.data() + partition_point); in test_one()
112 assert(base(result.begin()) == partitioned.data() + partition_point); in test_one()
H A Dranges_stable_partition.pass.cpp89 void test_one(std::array<int, N> input, Pred pred, size_t partition_point, std::array<int, N> expec… in test_one() argument
100 assert(base(result.begin()) == partitioned.data() + partition_point); in test_one()
116 assert(base(result.begin()) == partitioned.data() + partition_point); in test_one()
/llvm-project-15.0.7/libcxx/test/libcxx/fuzzing/
H A Dnth_element.pass.cpp21 const size_t partition_point = data[0] % size; in LLVMFuzzerTestOneInput() local
23 const auto partition_iter = working.begin() + partition_point; in LLVMFuzzerTestOneInput()
/llvm-project-15.0.7/llvm/lib/Support/
H A DAddressRanges.cpp39 auto It = std::partition_point( in find()
58 auto It = std::partition_point( in find()
/llvm-project-15.0.7/clang/lib/Tooling/Syntax/
H A DTokens.cpp46 llvm::partition_point(Toks, [&](const syntax::Token &T) { in getTokensCovering()
50 llvm::partition_point(Toks, [&](const syntax::Token &T) { in getTokensCovering()
337 auto It = llvm::partition_point(File.Mappings, [&](const Mapping &M) { in spelledForExpandedToken()
366 auto It = llvm::partition_point(F.Mappings, [SpelledI](const Mapping &M) { in mappingStartingBeforeSpelled()
441 const auto *Tok = llvm::partition_point( in spelledTokenAt()
544 auto M = llvm::partition_point(File.Mappings, [&](const Mapping &M) { in expansionStartingAt()
561 auto M = llvm::partition_point(File.Mappings, [&](const Mapping &M) { in expansionsOverlapping()
575 auto *Right = llvm::partition_point( in spelledTokensTouching()
/llvm-project-15.0.7/clang-tools-extra/clangd/index/dex/
H A DPostingList.cpp51 CurrentID = std::partition_point(CurrentID, DecompressedChunk.end(), in advanceTo()
104 std::partition_point(CurrentChunk + 1, Chunks.end(), in advanceToChunk()
/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dpartition_point.h26 partition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) in partition_point() function
H A Dranges_partition_point.h80 inline constexpr auto partition_point = __partition_point::__fn{};
/llvm-project-15.0.7/clang-tools-extra/clangd/
H A DSelection.cpp257 llvm::partition_point(AllSpelledTokens, [&](const syntax::Token &Tok) { in SelectionTester()
260 const syntax::Token *SelLimit = std::partition_point( in SelectionTester()
390 const syntax::Token *Start = llvm::partition_point( in computeMaybeSelectedExpandedTokens()
404 const syntax::Token *End = std::partition_point( in computeMaybeSelectedExpandedTokens()
484 auto B = llvm::partition_point( in testTokenRange()
486 auto E = std::partition_point(B, SelectedSpelled.end(), [&](const Tok &T) { in testTokenRange()
507 auto It = llvm::partition_point( in testToken()
/llvm-project-15.0.7/clang-tools-extra/pseudo/lib/grammar/
H A DLRTable.cpp69 auto It = llvm::partition_point( in getStartState()
H A DGrammarBNF.cpp117 auto StartIt = llvm::partition_point(T->Rules, [&](const Rule &R) { in build()
253 const auto It = llvm::partition_point( in applyAttributes()
H A DGrammar.cpp71 auto It = llvm::partition_point( in findNonterminal()
/llvm-project-15.0.7/clang-tools-extra/clangd/index/
H A DSymbol.cpp38 auto It = llvm::partition_point(Symbols, in find()
/llvm-project-15.0.7/clang-tools-extra/clangd/refactor/tweaks/
H A DExpandMacro.cpp55 auto *It = llvm::partition_point(Spelled, [&](const syntax::Token &T) { in REGISTER_TWEAK()
/llvm-project-15.0.7/llvm/lib/DebugInfo/DWARF/
H A DDWARFDebugAranges.cpp126 partition_point(Aranges, [=](Range R) { return R.HighPC() <= Address; }); in findAddress()
H A DDWARFUnitIndex.cpp272 auto I = partition_point(OffsetLookup, [&](Entry *E2) { in getFromOffset()
/llvm-project-15.0.7/lld/ELF/
H A DDWARF.cpp109 partition_point(rels, [=](const RelTy &a) { return a.r_offset < pos; }); in findAux()
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DSTLExtrasTest.cpp647 TEST(STLExtrasTest, partition_point) { in TEST() argument
652 partition_point(V, [](unsigned X) { return X < 7; })); in TEST()
653 EXPECT_EQ(V.begin(), partition_point(V, [](unsigned X) { return X < 1; })); in TEST()
654 EXPECT_EQ(V.end(), partition_point(V, [](unsigned X) { return X < 50; })); in TEST()
/llvm-project-15.0.7/llvm/lib/ProfileData/
H A DProfileSummaryBuilder.cpp81 auto It = partition_point(DS, [=](const ProfileSummaryEntry &Entry) { in getEntryForPercentile()
/llvm-project-15.0.7/llvm/lib/TextAPI/
H A DInterfaceFile.cpp23 auto I = partition_point(Container, [=](const InterfaceFileRef &O) { in addEntry()
/llvm-project-15.0.7/llvm/lib/Target/X86/
H A DX86InstrFMA3Info.cpp172 auto I = partition_point(Table, [=](const X86InstrFMA3Group &Group) { in getFMA3Group()
/llvm-project-15.0.7/libcxx/test/libcxx/algorithms/
H A Dranges_robust_against_copying_comparators.pass.cpp182 (void)std::ranges::partition_point(first, last, UnaryTrue(&copies)); assert(copies == 0); in all_the_algorithms()
183 (void)std::ranges::partition_point(a, UnaryTrue(&copies)); assert(copies == 0); in all_the_algorithms()
/llvm-project-15.0.7/libcxx/test/std/algorithms/
H A Dranges_robust_against_nonbool_predicates.pass.cpp80 test(std::ranges::partition_point, in, unary_pred); in test_all()

123