| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2010-06-22 | Initial 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 | |||
| 2010-06-22 | index.write_tree: initial version implemented, although its not yet working ↵ | Sebastian Thiel | |
| correctly, a test to explicitly compare the git version with the python implementation is still missing Tree and Index internally use 20 byte shas, converting them only as needed to reduce memory footprint and processing time objects: started own 'fun' module containing the most important tree functions, more are likely to be added soon | |||
