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
|
/*=============================================================================
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 "flint.h"
#include "ulong_extras.h"
#include "nmod_mat.h"
#include "nmod_vec.h"
void
nmod_mat_randops(nmod_mat_t mat, slong count, flint_rand_t state)
{
slong c, i, j, k;
slong m = mat->r;
slong n = mat->c;
if (mat->r == 0 || mat->c == 0)
return;
for (c = 0; c < count; c++)
{
if (n_randint(state, 2))
{
if ((i = n_randint(state, m)) == (j = n_randint(state, m)))
continue;
if (n_randint(state, 2))
for (k = 0; k < n; k++)
mat->rows[j][k] = nmod_add(mat->rows[j][k],
mat->rows[i][k], mat->mod);
else
for (k = 0; k < n; k++)
mat->rows[j][k] = nmod_sub(mat->rows[j][k],
mat->rows[i][k], mat->mod);
}
else
{
if ((i = n_randint(state, n)) == (j = n_randint(state, n)))
continue;
if (n_randint(state, 2))
for (k = 0; k < m; k++)
mat->rows[k][j] = nmod_add(mat->rows[k][j],
mat->rows[k][i], mat->mod);
else
for (k = 0; k < m; k++)
mat->rows[k][j] = nmod_sub(mat->rows[k][j],
mat->rows[k][i], mat->mod);
}
}
}
|
