Great video, it was interesting that the binary search example only really works with pure functions since you must specify all of the initial state for the debugger/visualiser.
In non-pure functions (and oo) the user is unlikely to be able to specify valid values for all the mutable state even if the application could tell them which variables were being referenced. In clojure something like this might not be too difficult, perhaps we could: - define a temporary function with the same text - use CDT or another debugger to set a break-point in the temporary function - call the function and capture the current stack frame variables at each invocation & display as in the video Support for higher order functions and list comprehension (map, reduce, for, etc.) may be difficult though. -- 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
