|
Packit |
67cb25 |
/* matrix/minmax_source.c
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* Copyright (C) 1996, 1997, 1998, 1999, 2000, 2007 Gerard Jungman, Brian Gough
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* This program is free software; you can redistribute it and/or modify
|
|
Packit |
67cb25 |
* it under the terms of the GNU General Public License as published by
|
|
Packit |
67cb25 |
* the Free Software Foundation; either version 3 of the License, or (at
|
|
Packit |
67cb25 |
* your option) any later version.
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* This program is distributed in the hope that it will be useful, but
|
|
Packit |
67cb25 |
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
Packit |
67cb25 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
Packit |
67cb25 |
* General Public License for more details.
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* You should have received a copy of the GNU General Public License
|
|
Packit |
67cb25 |
* along with this program; if not, write to the Free Software
|
|
Packit |
67cb25 |
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
Packit |
67cb25 |
*/
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
BASE
|
|
Packit |
67cb25 |
FUNCTION (gsl_matrix, max) (const TYPE (gsl_matrix) * m)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
/* finds the largest element of a matrix */
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
const size_t M = m->size1;
|
|
Packit |
67cb25 |
const size_t N = m->size2;
|
|
Packit |
67cb25 |
const size_t tda = m->tda;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
BASE max = m->data[0 * tda + 0];
|
|
Packit |
67cb25 |
size_t i, j;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (i = 0; i < M; i++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
for (j = 0; j < N; j++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
BASE x = m->data[i * tda + j];
|
|
Packit |
67cb25 |
if (x > max)
|
|
Packit |
67cb25 |
max = x;
|
|
Packit |
67cb25 |
#ifdef FP
|
|
Packit |
67cb25 |
if (isnan (x))
|
|
Packit |
67cb25 |
return x;
|
|
Packit |
67cb25 |
#endif
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
return max;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
BASE
|
|
Packit |
67cb25 |
FUNCTION (gsl_matrix, min) (const TYPE (gsl_matrix) * m)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
/* finds the smallest element of a matrix */
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
const size_t M = m->size1;
|
|
Packit |
67cb25 |
const size_t N = m->size2;
|
|
Packit |
67cb25 |
const size_t tda = m->tda;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
BASE min = m->data[0 * tda + 0];
|
|
Packit |
67cb25 |
size_t i, j;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (i = 0; i < M; i++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
for (j = 0; j < N; j++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
BASE x = m->data[i * tda + j];
|
|
Packit |
67cb25 |
if (x < min)
|
|
Packit |
67cb25 |
min = x;
|
|
Packit |
67cb25 |
#ifdef FP
|
|
Packit |
67cb25 |
if (isnan (x))
|
|
Packit |
67cb25 |
return x;
|
|
Packit |
67cb25 |
#endif
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
return min;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
void
|
|
Packit |
67cb25 |
FUNCTION (gsl_matrix, minmax) (const TYPE (gsl_matrix) * m,
|
|
Packit |
67cb25 |
BASE * min_out,
|
|
Packit |
67cb25 |
BASE * max_out)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
/* finds the smallest and largest elements of a matrix */
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
const size_t M = m->size1;
|
|
Packit |
67cb25 |
const size_t N = m->size2;
|
|
Packit |
67cb25 |
const size_t tda = m->tda;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
BASE max = m->data[0 * tda + 0];
|
|
Packit |
67cb25 |
BASE min = m->data[0 * tda + 0];
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
size_t i, j;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (i = 0; i < M; i++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
for (j = 0; j < N; j++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
BASE x = m->data[i * tda + j];
|
|
Packit |
67cb25 |
if (x < min)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
min = x;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
if (x > max)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
max = x;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
#ifdef FP
|
|
Packit |
67cb25 |
if (isnan (x))
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
*min_out = x;
|
|
Packit |
67cb25 |
*max_out = x;
|
|
Packit |
67cb25 |
return;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
#endif
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
*min_out = min;
|
|
Packit |
67cb25 |
*max_out = max;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
void
|
|
Packit |
67cb25 |
FUNCTION (gsl_matrix, max_index) (const TYPE (gsl_matrix) * m, size_t * imax_out, size_t *jmax_out)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
/* finds the largest element of a matrix */
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
const size_t M = m->size1;
|
|
Packit |
67cb25 |
const size_t N = m->size2;
|
|
Packit |
67cb25 |
const size_t tda = m->tda;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
BASE max = m->data[0 * tda + 0];
|
|
Packit |
67cb25 |
size_t imax = 0, jmax = 0;
|
|
Packit |
67cb25 |
size_t i, j;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (i = 0; i < M; i++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
for (j = 0; j < N; j++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
BASE x = m->data[i * tda + j];
|
|
Packit |
67cb25 |
if (x > max)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
max = x;
|
|
Packit |
67cb25 |
imax = i;
|
|
Packit |
67cb25 |
jmax = j;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
#ifdef FP
|
|
Packit |
67cb25 |
if (isnan (x))
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
*imax_out = i;
|
|
Packit |
67cb25 |
*jmax_out = j;
|
|
Packit |
67cb25 |
return;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
#endif
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
*imax_out = imax;
|
|
Packit |
67cb25 |
*jmax_out = jmax;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
void
|
|
Packit |
67cb25 |
FUNCTION (gsl_matrix, min_index) (const TYPE (gsl_matrix) * m, size_t * imin_out, size_t *jmin_out)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
/* finds the largest element of a matrix */
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
const size_t M = m->size1;
|
|
Packit |
67cb25 |
const size_t N = m->size2;
|
|
Packit |
67cb25 |
const size_t tda = m->tda;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
BASE min = m->data[0 * tda + 0];
|
|
Packit |
67cb25 |
size_t imin = 0, jmin = 0;
|
|
Packit |
67cb25 |
size_t i, j;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (i = 0; i < M; i++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
for (j = 0; j < N; j++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
BASE x = m->data[i * tda + j];
|
|
Packit |
67cb25 |
if (x < min)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
min = x;
|
|
Packit |
67cb25 |
imin = i;
|
|
Packit |
67cb25 |
jmin = j;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
#ifdef FP
|
|
Packit |
67cb25 |
if (isnan (x))
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
*imin_out = i;
|
|
Packit |
67cb25 |
*jmin_out = j;
|
|
Packit |
67cb25 |
return;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
#endif
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
*imin_out = imin;
|
|
Packit |
67cb25 |
*jmin_out = jmin;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
void
|
|
Packit |
67cb25 |
FUNCTION (gsl_matrix, minmax_index) (const TYPE (gsl_matrix) * m,
|
|
Packit |
67cb25 |
size_t * imin_out,
|
|
Packit |
67cb25 |
size_t * jmin_out,
|
|
Packit |
67cb25 |
size_t * imax_out,
|
|
Packit |
67cb25 |
size_t * jmax_out)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
/* finds the smallest and largest elements of a matrix */
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
const size_t M = m->size1;
|
|
Packit |
67cb25 |
const size_t N = m->size2;
|
|
Packit |
67cb25 |
const size_t tda = m->tda;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
size_t imin = 0, jmin = 0, imax = 0, jmax = 0;
|
|
Packit |
67cb25 |
BASE max = m->data[0 * tda + 0];
|
|
Packit |
67cb25 |
BASE min = m->data[0 * tda + 0];
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
size_t i, j;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (i = 0; i < M; i++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
for (j = 0; j < N; j++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
BASE x = m->data[i * tda + j];
|
|
Packit |
67cb25 |
if (x < min)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
min = x;
|
|
Packit |
67cb25 |
imin = i;
|
|
Packit |
67cb25 |
jmin = j;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
if (x > max)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
max = x;
|
|
Packit |
67cb25 |
imax = i;
|
|
Packit |
67cb25 |
jmax = j;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
#ifdef FP
|
|
Packit |
67cb25 |
if (isnan (x))
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
*imin_out = i;
|
|
Packit |
67cb25 |
*jmin_out = j;
|
|
Packit |
67cb25 |
*imax_out = i;
|
|
Packit |
67cb25 |
*jmax_out = j;
|
|
Packit |
67cb25 |
return;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
#endif
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
*imin_out = imin;
|
|
Packit |
67cb25 |
*jmin_out = jmin;
|
|
Packit |
67cb25 |
*imax_out = imax;
|
|
Packit |
67cb25 |
*jmax_out = jmax;
|
|
Packit |
67cb25 |
}
|