From 1ce8099896a44dcb54bd764d9bbd9eaf661a3179 Mon Sep 17 00:00:00 2001 From: wangcundashang Date: Wed, 19 Jun 2024 11:28:19 +0800 Subject: [PATCH] chore: fix some comments Signed-off-by: wangcundashang --- c/blake3.c | 2 +- c/blake3_neon.c | 2 +- src/lib.rs | 2 +- 3 files changed, 3 insertions(+), 3 deletions(-) diff --git a/c/blake3.c b/c/blake3.c index 0bed24261..9becead0a 100644 --- a/c/blake3.c +++ b/c/blake3.c @@ -428,7 +428,7 @@ INLINE void hasher_merge_cv_stack(blake3_hasher *self, uint64_t total_len) { // of the whole tree, and it would need to be ROOT finalized. We can't // compress it until we know. // 2) This 64 KiB input might complete a larger tree, whose root node is -// similarly going to be the the root of the whole tree. For example, maybe +// similarly going to be the root of the whole tree. For example, maybe // we have 196 KiB (that is, 128 + 64) hashed so far. We can't compress the // node at the root of the 256 KiB subtree until we know how to finalize it. // diff --git a/c/blake3_neon.c b/c/blake3_neon.c index 90bdd572c..53ce83c3b 100644 --- a/c/blake3_neon.c +++ b/c/blake3_neon.c @@ -34,7 +34,7 @@ INLINE uint32x4_t set4(uint32_t a, uint32_t b, uint32_t c, uint32_t d) { } INLINE uint32x4_t rot16_128(uint32x4_t x) { - // The straightfoward implementation would be two shifts and an or, but that's + // The straightforward implementation would be two shifts and an or, but that's // slower on microarchitectures we've tested. See // https://github.com/BLAKE3-team/BLAKE3/pull/319. // return vorrq_u32(vshrq_n_u32(x, 16), vshlq_n_u32(x, 32 - 16)); diff --git a/src/lib.rs b/src/lib.rs index d661cb2db..d64e18fce 100644 --- a/src/lib.rs +++ b/src/lib.rs @@ -1090,7 +1090,7 @@ impl Hasher { // the root node of the whole tree, and it would need to be ROOT // finalized. We can't compress it until we know. // 2) This 64 KiB input might complete a larger tree, whose root node is - // similarly going to be the the root of the whole tree. For example, + // similarly going to be the root of the whole tree. For example, // maybe we have 196 KiB (that is, 128 + 64) hashed so far. We can't // compress the node at the root of the 256 KiB subtree until we know // how to finalize it.