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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
|
/* tests/regression-check.C
* Copyright (C) 2014 the FFLAS-FFPACK group
*
* Written by all reporters of bugs (see ffpack-devel@googlegroups.com)
*
* ------------------------------------
*
*
* ========LICENCE========
* This file is part of the library FFLAS-FFPACK.
*
* FFLAS-FFPACK 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========
*.
*/
#include "fflas-ffpack/fflas-ffpack-config.h"
#include <givaro/modular.h>
#include "fflas-ffpack/fflas-ffpack.h"
using namespace Givaro;
using namespace FFLAS;
using namespace FFPACK;
/* #1 */
bool check1 () ;
/* #2 */
bool check2()
{
Modular<double> F(2);
Modular<double>::RandIter R(F);
size_t ok = 0 ;
size_t tot = 500 ;
for (size_t i = 0 ; i < tot ; ++i) {
double elt ;
R.random(elt);
if (elt == 1) ++ok ;
}
double f = (double) ok / (double) tot ;
if (f < 0.3 or f > 0.7) return false ;
return true;
}
/* #3 */
bool check3()
{
Modular<double> F(2);
double * A = NULL ;
double d;
Det(F,d,0,A,0);
return F.areEqual(d,F.one);
}
/* #4 */
bool check4()
{
typedef int32_t Element;
Modular<Element> F(2);
Element * A = NULL ;
Element * X = NULL ;
int nul;
Invert2(F,0,A,0,X,0,nul);
return true ;
}
bool checkZeroDimCharpoly(){
Modular<double> F(101);
double * A = fflas_new(F,0,0);
Poly1Dom<Modular<double> > PR (F);
Poly1Dom<Modular<double> >::Element charp;
CharPoly(PR, charp, 0, A, 0);
fflas_delete(A);
return PR.isOne(charp);
}
bool checkZeroDimMinPoly(){
Modular<double> F(101);
double * A = fflas_new(F,0,0);
Poly1Dom<Modular<double> > PR (F);
Poly1Dom<Modular<double> >::Element minp;
MinPoly(F, minp, 0, A, 0);
fflas_delete(A);
return PR.isOne(minp);
}
bool gf2ModularBalanced(){
typedef Givaro::Modular<int64_t> Field;
Field F(2);
int h_[] = {1,0,1,0,1,0,1, 0,1,1,0,0,1,1, 0,0,0,1,1,1,1};
Field::Element_ptr G, H;
H = fflas_new(F,3,7);
for (unsigned i=0; i<21; i++)
F.init(H[i], h_[i]);
size_t NSdim;
size_t ldn;
NullSpaceBasis (F, FflasLeft, 3, 7, H, 7, G, ldn, NSdim);
fflas_delete(G,H);
return true;
}
int main() {
bool pass = true ;
pass = pass && check2();
pass = pass && check3();
pass = pass && check4();
pass = pass && checkZeroDimCharpoly();
pass = pass && checkZeroDimMinPoly();
pass = pass && gf2ModularBalanced();
return !pass;
}
/* -*- mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
// vim:sts=4:sw=4:ts=4:et:sr:cino=>s,f0,{0,g0,(0,\:0,t0,+0,=s
|
