Mercurial > octave
changeset 1548:3c89376f951f
[project @ 1995-10-07 07:38:14 by jwe]
| author | jwe |
|---|---|
| date | Sat, 07 Oct 1995 07:39:08 +0000 |
| parents | 75e822649946 |
| children | d1fe5918e16b |
| files | liboctave/Makefile.in liboctave/Range.cc |
| diffstat | 2 files changed, 0 insertions(+), 15 deletions(-) [+] |
line wrap: on
line diff
--- a/liboctave/Makefile.in Sat Oct 07 07:31:13 1995 +0000 +++ b/liboctave/Makefile.in Sat Oct 07 07:39:08 1995 +0000 @@ -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
--- a/liboctave/Range.cc Sat Oct 07 07:31:13 1995 +0000 +++ b/liboctave/Range.cc Sat Oct 07 07:39:08 1995 +0000 @@ -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 {