#include <di/container/algorithm/adjacent_find.h>
|
template<concepts::ForwardIterator Iter, concepts::SentinelFor< Iter > Sent, typename Proj = function::Identity, concepts::IndirectBinaryPredicate< meta::Projected< Iter, Proj > > Pred = function::Equal> |
constexpr auto | operator() (Iter fast, Sent last, Pred pred={}, Proj proj={}) const -> Iter |
|
template<concepts::ForwardContainer Con, typename Proj = function::Identity, concepts::IndirectBinaryPredicate< meta::Projected< meta::ContainerIterator< Con >, Proj > > Pred = function::Equal> |
constexpr auto | operator() (Con &&container, Pred pred={}, Proj proj={}) const -> meta::BorrowedIterator< Con > |
|
◆ operator()() [1/2]
template<concepts::ForwardContainer Con, typename Proj = function::Identity, concepts::IndirectBinaryPredicate<
meta::Projected<
meta::ContainerIterator< Con >, Proj > > Pred = function::Equal>
auto di::container::detail::AdjacentFindFunction::operator() |
( |
Con && | container, |
|
|
Pred | pred = {}, |
|
|
Proj | proj = {} ) const -> meta::BorrowedIterator<Con> |
|
inlineconstexpr |
◆ operator()() [2/2]
template<concepts::ForwardIterator Iter, concepts::SentinelFor< Iter > Sent, typename Proj = function::Identity, concepts::IndirectBinaryPredicate<
meta::Projected< Iter, Proj > > Pred = function::Equal>
auto di::container::detail::AdjacentFindFunction::operator() |
( |
Iter | fast, |
|
|
Sent | last, |
|
|
Pred | pred = {}, |
|
|
Proj | proj = {} ) const -> Iter |
|
inlineconstexpr |
The documentation for this struct was generated from the following file: