| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
|
|
|
| |
the submodules's naming conventions
|
| |
|
| |
|
|
|
|
|
|
|
| |
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
|
|
|
|
|
|
|
| |
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
|
|
|
|
| |
information to just the stage ( just to be closer to the git-original )
|
|
|
|
| |
fast, while staying compatible with serialization which requires it to be sorted
|
|
|
|
| |
information - this also speeds up later serialization after changes. its clear though that retrieving actual objects is slower currently as these are not cached anymore. Its worth thinking about moving these encoding, decoding routines to gitdb
|
|
|
|
|
|
|
| |
according to a simple test
( presort still needs implementation )
submodule: added stub to allow the tree to return something, its not implemented though
|
|
|
|
|
|
|
| |
performance is slightly better
git.cmd: added method to provide access to the content stream directly. This is more efficient if large objects are handled, if it is actually used
test.helpers: removed unnecessary code
|
|
|
|
|
|
|
| |
on lighthouse.
README/intro.rst: added information about the new repository at github
tree: added marker to indicate that submodules would have to be returned there
|
| |
|
|
|
|
| |
previous version was making assumptions that would only be true for old git repositories it sesms. The new version of the algorithm deals with this gracefully.
|
|
|
|
| |
allowing the keys to contain slashes; adjusted test to check for this
|
|
|
|
| |
method, improved code performance by disabling the visit-once flag by default for trees, which by nature are not recursive
|
|
|
|
| |
Fixed critical bug in object code: IndexObjects now use their path as hashkey, not the data\!
|
|
|
|
| |
including a test
|
|
|
|
|
|
|
| |
backslashes depending on the operating system
fixed test_refs and test_trees
Many more issues remain though, this is just a first backup commit
|
|
|
|
|
|
| |
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
|
|
|
|
| |
we dropped it
|
|
|
|
| |
both, pruning and preventing to return items
|
|
|
|
| |
diff module, which probably is the right thing to do anyway
|
|
|
|
| |
Diff class has been prepared to process raw input, but its not yet more than a frame
|
|
|
|
| |
safe possibly hundreds of command calls
|
|
|
|
|
|
|
| |
currently it cause hundreds of command invocations which is slow
Fixed issue with trees not properly initialized with their default mode
_set_cache_: some objects checked whether the attribute was within their __slots__ although it should have been accessed through its class
|
|
|
|
| |
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
|
|
|