My Project  UNKNOWN_GIT_VERSION
Public Member Functions | Data Fields
sTObject Class Reference

#include <kutil.h>

Public Member Functions

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 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 63 of file kutil.h.

Constructor & Destructor Documentation

◆ sTObject() [1/4]

KINLINE sTObject::sTObject ( ring  tailRing = currRing)

Definition at line 110 of file kInline.h.

114 {

◆ sTObject() [2/4]

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

Definition at line 130 of file kInline.h.

134 {

◆ sTObject() [3/4]

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

Definition at line 151 of file kInline.h.

155 {

◆ sTObject() [4/4]

KINLINE sTObject::sTObject ( sTObject T,
int  copy 
)

Definition at line 157 of file kInline.h.

161 {
162  *this = *T;
163  if (copy)
164  {
165  if (t_p != NULL)
166  {
167  t_p = p_Copy(t_p, tailRing);
169  }
170  else
171  {
172  p = p_Copy(p, currRing);

Member Function Documentation

◆ Clear()

KINLINE void sTObject::Clear ( )

Definition at line 188 of file kInline.h.

192 {
193  p = NULL;
194  t_p = NULL;
195  ecart = 0;
196  length = 0;
197  pLength = 0;

◆ Copy()

KINLINE void sTObject::Copy ( )

Definition at line 199 of file kInline.h.

203 {
204  if (t_p != NULL)
205  {
206  t_p = p_Copy(t_p, tailRing);
207  if (p != NULL) /* and t_p!=NULL*/
208  {
209  p = p_LmInit(p, currRing);
211  pNext(p) = pNext(t_p);
212  }
213  }
214  else
215  {

◆ Delete()

KINLINE void sTObject::Delete ( )

Definition at line 174 of file kInline.h.

178 {
179  if (t_p != NULL)
180  {
181  p_Delete(&t_p, tailRing);
182  if (p != NULL)
183  p_LmFree(p, currRing);
184  }
185  else
186  {

◆ GetLm() [1/2]

KINLINE void sTObject::GetLm ( poly &  p,
ring &  r 
) const

Definition at line 249 of file kInline.h.

253 {
254  if (t_p != NULL)
255  {
256  p_r = t_p;
257  r_r = tailRing;
258  }
259  else
260  {
261  p_r = p;

◆ GetLm() [2/2]

KINLINE poly sTObject::GetLm ( ring  r)

Definition at line 237 of file kInline.h.

241 {
242  assume(r == tailRing || r == currRing);
243  if (r == currRing)
244  return GetLmCurrRing();
245 
246  if (t_p == NULL && p != NULL)

◆ GetLmCurrRing()

KINLINE poly sTObject::GetLmCurrRing ( )

Definition at line 217 of file kInline.h.

221 {
222  if (p == NULL && t_p != NULL)

◆ GetLmTailRing()

KINLINE poly sTObject::GetLmTailRing ( )

Definition at line 224 of file kInline.h.

228 {
229  if (t_p == NULL)
230  {
231  if (p != NULL && tailRing != currRing)
232  {
234  return t_p;
235  }
236  return p;

◆ GetpFDeg()

KINLINE long sTObject::GetpFDeg ( ) const

Definition at line 412 of file kInline.h.

416 {

◆ GetpLength()

KINLINE int sTObject::GetpLength ( )

Definition at line 268 of file kInline.h.

272 {

◆ Init()

KINLINE void sTObject::Init ( ring  r = currRing)

Definition at line 104 of file kInline.h.

104 {
105  tailRing = r;
106 }
107 KINLINE void sTObject::Init(ring r)
108 {
109  memset(this, 0, sizeof(sTObject));

◆ IsNull()

KINLINE BOOLEAN sTObject::IsNull ( ) const

Definition at line 263 of file kInline.h.

267 {

◆ LmDeleteAndIter()

KINLINE void sTObject::LmDeleteAndIter ( )

Definition at line 288 of file kInline.h.

292 {
293  assume(p != NULL || t_p != NULL);
294  if (t_p != NULL)
295  {
297  if (p != NULL)
298  {
299  p_LmFree(p, currRing);
300  p = NULL;
301  }
302  }
303  else
304  {

◆ Mult_nn()

KINLINE void sTObject::Mult_nn ( number  n)

Definition at line 309 of file kInline.h.

313 {
314  if (t_p != NULL)
315  {
316  t_p = p_Mult_nn(t_p, n, tailRing);
317  if (p != NULL) pSetCoeff0(p, pGetCoeff(t_p));
318  }
319  else
320  {

◆ Next()

KINLINE poly sTObject::Next ( )

Definition at line 280 of file kInline.h.

284 {
285  assume(p != NULL || t_p != NULL);

◆ pCleardenom()

KINLINE void sTObject::pCleardenom ( )

Definition at line 433 of file kInline.h.

437 {
438  assume(p != NULL);
439  if (TEST_OPT_CONTENTSB)
440  {
441  number n;
442  if (t_p != NULL)
443  {
446  }
447  else
448  {
450  }
451  if (!nIsOne(n))
452  {
454  denom->n=nInvers(n);
455  denom->next=DENOMINATOR_LIST;
456  DENOMINATOR_LIST=denom;
457  }
458  nDelete(&n);
459  }
460  else
461  {
462  if (t_p != NULL)
463  {
466  }
467  else
468  {

◆ pFDeg()

KINLINE long sTObject::pFDeg ( ) const

Definition at line 397 of file kInline.h.

401 {

◆ pLDeg()

KINLINE long sTObject::pLDeg ( )

Definition at line 417 of file kInline.h.

421 {

◆ pNorm()

KINLINE void sTObject::pNorm ( )

Definition at line 471 of file kInline.h.

475 {
476  assume(p != NULL);
477  if (! is_normalized)
478  {
479  p_Norm(p, currRing);
480  if (t_p != NULL)

◆ pTotalDeg()

KINLINE long sTObject::pTotalDeg ( ) const

Definition at line 402 of file kInline.h.

406 {

◆ Set() [1/3]

KINLINE void sTObject::Set ( poly  p_in,
ring  c_r,
ring  t_r 
)

Definition at line 136 of file kInline.h.

140 {
141  if (c_r != t_r)
142  {
143  assume(c_r == currRing && t_r == tailRing);
144  p_Test(p_in, currRing);
145  p = p_in;
146  pLength=::pLength(p_in);
147  }
148  else
149  {

◆ Set() [2/3]

KINLINE void sTObject::Set ( poly  p_in,
ring  r = currRing 
)

Definition at line 114 of file kInline.h.

114 {
115  Init(r);
116 }
117 KINLINE void sTObject::Set(poly p_in, ring r)
118 {
119  if (r != currRing)
120  {
121  assume(r == tailRing);
122  p_Test(p_in, r);
123  t_p = p_in;
124  }
125  else
126  {
127  p_Test(p_in, currRing);
128  p = p_in;

◆ Set() [3/3]

KINLINE void sTObject::Set ( ring  r = currRing)

Definition at line 100 of file kInline.h.

104 {

◆ SetDegStuffReturnLDeg()

KINLINE long sTObject::SetDegStuffReturnLDeg ( )

Definition at line 421 of file kInline.h.

421 {
422  return tailRing->pLDeg(GetLmTailRing(), &length, tailRing);
423 }
425 {
426  FDeg = this->pFDeg();
427  long d = this->pLDeg();

◆ SetLmCurrRing()

KINLINE void sTObject::SetLmCurrRing ( )

Definition at line 274 of file kInline.h.

278 {

◆ SetpFDeg()

KINLINE long sTObject::SetpFDeg ( )

Definition at line 407 of file kInline.h.

411 {

◆ ShallowCopyDelete()

KINLINE void sTObject::ShallowCopyDelete ( ring  new_tailRing,
omBin  new_tailBin,
pShallowCopyDeleteProc  p_shallow_copy_delete,
BOOLEAN  set_max = TRUE 
)

Definition at line 356 of file kInline.h.

362 {
363  if (new_tailBin == NULL) new_tailBin = new_tailRing->PolyBin;
364  if (t_p != NULL)
365  {
366  t_p = p_shallow_copy_delete(t_p, tailRing, new_tailRing, new_tailBin);
367  if (p != NULL)
368  pNext(p) = pNext(t_p);
369  if (new_tailRing == currRing)
370  {
371  if (p == NULL) p = t_p;
372  else p_LmFree(t_p, tailRing);
373  t_p = NULL;
374  }
375  }
376  else if (p != NULL) /* && t_p==NULL */
377  {
378  if (pNext(p) != NULL)
379  {
380  pNext(p) = p_shallow_copy_delete(pNext(p),
381  tailRing, new_tailRing, new_tailBin);
382  }
383  if (new_tailRing != currRing)
384  {
385  t_p = k_LmInit_currRing_2_tailRing(p, new_tailRing);
386  pNext(t_p) = pNext(p);
387  }
388  }
389  if (max_exp != NULL)
390  {
391  max_exp = p_shallow_copy_delete(max_exp,tailRing,new_tailRing,new_tailBin);
392  }
393  else if (set_max && pNext(t_p) != NULL)
394  {
395  max_exp = p_GetMaxExpP(pNext(t_p), new_tailRing);

Field Documentation

◆ ecart

int sTObject::ecart

Definition at line 73 of file kutil.h.

◆ FDeg

long sTObject::FDeg

Definition at line 72 of file kutil.h.

◆ i_r

int sTObject::i_r

Definition at line 73 of file kutil.h.

◆ is_normalized

char sTObject::is_normalized

Definition at line 77 of file kutil.h.

◆ is_redundant

char sTObject::is_redundant

Definition at line 83 of file kutil.h.

◆ is_sigsafe

char sTObject::is_sigsafe

Definition at line 88 of file kutil.h.

◆ is_special

char sTObject::is_special

Definition at line 92 of file kutil.h.

◆ length

int sTObject::length

Definition at line 73 of file kutil.h.

◆ max_exp

poly sTObject::max_exp

Definition at line 70 of file kutil.h.

◆ p

poly sTObject::p

Definition at line 68 of file kutil.h.

◆ pLength

int sTObject::pLength

Definition at line 73 of file kutil.h.

◆ sevSig

unsigned long sTObject::sevSig

Definition at line 66 of file kutil.h.

◆ sig

poly sTObject::sig

Definition at line 67 of file kutil.h.

◆ t_p

poly sTObject::t_p

Definition at line 69 of file kutil.h.

◆ tailRing

ring sTObject::tailRing

Definition at line 71 of file kutil.h.


The documentation for this class was generated from the following files:
sTObject::is_normalized
char is_normalized
Definition: kutil.h:77
sTObject::pLDeg
KINLINE long pLDeg()
Definition: kInline.h:417
k_LmInit_tailRing_2_currRing
KINLINE poly k_LmInit_tailRing_2_currRing(poly t_p, ring tailRing, omBin lmBin)
Definition: kInline.h:876
p_LmDeleteAndNext
static poly p_LmDeleteAndNext(poly p, const ring r)
Definition: p_polys.h:713
sTObject::pFDeg
KINLINE long pFDeg() const
Definition: kInline.h:397
sTObject::FDeg
long FDeg
Definition: kutil.h:72
sTObject::length
int length
Definition: kutil.h:73
p_LmInit
static poly p_LmInit(poly p, const ring r)
Definition: p_polys.h:1255
sTObject
Definition: kutil.h:63
TEST_OPT_CONTENTSB
#define TEST_OPT_CONTENTSB
Definition: options.h:124
p_Test
#define p_Test(p, r)
Definition: p_polys.h:156
sTObject::Set
KINLINE void Set(ring r=currRing)
Definition: kInline.h:100
k_LmInit_currRing_2_tailRing
KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing, omBin tailBin)
Definition: kInline.h:867
p_Copy
static poly p_Copy(poly p, const ring r)
returns a copy of p
Definition: p_polys.h:798
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
denominator_list
denominator_list_s * denominator_list
Definition: kutil.h:58
nIsOne
#define nIsOne(n)
Definition: numbers.h:25
T
static jList * T
Definition: janet.cc:31
denominator_list_s
Definition: kutil.h:60
sTObject::max_exp
poly max_exp
Definition: kutil.h:70
omAlloc
#define omAlloc(size)
Definition: omAllocDecl.h:208
p_ProjectiveUnique
void p_ProjectiveUnique(poly ph, const ring r)
Definition: p_polys.cc:3077
sTObject::SetDegStuffReturnLDeg
KINLINE long SetDegStuffReturnLDeg()
Definition: kInline.h:421
p_GetMaxExpP
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:1128
sTObject::pLength
int pLength
Definition: kutil.h:73
sTObject::GetLmCurrRing
KINLINE poly GetLmCurrRing()
Definition: kInline.h:217
DENOMINATOR_LIST
denominator_list DENOMINATOR_LIST
Definition: kutil.cc:86
p_LmFree
static void p_LmFree(poly p, ring)
Definition: p_polys.h:671
p_Delete
static void p_Delete(poly *p, const ring r)
Definition: p_polys.h:843
sTObject::ecart
int ecart
Definition: kutil.h:73
nInvers
#define nInvers(a)
Definition: numbers.h:33
KINLINE
#define KINLINE
Definition: kutil.h:44
sTObject::GetLmTailRing
KINLINE poly GetLmTailRing()
Definition: kInline.h:224
pSetCoeff0
#define pSetCoeff0(p, n)
Definition: monomials.h:57
assume
#define assume(x)
Definition: mod2.h:384
NULL
#define NULL
Definition: omList.c:9
nDelete
#define nDelete(n)
Definition: numbers.h:16
sTObject::p
poly p
Definition: kutil.h:68
denominator_list_s::next
denominator_list next
Definition: kutil.h:60
p_Norm
void p_Norm(poly p1, const ring r)
Definition: p_polys.cc:3667
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:42
copy
CFArray copy(const CFList &list)
write elements of list into an array
Definition: facFqBivarUtil.cc:364
denominator_list_s::n
number n
Definition: kutil.h:60
pNext
#define pNext(p)
Definition: monomials.h:34
p_Mult_nn
static poly p_Mult_nn(poly p, number n, const ring r)
Definition: p_polys.h:900
p_Cleardenom_n
void p_Cleardenom_n(poly ph, const ring r, number &c)
Definition: p_polys.cc:2888
sTObject::Init
KINLINE void Init(ring r=currRing)
Definition: kInline.h:104