On Jan 18, 2:14 am, mac wrote:
> Updating stuff in the map became a little bit of a hassle so I made
> versions of assoc-in and update-in that work on dgraphs. Here they are
> in case anyone else is interested:
>
> (defn assoc-node
> [dgraph m ks v]
> (dgraph m (assoc-in (dgraph m) ks v)))
>
>
Using the clojars repo from leiningen works fine for me, just using
[dgraph "1.0.0"].
I've done most of my little swing app I needed to get done and dgraph
has been very pleasant.
However I found myself wanting to put a map in the graph because I had
a function for updating the gui that depended on
On Jan 17, 4:05 am, Albert Cardona wrote:
> The link gives a "not found"--did you push?
I did, but then I moved the examples directory around to make
everything more Leiningen-layout-friendly. Here is the updated link:
http://github.com/gcv/dgraph/blob/master/examples/examples/dgraph/swing.clj
P
>> Do you have examples of where you see it interesting to use (and not
>> abuse :-) ) side effects in combination with eager/patient ?
>
> I just checked in a Swing usage example which uses side effects to
> update the UI (http://github.com/gcv/dgraph/blob/master/src/examples/
> dgraph/swing.clj).
On Jan 16, 4:01 am, mac wrote:
> I am just now in a situation where I have to do some swing programming
> and this seems like it has great potential!
> Since it's already version 1.0 you should put it on Clojars so that it
> is easier to use from leiningen or maven etc.
Good call. I just put it u
On Jan 15, 5:59 am, Laurent PETIT wrote:
> I would like to know, is there an essential reason for not having
> stored the dependency graph as a hidden property of the graph ?
I'm not sure I understand your question. You can see the stored graph
if you take the function returned by dg/make-dgraph
On Jan 14, 7:29 pm, Timothy Pratley 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
differenc
2010/1/15 Constantine Vetoshev :
> I would like to announce the release of dgraph 1.0, a dependency graph
> implementation for Clojure.
>
> http://github.com/gcv/dgraph
>
> dgraph provides a mostly pure functional data structure whose nodes
> behave like cells in a spreadsheet. Data changes in stor
Hi Constantine,
Very interesting! I'll definitely be trying this out. To give me a
head-start, are there key differences with clojure.contrib.dataflow so
I can better understand?
Regards,
Tim.
2010/1/15 Constantine Vetoshev :
> I would like to announce the release of dgraph 1.0, a dependency g
I would like to announce the release of dgraph 1.0, a dependency graph
implementation for Clojure.
http://github.com/gcv/dgraph
dgraph provides a mostly pure functional data structure whose nodes
behave like cells in a spreadsheet. Data changes in stored nodes cause
their dependent computed nodes
10 matches
Mail list logo
