summaryrefslogtreecommitdiff
path: root/test/git/test_fun.py
Commit message (Collapse)AuthorAgeFilesLines
* flattened test folder structure, didn't adjust any file content yetSebastian Thiel2010-11-211-251/+0
|
* All tests adjusted to work with the changed internal sha representationSebastian Thiel2010-06-281-12/+13
|
* aggressive_tree_merge: fixed incorrect handling of one branch, it was just ↵Sebastian Thiel2010-06-241-0/+30
| | | | | | not implemented causing incorrect merge results. Added test to cover this issue Diff: added NULL_BIN_SHA constant for completeness
* fixed critical bug in traverse_trees_recursive, implemented IndexFile.new ↵Sebastian Thiel2010-06-231-5/+4
| | | | including simple test, it may be simple as the methods it uses are throroughly tested
* Added test for aggressive_tree_mergeSebastian Thiel2010-06-231-5/+106
|
* Implemented simple tree merging and a simple test, more elaborate testing is ↵Sebastian Thiel2010-06-231-7/+57
| | | | in progress
* Initial frame for implementing read_tree using pure python. As git-read-tree ↵Sebastian Thiel2010-06-221-0/+70
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