Macaulay2 Engine
Loading...
Searching...
No Matches

◆ insert_minimal_vp()

template<typename Key>
void F4MonomialLookupTableT< Key >::insert_minimal_vp ( long comp,
const_varpower_monomial m,
Key k )

Definition at line 325 of file f4-monlookup.cpp.

328{
329 while (comp >= mis.size()) mis.push_back(nullptr);
330 // if (comp >= mis.size())
331 // {
332 // for (long j = comp - mis.size(); j >= 0; j--) mis.push_back(nullptr);
333 // }
334 insert1(mis[comp], m, k);
335}
std::vector< mi_node * > mis
void insert1(mi_node *&p, const_varpower_monomial m, Key k)

References insert1(), and mis.

Referenced by SchreyerFrame::computeIdealQuotient(), F4SPairSet::construct_pairs(), insert_vp(), and minimalize_varpower_monomials().