diff options
| author | Sebastian Thiel <byronimo@gmail.com> | 2010-06-22 21:23:47 +0200 |
|---|---|---|
| committer | Sebastian Thiel <byronimo@gmail.com> | 2010-06-22 21:23:47 +0200 |
| commit | be97c4558992a437cde235aafc7ae2bd6df84ac8 (patch) | |
| tree | 3e44a7c38e356817ca81721725709d7374f95012 /test/git/test_tree.py | |
| parent | 778234d544b3f58dd415aaf10679d15b01a5281f (diff) | |
| download | gitpython-be97c4558992a437cde235aafc7ae2bd6df84ac8.tar.gz | |
Initial frame for implementing read_tree using pure python. As git-read-tree can do much more than we can ( and faster assumably ), the .new method is used to create new index instances from up to 3 trees.
Implemented multi-tree traversal to facilitate building a stage list more efficiently ( although I am not sure whether it could be faster to use a dictionary together with some intensive lookup ), including test
Added performance to learn how fast certain operations are, and whether one should be preferred over another
Diffstat (limited to 'test/git/test_tree.py')
| -rw-r--r-- | test/git/test_tree.py | 5 |
1 files changed, 5 insertions, 0 deletions
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)) + |