GitPython - Forked from https://github.com/gitpython-developers/GitPython

Age	Commit message (Collapse)	Author
2010-06-23	fixed critical bug in traverse_trees_recursive, implemented IndexFile.new ↵	Sebastian Thiel
	including simple test, it may be simple as the methods it uses are throroughly tested
2010-06-22	Initial frame for implementing read_tree using pure python. As git-read-tree ↵	Sebastian Thiel
	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
2010-06-22	index.write_tree: now uses MemoryDB, making tree handling more efficient as ↵	Sebastian Thiel
	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
2010-06-22	Tree-Writing now works after fixing an off-by-one error	Sebastian Thiel

2010-06-22	index.write_tree: initial version implemented, although its not yet working ↵	Sebastian Thiel
	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
2010-06-21	index: put serialization methods into new 'fun' module, this makes the calls ↵	Sebastian Thiel
	faster as it removes one level of indirection, and makes the main file smaller, improving maintainability
2010-06-21	index.add does not need the git clt anymore	Sebastian Thiel

2010-06-21	index: Entries are now using flags internally, instead of reducing the flag ↵	Sebastian Thiel
	information to just the stage ( just to be closer to the git-original )
2010-06-21	index.add: now uses gitdb.store functionality instead of git-hash-file. The ↵	Sebastian Thiel
	python version is about as fast, but could support multithreading using async
2010-06-15	Move LazyMixin type to gitdb, index reading now uses file_contents_ro from ↵	Sebastian Thiel
	gitdb as well
2010-06-15	Reimplemented Lock handling to be conforming to the git lock protocol, which ↵	Sebastian Thiel
	is actually more efficient than the previous implementation Index now locks its file for reading, and properly uses LockedFD when writing
2010-06-14	Implemented the serializable interface - by refactoring code	Sebastian Thiel

2010-06-14	index: split index file into multiple files of a single package. This didn't ↵	Sebastian Thiel
	reduce the file size as much as I would have liked, but certainly is a start for further 'outsourcing'