aboutsummaryrefslogtreecommitdiff
path: root/README.markdown
diff options
context:
space:
mode:
authorTom Ryder <tom@sanctum.geek.nz>2017-08-10 23:01:17 +1200
committerTom Ryder <tom@sanctum.geek.nz>2017-08-10 23:01:17 +1200
commitc3ec4eee2757b890d91768b3ece61e974ef29697 (patch)
treebfa18c7be4a807893f0aeaec085505b99078ae1c /README.markdown
parentAdd a correction and note (diff)
downloadcheckem-c3ec4eee2757b890d91768b3ece61e974ef29697.tar.gz
checkem-c3ec4eee2757b890d91768b3ece61e974ef29697.zip
More README tweaks
Diffstat (limited to 'README.markdown')
-rw-r--r--README.markdown12
1 files changed, 5 insertions, 7 deletions
diff --git a/README.markdown b/README.markdown
index 887f18b..ecae6fc 100644
--- a/README.markdown
+++ b/README.markdown
@@ -65,17 +65,15 @@ a tiny bit faster:
$ CHECKEM_ALG=SHA-1 checkem /dir
-Realistically, this is almost certainly splitting hairs.
+Realistically, though, this is almost certainly splitting hairs.
Theoretically, you could read only the first *n* bytes of each hash-needing
file and hash those with some suitable inexpensive function *f*, and just
compare those before resorting to checking the entire file with a safe hash
-function *g*.
-
-You'd need to decide on suitable values for *n*, *f*, and *g* in such a case;
-it might be useful for very large sets of files that will almost certainly
-differ in the first *n* bytes. If there's interest in this at all, I'll write
-it in as optional behaviour.
+function *g*. You'd need to decide on suitable values for *n*, *f*, and *g* in
+such a case; it might be useful for very large sets of files that will almost
+certainly differ in the first *n* bytes. If there's interest in this at all,
+I'll write it in as optional behaviour.
Contributors
------------