| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| |
|
|
|
|
|
| |
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
|
| |
|
|
| |
fast, while staying compatible with serialization which requires it to be sorted
|
| |
|
|
|
|
|
| |
according to a simple test
( presort still needs implementation )
submodule: added stub to allow the tree to return something, its not implemented though
|
| | |
|
| |
|
|
| |
allowing the keys to contain slashes; adjusted test to check for this
|
| |
|
|
| |
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\!
|
| |
|
|
|
|
| |
object
repo.tree: improved to be less restricting
|
| |
|
|
|
|
| |
previously it would just be a name )
added abspath property and name property to provide easy access to most common paths of an index object
|
| |
|
|
| |
as sha, even if the passed in id was a ref. This is done to assure objects are uniquely identified and will compare correctly
|
| |
|
|
| |
both, pruning and preventing to return items
|
| |
|
|
|
|
| |
persistent commands that require stdin AND binary data - not even an adapter would help here. These tests will have to be replaced.
test_commit: Improved efficiency of traversal test
|
| |
|
|
| |
Removed tests that were testing that method
|
| |
|
|
|
|
| |
dict as cache is a problem as the tree is ordered, added blobs, trees and traverse method
repo: remove blob function as blobs are created directly or iterated - primitve types should not clutter the repo interface
|
| |
|
|
| |
_list_from_string to indicate their new status as private method, adjusted all callers respectively
|
| |
|
|
| |
mode is now generally an int compatible to the stat module
|
| |
|
|
| |
whether it bakes more. This also leads to more efficient use of memory as values are only cached and set when required - the baking system does not require an own tracking variable anymore, and values are only to be cached once - then python will natively find the cache without involving any additional overhead. This works by using __getattr__ instead of __get_attribute__ which would always be called
|
| |
|
|
| |
editor to work with the files properly. Can convert it back for releaes
|
| |
|
|
| |
it would make existing code incompatible in some places
|
| | |
|
| | |
|
| |
|
|
|
| |
doesn't need to do the same boring replacing I did.
(cherry picked from commit 10c62aa69193a8bc7b46ca24c2ad1d5008489665)
|
| |
|
|
|
| |
The imported module is called git (as in "import git"), so it's less
confusing to do so than to call everything GitPython.something.
|
| |
|
|
| |
It doesn't use an object's private contents, so let's go...
|
| |
|
|
|
| |
It is rather intuitive to consider trees as a dict of objects (like
a directory could be seen as a dict of files).
|
| |
|
|
|
|
|
| |
It seems more natural to use a dictionnary for directories, since we
usually want to access them by name, and entry order is not relevant.
Also, finding a particular blob given its name is O(1) instead of O(N).
|
| | |
|
| | |
|
| |
|
|
| |
up tests so they pass except for stderr test. Modified version information retrieval.
|
| |
|
|
| |
Repo.create alias.
|
| | |
|
| | |
|
| |
|
