On Jan 14, 7:29 pm, Timothy Pratley <timothyprat...@gmail.com> wrote: > To give me a > head-start, are there key differences with clojure.contrib.dataflow so > I can better understand?
Thank you for your interest. I have not extensively used c.c.dataflow, so I apologize if I misrepresent it, but here are some key differences: 1. c.c.dataflow feels imperative in nature. build-dataflow returns a ref. Functions which manipulate these refs — such as update-values, add-cells, and remove-cells — use destructive modification. dgraph tries pretty hard to work functionally, just like Clojure's built-in persistent data structures. A dgraph is immutable, but supports an "extend" operation similar to assoc and conj. Extended dgraphs share structure with original dgraphs as much as possible. 2. c.c.dataflow does not seem to support lazily computed nodes. A node put in a dataflow computes itself immediately. dgraph supports this behavior with eager nodes, but has two other modes: lazy and patient. I tried to explain how those work in the README. Please let me know if the documentation makes no sense. I'll add a more detailed example to the source repository later today.
-- 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
