Wiz Aus wrote:
Even if it did use pre-compiled scheme, because lilypond supports compiling scores that contain Scheme code, it would still require effectively interpretive processing, which is not doubt a large reason for it's less-than-blinding-fast operation.
The problem is not so much in the Scheme execution, because the real work is done in C++ routines. The problem is rather that data structures are completely dynamic, so reading and writing a variable isn't reading and writing memory, but rather walking linked lists or lookups in hashtables. IIRC, I benchmarked Rosegarden (which is completely written in C++), to be only 3 to 5 times faster than LilyPond, which is not that much when you realize how much more LilyPond does.
Anyway, I think this this all besides the point, unless someone comes up with a constructive idea how to improve the situation.
-- Han-Wen Nienhuys - [EMAIL PROTECTED] - http://www.xs4all.nl/~hanwen _______________________________________________ bug-lilypond mailing list [email protected] http://lists.gnu.org/mailman/listinfo/bug-lilypond
