diff options
Diffstat (limited to 'test')
| -rw-r--r-- | test/git/performance/test_utils.py | 94 | ||||
| -rw-r--r-- | test/git/test_fun.py | 70 | ||||
| -rw-r--r-- | test/git/test_index.py | 6 | ||||
| -rw-r--r-- | test/git/test_tree.py | 5 |
4 files changed, 174 insertions, 1 deletions
diff --git a/test/git/performance/test_utils.py b/test/git/performance/test_utils.py index 76adffec..16100f8b 100644 --- a/test/git/performance/test_utils.py +++ b/test/git/performance/test_utils.py @@ -57,3 +57,97 @@ class TestUtilPerformance(TestBigRepoR): na = ni * 3 print >> sys.stderr, "Accessed %s[x] %i times in %s s ( %f acc / s)" % (cls.__name__, na, elapsed, na / elapsed) # END for each sequence + + def test_instantiation(self): + ni = 100000 + max_num_items = 4 + for mni in range(max_num_items+1): + for cls in (tuple, list): + st = time() + for i in xrange(ni): + if mni == 0: + cls() + elif mni == 1: + cls((1,)) + elif mni == 2: + cls((1,2)) + elif mni == 3: + cls((1,2,3)) + elif mni == 4: + cls((1,2,3,4)) + else: + cls(x for x in xrange(mni)) + # END handle empty cls + # END for each item + elapsed = time() - st + print >> sys.stderr, "Created %i %ss of size %i in %f s ( %f inst / s)" % (ni, cls.__name__, mni, elapsed, ni / elapsed) + # END for each type + # END for each item count + + # tuple and tuple direct + st = time() + for i in xrange(ni): + t = (1,2,3,4) + # END for each item + elapsed = time() - st + print >> sys.stderr, "Created %i tuples (1,2,3,4) in %f s ( %f tuples / s)" % (ni, elapsed, ni / elapsed) + + st = time() + for i in xrange(ni): + t = tuple((1,2,3,4)) + # END for each item + elapsed = time() - st + print >> sys.stderr, "Created %i tuples tuple((1,2,3,4)) in %f s ( %f tuples / s)" % (ni, elapsed, ni / elapsed) + + def test_unpacking_vs_indexing(self): + ni = 1000000 + list_items = [1,2,3,4] + tuple_items = (1,2,3,4) + + for sequence in (list_items, tuple_items): + st = time() + for i in xrange(ni): + one, two, three, four = sequence + # END for eac iteration + elapsed = time() - st + print >> sys.stderr, "Unpacked %i %ss of size %i in %f s ( %f acc / s)" % (ni, type(sequence).__name__, len(sequence), elapsed, ni / elapsed) + + st = time() + for i in xrange(ni): + one, two, three, four = sequence[0], sequence[1], sequence[2], sequence[3] + # END for eac iteration + elapsed = time() - st + print >> sys.stderr, "Unpacked %i %ss of size %i individually in %f s ( %f acc / s)" % (ni, type(sequence).__name__, len(sequence), elapsed, ni / elapsed) + + st = time() + for i in xrange(ni): + one, two = sequence[0], sequence[1] + # END for eac iteration + elapsed = time() - st + print >> sys.stderr, "Unpacked %i %ss of size %i individually (2 of 4) in %f s ( %f acc / s)" % (ni, type(sequence).__name__, len(sequence), elapsed, ni / elapsed) + # END for each sequence + + def test_large_list_vs_iteration(self): + # what costs more: alloc/realloc of lists, or the cpu strain of iterators ? + def slow_iter(ni): + for i in xrange(ni): + yield i + # END slow iter - be closer to the real world + + # alloc doesn't play a role here it seems + for ni in (500, 1000, 10000, 20000, 40000): + st = time() + for i in list(xrange(ni)): + i + # END for each item + elapsed = time() - st + print >> sys.stderr, "Iterated %i items from list in %f s ( %f acc / s)" % (ni, elapsed, ni / elapsed) + + st = time() + for i in slow_iter(ni): + i + # END for each item + elapsed = time() - st + print >> sys.stderr, "Iterated %i items from iterator in %f s ( %f acc / s)" % (ni, elapsed, ni / elapsed) + # END for each number of iterations + diff --git a/test/git/test_fun.py b/test/git/test_fun.py new file mode 100644 index 00000000..ccf15c77 --- /dev/null +++ b/test/git/test_fun.py @@ -0,0 +1,70 @@ +from test.testlib import * +from git.objects.fun import ( + traverse_tree_recursive, + traverse_trees_recursive + ) + +from git.index.fun import ( + aggressive_tree_merge + ) + +class TestFun(TestBase): + + def test_aggressive_tree_merge(self): + # head tree with additions, removals and modification compared to its predecessor + HC = self.rorepo.commit("6c1faef799095f3990e9970bc2cb10aa0221cf9c") + H = HC.tree + B = HC.parents[0].tree + + # test new index from single tree + + def _assert_entries(self, entries, num_trees): + assert len(entries[0]) == num_trees + for entry in entries: + paths = set(e[2] for e in entry if e) + + # only one path per set of entries + assert len(paths) == 1 + # END verify entry + + def test_tree_traversal(self): + # low level tree tarversal + odb = self.rorepo.odb + H = self.rorepo.tree('29eb123beb1c55e5db4aa652d843adccbd09ae18') # head tree + M = self.rorepo.tree('e14e3f143e7260de9581aee27e5a9b2645db72de') # merge tree + B = self.rorepo.tree('f606937a7a21237c866efafcad33675e6539c103') # base tree + B_old = self.rorepo.tree('1f66cfbbce58b4b552b041707a12d437cc5f400a') # old base tree + + # two very different trees + entries = traverse_trees_recursive(odb, [B_old.sha, H.sha], '') + self._assert_entries(entries, 2) + + oentries = traverse_trees_recursive(odb, [H.sha, B_old.sha], '') + assert len(oentries) == len(entries) + self._assert_entries(oentries, 2) + + # single tree + is_no_tree = lambda i, d: i.type != 'tree' + entries = traverse_trees_recursive(odb, [B.sha], '') + assert len(entries) == len(list(B.traverse(predicate=is_no_tree))) + self._assert_entries(entries, 1) + + # two trees + entries = traverse_trees_recursive(odb, [B.sha, H.sha], '') + self._assert_entries(entries, 2) + + # tree trees + entries = traverse_trees_recursive(odb, [B.sha, H.sha, M.sha], '') + self._assert_entries(entries, 3) + + def test_tree_traversal_single(self): + max_count = 50 + count = 0 + odb = self.rorepo.odb + for commit in self.rorepo.commit("29eb123beb1c55e5db4aa652d843adccbd09ae18").traverse(): + if count >= max_count: + break + count += 1 + entries = traverse_tree_recursive(odb, commit.tree.sha, '') + assert entries + # END for each commit diff --git a/test/git/test_index.py b/test/git/test_index.py index d0063e89..ae754430 100644 --- a/test/git/test_index.py +++ b/test/git/test_index.py @@ -580,7 +580,7 @@ class TestIndex(TestBase): # write all trees and compare them # its important to have a few submodules in there too - max_count = 100 + max_count = 25 count = 0 for commit in rw_repo.head.commit.traverse(): if count >= max_count: @@ -593,3 +593,7 @@ class TestIndex(TestBase): assert index.write_tree() == orig_tree # END for each commit + def test_index_new(self): + self.fail("todo index new") + + diff --git a/test/git/test_tree.py b/test/git/test_tree.py index d983cb2f..a443bd97 100644 --- a/test/git/test_tree.py +++ b/test/git/test_tree.py @@ -7,6 +7,10 @@ import os from test.testlib import * from git import * +from git.objects.fun import ( + traverse_tree_recursive, + traverse_trees_recursive + ) from cStringIO import StringIO class TestTree(TestBase): @@ -136,3 +140,4 @@ class TestTree(TestBase): def test_repr(self): tree = Tree(self.rorepo, 'abc') assert_equal('<git.Tree "abc">', repr(tree)) + |