 |
My Project
debian-1:4.1.1-p2+ds-4build1
|
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
◆ idrCopyR()
ideal idrCopyR |
( |
ideal |
id, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 192 of file prCopy.cc.
194 assume(src_r->cf==dest_r->cf);
198 prproc = pr_Copy_NoREqual_NSimple_Sort;
200 prproc = pr_Copy_NoREqual_NoNSimple_Sort;
◆ idrCopyR_NoSort()
ideal idrCopyR_NoSort |
( |
ideal |
id, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 205 of file prCopy.cc.
207 assume(src_r->cf==dest_r->cf);
211 prproc = pr_Copy_NoREqual_NSimple_NoSort;
213 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 156 of file prCopy.cc.
160 prCopyProc_t prproc = pr_Copy_NoREqual_NoNSimple_NoSort;
162 prproc = pr_Copy_NoREqual_NSimple_NoSort;
167 for (
int i =
N - 1;
i >= 0;
i--)
◆ idrMoveR()
ideal idrMoveR |
( |
ideal & |
id, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 248 of file prCopy.cc.
250 assume(src_r->cf==dest_r->cf);
254 prproc = pr_Move_NoREqual_NSimple_Sort;
256 prproc = pr_Move_NoREqual_NoNSimple_Sort;
◆ idrMoveR_NoSort()
ideal idrMoveR_NoSort |
( |
ideal & |
id, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 261 of file prCopy.cc.
263 assume(src_r->cf==dest_r->cf);
267 prproc = pr_Move_NoREqual_NSimple_NoSort;
269 prproc = pr_Move_NoREqual_NoNSimple_NoSort;
◆ idrShallowCopyR()
ideal idrShallowCopyR |
( |
ideal |
id, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 220 of file prCopy.cc.
222 return idrCopy(
id, src_r, dest_r, pr_Copy_NoREqual_NSimple_Sort);
◆ idrShallowCopyR_NoSort()
ideal idrShallowCopyR_NoSort |
( |
ideal |
id, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 225 of file prCopy.cc.
227 return idrCopy(
id, src_r, dest_r, pr_Copy_NoREqual_NSimple_NoSort);
◆ prCopyR()
poly prCopyR |
( |
poly |
p, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 35 of file prCopy.cc.
39 res = pr_Copy_NoREqual_NSimple_Sort(
p, src_r, dest_r);
41 res = pr_Copy_NoREqual_NoNSimple_Sort(
p, src_r, dest_r);
◆ prCopyR_NoSort()
poly prCopyR_NoSort |
( |
poly |
p, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 77 of file prCopy.cc.
81 res = pr_Copy_NoREqual_NSimple_NoSort(
p, src_r, dest_r);
83 res = pr_Copy_NoREqual_NoNSimple_NoSort(
p, src_r, dest_r);
◆ prHeadR()
poly prHeadR |
( |
poly |
p, |
|
|
ring |
r, |
|
|
ring |
dest_rg |
|
) |
| |
Definition at line 141 of file prCopy.cc.
145 prproc = pr_Copy_NoREqual_NSimple_NoSort;
147 prproc = pr_Copy_NoREqual_NoNSimple_NoSort;
149 const poly
res =
prHeadR(
p, src_r, dest_r, prproc);
◆ prMapR()
poly prMapR |
( |
poly |
src, |
|
|
nMapFunc |
nMap, |
|
|
ring |
src_r, |
|
|
ring |
dest_r |
|
) |
| |
◆ prMoveR()
poly prMoveR |
( |
poly & |
p, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 90 of file prCopy.cc.
94 res = pr_Move_NoREqual_NSimple_Sort(
p, src_r, dest_r);
96 res = pr_Move_NoREqual_NoNSimple_Sort(
p, src_r, dest_r);
◆ prMoveR_NoSort()
poly prMoveR_NoSort |
( |
poly & |
p, |
|
|
ring |
r, |
|
|
ring |
dest_r |
|
) |
| |
Definition at line 101 of file prCopy.cc.
105 res = pr_Move_NoREqual_NSimple_NoSort(
p, src_r, dest_r);
107 res = pr_Move_NoREqual_NoNSimple_NoSort(
p, src_r, dest_r);
◆ prShallowCopyR()
poly prShallowCopyR |
( |
poly |
p, |
|
|
ring |
r, |
|
|
ring |
dest_t |
|
) |
| |
Definition at line 117 of file prCopy.cc.
119 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 112 of file prCopy.cc.
114 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)
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 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 void p_LmDelete(poly p, const ring r)
static poly p_Init(const ring r, omBin bin)
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
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)