856 v1.set_entry(0, 1.0);
857 v1.set_entry(1, 2.0);
858 v1.set_entry(2, 3.0);
861 v2.set_entry(0, 4.0);
862 v2.set_entry(1, 5.0);
863 v2.set_entry(2, 6.0);
1284 Mat A(d, d, {{1.0, 2.0}, {3.0, 4.0}});
1285 Mat B(d, d, {{5.0, 6.0}, {7.0, 8.0}});
1288 Mat C = A.vector_matrix_mult(B);
1302 Mat A(d1, d1, {{1.0, 2.0}, {3.0, 4.0}});
1303 Mat B(d2, d2, {{5.0, 6.0}, {7.0, 8.0}});
1306 EXPECT_THROW(A.vector_matrix_mult(B), std::domain_error);
1307 EXPECT_THROW(A.matrix_vector_mult(B), std::domain_error);
1317 Mat A(rows,
middle, {{1.0, 2.0, 3.0}, {4.0, 5.0, 6.0}});
1318 Mat B(
middle, cols, {{1.0, 2.0}, {3.0, 4.0}, {5.0, 6.0}});
1321 Mat C = A.vector_matrix_mult(B);
Integer domain classes for sparse data structures.
Generic domain class based on hash set.
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.