-
Committer:
Michael Vogt
-
Date:
2013-04-19 11:44:05 UTC
-
Revision ID:
michael.vogt@ubuntu.com-20130419114405-jx2tgf964h76tdkw
calculate the minimal paritions only once and apply them in a sorted order, the old algorithm was re-calculating after each cache.commit() which was rather slow