X-Git-Url: http://git.kpe.io/?p=ctsim.git;a=blobdiff_plain;f=include%2Fkmath.h;h=0ed4f2a3cb3de6319d8dbd75fbfa7acbb1b2c667;hp=48370267f1f9d92740bded47f363b83e3a4dde78;hb=2c61ff85796550481227f2fbec53506a6b5bd365;hpb=b5857e74e5735455b5ef11cbea5044ae7b2e8a0d

diff --git a/include/kmath.h b/include/kmath.h
index 4837026..0ed4f2a 100644
--- a/include/kmath.h
+++ b/include/kmath.h
@@ -9,7 +9,7 @@
 **  This is part of the CTSim program
 **  Copyright (C) 1983-2000 Kevin Rosenberg
 **
-**  $Id: kmath.h,v 1.13 2000/06/15 19:07:10 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
@@ -64,6 +64,21 @@ template<class T>
 inline T clamp (T value, T lowerBounds, T upperBounds)
 { return (value >= upperBounds ? upperBounds : (value <= lowerBounds ? lowerBounds : value )); }
 
+template<class T>
+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]);
@@ -89,8 +104,4 @@ void scale2d(double x[], double y[], int pts, double xfact, double yfact);
 /* 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