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
|
/* matrix/prop_source.c
*
* Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman, Brian Gough
*
* This program 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.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
int
FUNCTION (gsl_matrix, isnull) (const TYPE (gsl_matrix) * m)
{
const size_t size1 = m->size1;
const size_t size2 = m->size2;
const size_t tda = m->tda ;
size_t i, j, k;
for (i = 0; i < size1 ; i++)
{
for (j = 0; j < size2; j++)
{
for (k = 0; k < MULTIPLICITY; k++)
{
if (m->data[(i * tda + j) * MULTIPLICITY + k] != 0.0)
{
return 0;
}
}
}
}
return 1;
}
int
FUNCTION (gsl_matrix, ispos) (const TYPE (gsl_matrix) * m)
{
const size_t size1 = m->size1;
const size_t size2 = m->size2;
const size_t tda = m->tda ;
size_t i, j, k;
for (i = 0; i < size1 ; i++)
{
for (j = 0; j < size2; j++)
{
for (k = 0; k < MULTIPLICITY; k++)
{
if (m->data[(i * tda + j) * MULTIPLICITY + k] <= 0.0)
{
return 0;
}
}
}
}
return 1;
}
int
FUNCTION (gsl_matrix, isneg) (const TYPE (gsl_matrix) * m)
{
const size_t size1 = m->size1;
const size_t size2 = m->size2;
const size_t tda = m->tda ;
size_t i, j, k;
for (i = 0; i < size1 ; i++)
{
for (j = 0; j < size2; j++)
{
for (k = 0; k < MULTIPLICITY; k++)
{
if (m->data[(i * tda + j) * MULTIPLICITY + k] >= 0.0)
{
return 0;
}
}
}
}
return 1;
}
|
