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