moved some functions around in preperation for refactor
Sped up periodic updates at an overhead cost to hasher

The speed for getting new sorted data from uniquity during runtime
has a speed increase from O(n) to O(k), where n is all duplicate
files and k are requested duplicate files by largest filesize.

The hasher takes a performance hit for doing periodic sorting.

It might be worth it to move the sorting onto a new worker thread,
so the hasher doesn't suffer. This would also ensure cleaner code.