X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=lily%2Fmisc.cc;h=bd7cce55c7e4fc887e3985d18c5ba20ec107d225;hb=874fecc2e70c51d2ad34f1677496292a5c56e63d;hp=ab6cceb5f55310b13d0ed221ec6e3d3c3b60cbef;hpb=795708fdc77fccf592103e995d97ea5fda9e094f;p=lilypond.git

diff --git a/lily/misc.cc b/lily/misc.cc
index ab6cceb5f5..bd7cce55c7 100644
--- a/lily/misc.cc
+++ b/lily/misc.cc
@@ -3,101 +3,34 @@
 
   source file of the GNU LilyPond music typesetter
 
-  (c)  1997--1999 Han-Wen Nienhuys <hanwen@cs.uu.nl>
+  (c) 1997--2004 Han-Wen Nienhuys <hanwen@cs.uu.nl>
     Jan Nieuwenhuizen <janneke@gnu.org>
 */
 
 #include <math.h>
-
 #include "misc.hh"
 
-#ifndef STANDALONE
-#include "item.hh"
-#endif
-
+/*
+  Return the 2-log, rounded down 
+ */
 int
-intlog2(int d) {
+intlog2 (int d)
+{
+  assert (d);
   int i=0;
-  while (!(d&1)) 
+  while ((d != 1)) 
     {
-	d/= 2;
-	i++;
+      d /= 2;
+      i++;
     }
-  assert (!(d/2));
+  
+  assert (! (d/2));
   return i;
 }
 
 double
-log_2(double x) {
-  return log (x)  /log (2.0);
-}
-
-
-/*
-  TODO
-    group in some Array_*
-    make more generic / templatise
- */
-int
-get_lower_bound (Array<Real> const& positions, Real x)
-{
-  if (x < positions[0])
-    return 0;
-  for (int i = 1; i < positions.size (); i++)
-    if (x < positions[i])
-      return i - 1;
-  return positions.size () - 1;
-}
-
-Slice
-get_bounds_slice (Array<Real> const& positions, Real x)
+log_2 (double x)
 {
-  int l = get_lower_bound (positions, x);
-  int u = positions.size () - 1 <? l + 1;
-  if (x < positions[l])
-    u = l;
-  return Slice (l, u);
-}
-
-Interval
-get_bounds_iv (Array<Real> const& positions, Real x)
-{
-  Slice slice = get_bounds_slice (positions, x);
-  return Interval (positions[slice[SMALLER]], positions[slice[BIGGER]]);
+  return log (x)  /log (2.0);
 }
 
-// silly name
-Interval
-quantise_iv (Array<Real> const& positions, Real period, Real x)
-{
-  /*
-    ugh
-    assume that 
-      * positions are sorted, 
-      * positions are nonnegative
-      * period starts at zero
-   */
-
-  int n = (int)(x / period);
-  Real frac = (x / period - n) * period;
-  if (frac < 0)
-    {
-      frac += period;
-      n--;
-    }
-
-  Slice slice = get_bounds_slice (positions, frac);
-  Interval iv(positions[slice[SMALLER]], positions[slice[BIGGER]]);
-
-  if (slice[SMALLER] == slice[BIGGER])
-    {
-      if (slice[SMALLER] == 0)
-	iv[SMALLER] = - period + positions.top ();
-      else
-	iv[BIGGER] = period + positions[0];
-    }
-
-  iv += period * n;
-
-  return iv;
-}