aboutsummaryrefslogtreecommitdiff
path: root/test/git/test_fun.py
AgeCommit message (Collapse)Author
2010-11-21flattened test folder structure, didn't adjust any file content yetSebastian Thiel
2010-06-28All tests adjusted to work with the changed internal sha representationSebastian Thiel
2010-06-24aggressive_tree_merge: fixed incorrect handling of one branch, it was just ↵Sebastian Thiel
not implemented causing incorrect merge results. Added test to cover this issue Diff: added NULL_BIN_SHA constant for completeness
2010-06-23fixed critical bug in traverse_trees_recursive, implemented IndexFile.new ↵Sebastian Thiel
including simple test, it may be simple as the methods it uses are throroughly tested
2010-06-23Added test for aggressive_tree_mergeSebastian Thiel
2010-06-23Implemented simple tree merging and a simple test, more elaborate testing is ↵Sebastian Thiel
in progress
2010-06-22Initial frame for implementing read_tree using pure python. As git-read-tree ↵Sebastian Thiel
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