I find myself using RapidCRC a lot for comparing files lately, either to check that some files are really the same, or for identifying duplicates. Obviously, this kind of use is a bit cumbersome because you have to create a hash file first and then move it to another folder or edit the paths before you can run the verification.
So I gave it some thought and came up with a proposal for a comparison mode that would make this kind of quick checks really simple. Here's a mock-up of what I had in mind:
We can implement this new mode as a tab; the rest of the interface works pretty much the same.
After the user loads the files ( they should be appended to whatever's already loaded, without clearing the list beforehand) and selects the hashing function, the checksums are calculated and the files grouped by checksum and sorted within the group by their full path. The groups are then ordered by their type:
groups without matching files (i.e., only one file with that checksum)
groups with matching files (two or more files with the same checksum)
one group with unprocessed files, for any files that were added to the list after the first run (after clicking the hash button again, they'll obviously be incorporated into the other two groups)
The program DupeKill (https://cresstone.com/apps/DupeKill/) has functionality similar to what you're describing here. Not to say that it wouldn't make sense in RapidCRC, but maybe that's a workaround.
I find myself using RapidCRC a lot for comparing files lately, either to check that some files are really the same, or for identifying duplicates. Obviously, this kind of use is a bit cumbersome because you have to create a hash file first and then move it to another folder or edit the paths before you can run the verification.
So I gave it some thought and came up with a proposal for a comparison mode that would make this kind of quick checks really simple. Here's a mock-up of what I had in mind:
We can implement this new mode as a tab; the rest of the interface works pretty much the same.
After the user loads the files ( they should be appended to whatever's already loaded, without clearing the list beforehand) and selects the hashing function, the checksums are calculated and the files grouped by checksum and sorted within the group by their full path. The groups are then ordered by their type:
Thoughts?