d5/d92/conceptAleph_1_1AlephSequential.html

template<class Container>

concept Aleph::AlephSequential =  requires(Container c,

                                     typename Container::Key_Type v,

                                     bool (&op)(typename Container::Key_Type &))

  {

    typename Container::Key_Type;

    { c.traverse(op) } -> std::convertible_to<bool>;

    c.append(v);

    c.swap(c);

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

  }

Aleph::AlephSequential
Concept for Aleph sequential containers with traversal and append semantics.
Definition ah-unique.H:51

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

Container
Definition ah-dry.cc:65