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.
|
|
poly | prMapR (poly src, nMapFunc nMap, ring src_r, ring dest_r) |
|
◆ nMapFunc
◆ idrCopyR()
Definition at line 192 of file prCopy.cc.
193{
199 else
203}
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)
static BOOLEAN rField_has_simple_Alloc(const ring r)
Z/p, GF(p,n), R: nCopy, nNew, nDelete are dummies.
◆ idrCopyR_NoSort()
◆ idrHeadR()
Copy leading terms of id[i] via prHeeadR into dest_r.
Definition at line 156 of file prCopy.cc.
157{
159
163
166
167 for (
int i =
N - 1;
i >= 0;
i--)
169
171}
const CanonicalForm CFMap CFMap & N
poly prHeadR(poly p, ring src_r, ring dest_r, prCopyProc_t prproc)
ideal idInit(int idsize, int rank)
initialise an ideal / module
◆ idrMoveR()
Definition at line 248 of file prCopy.cc.
249{
255 else
259}
static ideal idrMove(ideal &id, ring src_r, ring dest_r, prCopyProc_t prproc)
◆ idrMoveR_NoSort()
◆ idrShallowCopyR()
◆ idrShallowCopyR_NoSort()
◆ prCopyR()
poly prCopyR |
( |
poly | p, |
|
|
ring | r, |
|
|
ring | dest_r ) |
◆ prCopyR_NoSort()
poly prCopyR_NoSort |
( |
poly | p, |
|
|
ring | r, |
|
|
ring | dest_r ) |
◆ prHeadR()
poly prHeadR |
( |
poly | p, |
|
|
ring | r, |
|
|
ring | dest_rg ) |
◆ prMapR()
Definition at line 45 of file prCopy.cc.
46{
49
51
53
54 poly prev;
56 {
58 prev = dest;
60
64 {
66 dest=prev;
67 }
69 }
74 return dest;
75}
static int si_min(const int a, const int b)
static FORCE_INLINE BOOLEAN n_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
static void p_LmDelete(poly p, const ring r)
static poly p_Init(const ring r, omBin bin)
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)
◆ prMoveR()
poly prMoveR |
( |
poly & | p, |
|
|
ring | r, |
|
|
ring | dest_r ) |
◆ prMoveR_NoSort()
poly prMoveR_NoSort |
( |
poly & | p, |
|
|
ring | r, |
|
|
ring | dest_r ) |
◆ prShallowCopyR()
poly prShallowCopyR |
( |
poly | p, |
|
|
ring | r, |
|
|
ring | dest_t ) |
◆ prShallowCopyR_NoSort()
poly prShallowCopyR_NoSort |
( |
poly | p, |
|
|
ring | r, |
|
|
ring | dest_t ) |