My Project  debian-1:4.1.2-p1+ds-2
Public Member Functions | Data Fields
sLObject Class Reference

#include <kutil.h>

Public Member Functions

KINLINE void Init (ring tailRing=currRing)
 
KINLINE sLObject (ring tailRing=currRing)
 
KINLINE sLObject (poly p, ring tailRing=currRing)
 
KINLINE sLObject (poly p, ring c_r, ring tailRing)
 
KINLINE void Delete ()
 
KINLINE void Clear ()
 
KINLINE void LmDeleteAndIter ()
 
KINLINE poly LmExtractAndIter ()
 
KINLINE void PrepareRed (BOOLEAN use_bucket)
 
KINLINE void SetLmTail (poly lm, poly new_p, int length, int use_bucket, ring r)
 
KINLINE void Tail_Minus_mm_Mult_qq (poly m, poly qq, int lq, poly spNoether)
 
KINLINE void Tail_Mult_nn (number n)
 
KINLINE poly GetP (omBin lmBin=(omBin) NULL)
 
KINLINE poly GetTP ()
 
KINLINE void CanonicalizeP ()
 
KINLINE void Copy ()
 
KINLINE int GetpLength ()
 
KINLINE long pLDeg (BOOLEAN use_last)
 
KINLINE long pLDeg ()
 
KINLINE int SetLength (BOOLEAN lengt_pLength=FALSE)
 
KINLINE long SetDegStuffReturnLDeg ()
 
KINLINE long SetDegStuffReturnLDeg (BOOLEAN use_last)
 
KINLINE long MinComp ()
 
KINLINE long Comp ()
 
KINLINE void ShallowCopyDelete (ring new_tailRing, pShallowCopyDeleteProc p_shallow_copy_delete)
 
KINLINE void SetShortExpVector ()
 
KINLINE sLObjectoperator= (const sTObject &)
 
KINLINE TObjectT_1 (const skStrategy *strat)
 
KINLINE TObjectT_2 (const skStrategy *strat)
 
KINLINE void T_1_2 (const skStrategy *strat, TObject *&T_1, TObject *&T_2)
 
KINLINE void Normalize ()
 
KINLINE void HeadNormalize ()
 
- Public Member Functions inherited from sTObject
KINLINE void Init (ring r=currRing)
 
KINLINE sTObject (ring tailRing=currRing)
 
KINLINE sTObject (poly p, ring tailRing=currRing)
 
KINLINE sTObject (poly p, ring c_r, ring tailRing)
 
KINLINE sTObject (sTObject *T, int copy)
 
KINLINE void Set (ring r=currRing)
 
KINLINE void Set (poly p_in, ring r=currRing)
 
KINLINE void Set (poly p_in, ring c_r, ring t_r)
 
KINLINE void Delete ()
 
KINLINE void Clear ()
 
KINLINE void Copy ()
 
KINLINE poly GetLmCurrRing ()
 
KINLINE poly GetLmTailRing ()
 
KINLINE poly GetLm (ring r)
 
KINLINE void GetLm (poly &p, ring &r) const
 
KINLINE BOOLEAN IsNull () const
 
KINLINE int GetpLength ()
 
KINLINE void SetLmCurrRing ()
 
KINLINE poly Next ()
 
KINLINE void LmDeleteAndIter ()
 
KINLINE long pTotalDeg () const
 
KINLINE long pFDeg () const
 
KINLINE long SetpFDeg ()
 
KINLINE long GetpFDeg () const
 
KINLINE long pLDeg ()
 
KINLINE long SetDegStuffReturnLDeg ()
 
KINLINE void Mult_nn (number n)
 
KINLINE void ShallowCopyDelete (ring new_tailRing, omBin new_tailBin, pShallowCopyDeleteProc p_shallow_copy_delete, BOOLEAN set_max=TRUE)
 
KINLINE void pNorm ()
 
KINLINE void pCleardenom ()
 

Data Fields

unsigned long sev
 
poly p1
 
poly p2
 
poly lcm
 
kBucket_pt bucket
 
int i_r1
 
int i_r2
 
unsigned checked
 
BOOLEAN prod_crit
 
- Data Fields inherited from sTObject
unsigned long sevSig
 
poly sig
 
poly p
 
poly t_p
 
poly max_exp
 
