summaryrefslogtreecommitdiff
path: root/lib/git/index
Commit message (Collapse)AuthorAgeFilesLines
* Adjusted previous object creators to use the rev_parse method directly. ↵Sebastian Thiel2010-07-071-1/+1
| | | | rev_parse could be adjusted not to return Objects anymore, providing better performance for those who just want a sha only. On the other hand, the method is high-level and should be convenient to use as well, its a starting point for more usually, hence its unlikely to call it in tight loops
* Made repo.py a package to allow better localization of functions and ↵Sebastian Thiel2010-07-061-1/+1
| | | | utilities - the repo module got rather large
* Renamed modules utils to util, and errors to exc to be more conforming to ↵Sebastian Thiel2010-06-292-5/+5
| | | | the submodules's naming conventions
* Updated and fixed sphinx API docs, which included one quick skim-throughSebastian Thiel2010-06-293-19/+25
|
* Diff: fixed bug that caused a string to end up as a blob modeSebastian Thiel2010-06-291-1/+1
|
* Adjusted all files to (hopefully) deal with the fact that all objects now ↵Sebastian Thiel2010-06-253-74/+50
| | | | | | | 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
* index.reset is now partly implemented using python, but in fact it resorts ↵Sebastian Thiel2010-06-251-20/+34
| | | | to using git-read-tree to keep the stat information when merging one tree in. After all this is what needed to be implemented in python as well
* IndexFile.add: writing of the index file can now optionally be turned off. ↵Sebastian Thiel2010-06-241-6/+12
| | | | The default is to write the physical index, which is the behaviour you would expect
* aggressive_tree_merge: fixed incorrect handling of one branch, it was just ↵Sebastian Thiel2010-06-242-5/+11
| | | | | | not implemented causing incorrect merge results. Added test to cover this issue Diff: added NULL_BIN_SHA constant for completeness
* Multiple partly critical bugfixes related to index handlingSebastian Thiel2010-06-242-8/+33
|
* fixed critical bug in traverse_trees_recursive, implemented IndexFile.new ↵Sebastian Thiel2010-06-232-10/+18
| | | | including simple test, it may be simple as the methods it uses are throroughly tested
* Added test for aggressive_tree_mergeSebastian Thiel2010-06-232-64/+68
|
* Implemented simple tree merging and a simple test, more elaborate testing is ↵Sebastian Thiel2010-06-231-8/+78
| | | | in progress
* Initial frame for implementing read_tree using pure python. As git-read-tree ↵Sebastian Thiel2010-06-222-7/+46
| | | | | | | 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: now uses MemoryDB, making tree handling more efficient as ↵Sebastian Thiel2010-06-221-3/+7
| | | | IO will only be done when required. A possible disadvantage though is that time is spent on compressing the trees, although only the raw data and their shas would theoretically be needed. On the other hand, compressing their data uses less memory. An optimal implementation would just sha the data, check for existance, and compress it to write it to the database right away. This would mean more specialized code though, introducing redundancy. If IStreams would know whether they contain compressed or uncompressed data, and if there was a method to get a sha from data, this would work nicely in the existing framework though
* Tree-Writing now works after fixing an off-by-one errorSebastian Thiel2010-06-222-12/+13
|
* index.write_tree: initial version implemented, although its not yet working ↵Sebastian Thiel2010-06-223-53/+117
| | | | | | | 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
* index: put serialization methods into new 'fun' module, this makes the calls ↵Sebastian Thiel2010-06-212-137/+183
| | | | faster as it removes one level of indirection, and makes the main file smaller, improving maintainability
* index.add does not need the git clt anymoreSebastian Thiel2010-06-212-24/+9
|
* index: Entries are now using flags internally, instead of reducing the flag ↵Sebastian Thiel2010-06-213-59/+82
| | | | information to just the stage ( just to be closer to the git-original )
* index.add: now uses gitdb.store functionality instead of git-hash-file. The ↵Sebastian Thiel2010-06-211-44/+46
| | | | python version is about as fast, but could support multithreading using async
* Move LazyMixin type to gitdb, index reading now uses file_contents_ro from ↵Sebastian Thiel2010-06-151-8/+4
| | | | gitdb as well
* Reimplemented Lock handling to be conforming to the git lock protocol, which ↵Sebastian Thiel2010-06-151-15/+11
| | | | | | is actually more efficient than the previous implementation Index now locks its file for reading, and properly uses LockedFD when writing
* Implemented the serializable interface - by refactoring codeSebastian Thiel2010-06-141-32/+47
|
* index: split index file into multiple files of a single package. This didn't ↵Sebastian Thiel2010-06-144-0/+1414
reduce the file size as much as I would have liked, but certainly is a start for further 'outsourcing'
View Lorry Controller Status