Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::DynSetTree< Key, Tree, Compare >::Has_Range_Methods< T > Struct Template Reference

Static Public Attributes

static constexpr bool has_select
 
static constexpr bool has_remove_pos
 
static constexpr bool has_split_pos
 
static constexpr bool has_position
 
static constexpr bool has_find_position
 

Detailed Description

template<typename Key, template< typename, class > class Tree = Avl_Tree, class Compare = Aleph::less<Key>>
template<typename T>
struct Aleph::DynSetTree< Key, Tree, Compare >::Has_Range_Methods< T >

Definition at line 286 of file tpl_dynSetTree.H.

Member Data Documentation

◆ has_find_position

template<typename Key , template< typename, class > class Tree = Avl_Tree, class Compare = Aleph::less<Key>>
template<typename T >
constexpr bool Aleph::DynSetTree< Key, Tree, Compare >::Has_Range_Methods< T >::has_find_position
staticconstexpr
Initial value:
=
requires(const T & t, const Key & k) { t.find_position(k); } or
requires(T & t, const Key & k) { t.find_position(k); }
size_t blossom_maximum_cardinality_matching(const GT &g, DynDlist< typename GT::Arc * > &matching, SA sa=SA())
Alias of compute_maximum_cardinality_general_matching().
Definition Blossom.H:466
std::decay_t< typename HeadC::Item_Type > T
Definition ah-zip.H:105
static int * k

Definition at line 300 of file tpl_dynSetTree.H.

◆ has_position

template<typename Key , template< typename, class > class Tree = Avl_Tree, class Compare = Aleph::less<Key>>
template<typename T >
constexpr bool Aleph::DynSetTree< Key, Tree, Compare >::Has_Range_Methods< T >::has_position
staticconstexpr
Initial value:
=
requires(const T & t, const Key & k) { t.position(k); } or
requires(T & t, const Key & k) { t.position(k); }

Definition at line 297 of file tpl_dynSetTree.H.

◆ has_remove_pos

template<typename Key , template< typename, class > class Tree = Avl_Tree, class Compare = Aleph::less<Key>>
template<typename T >
constexpr bool Aleph::DynSetTree< Key, Tree, Compare >::Has_Range_Methods< T >::has_remove_pos
staticconstexpr
Initial value:
=
requires(T & t) { t.remove_pos(std::declval<size_t>()); }

Definition at line 293 of file tpl_dynSetTree.H.

◆ has_select

template<typename Key , template< typename, class > class Tree = Avl_Tree, class Compare = Aleph::less<Key>>
template<typename T >
constexpr bool Aleph::DynSetTree< Key, Tree, Compare >::Has_Range_Methods< T >::has_select
staticconstexpr
Initial value:
=
requires(const T & t) { t.select(std::declval<size_t>()); } or
requires(T & t) { t.select(std::declval<size_t>()); }

Definition at line 290 of file tpl_dynSetTree.H.

◆ has_split_pos

template<typename Key , template< typename, class > class Tree = Avl_Tree, class Compare = Aleph::less<Key>>
template<typename T >
constexpr bool Aleph::DynSetTree< Key, Tree, Compare >::Has_Range_Methods< T >::has_split_pos
staticconstexpr
Initial value:
=
requires(T & t, T & l, T & r) { t.split_pos(std::declval<size_t>(), l, r); }
gsl_rng * r
DynList< int > l

Definition at line 295 of file tpl_dynSetTree.H.


The documentation for this struct was generated from the following file: