Definition at line 676 of file gb-sugarless.cpp.
682{
685 {
686 buffer o;
687 o << "--- computing pair ";
691 }
693 int compute_pair = (
p->compare_num >= 0);
694 if (compute_pair)
695 {
697
699 }
701 gbvector *fsyz =
p->fsyz;
704 if (
p->first !=
nullptr)
705 {
706
707 assert(
p->first->pair_list ==
p);
708 p->first->pair_list =
p->next_same;
709 }
711
713
714 if (!
GR->gbvector_is_zero(f))
715 {
718 {
719 buffer o;
721 GR->gbvector_text_out(o,
F, f);
723 }
725 }
726 if (!
GR->gbvector_is_zero(fsyz))
727 {
729 {
730 buffer o;
731 o << " syz = ";
732 GR->gbvector_text_out(o,
Fsyz, fsyz);
734 }
736 {
737 vec fsyzvec =
originalR->translate_gbvector_to_vec(
Fsyz, fsyz);
741 }
742 else
743 GR->gbvector_remove(fsyz);
744 }
746}
void gb_insert(gbvector *f, gbvector *fsyz, int minlevel)
void compute_s_pair(s_pair *p)
int gb_reduce(gbvector *&f, gbvector *&fsyz)
void remove_pair(s_pair *&p)
void debug_out(s_pair *q) const
const PolynomialRing * originalR
void emit_line(const char *s)
References collect_syz, compute_s_pair(), debug_out(), emit(), emit_line(), F, Fsyz, gb_insert(), gb_reduce(), GR, last_gb_num, M2_gbTrace, n_computed, n_syz, newline, originalR, p, remove_pair(), SPAIR_DEFERRED, SPAIR_GB, SPAIR_GEN, SPAIR_REMOVED, SPAIR_SYZ, SPAIR_ZERO, buffer::str(), and syz.
Referenced by start_computation().