X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=lily%2Fmisc.cc;h=aa49a697a6e990bac32fc78e76cd3ace09dd66ef;hb=9e69cb84d6ee5b0a861cd97869b10e3bdf0c833c;hp=3f1f2ad949fb052023c6a682e44e1a3cc4bf1d3a;hpb=5360299c83e55dfd2e8e43ff5b999afd67544877;p=lilypond.git

diff --git a/lily/misc.cc b/lily/misc.cc
index 3f1f2ad949..aa49a697a6 100644
--- a/lily/misc.cc
+++ b/lily/misc.cc
@@ -3,118 +3,78 @@
 
   source file of the GNU LilyPond music typesetter
 
-  (c)  1997--1999 Han-Wen Nienhuys <hanwen@cs.uu.nl>
-    Jan Nieuwenhuizen <janneke@gnu.org>
+  (c) 1997--2006 Han-Wen Nienhuys <hanwen@xs4all.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) {
-  int i=0;
-  while (!(d&1)) 
+intlog2 (int d)
+{
+  assert (d);
+  int i = 0;
+  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);
+log_2 (double x)
+{
+  return log (x) / log (2.0);
 }
 
-#ifndef STANDALONE
-Interval
-itemlist_width (const Array<Item*> &its)
+Real
+directed_round (Real f, Direction d)
 {
-  Interval iv ;
-  iv.set_empty();
-   
-  for (int j =0; j < its.size(); j++)
-    {
-	iv.unite (its[j]->extent (X_AXIS));
-
-    }
-  return iv;
+  if (d < 0)
+    return floor (f);
+  else
+    return ceil (f);
 }
 
-#endif
 
 
 /*
-  TODO
-    group in some Array_*
-    make more generic / templatise
+   0 at threshold,  1 at 0, with 1/x falloff.
  */
-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)
+Real
+peak_around (Real epsilon,  Real threshold, Real 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);
+  if (x < 0)
+    return 1.0;
+  return max (- epsilon * (x - threshold) / ((x + epsilon)  * threshold), 0.0);
 }
 
-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]]);
-}
 
-// silly name
-Interval
-quantise_iv (Array<Real> const& positions, Real period, Real x)
+string
+camel_case_to_lisp_identifier (string in)
 {
-  /*
-    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)
+  vector<char> out;
+  
+  /* don't add '-' before first character */
+  out.push_back (tolower (in[0]));
+    
+  for (size_t inpos = 1; inpos < in.size (); inpos++)
     {
-      frac += period;
-      n--;
+      if (isupper (in[inpos]))
+	out.push_back ('-');
+      out.push_back (tolower (in[inpos]));
     }
+  
+  string result (&out[0], out.size ());
+  replace_all (result, '_', '-');
 
-  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;
+  return result;
 }
+