** This is part of the CTSim program
** Copyright (C) 1983-2000 Kevin Rosenberg
**
-** $Id: kmath.h,v 1.14 2000/06/17 20:12:14 kevin Exp $
+** $Id: kmath.h,v 1.15 2000/06/18 10:27:11 kevin Exp $
**
** This program is free software; you can redistribute it and/or modify
** it under the terms of the GNU General Public License (version 2) as
inline T lineLength (T x1, T y1, T x2, T y2)
{ return static_cast<T>( sqrt ((x2-x1)*(x2-x1) + (y2-y1)*(y2-y1)) ); }
+template<class T>
+inline void minmax_array (const T* array, const int n, T& min, T& max)
+{
+ max = min = array[0];
+
+ for (int i = 1; i < n; i++)
+ if (array[i] < min)
+ min = array[i];
+ else if (array[i] > max)
+ max = array[i];
+}
+
/* clip.cpp */
int clip_rect(double *x1, double *y1, double *x2, double *y2, const double rect[4]);
int clip_segment(double *x1, double *y1, double *x2, double *y2, const double u, const double v);
/* simpson.cpp */
double simpson(const double xmin, const double xmax, const double *y, const int np);
-/* minmax.cpp */
-void minmax_dvector(const double array[], const int pts, double *xmin, double *xmax);
-
-
#endif