Definition at line 19 of file gb-sugarless.cpp.
23{
24 int i;
26 if (R == nullptr)
27 {
28 ERROR(
"ring is not a polynomial ring");
29
30 assert(0);
31 }
35 M =
GR->get_flattened_monoid();
36 K =
GR->get_flattened_coefficients();
37
39
42 gb->next_min =
nullptr;
43
46
48
53
58
59 for (i = 0; i <
F->rank(); i++) monideals.push_back(
new MonomialIdeal(R));
60}
const PolynomialRing * originalR
const Ring * get_ring() const
const FreeModule * rows() const
virtual GBRing * get_gb_ring() const
virtual const PolynomialRing * cast_to_PolynomialRing() const
References Ring::cast_to_PolynomialRing(), collect_syz, ERROR, F, gb, gbLarge, PolynomialRing::get_gb_ring(), Matrix::get_ring(), GR, is_ideal, K, last_gb_num, M, Matrix, Matrix::n_cols(), n_comps_per_syz, n_computed, n_gb, n_pairs, n_saved_gcd, n_saved_lcm, n_subring, need_resize, originalR, Matrix::rows(), spairs, and weightInfo_.
Referenced by set_up().