#
# patch "ChangeLog"
# from [e3ddf1aa6bd44fc6ed2063f94650089f4f372505]
# to [4a298c72a930e4ceb42a4b3b9c5ca4a0370a09f0]
#
# patch "commands.cc"
# from [62c049c1ae2101efcdb9d5081f1756a39fbb67b2]
# to [ef1e40d44efaad6efcf5ecef916b1d1488a3228a]
#
========================================================================
--- ChangeLog e3ddf1aa6bd44fc6ed2063f94650089f4f372505
+++ ChangeLog 4a298c72a930e4ceb42a4b3b9c5ca4a0370a09f0
@@ -1,5 +1,9 @@
2005-08-13 Nathaniel Smith
+ * commands.cc (agraph): Remove.
+
+2005-08-13 Nathaniel Smith
+
* tests/t_commit_log_writeback.at: New test.
* testsuite.at: Add it.
========================================================================
--- commands.cc 62c049c1ae2101efcdb9d5081f1756a39fbb67b2
+++ commands.cc ef1e40d44efaad6efcf5ecef916b1d1488a3228a
@@ -2816,68 +2816,6 @@
}
-CMD(agraph, "debug", "", "dump ancestry graph to stdout in VCG format",
- OPT_NONE)
-{
- set nodes;
- multimap branches;
-
- std::multimap edges_mmap;
- set > edges;
-
- app.db.get_revision_ancestry(edges_mmap);
-
- // convert from a weak lexicographic order to a strong one
- for (std::multimap::const_iterator i = edges_mmap.begin();
- i != edges_mmap.end(); ++i)
- edges.insert(std::make_pair(i->first, i->second));
-
- for (set >::const_iterator i = edges.begin();
- i != edges.end(); ++i)
- {
- nodes.insert(i->first);
- nodes.insert(i->second);
- }
-
- vector< revision > certs;
- app.db.get_revision_certs(branch_cert_name, certs);
- for(vector< revision >::iterator i = certs.begin();
- i != certs.end(); ++i)
- {
- cert_value tv;
- decode_base64(i->inner().value, tv);
- revision_id tmp(i->inner().ident);
- nodes.insert(tmp); // in case no edges were connected
- branches.insert(make_pair(tmp, tv()));
- }
-
-
- cout << "graph: " << endl << "{" << endl; // open graph
- for (set::iterator i = nodes.begin(); i != nodes.end();
- ++i)
- {
- cout << "node: { title : \"" << *i << "\"\n"
- << " label : \"\\fb" << *i;
- pair::const_iterator,
- multimap::const_iterator> pair =
- branches.equal_range(*i);
- for (multimap::const_iterator j = pair.first;
- j != pair.second; ++j)
- {
- cout << "\\n\\fn" << j->second;
- }
- cout << "\"}" << endl;
- }
- for (set >::iterator i = edges.begin(); i != edges.end();
- ++i)
- {
- cout << "edge: { sourcename : \"" << i->first << "\"" << endl
- << " targetname : \"" << i->second << "\" }" << endl;
- }
- cout << "}" << endl << endl; // close graph
-}
-
-
static void
write_file_targets(change_set const & cs,
update_merge_provider & merger,