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

◆ insert_res_pair()

void res_comp::insert_res_pair ( int level,
res_pair * p )
private

Definition at line 288 of file res-a1.cpp.

289{
290 // First determine the degree of 'p':
291 int deg = degree(p) - level;
292
293 res_degree *mypairs = make_degree_set(level, deg);
294 p->next = mypairs->first;
295 mypairs->first = p;
296
297 if (level > 1)
298 {
299 resn[level]->npairs++;
300 resn[level]->nleft++;
301 mypairs->nleft++;
302 mypairs->npairs++;
303 npairs++;
304 nleft++;
305 }
306 else
307 {
308 gc_vector<int> vp;
309 M->to_varpower(p->syz->monom, vp);
310 search_mi[p->syz->comp->me]->insert_minimal(new Bag(p, vp));
311 }
312}
int degree(const res_pair *q) const
Definition res-a1.cpp:273
res_degree * make_degree_set(int level, int deg)
Definition res-a1.cpp:175
const Monoid * M
Definition res-a1.hpp:80
int nleft
Definition res-a1.hpp:109
int npairs
Definition res-a1.hpp:110
int npairs
Definition res-a1.hpp:32
int nleft
Definition res-a1.hpp:33
res_pair * first
Definition res-a1.hpp:25
int p
int_bag Bag
Definition int-bag.hpp:70

References degree(), res_degree::first, M, make_degree_set(), nleft, res_degree::nleft, npairs, res_degree::npairs, and p.

Referenced by handle_gen(), new_pairs(), reduce(), and reduce_level_one().