/*
Copyright (C) 2009 William Hart
This file is part of FLINT.
FLINT is free software: you can redistribute it and/or modify it under
the terms of the GNU Lesser General Public License (LGPL) as published
by the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version. See .
*/
#include
#include
#include
#include "flint.h"
#include "fmpz.h"
#include "fmpz_poly.h"
#include "ulong_extras.h"
int
main(void)
{
int i, result;
FLINT_TEST_INIT(state);
flint_printf("bit_pack/bit_unpack....");
fflush(stdout);
for (i = 0; i < 2000 * flint_test_multiplier(); i++)
{
fmpz_poly_t a, b;
slong length = n_randint(state, 100) + 1;
flint_bitcnt_t bits = n_randint(state, 300) + 2;
mp_ptr arr = (mp_ptr) flint_calloc((length * bits - 1) / FLINT_BITS + 1,
sizeof(mp_limb_t));
int negate;
fmpz_poly_init(a);
fmpz_poly_init(b);
/* -1 bit to handle signs */
fmpz_poly_randtest_not_zero(a, state, length, bits - 1);
negate = fmpz_sgn(a->coeffs + a->length - 1);
if (negate > 0)
negate = 0;
_fmpz_poly_bit_pack(arr, a->coeffs, a->length, bits, negate);
fmpz_poly_fit_length(b, a->length);
_fmpz_poly_bit_unpack(b->coeffs, a->length, arr, bits, negate);
_fmpz_poly_set_length(b, a->length);
result = (fmpz_poly_equal(a, b));
if (!result)
{
flint_printf("FAIL:\n");
fmpz_poly_print(a), flint_printf("\n\n");
fmpz_poly_print(b), flint_printf("\n\n");
abort();
}
flint_free(arr);
fmpz_poly_clear(a);
fmpz_poly_clear(b);
}
for (i = 0; i < 2000 * flint_test_multiplier(); i++)
{
fmpz_poly_t a, b;
slong length = n_randint(state, 100) + 1;
flint_bitcnt_t bits = n_randint(state, 300) + 1;
mp_ptr arr = (mp_ptr) flint_calloc((length * bits - 1) / FLINT_BITS + 1,
sizeof(mp_limb_t));
fmpz_poly_init(a);
fmpz_poly_init(b);
do
fmpz_poly_randtest_unsigned(a, state, length, bits);
while (a->length == 0);
_fmpz_poly_bit_pack(arr, a->coeffs, a->length, bits, 0);
fmpz_poly_fit_length(b, a->length);
_fmpz_poly_bit_unpack_unsigned(b->coeffs, a->length, arr, bits);
_fmpz_poly_set_length(b, a->length);
result = (fmpz_poly_equal(a, b));
if (!result)
{
flint_printf("FAIL:\n");
fmpz_poly_print(a), flint_printf("\n\n");
fmpz_poly_print(b), flint_printf("\n\n");
abort();
}
flint_free(arr);
fmpz_poly_clear(a);
fmpz_poly_clear(b);
}
/* Test fmpz functions */
for (i = 0; i < 2000 * flint_test_multiplier(); i++)
{
fmpz_t f;
fmpz_poly_t A, B;
slong b;
fmpz_init(f);
fmpz_poly_init(A);
fmpz_poly_init(B);
fmpz_poly_randtest(A, state, 1+n_randint(state,100),
1+n_randint(state,300));
b = FLINT_ABS(fmpz_poly_max_bits(A)) + 1;
fmpz_poly_bit_pack(f, A, b);
fmpz_poly_bit_unpack(B, f, b);
if (!fmpz_poly_equal(A, B))
{
mpz_t zz;
flint_printf("FAIL:\n");
flint_printf("BITS: %wd (signed)\n", b);
flint_printf("INPUT: ");
fmpz_poly_print_pretty(A, "x");
flint_printf("\n");
mpz_init(zz); fmpz_get_mpz(zz, f);
flint_printf("PACKED: ");
mpz_out_str(stdout, 2, zz);
flint_printf("\n");
flint_printf("OUTPUT: ");
fmpz_poly_print_pretty(B, "x");
flint_printf("\n\n");
abort();
}
fmpz_clear(f);
fmpz_poly_clear(A);
fmpz_poly_clear(B);
}
for (i = 0; i < 2000 * flint_test_multiplier(); i++)
{
fmpz_t f;
fmpz_poly_t A, B;
slong b;
fmpz_init(f);
fmpz_poly_init(A);
fmpz_poly_init(B);
fmpz_poly_randtest_unsigned(A, state, 1+n_randint(state,100),
1+n_randint(state,300));
b = FLINT_ABS(fmpz_poly_max_bits(A));
fmpz_poly_bit_pack(f, A, b);
fmpz_poly_bit_unpack_unsigned(B, f, b);
if (!fmpz_poly_equal(A, B))
{
mpz_t zz;
flint_printf("FAIL:\n");
flint_printf("BITS: %wd (unsigned)\n", b);
flint_printf("INPUT: ");
fmpz_poly_print_pretty(A, "x");
flint_printf("\n");
mpz_init(zz); fmpz_get_mpz(zz, f);
flint_printf("PACKED: ");
mpz_out_str(stdout, 2, zz);
flint_printf("\n");
flint_printf("OUTPUT: ");
fmpz_poly_print_pretty(B, "x");
flint_printf("\n\n");
abort();
}
fmpz_clear(f);
fmpz_poly_clear(A);
fmpz_poly_clear(B);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}