Hi, On Oct 14, 9:45 am, Garth Sheldon-Coulson <g...@mit.edu> wrote:
> (In this parser I also have a non-stack-blowing version of the parser for > deep data structures, which you Meikel suggested a couple weeks/months ago, Huh? I did? > Is bound-fn less efficient because it has to make a full copy of all > dynamically bound variables on each call? Don't nail me down on the details, but it creates a map containing all dynamically bound variables. On every call on the boundfn this map is installed and afterwards removed. So there is some overhead involved. Another possible approach is to return specialised functions. Something like (def my-parser (make-parser options go here)), which would get you a special function which does what you specified: (parse stuff). No options involved anymore. >From your description it's still not obvious what your options actually influence. Could give some simple example of one of the low- level functions where the behaviour of the parser is changed via an option? Sincerely Meikel --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en -~----------~----~----~----~------~----~------~--~---
