On Sun, Feb 21, 2010 at 08:38:35AM +0200, Tero Tilus wrote:
> W. Trevor King, 2010-02-18 13:49:
> > Since email can have multiple parents [1], why does everyone make
> > threads trees rather than directed, acyclic graphs (DAGs)?
> > ...
> > On an implementation level, I've got the above graph browser going
> > in python/curses, so it should be easy to port to ruby/curses.
>
> Have a pointer to code?
>
> I would love to see sup being able to do something usefull with
> multiple parent messages.
I got some good feedback from Nicolas Pouillard on the Python tidbit I
posted, but after waiting optimisticly for some enterprising Rubist to
port it to Ruby and merge it into Sup, I've finally taught myself
enough Ruby to do it myself ;). Here's DAG-supporting Sup (+ a few
glaring documentation updates)
http://www.physics.drexel.edu/~wking/code/git/git.php?p=sup.git
I haven't done any benchmarking vs the tree-threading code, but if it
turns out to be too slow, we can always use:
if @graph_thread
...general...code...
else
...old...tree...code...
end
for bottleneck methods.
We could also resurect the old indentation-style display in the thread
viewer, if people dislike my tig-style ascii graph.
Cheers,
Trevor
--
This email may be signed or encrypted with GPG (http://www.gnupg.org).
The GPG signature (if present) will be attached as 'signature.asc'.
For more information, see http://en.wikipedia.org/wiki/Pretty_Good_Privacy
My public key is at http://www.physics.drexel.edu/~wking/pubkey.txt
Attachment:
pgp58kzwKBY0E.pgp
Description: PGP signature
_______________________________________________ Sup-devel mailing list Sup-devel@rubyforge.org http://rubyforge.org/mailman/listinfo/sup-devel