pqc/external/flint-2.4.3/nmod_vec/test/t-add_sub_neg.c

113 lines
3.1 KiB
C
Raw Normal View History

2014-05-18 22:03:37 +00:00
/*=============================================================================
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
=============================================================================*/
/******************************************************************************
Copyright (C) 2009 William Hart
******************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <gmp.h>
#include "flint.h"
#include "nmod_vec.h"
#include "ulong_extras.h"
int
main(void)
{
int i, result;
FLINT_TEST_INIT(state);
flint_printf("add/sub/neg....");
fflush(stdout);
/* Check (a + b) - b == a */
for (i = 0; i < 10000; i++)
{
slong len = n_randint(state, 100) + 1;
nmod_t mod;
mp_limb_t n = n_randtest_not_zero(state);
mp_ptr vec = _nmod_vec_init(len);
mp_ptr vec2 = _nmod_vec_init(len);
mp_ptr vec3 = _nmod_vec_init(len);
nmod_init(&mod, n);
_nmod_vec_randtest(vec, state, len, mod);
_nmod_vec_randtest(vec2, state, len, mod);
_nmod_vec_add(vec3, vec, vec2, len, mod);
_nmod_vec_sub(vec3, vec3, vec2, len, mod);
result = _nmod_vec_equal(vec, vec3, len);
if (!result)
{
flint_printf("FAIL:\n");
flint_printf("len = %wd, n = %wd\n", len, n);
abort();
}
_nmod_vec_clear(vec);
_nmod_vec_clear(vec2);
_nmod_vec_clear(vec3);
}
/* Check (a + -b) == a - b */
for (i = 0; i < 10000; i++)
{
slong len = n_randint(state, 100) + 1;
mp_limb_t n = n_randtest_not_zero(state);
nmod_t mod;
mp_ptr vec = _nmod_vec_init(len);
mp_ptr vec2 = _nmod_vec_init(len);
mp_ptr vec3 = _nmod_vec_init(len);
nmod_init(&mod, n);
_nmod_vec_randtest(vec, state, len, mod);
_nmod_vec_randtest(vec2, state, len, mod);
_nmod_vec_sub(vec3, vec, vec2, len, mod);
_nmod_vec_neg(vec2, vec2, len, mod);
_nmod_vec_add(vec, vec, vec2, len, mod);
result = _nmod_vec_equal(vec, vec3, len);
if (!result)
{
flint_printf("FAIL:\n");
flint_printf("len = %wd, n = %wd\n", len, n);
abort();
}
_nmod_vec_clear(vec);
_nmod_vec_clear(vec2);
_nmod_vec_clear(vec3);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}