32 #include "polys/prCopy.inc"
39 res = pr_Copy_NoREqual_NSimple_Sort(
p, src_r, dest_r);
41 res = pr_Copy_NoREqual_NoNSimple_Sort(
p, src_r, dest_r);
49 int _min =
si_min(dest_r->N, src_r->N);
71 dest =
pNext(&dest_s);
81 res = pr_Copy_NoREqual_NSimple_NoSort(
p, src_r, dest_r);
83 res = pr_Copy_NoREqual_NoNSimple_NoSort(
p, src_r, dest_r);
94 res = pr_Move_NoREqual_NSimple_Sort(
p, src_r, dest_r);
96 res = pr_Move_NoREqual_NoNSimple_Sort(
p, src_r, dest_r);
105 res = pr_Move_NoREqual_NSimple_NoSort(
p, src_r, dest_r);
107 res = pr_Move_NoREqual_NoNSimple_NoSort(
p, src_r, dest_r);
114 return pr_Copy_NoREqual_NSimple_NoSort(
p, r, dest_r);
119 return pr_Copy_NoREqual_NSimple_Sort(
p, r, dest_r);
129 poly tail,
head, q =
p;
132 head = prproc(q, src_r, dest_r);
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);
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--)
178 assume(src_r->cf==dest_r->cf);
186 res->m[
i] = prproc(
p, src_r, dest_r);
194 assume(src_r->cf==dest_r->cf);
198 prproc = pr_Copy_NoREqual_NSimple_Sort;
200 prproc = pr_Copy_NoREqual_NoNSimple_Sort;
207 assume(src_r->cf==dest_r->cf);
211 prproc = pr_Copy_NoREqual_NSimple_NoSort;
213 prproc = pr_Copy_NoREqual_NoNSimple_NoSort;
222 return idrCopy(
id, src_r, dest_r, pr_Copy_NoREqual_NSimple_Sort);
227 return idrCopy(
id, src_r, dest_r, pr_Copy_NoREqual_NSimple_NoSort);
235 assume(src_r->cf==dest_r->cf);
243 res->m[
i] = prproc(
res->m[
i], src_r, dest_r);
250 assume(src_r->cf==dest_r->cf);
254 prproc = pr_Move_NoREqual_NSimple_Sort;
256 prproc = pr_Move_NoREqual_NoNSimple_Sort;
263 assume(src_r->cf==dest_r->cf);
267 prproc = pr_Move_NoREqual_NSimple_NoSort;
269 prproc = pr_Move_NoREqual_NoNSimple_NoSort;