* scripts/musicxml2ly.py (convert): add \version

[lilypond.git] / lily / misc.cc

diff --git a/lily/misc.cc b/lily/misc.cc
index ae015bdbc1b9e6467f77c795c1a8b9e88885d493..0cfd68a1d4cc1e3d8a920fc2d189a1942dc5f1b9 100644 (file)
--- a/lily/misc.cc
+++ b/lily/misc.cc
@@ -3,118 +3,69 @@
 
   source file of the GNU LilyPond music typesetter
 
-  (c)  1997--1999, 1998 Han-Wen Nienhuys <hanwen@cs.uu.nl>
-    Jan Nieuwenhuizen <janneke@gnu.org>
+  (c) 1997--2005 Han-Wen Nienhuys <hanwen@xs4all.nl>
+  Jan Nieuwenhuizen <janneke@gnu.org>
 */
 
-#include <math.h>
 
 #include "misc.hh"
+#include "string.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)
+Array<String>
+split_string (String s, char c)
 {
-  Interval iv ;
-  iv.set_empty();
-   
-  for (int j =0; j < its.size(); j++)
+  Array<String> rv;
+  while (s.length ())
     {
-       iv.unite (its[j]->extent (X_AXIS));
+      int i = s.index (c);
 
-    }
-  return iv;
-}
+      if (i == 0)
+       {
+         s = s.nomid_string (0, 1);
+         continue;
+       }
 
-#endif
+      if (i < 0)
+       i = s.length ();
 
+      rv.push (s.cut_string (0, i));
+      s = s.nomid_string (0, i);
+    }
 
-/*
-  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;
+  return rv;
 }
 
-Slice
-get_bounds_slice (Array<Real> const& positions, 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);
-}
 
-Interval
-get_bounds_iv (Array<Real> const& positions, Real x)
+Real
+directed_round (Real f, Direction d)
 {
-  Slice slice = get_bounds_slice (positions, x);
-  return Interval (positions[slice[SMALLER]], positions[slice[BIGGER]]);
+  if (d < 0)
+    return floor (f);
+  else
+    return ceil (f);
 }
 
-// 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;
-}