xfarrow/dircomp
1
0
Fork 0
mirror of https://github.com/xfarrow/dircomp.git synced 2025-02-16 12:00:42 +01:00
Code Issues Packages Projects Releases Wiki Activity

Updated FAQ (markdown)

xfarrow 2023-05-15 09:31:40 +00:00
parent 20bdeb8c8f
commit 6c8d553c35
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
FAQ.md

@ -2,6 +2,6 @@
When checking whether two files are equal or not, by default dircomp compares their content (in bytes). By enabling option `-d` dircomp compares the SHA-1 hash of the files.
As anyone can guess, a direct comparison is faster than computing an hash (which requires the files to be fully read anyways) plus comparing the result of said hash, so why creating this functionality in the first place?
* If one wants to be extra sure of the correctness of the output of this program, they may execute a comparison by digest too;
* If one wants to be extra sure of the correctness of the output of this program, they may execute two different comparisons. This can be understandable since this program is not wide-spread so there might occur edge cases the developer has never considerated;
* I'd like to implement more functionalities which require a digest computation. I already had the knowledge to compute the SHA-1 of a file so I decided to insert the relative functions in the source.
* Perhaps one could be interested in obtaining the hash of the files that are being processed? This is not supported, but they'd be few lines away from obtaining what they need.
* Perhaps one could be interested in obtaining the hash of the files that are being processed. This is not supported, but they'd be few lines away from obtaining what they need.