ring tailRing
 
long FDeg
 
int ecart
 
int length
 
int pLength
 
int i_r
 
int shift
 
char is_normalized
 
char is_redundant
 
char is_sigsafe
 
char is_special
 

Detailed Description

Definition at line 177 of file kutil.h.

Constructor & Destructor Documentation

◆ sLObject() [1/3]

KINLINE sLObject::sLObject ( ring  tailRing = currRing)

Definition at line 546 of file kInline.h.

549 {

◆ sLObject() [2/3]

KINLINE sLObject::sLObject ( poly  p,
ring  tailRing = currRing 
)

Definition at line 550 of file kInline.h.

553 {
554  Init(r);

◆ sLObject() [3/3]

KINLINE sLObject::sLObject ( poly  p,
ring  c_r,
ring  tailRing 
)

Definition at line 556 of file kInline.h.

559 {
560  Init(t_r);

Member Function Documentation

◆ CanonicalizeP()

KINLINE void sLObject::CanonicalizeP ( )

Definition at line 371 of file kInline.h.

373 {
374  if (bucket != NULL)

◆ Clear()

KINLINE void sLObject::Clear ( )

Definition at line 525 of file kInline.h.

528 {
529  sTObject::Clear();

◆ Comp()

KINLINE long sLObject::Comp ( )

Definition at line 839 of file kInline.h.

842 {
843  poly pp;
844  ring r;
845  GetLm(pp, r);
846  assume(pp != NULL);

◆ Copy()

KINLINE void sLObject::Copy ( )

Definition at line 746 of file kInline.h.

749 {
750  if (bucket != NULL)
751  {
753  kBucket_pt new_bucket = kBucketCreate(tailRing);
754  kBucketInit(new_bucket,
755  p_Copy(bucket->buckets[i], tailRing),
756  bucket->buckets_length[i]);
757  bucket = new_bucket;
758  if (t_p != NULL) pNext(t_p) = NULL;
759  if (p != NULL) pNext(p) = NULL;
760  }

◆ Delete()

KINLINE void sLObject::Delete ( )

Definition at line 531 of file kInline.h.

534 {
536  if (bucket != NULL)

◆ GetP()

KINLINE poly sLObject::GetP ( omBin  lmBin = (omBin)NULL)

Definition at line 696 of file kInline.h.

699 {
700  //kTest_L(this);
701  if (p == NULL)
702  {
704  (lmBin!=NULL?lmBin:currRing->PolyBin));
705  FDeg = pFDeg();
706  }
707  else if (lmBin != NULL && lmBin != currRing->PolyBin)
708  {
710  FDeg = pFDeg();
711  }
712 
713  if (bucket != NULL)
714  {
717  pLength++;
718  if (t_p != NULL) pNext(t_p) = pNext(p);
719  }
720  //kTest_L(this);

◆ GetpLength()

KINLINE int sLObject::GetpLength ( )

Definition at line 807 of file kInline.h.

810 {
811  if (bucket == NULL)
812  return sTObject::GetpLength();

◆ GetTP()

KINLINE poly sLObject::GetTP ( )

Definition at line 680 of file kInline.h.

683 {
684  //kTest_L(this);
685  poly tp = GetLmTailRing();
686  assume(tp != NULL);
687 
688  if (bucket != NULL)
689  {
690  kBucketClear(bucket, &pNext(tp), &pLength);
692  pLength++;
693  }

◆ HeadNormalize()

KINLINE void sLObject::HeadNormalize ( )

Definition at line 377 of file kInline.h.

379 {
380  if (t_p != NULL)
381  {
383  if (p != NULL) pSetCoeff0(p, pGetCoeff(t_p));
384  }
385  else
386  {
388  }

◆ Init()

KINLINE void sLObject::Init ( ring  tailRing = currRing)

Definition at line 538 of file kInline.h.

541 {
542  memset(this, 0, sizeof(sLObject));
543  i_r1 = -1;
544  i_r2 = -1;
545  i_r = -1;

◆ LmDeleteAndIter()

KINLINE void sLObject::LmDeleteAndIter ( )

Definition at line 634 of file kInline.h.

637 {
639  if (bucket != NULL)
640  {
641  poly _p = kBucketExtractLm(bucket);
642  if (_p == NULL)
643  {
645  p = t_p = NULL;
646  return;
647  }
648  Set(_p, tailRing);
649  }
650  else
651  {
652  pLength--;

◆ LmExtractAndIter()

KINLINE poly sLObject::LmExtractAndIter ( )

Definition at line 654 of file kInline.h.

657 {
658  poly ret = GetLmTailRing();
659  poly pn;
660 
661  assume(p != NULL || t_p != NULL);
662 
663  if (bucket != NULL)
664  {
665  pn = kBucketExtractLm(bucket);
666  if (pn == NULL)
668  }
669  else
670  {
671  pn = pNext(ret);
672  }
673  pLength--;
674  pNext(ret) = NULL;
675  if (p != NULL && t_p != NULL)
676  p_LmFree(p, currRing);
677 
678  Set(pn, tailRing);

◆ MinComp()

KINLINE long sLObject::MinComp ( )

Definition at line 824 of file kInline.h.

827 {
828  poly tp = GetLmTailRing();
829  assume(tp != NULL);
830  if (bucket != NULL)
831  {
833  pNext(tp) = bucket->buckets[i];
834  long m = p_MinComp(tp, tailRing);
835  pNext(tp) = NULL;
836  return m;
837  }
838  else

◆ Normalize()

KINLINE void sLObject::Normalize ( )

Definition at line 357 of file kInline.h.

359 {
360  if (t_p != NULL)
361  {
362  pNormalize(t_p);
363  if (p != NULL) pSetCoeff0(p, pGetCoeff(t_p));
364  }
365  else
366  {
367  pNormalize(p);
368  }

◆ operator=()

KINLINE sLObject & sLObject::operator= ( const sTObject t)

Definition at line 848 of file kInline.h.

851 {
852  memset(this, 0, sizeof(*this));
853  memcpy(this, &t, sizeof(sTObject));

◆ pLDeg() [1/2]

KINLINE long sLObject::pLDeg ( )

Definition at line 762 of file kInline.h.

765 {
766  poly tp = GetLmTailRing();
767  assume(tp != NULL);
768  if (bucket != NULL)
769  {
771  pNext(tp) = bucket->buckets[i];
772  long ldeg = tailRing->pLDeg(tp, &length, tailRing);
773  pNext(tp) = NULL;
774  return ldeg;
775  }
776  else

◆ pLDeg() [2/2]

KINLINE long sLObject::pLDeg ( BOOLEAN  use_last)

Definition at line 777 of file kInline.h.

780 {
781  if (! deg_last || bucket != NULL) return sLObject::pLDeg();
782 
783  long ldeg;
784  ldeg = tailRing->pLDeg(GetLmTailRing(), &length, tailRing);
785 #ifndef SING_NDEBUG
786  if ( pLength == 0)
789 #else
790  pLength=length;
791 #endif

◆ PrepareRed()

KINLINE void sLObject::PrepareRed ( BOOLEAN  use_bucket)

Definition at line 562 of file kInline.h.

565 {
566  if (bucket == NULL)
567  {
568  unsigned l = GetpLength();
569  if (use_bucket && (l > 1))
570  {
571  poly tp = GetLmTailRing();
572  assume(l == ::pLength(tp));
574  kBucketInit(bucket, pNext(tp), l-1);
575  pNext(tp) = NULL;
576  if (p != NULL) pNext(p) = NULL;
577  pLength = 0;
578  }

◆ SetDegStuffReturnLDeg() [1/2]

KINLINE long sLObject::SetDegStuffReturnLDeg ( )

Definition at line 793 of file kInline.h.

796 {
797  FDeg = this->pFDeg();
798  long d = this->pLDeg();
799  ecart = d - FDeg;

◆ SetDegStuffReturnLDeg() [2/2]

KINLINE long sLObject::SetDegStuffReturnLDeg ( BOOLEAN  use_last)

Definition at line 800 of file kInline.h.

803 {
804  FDeg = this->pFDeg();
805  long d = this->pLDeg(use_last);
806  ecart = d - FDeg;

◆ SetLength()

KINLINE int sLObject::SetLength ( BOOLEAN  lengt_pLength = FALSE)

Definition at line 814 of file kInline.h.

817 {
818  if (length_pLength)
819  {
820  length = this->GetpLength();
821  }
822  else
823  this->pLDeg();

◆ SetLmTail()

KINLINE void sLObject::SetLmTail ( poly  lm,
poly  new_p,
int  length,
int  use_bucket,
ring  r 
)

Definition at line 580 of file kInline.h.

583 {
584 
585  Set(lm, _tailRing);
586  if (use_bucket)
587  {
588  bucket = kBucketCreate(_tailRing);
589  kBucketInit(bucket, p_tail, p_Length);
590  pNext(lm) = NULL;
591  pLength = 0;
592  }
593  else
594  {
595  pNext(lm) = p_tail;
596  pLength = p_Length + 1;

◆ SetShortExpVector()

KINLINE void sLObject::SetShortExpVector ( )

Definition at line 734 of file kInline.h.

737 {
738  if (t_p != NULL)
739  {
741  }
742  else
743  {

◆ ShallowCopyDelete()

KINLINE void sLObject::ShallowCopyDelete ( ring  new_tailRing,
pShallowCopyDeleteProc  p_shallow_copy_delete 
)

Definition at line 723 of file kInline.h.

727 {
728  if (bucket != NULL)
729  kBucketShallowCopyDelete(bucket, new_tailRing, new_tailRing->PolyBin,
730  p_shallow_copy_delete);
731  sTObject::ShallowCopyDelete(new_tailRing,
732  new_tailRing->PolyBin,p_shallow_copy_delete,

◆ T_1()

KINLINE TObject * sLObject::T_1 ( const skStrategy strat)

Definition at line 855 of file kInline.h.

858 {
859  if (p1 == NULL) return NULL;
860  if (i_r1 == -1) i_r1 = kFindInT(p1, s->T, s->tl);
861  assume(i_r1 >= 0 && i_r1 <= s->tl);
862  TObject* T = s->R[i_r1];
863  assume(T->p == p1);

◆ T_1_2()

KINLINE void sLObject::T_1_2 ( const skStrategy strat,
TObject *&  T_1,
TObject *&  T_2 
)

Definition at line 876 of file kInline.h.

880 {
881  if (p1 == NULL)
882  {
883  T_1 = NULL;
884  T_2 = NULL;
885  return;
886  }
887  assume(p1 != NULL && p2 != NULL);
888  if (i_r1 == -1) i_r1 = kFindInT(p1, strat->T, strat->tl);
889  if (i_r2 == -1) i_r2 = kFindInT(p2, strat->T, strat->tl);
890  assume(i_r1 >= 0 && i_r1 <= strat->tl);
891  assume(i_r2 >= 0 && i_r2 <= strat->tl);
892  T_1 = strat->R[i_r1];
893  T_2 = strat->R[i_r2];
894  assume(T_1->p == p1);
895  assume(T_2->p == p2);

◆ T_2()

KINLINE TObject * sLObject::T_2 ( const skStrategy strat)

Definition at line 865 of file kInline.h.

868 {
869  if (p1 == NULL) return NULL;
870  assume(p2 != NULL);
871  if (i_r2 == -1) i_r2 = kFindInT(p2, strat->T, strat->tl);
872  assume(i_r2 >= 0 && i_r2 <= strat->tl);
873  TObject* T = strat->R[i_r2];
874  assume(T->p == p2);

◆ Tail_Minus_mm_Mult_qq()

KINLINE void sLObject::Tail_Minus_mm_Mult_qq ( poly  m,
poly  qq,
int  lq,
poly  spNoether 
)

Definition at line 612 of file kInline.h.

616 {
617  if (bucket != NULL)
618  {
619  kBucket_Minus_m_Mult_p(bucket, m, q, &lq, spNoether);
620  }
621  else
622  {
623  if (lq<=0) lq= ::pLength(q);
624  poly _p = (t_p != NULL ? t_p : p);
625  assume(_p != NULL);
626 
627  int lp=pLength-1;
628  pNext(_p) = p_Minus_mm_Mult_qq( pNext(_p), m, q, lp, lq,
629  spNoether, tailRing );
630  pLength=lp+1;
631 // tailRing->p_Procs->p_Minus_mm_Mult_qq(pNext(_p), m, q, shorter,spNoether, tailRing, last);
632 // pLength += lq - shorter;

◆ Tail_Mult_nn()

KINLINE void sLObject::Tail_Mult_nn ( number  n)

Definition at line 598 of file kInline.h.

601 {
602  if (bucket != NULL)
603  {
605  }
606  else
607  {
608  poly _p = (t_p != NULL ? t_p : p);
609  assume(_p != NULL);
610  pNext(_p) = __p_Mult_nn(pNext(_p), n, tailRing);

Field Documentation

◆ bucket

kBucket_pt sLObject::bucket

Definition at line 186 of file kutil.h.

◆ checked

unsigned sLObject::checked

Definition at line 188 of file kutil.h.

◆ i_r1

int sLObject::i_r1

Definition at line 187 of file kutil.h.

◆ i_r2

int sLObject::i_r2

Definition at line 187 of file kutil.h.

◆ lcm

poly sLObject::lcm

Definition at line 185 of file kutil.h.

◆ p1

poly sLObject::p1

Definition at line 182 of file kutil.h.

◆ p2

poly sLObject::p2

Definition at line 182 of file kutil.h.

◆ prod_crit

BOOLEAN sLObject::prod_crit

Definition at line 193 of file kutil.h.

◆ sev

unsigned long sLObject::sev

Definition at line 181 of file kutil.h.


The documentation for this class was generated from the following files:
sLObject::i_r2
int i_r2
Definition: kutil.h:187
k_LmInit_tailRing_2_currRing
KINLINE poly k_LmInit_tailRing_2_currRing(poly t_p, ring tailRing, omBin lmBin)
Definition: kInline.h:911
kBucketCanonicalize
int kBucketCanonicalize(kBucket_pt bucket)
Canonicalizes Bpoly, i.e. converts polys of buckets into one poly in one bucket: Returns number of bu...
sTObject::Delete
KINLINE void Delete()
Definition: kInline.h:209
nNormalize
#define nNormalize(n)
Definition: numbers.h:29
sLObject::sev
unsigned long sev
Definition: kutil.h:181
sTObject::pFDeg
KINLINE long pFDeg() const
Definition: kInline.h:432
TObject
class sTObject TObject
Definition: kutil.h:52
sTObject::FDeg
long FDeg
Definition: kutil.h:72
lq
Definition: lq.h:38
sTObject::length
int length
Definition: kutil.h:73
skStrategy::R
TObject ** R
Definition: kutil.h:337
p_Minus_mm_Mult_qq
static poly p_Minus_mm_Mult_qq(poly p, const poly m, const poly q, int &lp, int lq, const poly spNoether, const ring r)
Definition: p_polys.h:994
sTObject::LmDeleteAndIter
KINLINE void LmDeleteAndIter()
Definition: kInline.h:323
sTObject
Definition: kutil.h:63
sLObject
Definition: kutil.h:177
p_LmShallowCopyDelete
static poly p_LmShallowCopyDelete(poly p, const ring r)
Definition: p_polys.h:1315
__p_Mult_nn
#define __p_Mult_nn(p, n, r)
Definition: p_polys.h:915
sLObject::pLDeg
KINLINE long pLDeg()
Definition: kInline.h:762
sTObject::Set
KINLINE void Set(ring r=currRing)
Definition: kInline.h:105
sTObject::GetpLength
KINLINE int GetpLength()
Definition: kInline.h:303
p_Copy
static poly p_Copy(poly p, const ring r)
returns a copy of p
Definition: p_polys.h:796
sTObject::Clear
KINLINE void Clear()
Definition: kInline.h:223
sTObject::t_p
poly t_p
Definition: kutil.h:69
p_MinComp
static long p_MinComp(poly p, ring lmRing, ring tailRing)
Definition: p_polys.h:303
kBucketExtractLm
poly kBucketExtractLm(kBucket_pt bucket)
Definition: kbuckets.cc:510
i
int i
Definition: cfEzgcd.cc:125
sTObject::ShallowCopyDelete
KINLINE void ShallowCopyDelete(ring new_tailRing, omBin new_tailBin, pShallowCopyDeleteProc p_shallow_copy_delete, BOOLEAN set_max=TRUE)
Definition: kInline.h:391
sLObject::T_2
KINLINE TObject * T_2(const skStrategy *strat)
Definition: kInline.h:865
kBucketDestroy
void kBucketDestroy(kBucket_pt *bucket_pt)
Definition: kbuckets.cc:215
skStrategy::T
TSet T
Definition: kutil.h:321
kBucketNormalize
void kBucketNormalize(kBucket_pt bucket)
apply n_Normalize to all coefficients
kBucketInit
void kBucketInit(kBucket_pt bucket, poly lm, int length)
Definition: kbuckets.cc:492
kBucket_Minus_m_Mult_p
void kBucket_Minus_m_Mult_p(kBucket_pt bucket, poly m, poly p, int *l, poly spNoether)
Bpoly == Bpoly - m*p; where m is a monom Does not destroy p and m assume (*l <= 0 || pLength(p) == *l...
Definition: kbuckets.cc:715
kBucket_Mult_n
void kBucket_Mult_n(kBucket_pt bucket, number n)
Multiply Bucket by number ,i.e. Bpoly == n*Bpoly.
Definition: kbuckets.cc:597
kBucketShallowCopyDelete
void kBucketShallowCopyDelete(kBucket_pt bucket, ring new_tailRing, omBin new_tailBin, pShallowCopyDeleteProc p_shallow_copy_delete)
For changing the ring of the Bpoly to new_tailBin.
Definition: kbuckets.cc:534
p_Last
poly p_Last(const poly p, int &l, const ring r)
Definition: p_polys.cc:4523
T
STATIC_VAR jList * T
Definition: janet.cc:30
pp
CanonicalForm pp(const CanonicalForm &)
CanonicalForm pp ( const CanonicalForm & f )
Definition: cf_gcd.cc:248
sTObject::pLength
int pLength
Definition: kutil.h:73
kBucketClear
void kBucketClear(kBucket_pt bucket, poly *p, int *length)
Definition: kbuckets.cc:520
sTObject::i_r
int i_r
Definition: kutil.h:73
sLObject::p1
poly p1
Definition: kutil.h:182
kFindInT
int kFindInT(poly p, TSet T, int tlength)
returns index of p in TSet, or -1 if not found
Definition: kutil.cc:710
p_LmFree
static void p_LmFree(poly p, ring)
Definition: p_polys.h:669
sTObject::ecart
int ecart
Definition: kutil.h:73
sLObject::p2
poly p2
Definition: kutil.h:182
sLObject::T_1
KINLINE TObject * T_1(const skStrategy *strat)
Definition: kInline.h:855
sTObject::GetLmTailRing
KINLINE poly GetLmTailRing()
Definition: kInline.h:259
p_Length
p_Length
Definition: p_Procs_Impl.h:117
sLObject::GetpLength
KINLINE int GetpLength()
Definition: kInline.h:807
pSetCoeff0
#define pSetCoeff0(p, n)
Definition: monomials.h:56
m
int m
Definition: cfEzgcd.cc:121
skStrategy::tl
int tl
Definition: kutil.h:347
assume
#define assume(x)
Definition: mod2.h:384
NULL
#define NULL
Definition: omList.c:11
l
int l
Definition: cfEzgcd.cc:93
sTObject::p
poly p
Definition: kutil.h:68
kBucket
Definition: kbuckets.h:177
sLObject::i_r1
int i_r1
Definition: kutil.h:187
sLObject::bucket
kBucket_pt bucket
Definition: kutil.h:186
kBucketCreate
kBucket_pt kBucketCreate(const ring bucket_ring)
Creation/Destruction of buckets.
Definition: kbuckets.cc:208
currRing
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Definition: polys.cc:13
s
const CanonicalForm int s
Definition: facAbsFact.cc:55
rIsSyzIndexRing
static BOOLEAN rIsSyzIndexRing(const ring r)
Definition: ring.h:714
sLObject::Init
KINLINE void Init(ring tailRing=currRing)
Definition: kInline.h:538
pNormalize
#define pNormalize(p)
Definition: polys.h:301
sTObject::tailRing
ring tailRing
Definition: kutil.h:71
pGetCoeff
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
Definition: monomials.h:41
sTObject::GetLm
KINLINE poly GetLm(ring r)
Definition: kInline.h:272
p_GetShortExpVector
unsigned long p_GetShortExpVector(const poly p, const ring r)
Definition: p_polys.cc:4682
pNext
#define pNext(p)
Definition: monomials.h:33