/*
- lily-guile.cc -- implement assorted SCM interface functions
+ This file is part of LilyPond, the GNU music typesetter.
- source file of the GNU LilyPond music typesetter
-
- (c) 1998--2006 Jan Nieuwenhuizen <janneke@gnu.org>
+ Copyright (C) 1998--2015 Jan Nieuwenhuizen <janneke@gnu.org>
Han-Wen Nienhuys <hanwen@xs4all.nl>
+
+ 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 <http://www.gnu.org/licenses/>.
*/
#include "lily-guile.hh"
using namespace std;
-#include "config.hh"
-
#include "dimensions.hh"
#include "direction.hh"
#include "file-path.hh"
#include "source-file.hh"
#include "version.hh"
#include "warn.hh"
+#include "lily-imports.hh"
-// #define TEST_GC
-
-SCM
-ly_to_symbol (SCM scm)
-{
- return scm_string_to_symbol (ly_to_string (scm));
-}
-
-SCM
-ly_to_string (SCM scm)
-{
- return scm_call_3 (ly_lily_module_constant ("format"), SCM_BOOL_F,
-
- scm_makfrom0str ("~S"), scm);
-}
-
-SCM
-ly_last (SCM list)
-{
- return scm_car (scm_last_pair (list));
-}
-
-SCM
-ly_write2scm (SCM s)
+/*
+ symbols/strings.
+ */
+string
+ly_scm_write_string (SCM s)
{
SCM port = scm_mkstrport (SCM_INUM0,
- scm_make_string (SCM_INUM0, SCM_UNDEFINED),
- SCM_OPN | SCM_WRTNG,
- "ly_write2string");
+ scm_make_string (SCM_INUM0, SCM_UNDEFINED),
+ SCM_OPN | SCM_WRTNG,
+ "ly_write2string");
// SCM write = scm_eval_3 (ly_symbol2scm ("write"), s, SCM_EOL);
SCM write = scm_primitive_eval (ly_symbol2scm ("write"));
// scm_apply (write, port, SCM_EOL);
scm_call_2 (write, s, port);
- return scm_strport_to_string (port);
+ return ly_scm2string (scm_strport_to_string (port));
}
SCM
ly_quote_scm (SCM s)
{
- return scm_list_n (ly_symbol2scm ("quote"), s, SCM_UNDEFINED);
+ return scm_list_2 (ly_symbol2scm ("quote"), s);
}
string
/*
Ugh. this is not very efficient.
*/
- SCM str = scm_symbol_to_string (s);
- return ly_scm2string (str);
+ return ly_scm2string (scm_symbol_to_string (s));
}
string
-gulp_file_to_string (string fn, bool must_exist, int size)
+robust_symbol2string (SCM sym, const string &str)
+{
+ return scm_is_symbol (sym) ? ly_symbol2string (sym) : str;
+}
+
+string
+gulp_file_to_string (const string &fn, bool must_exist, int size)
{
string s = global_path.find (fn);
if (s == "")
{
if (must_exist)
- {
- string e = _f ("can't find file: `%s'", fn);
- e += " ";
- e += _f ("(load path: `%s')", global_path.to_string ());
- error (e);
- /* unreachable */
- }
+ {
+ string e = _f ("cannot find file: `%s'", fn);
+ e += " ";
+ e += _f ("(load path: `%s')", global_path.to_string ());
+ error (e);
+ /* unreachable */
+ }
return s;
}
- if (be_verbose_global)
- progress_indication ("[" + s);
+ debug_output ("[" + s, true);
vector<char> chars = gulp_file (s, size);
string result (&chars[0], chars.size ());
- if (be_verbose_global)
- progress_indication ("]");
+ debug_output ("]\n", false);
return result;
}
-void
-ly_display_scm (void *s)
-{
- scm_display ((SCM)s, scm_current_output_port ());
- scm_newline (scm_current_output_port ());
-}
+extern "C" {
+ // maybe gdb 5.0 becomes quicker if it doesn't do fancy C++ typing?
+ void
+ ly_display_scm (SCM s)
+ {
+ scm_display (s, scm_current_output_port ());
+ scm_newline (scm_current_output_port ());
+ }
+};
+/*
+ STRINGS
+ */
string
ly_scm2string (SCM str)
{
assert (scm_is_string (str));
- return string (scm_i_string_chars (str),
- (int) scm_i_string_length (str));
+ string result;
+ size_t len = scm_c_string_length (str);
+ if (len)
+ {
+ result.resize (len);
+ scm_to_locale_stringbuf (str, &result.at (0), len);
+ }
+ return result;
}
-char *
-ly_scm2newstr (SCM str, size_t *lenp)
+SCM
+ly_string2scm (string const &str)
{
- SCM_ASSERT_TYPE (scm_is_string (str), str, SCM_ARG1, __FUNCTION__, "string");
-
- size_t len = scm_i_string_length (str);
- if (char *new_str = (char *) malloc ((len + 1) * sizeof (char)))
- {
- memcpy (new_str, scm_i_string_chars (str), len);
- new_str[len] = '\0';
-
- if (lenp)
- *lenp = len;
+ return scm_from_locale_stringn (str.c_str (),
+ str.length ());
+}
- return new_str;
- }
- return 0;
+char *
+ly_scm2str0 (SCM str)
+{
+ return scm_to_utf8_string (str);
}
+/*
+ PAIRS
+*/
SCM
index_get_cell (SCM s, Direction d)
{
-
assert (d);
return (d == LEFT) ? scm_car (s) : scm_cdr (s);
}
is_number_pair (SCM p)
{
return scm_is_pair (p)
- && scm_is_number (scm_car (p)) && scm_is_number (scm_cdr (p));
+ && scm_is_number (scm_car (p)) && scm_is_number (scm_cdr (p));
}
-typedef void (*Void_fptr) ();
-vector<Void_fptr> *scm_init_funcs_;
-
-void add_scm_init_func (void (*f) ())
+unsigned int
+ly_scm_hash (SCM s)
{
- if (!scm_init_funcs_)
- scm_init_funcs_ = new vector<Void_fptr>;
-
- scm_init_funcs_->push_back (f);
+ return scm_ihashv (s, ~1u);
}
-void
-ly_init_ly_module (void *)
+bool
+is_axis (SCM s)
{
- for (vsize i = scm_init_funcs_->size (); i--;)
- (scm_init_funcs_->at (i)) ();
-
- if (be_verbose_global)
+ if (scm_is_integer (s))
{
- progress_indication ("[");
- scm_display (scm_c_eval_string ("(%search-load-path \"lily.scm\")"),
- scm_current_error_port ());
- progress_indication ("]\n");
+ int i = scm_to_int (s);
+ return i == 0 || i == 1;
}
-
- scm_primitive_load_path (scm_makfrom0str ("lily.scm"));
+ return false;
}
-SCM global_lily_module;
-
-void
-ly_c_init_guile ()
+bool
+to_boolean (SCM s)
{
- global_lily_module = scm_c_define_module ("lily", ly_init_ly_module, 0);
- scm_c_use_module ("lily");
+ return scm_is_bool (s) && ly_scm2bool (s);
}
-unsigned int
-ly_scm_hash (SCM s)
+/*
+ DIRECTIONS
+ */
+Direction
+to_dir (SCM s)
{
- return scm_ihashv (s, ~1u);
+ return scm_is_integer (s) ? (Direction) scm_to_int (s) : CENTER;
}
-bool
-is_direction (SCM s)
+Direction
+robust_scm2dir (SCM d, Direction def)
{
- if (scm_is_number (s))
- {
- int i = scm_to_int (s);
- return i >= -1 && i <= 1;
- }
- return false;
+ if (is_direction (d))
+ def = to_dir (d);
+ return def;
}
bool
-is_axis (SCM s)
+is_direction (SCM s)
{
if (scm_is_number (s))
{
int i = scm_to_int (s);
- return i == 0 || i == 1;
+ return i >= -1 && i <= 1;
}
return false;
}
-Direction
-to_dir (SCM s)
-{
- return scm_is_integer (s) ? (Direction) scm_to_int (s) : CENTER;
-}
-
+/*
+ INTERVALS
+ */
Interval
ly_scm2interval (SCM p)
{
- return Interval (scm_to_double (scm_car (p)), scm_to_double (scm_cdr (p)));
+ return Interval (scm_to_double (scm_car (p)),
+ scm_to_double (scm_cdr (p)));
}
Drul_array<Real>
ly_scm2realdrul (SCM p)
{
return Drul_array<Real> (scm_to_double (scm_car (p)),
- scm_to_double (scm_cdr (p)));
+ scm_to_double (scm_cdr (p)));
}
SCM
return scm_cons (scm_from_double (i[LEFT]), scm_from_double (i[RIGHT]));
}
-bool
-to_boolean (SCM s)
+Interval
+robust_scm2interval (SCM k, Drul_array<Real> v)
{
- return scm_is_bool (s) && ly_scm2bool (s);
+ Interval i;
+ i[LEFT] = v[LEFT];
+ i[RIGHT] = v[RIGHT];
+ if (is_number_pair (k))
+ i = ly_scm2interval (k);
+ return i;
}
-/* Appendable list L: the cdr contains the list, the car the last cons
- in the list. */
-SCM
-appendable_list ()
+Drul_array<Real>
+robust_scm2drul (SCM k, Drul_array<Real> v)
{
- SCM s = scm_cons (SCM_EOL, SCM_EOL);
- scm_set_car_x (s, s);
-
- return s;
+ if (is_number_pair (k))
+ v = ly_scm2interval (k);
+ return v;
}
-void
-appendable_list_append (SCM l, SCM elt)
+Drul_array<bool>
+robust_scm2booldrul (SCM k, Drul_array<bool> def)
{
- SCM newcons = scm_cons (elt, SCM_EOL);
-
- scm_set_cdr_x (scm_car (l), newcons);
- scm_set_car_x (l, newcons);
+ if (scm_is_pair (k))
+ {
+ def[LEFT] = to_boolean (scm_car (k));
+ def[RIGHT] = to_boolean (scm_cdr (k));
+ }
+ return def;
}
+/*
+ OFFSET
+*/
SCM
ly_offset2scm (Offset o)
{
ly_scm2offset (SCM s)
{
return Offset (scm_to_double (scm_car (s)),
- scm_to_double (scm_cdr (s)));
+ scm_to_double (scm_cdr (s)));
}
+Offset
+robust_scm2offset (SCM k, Offset o)
+{
+ if (is_number_pair (k))
+ o = ly_scm2offset (k);
+ return o;
+}
SCM
-ly_deep_copy (SCM src)
+ly_offsets2scm (vector<Offset> os)
{
- if (scm_is_pair (src))
- return scm_cons (ly_deep_copy (scm_car (src)), ly_deep_copy (scm_cdr (src)));
- else if (scm_is_vector (src))
+ SCM l = SCM_EOL;
+ SCM *tail = &l;
+ for (vsize i = 0; i < os.size (); i++)
{
- int len = scm_c_vector_length (src);
- SCM nv = scm_c_make_vector (len, SCM_UNDEFINED);
- for (int i = 0;i < len; i++)
- {
- SCM si = scm_from_int (i);
- scm_vector_set_x (nv, si, ly_deep_copy (scm_vector_ref (src, si)));
- }
+ *tail = scm_cons (ly_offset2scm (os[i]), SCM_EOL);
+ tail = SCM_CDRLOC (*tail);
}
- return src;
+ return l;
}
-/* looks the key up in the cdrs of the alist-keys
- - ignoring the car and ignoring non-pair keys.
- Returns first match found, i.e.
-
- alist = ((1 . 10)
- ((1 . 2) . 11)
- ((2 . 1) . 12)
- ((3 . 0) . 13)
- ((4 . 1) . 14) )
-
- I would like (ly_assoc_cdr 1) to return 12 - because it's the first
- element with the cdr of the key = 1. In other words (alloc_cdr key)
- corresponds to call
-
- (alloc (anything . key))
-*/
-SCM
-ly_assoc_cdr (SCM key, SCM alist)
+vector<Offset>
+ly_scm2offsets (SCM s)
{
- if (scm_is_pair (alist))
- {
- SCM trykey = scm_caar (alist);
- if (scm_is_pair (trykey)
- && to_boolean (scm_equal_p (key, scm_cdr (trykey))))
- return scm_car (alist);
- return ly_assoc_cdr (key, scm_cdr (alist));
- }
- return SCM_BOOL_F;
+ vector<Offset> os;
+ for (; scm_is_pair (s); s = scm_cdr (s))
+ os.push_back (ly_scm2offset (scm_car (s)));
+ return os;
}
+/*
+ ALIST
+*/
SCM
-ly_string_array_to_scm (vector<string> a)
+ly_alist_vals (SCM alist)
{
- SCM s = SCM_EOL;
- for (vsize i = a.size (); i ; i--)
- s = scm_cons (ly_symbol2scm (a[i - 1].c_str ()), s);
- return s;
+ SCM x = SCM_EOL;
+ for (SCM p = alist; scm_is_pair (p); p = scm_cdr (p))
+ x = scm_cons (scm_cdar (p), x);
+ return x;
}
-/* SYMBOLS is a whitespace separated list. */
+/*
+ LISTS
+ */
+
+/* Return I-th element, or last elt L. If I < 0, then we take the first
+ element.
+
+ PRE: length (L) > 0 */
SCM
-parse_symbol_list (char const *symbols)
+robust_list_ref (int i, SCM l)
{
- while (isspace (*symbols))
- *symbols++;
- string s = symbols;
- replace_all (s, '\n', ' ');
- replace_all (s, '\t', ' ');
- return ly_string_array_to_scm (string_split (s, ' '));
+ while (i-- > 0 && scm_is_pair (scm_cdr (l)))
+ l = scm_cdr (l);
+ return scm_car (l);
}
SCM
-ly_truncate_list (int k, SCM lst)
+ly_deep_copy (SCM src)
{
- if (k == 0)
- lst = SCM_EOL;
- else
+ if (scm_is_pair (src))
{
- SCM s = lst;
- k--;
- for (; scm_is_pair (s) && k--; s = scm_cdr (s))
- ;
-
- if (scm_is_pair (s))
- scm_set_cdr_x (s, SCM_EOL);
+ SCM res = SCM_EOL;
+ do
+ {
+ res = scm_cons (ly_deep_copy (scm_car (src)), res);
+ src = scm_cdr (src);
+ }
+ while (scm_is_pair (src));
+ // Oh, come on, GUILE. Why do you require the second argument
+ // of scm_reverse_x to be a proper list? That makes no sense.
+ // return scm_reverse_x (res, ly_deep_copy (src));
+ SCM last_cons = res;
+ res = scm_reverse_x (res, SCM_EOL);
+ scm_set_cdr_x (last_cons, ly_deep_copy (src));
+ return res;
}
- return lst;
+ if (scm_is_vector (src))
+ {
+ int len = scm_c_vector_length (src);
+ SCM nv = scm_c_make_vector (len, SCM_UNDEFINED);
+ for (int i = 0; i < len; i++)
+ {
+ SCM si = scm_from_int (i);
+ scm_vector_set_x (nv, si, ly_deep_copy (scm_vector_ref (src, si)));
+ }
+ return nv;
+ }
+ return src;
}
string
print_scm_val (SCM val)
{
- string realval = ly_scm2string (ly_write2scm (val));
+ string realval = ly_scm_write_string (val);
if (realval.length () > 200)
realval = realval.substr (0, 100)
- + "\n :\n :\n"
- + realval.substr (realval.length () - 100);
+ + "\n :\n :\n"
+ + realval.substr (realval.length () - 100);
return realval;
}
bool
type_check_assignment (SCM sym, SCM val, SCM type_symbol)
{
- bool ok = true;
-
- /*
- Always succeeds.
-
-
- TODO: should remove #f from allowed vals?
- */
- if (val == SCM_EOL || val == SCM_BOOL_F)
- return ok;
+ // If undefined, some internal function caused it...should never happen.
+ assert (!SCM_UNBNDP (val));
if (!scm_is_symbol (sym))
-#if 0
return false;
-#else
- /*
- This is used for autoBeamSettings.
-
- TODO: deprecate the use of \override and \revert for
- autoBeamSettings?
-
- or use a symbol autoBeamSettingS?
- */
- return true;
-#endif
SCM type = scm_object_property (sym, type_symbol);
- if (type != SCM_EOL && !ly_is_procedure (type))
+ if (!scm_is_null (type) && !ly_is_procedure (type))
{
- warning (_f ("can't find property type-check for `%s' (%s).",
- ly_symbol2string (sym).c_str (),
- ly_symbol2string (type_symbol).c_str ())
- + " " + _ ("perhaps a typing error?"));
+ warning (_f ("cannot find property type-check for `%s' (%s).",
+ ly_symbol2string (sym).c_str (),
+ ly_symbol2string (type_symbol).c_str ())
+ + " " + _ ("perhaps a typing error?"));
/* Be strict when being anal :) */
if (do_internal_type_checking_global)
- abort ();
+ scm_throw (ly_symbol2scm ("ly-file-failed"), scm_list_3 (ly_symbol2scm ("typecheck"),
+ sym, val));
- warning (_ ("doing assignment anyway"));
+ warning (_ ("skipping assignment"));
+ return false;
}
- else
+
+ /*
+ Always succeeds.
+
+
+ TODO: should remove #f from allowed vals?
+ */
+ if (scm_is_null (val) || scm_is_false (val))
+ return true;
+
+ if (!scm_is_null (val)
+ && ly_is_procedure (type)
+ && scm_is_false (scm_call_1 (type, val)))
{
- if (val != SCM_EOL
- && ly_is_procedure (type)
- && scm_call_1 (type, val) == SCM_BOOL_F)
- {
- ok = false;
- SCM typefunc = ly_lily_module_constant ("type-name");
- SCM type_name = scm_call_1 (typefunc, type);
-
- warning (_f ("type check for `%s' failed; value `%s' must be of type `%s'",
- ly_symbol2string (sym).c_str (),
- print_scm_val (val),
- ly_scm2string (type_name).c_str ()));
- progress_indication ("\n");
- }
+ SCM type_name = Lily::type_name (type);
+
+ warning (_f ("type check for `%s' failed; value `%s' must be of type `%s'",
+ ly_symbol2string (sym).c_str (),
+ print_scm_val (val),
+ ly_scm2string (type_name).c_str ()));
+ progress_indication ("\n");
+ return false;
}
- return ok;
+ return true;
}
+void
+ly_wrong_smob_arg (bool pred (SCM), SCM var, int number, const char *fun)
+{
+ string type = predicate_to_typename ((void *) pred);
+ if (pred (var))
+ {
+ // Uh oh. unsmob<T> delivered 0, yet
+ // unsmob<T> delivers true. This means that unsmob<T> is a
+ // matching check from a base class of T, but var is of an
+ // incompatible derived type.
+ type = string (_ ("Wrong kind of ")).append (type);
+ }
+ scm_wrong_type_arg_msg (mangle_cxx_identifier (fun).c_str (),
+ number, var, type.c_str ());
+}
+
+
/* some SCM abbrevs
zijn deze nou handig?
for (SCM i = list; scm_is_pair (i); i = scm_cdr (i))
{
if (!scm_is_pair (scm_cdr (i))
- || !ly_is_equal (scm_car (i), scm_cadr (i)))
- unique = scm_cons (scm_car (i), unique);
+ || !ly_is_equal (scm_car (i), scm_cadr (i)))
+ unique = scm_cons (scm_car (i), unique);
}
return scm_reverse_x (unique, SCM_EOL);
}
-static int
-scm_default_compare (void const *a, void const *b)
-{
- SCM pa = *(SCM *) a;
- SCM pb = *(SCM *) b;
- if (pa == pb)
- return 0;
- return pa < pb ? -1 : 1;
-}
-
-/* Modify LST in place: qsort it.
-
-FIXME: unused, junk? */
-SCM
-ly_list_qsort_uniq_x (SCM lst)
-{
- int len = scm_ilength (lst);
- SCM *arr = new SCM[len];
- int k = 0;
- for (SCM s = lst; SCM_NNULLP (s); s = scm_cdr (s))
- arr[k++] = scm_car (s);
-
- assert (k == len);
- qsort (arr, len, sizeof (SCM), &scm_default_compare);
-
- SCM *tail = &lst;
- for (int i = 0; i < len; i++)
- if (!i || arr[i] != arr[i - 1])
- {
- SCM_SETCAR (*tail, arr[i]);
- tail = SCM_CDRLOC (*tail);
- }
-
- *tail = SCM_EOL;
- delete[] arr;
-
- return lst;
-}
-
-/* tail add */
-SCM
-ly_snoc (SCM s, SCM list)
-{
- return ly_append2 (list, scm_list_n (s, SCM_UNDEFINED));
-}
-
/* Split list at member s, removing s.
Return (BEFORE . AFTER) */
SCM
SCM i = scm_car (after);
after = scm_cdr (after);
if (ly_is_equal (i, s))
- break;
+ break;
before = scm_cons (i, before);
}
return scm_cons (scm_reverse_x (before, SCM_EOL), after);
return SCM_UNSPECIFIED;
}
+// Needed as complement to int_list_to_slice since scm_c_memq refuses
+// to work with dotted lists.
+
+SCM
+ly_memv (SCM v, SCM l)
+{
+ for (; scm_is_pair (l); l = scm_cdr (l))
+ if (scm_is_true (scm_eqv_p (v, scm_car (l))))
+ return l;
+ return SCM_BOOL_F;
+}
+
Slice
int_list_to_slice (SCM l)
{
return s;
}
-/* Return I-th element, or last elt L. If I < 0, then we take the first
- element.
-
- PRE: length (L) > 0 */
-SCM
-robust_list_ref (int i, SCM l)
-{
- while (i-- > 0 && scm_is_pair (scm_cdr (l)))
- l = scm_cdr (l);
- return scm_car (l);
-}
-
Real
robust_scm2double (SCM k, double x)
{
return x;
}
-Direction
-robust_scm2dir (SCM d, Direction def)
+vector<Real>
+ly_scm2floatvector (SCM l)
{
- if (is_direction (d))
- def = to_dir (d);
- return def;
+ vector<Real> floats;
+ for (SCM s = l; scm_is_pair (s); s = scm_cdr (s))
+ floats.push_back (robust_scm2double (scm_car (s), 0.0));
+ return floats;
}
-Interval
-robust_scm2interval (SCM k, Drul_array<Real> v)
+SCM
+ly_floatvector2scm (vector<Real> v)
{
- Interval i;
- i[LEFT] = v[LEFT];
- i[RIGHT] = v[RIGHT];
- if (is_number_pair (k))
- i = ly_scm2interval (k);
- return i;
+ SCM l = SCM_EOL;
+ SCM *tail = &l;
+ for (vsize i = 0; i < v.size (); i++)
+ {
+ *tail = scm_cons (scm_from_double (v[i]), SCM_EOL);
+ tail = SCM_CDRLOC (*tail);
+ }
+ return l;
}
-Drul_array<Real>
-robust_scm2drul (SCM k, Drul_array<Real> v)
+string
+robust_scm2string (SCM k, const string &s)
{
- if (is_number_pair (k))
- v = ly_scm2interval (k);
- return v;
+ if (scm_is_string (k))
+ return ly_scm2string (k);
+ return s;
}
-Drul_array<bool>
-robust_scm2booldrul (SCM k, Drul_array<bool> def)
+int
+robust_scm2int (SCM k, int o)
{
- if (scm_is_pair (k))
+ if (scm_is_integer (k))
+ o = scm_to_int (k);
+ return o;
+}
+
+vsize
+robust_scm2vsize (SCM k, vsize o)
+{
+ if (scm_is_integer (k))
{
- def[LEFT] = to_boolean (scm_car (k));
- def[RIGHT] = to_boolean (scm_cdr (k));
+ int i = scm_to_int (k);
+ if (i >= 0)
+ return (vsize) i;
}
- return def;
+ return o;
}
-Offset
-robust_scm2offset (SCM k, Offset o)
+SCM
+ly_rational2scm (Rational r)
{
- if (is_number_pair (k))
- o = ly_scm2offset (k);
- return o;
+ if (r.is_infinity ())
+ {
+ if (r > Rational (0))
+ return scm_inf ();
+
+ return scm_difference (scm_inf (), SCM_UNDEFINED);
+ }
+
+ return scm_divide (scm_from_int64 (r.numerator ()),
+ scm_from_int64 (r.denominator ()));
}
-int
-robust_scm2int (SCM k, int o)
+Rational
+ly_scm2rational (SCM r)
{
- if (scm_integer_p (k) == SCM_BOOL_T)
- o = scm_to_int (k);
- return o;
+ if (scm_is_true (scm_inf_p (r)))
+ {
+ if (scm_is_true (scm_positive_p (r)))
+ {
+ Rational r;
+ r.set_infinite (1);
+ return r;
+ }
+ else
+ {
+ Rational r;
+ r.set_infinite (-1);
+ return r;
+ }
+ }
+
+ return Rational (scm_to_int64 (scm_numerator (r)),
+ scm_to_int64 (scm_denominator (r)));
+}
+
+Rational
+robust_scm2rational (SCM n, Rational rat)
+{
+ if (ly_is_rational (n))
+ return ly_scm2rational (n);
+ else
+ return rat;
+}
+
+bool
+ly_is_rational (SCM n)
+{
+ return (scm_is_real (n)
+ && (scm_is_true (scm_exact_p (n))
+ || scm_is_true (scm_inf_p (n))));
}
SCM
return tab;
}
-bool
-alist_equal_p (SCM a, SCM b)
-{
- for (SCM s = a;
- scm_is_pair (s); s = scm_cdr (s))
- {
- SCM key = scm_caar (s);
- SCM val = scm_cdar (s);
- SCM l = scm_assoc (key, b);
-
- if (l == SCM_BOOL_F
- || !ly_is_equal (scm_cdr (l), val))
-
- return false;
- }
- return true;
-}
-
-SCM
-ly_alist_vals (SCM alist)
-{
- SCM x = SCM_EOL;
- for (SCM p = alist; scm_is_pair (p); p = scm_cdr (p))
- x = scm_cons (scm_cdar (p), x);
- return x;
-}
-
SCM
ly_hash2alist (SCM tab)
{
- SCM func = ly_lily_module_constant ("hash-table->alist");
- return scm_call_1 (func, tab);
+ return Lily::hash_table_to_alist (tab);
}
-int
-procedure_arity (SCM proc)
-{
- assert (ly_is_procedure (proc));
- SCM arity = scm_procedure_property (proc,
- ly_symbol2scm ("arity"));
-
- SCM fixed = scm_car (arity);
- return scm_to_int (fixed);
-}
+/*
+ C++ interfacing.
+ */
string
mangle_cxx_identifier (string cxx_id)
cxx_id = "ly:" + cxx_id;
}
if (cxx_id.substr (cxx_id.length () - 2) == "_p")
- cxx_id = cxx_id.replace (cxx_id.length () - 2, 1, "?");
+ cxx_id = cxx_id.replace (cxx_id.length () - 2, 2, "?");
else if (cxx_id.substr (cxx_id.length () - 2) == "_x")
- cxx_id = cxx_id.replace (cxx_id.length () - 2, 1, "!");
+ cxx_id = cxx_id.replace (cxx_id.length () - 2, 2, "!");
+
+ replace_all (&cxx_id, "_less?", "<?");
+ replace_all (&cxx_id, "_2_", "->");
+ replace_all (&cxx_id, "__", "::");
+ replace_all (&cxx_id, '_', '-');
- cxx_id = replace_all (cxx_id, '_', '-');
return cxx_id;
}
+SCM
+ly_string_array_to_scm (vector<string> a)
+{
+ SCM s = SCM_EOL;
+ for (vsize i = a.size (); i; i--)
+ s = scm_cons (ly_symbol2scm (a[i - 1].c_str ()), s);
+ return s;
+}
+
+/* SYMBOLS is a whitespace separated list. */
+SCM
+parse_symbol_list (char const *symbols)
+{
+ while (isspace (*symbols))
+ symbols++;
+ string s = symbols;
+ replace_all (&s, '\n', ' ');
+ replace_all (&s, '\t', ' ');
+ replace_all (&s, " ", " ");
+ return ly_string_array_to_scm (string_split (s, ' '));
+}
+
+/* GDB debugging. */
+struct ly_t_double_cell
+{
+ SCM a;
+ SCM b;
+ SCM c;
+ SCM d;
+};
+
+/* inserts at front, removing duplicates */
+SCM ly_assoc_prepend_x (SCM alist, SCM key, SCM val)
+{
+ return scm_acons (key, val, scm_assoc_remove_x (alist, key));
+}
+