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

◆ compute_s_pair()

void GBinhom_comp::compute_s_pair ( s_pair * p)
private

Definition at line 445 of file gb-sugarless.cpp.

446{
447 if (p->f == nullptr)
448 {
449 monomial s = M->make_one();
450 M->divide(p->lcm, p->first->f->monom, s);
451
452 GR->gbvector_mult_by_term(
453 F, Fsyz, GR->one(), s, p->first->f, p->first->fsyz, p->f, p->fsyz);
454 if (p->syz_type == SPAIR_PAIR)
455 GR->gbvector_reduce_lead_term(
456 F, Fsyz, nullptr, p->f, p->fsyz, p->second->f, p->second->fsyz);
457 M->remove(s);
458 }
459}
const FreeModule * Fsyz
const FreeModule * F
const Monoid * M
const int SPAIR_PAIR
Definition comp-gb.hpp:56
#define monomial
Definition gb-toric.cpp:11
int p
void size_t s
Definition m2-mem.cpp:271

References F, Fsyz, GR, M, monomial, p, s, and SPAIR_PAIR.

Referenced by s_pair_step().