[35aab3] | 1 | /**************************************** |
---|
| 2 | * Computer Algebra System SINGULAR * |
---|
| 3 | ****************************************/ |
---|
| 4 | /* |
---|
| 5 | * ABSTRACT - implementation of functions for Copy/Move/Delete for Polys |
---|
| 6 | */ |
---|
| 7 | |
---|
[16f511] | 8 | #ifdef HAVE_CONFIG_H |
---|
[ba5e9e] | 9 | #include "libpolysconfig.h" |
---|
[16f511] | 10 | #endif /* HAVE_CONFIG_H */ |
---|
[b1dfaf] | 11 | #include <omalloc/omalloc.h> |
---|
[e0d8d1] | 12 | #include <polys/monomials/ring.h> |
---|
[6bec87] | 13 | #include <polys/monomials/p_polys.h> |
---|
[20b794] | 14 | #include <coeffs/numbers.h> |
---|
| 15 | #include <polys/monomials/ring.h> |
---|
[e0d8d1] | 16 | #include <polys/simpleideals.h> |
---|
[20b794] | 17 | // #include <polys/sbuckets.h> |
---|
[35aab3] | 18 | |
---|
| 19 | static inline void |
---|
| 20 | prCopyEvector(poly dest, ring dest_r, poly src, ring src_r,int max) |
---|
| 21 | { |
---|
[c985c5] | 22 | //memset(dest->exp,0,dest_r->ExpL_Size*sizeof(long)); |
---|
[35aab3] | 23 | int i; |
---|
| 24 | for (i=max; i>0; i--) |
---|
| 25 | { |
---|
| 26 | p_SetExp(dest, i, p_GetExp( src, i,src_r), dest_r); |
---|
| 27 | } |
---|
[8ebd1a0] | 28 | if (rRing_has_Comp(dest_r) && rRing_has_Comp(src_r)) |
---|
[35aab3] | 29 | p_SetComp(dest, p_GetComp( src,src_r), dest_r); |
---|
| 30 | p_Setm(dest, dest_r); |
---|
| 31 | } |
---|
| 32 | |
---|
[e0d8d1] | 33 | #include <polys/prCopy.inc> |
---|
[35aab3] | 34 | |
---|
| 35 | ///////////////////////////////////////////////////////////////////////// |
---|
| 36 | poly prCopyR(poly p, ring src_r, ring dest_r) |
---|
| 37 | { |
---|
| 38 | poly res; |
---|
| 39 | if (rField_has_simple_Alloc(dest_r)) |
---|
| 40 | res = pr_Copy_NoREqual_NSimple_Sort(p, src_r, dest_r); |
---|
| 41 | else |
---|
| 42 | res = pr_Copy_NoREqual_NoNSimple_Sort(p, src_r, dest_r); |
---|
| 43 | p_Test(res, dest_r); |
---|
| 44 | return res; |
---|
| 45 | } |
---|
| 46 | |
---|
[14086c2] | 47 | poly prMapR(poly src, nMapFunc nMap, ring src_r, ring dest_r) |
---|
| 48 | { |
---|
| 49 | if (src==NULL) return NULL; |
---|
| 50 | int _min = si_min(dest_r->N, src_r->N); |
---|
| 51 | |
---|
| 52 | spolyrec dest_s; |
---|
| 53 | |
---|
| 54 | poly dest = &dest_s; |
---|
| 55 | |
---|
| 56 | while (src != NULL) |
---|
| 57 | { |
---|
| 58 | poly prev=dest; |
---|
[4e4e24b] | 59 | pNext(dest) = (poly) p_Init(dest_r); pIter(dest); |
---|
[14086c2] | 60 | |
---|
| 61 | pSetCoeff0(dest, nMap(pGetCoeff(src),src_r->cf,dest_r->cf)); |
---|
| 62 | prCopyEvector(dest, dest_r, src, src_r, _min); |
---|
| 63 | if (n_IsZero(pGetCoeff(dest),dest_r->cf)) |
---|
| 64 | { |
---|
| 65 | p_LmDelete(pNext(prev),dest_r); |
---|
| 66 | dest=pNext(prev); |
---|
| 67 | } |
---|
| 68 | pIter(src); |
---|
| 69 | } |
---|
| 70 | pNext(dest) = NULL; |
---|
| 71 | dest = pNext(&dest_s); |
---|
| 72 | dest=p_SortAdd(dest, dest_r); |
---|
| 73 | p_Test(dest, dest_r); |
---|
| 74 | return dest; |
---|
| 75 | } |
---|
| 76 | |
---|
[35aab3] | 77 | poly prCopyR_NoSort(poly p, ring src_r, ring dest_r) |
---|
| 78 | { |
---|
| 79 | poly res; |
---|
| 80 | if (rField_has_simple_Alloc(dest_r)) |
---|
| 81 | res = pr_Copy_NoREqual_NSimple_NoSort(p, src_r, dest_r); |
---|
| 82 | else |
---|
| 83 | res = pr_Copy_NoREqual_NoNSimple_NoSort(p, src_r, dest_r); |
---|
| 84 | p_Test(res, dest_r); |
---|
| 85 | return res; |
---|
| 86 | } |
---|
| 87 | |
---|
| 88 | ///////////////////////////////////////////////////////////////////////// |
---|
| 89 | // prMove |
---|
| 90 | poly prMoveR(poly &p, ring src_r, ring dest_r) |
---|
| 91 | { |
---|
| 92 | poly res; |
---|
| 93 | if (rField_has_simple_Alloc(dest_r)) |
---|
| 94 | res = pr_Move_NoREqual_NSimple_Sort(p, src_r, dest_r); |
---|
| 95 | else |
---|
| 96 | res = pr_Move_NoREqual_NoNSimple_Sort(p, src_r, dest_r); |
---|
| 97 | p_Test(res, dest_r); |
---|
| 98 | return res; |
---|
| 99 | } |
---|
| 100 | |
---|
| 101 | poly prMoveR_NoSort(poly &p, ring src_r, ring dest_r) |
---|
| 102 | { |
---|
| 103 | poly res; |
---|
| 104 | if (rField_has_simple_Alloc(dest_r)) |
---|
| 105 | res = pr_Move_NoREqual_NSimple_NoSort(p, src_r, dest_r); |
---|
| 106 | else |
---|
| 107 | res = pr_Move_NoREqual_NoNSimple_NoSort(p, src_r, dest_r); |
---|
[6dccbc] | 108 | p_Test(res, dest_r); |
---|
[35aab3] | 109 | return res; |
---|
| 110 | } |
---|
| 111 | |
---|
| 112 | poly prShallowCopyR_NoSort(poly p, ring r, ring dest_r) |
---|
| 113 | { |
---|
| 114 | return pr_Copy_NoREqual_NSimple_NoSort(p, r, dest_r); |
---|
| 115 | } |
---|
| 116 | |
---|
[e0d8d1] | 117 | poly prShallowCopyR(poly p, ring r, ring dest_r) |
---|
[35aab3] | 118 | { |
---|
| 119 | return pr_Copy_NoREqual_NSimple_Sort(p, r, dest_r); |
---|
| 120 | } |
---|
| 121 | |
---|
| 122 | ///////////////////////////////////////////////////////////////////////// |
---|
| 123 | // prHead |
---|
| 124 | typedef poly (*prCopyProc_t)(poly &src_p, ring src_r, ring dest_r); |
---|
| 125 | |
---|
| 126 | poly prHeadR(poly p, ring src_r, ring dest_r, prCopyProc_t prproc) |
---|
| 127 | { |
---|
| 128 | if (p == NULL) return NULL; |
---|
| 129 | poly tail, head, q = p; |
---|
| 130 | tail = pNext(p); |
---|
| 131 | pNext(p) = NULL; |
---|
| 132 | head = prproc(q, src_r, dest_r); |
---|
| 133 | pNext(p) = tail; |
---|
[6dccbc] | 134 | |
---|
| 135 | p_Test(p, src_r); |
---|
| 136 | p_Test(head, dest_r); |
---|
| 137 | |
---|
[35aab3] | 138 | return head; |
---|
| 139 | } |
---|
| 140 | |
---|
| 141 | poly prHeadR(poly p, ring src_r, ring dest_r) |
---|
| 142 | { |
---|
| 143 | prCopyProc_t prproc; |
---|
[6dccbc] | 144 | if (rField_has_simple_Alloc(dest_r)) |
---|
[35aab3] | 145 | prproc = pr_Copy_NoREqual_NSimple_NoSort; |
---|
| 146 | else |
---|
[6dccbc] | 147 | prproc = pr_Copy_NoREqual_NoNSimple_NoSort; |
---|
| 148 | |
---|
| 149 | const poly res = prHeadR(p, src_r, dest_r, prproc); |
---|
| 150 | p_Test(res, dest_r); |
---|
| 151 | return res; |
---|
[35aab3] | 152 | } |
---|
| 153 | |
---|
| 154 | ///////////////////////////////////////////////////////////////////////// |
---|
[6dccbc] | 155 | /// Copy leading terms of id[i] via prHeeadR into dest_r |
---|
| 156 | ideal idrHeadR(ideal id, ring r, ring dest_r) |
---|
| 157 | { |
---|
| 158 | if (id == NULL) return NULL; |
---|
| 159 | |
---|
| 160 | prCopyProc_t prproc = pr_Copy_NoREqual_NoNSimple_NoSort; |
---|
| 161 | if (rField_has_simple_Alloc(dest_r)) |
---|
| 162 | prproc = pr_Copy_NoREqual_NSimple_NoSort; |
---|
| 163 | |
---|
| 164 | const int N = IDELEMS(id); |
---|
| 165 | ideal res = idInit(N, id->rank); |
---|
| 166 | |
---|
| 167 | for (int i = N - 1; i >= 0; i--) |
---|
| 168 | res->m[i] = prHeadR(id->m[i], r, dest_r, prproc); // !!! |
---|
| 169 | |
---|
| 170 | return res; |
---|
| 171 | } |
---|
| 172 | |
---|
| 173 | |
---|
[35aab3] | 174 | static inline ideal |
---|
| 175 | idrCopy(ideal id, ring src_r, ring dest_r, prCopyProc_t prproc) |
---|
| 176 | { |
---|
| 177 | if (id == NULL) return NULL; |
---|
[f7286a] | 178 | assume(src_r->cf==dest_r->cf); |
---|
[35aab3] | 179 | poly p; |
---|
| 180 | ideal res = idInit(IDELEMS(id), id->rank); |
---|
| 181 | int i; |
---|
| 182 | |
---|
| 183 | for (i=IDELEMS(id)-1; i>=0; i--) |
---|
| 184 | { |
---|
| 185 | p = id->m[i]; |
---|
| 186 | res->m[i] = prproc(p, src_r, dest_r); |
---|
| 187 | p_Test(res->m[i], dest_r); |
---|
| 188 | } |
---|
| 189 | return res; |
---|
| 190 | } |
---|
| 191 | |
---|
| 192 | ideal idrCopyR(ideal id, ring src_r, ring dest_r) |
---|
| 193 | { |
---|
[f7286a] | 194 | assume(src_r->cf==dest_r->cf); |
---|
[35aab3] | 195 | ideal res; |
---|
| 196 | prCopyProc_t prproc; |
---|
[6dccbc] | 197 | if (rField_has_simple_Alloc(dest_r)) |
---|
[35aab3] | 198 | prproc = pr_Copy_NoREqual_NSimple_Sort; |
---|
| 199 | else |
---|
| 200 | prproc = pr_Copy_NoREqual_NoNSimple_Sort; |
---|
| 201 | res = idrCopy(id, src_r, dest_r, prproc); |
---|
| 202 | return res; |
---|
| 203 | } |
---|
[6dccbc] | 204 | |
---|
[35aab3] | 205 | ideal idrCopyR_NoSort(ideal id, ring src_r, ring dest_r) |
---|
| 206 | { |
---|
[f7286a] | 207 | assume(src_r->cf==dest_r->cf); |
---|
[35aab3] | 208 | ideal res; |
---|
| 209 | prCopyProc_t prproc; |
---|
[6dccbc] | 210 | if (rField_has_simple_Alloc(dest_r)) |
---|
[35aab3] | 211 | prproc = pr_Copy_NoREqual_NSimple_NoSort; |
---|
| 212 | else |
---|
| 213 | prproc = pr_Copy_NoREqual_NoNSimple_NoSort; |
---|
| 214 | res = idrCopy(id, src_r, dest_r, prproc); |
---|
| 215 | return res; |
---|
| 216 | } |
---|
| 217 | |
---|
| 218 | ///////////////////////////////////////////////////////////////////////// |
---|
| 219 | // idrShallowCopy |
---|
| 220 | ideal idrShallowCopyR(ideal id, ring src_r, ring dest_r) |
---|
| 221 | { |
---|
| 222 | return idrCopy(id, src_r, dest_r, pr_Copy_NoREqual_NSimple_Sort); |
---|
| 223 | } |
---|
[6dccbc] | 224 | |
---|
[35aab3] | 225 | ideal idrShallowCopyR_NoSort(ideal id, ring src_r, ring dest_r) |
---|
| 226 | { |
---|
| 227 | return idrCopy(id, src_r, dest_r, pr_Copy_NoREqual_NSimple_NoSort); |
---|
| 228 | } |
---|
[6dccbc] | 229 | |
---|
[35aab3] | 230 | ///////////////////////////////////////////////////////////////////////// |
---|
| 231 | // idrMove |
---|
| 232 | static inline ideal |
---|
| 233 | idrMove(ideal &id, ring src_r, ring dest_r, prCopyProc_t prproc) |
---|
| 234 | { |
---|
[f7286a] | 235 | assume(src_r->cf==dest_r->cf); |
---|
[69745c] | 236 | assume( prproc != NULL ); |
---|
[14086c2] | 237 | |
---|
[35aab3] | 238 | if (id == NULL) return NULL; |
---|
| 239 | |
---|
[69745c] | 240 | ideal res = id; id = NULL; |
---|
| 241 | |
---|
| 242 | for (int i = IDELEMS(res) - 1; i >= 0; i--) |
---|
| 243 | res->m[i] = prproc(res->m[i], src_r, dest_r); |
---|
[14086c2] | 244 | |
---|
[35aab3] | 245 | return res; |
---|
| 246 | } |
---|
| 247 | |
---|
| 248 | ideal idrMoveR(ideal &id, ring src_r, ring dest_r) |
---|
| 249 | { |
---|
[f7286a] | 250 | assume(src_r->cf==dest_r->cf); |
---|
[35aab3] | 251 | prCopyProc_t prproc; |
---|
| 252 | ideal res; |
---|
[6dccbc] | 253 | if (rField_has_simple_Alloc(dest_r)) |
---|
[35aab3] | 254 | prproc = pr_Move_NoREqual_NSimple_Sort; |
---|
| 255 | else |
---|
| 256 | prproc = pr_Move_NoREqual_NoNSimple_Sort; |
---|
| 257 | res = idrMove(id, src_r, dest_r, prproc); |
---|
| 258 | return res; |
---|
| 259 | } |
---|
[6dccbc] | 260 | |
---|
[35aab3] | 261 | ideal idrMoveR_NoSort(ideal &id, ring src_r, ring dest_r) |
---|
| 262 | { |
---|
[f7286a] | 263 | assume(src_r->cf==dest_r->cf); |
---|
[35aab3] | 264 | prCopyProc_t prproc; |
---|
| 265 | ideal res; |
---|
[6dccbc] | 266 | if (rField_has_simple_Alloc(dest_r)) |
---|
[35aab3] | 267 | prproc = pr_Move_NoREqual_NSimple_NoSort; |
---|
| 268 | else |
---|
| 269 | prproc = pr_Move_NoREqual_NoNSimple_NoSort; |
---|
| 270 | res = idrMove(id, src_r, dest_r, prproc); |
---|
| 271 | return res; |
---|
| 272 | } |
---|
| 273 | |
---|
[6dccbc] | 274 | |
---|