I'm often using FindOnClick to find duplicates between an existing folder ("source") and a new one ("incoming"). Works well, but my source folder is 200 GB large, for about 40000 files, so scanning takes quite a while.
I would suggest a cache file for the MD5 hashes and if the user wants to search that particular folder leave him 2 options:
1. rescan (removes existing cache)
2. use cache (skips files whose MD5 hash is already in the cache with the same datestamp. Only scan changed and new files)
This could make the function often much faster. In my case a search using the cache could result in scanning, say, 50 files instead of 40000.
Let me know what you think.
DeleteOnClick, EncryptOnClick, FindOnClick, HashOnClick, PatchOnClick, ScrambleOnClick, UndeleteOnClick
1 post • Page 1 of 1