You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Given that the algorithm will only ever subdivide groups and the generated hashes are never used outside fastdupes, there's no harm in seek()ing past the first HEAD_SIZE bytes when doing the final full-content comparison and it might provide a tiny bit of speed-up in some situations.
More importantly, for files HEAD_SIZE or smaller, it means that we should be able to skip the final pass completely if the internal data structures preserve the file size read by the first pass, which eliminates the overhead of at least one syscall.
The text was updated successfully, but these errors were encountered:
Given that the algorithm will only ever subdivide groups and the generated hashes are never used outside fastdupes, there's no harm in
seek()
ing past the firstHEAD_SIZE
bytes when doing the final full-content comparison and it might provide a tiny bit of speed-up in some situations.More importantly, for files
HEAD_SIZE
or smaller, it means that we should be able to skip the final pass completely if the internal data structures preserve the file size read by the first pass, which eliminates the overhead of at least one syscall.The text was updated successfully, but these errors were encountered: