##// END OF EJS Templates
lazymanifest: use a binary search to do an insertion...
lazymanifest: use a binary search to do an insertion This makes insertions log(n) plus some memmove() overhead, rather than doing an append followed by an n*log(n) sort. There's probably a lot of performance to be gained by adding a batch-add method, which could be smarter about the memmove()s performed. Includes a couple of extra tests that should help prevent bugs. Thanks to Martin for some significant pre-mail cleanup of this change.
Augie Fackler -
r24228:542c8912 default
Show More
Name Size Modified Last Commit Author
/ hgext / convert
__init__.py Loading ...
bzr.py Loading ...
common.py Loading ...
convcmd.py Loading ...
cvs.py Loading ...
cvsps.py Loading ...
darcs.py Loading ...
filemap.py Loading ...
git.py Loading ...
gnuarch.py Loading ...
hg.py Loading ...
monotone.py Loading ...
p4.py Loading ...
subversion.py Loading ...
transport.py Loading ...