de/d14/conceptAleph_1_1SparseMatrix.html

template<typename T>

concept Aleph::SparseMatrix =  requires(const T & m, T & mut_m, size_t r, size_t c, uint64_t v)

    {

      { m.rows() } -> std::convertible_to<size_t>;

      { m.cols() } -> std::convertible_to<size_t>;

      { m.read_ne(r, c) } -> std::convertible_to<uint64_t>;

      { mut_m.write(r, c, v) };

      { mut_m.traverse_allocated([](uint64_t &) { return true; }) } -> std::convertible_to<bool>;

      { mut_m.set_dimension(r, c) };

    }

Aleph::SparseMatrix
Expresses requirements for sparse matrix backends like DynMatrix.
Definition modular_linalg.H:62

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

m
FooMap m(5, fst_unit_pair_hash, snd_unit_pair_hash)

r
gsl_rng * r
Definition test_sort_lists.C:40