Home
last modified time | relevance | path

Searched refs:adjacent_find (Results 1 – 23 of 23) sorted by relevance

/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dadjacent_find.h44 adjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) { in adjacent_find() function
50 adjacent_find(_ForwardIterator __first, _ForwardIterator __last) { in adjacent_find() function
51 return std::adjacent_find(std::move(__first), std::move(__last), __equal_to()); in adjacent_find()
H A Dranges_adjacent_find.h73 inline constexpr auto adjacent_find = __adjacent_find::__fn{};
/freebsd/contrib/llvm-project/libcxx/include/__ranges/
H A Dchunk_by_view.h75 … ranges::adjacent_find(__current, ranges::end(__base_), __reversed_pred), 1, ranges::end(__base_)); in __find_next()
92 …return ranges::prev(ranges::adjacent_find(__reversed, __reversed_pred).base(), 1, std::move(__firs… in __find_prev()
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86InstrFoldTables.cpp94 assert(std::adjacent_find(std::begin(Table), std::end(Table)) == \ in lookupFoldTableImpl()
217 assert(std::adjacent_find(Table.begin(), Table.end()) == Table.end() && in X86MemUnfoldTable()
H A DX86IntrinsicsInfo.h1658 assert((std::adjacent_find(std::begin(IntrinsicsWithoutChain), in verifyIntrinsicTables()
1661 (std::adjacent_find(std::begin(IntrinsicsWithChain), in verifyIntrinsicTables()
/freebsd/contrib/llvm-project/libcxx/modules/std/
H A Dalgorithm.cppm
H A Dalgorithm.inc104 using std::adjacent_find;
107 using std::ranges::adjacent_find;
/freebsd/contrib/llvm-project/lldb/source/Plugins/Process/Utility/
H A DMemoryTagManagerAArch64MTE.cpp168 MemoryRegionInfos::const_iterator overlap = std::adjacent_find( in MakeTaggedRanges()
/freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/
H A Dglue_algorithm_defs.h
H A Dglue_algorithm_impl.h
H A Dalgorithm_impl.h
/freebsd/contrib/llvm-project/libcxx/src/experimental/
H A Dtzdb.cpp667 (void)ranges::adjacent_find(__entries, [&](const __entry& __first, const __entry& __second) { in __parse_leap_seconds()
/freebsd/contrib/llvm-project/lldb/include/lldb/Utility/
H A DRangeMap.h240 auto first_intersect = std::adjacent_find( in CombineConsecutiveRanges()
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DSemaStmtAsm.cpp730 std::adjacent_find(begin(NamedOperandList), end(NamedOperandList), in ActOnGCCAsmStmt()
/freebsd/contrib/llvm-project/libcxx/include/
H A Dalgorithm652 …constexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {}); // since C…
657 …constexpr borrowed_iterator_t<R> ranges::adjacent_find(R&& r, Pred pred = {}, Proj proj = {}); //…
1212 adjacent_find(ForwardIterator first, ForwardIterator last);
1216 adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
1823 #include <__algorithm/adjacent_find.h>
H A Dmodule.modulemap626 …rithm_adjacent_find [system] { header "__algorithm/adjacent_find.h" }
/freebsd/lib/libc++/
H A DMakefile279 ALG_HEADERS+= adjacent_find.h
H A Dlibcxx.imp2 { include: [ "<__algorithm/adjacent_find.h>", "private", "<algorithm>", "public" ] },
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DCodeGenSchedule.cpp539 auto I = std::adjacent_find(ProcRecords.begin(), ProcRecords.end(), in collectProcModels()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DAssignmentTrackingAnalysis.cpp2240 assert(std::adjacent_find(Frags.begin(), Frags.end()) == Frags.end()); in buildOverlapMapAndRecordDeclares()
/freebsd/contrib/llvm-project/clang/lib/Tooling/Inclusions/Stdlib/
H A DStdSymbolMap.inc585 SYMBOL(adjacent_find, std::, <algorithm>)
3541 SYMBOL(adjacent_find, std::ranges::, <algorithm>)
/freebsd/contrib/llvm-project/lldb/source/Plugins/Process/gdb-remote/
H A DProcessGDBRemote.cpp4473 std::adjacent_find(fields.begin(), fields.end(), in ParseFlags()
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64InstrInfo.cpp8300 if (std::adjacent_find( in getOutliningCandidateInfo()