MCPcopy Create free account
hub / github.com/Singular/Singular / buildTermAndAdd

Function buildTermAndAdd

kernel/fast_mult.cc:487–524  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

485}
486#endif
487static void buildTermAndAdd(int /*n*/,number* /*facult*/,poly* /*f_terms*/,int* exp,int f_len,kBucket_pt /*erg_bucket*/,ring r, number coef, poly & zw, poly /*tmp*/, poly** term_pot){
488
489 int i;
490 // poly term=p_Init(r);
491
492 // number denom=n_Init(1,r);
493// for(i=0;i<f_len;i++){
494// if(exp[i]!=0){
495// number trash=denom;
496// denom=n_Mult(denom,facult[exp[i]],r);
497// n_Delete(&trash,r);
498// }
499
500// }
501// number coef=n_IntDiv(facult[n],denom,r); //right function here?
502// n_Delete(&denom,r);
503// poly erg=p_NSet(coef,r);
504 poly erg=p_Init(r,lm_bin);
505 p_SetCoeff0(erg, coef,r);
506 //p_NSet(n_Copy(coef,r),r);
507 for(i=0;i<f_len;i++){
508 if(exp[i]!=0){
509 ///poly term=p_Copy(f_terms[i],r);
510 poly term=term_pot[i][exp[i]];
511 //tmp;
512 //p_ExpVectorCopy(term,f_terms[i],r);
513 //p_SetCoeff(term, n_Copy(p_GetCoeff(f_terms[i],r),r),r);
514
515 //term->next=NULL;
516
517 //p_MonPowerMB(term, exp[i],r);
518 p_MonMultMB(erg,term,r);
519 //p_Delete(&term,r);
520 }
521
522 }
523 zw=erg;
524}
525
526
527

Callers 1

MC_iterateFunction · 0.85

Calls 2

p_InitFunction · 0.85
p_MonMultMBFunction · 0.85

Tested by

no test coverage detected