monotone-commits-diffs
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Monotone-commits-diffs] Revision 8daba1446c86e0326f9d95b92c9b9e20783362


From: monotone
Subject: [Monotone-commits-diffs] Revision 8daba1446c86e0326f9d95b92c9b9e2078336255
Date: Sat, 17 May 2008 21:43:01 +0200

-----------------------------------------------------------------
Revision: 8daba1446c86e0326f9d95b92c9b9e2078336255
Ancestor: 837c241776dc255c52c38b742094bf17fbd981b3
Author: address@hidden
Date: 2008-05-17T15:40:29
Branch: net.venge.monotone.guitone.trials.graph_display

Modified files:
        guitone.pro res/forms/changeset_browser.ui
        src/model/Certs.cpp src/model/Certs.h
        src/model/ChangesetModel.cpp src/model/ChangesetModel.h
        src/model/Graph.cpp src/model/Graph.h
        src/view/MainWindow.cpp
        src/view/dialogs/ChangesetBrowser.cpp
        src/view/dialogs/ChangesetBrowser.h

ChangeLog: 

Temporary (not working state) of the asciik-like graph display -
need to rethink the algorithm again and base the node processing on
toposorted output rather than pure parent-child relationships (which makes
creating the graph impossible if we need to connect certain nodes to others
which already have been processed long ago). Any next version should
  * be closely based on asciik.{h,cpp} of the mtn repo
  * skip the unique enum stuff which defines states by something more
    smarter, like "incoming states" and "outgoing states", each one again
    for incoming / outgoing left or right-handed nodes (otherwise this
    would be, again, simply reflect the parent <-> child relationships)

Attachment: txtTHFd6xvlEt.txt
Description: Diff [837c241776dc255c52c38b742094bf17fbd981b3] -> [8daba1446c86e0326f9d95b92c9b9e2078336255]


reply via email to

[Prev in Thread] Current Thread [Next in Thread]