aboutsummaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
authorRicardo Fernández Serrata <[email protected]>2022-07-22 02:46:57 -0400
committerJack O'Connor <[email protected]>2022-07-28 14:14:39 -0700
commit0fb6410c90fb7d5638c9b6fbd88c1631449a4b7b (patch)
treee910502e30e1341be5d05a0218e750a94b532f19 /src
parent09df11731e9762315698653da13c2dfcf56b82bc (diff)
Fix doc typo
Diffstat (limited to 'src')
-rw-r--r--src/lib.rs2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/lib.rs b/src/lib.rs
index 9fc71ae..b3621c1 100644
--- a/src/lib.rs
+++ b/src/lib.rs
@@ -659,7 +659,7 @@ fn compress_parents_parallel(
// The wide helper function returns (writes out) an array of chaining values
// and returns the length of that array. The number of chaining values returned
-// is the dyanmically detected SIMD degree, at most MAX_SIMD_DEGREE. Or fewer,
+// is the dynamically detected SIMD degree, at most MAX_SIMD_DEGREE. Or fewer,
// if the input is shorter than that many chunks. The reason for maintaining a
// wide array of chaining values going back up the tree, is to allow the
// implementation to hash as many parents in parallel as possible.