#include <di/container/algorithm/is_heap.h>
|  | 
| template<concepts::RandomAccessIterator Iter, concepts::SentinelFor< Iter > Sent, typename Proj = function::Identity, concepts::IndirectStrictWeakOrder< meta::Projected< Iter, Proj > > Comp = function::Compare> | 
| constexpr auto | operator() (Iter first, Sent last, Comp comp={}, Proj proj={}) const -> bool | 
|  | 
| template<concepts::RandomAccessContainer Con, typename Proj = function::Identity, concepts::IndirectStrictWeakOrder< meta::Projected< meta::ContainerIterator< Con >, Proj > > Comp = function::Compare> | 
| constexpr auto | operator() (Con &&container, Comp comp={}, Proj proj={}) const -> bool | 
|  | 
◆ operator()() [1/2]
template<concepts::RandomAccessContainer Con, typename Proj = function::Identity, concepts::IndirectStrictWeakOrder< 
meta::Projected< 
meta::ContainerIterator< Con >, Proj > > Comp = function::Compare> 
  
  | 
        
          | auto di::container::detail::IsHeapFunction::operator() | ( | Con && | container, |  
          |  |  | Comp | comp = {}, |  
          |  |  | Proj | proj = {} ) const -> bool |  | inlineconstexpr | 
 
 
◆ operator()() [2/2]
template<concepts::RandomAccessIterator Iter, concepts::SentinelFor< Iter > Sent, typename Proj = function::Identity, concepts::IndirectStrictWeakOrder< 
meta::Projected< Iter, Proj > > Comp = function::Compare> 
  
  | 
        
          | auto di::container::detail::IsHeapFunction::operator() | ( | Iter | first, |  
          |  |  | Sent | last, |  
          |  |  | Comp | comp = {}, |  
          |  |  | Proj | proj = {} ) const -> bool |  | inlineconstexpr | 
 
 
The documentation for this struct was generated from the following file:
- libs/di/include/di/container/algorithm/is_heap.h