Re: Repair move is slow and could be more intelligent

Stefan Küng wrote:
> We only keep one list of items, not several (reduces memory use). So we
> can only sort one list (the whole list).

Just go through the list once and bubble all n visible elements to the
top, then only sort the first n elements of the list.

As long as the other elements aren't visible it doesn't matter how
randomly they're ordered...

-- 
Kurt Bernhard Pruenner --- Haendelstrasse 17 --- 4020 Linz --- Austria
.......It might be written "Mindfuck", but it's spelt "L-A-I-N".......
np: nix
------------------------------------------------------
http://tortoisesvn.tigris.org/ds/viewMessage.do?dsForumId=4061&dsMessageId=1881608
To unsubscribe from this discussion, e-mail: [users-unsubscribe_at_tortoisesvn.tigris.org].