1 /* matrix/prop_source.c
3 * Copyright (C) 1996, 1997, 1998, 1999, 2000, 2007 Gerard Jungman, Brian Gough
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 3 of the License, or (at
8 * your option) any later version.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
21 FUNCTION (gsl_matrix, isnull) (const TYPE (gsl_matrix) * m)
23 const size_t size1 = m->size1;
24 const size_t size2 = m->size2;
25 const size_t tda = m->tda ;
29 for (i = 0; i < size1 ; i++)
31 for (j = 0; j < size2; j++)
33 for (k = 0; k < MULTIPLICITY; k++)
35 if (m->data[(i * tda + j) * MULTIPLICITY + k] != 0.0)
48 FUNCTION (gsl_matrix, ispos) (const TYPE (gsl_matrix) * m)
50 const size_t size1 = m->size1;
51 const size_t size2 = m->size2;
52 const size_t tda = m->tda ;
56 for (i = 0; i < size1 ; i++)
58 for (j = 0; j < size2; j++)
60 for (k = 0; k < MULTIPLICITY; k++)
62 if (m->data[(i * tda + j) * MULTIPLICITY + k] <= 0.0)
75 FUNCTION (gsl_matrix, isneg) (const TYPE (gsl_matrix) * m)
77 const size_t size1 = m->size1;
78 const size_t size2 = m->size2;
79 const size_t tda = m->tda ;
83 for (i = 0; i < size1 ; i++)
85 for (j = 0; j < size2; j++)
87 for (k = 0; k < MULTIPLICITY; k++)
89 if (m->data[(i * tda + j) * MULTIPLICITY + k] >= 0.0)
102 FUNCTION (gsl_matrix, isnonneg) (const TYPE (gsl_matrix) * m)
104 const size_t size1 = m->size1;
105 const size_t size2 = m->size2;
106 const size_t tda = m->tda ;
110 for (i = 0; i < size1 ; i++)
112 for (j = 0; j < size2; j++)
114 for (k = 0; k < MULTIPLICITY; k++)
116 if (m->data[(i * tda + j) * MULTIPLICITY + k] < 0.0)