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
|
/* tests/test-rank-u32.C
* Time-stamp: <08 Aug 14 07:40:22 Jean-Guillaume.Dumas@imag.fr>
* -----------------------------------------------------
*
* ========LICENCE========
* This file is part of the library LinBox.
*
* LinBox is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
* ========LICENCE========
*/
/*! @file tests/test-rank-u32.C
* @ingroup tests
* @brief no doc
* @test no doc.
*/
#include "linbox/linbox-config.h"
//#include "linbox/ring/modular/modular-unsigned.h"
#include "test-rank.h"
int main (int argc, char **argv)
{
bool pass = true;
static size_t n = 20;
//static integer q = 65519; problem
//static integer q = 1009;
//static integer q = 1000003;
static integer q = 46337;
static int iterations = 1;
static double sparsity = 0.05;
static Argument args[] = {
{ 'n', "-n N", "Set dimension of test matrices to NxN.", TYPE_INT, &n },
{ 'q', "-q Q", "Operate over the \"field\" GF(Q) [1].", TYPE_INTEGER, &q },
{ 'i', "-i I", "Perform each test for I iterations.", TYPE_INT, &iterations },
{ 's', "-s S", "Sparse matrices with density S.", TYPE_DOUBLE, &sparsity },
END_OF_ARGUMENTS
};
parseArguments (argc, argv, args);
srand ((unsigned)time (NULL));
// srand48 ((unsigned)time (NULL));
commentator().start("Givaro::Modular<uint32_t,uint64_t> sparse rank test suite", "rank");
commentator().getMessageClass (INTERNAL_DESCRIPTION).setMaxDepth (3);
commentator().getMessageClass (INTERNAL_DESCRIPTION).setMaxDetailLevel (Commentator::LEVEL_NORMAL);
Givaro::Modular<uint32_t,uint64_t> F (q);
pass = pass && testSparseRank(F,n,n+1,(size_t)iterations,sparsity);
pass = pass && testSparseRank(F,LINBOX_USE_BLACKBOX_THRESHOLD+n,LINBOX_USE_BLACKBOX_THRESHOLD+n-1,(size_t)iterations,sparsity);
commentator().stop("Givaro::Modular<uint32_t,uint64_t> sparse rank test suite");
return pass ? 0 : -1;
}
// Local Variables:
// mode: C++
// tab-width: 4
// indent-tabs-mode: nil
// c-basic-offset: 4
// End:
// vim:sts=4:sw=4:ts=4:et:sr:cino=>s,f0,{0,g0,(0,\:0,t0,+0,=s
|
