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