 |
My Project
UNKNOWN_GIT_VERSION
|
Go to the source code of this file.
|
KINLINE TSet | initT () |
|
KINLINE TObject ** | initR () |
|
KINLINE unsigned long * | initsevT () |
|
KINLINE poly | k_LmInit_currRing_2_tailRing (poly p, ring tailRing, omBin tailBin) |
|
KINLINE poly | k_LmInit_tailRing_2_currRing (poly t_p, ring tailRing, omBin lmBin) |
|
KINLINE poly | k_LmShallowCopyDelete_currRing_2_tailRing (poly p, ring tailRing, omBin tailBin) |
|
KINLINE poly | k_LmShallowCopyDelete_tailRing_2_currRing (poly p, ring tailRing, omBin lmBin) |
|
KINLINE poly | k_LmInit_currRing_2_tailRing (poly p, ring tailRing) |
|
KINLINE poly | k_LmInit_tailRing_2_currRing (poly p, ring tailRing) |
|
KINLINE poly | k_LmShallowCopyDelete_currRing_2_tailRing (poly p, ring tailRing) |
|
KINLINE poly | k_LmShallowCopyDelete_tailRing_2_currRing (poly p, ring tailRing) |
|
KINLINE BOOLEAN | k_GetLeadTerms (const poly p1, const poly p2, const ring p_r, poly &m1, poly &m2, const ring m_r) |
|
KINLINE void | k_GetStrongLeadTerms (const poly p1, const poly p2, const ring leadRing, poly &m1, poly &m2, poly &lcm, const ring tailRing) |
|
KINLINE int | ksReducePolyTail (LObject *PR, TObject *PW, LObject *Red) |
|
KINLINE poly | ksOldSpolyRed (poly p1, poly p2, poly spNoether) |
|
KINLINE poly | ksOldSpolyRedNew (poly p1, poly p2, poly spNoether) |
|
KINLINE poly | ksOldCreateSpoly (poly p1, poly p2, poly spNoether, ring r) |
|
void | ksOldSpolyTail (poly p1, poly q, poly q2, poly spNoether, ring r) |
|
KINLINE poly | redtailBba (poly p, int pos, kStrategy strat, BOOLEAN normalize) |
|
KINLINE poly | redtailBbaBound (poly p, int pos, kStrategy strat, int bound, BOOLEAN normalize) |
|
KINLINE poly | redtailBba_Z (poly p, int pos, kStrategy strat) |
|
KINLINE void | clearS (poly p, unsigned long p_sev, int *at, int *k, kStrategy strat) |
|
KINLINE BOOLEAN | arriRewDummy (poly, unsigned long, poly, kStrategy, int) |
|
◆ HAVE_TAIL_BIN
◆ arriRewDummy()
◆ clearS()
KINLINE void clearS |
( |
poly |
p, |
|
|
unsigned long |
p_sev, |
|
|
int * |
at, |
|
|
int * |
k, |
|
|
kStrategy |
strat |
|
) |
| |
◆ initR()
◆ initsevT()
KINLINE unsigned long* initsevT |
( |
| ) |
|
◆ initT()
◆ k_GetLeadTerms()
Definition at line 931 of file kInline.h.
939 m1 =
p_Init(m_r,m_r->PolyBin);
940 m2 =
p_Init(m_r,m_r->PolyBin);
942 for (
i = p_r->N;
i;
i--)
947 if (
x > (
long) m_r->bitmask)
goto false_return;
953 if (-
x > (
long) m_r->bitmask)
goto false_return;
◆ k_GetStrongLeadTerms()
KINLINE void k_GetStrongLeadTerms |
( |
const poly |
p1, |
|
|
const poly |
p2, |
|
|
const ring |
leadRing, |
|
|
poly & |
m1, |
|
|
poly & |
m2, |
|
|
poly & |
lcm, |
|
|
const ring |
tailRing |
|
) |
| |
Definition at line 974 of file kInline.h.
985 m1 =
p_Init(tailRing,tailRing->PolyBin);
986 m2 =
p_Init(tailRing,tailRing->PolyBin);
987 lcm =
p_Init(leadRing,leadRing->PolyBin);
989 for (
i = leadRing->N;
i>=0;
i--)
◆ k_LmInit_currRing_2_tailRing() [1/2]
KINLINE poly k_LmInit_currRing_2_tailRing |
( |
poly |
p, |
|
|
ring |
tailRing |
|
) |
| |
◆ k_LmInit_currRing_2_tailRing() [2/2]
KINLINE poly k_LmInit_currRing_2_tailRing |
( |
poly |
p, |
|
|
ring |
tailRing, |
|
|
omBin |
tailBin |
|
) |
| |
◆ k_LmInit_tailRing_2_currRing() [1/2]
KINLINE poly k_LmInit_tailRing_2_currRing |
( |
poly |
p, |
|
|
ring |
tailRing |
|
) |
| |
◆ k_LmInit_tailRing_2_currRing() [2/2]
KINLINE poly k_LmInit_tailRing_2_currRing |
( |
poly |
t_p, |
|
|
ring |
tailRing, |
|
|
omBin |
lmBin |
|
) |
| |
◆ k_LmShallowCopyDelete_currRing_2_tailRing() [1/2]
KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing |
( |
poly |
p, |
|
|
ring |
tailRing |
|
) |
| |
◆ k_LmShallowCopyDelete_currRing_2_tailRing() [2/2]
KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing |
( |
poly |
p, |
|
|
ring |
tailRing, |
|
|
omBin |
tailBin |
|
) |
| |
◆ k_LmShallowCopyDelete_tailRing_2_currRing() [1/2]
KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing |
( |
poly |
p, |
|
|
ring |
tailRing |
|
) |
| |
◆ k_LmShallowCopyDelete_tailRing_2_currRing() [2/2]
KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing |
( |
poly |
p, |
|
|
ring |
tailRing, |
|
|
omBin |
lmBin |
|
) |
| |
◆ ksOldCreateSpoly()
KINLINE poly ksOldCreateSpoly |
( |
poly |
p1, |
|
|
poly |
p2, |
|
|
poly |
spNoether, |
|
|
ring |
r |
|
) |
| |
Definition at line 1069 of file kInline.h.
1076 return L.GetLmCurrRing();
◆ ksOldSpolyRed()
KINLINE poly ksOldSpolyRed |
( |
poly |
p1, |
|
|
poly |
p2, |
|
|
poly |
spNoether |
|
) |
| |
Definition at line 1049 of file kInline.h.
1056 return L.GetLmCurrRing();
◆ ksOldSpolyRedNew()
KINLINE poly ksOldSpolyRedNew |
( |
poly |
p1, |
|
|
poly |
p2, |
|
|
poly |
spNoether |
|
) |
| |
Definition at line 1059 of file kInline.h.
1066 return L.GetLmCurrRing();
◆ ksOldSpolyTail()
void ksOldSpolyTail |
( |
poly |
p1, |
|
|
poly |
q, |
|
|
poly |
q2, |
|
|
poly |
spNoether, |
|
|
ring |
r |
|
) |
| |
◆ ksReducePolyTail()
Definition at line 1022 of file kInline.h.
1027 assume(PR->GetLmCurrRing() != PW->GetLmCurrRing());
1028 Red->HeadNormalize();
◆ redtailBba()
◆ redtailBba_Z()
◆ redtailBbaBound()
KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing, omBin tailBin)
KINLINE poly k_LmInit_tailRing_2_currRing(poly t_p, ring tailRing, omBin lmBin)
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent @Note: the integer VarOffset encodes:
static poly p_LmInit(poly p, const ring r)
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
#define pGetShortExpVector(a)
returns the "Short Exponent Vector" – used to speed up divisibility tests (see polys-impl....
static FORCE_INLINE BOOLEAN n_IsOne(number n, const coeffs r)
TRUE iff 'n' represents the one element.
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
KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing, omBin tailBin)
BOOLEAN p_LmCheckPolyRing(poly p, ring r)
KINLINE poly redtailBba_Z(poly p, int pos, kStrategy strat)
static poly p_Copy(poly p, const ring r)
returns a copy of p
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
void ksCreateSpoly(LObject *Pair, poly spNoether, int use_buckets, ring tailRing, poly m1, poly m2, TObject **R)
int ksReducePoly(LObject *PR, TObject *PW, poly spNoether, number *coef, kStrategy strat)
KINLINE int ksReducePolyTail(LObject *PR, TObject *PW, LObject *Red)
static BOOLEAN rField_is_Ring(const ring r)
KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing(poly p, ring tailRing, omBin lmBin)
static poly p_Init(const ring r, omBin bin)
static void p_LmFree(poly p, ring)
KINLINE poly redtailBba(poly p, int pos, kStrategy strat, BOOLEAN normalize)
static poly normalize(poly next_p, ideal add_generators, syStrategy syzstr, int *g_l, int *p_l, int crit_comp)
static CanonicalForm bound(const CFMatrix &M)
KINLINE poly redtailBbaBound(poly p, int pos, kStrategy strat, int bound, BOOLEAN normalize)
static long p_GetExpDiff(poly p1, poly p2, int i, ring r)
static FORCE_INLINE BOOLEAN n_DivBy(number a, number b, const coeffs r)
test whether 'a' is divisible 'b'; for r encoding a field: TRUE iff 'b' does not represent zero in Z:...
#define pLmShortDivisibleBy(a, sev_a, b, not_sev_b)
Divisibility tests based on Short Exponent vectors sev_a == pGetShortExpVector(a) not_sev_b == ~ pGet...
int lcm(unsigned long *l, unsigned long *a, unsigned long *b, unsigned long p, int dega, int degb)
static void p_Setm(poly p, const ring r)
const CanonicalForm int s
void deleteInS(int i, kStrategy strat)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy