summaryrefslogtreecommitdiff
path: root/lib/git/objects/fun.py
Commit message (Collapse)AuthorAgeFilesLines
* moved all contents, incl. submodule gitdb, up to the root directorySebastian Thiel2010-11-211-199/+0
|
* unicode handling in messages and trees was improved. Messages are now ↵Sebastian Thiel2010-08-131-0/+7
| | | | written according to the encoding of the commit object, and decoded using that information as well. Trees will encode and decode their names with utf8
* Unicode: tree_to_stream can now handle unicode names the way git would do ↵Sebastian Thiel2010-07-151-0/+7
| | | | it. Its can be assumed though that there are more bugs related to unicode hanging around in the system
* Diff: fixed bug that caused a string to end up as a blob modeSebastian Thiel2010-06-291-1/+0
|
* Adjusted all files to (hopefully) deal with the fact that all objects now ↵Sebastian Thiel2010-06-251-3/+4
| | | | | | | use 20 byte sha's internally as it is closer to the GitDB implementation Switched all remaining files back to tabs Adjusted all remaining docstrings to suit the sphinx doc convention - its likely that there are many of docstring syntax errors though
* GitCmdStreamReader: fixed terrible bug which only kicked in if the stream ↵Sebastian Thiel2010-06-241-1/+2
| | | | | | was actually empty. This is a rare case that can happen during stream testing. Theoretically there shouldn't be any empty streams of course, but practically they do exist sometimes ;); fixed stream.seek implementation, which previously used seek on standard output Improved GitCmd error handling
* fixed critical bug in traverse_trees_recursive, implemented IndexFile.new ↵Sebastian Thiel2010-06-231-1/+1
| | | | including simple test, it may be simple as the methods it uses are throroughly tested
* Initial frame for implementing read_tree using pure python. As git-read-tree ↵Sebastian Thiel2010-06-221-0/+118
| | | | | | | 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
* index.write_tree: initial version implemented, although its not yet working ↵Sebastian Thiel2010-06-221-0/+66
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