X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=lily%2Fmisc.cc;h=0fa4a9024006b4e24b0fe0f00e824fc65538dd86;hb=4bb29573149a0ffa1f881c5e38a0fe68e9e76b67;hp=e63ac8cab11dbfd2d59a076b7cc13e6a3197213a;hpb=8aad615ea7bb31f49a0c2afc21eea5ff5de20437;p=lilypond.git

diff --git a/lily/misc.cc b/lily/misc.cc
index e63ac8cab1..0fa4a90240 100644
--- a/lily/misc.cc
+++ b/lily/misc.cc
@@ -1,120 +1,116 @@
 /*
-  misc.cc -- implement various stuff
+  This file is part of LilyPond, the GNU music typesetter.
 
-  source file of the GNU LilyPond music typesetter
+  Copyright (C) 1997--2011 Han-Wen Nienhuys <hanwen@xs4all.nl>
+  Jan Nieuwenhuizen <janneke@gnu.org>
 
-  (c)  1997--1999, 1998 Han-Wen Nienhuys <hanwen@cs.uu.nl>
-    Jan Nieuwenhuizen <janneke@gnu.org>
-*/
+  LilyPond is free software: you can redistribute it and/or modify
+  it under the terms of the GNU General Public License as published by
+  the Free Software Foundation, either version 3 of the License, or
+  (at your option) any later version.
 
-#include <math.h>
+  LilyPond is distributed in the hope that it will be useful,
+  but WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+  GNU General Public License for more details.
 
-#include "misc.hh"
+  You should have received a copy of the GNU General Public License
+  along with LilyPond.  If not, see <http://www.gnu.org/licenses/>.
+*/
 
-#ifndef STANDALONE
-#include "item.hh"
-#endif
+#include "misc.hh"
+#include "warn.hh"
 
+/*
+  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)
+/*
+  0 at 0,  1 at standard_x, and increasing thereafter.
+ */
+Real
+convex_amplifier (Real standard_x, Real increase_factor, Real x)
 {
-  Slice slice = get_bounds_slice (positions, x);
-  return Interval (positions[slice.min ()], positions[slice.max ()]);
+  return (exp (increase_factor * x / standard_x) - 1.0) / (exp (increase_factor) - 1.0);
 }
 
-// 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)
-    {
-      frac += period;
-      n--;
-    }
+  vector<char> out;
 
-  Slice slice = get_bounds_slice (positions, frac);
-  Interval iv(positions[slice.min ()], positions[slice.max ()]);
+  /* don't add '-' before first character */
+  out.push_back (char (tolower (in[0])));
 
-  if (slice.min () == slice.max ())
+  for (size_t inpos = 1; inpos < in.size (); inpos++)
     {
-      if (slice.min () == 0)
-	iv.min () = - period + positions.top ();
-      else
-	iv.max () = period + positions[0];
+      if (isupper (in[inpos]))
+        out.push_back ('-');
+      out.push_back ( char (tolower (in[inpos])));
     }
 
-  iv += period * n;
+  string result (&out[0], out.size ());
+  replace_all (&result, '_', '-');
 
-  return iv;
+  return result;
+}
+
+vsize
+utf8_char_len (char current)
+{
+  vsize char_len = 1;
+
+  // U+10000 - U+10FFFF
+  if ((current & 0xF0) == 0xF0)
+    char_len = 4;
+  // U+0800 - U+FFFF
+  else if ((current & 0xE0) == 0xE0)
+    char_len = 3;
+  // U+0080 - U+07FF
+  else if ((current & 0xC0) == 0xC0)
+    char_len = 2;
+  else if (current & 0x80)
+    programming_error ("invalid UTF-8 string");
+
+  return char_len;
 }