X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=lily%2Fmisc.cc;h=92dece88e10635550aa7dbfd6b9a54dbc589ef2f;hb=dfabdfc835b456df4d4d554d560a281ec35e1d5f;hp=d150d557926ecc4ecd7293a03659cd7c9666d81f;hpb=13e79c0250d34b6bdfbafbc551ef64e8b59b2991;p=lilypond.git diff --git a/lily/misc.cc b/lily/misc.cc index d150d55792..92dece88e1 100644 --- a/lily/misc.cc +++ b/lily/misc.cc @@ -1,47 +1,119 @@ /* - 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--2009 Han-Wen Nienhuys + Jan Nieuwenhuizen - (c) 1997 Han-Wen Nienhuys + 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. + + 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. + + You should have received a copy of the GNU General Public License + along with LilyPond. If not, see . */ -#include -#include "item.hh" #include "misc.hh" -#include "moment.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); } -#if 1 -Interval -itemlist_width (const Array &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]->width()); + if (d < 0) + return floor (f); + else + return ceil (f); +} + + + +/* + 0 at threshold, 1 at 0, with 1/x falloff. + */ +Real +peak_around (Real epsilon, Real threshold, Real x) +{ + if (x < 0) + return 1.0; + return max (- epsilon * (x - threshold) / ((x + epsilon) * threshold), 0.0); +} +/* + 0 at 0, 1 at standard_x, and increasing thereafter. + */ +Real +convex_amplifier (Real standard_x, Real increase_factor, Real x) +{ + return (exp (increase_factor * x / standard_x) - 1.0) / (exp (increase_factor) - 1.0); +} + +string +camel_case_to_lisp_identifier (string in) +{ + vector out; + + /* don't add '-' before first character */ + out.push_back (char (tolower (in[0]))); + + for (size_t inpos = 1; inpos < in.size (); inpos++) + { + if (isupper (in[inpos])) + out.push_back ('-'); + out.push_back ( char(tolower (in[inpos]))); } - return iv; + + string result (&out[0], out.size ()); + replace_all (&result, '_', '-'); + + return result; } -#endif +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; +}