My Project  debian-1:4.1.1-p2+ds-4build1
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 poly 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
 
char is_normalized
 
char is_redundant
 
char is_sigsafe
 
char is_special
 

Detailed Description

Definition at line 172 of file kutil.h.

Constructor & Destructor Documentation

◆ sLObject() [1/3]

KINLINE sLObject::sLObject ( ring  tailRing = currRing)

Definition at line 504 of file kInline.h.

◆ sLObject() [2/3]

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

Definition at line 508 of file kInline.h.

509 {
510  Init(r);
511 }
512 KINLINE sLObject::sLObject(poly p_in, ring r)

◆ sLObject() [3/3]

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

Definition at line 514 of file kInline.h.

519 {

Member Function Documentation

◆ CanonicalizeP()

KINLINE poly sLObject::CanonicalizeP ( )

Definition at line 638 of file kInline.h.

643 {
644  //kTest_L(this);
645  int i = -1;
646 
647  if (bucket != NULL)
649 
650  if (p == NULL)

◆ Clear()

KINLINE void sLObject::Clear ( )

Definition at line 483 of file kInline.h.

488 {

◆ Comp()

KINLINE long sLObject::Comp ( )

Definition at line 812 of file kInline.h.

817 {
818  poly pp;
819  ring r;

◆ Copy()

KINLINE void sLObject::Copy ( )

Definition at line 719 of file kInline.h.

724 {
725  if (bucket != NULL)
726  {
728  kBucket_pt new_bucket = kBucketCreate(tailRing);
729  kBucketInit(new_bucket,
730  p_Copy(bucket->buckets[i], tailRing),
731  bucket->buckets_length[i]);
732  bucket = new_bucket;
733  if (t_p != NULL) pNext(t_p) = NULL;

◆ Delete()

KINLINE void sLObject::Delete ( )

Definition at line 489 of file kInline.h.

494 {

◆ GetP()

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

Definition at line 669 of file kInline.h.

674 {
675  //kTest_L(this);
676  if (p == NULL)
677  {
679  (lmBin!=NULL?lmBin:currRing->PolyBin));
680  FDeg = pFDeg();
681  }
682  else if (lmBin != NULL && lmBin != currRing->PolyBin)
683  {
685  FDeg = pFDeg();
686  }
687 
688  if (bucket != NULL)
689  {
692  pLength++;
693  if (t_p != NULL) pNext(t_p) = pNext(p);

◆ GetpLength()

KINLINE int sLObject::GetpLength ( )

Definition at line 780 of file kInline.h.

785 {
786  if (bucket == NULL)

◆ GetTP()

KINLINE poly sLObject::GetTP ( )

Definition at line 653 of file kInline.h.

658 {
659  //kTest_L(this);
660  poly tp = GetLmTailRing();
661  assume(tp != NULL);
662 
663  if (bucket != NULL)
664  {
665  kBucketClear(bucket, &pNext(tp), &pLength);

◆ HeadNormalize()

KINLINE void sLObject::HeadNormalize ( )

Definition at line 335 of file kInline.h.

339 {
340  if (t_p != NULL)
341  {
343  if (p != NULL) pSetCoeff0(p, pGetCoeff(t_p));
344  }
345  else
346  {

◆ Init()

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

Definition at line 496 of file kInline.h.

501 {
502  memset(this, 0, sizeof(sLObject));
503  i_r1 = -1;

◆ LmDeleteAndIter()

KINLINE void sLObject::LmDeleteAndIter ( )

Definition at line 592 of file kInline.h.

597 {
599  if (bucket != NULL)
600  {
601  poly _p = kBucketExtractLm(bucket);
602  if (_p == NULL)
603  {
605  p = t_p = NULL;
606  return;
607  }
608  Set(_p, tailRing);
609  }
610  else

◆ LmExtractAndIter()

KINLINE poly sLObject::LmExtractAndIter ( )

Definition at line 612 of file kInline.h.

617 {
618  poly ret = GetLmTailRing();
619  poly pn;
620 
621  assume(p != NULL || t_p != NULL);
622 
623  if (bucket != NULL)
624  {
625  pn = kBucketExtractLm(bucket);
626  if (pn == NULL)
628  }
629  else
630  {
631  pn = pNext(ret);
632  }
633  pLength--;
634  pNext(ret) = NULL;
635  if (p != NULL && t_p != NULL)
636  p_LmFree(p, currRing);

◆ MinComp()

KINLINE long sLObject::MinComp ( )

Definition at line 797 of file kInline.h.

802 {
803  poly tp = GetLmTailRing();
804  assume(tp != NULL);
805  if (bucket != NULL)
806  {
808  pNext(tp) = bucket->buckets[i];
809  long m = p_MinComp(tp, tailRing);
810  pNext(tp) = NULL;
811  return m;

◆ Normalize()

KINLINE void sLObject::Normalize ( )

Definition at line 322 of file kInline.h.

326 {
327  if (t_p != NULL)
328  {
329  pNormalize(t_p);
330  if (p != NULL) pSetCoeff0(p, pGetCoeff(t_p));
331  }
332  else
333  {

◆ operator=()

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

Definition at line 821 of file kInline.h.

826 {

◆ pLDeg() [1/2]

KINLINE long sLObject::pLDeg ( )

Definition at line 735 of file kInline.h.

740 {
741  poly tp = GetLmTailRing();
742  assume(tp != NULL);
743  if (bucket != NULL)
744  {
746  pNext(tp) = bucket->buckets[i];
747  long ldeg = tailRing->pLDeg(tp, &length, tailRing);
748  pNext(tp) = NULL;
749  return ldeg;

◆ pLDeg() [2/2]

KINLINE long sLObject::pLDeg ( BOOLEAN  use_last)

Definition at line 750 of file kInline.h.

755 {
756  if (! deg_last || bucket != NULL) return sLObject::pLDeg();
757 
758  long ldeg;
759  ldeg = tailRing->pLDeg(GetLmTailRing(), &length, tailRing);
760 #ifndef SING_NDEBUG
761  if ( pLength == 0)
764 #else

◆ PrepareRed()

KINLINE void sLObject::PrepareRed ( BOOLEAN  use_bucket)

Definition at line 520 of file kInline.h.

525 {
526  if (bucket == NULL)
527  {
528  unsigned l = GetpLength();
529  if (use_bucket && (l > 1))
530  {
531  poly tp = GetLmTailRing();
532  assume(l == ::pLength(tp));
534  kBucketInit(bucket, pNext(tp), l-1);
535  pNext(tp) = NULL;
536  if (p != NULL) pNext(p) = NULL;

◆ SetDegStuffReturnLDeg() [1/2]

KINLINE long sLObject::SetDegStuffReturnLDeg ( )

Definition at line 766 of file kInline.h.

771 {
772  FDeg = this->pFDeg();

◆ SetDegStuffReturnLDeg() [2/2]

KINLINE long sLObject::SetDegStuffReturnLDeg ( BOOLEAN  use_last)

Definition at line 773 of file kInline.h.

778 {
779  FDeg = this->pFDeg();

◆ SetLength()

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

Definition at line 787 of file kInline.h.

792 {
793  if (length_pLength)
794  {
795  length = this->GetpLength();
796  }

◆ SetLmTail()

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

Definition at line 538 of file kInline.h.

543 {
544 
545  Set(lm, _tailRing);
546  if (use_bucket)
547  {
548  bucket = kBucketCreate(_tailRing);
549  kBucketInit(bucket, p_tail, p_Length);
550  pNext(lm) = NULL;
551  pLength = 0;
552  }
553  else
554  {

◆ SetShortExpVector()

KINLINE void sLObject::SetShortExpVector ( )

Definition at line 707 of file kInline.h.

712 {
713  if (t_p != NULL)
714  {
716  }
717  else

◆ ShallowCopyDelete()

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

Definition at line 696 of file kInline.h.

702 {
703  if (bucket != NULL)
704  kBucketShallowCopyDelete(bucket, new_tailRing, new_tailRing->PolyBin,
705  p_shallow_copy_delete);

◆ T_1()

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

Definition at line 828 of file kInline.h.

833 {
834  if (p1 == NULL) return NULL;
835  if (i_r1 == -1) i_r1 = kFindInT(p1, s->T, s->tl);
836  assume(i_r1 >= 0 && i_r1 <= s->tl);

◆ T_1_2()

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

Definition at line 849 of file kInline.h.

855 {
856  if (p1 == NULL)
857  {
858  T_1 = NULL;
859  T_2 = NULL;
860  return;
861  }
862  assume(p1 != NULL && p2 != NULL);
863  if (i_r1 == -1) i_r1 = kFindInT(p1, strat->T, strat->tl);
864  if (i_r2 == -1) i_r2 = kFindInT(p2, strat->T, strat->tl);
865  assume(i_r1 >= 0 && i_r1 <= strat->tl);
866  assume(i_r2 >= 0 && i_r2 <= strat->tl);
867  T_1 = strat->R[i_r1];
868  T_2 = strat->R[i_r2];

◆ T_2()

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

Definition at line 838 of file kInline.h.

843 {
844  if (p1 == NULL) return NULL;
845  assume(p2 != NULL);
846  if (i_r2 == -1) i_r2 = kFindInT(p2, strat->T, strat->tl);
847  assume(i_r2 >= 0 && i_r2 <= strat->tl);

◆ Tail_Minus_mm_Mult_qq()

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

Definition at line 570 of file kInline.h.

576 {
577  if (bucket != NULL)
578  {
579  kBucket_Minus_m_Mult_p(bucket, m, q, &lq, spNoether);
580  }
581  else
582  {
583  if (lq<=0) lq= ::pLength(q);
584  poly _p = (t_p != NULL ? t_p : p);
585  assume(_p != NULL);
586 
587  int lp=pLength-1;
588  pNext(_p) = p_Minus_mm_Mult_qq( pNext(_p), m, q, lp, lq,
589  spNoether, tailRing );
590  pLength=lp+1;

◆ Tail_Mult_nn()

KINLINE void sLObject::Tail_Mult_nn ( number  n)

Definition at line 556 of file kInline.h.

561 {
562  if (bucket != NULL)
563  {
565  }
566  else
567  {
568  poly _p = (t_p != NULL ? t_p : p);

Field Documentation

◆ bucket

kBucket_pt sLObject::bucket

Definition at line 181 of file kutil.h.

◆ checked

unsigned sLObject::checked

Definition at line 183 of file kutil.h.

◆ i_r1

int sLObject::i_r1

Definition at line 182 of file kutil.h.

◆ i_r2

int sLObject::i_r2

Definition at line 182 of file kutil.h.

◆ lcm

poly sLObject::lcm

Definition at line 180 of file kutil.h.

◆ p1

poly sLObject::p1

Definition at line 177 of file kutil.h.

◆ p2

poly sLObject::p2

Definition at line 177 of file kutil.h.

◆ prod_crit

BOOLEAN sLObject::prod_crit

Definition at line 188 of file kutil.h.

◆ sev

unsigned long sLObject::sev

Definition at line 176 of file kutil.h.


The documentation for this class was generated from the following files:
sLObject::i_r2
int i_r2
Definition: kutil.h:182
k_LmInit_tailRing_2_currRing
KINLINE poly k_LmInit_tailRing_2_currRing(poly t_p, ring tailRing, omBin lmBin)
Definition: kInline.h:884
kBucketCanonicalize
int kBucketCanonicalize(kBucket_pt bucket)
nNormalize
#define nNormalize(n)
Definition: numbers.h:30
sLObject::sev
unsigned long sev
Definition: kutil.h:176
sTObject::pFDeg
KINLINE long pFDeg() const
Definition: kInline.h:390
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:332
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:991
sTObject::LmDeleteAndIter
KINLINE void LmDeleteAndIter()
Definition: kInline.h:288
sLObject::sLObject
KINLINE sLObject(ring tailRing=currRing)
Definition: kInline.h:504
sLObject
Definition: kutil.h:172
p_LmShallowCopyDelete
static poly p_LmShallowCopyDelete(poly p, const ring r)
Definition: p_polys.h:1322
sLObject::pLDeg
KINLINE long pLDeg()
Definition: kInline.h:735
sTObject::Set
KINLINE void Set(ring r=currRing)
Definition: kInline.h:100
p_Copy
static poly p_Copy(poly p, const ring r)
returns a copy of p
Definition: p_polys.h:797
currRing
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Definition: polys.cc:13
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:304
kBucketExtractLm
poly kBucketExtractLm(kBucket_pt bucket)
Definition: kbuckets.cc:492
i
int i
Definition: cfEzgcd.cc:125
sLObject::T_2
KINLINE TObject * T_2(const skStrategy *strat)
Definition: kInline.h:838
kBucketDestroy
void kBucketDestroy(kBucket_pt *bucket_pt)
Definition: kbuckets.cc:212
skStrategy::T
TSet T
Definition: kutil.h:316
kBucketInit
void kBucketInit(kBucket_pt bucket, poly lm, int length)
Definition: kbuckets.cc:474
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:697
kBucket_Mult_n
void kBucket_Mult_n(kBucket_pt bucket, number n)
Multiply Bucket by number ,i.e. Bpoly == n*Bpoly.
Definition: kbuckets.cc:579
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:516
p_Last
poly p_Last(const poly p, int &l, const ring r)
Definition: p_polys.cc:4501
pp
CanonicalForm pp(const CanonicalForm &)
CanonicalForm pp ( const CanonicalForm & f )
Definition: cf_gcd.cc:253
sTObject::pLength
int pLength
Definition: kutil.h:73
kBucketClear
void kBucketClear(kBucket_pt bucket, poly *p, int *length)
Definition: kbuckets.cc:502
sLObject::p1
poly p1
Definition: kutil.h:177
kFindInT
int kFindInT(poly p, TSet T, int tlength)
returns index of p in TSet, or -1 if not found
Definition: kutil.cc:703
p_LmFree
static void p_LmFree(poly p, ring)
Definition: p_polys.h:670
sLObject::p2
poly p2
Definition: kutil.h:177
sLObject::T_1
KINLINE TObject * T_1(const skStrategy *strat)
Definition: kInline.h:828
KINLINE
#define KINLINE
Definition: kutil.h:44
sTObject::GetLmTailRing
KINLINE poly GetLmTailRing()
Definition: kInline.h:224
p_Length
p_Length
Definition: p_Procs_Impl.h:117
sLObject::GetpLength
KINLINE int GetpLength()
Definition: kInline.h:780
pSetCoeff0
#define pSetCoeff0(p, n)
Definition: monomials.h:63
m
int m
Definition: cfEzgcd.cc:121
skStrategy::tl
int tl
Definition: kutil.h:342
assume
#define assume(x)
Definition: mod2.h:384
NULL
#define NULL
Definition: omList.c:9
l
int l
Definition: cfEzgcd.cc:93
sTObject::p
poly p
Definition: kutil.h:68
kBucket
Definition: kbuckets.h:174
sLObject::i_r1
int i_r1
Definition: kutil.h:182
sLObject::bucket
kBucket_pt bucket
Definition: kutil.h:181
kBucketCreate
kBucket_pt kBucketCreate(const ring bucket_ring)
Creation/Destruction of buckets.
Definition: kbuckets.cc:205
s
const CanonicalForm int s
Definition: facAbsFact.cc:55
rIsSyzIndexRing
static BOOLEAN rIsSyzIndexRing(const ring r)
Definition: ring.h:710
sLObject::Init
KINLINE void Init(ring tailRing=currRing)
Definition: kInline.h:496
pNormalize
#define pNormalize(p)
Definition: polys.h:291
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:48
p_GetShortExpVector
unsigned long p_GetShortExpVector(const poly p, const ring r)
Definition: p_polys.cc:4660
pNext
#define pNext(p)
Definition: monomials.h:40