31 #include "polys/prCopy.inc"
38 res = pr_Copy_NoREqual_NSimple_Sort(
p, src_r, dest_r);
40 res = pr_Copy_NoREqual_NoNSimple_Sort(
p, src_r, dest_r);
48 int _min =
si_min(dest_r->N, src_r->N);
70 dest =
pNext(&dest_s);
80 res = pr_Copy_NoREqual_NSimple_NoSort(
p, src_r, dest_r);
82 res = pr_Copy_NoREqual_NoNSimple_NoSort(
p, src_r, dest_r);
93 res = pr_Move_NoREqual_NSimple_Sort(
p, src_r, dest_r);
95 res = pr_Move_NoREqual_NoNSimple_Sort(
p, src_r, dest_r);
104 res = pr_Move_NoREqual_NSimple_NoSort(
p, src_r, dest_r);
106 res = pr_Move_NoREqual_NoNSimple_NoSort(
p, src_r, dest_r);
113 return pr_Copy_NoREqual_NSimple_NoSort(
p, r, dest_r);
118 return pr_Copy_NoREqual_NSimple_Sort(
p, r, dest_r);
128 poly tail,
head, q =
p;
131 head = prproc(q, src_r, dest_r);
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);
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--)
177 assume(src_r->cf==dest_r->cf);
185 res->m[
i] = prproc(
p, src_r, dest_r);
193 assume(src_r->cf==dest_r->cf);
197 prproc = pr_Copy_NoREqual_NSimple_Sort;
199 prproc = pr_Copy_NoREqual_NoNSimple_Sort;
206 assume(src_r->cf==dest_r->cf);
210 prproc = pr_Copy_NoREqual_NSimple_NoSort;
212 prproc = pr_Copy_NoREqual_NoNSimple_NoSort;
221 return idrCopy(
id, src_r, dest_r, pr_Copy_NoREqual_NSimple_Sort);
226 return idrCopy(
id, src_r, dest_r, pr_Copy_NoREqual_NSimple_NoSort);
234 assume(src_r->cf==dest_r->cf);
242 res->m[
i] = prproc(
res->m[
i], src_r, dest_r);
249 assume(src_r->cf==dest_r->cf);
253 prproc = pr_Move_NoREqual_NSimple_Sort;
255 prproc = pr_Move_NoREqual_NoNSimple_Sort;
262 assume(src_r->cf==dest_r->cf);
266 prproc = pr_Move_NoREqual_NSimple_NoSort;
268 prproc = pr_Move_NoREqual_NoNSimple_NoSort;