Go to the source code of this file.
|
poly | prMoveR_NoSort (poly &p, ring r, ring dest_r) |
|
poly | prMoveR (poly &p, ring r, ring dest_r) |
|
poly | prCopyR_NoSort (poly p, ring r, ring dest_r) |
|
poly | prCopyR (poly p, ring r, ring dest_r) |
|
poly | prShallowCopyR_NoSort (poly p, ring r, ring dest_t) |
|
poly | prShallowCopyR (poly p, ring r, ring dest_t) |
|
poly | prHeadR (poly p, ring r, ring dest_rg) |
|
ideal | idrMoveR_NoSort (ideal &id, ring r, ring dest_r) |
|
ideal | idrMoveR (ideal &id, ring r, ring dest_r) |
|
ideal | idrCopyR_NoSort (ideal id, ring r, ring dest_r) |
|
ideal | idrCopyR (ideal id, ring r, ring dest_r) |
|
ideal | idrShallowCopyR_NoSort (ideal id, ring r, ring dest_r) |
|
ideal | idrShallowCopyR (ideal id, ring 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...
|
|
poly | prMapR (poly src, nMapFunc nMap, ring src_r, ring dest_r) |
|
§ nMapFunc
§ poly
§ idrCopyR()
ideal idrCopyR |
( |
ideal |
id, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 193 of file prCopy.cc.
195 assume(src_r->cf==dest_r->cf);
199 prproc = pr_Copy_NoREqual_NSimple_Sort;
201 prproc = pr_Copy_NoREqual_NoNSimple_Sort;
202 res =
idrCopy(
id, src_r, dest_r, prproc);
static BOOLEAN rField_has_simple_Alloc(const ring r)
Z/p, GF(p,n), R: nCopy, nNew, nDelete are dummies.
static ideal idrCopy(ideal id, ring src_r, ring dest_r, prCopyProc_t prproc)
poly(* prCopyProc_t)(poly &src_p, ring src_r, ring dest_r)
§ idrCopyR_NoSort()
ideal idrCopyR_NoSort |
( |
ideal |
id, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 206 of file prCopy.cc.
208 assume(src_r->cf==dest_r->cf);
212 prproc = pr_Copy_NoREqual_NSimple_NoSort;
214 prproc = pr_Copy_NoREqual_NoNSimple_NoSort;
215 res =
idrCopy(
id, src_r, dest_r, prproc);
static BOOLEAN rField_has_simple_Alloc(const ring r)
Z/p, GF(p,n), R: nCopy, nNew, nDelete are dummies.
static ideal idrCopy(ideal id, ring src_r, ring dest_r, prCopyProc_t prproc)
poly(* prCopyProc_t)(poly &src_p, ring src_r, ring dest_r)
§ idrHeadR()
ideal idrHeadR |
( |
ideal |
id, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Copy leading terms of id[i] via prHeeadR into dest_r.
Definition at line 157 of file prCopy.cc.
161 prCopyProc_t prproc = pr_Copy_NoREqual_NoNSimple_NoSort;
163 prproc = pr_Copy_NoREqual_NSimple_NoSort;
168 for (
int i = N - 1;
i >= 0;
i--)
169 res->m[
i] =
prHeadR(id->m[
i],
r, dest_r, prproc);
static BOOLEAN rField_has_simple_Alloc(const ring r)
Z/p, GF(p,n), R: nCopy, nNew, nDelete are dummies.
poly prHeadR(poly p, ring src_r, ring dest_r, prCopyProc_t prproc)
const CanonicalForm CFMap CFMap & N
ideal idInit(int idsize, int rank)
initialise an ideal / module
poly(* prCopyProc_t)(poly &src_p, ring src_r, ring dest_r)
§ idrMoveR()
ideal idrMoveR |
( |
ideal & |
id, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 249 of file prCopy.cc.
251 assume(src_r->cf==dest_r->cf);
255 prproc = pr_Move_NoREqual_NSimple_Sort;
257 prproc = pr_Move_NoREqual_NoNSimple_Sort;
258 res =
idrMove(
id, src_r, dest_r, prproc);
static BOOLEAN rField_has_simple_Alloc(const ring r)
Z/p, GF(p,n), R: nCopy, nNew, nDelete are dummies.
poly(* prCopyProc_t)(poly &src_p, ring src_r, ring dest_r)
static ideal idrMove(ideal &id, ring src_r, ring dest_r, prCopyProc_t prproc)
§ idrMoveR_NoSort()
ideal idrMoveR_NoSort |
( |
ideal & |
id, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 262 of file prCopy.cc.
264 assume(src_r->cf==dest_r->cf);
268 prproc = pr_Move_NoREqual_NSimple_NoSort;
270 prproc = pr_Move_NoREqual_NoNSimple_NoSort;
271 res =
idrMove(
id, src_r, dest_r, prproc);
static BOOLEAN rField_has_simple_Alloc(const ring r)
Z/p, GF(p,n), R: nCopy, nNew, nDelete are dummies.
poly(* prCopyProc_t)(poly &src_p, ring src_r, ring dest_r)
static ideal idrMove(ideal &id, ring src_r, ring dest_r, prCopyProc_t prproc)
§ idrShallowCopyR()
ideal idrShallowCopyR |
( |
ideal |
id, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 221 of file prCopy.cc.
223 return idrCopy(
id, src_r, dest_r, pr_Copy_NoREqual_NSimple_Sort);
static ideal idrCopy(ideal id, ring src_r, ring dest_r, prCopyProc_t prproc)
§ idrShallowCopyR_NoSort()
ideal idrShallowCopyR_NoSort |
( |
ideal |
id, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 226 of file prCopy.cc.
228 return idrCopy(
id, src_r, dest_r, pr_Copy_NoREqual_NSimple_NoSort);
static ideal idrCopy(ideal id, ring src_r, ring dest_r, prCopyProc_t prproc)
§ prCopyR()
poly prCopyR |
( |
poly |
p, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 36 of file prCopy.cc.
40 res = pr_Copy_NoREqual_NSimple_Sort(
p, src_r, dest_r);
42 res = pr_Copy_NoREqual_NoNSimple_Sort(
p, src_r, dest_r);
static BOOLEAN rField_has_simple_Alloc(const ring r)
Z/p, GF(p,n), R: nCopy, nNew, nDelete are dummies.
§ prCopyR_NoSort()
poly prCopyR_NoSort |
( |
poly |
p, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 78 of file prCopy.cc.
82 res = pr_Copy_NoREqual_NSimple_NoSort(
p, src_r, dest_r);
84 res = pr_Copy_NoREqual_NoNSimple_NoSort(
p, src_r, dest_r);
static BOOLEAN rField_has_simple_Alloc(const ring r)
Z/p, GF(p,n), R: nCopy, nNew, nDelete are dummies.
§ prHeadR()
poly prHeadR |
( |
poly |
p, |
|
|
ring |
r, |
|
|
ring |
dest_rg |
|
) |
| |
Definition at line 142 of file prCopy.cc.
146 prproc = pr_Copy_NoREqual_NSimple_NoSort;
148 prproc = pr_Copy_NoREqual_NoNSimple_NoSort;
static BOOLEAN rField_has_simple_Alloc(const ring r)
Z/p, GF(p,n), R: nCopy, nNew, nDelete are dummies.
poly prHeadR(poly p, ring src_r, ring dest_r, prCopyProc_t prproc)
poly(* prCopyProc_t)(poly &src_p, ring src_r, ring dest_r)
§ prMapR()
Definition at line 47 of file prCopy.cc.
50 int _min =
si_min(dest_r->N, src_r->N);
72 dest =
pNext(&dest_s);
static int si_min(const int a, const int b)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy ...
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 FORCE_INLINE BOOLEAN n_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
static void p_LmDelete(poly p, const ring r)
static poly p_Init(const ring r, omBin bin)
§ prMoveR()
poly prMoveR |
( |
poly & |
p, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 91 of file prCopy.cc.
95 res = pr_Move_NoREqual_NSimple_Sort(
p, src_r, dest_r);
97 res = pr_Move_NoREqual_NoNSimple_Sort(
p, src_r, dest_r);
static BOOLEAN rField_has_simple_Alloc(const ring r)
Z/p, GF(p,n), R: nCopy, nNew, nDelete are dummies.
§ prMoveR_NoSort()
poly prMoveR_NoSort |
( |
poly & |
p, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 102 of file prCopy.cc.
106 res = pr_Move_NoREqual_NSimple_NoSort(
p, src_r, dest_r);
108 res = pr_Move_NoREqual_NoNSimple_NoSort(
p, src_r, dest_r);
static BOOLEAN rField_has_simple_Alloc(const ring r)
Z/p, GF(p,n), R: nCopy, nNew, nDelete are dummies.
§ prShallowCopyR()
poly prShallowCopyR |
( |
poly |
p, |
|
|
ring |
r, |
|
|
ring |
dest_t |
|
) |
| |
Definition at line 118 of file prCopy.cc.
120 return pr_Copy_NoREqual_NSimple_Sort(
p,
r, dest_r);
§ prShallowCopyR_NoSort()
poly prShallowCopyR_NoSort |
( |
poly |
p, |
|
|
ring |
r, |
|
|
ring |
dest_t |
|
) |
| |
Definition at line 113 of file prCopy.cc.
115 return pr_Copy_NoREqual_NSimple_NoSort(
p,
r, dest_r);