Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | flattened test folder structure, didn't adjust any file content yet | Sebastian Thiel | 2010-11-21 | 1 | -251/+0 |
| | |||||
* | All tests adjusted to work with the changed internal sha representation | Sebastian Thiel | 2010-06-28 | 1 | -12/+13 |
| | |||||
* | aggressive_tree_merge: fixed incorrect handling of one branch, it was just ↵ | Sebastian Thiel | 2010-06-24 | 1 | -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 Thiel | 2010-06-23 | 1 | -5/+4 |
| | | | | including simple test, it may be simple as the methods it uses are throroughly tested | ||||
* | Added test for aggressive_tree_merge | Sebastian Thiel | 2010-06-23 | 1 | -5/+106 |
| | |||||
* | Implemented simple tree merging and a simple test, more elaborate testing is ↵ | Sebastian Thiel | 2010-06-23 | 1 | -7/+57 |
| | | | | in progress | ||||
* | Initial frame for implementing read_tree using pure python. As git-read-tree ↵ | Sebastian Thiel | 2010-06-22 | 1 | -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 |