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
|
/*=============================================================================
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) 2010 Fredrik Johansson
******************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <gmp.h>
#include "flint.h"
#include "nmod_mat.h"
#include "ulong_extras.h"
int
main(void)
{
slong m, n, mod, i, j, rep;
FLINT_TEST_INIT(state);
flint_printf("init/clear....");
fflush(stdout);
for (rep = 0; rep < 100 * flint_test_multiplier(); rep++)
{
nmod_mat_t A;
m = n_randint(state, 50);
n = n_randint(state, 50);
mod = n_randtest_not_zero(state);
nmod_mat_init(A, m, n, mod);
for (i = 0; i < m; i++)
{
for (j = 0; j < n; j++)
{
if (A->rows[i][j] != UWORD(0))
{
flint_printf("FAIL: entries not zero!\n");
abort();
}
}
}
if (A->mod.n != mod)
{
flint_printf("FAIL: bad modulus\n");
abort();
}
nmod_mat_clear(A);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}
|
