Op donderdag 23-04-2009 om 07:19 uur [tijdzone +0200], schreef Werner
LEMBERG:
> I'm not a good lisp programmer, but isn't the standard method for
> searching like that to not use a loop but recursive calls?
I don't really care about that, but it would be nice to split-out
the (find-brace lambda to a generic function.
That is, instead of having a comment like this
;; binary search based on y-extent of brace stencil
with a specific binary-search algorithm implemented for
finding a brace, it would be nice to have something like
;; one binary-search to rule/find them all
(define (binary-search min max getter target-value)
...)
(find-brace (binary-search 0 575 get-y-from-brace size)
Jan.
--
Jan Nieuwenhuizen <jann...@gnu.org> | GNU LilyPond - The music typesetter
http://www.xs4all.nl/~jantien | http://www.lilypond.org
_______________________________________________
lilypond-devel mailing list
lilypond-devel@gnu.org
http://lists.gnu.org/mailman/listinfo/lilypond-devel
