index.write_tree: now uses MemoryDB, making tree handling more efficient as IO will only be done when required. A possible disadvantage though is that time is spent on compressing the trees, although only the raw data and their shas would theoretically be needed. On the other hand, compressing their data uses less memory. An optimal implementation would just sha the data, check for existance, and compress it to write it to the database right away. This would mean more specialized code though, introducing redundancy. If IStreams would know whether they contain compressed or uncompressed data, and if there was a method to get a sha from data, this would work nicely in the existing framework though

1 files changed, 6 insertions, 1 deletions

diff --git a/test/git/test_index.py b/test/git/test_index.py
index cd005c1d..d0063e89 100644
--- a/test/git/test_index.py
+++ b/test/git/test_index.py
@@ -6,7 +6,6 @@
 
 from test.testlib import *
 from git import *
-from git.index.util import TemporaryFileSwap
 import inspect
 import os
 import sys
@@ -580,7 +579,13 @@ class TestIndex(TestBase):
 		# END git cmd write tree
 		
 		# write all trees and compare them
+		# its important to have a few submodules in there too
+		max_count = 100
+		count = 0
 		for commit in rw_repo.head.commit.traverse():
+			if count >= max_count:
+				break
+			count += 1
 			index = rw_repo.index.reset(commit)
 			orig_tree = commit.tree
 			new_git_tree = write_tree(index)