Rev 4396: Remove the time_graph.py tool, it has served its purpose. in http://bazaar.launchpad.net/~jameinel/bzr/1.16-better_heads

[John Arbash Meinel]

At http://bazaar.launchpad.net/~jameinel/bzr/1.16-better_heads

------------------------------------------------------------
revno: 4396
revision-id: john at arbash-meinel.com-20090611162226-0r7sa3k0wbe0hfy9
parent: john at arbash-meinel.com-20090611042857-d9ug6gtlo867ibn2
committer: John Arbash Meinel <john at arbash-meinel.com>
branch nick: 1.16-better_heads
timestamp: Thu 2009-06-11 11:22:26 -0500
message:
  Remove the time_graph.py tool, it has served its purpose.
-------------- next part --------------
=== removed file 'tools/time_graph.py'
--- a/tools/time_graph.py	2009-06-10 19:56:16 +0000
+++ b/tools/time_graph.py	1970-01-01 00:00:00 +0000
@@ -1,97 +0,0 @@
-#!/usr/bin/env python
-import random
-import os
-import time
-import sys
-import optparse
-from bzrlib import (
-    branch,
-    commands,
-    graph,
-    ui,
-    trace,
-    _known_graph_py,
-    _known_graph_pyx,
-    )
-from bzrlib.ui import text
-
-p = optparse.OptionParser()
-p.add_option('--max-combinations', default=500, type=int)
-p.add_option('--lsprof', default=None, type=str)
-opts, args = p.parse_args(sys.argv[1:])
-trace.enable_default_logging()
-ui.ui_factory = text.TextUIFactory()
-
-if len(args) >= 1:
-    b = branch.Branch.open(args[0])
-else:
-    b = branch.Branch.open('.')
-b.lock_read()
-try:
-    g = b.repository.get_graph()
-    parent_map = dict(p for p in g.iter_ancestry([b.last_revision()])
-                         if p[1] is not None)
-finally:
-    b.unlock()
-
-print 'Found %d nodes' % (len(parent_map),)
-
-def all_heads_comp(g, combinations):
-    h = []
-    pb = ui.ui_factory.nested_progress_bar()
-    try:
-        for idx, combo in enumerate(combinations):
-            if idx & 0x1f == 0:
-                pb.update('proc', idx, len(combinations))
-            h.append(g.heads(combo))
-    finally:
-        pb.finished()
-    return h
-combinations = []
-# parents = parent_map.keys()
-# for p1 in parents:
-#     for p2 in random.sample(parents, 10):
-#         combinations.append((p1, p2))
-# Times for random sampling of 10x1150 of bzrtools
-#   Graph        KnownGraph
-#   96.1s   vs   25.7s  :)
-# Times for 500 'merge parents' from bzr.dev
-#   25.6s   vs   45.0s  :(
-
-for revision_id, parent_ids in parent_map.iteritems():
-    if parent_ids is not None and len(parent_ids) > 1:
-        combinations.append(parent_ids)
-if opts.max_combinations > 0 and len(combinations) > opts.max_combinations:
-    combinations = random.sample(combinations, opts.max_combinations)
-
-print '      %d combinations' % (len(combinations),)
-t1 = time.clock()
-known_g = _known_graph_py.KnownGraph(parent_map)
-if opts.lsprof is not None:
-    h_known = commands.apply_lsprofiled(opts.lsprof,
-        all_heads_comp, known_g, combinations)
-else:
-    h_known = all_heads_comp(known_g, combinations)
-t2 = time.clock()
-print "Known: %.3fs" % (t2-t1,)
-print "  %s" % (graph._counters,)
-t1 = time.clock()
-known_g = _known_graph_pyx.KnownGraph(parent_map)
-if opts.lsprof is not None:
-    h_known = commands.apply_lsprofiled(opts.lsprof,
-        all_heads_comp, known_g, combinations)
-else:
-    h_known = all_heads_comp(known_g, combinations)
-t2 = time.clock()
-print "Known (pyx): %.3fs" % (t2-t1,)
-print "  %s" % (graph._counters,)
-simple_g = graph.Graph(graph.DictParentsProvider(parent_map))
-graph._counters[1] = 0
-graph._counters[2] = 0
-h_simple = all_heads_comp(simple_g, combinations)
-t3 = time.clock()
-print "Orig: %.3fs" % (t3-t2,)
-print "  %s" % (graph._counters,)
-if h_simple != h_known:
-    import pdb; pdb.set_trace()
-print 'ratio: %.3fs' % ((t2-t1) / (t3-t2))