~~~
2. How does it work, then?
The basic idea (as of version 0.3) is:
* Only compare files if they're of equal size.
* Compare a few random bytes before checksumming large files.
* Compare checksums before actual contents.
* Don't compare actual contents unless explicitly asked.
~~~
no, ja neumim tak dobre anglicky, ale tohle mi nepripada jako /autorem prezentovane/ tupe porovnavani kazdeho souboru s kazdym. ale celkem solidni optimalizace hledani a eliminace zbytecnych testu...
No, ten algoritmus ma slozitost O(n^2), takze to neni nic moc. Ja jsem nerekl, ze je to tupe, to ne. Ale aby si to zaslouzilo vetsi chvalu, tak by to muselo pocitat aspon se slozitosti O(n).