db/d7e/conceptAleph_1_1LCTLazyTag.html

template<typename L, typename T>

concept Aleph::LCTLazyTag =

      std::equality_comparable<typename L::tag_type> and

      requires(const typename L::tag_type & t1,

               const typename L::tag_type & t2,

               const T & val, size_t cnt)

        {

          typename L::tag_type;

          { L::tag_identity() } -> std::convertible_to<typename L::tag_type>;

          { L::apply(val, t1, cnt) } -> std::convertible_to<T>;

          { L::compose(t1, t2) } -> std::convertible_to<typename L::tag_type>;

        }

Aleph::LCTLazyTag
Concept for a lazy-tag policy used in deferred path updates.
Definition tpl_link_cut_tree.H:110

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

Aleph::divide_and_conquer_partition_dp
Divide_Conquer_DP_Result< Cost > divide_and_conquer_partition_dp(const size_t groups, const size_t n, Transition_Cost_Fn transition_cost, const Cost inf=dp_optimization_detail::default_inf< Cost >())
Optimize partition DP using divide-and-conquer optimization.
Definition DP_Optimizations.H:133

Aleph::T
std::decay_t< typename HeadC::Item_Type > T
Definition ah-zip.H:105