| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
|
|
|
| |
the ORIG_HEAD reference as well
|
|
|
|
| |
has better testing for the use of paths during reset. The IndexFile now implements this on its own, which also allows for something equivalent to git-reset --hard -- <paths>, which is not possible in the git command for some probably very good reason
|
|
|
|
|
|
| |
instead of the existing and valid. The rest of the ConfigParser handling is correct, as it reads all configuration files available to git
see http://github.com/Byron/GitPython/issues#issue/1
|
|
|
|
| |
Fixed test which used the --force flag on move, but there is only a short version (left) it appears
|
|
|
|
| |
using a / in a hardcoded fashion, leading to absolute paths where the caller expected relative ones
|
| |
|
|
|
|
| |
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
|
|
|
|
| |
The default is to write the physical index, which is the behaviour you would expect
|
| |
|
|
|
|
| |
including simple test, it may be simple as the methods it uses are throroughly tested
|
|
|
|
|
|
|
| |
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
|
|
|
|
| |
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
|
| |
|
|
|
|
|
|
|
| |
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
|
|
|
|
| |
faster as it removes one level of indirection, and makes the main file smaller, improving maintainability
|
|
|
|
| |
python version is about as fast, but could support multithreading using async
|
|
|
|
| |
Cmd: AutoInterrupt handles boundary cases more gracefully as it can be that the os module suddenly becomes None if the interpreter is going down
|
|
|
|
|
|
|
| |
different path in the index than the actual one on disk ( from which the object will be created )
Fixed bug the way newlines were handled, which hopefully fixes occasional hangs as well. It works fine with git 1.7.1
Most of the changes are due to the tab-space conversion - its weird once more as I thought it was all in spaces before ... .
|
| |
|
|
|
|
| |
test.helpers: temporary rw repository creators now set the working dir of the program, easing working with relative paths a lot
|
|
|
|
| |
failure as well, one per failed file
|
|
|
|
| |
safer to use in case of bare repositories
|
|
|
|
| |
index easier
|
|
|
|
| |
allowing the callee to know more about its environment
|
|
|
|
| |
Fixed critical bug in object code: IndexObjects now use their path as hashkey, not the data\!
|
|
|
|
| |
any of our changes entries as it would in fact write a possibly cached tree stored in our extension data.It was solved by simply ignoring that extension data when writing the index for tree creation. A test was added for this as well
|
|
|
|
| |
index.write_tree may now use the missing_ok argument which writes trees faster and allows you to operate without objects to do a true index based merge
|
|
|
|
|
|
| |
exact information about the successfully checked out files as well as the failed ones
Return value of the method is an iterator to all checked out files
|
|
|
|
| |
have not been updated as they where modified locally or did not exist. Test was improved to check for this new case.
|
| |
|
|
|
|
|
|
| |
just in time
This adds a dependency to a git update index fix - and I hope it will be put in in time ( including windows version )
|
|
|
|
|
|
| |
symlinks.
Added index.get_entries_key method to allow direct access to anyone willing to do so
|
|
|
|
| |
adjustment, but it works as expected even on systems that do not support symlinks
|
|
|
|
| |
binary files went crazy as well as binary writing
|
|
|
|
| |
as sha, even if the passed in id was a ref. This is done to assure objects are uniquely identified and will compare correctly
|
|
|
|
| |
remote: prepared FetchInfo class to be returned by fetch and pull. About to implement tests
|
|
|
|
| |
index.checkout: added simple method allowing to checkout files from the index, including simple test
|
|
|
|
| |
change the head to the given commit, which makes the methods more versatile
|
|
|
|
| |
required to have a nice API. Tests are not yet fully done either
|
| |
|
| |
|
| |
|
|
|
|
| |
files, not on streams, as Indices are not streamed by any git command ( at least not in raw format )
|
| |
|
|
|
|
|
|
|
| |
other items as well as the working tree
Diff.Diffable: added callback allowing superclasses to preprocess diff arguments
Diff.Diff: added eq, ne and hash methods, string methods would be nice
|
|
|
|
| |
fashion comparable to the native implementation
|
|
|
|
| |
given. It will lazily read its data on first access
|
|
|
|
| |
appropriate
|
|
|
|
| |
way to add files to the index/remove them and make commits which are possibly customized with custom parents
|