 |
My Project
debian-1:4.1.2-p1+ds-2
|
Go to the source code of this file.
|
typedef poly(* | prCopyProc_t) (poly &src_p, ring src_r, ring dest_r) |
|
|
static void | prCopyEvector (poly dest, ring dest_r, poly src, ring src_r, int max) |
|
poly | prCopyR (poly p, ring src_r, ring dest_r) |
|
poly | prMapR (poly src, nMapFunc nMap, ring src_r, ring dest_r) |
|
poly | prCopyR_NoSort (poly p, ring src_r, ring dest_r) |
|
poly | prMoveR (poly &p, ring src_r, ring dest_r) |
|
poly | prMoveR_NoSort (poly &p, ring src_r, ring dest_r) |
|
poly | prShallowCopyR_NoSort (poly p, ring r, ring dest_r) |
|
poly | prShallowCopyR (poly p, ring r, ring dest_r) |
|
poly | prHeadR (poly p, ring src_r, ring dest_r, prCopyProc_t prproc) |
|
poly | prHeadR (poly p, ring src_r, ring dest_r) |
|
ideal | idrHeadR (ideal id, ring r, ring dest_r) |
| Copy leading terms of id[i] via prHeeadR into dest_r. More...
|
|
static ideal | idrCopy (ideal id, ring src_r, ring dest_r, prCopyProc_t prproc) |
|
ideal | idrCopyR (ideal id, ring src_r, ring dest_r) |
|
ideal | idrCopyR_NoSort (ideal id, ring src_r, ring dest_r) |
|
ideal | idrShallowCopyR (ideal id, ring src_r, ring dest_r) |
|
ideal | idrShallowCopyR_NoSort (ideal id, ring src_r, ring dest_r) |
|
static ideal | idrMove (ideal &id, ring src_r, ring dest_r, prCopyProc_t prproc) |
|
ideal | idrMoveR (ideal &id, ring src_r, ring dest_r) |
|
ideal | idrMoveR_NoSort (ideal &id, ring src_r, ring dest_r) |
|
◆ prCopyProc_t
typedef poly(* prCopyProc_t) (poly &src_p, ring src_r, ring dest_r) |
◆ idrCopy()
static ideal idrCopy |
( |
ideal |
id, |
|
|
ring |
src_r, |
|
|
ring |
dest_r, |
|
|
prCopyProc_t |
prproc |
|
) |
| |
|
inlinestatic |
Definition at line 174 of file prCopy.cc.
177 assume(src_r->cf==dest_r->cf);
185 res->m[
i] = prproc(
p, src_r, dest_r);
◆ idrCopyR()
ideal idrCopyR |
( |
ideal |
id, |
|
|
ring |
src_r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 191 of file prCopy.cc.
193 assume(src_r->cf==dest_r->cf);
197 prproc = pr_Copy_NoREqual_NSimple_Sort;
199 prproc = pr_Copy_NoREqual_NoNSimple_Sort;
◆ idrCopyR_NoSort()
ideal idrCopyR_NoSort |
( |
ideal |
id, |
|
|
ring |
src_r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 204 of file prCopy.cc.
206 assume(src_r->cf==dest_r->cf);
210 prproc = pr_Copy_NoREqual_NSimple_NoSort;
212 prproc = pr_Copy_NoREqual_NoNSimple_NoSort;
◆ idrHeadR()
ideal idrHeadR |
( |
ideal |
id, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Copy leading terms of id[i] via prHeeadR into dest_r.
Definition at line 155 of file prCopy.cc.
159 prCopyProc_t prproc = pr_Copy_NoREqual_NoNSimple_NoSort;
161 prproc = pr_Copy_NoREqual_NSimple_NoSort;
166 for (
int i =
N - 1;
i >= 0;
i--)
◆ idrMove()
static ideal idrMove |
( |
ideal & |
id, |
|
|
ring |
src_r, |
|
|
ring |
dest_r, |
|
|
prCopyProc_t |
prproc |
|
) |
| |
|
inlinestatic |
◆ idrMoveR()
ideal idrMoveR |
( |
ideal & |
id, |
|
|
ring |
src_r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 247 of file prCopy.cc.
249 assume(src_r->cf==dest_r->cf);
253 prproc = pr_Move_NoREqual_NSimple_Sort;
255 prproc = pr_Move_NoREqual_NoNSimple_Sort;
◆ idrMoveR_NoSort()
ideal idrMoveR_NoSort |
( |
ideal & |
id, |
|
|
ring |
src_r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 260 of file prCopy.cc.
262 assume(src_r->cf==dest_r->cf);
266 prproc = pr_Move_NoREqual_NSimple_NoSort;
268 prproc = pr_Move_NoREqual_NoNSimple_NoSort;
◆ idrShallowCopyR()
ideal idrShallowCopyR |
( |
ideal |
id, |
|
|
ring |
src_r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 219 of file prCopy.cc.
221 return idrCopy(
id, src_r, dest_r, pr_Copy_NoREqual_NSimple_Sort);
◆ idrShallowCopyR_NoSort()
ideal idrShallowCopyR_NoSort |
( |
ideal |
id, |
|
|
ring |
src_r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 224 of file prCopy.cc.
226 return idrCopy(
id, src_r, dest_r, pr_Copy_NoREqual_NSimple_NoSort);
◆ prCopyEvector()
static void prCopyEvector |
( |
poly |
dest, |
|
|
ring |
dest_r, |
|
|
poly |
src, |
|
|
ring |
src_r, |
|
|
int |
max |
|
) |
| |
|
inlinestatic |
◆ prCopyR()
poly prCopyR |
( |
poly |
p, |
|
|
ring |
src_r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 34 of file prCopy.cc.
38 res = pr_Copy_NoREqual_NSimple_Sort(
p, src_r, dest_r);
40 res = pr_Copy_NoREqual_NoNSimple_Sort(
p, src_r, dest_r);
◆ prCopyR_NoSort()
poly prCopyR_NoSort |
( |
poly |
p, |
|
|
ring |
src_r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 76 of file prCopy.cc.
80 res = pr_Copy_NoREqual_NSimple_NoSort(
p, src_r, dest_r);
82 res = pr_Copy_NoREqual_NoNSimple_NoSort(
p, src_r, dest_r);
◆ prHeadR() [1/2]
poly prHeadR |
( |
poly |
p, |
|
|
ring |
src_r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 140 of file prCopy.cc.
144 prproc = pr_Copy_NoREqual_NSimple_NoSort;
146 prproc = pr_Copy_NoREqual_NoNSimple_NoSort;
148 const poly
res =
prHeadR(
p, src_r, dest_r, prproc);
◆ prHeadR() [2/2]
poly prHeadR |
( |
poly |
p, |
|
|
ring |
src_r, |
|
|
ring |
dest_r, |
|
|
prCopyProc_t |
prproc |
|
) |
| |
Definition at line 125 of file prCopy.cc.
128 poly tail,
head, q =
p;
131 head = prproc(q, src_r, dest_r);
◆ prMapR()
poly prMapR |
( |
poly |
src, |
|
|
nMapFunc |
nMap, |
|
|
ring |
src_r, |
|
|
ring |
dest_r |
|
) |
| |
◆ prMoveR()
poly prMoveR |
( |
poly & |
p, |
|
|
ring |
src_r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 89 of file prCopy.cc.
93 res = pr_Move_NoREqual_NSimple_Sort(
p, src_r, dest_r);
95 res = pr_Move_NoREqual_NoNSimple_Sort(
p, src_r, dest_r);
◆ prMoveR_NoSort()
poly prMoveR_NoSort |
( |
poly & |
p, |
|
|
ring |
src_r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 100 of file prCopy.cc.
104 res = pr_Move_NoREqual_NSimple_NoSort(
p, src_r, dest_r);
106 res = pr_Move_NoREqual_NoNSimple_NoSort(
p, src_r, dest_r);
◆ prShallowCopyR()
poly prShallowCopyR |
( |
poly |
p, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 116 of file prCopy.cc.
118 return pr_Copy_NoREqual_NSimple_Sort(
p, r, dest_r);
◆ prShallowCopyR_NoSort()
poly prShallowCopyR_NoSort |
( |
poly |
p, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 111 of file prCopy.cc.
113 return pr_Copy_NoREqual_NSimple_NoSort(
p, r, dest_r);
static int si_min(const int a, const int b)
static ideal idrMove(ideal &id, ring src_r, ring dest_r, prCopyProc_t prproc)
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent @Note: the integer VarOffset encodes:
const CanonicalForm CFMap CFMap & N
static FORCE_INLINE BOOLEAN n_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
static ideal idrCopy(ideal id, ring src_r, ring dest_r, prCopyProc_t prproc)
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
static poly p_SortAdd(poly p, const ring r, BOOLEAN revert=FALSE)
static void prCopyEvector(poly dest, ring dest_r, poly src, ring src_r, int max)
static int max(int a, int b)
static void p_LmDelete(poly p, const ring r)
static poly p_Init(const ring r, omBin bin)
#define rRing_has_Comp(r)
static BOOLEAN rField_has_simple_Alloc(const ring r)
Z/p, GF(p,n), R: nCopy, nNew, nDelete are dummies.
ideal idInit(int idsize, int rank)
initialise an ideal / module
static unsigned long p_SetComp(poly p, unsigned long c, ring r)
static void p_Setm(poly p, const ring r)
poly prHeadR(poly p, ring src_r, ring dest_r, prCopyProc_t prproc)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
poly(* prCopyProc_t)(poly &src_p, ring src_r, ring dest_r)