[35aab3] | 1 | /**************************************** |
---|
| 2 | * Computer Algebra System SINGULAR * |
---|
| 3 | ****************************************/ |
---|
| 4 | /*************************************************************** |
---|
| 5 | * File: pInline2.h |
---|
| 6 | * Purpose: implementation of poly procs which are of constant time |
---|
| 7 | * Author: obachman (Olaf Bachmann) |
---|
| 8 | * Created: 8/00 |
---|
[e784726] | 9 | * Version: $Id: pInline2.h,v 1.3 2004-09-28 16:04:45 Singular Exp $ |
---|
[35aab3] | 10 | *******************************************************************/ |
---|
| 11 | #ifndef PINLINE2_H |
---|
| 12 | #define PINLINE2_H |
---|
| 13 | |
---|
| 14 | /*************************************************************** |
---|
| 15 | * |
---|
| 16 | * Primitives for accessing and setting fields of a poly |
---|
| 17 | * |
---|
| 18 | ***************************************************************/ |
---|
| 19 | #if !defined(NO_PINLINE2) || defined(PINLINE2_CC) |
---|
| 20 | |
---|
| 21 | #include "structs.h" |
---|
| 22 | #include "omalloc.h" |
---|
| 23 | #include "numbers.h" |
---|
| 24 | #include "p_Procs.h" |
---|
| 25 | #include "sbuckets.h" |
---|
| 26 | #ifdef HAVE_PLURAL |
---|
| 27 | #include "gring.h" |
---|
| 28 | #include "ring.h" |
---|
| 29 | #endif |
---|
| 30 | |
---|
| 31 | PINLINE2 number p_SetCoeff(poly p, number n, ring r) |
---|
| 32 | { |
---|
| 33 | p_LmCheckPolyRing2(p, r); |
---|
| 34 | n_Delete(&(p->coef), r); |
---|
| 35 | (p)->coef=n; |
---|
| 36 | return n; |
---|
| 37 | } |
---|
| 38 | |
---|
| 39 | // order |
---|
| 40 | PINLINE2 Order_t p_GetOrder(poly p, ring r) |
---|
| 41 | { |
---|
| 42 | p_LmCheckPolyRing2(p, r); |
---|
| 43 | if (r->typ==NULL) return ((p)->exp[r->pOrdIndex]); |
---|
| 44 | int i=0; |
---|
| 45 | loop |
---|
| 46 | { |
---|
| 47 | switch(r->typ[i].ord_typ) |
---|
| 48 | { |
---|
| 49 | case ro_wp_neg: |
---|
[e784726] | 50 | return (((long)((p)->exp[r->pOrdIndex]))-POLY_NEGWEIGHT_OFFSET); |
---|
[35aab3] | 51 | case ro_syzcomp: |
---|
| 52 | case ro_syz: |
---|
| 53 | case ro_cp: |
---|
| 54 | i++; |
---|
| 55 | break; |
---|
| 56 | //case ro_dp: |
---|
| 57 | //case ro_wp: |
---|
| 58 | default: |
---|
| 59 | return ((p)->exp[r->pOrdIndex]); |
---|
| 60 | } |
---|
| 61 | } |
---|
| 62 | } |
---|
| 63 | |
---|
| 64 | PINLINE2 Order_t p_SetOrder(poly p, long o, ring r) |
---|
| 65 | { |
---|
| 66 | p_LmCheckPolyRing2(p, r); |
---|
| 67 | pAssume2(o >= 0); |
---|
| 68 | if (r->typ==NULL) return ((p)->exp[r->pOrdIndex]=o); |
---|
| 69 | int i=0; |
---|
| 70 | loop |
---|
| 71 | { |
---|
| 72 | switch(r->typ[i].ord_typ) |
---|
| 73 | { |
---|
| 74 | case ro_wp_neg: |
---|
| 75 | return (p)->exp[r->pOrdIndex]=o+POLY_NEGWEIGHT_OFFSET; |
---|
| 76 | case ro_syzcomp: |
---|
| 77 | case ro_syz: |
---|
| 78 | case ro_cp: |
---|
| 79 | i++; |
---|
| 80 | break; |
---|
| 81 | //case ro_dp: |
---|
| 82 | //case ro_wp: |
---|
| 83 | default: |
---|
| 84 | return (p)->exp[r->pOrdIndex] = o; |
---|
| 85 | } |
---|
| 86 | } |
---|
| 87 | } |
---|
| 88 | |
---|
| 89 | // Setm |
---|
| 90 | PINLINE2 void p_Setm(poly p, ring r) |
---|
| 91 | { |
---|
| 92 | p_CheckRing2(r); |
---|
| 93 | r->p_Setm(p, r); |
---|
| 94 | } |
---|
| 95 | |
---|
| 96 | // component |
---|
| 97 | PINLINE2 unsigned long p_SetComp(poly p, unsigned long c, ring r) |
---|
| 98 | { |
---|
| 99 | p_LmCheckPolyRing2(p, r); |
---|
| 100 | pAssume2(rRing_has_Comp(r)); |
---|
| 101 | __p_GetComp(p,r) = c; |
---|
| 102 | return c; |
---|
| 103 | } |
---|
| 104 | PINLINE2 unsigned long p_IncrComp(poly p, ring r) |
---|
| 105 | { |
---|
| 106 | p_LmCheckPolyRing2(p, r); |
---|
| 107 | pAssume2(rRing_has_Comp(r)); |
---|
| 108 | return ++(__p_GetComp(p,r)); |
---|
| 109 | } |
---|
| 110 | PINLINE2 unsigned long p_DecrComp(poly p, ring r) |
---|
| 111 | { |
---|
| 112 | p_LmCheckPolyRing2(p, r); |
---|
| 113 | pAssume2(rRing_has_Comp(r)); |
---|
| 114 | pPolyAssume2(__p_GetComp(p,r) > 0); |
---|
| 115 | return --(__p_GetComp(p,r)); |
---|
| 116 | } |
---|
| 117 | PINLINE2 unsigned long p_AddComp(poly p, unsigned long v, ring r) |
---|
| 118 | { |
---|
| 119 | p_LmCheckPolyRing2(p, r); |
---|
| 120 | pAssume2(rRing_has_Comp(r)); |
---|
| 121 | return __p_GetComp(p,r) += v; |
---|
| 122 | } |
---|
| 123 | PINLINE2 unsigned long p_SubComp(poly p, unsigned long v, ring r) |
---|
| 124 | { |
---|
| 125 | p_LmCheckPolyRing2(p, r); |
---|
| 126 | pAssume2(rRing_has_Comp(r)); |
---|
| 127 | pPolyAssume2(__p_GetComp(p,r) >= v); |
---|
| 128 | return __p_GetComp(p,r) -= v; |
---|
| 129 | } |
---|
| 130 | |
---|
| 131 | // exponent |
---|
| 132 | // r->VarOffset encodes the position in p->exp (lower 24 bits) |
---|
| 133 | // and number of bits to shift to the right in the upper 8 bits |
---|
| 134 | PINLINE2 int p_GetExp(poly p, int v, ring r) |
---|
| 135 | { |
---|
| 136 | p_LmCheckPolyRing2(p, r); |
---|
| 137 | pAssume2(v > 0 && v <= r->N); |
---|
| 138 | #if 0 |
---|
| 139 | int pos=(r->VarOffset[v] & 0xffffff); |
---|
| 140 | int bitpos=(r->VarOffset[v] >> 24); |
---|
| 141 | int exp=(p->exp[pos] >> bitmask) & r->bitmask; |
---|
| 142 | return exp; |
---|
| 143 | #else |
---|
| 144 | return (int) |
---|
| 145 | ((p->exp[(r->VarOffset[v] & 0xffffff)] >> (r->VarOffset[v] >> 24)) |
---|
| 146 | & r->bitmask); |
---|
| 147 | #endif |
---|
| 148 | } |
---|
| 149 | PINLINE2 int p_SetExp(poly p, int v, int e, ring r) |
---|
| 150 | { |
---|
| 151 | p_LmCheckPolyRing2(p, r); |
---|
| 152 | pAssume2(v>0 && v <= r->N); |
---|
| 153 | pAssume2(e>=0); |
---|
| 154 | pAssume2((unsigned int) e<=r->bitmask); |
---|
| 155 | |
---|
| 156 | // shift e to the left: |
---|
| 157 | register int shift = r->VarOffset[v] >> 24; |
---|
| 158 | unsigned long ee = ((unsigned long)e) << shift /*(r->VarOffset[v] >> 24)*/; |
---|
| 159 | // find the bits in the exponent vector |
---|
| 160 | register int offset = (r->VarOffset[v] & 0xffffff); |
---|
| 161 | // clear the bits in the exponent vector: |
---|
| 162 | p->exp[offset] &= ~( r->bitmask << shift ); |
---|
| 163 | // insert e with | |
---|
| 164 | p->exp[ offset ] |= ee; |
---|
| 165 | return e; |
---|
| 166 | } |
---|
| 167 | |
---|
| 168 | // the following should be implemented more efficiently |
---|
| 169 | PINLINE2 int p_IncrExp(poly p, int v, ring r) |
---|
| 170 | { |
---|
| 171 | p_LmCheckPolyRing2(p, r); |
---|
| 172 | int e = p_GetExp(p,v,r); |
---|
| 173 | e++; |
---|
| 174 | return p_SetExp(p,v,e,r); |
---|
| 175 | } |
---|
| 176 | PINLINE2 int p_DecrExp(poly p, int v, ring r) |
---|
| 177 | { |
---|
| 178 | p_LmCheckPolyRing2(p, r); |
---|
| 179 | int e = p_GetExp(p,v,r); |
---|
| 180 | pAssume2(e > 0); |
---|
| 181 | e--; |
---|
| 182 | return p_SetExp(p,v,e,r); |
---|
| 183 | } |
---|
| 184 | PINLINE2 int p_AddExp(poly p, int v, int ee, ring r) |
---|
| 185 | { |
---|
| 186 | p_LmCheckPolyRing2(p, r); |
---|
| 187 | int e = p_GetExp(p,v,r); |
---|
| 188 | e += ee; |
---|
| 189 | return p_SetExp(p,v,e,r); |
---|
| 190 | } |
---|
| 191 | PINLINE2 int p_SubExp(poly p, int v, int ee, ring r) |
---|
| 192 | { |
---|
| 193 | p_LmCheckPolyRing2(p, r); |
---|
| 194 | int e = p_GetExp(p,v,r); |
---|
| 195 | pAssume2(e >= ee); |
---|
| 196 | e -= ee; |
---|
| 197 | return p_SetExp(p,v,e,r); |
---|
| 198 | } |
---|
| 199 | PINLINE2 int p_MultExp(poly p, int v, int ee, ring r) |
---|
| 200 | { |
---|
| 201 | p_LmCheckPolyRing2(p, r); |
---|
| 202 | int e = p_GetExp(p,v,r); |
---|
| 203 | e *= ee; |
---|
| 204 | return p_SetExp(p,v,e,r); |
---|
| 205 | } |
---|
| 206 | |
---|
| 207 | PINLINE2 int p_GetExpSum(poly p1, poly p2, int i, ring r) |
---|
| 208 | { |
---|
| 209 | p_LmCheckPolyRing2(p1, r); |
---|
| 210 | p_LmCheckPolyRing2(p2, r); |
---|
| 211 | return p_GetExp(p1,i,r) + p_GetExp(p2,i,r); |
---|
| 212 | } |
---|
| 213 | PINLINE2 int p_GetExpDiff(poly p1, poly p2, int i, ring r) |
---|
| 214 | { |
---|
| 215 | return p_GetExp(p1,i,r) - p_GetExp(p2,i,r); |
---|
| 216 | } |
---|
| 217 | |
---|
| 218 | |
---|
| 219 | /*************************************************************** |
---|
| 220 | * |
---|
| 221 | * Allocation/Initalization/Deletion |
---|
| 222 | * |
---|
| 223 | ***************************************************************/ |
---|
| 224 | PINLINE2 poly p_New(ring r, omBin bin) |
---|
| 225 | { |
---|
| 226 | p_CheckRing2(r); |
---|
| 227 | pAssume2(bin != NULL && r->PolyBin->sizeW == bin->sizeW); |
---|
| 228 | poly p; |
---|
| 229 | omTypeAllocBin(poly, p, bin); |
---|
| 230 | p_SetRingOfLm(p, r); |
---|
| 231 | return p; |
---|
| 232 | } |
---|
| 233 | |
---|
| 234 | PINLINE2 poly p_New(ring r) |
---|
| 235 | { |
---|
| 236 | return p_New(r, r->PolyBin); |
---|
| 237 | } |
---|
| 238 | |
---|
| 239 | PINLINE2 void p_DeleteLm(poly *p, ring r) |
---|
| 240 | { |
---|
| 241 | pIfThen2(*p != NULL, p_LmCheckPolyRing2(*p, r)); |
---|
| 242 | poly h = *p; |
---|
| 243 | if (h != NULL) |
---|
| 244 | { |
---|
| 245 | n_Delete(&_pGetCoeff(h), r); |
---|
| 246 | *p = _pNext(h); |
---|
| 247 | omFreeBinAddr(h); |
---|
| 248 | } |
---|
| 249 | } |
---|
| 250 | PINLINE2 void p_DeleteLm(poly p, ring r) |
---|
| 251 | { |
---|
| 252 | pIfThen2(p != NULL, p_LmCheckPolyRing2(p, r)); |
---|
| 253 | if (p != NULL) |
---|
| 254 | { |
---|
| 255 | n_Delete(&_pGetCoeff(p), r); |
---|
| 256 | omFreeBinAddr(p); |
---|
| 257 | } |
---|
| 258 | } |
---|
| 259 | PINLINE2 void p_LmFree(poly p, ring r) |
---|
| 260 | { |
---|
| 261 | p_LmCheckPolyRing2(p, r); |
---|
| 262 | omFreeBinAddr(p); |
---|
| 263 | } |
---|
| 264 | PINLINE2 void p_LmFree(poly *p, ring r) |
---|
| 265 | { |
---|
| 266 | p_LmCheckPolyRing2(*p, r); |
---|
| 267 | poly h = *p; |
---|
| 268 | *p = pNext(h); |
---|
| 269 | omFreeBinAddr(h); |
---|
| 270 | } |
---|
| 271 | PINLINE2 poly p_LmFreeAndNext(poly p, ring r) |
---|
| 272 | { |
---|
| 273 | p_LmCheckPolyRing2(p, r); |
---|
| 274 | poly pnext = pNext(p); |
---|
| 275 | omFreeBinAddr(p); |
---|
| 276 | return pnext; |
---|
| 277 | } |
---|
| 278 | PINLINE2 void p_LmDelete(poly p, ring r) |
---|
| 279 | { |
---|
| 280 | p_LmCheckPolyRing2(p, r); |
---|
| 281 | n_Delete(&_pGetCoeff(p), r); |
---|
| 282 | omFreeBinAddr(p); |
---|
| 283 | } |
---|
| 284 | PINLINE2 void p_LmDelete(poly *p, ring r) |
---|
| 285 | { |
---|
| 286 | p_LmCheckPolyRing2(*p, r); |
---|
| 287 | poly h = *p; |
---|
| 288 | *p = pNext(h); |
---|
| 289 | n_Delete(&pGetCoeff(h), r); |
---|
| 290 | omFreeBinAddr(h); |
---|
| 291 | } |
---|
| 292 | PINLINE2 poly p_LmDeleteAndNext(poly p, ring r) |
---|
| 293 | { |
---|
| 294 | p_LmCheckPolyRing2(p, r); |
---|
| 295 | poly pnext = _pNext(p); |
---|
| 296 | n_Delete(&_pGetCoeff(p), r); |
---|
| 297 | omFreeBinAddr(p); |
---|
| 298 | return pnext; |
---|
| 299 | } |
---|
| 300 | |
---|
| 301 | /*************************************************************** |
---|
| 302 | * |
---|
| 303 | * Misc routines |
---|
| 304 | * |
---|
| 305 | ***************************************************************/ |
---|
| 306 | PINLINE2 int p_Cmp(poly p1, poly p2, ring r) |
---|
| 307 | { |
---|
| 308 | if (p2==NULL) |
---|
| 309 | return 1; |
---|
| 310 | if (p1==NULL) |
---|
| 311 | return -1; |
---|
| 312 | return p_LmCmp(p1,p2,r); |
---|
| 313 | } |
---|
| 314 | |
---|
| 315 | PINLINE2 unsigned long p_GetMaxExp(poly p, ring r) |
---|
| 316 | { |
---|
| 317 | return p_GetMaxExp(p_GetMaxExpL(p, r), r); |
---|
| 318 | } |
---|
| 319 | |
---|
| 320 | PINLINE2 unsigned long |
---|
| 321 | p_GetMaxExp(const unsigned long l, const ring r, const int number_of_exps) |
---|
| 322 | { |
---|
| 323 | unsigned long bitmask = r->bitmask; |
---|
| 324 | unsigned long max = (l & bitmask); |
---|
| 325 | unsigned long j = number_of_exps - 1; |
---|
| 326 | |
---|
| 327 | if (j > 0) |
---|
| 328 | { |
---|
| 329 | unsigned long i = r->BitsPerExp; |
---|
| 330 | long e; |
---|
| 331 | loop |
---|
| 332 | { |
---|
| 333 | e = ((l >> i) & bitmask); |
---|
| 334 | if ((unsigned long) e > max) |
---|
| 335 | max = e; |
---|
| 336 | j--; |
---|
| 337 | if (j==0) break; |
---|
| 338 | i += r->BitsPerExp; |
---|
| 339 | } |
---|
| 340 | } |
---|
| 341 | return max; |
---|
| 342 | } |
---|
| 343 | |
---|
| 344 | PINLINE2 unsigned long p_GetMaxExp(const unsigned long l, const ring r) |
---|
| 345 | { |
---|
| 346 | return p_GetMaxExp(l, r, r->ExpPerLong); |
---|
| 347 | } |
---|
| 348 | |
---|
| 349 | PINLINE2 unsigned long |
---|
| 350 | p_GetTotalDegree(const unsigned long l, const ring r, const int number_of_exps) |
---|
| 351 | { |
---|
| 352 | const unsigned long bitmask = r->bitmask; |
---|
| 353 | unsigned long sum = (l & bitmask); |
---|
| 354 | unsigned long j = number_of_exps - 1; |
---|
| 355 | |
---|
| 356 | if (j > 0) |
---|
| 357 | { |
---|
| 358 | unsigned long i = r->BitsPerExp; |
---|
| 359 | loop |
---|
| 360 | { |
---|
| 361 | sum += ((l >> i) & bitmask); |
---|
| 362 | j--; |
---|
| 363 | if (j==0) break; |
---|
| 364 | i += r->BitsPerExp; |
---|
| 365 | } |
---|
| 366 | } |
---|
| 367 | return sum; |
---|
| 368 | } |
---|
| 369 | |
---|
| 370 | PINLINE2 unsigned long |
---|
| 371 | p_GetTotalDegree(const unsigned long l, const ring r) |
---|
| 372 | { |
---|
| 373 | return p_GetTotalDegree(l, r, r->ExpPerLong); |
---|
| 374 | } |
---|
| 375 | |
---|
| 376 | /*************************************************************** |
---|
| 377 | * |
---|
| 378 | * Dispatcher to r->p_Procs, they do the tests/checks |
---|
| 379 | * |
---|
| 380 | ***************************************************************/ |
---|
| 381 | // returns a copy of p |
---|
| 382 | PINLINE2 poly p_Copy(poly p, const ring r) |
---|
| 383 | { |
---|
[637e70d] | 384 | #ifdef PDEBUG |
---|
| 385 | poly pp= r->p_Procs->p_Copy(p, r); |
---|
| 386 | p_Test(pp,r); |
---|
| 387 | return pp; |
---|
| 388 | #else |
---|
[35aab3] | 389 | return r->p_Procs->p_Copy(p, r); |
---|
[637e70d] | 390 | #endif |
---|
[35aab3] | 391 | } |
---|
| 392 | |
---|
| 393 | PINLINE2 poly p_Copy(poly p, const ring lmRing, const ring tailRing) |
---|
| 394 | { |
---|
| 395 | #ifndef PDEBUG |
---|
| 396 | if (tailRing == lmRing) |
---|
| 397 | return tailRing->p_Procs->p_Copy(p, tailRing); |
---|
| 398 | #endif |
---|
| 399 | if (p != NULL) |
---|
| 400 | { |
---|
| 401 | poly pres = p_Head(p, lmRing); |
---|
| 402 | pNext(pres) = tailRing->p_Procs->p_Copy(pNext(p), tailRing); |
---|
| 403 | return pres; |
---|
| 404 | } |
---|
| 405 | else |
---|
| 406 | return NULL; |
---|
| 407 | } |
---|
| 408 | |
---|
| 409 | // deletes *p, and sets *p to NULL |
---|
| 410 | PINLINE2 void p_Delete(poly *p, const ring r) |
---|
| 411 | { |
---|
| 412 | r->p_Procs->p_Delete(p, r); |
---|
| 413 | } |
---|
| 414 | |
---|
| 415 | PINLINE2 void p_Delete(poly *p, const ring lmRing, const ring tailRing) |
---|
| 416 | { |
---|
| 417 | #ifndef PDEBUG |
---|
| 418 | if (tailRing == lmRing) |
---|
| 419 | { |
---|
| 420 | tailRing->p_Procs->p_Delete(p, tailRing); |
---|
| 421 | return; |
---|
| 422 | } |
---|
| 423 | #endif |
---|
| 424 | if (*p != NULL) |
---|
| 425 | { |
---|
| 426 | if (pNext(*p) != NULL) |
---|
| 427 | tailRing->p_Procs->p_Delete(&pNext(*p), tailRing); |
---|
| 428 | p_LmDelete(p, lmRing); |
---|
| 429 | } |
---|
| 430 | } |
---|
| 431 | |
---|
| 432 | PINLINE2 poly p_ShallowCopyDelete(poly p, const ring r, omBin bin) |
---|
| 433 | { |
---|
| 434 | p_LmCheckPolyRing2(p, r); |
---|
| 435 | pAssume2(r->PolyBin->sizeW == bin->sizeW); |
---|
| 436 | return r->p_Procs->p_ShallowCopyDelete(p, r, bin); |
---|
| 437 | } |
---|
| 438 | |
---|
| 439 | // returns p+q, destroys p and q |
---|
| 440 | PINLINE2 poly p_Add_q(poly p, poly q, const ring r) |
---|
| 441 | { |
---|
| 442 | int shorter; |
---|
| 443 | return r->p_Procs->p_Add_q(p, q, shorter, r); |
---|
| 444 | } |
---|
| 445 | |
---|
| 446 | PINLINE2 poly p_Add_q(poly p, poly q, int &lp, int lq, const ring r) |
---|
| 447 | { |
---|
| 448 | int shorter; |
---|
| 449 | poly res = r->p_Procs->p_Add_q(p, q, shorter, r); |
---|
| 450 | lp = (lp + lq) - shorter; |
---|
| 451 | return res; |
---|
| 452 | } |
---|
| 453 | |
---|
| 454 | // returns p*n, destroys p |
---|
| 455 | PINLINE2 poly p_Mult_nn(poly p, number n, const ring r) |
---|
| 456 | { |
---|
| 457 | if (n_IsOne(n, r)) |
---|
| 458 | return p; |
---|
| 459 | else |
---|
| 460 | return r->p_Procs->p_Mult_nn(p, n, r); |
---|
| 461 | } |
---|
| 462 | |
---|
| 463 | PINLINE2 poly p_Mult_nn(poly p, number n, const ring lmRing, |
---|
| 464 | const ring tailRing) |
---|
| 465 | { |
---|
| 466 | #ifndef PDEBUG |
---|
| 467 | if (lmRing == tailRing) |
---|
| 468 | { |
---|
| 469 | return p_Mult_nn(p, n, tailRing); |
---|
| 470 | } |
---|
| 471 | #endif |
---|
| 472 | poly pnext = pNext(p); |
---|
| 473 | pNext(p) = NULL; |
---|
| 474 | p = lmRing->p_Procs->p_Mult_nn(p, n, lmRing); |
---|
| 475 | pNext(p) = tailRing->p_Procs->p_Mult_nn(pnext, n, tailRing); |
---|
| 476 | return p; |
---|
| 477 | } |
---|
| 478 | |
---|
| 479 | // returns p*n, does not destroy p |
---|
| 480 | PINLINE2 poly pp_Mult_nn(poly p, number n, const ring r) |
---|
| 481 | { |
---|
| 482 | if (n_IsOne(n, r)) |
---|
| 483 | return p_Copy(p, r); |
---|
| 484 | else |
---|
| 485 | return r->p_Procs->pp_Mult_nn(p, n, r); |
---|
| 486 | } |
---|
| 487 | |
---|
| 488 | // returns Copy(p)*m, does neither destroy p nor m |
---|
| 489 | PINLINE2 poly pp_Mult_mm(poly p, poly m, const ring r) |
---|
| 490 | { |
---|
| 491 | if (p_LmIsConstant(m, r)) |
---|
| 492 | return pp_Mult_nn(p, pGetCoeff(m), r); |
---|
| 493 | else |
---|
| 494 | { |
---|
| 495 | poly last; |
---|
| 496 | #ifdef HAVE_PLURAL |
---|
| 497 | if (rIsPluralRing(r)) |
---|
| 498 | return nc_pp_Mult_mm(p, m, r, last); |
---|
| 499 | #endif |
---|
| 500 | return r->p_Procs->pp_Mult_mm(p, m, r, last); |
---|
| 501 | } |
---|
| 502 | } |
---|
| 503 | |
---|
| 504 | // returns p*m, destroys p, const: m |
---|
| 505 | PINLINE2 poly p_Mult_mm(poly p, poly m, const ring r) |
---|
| 506 | { |
---|
| 507 | if (p_LmIsConstant(m, r)) |
---|
| 508 | return p_Mult_nn(p, pGetCoeff(m), r); |
---|
| 509 | else |
---|
| 510 | #ifdef HAVE_PLURAL |
---|
| 511 | if (rIsPluralRing(r)) |
---|
| 512 | return nc_p_Mult_mm(p, m, r); |
---|
| 513 | #endif |
---|
| 514 | return r->p_Procs->p_Mult_mm(p, m, r); |
---|
| 515 | } |
---|
| 516 | |
---|
| 517 | // return p - m*Copy(q), destroys p; const: p,m |
---|
| 518 | PINLINE2 poly p_Minus_mm_Mult_qq(poly p, poly m, poly q, const ring r) |
---|
| 519 | { |
---|
| 520 | int shorter; |
---|
| 521 | poly last; |
---|
| 522 | #ifdef HAVE_PLURAL |
---|
| 523 | if (rIsPluralRing(r)) |
---|
| 524 | return nc_p_Minus_mm_Mult_qq(p, m, q, r); |
---|
| 525 | #endif |
---|
| 526 | return r->p_Procs->p_Minus_mm_Mult_qq(p, m, q, shorter, NULL, r, last); |
---|
| 527 | } |
---|
| 528 | PINLINE2 poly p_Minus_mm_Mult_qq(poly p, poly m, poly q, int &lp, int lq, |
---|
| 529 | poly spNoether, const ring r) |
---|
| 530 | { |
---|
| 531 | int shorter; |
---|
| 532 | poly last,res; |
---|
| 533 | #ifdef HAVE_PLURAL |
---|
| 534 | if (rIsPluralRing(r)) |
---|
| 535 | { |
---|
| 536 | res = nc_p_Minus_mm_Mult_qq(p, m, q, r); |
---|
| 537 | lp = pLength(res); |
---|
| 538 | } |
---|
| 539 | else |
---|
| 540 | #endif |
---|
| 541 | { |
---|
| 542 | res = r->p_Procs->p_Minus_mm_Mult_qq(p, m, q, shorter, spNoether, r, last); |
---|
| 543 | lp = (lp + lq) - shorter; |
---|
| 544 | } |
---|
| 545 | return res; |
---|
| 546 | } |
---|
| 547 | |
---|
| 548 | PINLINE2 poly pp_Mult_Coeff_mm_DivSelect(poly p, const poly m, const ring r) |
---|
| 549 | { |
---|
| 550 | int shorter; |
---|
| 551 | return r->p_Procs->pp_Mult_Coeff_mm_DivSelect(p, m, shorter, r); |
---|
| 552 | } |
---|
| 553 | |
---|
| 554 | PINLINE2 poly pp_Mult_Coeff_mm_DivSelect(poly p, int &lp, const poly m, const ring r) |
---|
| 555 | { |
---|
| 556 | int shorter; |
---|
| 557 | poly pp = r->p_Procs->pp_Mult_Coeff_mm_DivSelect(p, m, shorter, r); |
---|
| 558 | lp -= shorter; |
---|
| 559 | return pp; |
---|
| 560 | } |
---|
| 561 | |
---|
| 562 | // returns -p, destroys p |
---|
| 563 | PINLINE2 poly p_Neg(poly p, const ring r) |
---|
| 564 | { |
---|
| 565 | return r->p_Procs->p_Neg(p, r); |
---|
| 566 | } |
---|
| 567 | |
---|
| 568 | extern poly _p_Mult_q(poly p, poly q, const int copy, const ring r); |
---|
| 569 | // returns p*q, destroys p and q |
---|
| 570 | PINLINE2 poly p_Mult_q(poly p, poly q, const ring r) |
---|
| 571 | { |
---|
| 572 | if (p == NULL) |
---|
| 573 | { |
---|
| 574 | r->p_Procs->p_Delete(&q, r); |
---|
| 575 | return NULL; |
---|
| 576 | } |
---|
| 577 | if (q == NULL) |
---|
| 578 | { |
---|
| 579 | r->p_Procs->p_Delete(&p, r); |
---|
| 580 | return NULL; |
---|
| 581 | } |
---|
| 582 | |
---|
| 583 | if (pNext(p) == NULL) |
---|
| 584 | { |
---|
| 585 | #ifdef HAVE_PLURAL |
---|
| 586 | if (rIsPluralRing(r)) |
---|
| 587 | q = nc_mm_Mult_p(p, q, r); |
---|
| 588 | else |
---|
| 589 | #endif /* HAVE_PLURAL */ |
---|
| 590 | q = r->p_Procs->p_Mult_mm(q, p, r); |
---|
| 591 | |
---|
| 592 | r->p_Procs->p_Delete(&p, r); |
---|
| 593 | return q; |
---|
| 594 | } |
---|
| 595 | |
---|
| 596 | if (pNext(q) == NULL) |
---|
| 597 | { |
---|
| 598 | #ifdef HAVE_PLURAL |
---|
| 599 | if (rIsPluralRing(r)) |
---|
| 600 | p = nc_p_Mult_mm(p, q, r); |
---|
| 601 | else |
---|
| 602 | #endif /* HAVE_PLURAL */ |
---|
| 603 | p = r->p_Procs->p_Mult_mm(p, q, r); |
---|
| 604 | |
---|
| 605 | r->p_Procs->p_Delete(&q, r); |
---|
| 606 | return p; |
---|
| 607 | } |
---|
| 608 | #ifdef HAVE_PLURAL |
---|
| 609 | if (rIsPluralRing(r)) |
---|
| 610 | return _nc_p_Mult_q(p, q, 0, r); |
---|
| 611 | else |
---|
| 612 | #endif |
---|
| 613 | return _p_Mult_q(p, q, 0, r); |
---|
| 614 | } |
---|
| 615 | |
---|
| 616 | // returns p*q, does neither destroy p nor q |
---|
| 617 | PINLINE2 poly pp_Mult_qq(poly p, poly q, const ring r) |
---|
| 618 | { |
---|
| 619 | poly last; |
---|
| 620 | if (p == NULL || q == NULL) return NULL; |
---|
| 621 | |
---|
| 622 | if (pNext(p) == NULL) |
---|
| 623 | { |
---|
| 624 | #ifdef HAVE_PLURAL |
---|
| 625 | if (rIsPluralRing(r)) |
---|
| 626 | return nc_mm_Mult_p(p, p_Copy(q,r), r); |
---|
| 627 | #endif |
---|
| 628 | return r->p_Procs->pp_Mult_mm(q, p, r, last); |
---|
| 629 | } |
---|
| 630 | |
---|
| 631 | if (pNext(q) == NULL) |
---|
| 632 | { |
---|
| 633 | #ifdef HAVE_PLURAL |
---|
| 634 | if (rIsPluralRing(r)) |
---|
| 635 | return nc_p_Mult_mm(p_Copy(p,r), q, r); |
---|
| 636 | #endif |
---|
| 637 | return r->p_Procs->pp_Mult_mm(p, q, r, last); |
---|
| 638 | } |
---|
| 639 | |
---|
| 640 | poly qq = q; |
---|
| 641 | if (p == q) |
---|
| 642 | qq = p_Copy(q, r); |
---|
| 643 | |
---|
| 644 | poly res; |
---|
| 645 | #ifdef HAVE_PLURAL |
---|
| 646 | if (rIsPluralRing(r)) |
---|
| 647 | res = _nc_p_Mult_q(p, qq, 1, r); |
---|
| 648 | else |
---|
| 649 | #endif |
---|
| 650 | res = _p_Mult_q(p, qq, 1, r); |
---|
| 651 | |
---|
| 652 | if (qq != q) |
---|
| 653 | p_Delete(&qq, r); |
---|
| 654 | return res; |
---|
| 655 | } |
---|
| 656 | |
---|
| 657 | // returns p + m*q destroys p, const: q, m |
---|
| 658 | // this should be implemented more efficiently |
---|
| 659 | PINLINE2 poly p_Plus_mm_Mult_qq(poly p, poly m, poly q, int &lp, int lq, |
---|
| 660 | const ring r) |
---|
| 661 | { |
---|
| 662 | poly res, last; |
---|
| 663 | int shorter; |
---|
| 664 | number n_old = pGetCoeff(m); |
---|
| 665 | number n_neg = n_Copy(n_old, r); |
---|
| 666 | n_neg = n_Neg(n_neg, r); |
---|
| 667 | pSetCoeff0(m, n_neg); |
---|
| 668 | #ifdef HAVE_PLURAL |
---|
| 669 | if (rIsPluralRing(r)) |
---|
| 670 | res = nc_p_Minus_mm_Mult_qq(p, m, q, r); |
---|
| 671 | else |
---|
| 672 | #endif |
---|
| 673 | res = r->p_Procs->p_Minus_mm_Mult_qq(p, m, q, shorter, NULL, r, last); |
---|
| 674 | |
---|
| 675 | lp = (lp + lq) - shorter; |
---|
| 676 | pSetCoeff0(m, n_old); |
---|
| 677 | n_Delete(&n_neg, r); |
---|
| 678 | return res; |
---|
| 679 | } |
---|
| 680 | |
---|
| 681 | PINLINE2 poly p_Plus_mm_Mult_qq(poly p, poly m, poly q, const ring r) |
---|
| 682 | { |
---|
| 683 | int lp = 0, lq = 0; |
---|
| 684 | return p_Plus_mm_Mult_qq(p, m, q, lp, lq, r); |
---|
| 685 | } |
---|
| 686 | |
---|
| 687 | PINLINE2 poly p_Merge_q(poly p, poly q, const ring r) |
---|
| 688 | { |
---|
| 689 | return r->p_Procs->p_Merge_q(p, q, r); |
---|
| 690 | } |
---|
| 691 | |
---|
| 692 | PINLINE2 poly p_SortAdd(poly p, const ring r, BOOLEAN revert) |
---|
| 693 | { |
---|
| 694 | if (revert) p = pReverse(p); |
---|
| 695 | return sBucketSortAdd(p, r); |
---|
| 696 | } |
---|
| 697 | |
---|
| 698 | PINLINE2 poly p_SortMerge(poly p, const ring r, BOOLEAN revert) |
---|
| 699 | { |
---|
| 700 | if (revert) p = pReverse(p); |
---|
| 701 | return sBucketSortMerge(p, r); |
---|
| 702 | } |
---|
| 703 | |
---|
| 704 | /*************************************************************** |
---|
| 705 | * |
---|
| 706 | * I/O |
---|
| 707 | * |
---|
| 708 | ***************************************************************/ |
---|
| 709 | PINLINE2 char* p_String(poly p, ring p_ring) |
---|
| 710 | { |
---|
| 711 | return p_String(p, p_ring, p_ring); |
---|
| 712 | } |
---|
| 713 | PINLINE2 char* p_String0(poly p, ring p_ring) |
---|
| 714 | { |
---|
| 715 | return p_String0(p, p_ring, p_ring); |
---|
| 716 | } |
---|
| 717 | PINLINE2 void p_Write(poly p, ring p_ring) |
---|
| 718 | { |
---|
| 719 | p_Write(p, p_ring, p_ring); |
---|
| 720 | } |
---|
| 721 | PINLINE2 void p_Write0(poly p, ring p_ring) |
---|
| 722 | { |
---|
| 723 | p_Write0(p, p_ring, p_ring); |
---|
| 724 | } |
---|
| 725 | PINLINE2 void p_wrp(poly p, ring p_ring) |
---|
| 726 | { |
---|
| 727 | p_wrp(p, p_ring, p_ring); |
---|
| 728 | } |
---|
| 729 | #endif // !defined(NO_PINLINE2) || defined(POLYS_IMPL_CC) |
---|
| 730 | #endif // PINLINE2_H |
---|