aboutsummaryrefslogtreecommitdiff
path: root/test/git/performance/test_utils.py
AgeCommit message (Collapse)Author
2010-07-14Added performance test to compare inst.__class__() vs type(inst)() class. ↵Sebastian Thiel
The first one is faster, although I would have expected the latter one to be faster
2010-06-22Initial 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-04Fixed implementation after design change to deal with it - all tests run, ↵Sebastian Thiel
but next there will have to be more through testing
2010-06-03commit.create_from_tree now uses pure python implementation, fixed message ↵Sebastian Thiel
parsing which truncated newlines although it was ilegitimate. Its up to the reader to truncate therse, nowhere in the git code I could find anyone adding newlines to commits where it is written Added performance tests for serialization, it does about 5k commits per second if writing to tmpfs
2010-06-03odb: implemented loose object streaming, which is impossible to do ↵Sebastian Thiel
efficiently considering that it copies string buffers all the time