/usr/include/FLINT/fmpz_poly.h is in libflint-dev 1.011-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 | /*============================================================================
This file is part of FLINT.
FLINT is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
FLINT is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with FLINT; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
===============================================================================*/
/****************************************************************************
fmpz_poly.h: Polynomials over Z, implemented as contiguous block of fmpz_t's
Copyright (C) 2007, William Hart and David Harvey
*****************************************************************************/
#ifndef FLINT_FMPZ_POLY_H
#define FLINT_FMPZ_POLY_H
#ifdef __cplusplus
extern "C" {
#endif
#include <stdlib.h>
#include <stdio.h>
#include <gmp.h>
#include "mpn_extras.h"
#include "fmpz.h"
#include "zmod_poly.h"
/****************************************************************************
fmpz_poly_t
-----------
fmpz_poly_t represents a dense polynomial in Z[x] using a single block of
memory to hold all the coefficients.
This type is better suited to handling very dense polynomials with relatively
small coefficients, where the memory management overhead of Zpoly_t would
be too expensive.
"coeffs" is an array of limbs of length (alloc * (limbs+1)). Each
coefficient uses limbs+1 limbs. For each coefficient, the first limb is
a sign/size limb: the number of limbs of the absolute value of the
coefficient is given by the absolute value of this limb, and the sign
of this limb is the sign of the coefficient. (Zero is stored as a
sign/size of zero followed by arbitrary data.) The remaining "limbs"
limbs represent the absolute value of the coefficient, stored in
GMP's mpn format.
Only the first "length" coefficients actually represent coefficients
of the polynomial; i.e. it's a polynomial of degree at most length-1.
If length == 0, this is the zero polynomial. All functions normalise
so that the (length-1)-th coefficient is non-zero.
Obviously always alloc >= length.
There are two classes of functions operating on fmpz_poly_t:
-- The _fmpz_poly_* functions NEVER free or reallocate "coeffs", so they
don't care how "coeffs" was allocated, and they never even look at the
"alloc" attribute. They always assume the output has enough space for
the result. They also NEVER modify the limbs attribute (since this
would screw up the block size).
-- The fmpz_poly_* functions ASSUME that "coeffs" was allocated via
flint_heap_alloc, and they MAY free or reallocate "coeffs" using
flint_heap_realloc, flint_heap_free etc, whenever they feel the need.
*/
typedef struct
{
mp_limb_t* coeffs;
unsigned long alloc;
unsigned long length;
unsigned long limbs;
} fmpz_poly_struct;
// fmpz_poly_t allows reference-like semantics for fmpz_poly_struct:
typedef fmpz_poly_struct fmpz_poly_t[1];
typedef fmpz_poly_struct * fmpz_poly_p;
#define SWAP(x_dummy, y_dummy) \
do { \
fmpz_poly_p swap_temp = x_dummy; \
x_dummy = y_dummy; \
y_dummy = swap_temp; \
} while(0);
#define SWAP_PTRS(x_dummy_p, y_dummy_p) \
do { \
fmpz_t swap_temp_p = x_dummy_p; \
x_dummy_p = y_dummy_p; \
y_dummy_p = swap_temp_p; \
} while(0);
/****************************************************************************
Conversion Routines
****************************************************************************/
/*
Converts fmpz_poly_t "poly_fmpz" to a ZmodF_poly.
Each coefficient of poly_fmpz is assumed to fit into a coefficient
of poly_f.
The maximum number of *bits* that any coefficient takes is returned
and made negative if any of the coefficients was negative.
Only _length_ coefficients are converted.
Assumes 0 < length <= poly_fmpz->length
*/
long fmpz_poly_to_ZmodF_poly(ZmodF_poly_t poly_f, const fmpz_poly_t poly_fmpz,
const unsigned long length);
/*
Normalise and converts ZmodF_poly "poly_f" to a fmpz_poly_t.
Each coefficient of poly_f is assumed to fit into a coefficient
of poly_fmpz.
The normalisation ensures that this function is the inverse of
ZmodF_poly_convert_in_mpn.
Assumes 0 < poly_f->length
*/
void ZmodF_poly_to_fmpz_poly(fmpz_poly_t poly_fmpz, const ZmodF_poly_t poly_f, const long sign);
/*
Packs bundle coefficients, each padded out to the given number of limbs, into
the first coefficient of poly_f.
Assumes 0 < bundle <= poly_fmpz->length
*/
void fmpz_poly_limb_pack(ZmodF_poly_t poly_f, const fmpz_poly_t poly_fmpz,
const unsigned long bundle, const long limbs);
/*
Unpacks bundle coefficients from the first coefficient of poly_f, each
assumed to be stored in a field of the given number of limbs.
Assumes 0 < bundle <= poly_f->length
*/
void fmpz_poly_limb_unpack(fmpz_poly_t poly_fmpz, const ZmodF_poly_t poly_f,
const unsigned long bundle, const unsigned long limbs);
/*
Unpacks bundle coefficients from the first coefficient of poly_f, each
assumed to be stored in a field of the given number of limbs. Assumes the
coefficients are unsigned.
Assumes 0 < bundle <= poly_f->length
*/
void fmpz_poly_limb_unpack_unsigned(fmpz_poly_t poly_fmpz, const ZmodF_poly_t poly_f,
const unsigned long bundle, const unsigned long limbs);
/*
Packs poly_fmpz down to the bit into poly_f. Each coefficient of poly_f
will have "bundle" coefficients packed into it. Each of the original
coefficients is packed into a bitfield "bits" bits wide including one
bit for a sign bit.
"bits" is assumed to be less than FLINT_BITS. If bits is
negative, the input poly is assumed to have signed coefficients.
Assumes 0 < bundle and 0 < poly_fmpz->length
*/
void fmpz_poly_bit_pack(ZmodF_poly_t poly_f, const fmpz_poly_t poly_fmpz,
const unsigned long bundle, const long bits, const unsigned long length, const long negate);
/*
Unpacks poly_f into poly_fmpz. This is the inverse of ZmodF_poly_bitpack_mpn, so
long as the final coefficient in the polynomial is positive.
Each coeff of poly_f is assumed to contain "bundle" coefficients, each stored
in a bitfield "bits" bits wide with the most significant bit being reserved for
the sign.
The total number of coefficients to be unpacked is given by the length of
poly_fmpz. One must ensure each of the coefficients of poly_fmpz are set to zero
before calling this function for the first time since it adds to existing
coefficients of poly_fmpz, rather than overwriting them.
"bits" is assumed to be less than FLINT_BITS.
Assumes 0 < bundle and 0 < poly_f->length
*/
void fmpz_poly_bit_unpack(fmpz_poly_t poly_fmpz, const ZmodF_poly_t poly_f,
const unsigned long bundle, const unsigned long bits);
void fmpz_poly_bit_unpack_unsigned(fmpz_poly_t poly_fmpz, const ZmodF_poly_t poly_f,
const unsigned long bundle, const unsigned long bits);
/*
Packs poly_fmpz down to the byte into poly_f. Each coefficient of poly_f
will have "bundle" coefficients packed into it, each packed into a field
"bytes" bytes wide.
"coeff_bytes" is assumed to be at least FLINT_BITS/8, i.e. the
coefficients are assumed to be at least a limb wide.
Assumes 0 < bundle and 0 < poly_fmpz->length
*/
void fmpz_poly_byte_pack(ZmodF_poly_t poly_f, const fmpz_poly_t poly_fmpz,
const unsigned long bundle, const unsigned long coeff_bytes,
const unsigned long length, const long negate);
/*
Unpacks array into poly_fmpz. Each coefficient stored in array will have "bundle"
coefficients, each packed into a field "bytes" bytes wide.
The total number of coefficients to be unpacked is given by the length of
poly_fmpz.
"coeff_bytes" is assumed to be at least FLINT_BITS/8, i.e. the
coefficients are assumed to be at least a limb wide.
Assumes 0 < bundle and poly->mpn->length > 0
*/
void fmpz_poly_byte_unpack_unsigned(fmpz_poly_t poly_m, const mp_limb_t* array,
const unsigned long bundle, const unsigned long coeff_bytes);
void fmpz_poly_byte_unpack(fmpz_poly_t poly_m, const mp_limb_t* array,
const unsigned long bundle, const unsigned long coeff_bytes);
/*
Splits each coefficient of poly_fmpz into pieces "limbs" limbs long and
stores each piece into bundle coefficients of poly_f.
*/
void fmpz_poly_split(ZmodF_poly_t poly_f, fmpz_poly_t poly_fmpz,
unsigned long bundle, unsigned long limbs);
/*
Combines each "bundle" coefficients of poly_f, each taken to be "limbs"
limbs long, into a coefficient of poly_fmpz.
This function is used for testing purposed only, and is the exact inverse
of ZmodF_poly_split_mpn.
The number of coefficients extracted is given by the length of poly_fmpz.
*/
void fmpz_poly_unsplit(ZmodF_poly_t poly_f, fmpz_poly_t poly_fmpz,
unsigned long bundle, unsigned long limbs);
/*
Reduce coefficients of the given fmpz_poly fpol, modulo the modulus of the given
zmod_poly zpol, and store the result in zpol.
*/
void fmpz_poly_to_zmod_poly(zmod_poly_t zpol, fmpz_poly_t fpol);
/*
Store the unsigned long coefficients of the zmod_poly zpol in the given fmpz_poly fpol.
The unsigned version normalised to [0, p) the other version to [-p/2, p/2]
*/
void zmod_poly_to_fmpz_poly(fmpz_poly_t fpol, zmod_poly_t zpol);
void zmod_poly_to_fmpz_poly_unsigned(fmpz_poly_t fpol, zmod_poly_t zpol);
/*
Given an fmpz_poly_t fpol representing the reduction modulo oldmod of a polynomial
and a zmod_poly zpol with modulus p, use Chinese remaindering to reconstruct the
polynomial modulo newmod, with newmod = p*oldmod, where each new coefficient fpol[i]
is set to the unique non-negative integer in [0, newmod) which is fpol[i] mod oldmod
and zpol[i] mod p.
Assumes p and oldmod are coprime.
Returns 1 if the CRT has stabilised, i.e. if the new output equals the old input
else it returns 0.
The unsigned version normalises the output to [0, newmod) the main version
normalises to [-nemod/2, newmod/2].
Allows aliasing of fpol and res.
*/
int fmpz_poly_CRT(fmpz_poly_t res, fmpz_poly_t fpol, zmod_poly_t zpol, fmpz_t newmod, fmpz_t oldmod);
int fmpz_poly_CRT_unsigned(fmpz_poly_t res, fmpz_poly_t fpol, zmod_poly_t zpol, fmpz_t newmod, fmpz_t oldmod);
/*============================================================================
Functions in _fmpz_poly_* layer
===============================================================================*/
void _fmpz_poly_stack_init(fmpz_poly_t poly, const unsigned long alloc, const unsigned long limbs);
void _fmpz_poly_stack_clear(fmpz_poly_t poly);
void _fmpz_poly_check(const fmpz_poly_t poly);
void _fmpz_poly_normalise(fmpz_poly_t poly);
void _fmpz_poly_check_normalisation(const fmpz_poly_t poly);
static inline
fmpz_t _fmpz_poly_get_coeff_ptr(const fmpz_poly_t poly, const unsigned long n)
{
return poly->coeffs+n*(poly->limbs+1);
}
static inline
fmpz_t _fmpz_poly_lead(const fmpz_poly_t poly)
{
if (poly->length == 0) return NULL;
return poly->coeffs+(poly->length-1)*(poly->limbs+1);
}
static inline
fmpz_t fmpz_poly_lead(const fmpz_poly_t poly)
{
if (poly->length == 0) return NULL;
return poly->coeffs+(poly->length-1)*(poly->limbs+1);
}
/*
Set "output" to the given coefficient and return the sign
Assumes length of output is poly->limbs limbs long.
*/
static inline
long _fmpz_poly_get_coeff(mp_limb_t * output, const fmpz_poly_t poly,
const unsigned long n)
{
F_mpn_clear(output, poly->limbs);
if (poly->coeffs[n*(poly->limbs+1)] != 0L)
{
F_mpn_copy(output, poly->coeffs+n*(poly->limbs+1)+1, ABS(poly->coeffs[n*(poly->limbs+1)]));
}
return poly->coeffs[n*(poly->limbs+1)];
}
static inline
unsigned long _fmpz_poly_get_coeff_ui(fmpz_poly_t poly, const unsigned long n)
{
if (n >= poly->length) return 0L;
if (poly->coeffs[n*(poly->limbs+1)] == 0L) return 0L;
else return poly->coeffs[n*(poly->limbs+1)+1];
}
static inline
long _fmpz_poly_get_coeff_si(fmpz_poly_t poly, const unsigned long n)
{
if (n >= poly->length) return 0L;
if (poly->coeffs[n*(poly->limbs+1)] == 0L) return 0L;
if ((long) poly->coeffs[n*(poly->limbs+1)] > 0L)
return poly->coeffs[n*(poly->limbs+1)+1];
else return -poly->coeffs[n*(poly->limbs+1)+1];
}
void _fmpz_poly_get_coeff_mpz(mpz_t x, const fmpz_poly_t poly, const unsigned long n);
void _fmpz_poly_get_coeff_mpz_read_only(mpz_t x, const fmpz_poly_t poly, const unsigned long n);
static inline
void _fmpz_poly_set_coeff_mpz(fmpz_poly_t poly, const unsigned long n, const mpz_t x)
{
if (poly->limbs == 0) return;
if (n+1 > poly->length)
{
for (long i = poly->length; i + 1 < n; i++)
{
poly->coeffs[i*(poly->limbs+1)] = 0;
}
poly->length = n+1;
}
mpz_to_fmpz(poly->coeffs + n*(poly->limbs+1), x);
_fmpz_poly_normalise(poly);
}
void _fmpz_poly_set_coeff_fmpz(fmpz_poly_t poly, const unsigned long n, fmpz_t x);
void _fmpz_poly_get_coeff_fmpz(fmpz_t x, const fmpz_poly_t poly, const unsigned long n);
/*
Set a coefficient to the given value having "size" limbs.
Assumes that the poly->limbs is at least "size" and
that n < poly->length
*/
static inline
void _fmpz_poly_set_coeff(fmpz_poly_t poly, const unsigned long n,
const mp_limb_t * x, const long sign, const unsigned long size)
{
FLINT_ASSERT(poly->limbs >= size);
F_mpn_copy(poly->coeffs+n*(poly->limbs+1)+1, x, size);
poly->coeffs[n*(poly->limbs+1)] = sign;
if (poly->limbs > size)
F_mpn_clear(poly->coeffs+n*(poly->limbs+1)+size+1, poly->limbs-size);
_fmpz_poly_normalise(poly);
}
void _fmpz_poly_set_coeff_ui(fmpz_poly_t poly, const unsigned long n, const unsigned long x);
void _fmpz_poly_set_coeff_si(fmpz_poly_t poly, const unsigned long n, const long x);
static inline
long _fmpz_poly_degree(const fmpz_poly_t poly)
{
return poly->length - 1;
}
static inline
unsigned long _fmpz_poly_length(const fmpz_poly_t poly)
{
return poly->length;
}
static inline
unsigned long _fmpz_poly_limbs(const fmpz_poly_t poly)
{
return poly->limbs;
}
void _fmpz_poly_set(fmpz_poly_t output, const fmpz_poly_t input);
/*
Zero the polynomial by setting the length to zero.
Does not set the actual limbs to zero.
*/
static inline
void _fmpz_poly_zero(fmpz_poly_t output)
{
output->length = 0;
}
/* Zero first n coefficients of poly, regardless of what length is */
void _fmpz_poly_zero_coeffs(fmpz_poly_t poly, const unsigned long n);
static inline
void _fmpz_poly_attach(fmpz_poly_t output, const fmpz_poly_t input)
{
output->length = input->length;
output->limbs = input->limbs;
output->coeffs = input->coeffs;
}
static inline
void fmpz_poly_attach(fmpz_poly_t output, const fmpz_poly_t input)
{
_fmpz_poly_attach(output, input);
}
/*
Attach input shifted right by n to output
*/
static inline
void _fmpz_poly_attach_shift(fmpz_poly_t output,
const fmpz_poly_t input, unsigned long n)
{
if (input->length >= n) output->length = input->length - n;
else output->length = 0;
output->limbs = input->limbs;
output->coeffs = input->coeffs + n*(input->limbs+1);
}
static inline
void fmpz_poly_attach_shift(fmpz_poly_t output,
const fmpz_poly_t input, unsigned long n)
{
_fmpz_poly_attach_shift(output, input, n);
}
/*
Attach input to first n coefficients of input
*/
static inline
void _fmpz_poly_attach_truncate(fmpz_poly_t output,
const fmpz_poly_t input, unsigned long n)
{
if (input->length < n) output->length = input->length;
else output->length = n;
output->limbs = input->limbs;
output->coeffs = input->coeffs;
_fmpz_poly_normalise(output);
}
static inline
void fmpz_poly_attach_truncate(fmpz_poly_t output,
const fmpz_poly_t input, unsigned long n)
{
_fmpz_poly_attach_truncate(output, input, n);
}
long _fmpz_poly_max_bits1(const fmpz_poly_t poly);
long _fmpz_poly_max_bits(const fmpz_poly_t poly);
unsigned long _fmpz_poly_max_limbs(const fmpz_poly_t poly);
int _fmpz_poly_equal(const fmpz_poly_t input1, const fmpz_poly_t input2);
void _fmpz_poly_neg(fmpz_poly_t output, const fmpz_poly_t input);
void _fmpz_poly_truncate(fmpz_poly_t poly, const unsigned long trunc);
void _fmpz_poly_reverse(fmpz_poly_t output, const fmpz_poly_t input, const unsigned long length);
void _fmpz_poly_left_shift(fmpz_poly_t output, const fmpz_poly_t input,
const unsigned long n);
void _fmpz_poly_right_shift(fmpz_poly_t output, const fmpz_poly_t input, const unsigned long n);
void _fmpz_poly_add(fmpz_poly_t output, const fmpz_poly_t input1, const fmpz_poly_t input2);
void _fmpz_poly_sub(fmpz_poly_t output, const fmpz_poly_t input1, const fmpz_poly_t input2);
void _fmpz_poly_scalar_mul_fmpz(fmpz_poly_t output, const fmpz_poly_t poly, const fmpz_t x);
void _fmpz_poly_scalar_mul_ui(fmpz_poly_t output, const fmpz_poly_t poly, const unsigned long x);
void _fmpz_poly_scalar_mul_si(fmpz_poly_t output, const fmpz_poly_t poly, const long x);
void _fmpz_poly_scalar_div_fmpz(fmpz_poly_t output, const fmpz_poly_t poly, const fmpz_t x);
void _fmpz_poly_scalar_tdiv_ui(fmpz_poly_t output, const fmpz_poly_t poly, const unsigned long x);
void _fmpz_poly_scalar_div_ui(fmpz_poly_t output, const fmpz_poly_t poly, const unsigned long x);
void _fmpz_poly_scalar_div_si(fmpz_poly_t output, const fmpz_poly_t poly, const long x);
void _fmpz_poly_scalar_tdiv_si(fmpz_poly_t output, const fmpz_poly_t poly, const long x);
void _fmpz_poly_scalar_div_exact_ui(fmpz_poly_t output, const fmpz_poly_t poly, const unsigned long x);
void _fmpz_poly_scalar_div_exact_si(fmpz_poly_t output, const fmpz_poly_t poly, const long x);
void _fmpz_poly_mul_classical(fmpz_poly_t output, const fmpz_poly_t input1,
const fmpz_poly_t input2);
void _fmpz_poly_mul_classical_trunc(fmpz_poly_t output, const fmpz_poly_t input1,
const fmpz_poly_t input2, const unsigned long trunc);
void _fmpz_poly_mul_classical_trunc_left(fmpz_poly_t output, const fmpz_poly_t input1,
const fmpz_poly_t input2, const unsigned long trunc);
void __fmpz_poly_karamul_recursive(fmpz_poly_t res, const fmpz_poly_t a, const fmpz_poly_t b, fmpz_poly_t scratch, fmpz_poly_t scratchb, const unsigned long crossover);
void _fmpz_poly_mul_karatsuba(fmpz_poly_t output, const fmpz_poly_t input1,
const fmpz_poly_t input2);
void _fmpz_poly_mul_karatsuba_trunc(fmpz_poly_t output, const fmpz_poly_t input1,
const fmpz_poly_t input2, const unsigned long trunc);
void _fmpz_poly_mul_karatsuba_trunc_left(fmpz_poly_t output, const fmpz_poly_t input1, const fmpz_poly_t input2, const unsigned long trunc);
/*
Multiply two polynomials together using the Kronecker segmentation method.
Currently assumes that the number of output bits per coefficient is <= 64 and
is supplied by the parameter "bits"
*/
void _fmpz_poly_mul_KS(fmpz_poly_t output, const fmpz_poly_t input1,
const fmpz_poly_t input2);
void _fmpz_poly_mul_KS_trunc(fmpz_poly_t output, const fmpz_poly_t input1,
const fmpz_poly_t input2, const unsigned long trunc);
void _fmpz_poly_mul_SS(fmpz_poly_t output, const fmpz_poly_t input1,
const fmpz_poly_t input2);
void _fmpz_poly_mul_SS_trunc(fmpz_poly_t output, const fmpz_poly_t input1,
const fmpz_poly_t input2, const unsigned long trunc);
void _fmpz_poly_mul_trunc_n(fmpz_poly_t output, const fmpz_poly_t input1,
const fmpz_poly_t input2, const unsigned long trunc);
void _fmpz_poly_mul_trunc_left_n(fmpz_poly_t output, const fmpz_poly_t input1,
const fmpz_poly_t input2, const unsigned long trunc);
void _fmpz_poly_mul(fmpz_poly_t output, const fmpz_poly_t input1, const fmpz_poly_t input2);
void _fmpz_poly_sqr(fmpz_poly_t output, const fmpz_poly_t input);
void _fmpz_poly_sqr_naive(fmpz_poly_t output, const fmpz_poly_t input);
void _fmpz_poly_sqr_karatsuba(fmpz_poly_t output, const fmpz_poly_t input);
void _fmpz_poly_content(fmpz_t content, const fmpz_poly_t a);
/*============================================================================
Functions in fmpz_poly_* layer
===============================================================================*/
void fmpz_poly_init(fmpz_poly_t poly);
void fmpz_poly_init2(fmpz_poly_t poly, const unsigned long alloc, const unsigned long limbs);
void fmpz_poly_realloc(fmpz_poly_t poly, const unsigned long alloc);
void fmpz_poly_fit_length(fmpz_poly_t poly, const unsigned long alloc);
void fmpz_poly_resize_limbs(fmpz_poly_t poly, const unsigned long limbs);
static inline void fmpz_poly_fit_limbs(fmpz_poly_t poly, const unsigned long limbs)
{
if ((long) limbs > (long) poly->limbs) fmpz_poly_resize_limbs(poly, limbs);
}
void fmpz_poly_clear(fmpz_poly_t poly);
void fmpz_poly_check(const fmpz_poly_t poly);
void fmpz_poly_check_normalisation(const fmpz_poly_t poly);
// ------------------------------------------------------
// String conversions and I/O
int fmpz_poly_from_string(fmpz_poly_t poly, const char* s);
char* fmpz_poly_to_string(const fmpz_poly_t poly);
void fmpz_poly_print(const fmpz_poly_t poly);
void fmpz_poly_fprint(const fmpz_poly_t poly, FILE* f);
int fmpz_poly_fread(fmpz_poly_t poly, FILE* f);
char* fmpz_poly_to_string_pretty(const fmpz_poly_t poly, const char * x);
void fmpz_poly_fprint_pretty(const fmpz_poly_t poly, FILE* f, const char * x);
void fmpz_poly_print_pretty(const fmpz_poly_t poly, const char * x);
static inline
int fmpz_poly_read(fmpz_poly_t poly)
{
return fmpz_poly_fread(poly, stdin);
}
static inline
unsigned long fmpz_poly_limbs(const fmpz_poly_t poly)
{
return poly->limbs;
}
static inline
long fmpz_poly_degree(const fmpz_poly_t poly)
{
return poly->length - 1;
}
static inline
unsigned long fmpz_poly_length(const fmpz_poly_t poly)
{
return poly->length;
}
static inline
long fmpz_poly_max_bits1(const fmpz_poly_t poly)
{
return _fmpz_poly_max_bits1(poly);
}
static inline
long fmpz_poly_max_bits(const fmpz_poly_t poly)
{
return _fmpz_poly_max_bits(poly);
}
static inline
long fmpz_poly_max_limbs(const fmpz_poly_t poly)
{
return _fmpz_poly_max_limbs(poly);
}
static inline
void fmpz_poly_truncate(fmpz_poly_t poly, const unsigned long length)
{
FLINT_ASSERT(poly->length >= length);
poly->length = length;
_fmpz_poly_normalise(poly);
}
static inline
void fmpz_poly_swap(fmpz_poly_t x, fmpz_poly_t y)
{
if (x == y) return;
fmpz_t temp_p;
mp_limb_t temp_l;
temp_l = x->alloc;
x->alloc = y->alloc;
y->alloc = temp_l;
temp_p = x->coeffs;
x->coeffs = y->coeffs;
y->coeffs = temp_p;
temp_l = x->length;
x->length = y->length;
y->length = temp_l;
temp_l = x->limbs;
x->limbs = y->limbs;
y->limbs = temp_l;
}
static inline
fmpz_t fmpz_poly_get_coeff_ptr(const fmpz_poly_t poly, const unsigned long n)
{
if (n >= poly->length)
{
return NULL;
}
return poly->coeffs+n*(poly->limbs+1);
}
static inline
long fmpz_poly_get_coeff(mp_limb_t * output, const fmpz_poly_t poly,
const unsigned long n)
{
if (n >= poly->length)
{
F_mpn_clear(output, poly->limbs);
return 0;
}
return _fmpz_poly_get_coeff(output, poly, n);
}
static inline
unsigned long fmpz_poly_get_coeff_ui(const fmpz_poly_t poly, const unsigned long n)
{
if (n >= poly->length)
{
return 0;
}
if (poly->coeffs[n*(poly->limbs+1)] == 0) return 0;
else return poly->coeffs[n*(poly->limbs+1)+1];
}
static inline
long fmpz_poly_get_coeff_si(const fmpz_poly_t poly, const unsigned long n)
{
if (n >= poly->length)
{
return 0;
}
if (poly->coeffs[n*(poly->limbs+1)] == 0) return 0;
if (poly->coeffs[n*(poly->limbs+1)] == 1L)
return poly->coeffs[n*(poly->limbs+1)+1];
else return -poly->coeffs[n*(poly->limbs+1)+1];
}
void fmpz_poly_get_coeff_mpz(mpz_t x, const fmpz_poly_t poly, const unsigned long n);
void fmpz_poly_get_coeff_mpz_read_only(mpz_t x, const fmpz_poly_t poly, const unsigned long n);
static inline
void fmpz_poly_set_coeff_fmpz(fmpz_poly_t poly, const unsigned long n, fmpz_t x)
{
fmpz_poly_fit_length(poly, n+1);
fmpz_poly_fit_limbs(poly, fmpz_size(x));
if (n+1 > poly->length)
{
for (long i = poly->length; i + 1 < n; i++)
{
poly->coeffs[i*(poly->limbs+1)] = 0L;
}
poly->length = n+1;
}
_fmpz_poly_set_coeff_fmpz(poly, n, x);
_fmpz_poly_normalise(poly);
}
static inline
void fmpz_poly_get_coeff_fmpz(fmpz_t x, const fmpz_poly_t poly, const unsigned long n)
{
if (n >= poly->length)
{
x[0] = 0;
return;
}
_fmpz_poly_get_coeff_fmpz(x, poly, n);
}
static inline
void fmpz_poly_set_coeff(fmpz_poly_t poly, const unsigned long n,
const mp_limb_t * x, const long sign, const unsigned long size)
{
fmpz_poly_fit_length(poly, n+1);
fmpz_poly_fit_limbs(poly, size);
if (n+1 > poly->length)
{
for (long i = poly->length; i + 1 < n; i++)
{
poly->coeffs[i*(poly->limbs+1)] = 0L;
}
poly->length = n+1;
}
_fmpz_poly_set_coeff(poly, n, x, sign, size);
_fmpz_poly_normalise(poly);
}
static inline
void fmpz_poly_set_coeff_si(fmpz_poly_t poly, const unsigned long n, const long x)
{
fmpz_poly_fit_length(poly, n+1);
fmpz_poly_fit_limbs(poly, 1);
if (n+1 > poly->length)
{
for (long i = poly->length; i + 1 < n; i++)
{
poly->coeffs[i*(poly->limbs+1)] = 0L;
}
poly->length = n+1;
}
_fmpz_poly_set_coeff_si(poly, n, x);
_fmpz_poly_normalise(poly);
}
static inline
void fmpz_poly_set_coeff_ui(fmpz_poly_t poly, const unsigned long n, const unsigned long x)
{
fmpz_poly_fit_length(poly, n+1);
fmpz_poly_fit_limbs(poly, 1);
if (n+1 > poly->length)
{
for (long i = poly->length; i + 1 < n; i++)
{
poly->coeffs[i*(poly->limbs+1)] = 0L;
}
poly->length = n+1;
}
_fmpz_poly_set_coeff_ui(poly, n, x);
_fmpz_poly_normalise(poly);
}
static inline
void fmpz_poly_set_coeff_mpz(fmpz_poly_t poly, const unsigned long n, const mpz_t x)
{
fmpz_poly_fit_length(poly, n+1);
fmpz_poly_fit_limbs(poly, mpz_size(x));
_fmpz_poly_set_coeff_mpz(poly, n, x);
}
static inline
void fmpz_poly_set(fmpz_poly_t output, const fmpz_poly_t input)
{
fmpz_poly_fit_length(output, input->length);
fmpz_poly_fit_limbs(output, input->limbs);
_fmpz_poly_set(output, input);
}
static inline
int fmpz_poly_equal(const fmpz_poly_t input1, const fmpz_poly_t input2)
{
return _fmpz_poly_equal(input1, input2);
}
static inline
void fmpz_poly_zero(fmpz_poly_t output)
{
output->length = 0;
}
static inline
void fmpz_poly_zero_coeffs(fmpz_poly_t poly, const unsigned long n)
{
fmpz_poly_fit_length(poly, n);
if (n >= poly->length)
{
fmpz_poly_zero(poly);
return;
}
_fmpz_poly_zero_coeffs(poly, n);
}
static inline
void fmpz_poly_neg(fmpz_poly_t output, const fmpz_poly_t input)
{
fmpz_poly_fit_length(output, input->length);
fmpz_poly_fit_limbs(output, input->limbs);
_fmpz_poly_neg(output, input);
}
static inline
void fmpz_poly_reverse(fmpz_poly_t output, const fmpz_poly_t input, const unsigned long length)
{
fmpz_poly_fit_length(output, length);
fmpz_poly_fit_limbs(output, input->limbs);
_fmpz_poly_reverse(output, input, length);
}
static inline
void fmpz_poly_left_shift(fmpz_poly_t output, const fmpz_poly_t input,
const unsigned long n)
{
if (input->length + n == 0)
{
fmpz_poly_zero(output);
return;
}
fmpz_poly_fit_length(output, input->length + n);
fmpz_poly_fit_limbs(output, input->limbs);
_fmpz_poly_left_shift(output, input, n);
}
static inline
void fmpz_poly_right_shift(fmpz_poly_t output, const fmpz_poly_t input, const unsigned long n)
{
if ((long)(input->length - n) <= 0L)
{
fmpz_poly_zero(output);
return;
}
fmpz_poly_fit_length(output, input->length - n);
fmpz_poly_fit_limbs(output, input->limbs);
_fmpz_poly_right_shift(output, input, n);
}
void fmpz_poly_2norm(fmpz_t norm, fmpz_poly_t pol);
void fmpz_poly_scalar_mul_fmpz(fmpz_poly_t output,
const fmpz_poly_t input, const fmpz_t x);
void fmpz_poly_scalar_mul_ui(fmpz_poly_t output,
const fmpz_poly_t input, unsigned long x);
void fmpz_poly_scalar_mul_si(fmpz_poly_t output,
const fmpz_poly_t input, long x);
void fmpz_poly_scalar_mul_mpz(fmpz_poly_t output,
const fmpz_poly_t input, const mpz_t x);
static inline
void fmpz_poly_scalar_div_ui(fmpz_poly_t output, const fmpz_poly_t poly, const unsigned long x)
{
if (poly->length == 0)
{
fmpz_poly_zero(output);
return;
}
unsigned long limbs = fmpz_poly_max_limbs(poly);
fmpz_poly_fit_length(output, poly->length);
fmpz_poly_fit_limbs(output, limbs);
_fmpz_poly_scalar_div_ui(output, poly, x);
}
static inline
void fmpz_poly_scalar_div_si(fmpz_poly_t output, const fmpz_poly_t poly, const unsigned long x)
{
if (poly->length == 0)
{
fmpz_poly_zero(output);
return;
}
unsigned long limbs = fmpz_poly_max_limbs(poly);
fmpz_poly_fit_length(output, poly->length);
fmpz_poly_fit_limbs(output, limbs);
_fmpz_poly_scalar_div_si(output, poly, x);
}
static inline
void fmpz_poly_scalar_tdiv_ui(fmpz_poly_t output, const fmpz_poly_t poly, const unsigned long x)
{
if (poly->length == 0)
{
fmpz_poly_zero(output);
return;
}
unsigned long limbs = fmpz_poly_max_limbs(poly);
fmpz_poly_fit_length(output, poly->length);
fmpz_poly_fit_limbs(output, limbs);
_fmpz_poly_scalar_tdiv_ui(output, poly, x);
}
static inline
void fmpz_poly_scalar_tdiv_si(fmpz_poly_t output, const fmpz_poly_t poly, const unsigned long x)
{
if (poly->length == 0)
{
fmpz_poly_zero(output);
return;
}
unsigned long limbs = fmpz_poly_max_limbs(poly);
fmpz_poly_fit_length(output, poly->length);
fmpz_poly_fit_limbs(output, limbs);
_fmpz_poly_scalar_tdiv_si(output, poly, x);
}
static inline
void fmpz_poly_scalar_div_exact_ui(fmpz_poly_t output, const fmpz_poly_t poly, const unsigned long x)
{
if (poly->length == 0)
{
fmpz_poly_zero(output);
return;
}
unsigned long limbs = fmpz_poly_max_limbs(poly);
fmpz_poly_fit_length(output, poly->length);
fmpz_poly_fit_limbs(output, limbs);
_fmpz_poly_scalar_div_exact_ui(output, poly, x);
}
static inline
void fmpz_poly_scalar_div_exact_si(fmpz_poly_t output, const fmpz_poly_t poly, const unsigned long x)
{
if (poly->length == 0)
{
fmpz_poly_zero(output);
return;
}
unsigned long limbs = fmpz_poly_max_limbs(poly);
fmpz_poly_fit_length(output, poly->length);
fmpz_poly_fit_limbs(output, limbs);
_fmpz_poly_scalar_div_exact_si(output, poly, x);
}
void fmpz_poly_scalar_div_fmpz(fmpz_poly_t output,
const fmpz_poly_t input, const fmpz_t x);
void fmpz_poly_scalar_div_mpz(fmpz_poly_t output,
const fmpz_poly_t input, const mpz_t x);
static inline
void fmpz_poly_add(fmpz_poly_t output, const fmpz_poly_t input1, const fmpz_poly_t input2)
{
if (input1 == input2)
{
fmpz_poly_scalar_mul_ui(output, input1, 2UL);
return;
}
unsigned long bits1 = FLINT_ABS(_fmpz_poly_max_bits(input1));
unsigned long bits2 = FLINT_ABS(_fmpz_poly_max_bits(input2));
fmpz_poly_fit_length(output, FLINT_MAX(input1->length, input2->length));
fmpz_poly_fit_limbs(output, FLINT_MAX(bits1, bits2)/FLINT_BITS + 1);
_fmpz_poly_add(output, input1, input2);
}
static inline
void fmpz_poly_sub(fmpz_poly_t output, const fmpz_poly_t input1, const fmpz_poly_t input2)
{
if (input1 == input2)
{
fmpz_poly_zero(output);
return;
}
unsigned long bits1 = FLINT_ABS(_fmpz_poly_max_bits(input1));
unsigned long bits2 = FLINT_ABS(_fmpz_poly_max_bits(input2));
fmpz_poly_fit_length(output, FLINT_MAX(input1->length, input2->length));
fmpz_poly_fit_limbs(output, FLINT_MAX(bits1, bits2)/FLINT_BITS + 1);
_fmpz_poly_sub(output, input1, input2);
}
void fmpz_poly_mul(fmpz_poly_t output, const fmpz_poly_t input1, const fmpz_poly_t input2);
void fmpz_poly_mul_trunc_n(fmpz_poly_t output, const fmpz_poly_t input1,
const fmpz_poly_t input2, const unsigned long trunc);
void fmpz_poly_mul_trunc_left_n(fmpz_poly_t output, const fmpz_poly_t input1,
const fmpz_poly_t input2, const unsigned long trunc);
void fmpz_poly_div_classical(fmpz_poly_t Q, const fmpz_poly_t A, const fmpz_poly_t B);
void fmpz_poly_divrem_classical(fmpz_poly_t Q, fmpz_poly_t R, const fmpz_poly_t A, const fmpz_poly_t B);
void fmpz_poly_div_divconquer_recursive(fmpz_poly_t Q, fmpz_poly_t DQ, const fmpz_poly_t A, const fmpz_poly_t B);
void fmpz_poly_divrem_divconquer(fmpz_poly_t Q, fmpz_poly_t R, const fmpz_poly_t A, const fmpz_poly_t B);
void fmpz_poly_div_divconquer(fmpz_poly_t Q, const fmpz_poly_t A, const fmpz_poly_t B);
void fmpz_poly_div_mulders(fmpz_poly_t Q, const fmpz_poly_t A, const fmpz_poly_t B);
void fmpz_poly_newton_invert_basecase(fmpz_poly_t Q_inv, const fmpz_poly_t Q, const unsigned long n);
void fmpz_poly_newton_invert(fmpz_poly_t Q_inv, const fmpz_poly_t Q, const unsigned long n);
void fmpz_poly_div_series(fmpz_poly_t Q, const fmpz_poly_t A, const fmpz_poly_t B, const unsigned long n);
void fmpz_poly_div_newton(fmpz_poly_t Q, const fmpz_poly_t A, const fmpz_poly_t B);
static inline
void fmpz_poly_div(fmpz_poly_t Q, const fmpz_poly_t A, const fmpz_poly_t B)
{
if (A == B)
{
fmpz_poly_fit_length(Q, 1);
fmpz_poly_fit_limbs(Q, 1);
fmpz_poly_zero(Q);
fmpz_poly_set_coeff_ui(Q, 0, 1UL);
return;
}
fmpz_poly_t Ain, Bin;
if (A == Q)
{
_fmpz_poly_stack_init(Ain, A->length, A->limbs);
_fmpz_poly_set(Ain, A);
} else _fmpz_poly_attach(Ain, A);
if (B == Q)
{
_fmpz_poly_stack_init(Bin, B->length, B->limbs);
_fmpz_poly_set(Bin, B);
} else _fmpz_poly_attach(Bin, B);
fmpz_poly_div_mulders(Q, Ain, Bin);
if (A == Q) _fmpz_poly_stack_clear(Ain);
if (B == Q) _fmpz_poly_stack_clear(Bin);
}
static inline
void fmpz_poly_divrem(fmpz_poly_t Q, fmpz_poly_t R, const fmpz_poly_t A, const fmpz_poly_t B)
{
if (A == B)
{
fmpz_poly_fit_length(Q, 1);
fmpz_poly_fit_limbs(Q, 1);
fmpz_poly_zero(Q);
fmpz_poly_zero(R);
fmpz_poly_set_coeff_ui(Q, 0, 1UL);
return;
}
fmpz_poly_t Ain, Bin;
if ((A == R) || (A == Q))
{
_fmpz_poly_stack_init(Ain, A->length, A->limbs);
_fmpz_poly_set(Ain, A);
} else _fmpz_poly_attach(Ain, A);
if ((B == R) || (B == Q))
{
_fmpz_poly_stack_init(Bin, B->length, B->limbs);
_fmpz_poly_set(Bin, B);
} else _fmpz_poly_attach(Bin, B);
fmpz_poly_divrem_divconquer(Q, R, Ain, Bin);
if ((A == R) || (A == Q)) _fmpz_poly_stack_clear(Ain);
if ((B == R) || (B == Q)) _fmpz_poly_stack_clear(Bin);
}
/*
Returns 1 and the quotient if B divides A
else returns 0
*/
static inline
int fmpz_poly_divides(fmpz_poly_t Q, fmpz_poly_t A, fmpz_poly_t B)
{
fmpz_poly_t R;
int divides = 0;
fmpz_poly_init(R);
fmpz_poly_divrem(Q, R, A, B);
if (R->length == 0) divides = 1;
fmpz_poly_clear(R);
return divides;
}
void fmpz_poly_power(fmpz_poly_t output, const fmpz_poly_t poly, const unsigned long exp);
void fmpz_poly_power_trunc_n(fmpz_poly_t output, const fmpz_poly_t poly, const unsigned long exp, const unsigned long n);
void fmpz_poly_pseudo_divrem_cohen(fmpz_poly_t Q, fmpz_poly_t R, const fmpz_poly_t A, const fmpz_poly_t B);
void fmpz_poly_pseudo_divrem_shoup(fmpz_poly_t Q, fmpz_poly_t R, const fmpz_poly_t A, const fmpz_poly_t B);
void fmpz_poly_pseudo_divrem_basecase(fmpz_poly_t Q, fmpz_poly_t R,
unsigned long * d, const fmpz_poly_t A, const fmpz_poly_t B);
void fmpz_poly_pseudo_div_basecase(fmpz_poly_t Q, unsigned long * d,
const fmpz_poly_t A, const fmpz_poly_t B);
void fmpz_poly_pseudo_divrem_recursive(fmpz_poly_t Q, fmpz_poly_t R,
unsigned long * d, const fmpz_poly_t A, const fmpz_poly_t B);
static inline
void fmpz_poly_pseudo_divrem(fmpz_poly_t Q, fmpz_poly_t R, unsigned long * d,
const fmpz_poly_t A, const fmpz_poly_t B)
{
if (A == B)
{
fmpz_poly_fit_length(Q, 1);
fmpz_poly_fit_limbs(Q, 1);
fmpz_poly_zero(Q);
fmpz_poly_zero(R);
d = 0;
fmpz_poly_set_coeff_ui(Q, 0, 1UL);
return;
}
fmpz_poly_t Ain, Bin;
if ((A == R) || (A == Q))
{
_fmpz_poly_stack_init(Ain, A->length, A->limbs);
_fmpz_poly_set(Ain, A);
} else _fmpz_poly_attach(Ain, A);
if ((B == R) || (B == Q))
{
_fmpz_poly_stack_init(Bin, B->length, B->limbs);
_fmpz_poly_set(Bin, B);
} else _fmpz_poly_attach(Bin, B);
fmpz_poly_pseudo_divrem_recursive(Q, R, d, Ain, Bin);
if ((A == R) || (A == Q)) _fmpz_poly_stack_clear(Ain);
if ((B == R) || (B == Q)) _fmpz_poly_stack_clear(Bin);
}
void fmpz_poly_pseudo_div_recursive(fmpz_poly_t Q, unsigned long * d,
const fmpz_poly_t A, const fmpz_poly_t B);
static inline
void fmpz_poly_pseudo_div(fmpz_poly_t Q, unsigned long * d,
const fmpz_poly_t A, const fmpz_poly_t B)
{
if (A == B)
{
fmpz_poly_fit_length(Q, 1);
fmpz_poly_fit_limbs(Q, 1);
fmpz_poly_zero(Q);
d = 0;
fmpz_poly_set_coeff_ui(Q, 0, 1UL);
return;
}
fmpz_poly_t Ain, Bin;
if (A == Q)
{
_fmpz_poly_stack_init(Ain, A->length, A->limbs);
_fmpz_poly_set(Ain, A);
} else _fmpz_poly_attach(Ain, A);
if (B == Q)
{
_fmpz_poly_stack_init(Bin, B->length, B->limbs);
_fmpz_poly_set(Bin, B);
} else _fmpz_poly_attach(Bin, B);
fmpz_poly_pseudo_div_recursive(Q, d, Ain, Bin);
if (A == Q) _fmpz_poly_stack_clear(Ain);
if (B == Q) _fmpz_poly_stack_clear(Bin);
}
void fmpz_poly_content(fmpz_t c, fmpz_poly_t poly);
static inline
void _fmpz_poly_primitive_part(fmpz_poly_t prim, fmpz_poly_t poly)
{
if (poly->length == 0)
{
_fmpz_poly_zero(prim);
return;
}
fmpz_t c = fmpz_init(poly->limbs);
_fmpz_poly_content(c, poly);
_fmpz_poly_scalar_div_fmpz(prim, poly, c);
fmpz_clear(c);
}
static inline
void fmpz_poly_primitive_part(fmpz_poly_t prim, fmpz_poly_t poly)
{
if (poly->length == 0)
{
fmpz_poly_zero(prim);
return;
}
fmpz_t c = fmpz_init(poly->limbs);
fmpz_poly_content(c, poly);
fmpz_poly_scalar_div_fmpz(prim, poly, c);
fmpz_clear(c);
}
void fmpz_poly_gcd_subresultant(fmpz_poly_t res, const fmpz_poly_t poly1, const fmpz_poly_t poly2);
void fmpz_poly_gcd_modular(fmpz_poly_t res, const fmpz_poly_t poly1, const fmpz_poly_t poly2);
void fmpz_poly_gcd(fmpz_poly_t res, const fmpz_poly_t poly1, const fmpz_poly_t poly2);
void fmpz_poly_invmod_modular(fmpz_t d, fmpz_poly_t H, fmpz_poly_t poly1, fmpz_poly_t poly2);
static inline
void fmpz_poly_invmod(fmpz_t d, fmpz_poly_t H, fmpz_poly_t poly1, fmpz_poly_t poly2)
{
fmpz_poly_invmod_modular(d, H, poly1, poly2);
}
unsigned long fmpz_poly_resultant_bound(fmpz_poly_t a, fmpz_poly_t b);
void fmpz_poly_resultant(fmpz_t res, fmpz_poly_t a, fmpz_poly_t b);
void fmpz_poly_xgcd_modular(fmpz_t r, fmpz_poly_t s, fmpz_poly_t t, fmpz_poly_t a, fmpz_poly_t b);
static inline
void fmpz_poly_xgcd(fmpz_t r, fmpz_poly_t s, fmpz_poly_t t, fmpz_poly_t a, fmpz_poly_t b)
{
fmpz_poly_xgcd_modular(r, s, t, a, b);
}
// *************** end of file
#ifdef __cplusplus
}
#endif
#endif
|