It would have been more useful to answer the question (particularly with regards to a canonical implementation) than getting all passive- aggressive.
On Aug 24, 5:55 am, Isaac Gouy <igo...@yahoo.com> wrote: > On Aug 23, 7:07 pm, ataggart <alex.tagg...@gmail.com> wrote: > > > It's never been clear to me exactly what the code is supposed to be > > do. For example, the "spec" for the binary-tree test is so wholly > > lacking in any details that I'm left to infer that one is supposed to > > copy an implementation used previously, though without any indication > > as to which is the canonical version. Do I really need to perform the > > itemCheck math ops in the binary-tree test which is ostensibly about > > allocating/deallocating memory? Who knows? > > Some people complain - underspecified - and some people complain - > overspecified - and some people just contribute programs. > > Some people complain - forced to write code that isn't idiomatic - as > if there was a canonical version. (Did you find any programs that > didn't perform itemCheck?) > > In Clojure does one integer addition and one integer subtraction per > node take a significant amount of time? Who knows? (I guess you could > measure with/without.) -- 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
