#include <di/container/algorithm/binary_search.h>
|
template<concepts::ForwardIterator It, concepts::SentinelFor< It > Sent, typename T, typename Proj = function::Identity, concepts::IndirectStrictWeakOrder< T const *, meta::Projected< It, Proj > > Comp = function::Compare> |
constexpr auto | operator() (It first, Sent last, T const &needle, Comp comp={}, Proj proj={}) const -> InFoundResult< It > |
|
template<concepts::ForwardContainer Con, typename T, typename Proj = function::Identity, concepts::IndirectStrictWeakOrder< T const *, meta::Projected< meta::ContainerIterator< Con >, Proj > > Comp = function::Compare> |
constexpr auto | operator() (Con &&container, T const &needle, Comp comp={}, Proj proj={}) const -> InFoundResult< meta::BorrowedIterator< Con > > |
|
◆ operator()() [1/2]
template<concepts::ForwardContainer Con, typename T, typename Proj = function::Identity, concepts::IndirectStrictWeakOrder< T const *,
meta::Projected<
meta::ContainerIterator< Con >, Proj > > Comp = function::Compare>
auto di::container::detail::BinarySearchFunction::operator() |
( |
Con && | container, |
|
|
T const & | needle, |
|
|
Comp | comp = {}, |
|
|
Proj | proj = {} ) const -> InFoundResult<meta::BorrowedIterator<Con>> |
|
inlineconstexpr |
◆ operator()() [2/2]
template<concepts::ForwardIterator It, concepts::SentinelFor< It > Sent, typename T, typename Proj = function::Identity, concepts::IndirectStrictWeakOrder< T const *,
meta::Projected< It, Proj > > Comp = function::Compare>
auto di::container::detail::BinarySearchFunction::operator() |
( |
It | first, |
|
|
Sent | last, |
|
|
T const & | needle, |
|
|
Comp | comp = {}, |
|
|
Proj | proj = {} ) const -> InFoundResult<It> |
|
inlineconstexpr |
The documentation for this struct was generated from the following file: