# HG changeset patch
# User jwe
# Date 813051548 0
# Node ID 3c89376f951f0c171b357d6f9260b0c3b60bf6e4
# Parent  75e8226499460a4eff8e2c7e4e2c2c5a0873bd87
[project @ 1995-10-07 07:38:14 by jwe]

diff --git a/liboctave/Makefile.in b/liboctave/Makefile.in
--- a/liboctave/Makefile.in
+++ b/liboctave/Makefile.in
@@ -30,7 +30,6 @@
 	LinConst.h LP.h LPsolve.h NLConst.h NLEqn.h NLFunc.h NLP.h \
 	NPSOL.h ODE.h ODEFunc.h Objective.h QLD.h QP.h QPSOL.h \
 	Quad.h Range.h base-min.h lo-error.h f77-uscore.h sun-utils.h \
-	tfloor.h \
 	$(MATRIX_INC)
 
 TEMPLATE_SRC = Array.cc MArray.cc
diff --git a/liboctave/Range.cc b/liboctave/Range.cc
--- a/liboctave/Range.cc
+++ b/liboctave/Range.cc
@@ -212,20 +212,6 @@
   return tfloor (x+0.5, ct);
 }
 
-
-// Find an approximate number of intervals, then do the best we can to
-// find the number of intervals that we would get if we had done
-// something like
-//
-//   nelem = 0;
-//   while (base + nelem * inc <= limit)
-//     nelem++;
-//
-// (for limit > base && inc > 0)
-//
-// The number of elements in the range is one greater than the number
-// of intervals.
-
 int
 Range::nelem_internal (void) const
 {