On Aug 24, 7:48 pm, ataggart <alex.tagg...@gmail.com> wrote: > Thanks for focusing solely on one example, and still not providing any > useful, specific information.
You asked - "Do I really need to perform the itemCheck math ops in the binary-tree test" - and if you can't see the answer from simply looking at the other programs and the program output, then you need more hand-holding than I'm going to provide. Will it really make a big difference when I add the indefinite article to what it already says in the description? "Each program should ... - walk the tree nodes, checksum node items (and maybe deallocate the node)" > There may be a number of possible implementations for a given design > criterion. The binary-tree "memory allocation/deallocation" test (for > example) includes not only that, but also math ops, in a particular > fashion, a particular style of looping, with particular string > concatenation, and particular places for printing to stdout, etc. Yes. > From what I can infer, the criterion being tested is how well can > clojure code perform when it's written just like the imperative > version in, say, C++. Nonsense. You could as easily say - the criterion being tested is how well can clojure code perform when it's written just like the functional version in, say Clean or Haskell? > I had been assuming this was a serious comparison various languages > performance in achieving a particular design goal. After so many people have contributed programs for binary-trees in so many languages, I had been assuming it was kind-of easy. > Time to move on to something productive. > > On Aug 24, 11:17 am, Isaac Gouy <igo...@yahoo.com> wrote:> On Aug 24, > 9:50 am, ataggart <alex.tagg...@gmail.com> wrote: > > > > It would have been more useful to answer the question (particularly > > > with regards to a canonical implementation) than getting all passive- > > > aggressive. > > > 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? > > > > 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
