dependencies that were not removed.
I understand that a 100% bullet proof solution might be really hard to do.
But I was wondering, is there any tools that allows to do these tasks for
common cases?
Regards
Bertrand Dechoux
--
You received this message because you are subscribed to the Google
dependencies, but you must have
graphviz installed. I don't know of a similar tool that only creates text
dependency output.
Andy
[1] https://github.com/jonase/eastwood
[2] https://github.com/timmc/nephila
On Mon, Jul 28, 2014 at 4:58 AM, Bertrand Dechoux dech...@gmail.com
javascript
as the persist mechanism.
On Thursday, July 10, 2014 4:26:33 AM UTC-4, Bertrand Dechoux wrote:
Hi,
I have various general questions about how one can perform simple and
flexible graph query/update.
If we start by a structure being nested maps then I know about
get-in/update-in/assoc-in. The common
Hi,
I have various general questions about how one can perform simple and
flexible graph query/update.
If we start by a structure being nested maps then I know about
get-in/update-in/assoc-in. The common point about these functions is that
they all take a path to where the data is in the
*@*Thomas Heller: It's a bit cleaner indeed. That way, a 'join-like'
operation does not need to know about the structure. But the three
problematics from my post are still unsolved.
*@Francois Rey:* I believe walk/prewalk/postwalk (and zipper?) might be the
building blocks for implementing
It's only a reformulation of Ulises comment but I would say:
1) abstract away how the data is accessed
2) introduce change one function at a time by swapping the past accessor
with the new accessor (really it is like a getter/setter)
3) if you have final consumer(s) you might need to introduce a
