My Project
fast_maps.cc
Go to the documentation of this file.
1 /****************************************
2 * Computer Algebra System SINGULAR *
3 ****************************************/
4 /***************************************************************
5  * File: fast_maps.cc
6  * Purpose: implementation of fast maps
7  * Author: obachman (Olaf Bachmann)
8  * Created: 02/01
9  *******************************************************************/
10 
11 
12 
13 #include "kernel/mod2.h"
14 #include "misc/options.h"
16 #include "polys/prCopy.h"
17 #include "kernel/ideals.h"
18 #include "polys/monomials/ring.h"
19 #include "polys/sbuckets.h"
20 #include "kernel/maps/fast_maps.h"
21 
22 // define if you want to use special dest_ring
23 #define HAVE_DEST_R 1
24 // define if you want to use special src_ring
25 #define HAVE_SRC_R 1
26 // define if you want to use optimization step
27 #define HAVE_MAP_OPTIMIZE 0
28 
29 /*******************************************************************************
30 **
31 *F maMaxExp . . . . . . . . returns bound on maximal exponent of result of map
32 */
33 // return maximal monomial if max_map_monomials are substituted into pi_m
34 static poly maGetMaxExpP(poly* max_map_monomials,
35  int n_max_map_monomials, ring map_r,
36  poly pi_m, ring pi_r)
37 {
38  int n = si_min(pi_r->N, n_max_map_monomials);
39  int i, j;
40  unsigned long e_i, e_j;
41  poly m_i=NULL;
42  poly map_j = p_Init(map_r);
43 
44  for (i=1; i <= n; i++)
45  {
46  e_i = p_GetExp(pi_m, i, pi_r);
47  if (e_i==0) e_i=1;
48  m_i = max_map_monomials[i-1];
49  if (m_i != NULL && ! p_IsConstantComp(m_i, map_r))
50  {
51  for (j = 1; j<= map_r->N; j++)
52  {
53  e_j = p_GetExp(m_i, j, map_r);
54  if (e_j == 0) e_j=1;
55  p_AddExp(map_j, j, e_j*e_i, map_r);
56  }
57  }
58  }
59  return map_j;
60 }
61 
62 // returns maximal exponent if map_id is applied to pi_id
63 static unsigned long maGetMaxExp(ideal pi_id, ring pi_r, ideal map_id, ring map_r)
64 {
65  unsigned long max=0;
66  poly* max_map_monomials = (poly*) omAlloc(IDELEMS(map_id)*sizeof(poly));
67  poly max_pi_i, max_map_i;
68 
69  int i;
70  for (i=0; i<IDELEMS(map_id); i++)
71  {
72  max_map_monomials[i] = p_GetMaxExpP(map_id->m[i], map_r);
73  }
74 
75  for (i=0; i<IDELEMS(pi_id); i++)
76  {
77  max_pi_i = p_GetMaxExpP(pi_id->m[i], pi_r);
78  max_map_i = maGetMaxExpP(max_map_monomials, IDELEMS(map_id), map_r,
79  max_pi_i, pi_r);
80  unsigned long temp = p_GetMaxExp(max_map_i, map_r);
81  if (temp > max){ max=temp; }
82 
83  p_LmFree(max_pi_i, pi_r);
84  p_LmFree(max_map_i, map_r);
85  }
86  for (i=0; i<IDELEMS(map_id); i++)
87  {
88  p_LmFree(&max_map_monomials[i], map_r);
89  }
90  omFreeSize(max_map_monomials,IDELEMS(map_id)*sizeof(poly));
91 
92  return max;
93 }
94 
95 
96 /*******************************************************************************
97 **
98 *F debugging stuff
99 */
100 #ifndef SING_NDEBUG
101 void maMonomial_Out(mapoly monomial, ring src_r, ring dest_r)
102 {
103  p_wrp(monomial->src, src_r);
104  printf(" ref:%d", monomial->ref);
105  if (dest_r != NULL)
106  {
107  printf(" dest:");
108  p_wrp(monomial->dest, dest_r);
109  }
110  if (monomial->f1!=NULL) { printf(" f1:%lx", (long)monomial->f1->src);
111  // p_wrp(monomial->f1->src, src_r);
112  }
113  if (monomial->f2!=NULL) { printf(" f2:%lx",(long)monomial->f2->src);
114  // p_wrp(monomial->f2->src, src_r);
115  }
116  printf("\n");
117  fflush(stdout);
118 }
119 
120 void maPoly_Out(mapoly mpoly, ring src_r, ring dest_r)
121 {
122  while (mpoly != NULL)
123  {
124  maMonomial_Out(mpoly, src_r, dest_r);
125  mpoly = mpoly->next;
126  }
127 }
128 #endif
129 
130 /*******************************************************************************
131 **
132 *F mapolyCreate . . . . . . . . . . . . . . . Creates mapoly
133 */
136 
137 mapoly maMonomial_Create(poly p, ring /*r_p*/, sBucket_pt bucket)
138 {
140  //p_wrp(p,r_p);printf(" (%x) created\n",mp);
141  mp->src = p;
142  p->next = NULL;
143 
144  if (bucket != NULL)
145  {
146  mp->coeff = (macoeff) omAlloc0Bin(macoeffBin);
147  mp->coeff->bucket = bucket;
148  mp->coeff->n = pGetCoeff(p);
149  }
150  mp->ref = 1;
151  return mp;
152 }
153 
154 void maMonomial_Destroy(mapoly mp, ring src_r, ring dest_r)
155 {
156  if (mp != NULL)
157  {
158  p_LmFree(mp->src, src_r);
159  if (mp->coeff != NULL)
160  {
161  macoeff coeff, next = mp->coeff;
162  do
163  {
164  coeff = next;
165  next = coeff->next;
166  omFreeBin(coeff, macoeffBin);
167  }
168  while (next != NULL);
169  mp->coeff=NULL;
170  }
171  if (mp->dest != NULL)
172  {
173  assume(dest_r != NULL);
174  p_Delete(&(mp->dest), dest_r);
175  }
176  }
177  omFreeBin(mp, mapolyBin);
178 }
179 
180 /*******************************************************************************
181 **
182 *F maPoly_InsertMonomial . . . . . . . . .insertion of a monomial into mapoly
183 */
184 mapoly maPoly_InsertMonomial(mapoly &into, mapoly what, ring src_r)
185 {
186  if (into == NULL)
187  {
188  into = what;
189  return what;
190  }
191 
192  mapoly iter = into;
193  mapoly prev = NULL;
194 
195  Top:
196  p_LmCmpAction(iter->src, what->src, src_r, goto Equal, goto Greater, goto Smaller);
197 
198  Greater:
199  if (iter->next == NULL)
200  {
201  iter->next = what;
202  return what;
203  }
204  prev = iter;
205  iter = iter->next;
206  goto Top;
207 
208  Smaller:
209  if (prev == NULL)
210  {
211  into = what;
212  what->next = iter;
213  return what;
214  }
215  prev->next = what;
216  what->next = iter;
217  return what;
218 
219  Equal:
220  iter->ref += what->ref;
221  macoeff coeff = what->coeff;
222  if (coeff != NULL)
223  {
224  while (coeff->next != NULL) coeff = coeff->next;
225  coeff->next = iter->coeff;
226  iter->coeff = what->coeff;
227  what->coeff = NULL;
228  }
229  maMonomial_Free(what, src_r);
230  return iter;
231 }
232 
233 mapoly maPoly_InsertMonomial(mapoly &into, poly p, ring src_r, sBucket_pt bucket)
234 {
235  return maPoly_InsertMonomial(into, maMonomial_Create(p, src_r, bucket), src_r);
236 }
237 
238 static void maPoly_InsertPoly(mapoly &into, poly what, ring src_r, sBucket_pt bucket)
239 {
240  poly next;
241 
242  while (what != NULL)
243  {
244  next = what->next;
245  maPoly_InsertMonomial(into, what, src_r, bucket);
246  what = next;
247  }
248 }
249 
250 /*******************************************************************************
251 **
252 *F maMap_Create . . . . . . . . . . . . . . . . . . . . create stuff
253 */
254 
255 void maMap_CreatePolyIdeal(ideal map_id, ring map_r, ring src_r, ring dest_r,
256  mapoly &mp, maideal &mideal)
257 {
258  mideal = (maideal) omAlloc0(sizeof(maideal_s));
259  mideal->n = IDELEMS(map_id);
260  mideal->buckets = (sBucket_pt*) omAlloc0(mideal->n*sizeof(sBucket_pt));
261  int i;
262  mp = NULL;
263 
264  for (i=0; i<mideal->n; i++)
265  {
266  if (map_id->m[i] != NULL)
267  {
268  mideal->buckets[i] = sBucketCreate(dest_r);
270 #ifdef PDEBUG
271  prShallowCopyR(map_id->m[i], map_r, src_r),
272 #else
273  prShallowCopyR_NoSort(map_id->m[i], map_r, src_r),
274 #endif
275  src_r,
276  mideal->buckets[i]);
277  }
278  }
279 }
280 
281 void maMap_CreateRings(ideal map_id, ring map_r,
282  ideal image_id, ring image_r,
283  ring &src_r, ring &dest_r, BOOLEAN &simple)
284 {
285 #if HAVE_SRC_R > 0
286  int* weights = (int*) omAlloc0(map_r->N*sizeof(int));
287  int i;
288  int n = si_min(map_r->N, IDELEMS(image_id));
289 
290  for (i=0; i<n; i++)
291  {
292  weights[i] = pLength(image_id->m[i])+1;
293  }
294  src_r = rModifyRing_Wp(map_r, weights);
295 #else
296  src_r = map_r;
297 #endif
298 
299 #if HAVE_DEST_R > 0
300  unsigned long maxExp = maGetMaxExp(map_id, map_r, image_id, image_r);
301  if (maxExp <= 1) maxExp = 2;
302  else if (maxExp > (unsigned long) image_r->bitmask)
303  maxExp = (unsigned long) image_r->bitmask;
304  dest_r = rModifyRing_Simple(image_r, TRUE, TRUE, maxExp, simple);
305 #else
306  dest_r = image_r;
307 #endif
308 }
309 
310 static void maMap_KillRings(ring map_r, ring image_r, ring src_r, ring dest_r)
311 {
312  if (map_r != src_r)
313  rKillModified_Wp_Ring(src_r);
314  if (image_r != dest_r)
315  rKillModifiedRing(dest_r);
316 }
317 
318 /*******************************************************************************
319 **
320 *F misc . . . . . . . . . . . . . . . . . . . . . . . . . . . . misc stuff
321 */
322 
323 ideal maIdeal_2_Ideal(maideal m_id, ring /*dest_r*/)
324 {
325  ideal res = idInit(m_id->n, 1);
326  int l;
327 
328  for (int i= 0; i < m_id->n; i++)
329  {
330  if (m_id->buckets[i]!=NULL)
331  sBucketDestroyAdd(m_id->buckets[i], &(res->m[i]), &l);
332  }
333  omFreeSize(m_id->buckets,m_id->n*sizeof(sBucket_pt));
334  omFree(m_id);
335  return res;
336 }
337 
339 {
340  length = 0;
341  while (mp != NULL)
342  {
343  length++;
344  mp = mp->next;
345  }
346 }
347 
348 
349 /*******************************************************************************
350 **
351 *F fast_map_common_subexp . . . . . . . . . . . . . . . . . .the real thing
352 */
353 
354 ideal fast_map_common_subexp(const ideal map_id,const ring map_r,const ideal image_id,const ring image_r)
355 {
356  ring src_r, dest_r;
357  ideal dest_id/*, res_id*/;
358  int length = 0;
359  BOOLEAN no_sort;
360 
361  // construct rings we work in:
362  // src_r: Wp with Weights set to length of poly in image_id
363  // dest_r: Simple ring without degree ordering and short exponents
364  maMap_CreateRings(map_id, map_r, image_id, image_r, src_r, dest_r, no_sort);
365 
366  // construct dest_id
367  if (dest_r != image_r)
368  {
369  dest_id = idrShallowCopyR(image_id, image_r, dest_r);
370  }
371  else
372  dest_id = image_id;
373 
374  // construct mpoly and mideal
375  mapoly mp;
376  maideal mideal;
377  maMap_CreatePolyIdeal(map_id, map_r, src_r, dest_r, mp, mideal);
378 
379  if (TEST_OPT_PROT)
380  {
382  Print("map[%ld:%d]{%d:", dest_r->bitmask, dest_r->ExpL_Size, length);
383  }
384 
385  // do the optimization step
386 #if HAVE_MAP_OPTIMIZE > 0
387  if (mp!=NULL) maPoly_Optimize(mp, src_r);
388 #endif
389  if (TEST_OPT_PROT)
390  {
392  Print("%d}", length);
393  }
394 
395  // do the actual evaluation
396  maPoly_Eval(mp, src_r, dest_id, dest_r, length);
397  if (TEST_OPT_PROT) PrintS(".");
398 
399  // collect the results back into an ideal, clean up mideal
400  ideal res_dest_id = maIdeal_2_Ideal(mideal, dest_r);
401  if (TEST_OPT_PROT) PrintS(".");
402 
403  // convert result back to image_r
404  ideal res_image_id;
405  if (dest_r != image_r)
406  {
407  //if (no_sort) see Old/m134si.tst
408  // res_image_id = idrShallowCopyR_NoSort(res_dest_id, dest_r, image_r);
409  //else
410  res_image_id = idrShallowCopyR(res_dest_id, dest_r, image_r);
411  id_ShallowDelete(&res_dest_id, dest_r);
412  id_ShallowDelete(&dest_id,dest_r);
413  }
414  else
415  res_image_id = res_dest_id;
416 
417  if (TEST_OPT_PROT) PrintS(".");
418 
419  // clean-up the rings
420  maMap_KillRings(map_r, image_r, src_r, dest_r);
421 
422  if (TEST_OPT_PROT)
423  PrintLn();
424 
425  idTest(res_image_id);
426  return res_image_id;
427 }
428 
429 
430 /**********************************************************************
431 * Evaluation stuff *
432 **********************************************************************/
433 
434 // substitute p everywhere the monomial occours,
435 // return the number of substitutions
436 static int maPoly_Substitute(macoeff c, poly p, ring dest_r)
437 {
438  // substitute the monomial: go through macoeff
439  int len;
440  BOOLEAN zero_div= (rField_is_Ring(dest_r) && !rField_is_Domain(dest_r));
441  if (!zero_div) len=pLength(p);
442  int done=0;
443  while (c!=NULL)
444  {
445  done++;
446  poly t=__pp_Mult_nn(p,c->n,dest_r);
447  #ifdef HAVE_RINGS
448  if (zero_div) len=pLength(t);
449  #endif
450  sBucket_Add_p(c->bucket, t, len);
451  c=c->next;
452  }
453  return done;
454 }
455 
456 static poly maPoly_EvalMon(poly src, ring src_r, poly* dest_id, ring dest_r)
457 {
458  int i;
459  int e;
460  poly p=NULL;
461  poly pp;
462  BOOLEAN is_const=TRUE; // to check for zero-div in p_Mult_q
463  for(i=1;i<=src_r->N;i++)
464  {
465  e=p_GetExp(src,i,src_r);
466  if (e>0)
467  {
468  is_const=FALSE;
469  pp=dest_id[i-1];
470  if (pp==NULL)
471  {
472  p_Delete(&p,dest_r);
473  return NULL;
474  }
475  if (/*(*/ p==NULL /*)*/) /* && (e>0)*/
476  {
477  p=p_Copy(pp /*dest_id[i-1]*/,dest_r);
478  e--;
479  }
480  while (e>0)
481  {
482  p=p_Mult_q(p,p_Copy(pp /*dest_id[i-1]*/,dest_r),dest_r);
483  e--;
484  }
485  }
486  }
487  if (is_const)
488  {
489  assume(p==NULL);
490  p=p_ISet(1,dest_r);
491  }
492  return p;
493 }
494 
495 void maPoly_Eval(mapoly root, ring src_r, ideal dest_id, ring dest_r, int total_cost)
496 {
497  // invert the list rooted at root:
498  if ((root!=NULL) && (root->next!=NULL))
499  {
500  mapoly q=root->next;
501  mapoly qn;
502  root->next=NULL;
503  do
504  {
505  qn=q->next;
506  q->next=root;
507  root=q;
508  q=qn;
509  }
510  while (qn !=NULL);
511  }
512 
513  total_cost /= 10;
514  int next_print_cost = total_cost;
515 
516  // the evaluation -----------------------------------------
517  mapoly p=root;
518  int cost = 0;
519 
520  while (p!=NULL)
521  {
522  // look at each mapoly: compute its value in ->dest
523  assume (p->dest==NULL);
524  {
525  if ((p->f1!=NULL)&&(p->f2!=NULL))
526  {
527  poly f1=p->f1->dest;
528  poly f2=p->f2->dest;
529  if (p->f1->ref>0) f1=p_Copy(f1,dest_r);
530  else
531  {
532  // we own p->f1->dest now (in f1)
533  p->f1->dest=NULL;
534  }
535  if (p->f2->ref>0) f2=p_Copy(f2,dest_r);
536  else
537  {
538  // we own p->f2->dest now (in f2)
539  p->f2->dest=NULL;
540  }
541  maMonomial_Free(p->f1,src_r, dest_r);
542  maMonomial_Free(p->f2,src_r, dest_r);
543  p->dest=p_Mult_q(f1,f2,dest_r);
544  } /* factors : 2 */
545  else
546  {
547  assume((p->f1==NULL) && (p->f2==NULL));
548  // no factorization provided, use the classical method:
549  p->dest=maPoly_EvalMon(p->src,src_r,dest_id->m,dest_r);
550  }
551  } /* p->dest==NULL */
552  // substitute the monomial: go through macoeff
553  p->ref -= maPoly_Substitute(p->coeff, p->dest, dest_r);
554  //printf("subst done\n");
555  if (total_cost)
556  {
558  cost++;
559  if (cost > next_print_cost)
560  {
561  PrintS("-");
562  next_print_cost += total_cost;
563  }
564  }
565 
566  mapoly pp=p;
567  p=p->next;
568  //p_wrp(pp->src, src_r);
569  if (pp->ref<=0)
570  {
571  //printf(" (%x) killed\n",pp);
572  maMonomial_Destroy(pp, src_r, dest_r);
573  }
574  //else
575  // printf(" (%x) not killed, ref=%d\n",pp,pp->ref);
576  }
577 }
578 
579 
580 /*******************************************************************************
581 **
582 *F maEggt . . . . . . . . . . . . . . . . . . . . . . . . returns extended ggt
583 */
584 // return NULL if deg(ggt(m1, m2)) < 2
585 // else return m = ggT(m1, m2) and q1, q2 such that m1 = q1*m m2 = q2*m
586 static poly maEggT(const poly m1, const poly m2, poly &q1, poly &q2,const ring r)
587 {
588 
589  int i;
590  int dg = 0;
591  poly ggt = p_Init(r);
592  q1 = p_Init(r);
593  q2 = p_Init(r);
594 
595  for (i=1;i<=r->N;i++)
596  {
597  unsigned long e1 = p_GetExp(m1, i, r);
598  unsigned long e2 = p_GetExp(m2, i, r);
599  if (e1 > 0 && e2 > 0)
600  {
601  unsigned long em = (e1 > e2 ? e2 : e1);
602  dg += em;
603  p_SetExp(ggt, i, em, r);
604  p_SetExp(q1, i, e1 - em, r);
605  p_SetExp(q2, i, e2 - em, r);
606  }
607  else
608  {
609  p_SetExp(q1, i, e1, r);
610  p_SetExp(q2, i, e2, r);
611  }
612  }
613  if (dg>1)
614  {
615  p_Setm(ggt, r);
616  p_Setm(q1, r);
617  p_Setm(q2, r);
618  }
619  else
620  {
621  p_LmFree(ggt, r);
622  p_LmFree(q1, r);
623  p_LmFree(q2, r);
624  ggt = NULL;
625  }
626  return ggt;
627 }
628 
629 /********************************************************************
630  ** *
631  * maFindBestggT *
632  * finds ggT with the highest cost *
633  *******************************************************************/
634 
635 static mapoly maFindBestggT(mapoly mp, mapoly & choice, mapoly & fp, mapoly & fq,const ring r)
636 {
637  int ggt_deg = 0;
638  poly p = mp->src;
639  mapoly iter = choice;
640  poly ggT = NULL;
641  fp = NULL;
642  fq = NULL;
643  poly fp_p=NULL;
644  poly fq_p=NULL;
645  choice=NULL;
646  while ((iter != NULL) && (p_Deg(iter->src, r) > ggt_deg))
647  {
648  // maMonomial_Out(iter, r, NULL);
649  poly q1, q2, q;
650 
651  q = maEggT(p, iter->src, q1, q2,r);
652  if (q != NULL)
653  {
654  int tmp_deg;
655  assume((q1!=NULL)&&(q2!=NULL));
656  if ((tmp_deg=p_Deg(q,r)) > ggt_deg)
657  {
658  choice=iter;
659  if (ggT != NULL)
660  {
661  p_LmFree(ggT, r);
662  p_LmFree(fp_p, r);
663  p_LmFree(fq_p, r);
664  }
665  ggt_deg = tmp_deg ; /*p_Deg(q, r);*/
666  ggT = q;
667  fp_p = q1;
668  fq_p = q2;
669  }
670  else
671  {
672  p_LmFree(q, r);
673  p_LmFree(q1, r);
674  p_LmFree(q2, r);
675  }
676  }
677  iter=iter->next;
678  }
679  if(ggT!=NULL)
680  {
681  int dq =p_Totaldegree(fq_p,r);
682  if (dq!=0)
683  {
684  fq=maPoly_InsertMonomial(mp, fq_p, r, NULL);
685  fp=maPoly_InsertMonomial(mp, fp_p, r, NULL);
686  return maPoly_InsertMonomial(mp, ggT, r, NULL);
687  }
688  else
689  {
690  fq=NULL;
691  p_LmFree(fq_p, r);
692  p_LmFree(ggT, r);
693  fp=maPoly_InsertMonomial(mp, fp_p, r, NULL);
694  choice->ref++;
695  return choice;
696  }
697  }
698  else
699  {
700  return NULL;
701  }
702 }
703 
704 /********************************************************************
705  ** *
706  * maPoly_Optimize *
707  * adds and integrates subexpressions *
708  *******************************************************************/
709 
710 void maPoly_Optimize(mapoly mpoly, ring src_r)
711 {
712  assume(mpoly!=NULL && mpoly->src!=NULL);
713  mapoly iter = mpoly;
714  mapoly choice;
715  mapoly ggT=NULL;
716  mapoly fp=NULL;
717  mapoly fq=NULL;
718  while (iter->next!=NULL)
719  {
720  choice=iter->next;
721  if ( /*(*/ iter->f1==NULL /*)*/ )
722  {
723  ggT=maFindBestggT(iter, choice, fp, fq,src_r);
724  if (choice!=NULL)
725  {
726  assume(iter->f1==NULL);
727  assume(iter->f2==NULL);
728  iter->f1=fp;
729  iter->f2=ggT;
730  if (fq!=NULL)
731  {
732  ggT->ref++;
733  choice->f1=fq;
734  choice->f2=ggT;
735  }
736  }
737  else assume(ggT==NULL);
738  }
739  iter=iter->next;
740  }
741 }
int BOOLEAN
Definition: auxiliary.h:87
#define TRUE
Definition: auxiliary.h:100
#define FALSE
Definition: auxiliary.h:96
#define PDEBUG
Definition: auxiliary.h:170
static int si_min(const int a, const int b)
Definition: auxiliary.h:125
CanonicalForm FACTORY_PUBLIC pp(const CanonicalForm &)
CanonicalForm pp ( const CanonicalForm & f )
Definition: cf_gcd.cc:676
int l
Definition: cfEzgcd.cc:100
int i
Definition: cfEzgcd.cc:132
int p
Definition: cfModGcd.cc:4078
CanonicalForm fp
Definition: cfModGcd.cc:4102
#define Print
Definition: emacs.cc:80
CFFListIterator iter
Definition: facAbsBiFact.cc:53
CanonicalForm res
Definition: facAbsFact.cc:60
int j
Definition: facHensel.cc:110
void maMonomial_Destroy(mapoly mp, ring src_r, ring dest_r)
Definition: fast_maps.cc:154
ideal fast_map_common_subexp(const ideal map_id, const ring map_r, const ideal image_id, const ring image_r)
Definition: fast_maps.cc:354
void maMap_CreateRings(ideal map_id, ring map_r, ideal image_id, ring image_r, ring &src_r, ring &dest_r, BOOLEAN &simple)
Definition: fast_maps.cc:281
static poly maGetMaxExpP(poly *max_map_monomials, int n_max_map_monomials, ring map_r, poly pi_m, ring pi_r)
Definition: fast_maps.cc:34
STATIC_VAR omBin macoeffBin
Definition: fast_maps.cc:135
static poly maEggT(const poly m1, const poly m2, poly &q1, poly &q2, const ring r)
Definition: fast_maps.cc:586
void maMap_CreatePolyIdeal(ideal map_id, ring map_r, ring src_r, ring dest_r, mapoly &mp, maideal &mideal)
Definition: fast_maps.cc:255
void maPoly_GetLength(mapoly mp, int &length)
Definition: fast_maps.cc:338
mapoly maPoly_InsertMonomial(mapoly &into, mapoly what, ring src_r)
Definition: fast_maps.cc:184
static void maPoly_InsertPoly(mapoly &into, poly what, ring src_r, sBucket_pt bucket)
Definition: fast_maps.cc:238
mapoly maMonomial_Create(poly p, ring, sBucket_pt bucket)
Definition: fast_maps.cc:137
ideal maIdeal_2_Ideal(maideal m_id, ring)
Definition: fast_maps.cc:323
static poly maPoly_EvalMon(poly src, ring src_r, poly *dest_id, ring dest_r)
Definition: fast_maps.cc:456
static int maPoly_Substitute(macoeff c, poly p, ring dest_r)
Definition: fast_maps.cc:436
static mapoly maFindBestggT(mapoly mp, mapoly &choice, mapoly &fp, mapoly &fq, const ring r)
Definition: fast_maps.cc:635
static unsigned long maGetMaxExp(ideal pi_id, ring pi_r, ideal map_id, ring map_r)
Definition: fast_maps.cc:63
void maPoly_Eval(mapoly root, ring src_r, ideal dest_id, ring dest_r, int total_cost)
Definition: fast_maps.cc:495
STATIC_VAR omBin mapolyBin
Definition: fast_maps.cc:134
static void maMap_KillRings(ring map_r, ring image_r, ring src_r, ring dest_r)
Definition: fast_maps.cc:310
void maPoly_Optimize(mapoly mpoly, ring src_r)
Definition: fast_maps.cc:710
class macoeff_s * macoeff
Definition: fast_maps.h:22
void maMonomial_Out(mapoly monomial, ring src_r, ring dest_r=NULL)
class maideal_s * maideal
Definition: fast_maps.h:23
void maPoly_Out(mapoly mpoly, ring src_ring, ring dest_r=NULL)
class mapoly_s * mapoly
Definition: fast_maps.h:21
mapoly maMonomial_Free(mapoly monomial, ring src_r, ring dest_r=NULL)
Definition: fast_maps.h:67
static int max(int a, int b)
Definition: fast_mult.cc:264
static BOOLEAN Equal(number a, number b, const coeffs)
Definition: flintcf_Q.cc:324
#define STATIC_VAR
Definition: globaldefs.h:7
#define idTest(id)
Definition: ideals.h:47
static bool Greater(mono_type m1, mono_type m2)
static BOOLEAN length(leftv result, leftv arg)
Definition: interval.cc:257
ListNode * next
Definition: janet.h:31
#define assume(x)
Definition: mod2.h:389
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
Definition: monomials.h:44
#define omFreeSize(addr, size)
Definition: omAllocDecl.h:260
#define omAlloc(size)
Definition: omAllocDecl.h:210
#define omAlloc0Bin(bin)
Definition: omAllocDecl.h:206
#define omFree(addr)
Definition: omAllocDecl.h:261
#define omAlloc0(size)
Definition: omAllocDecl.h:211
#define omFreeBin(addr, bin)
Definition: omAllocDecl.h:259
#define omGetSpecBin(size)
Definition: omBin.h:11
#define NULL
Definition: omList.c:12
omBin_t * omBin
Definition: omStructs.h:12
#define TEST_OPT_PROT
Definition: options.h:104
poly p_GetMaxExpP(poly p, const ring r)
return monomial r such that GetExp(r,i) is maximum of all monomials in p; coeff == 0,...
Definition: p_polys.cc:1138
poly p_ISet(long i, const ring r)
returns the poly representing the integer i
Definition: p_polys.cc:1297
long p_Deg(poly a, const ring r)
Definition: p_polys.cc:587
static poly p_Mult_q(poly p, poly q, const ring r)
Definition: p_polys.h:1116
static BOOLEAN p_IsConstantComp(const poly p, const ring r)
like the respective p_LmIs* routines, except that p might be empty
Definition: p_polys.h:1999
static long p_AddExp(poly p, int v, long ee, ring r)
Definition: p_polys.h:608
static unsigned long p_GetMaxExp(const unsigned long l, const ring r)
Definition: p_polys.h:783
#define __pp_Mult_nn(p, n, r)
Definition: p_polys.h:1004
static unsigned long p_SetExp(poly p, const unsigned long e, const unsigned long iBitmask, const int VarOffset)
set a single variable exponent @Note: VarOffset encodes the position in p->exp
Definition: p_polys.h:490
static void p_Setm(poly p, const ring r)
Definition: p_polys.h:235
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent @Note: the integer VarOffset encodes:
Definition: p_polys.h:471
#define p_LmCmpAction(p, q, r, actionE, actionG, actionS)
Definition: p_polys.h:1721
static void p_Delete(poly *p, const ring r)
Definition: p_polys.h:903
static unsigned pLength(poly a)
Definition: p_polys.h:191
static void p_LmFree(poly p, ring)
Definition: p_polys.h:685
static poly p_Init(const ring r, omBin bin)
Definition: p_polys.h:1322
static poly p_Copy(poly p, const ring r)
returns a copy of p
Definition: p_polys.h:848
static long p_Totaldegree(poly p, const ring r)
Definition: p_polys.h:1509
void p_wrp(poly p, ring lmRing, ring tailRing)
Definition: polys0.cc:373
poly prShallowCopyR(poly p, ring r, ring dest_r)
Definition: prCopy.cc:117
ideal idrShallowCopyR(ideal id, ring src_r, ring dest_r)
Definition: prCopy.cc:220
poly prShallowCopyR_NoSort(poly p, ring r, ring dest_r)
Definition: prCopy.cc:112
void PrintS(const char *s)
Definition: reporter.cc:284
void PrintLn()
Definition: reporter.cc:310
ring rModifyRing_Wp(ring r, int *weights)
construct Wp, C ring
Definition: ring.cc:2987
void rKillModifiedRing(ring r)
Definition: ring.cc:3101
void rKillModified_Wp_Ring(ring r)
Definition: ring.cc:3111
ring rModifyRing_Simple(ring r, BOOLEAN ommit_degree, BOOLEAN ommit_comp, unsigned long exp_limit, BOOLEAN &simple)
Definition: ring.cc:3035
static BOOLEAN rField_is_Domain(const ring r)
Definition: ring.h:488
#define rField_is_Ring(R)
Definition: ring.h:486
void sBucket_Add_p(sBucket_pt bucket, poly p, int length)
adds poly p to bucket destroys p!
Definition: sbuckets.cc:203
sBucket_pt sBucketCreate(const ring r)
Definition: sbuckets.cc:96
void sBucketDestroyAdd(sBucket_pt bucket, poly *p, int *length)
Definition: sbuckets.h:68
ideal idInit(int idsize, int rank)
initialise an ideal / module
Definition: simpleideals.cc:35
void id_ShallowDelete(ideal *h, ring r)
Shallowdeletes an ideal/matrix.
#define IDELEMS(i)
Definition: simpleideals.h:23