> > (defn construct-atom > "translates a number n into an set of letters of size n" > [construct length] > (if (< (count construct) length) > (recur (conj construct (char (+ (rand-int amino_acids) 65))) length) > construct)) > > recur will goto the nearest enclosing loop or fn. > > Rich >
Ah. I was looking for something like that. The Fibonacci example on the 'special forms' website does use both a fn and a loop, which was somewhat confusing. Perhaps an example without loop would indeed help. Thanks! --~--~---------~--~----~------------~-------~--~----~ 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 To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/clojure?hl=en -~----------~----~----~----~------~----~------~--~---
