| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
| |
|
|
|
|
| |
manages its dependencies
|
|
|
|
| |
usable. It showed that the ConfigParser needs some work. If the root is set, it also needs to refer to the root_commit instead of to the root-tree, as it will have to decide whether it works on the working tree's version of the .gitmodules file or the one in the repository
|
|
|
|
|
|
| |
passed in
test_odb: added more information to the message output
|
|
|
|
| |
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
|
|
|
|
| |
using a / in a hardcoded fashion, leading to absolute paths where the caller expected relative ones
|
|
|
|
| |
The first one is faster, although I would have expected the latter one to be faster
|
|
|
|
| |
python 2.4, as the pure python implementation cannot work without memory maps
|
|
|
|
| |
different keywords for distutils and setuptools, the latter one doesn't read the ones of the first one, unfortunately
|
|
|
|
| |
thanks to new gitdb functionality
|
|
|
|
| |
its still rather slow and many tests are not yet implemented
|
| |
|
|
|
|
| |
previously due to import errors and a somewhat inconsistent working tree that occurred when switching branches ...
|
|
|
|
| |
them. Incremeneted version to 0.3.0 beta1
|
| |
|
|
|
|
|
|
|
| |
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
|
|
|
|
| |
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
|
|
|
|
|
|
| |
not implemented causing incorrect merge results. Added test to cover this issue
Diff: added NULL_BIN_SHA constant for completeness
|
|
|
|
| |
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
|
|
|
|
| |
repo: now has the option to use the pure python git database implementation, which is currently not used though
|
|
|
|
| |
Previously it was located in gitdb, which doesn't have any facilities to use the git command
|
|
|
|
| |
gitdb as well
|
| |
|
|
|
|
|
|
| |
is actually more efficient than the previous implementation
Index now locks its file for reading, and properly uses LockedFD when writing
|
|
|
|
|
|
|
| |
according to a simple test
( presort still needs implementation )
submodule: added stub to allow the tree to return something, its not implemented though
|
|
was added instead
Adjusted all imports to deal with the changed package names
|