Mercurial > hg > easyhg
changeset 49:f9b53c10a3f6
* A fix that will only work when we sort changesets by date (test with classical-rdf)
author | Chris Cannam |
---|---|
date | Wed, 10 Nov 2010 22:27:58 +0000 |
parents | 996b3c4037ef |
children | c76782c14371 |
files | grapher.cpp |
diffstat | 1 files changed, 16 insertions(+), 0 deletions(-) [+] |
line wrap: on
line diff
--- a/grapher.cpp Wed Nov 10 22:07:03 2010 +0000 +++ b/grapher.cpp Wed Nov 10 22:27:58 2010 +0000 @@ -165,6 +165,22 @@ m_handled.insert(id); int nchildren = cs->children().size(); + + // look for merging children and make sure nobody + // is going to overwrite their "merge lines" + foreach (QString childId, cs->children()) { + if (!m_changesets.contains(childId)) continue; + Changeset *child = m_changesets[childId]; + if (child->parents().size() > 1) { + int childRow = m_items[childId]->row(); + std::cerr << "I'm at " << row << ", child with >1 parents is at " << childRow << std::endl; + for (int r = row; r >= childRow; --r) { + std::cerr << "setting row " << r << ", col " << col << std::endl; + m_alloc[r].insert(col); + } + } + } + if (nchildren > 1) { // Normally the children will lay out themselves. We just // want to handle the case where exactly two children have the