#include <di/container/algorithm/is_permutation.h>
|
template<concepts::ForwardIterator It1, concepts::SentinelFor< It1 > Sent1, concepts::ForwardIterator It2, concepts::SentinelFor< It2 > Sent2, typename Proj1 = function::Identity, typename Proj2 = function::Identity, concepts::IndirectEquivalenceRelation< meta::Projected< It1, Sent1 >, meta::Projected< It2, Sent2 > > Pred = function::Equal> |
constexpr auto | operator() (It1 first1, Sent1 sent1, It2 first2, Sent2 sent2, Pred pred={}, Proj1 proj1={}, Proj2 proj2={}) const -> bool |
|
template<concepts::ForwardContainer Con1, concepts::ForwardContainer Con2, typename Proj1 = function::Identity, typename Proj2 = function::Identity, concepts::IndirectEquivalenceRelation< meta::Projected< meta::ContainerIterator< Con1 >, Proj1 >, meta::Projected< meta::ContainerIterator< Con2 >, Proj2 > > Pred = function::Equal> |
constexpr auto | operator() (Con1 &&container1, Con2 &&container2, Pred pred={}, Proj1 proj1={}, Proj2 proj2={}) const -> bool |
|
◆ operator()() [1/2]
auto di::container::detail::IsPermutationFunction::operator() |
( |
Con1 && | container1, |
|
|
Con2 && | container2, |
|
|
Pred | pred = {}, |
|
|
Proj1 | proj1 = {}, |
|
|
Proj2 | proj2 = {} ) const -> bool |
|
inlineconstexpr |
◆ operator()() [2/2]
template<concepts::ForwardIterator It1, concepts::SentinelFor< It1 > Sent1, concepts::ForwardIterator It2, concepts::SentinelFor< It2 > Sent2, typename Proj1 = function::Identity, typename Proj2 = function::Identity, concepts::IndirectEquivalenceRelation<
meta::Projected< It1, Sent1 >,
meta::Projected< It2, Sent2 > > Pred = function::Equal>
auto di::container::detail::IsPermutationFunction::operator() |
( |
It1 | first1, |
|
|
Sent1 | sent1, |
|
|
It2 | first2, |
|
|
Sent2 | sent2, |
|
|
Pred | pred = {}, |
|
|
Proj1 | proj1 = {}, |
|
|
Proj2 | proj2 = {} ) const -> bool |
|
inlineconstexpr |
The documentation for this struct was generated from the following file: