d5/d72/conceptAleph_1_1CA_1_1MultiFieldLatticeLike.html

template<typename L>

concept Aleph::CA::MultiFieldLatticeLike =  requires {

  typename L::coord_type;

  typename L::extents_type;

  { L::field_count } -> std::convertible_to<std::size_t>;

  { L::rank } -> std::convertible_to<std::size_t>;

} and requires(const L &l, std::size_t d) {

  { l.dimension() } -> std::convertible_to<std::size_t>;

  { l.size(d) } -> std::convertible_to<std::size_t>;

}

Aleph::HTList::size
size_t size() const noexcept
Count the number of elements of the list.
Definition htlist.H:1065

Aleph::CA::MultiFieldLatticeLike
Concept: a lattice that exposes the multi-field interface.
Definition tpl_ca_multi_field_lattice.H:448

Aleph::blossom_maximum_cardinality_matching
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

Aleph::and
and
Check uniqueness with explicit hash + equality functors.
Definition ahFunctional.H:2648

l
DynList< int > l
Definition tree-node-common.H:69