From 2d736d9c50057e6d1f33c175e126590816c54251 Mon Sep 17 00:00:00 2001
From: Dimitri Papadopoulos
<3234522+DimitriPapadopoulos@users.noreply.github.com>
Date: Wed, 5 Jun 2024 19:41:43 +0200
Subject: [PATCH] Fix new typos found by codespell
---
doc/zstd_manual.html | 2 +-
lib/compress/zstd_lazy.c | 6 +++---
lib/zstd.h | 2 +-
tests/zstreamtest.c | 2 +-
4 files changed, 6 insertions(+), 6 deletions(-)
diff --git a/doc/zstd_manual.html b/doc/zstd_manual.html
index bc4a2403648..56bfbcd81c0 100644
--- a/doc/zstd_manual.html
+++ b/doc/zstd_manual.html
@@ -298,7 +298,7 @@ Decompression context
When decompressing many times,
* Special: value 0 means "use default strategy". */
ZSTD_c_targetCBlockSize=130, /* v1.5.6+
- * Attempts to fit compressed block size into approximatively targetCBlockSize.
+ * Attempts to fit compressed block size into approximately targetCBlockSize.
* Bound by ZSTD_TARGETCBLOCKSIZE_MIN and ZSTD_TARGETCBLOCKSIZE_MAX.
* Note that it's not a guarantee, just a convergence target (default:0).
* No target when targetCBlockSize == 0.
diff --git a/lib/compress/zstd_lazy.c b/lib/compress/zstd_lazy.c
index 9efaf4b25d0..cfbadf458f7 100644
--- a/lib/compress/zstd_lazy.c
+++ b/lib/compress/zstd_lazy.c
@@ -1123,9 +1123,9 @@ ZSTD_row_getMatchMask(const BYTE* const tagRow, const BYTE tag, const U32 headGr
/* The high-level approach of the SIMD row based match finder is as follows:
* - Figure out where to insert the new entry:
- * - Generate a hash for current input posistion and split it into a one byte of tag and `rowHashLog` bits of index.
- * - The hash is salted by a value that changes on every contex reset, so when the same table is used
- * we will avoid collisions that would otherwise slow us down by intorducing phantom matches.
+ * - Generate a hash for current input position and split it into a one byte of tag and `rowHashLog` bits of index.
+ * - The hash is salted by a value that changes on every context reset, so when the same table is used
+ * we will avoid collisions that would otherwise slow us down by introducing phantom matches.
* - The hashTable is effectively split into groups or "rows" of 15 or 31 entries of U32, and the index determines
* which row to insert into.
* - Determine the correct position within the row to insert the entry into. Each row of 15 or 31 can
diff --git a/lib/zstd.h b/lib/zstd.h
index ce2b1c7ded3..3a88c74d1d7 100644
--- a/lib/zstd.h
+++ b/lib/zstd.h
@@ -395,7 +395,7 @@ typedef enum {
* Special: value 0 means "use default strategy". */
ZSTD_c_targetCBlockSize=130, /* v1.5.6+
- * Attempts to fit compressed block size into approximatively targetCBlockSize.
+ * Attempts to fit compressed block size into approximately targetCBlockSize.
* Bound by ZSTD_TARGETCBLOCKSIZE_MIN and ZSTD_TARGETCBLOCKSIZE_MAX.
* Note that it's not a guarantee, just a convergence target (default:0).
* No target when targetCBlockSize == 0.
diff --git a/tests/zstreamtest.c b/tests/zstreamtest.c
index e4110eb2111..8625b4a2373 100644
--- a/tests/zstreamtest.c
+++ b/tests/zstreamtest.c
@@ -2478,7 +2478,7 @@ static int basicUnitTests(U32 seed, double compressibility, int bigTests)
DISPLAYLEVEL(3, "test%3i : Test single-shot fallback for magicless mode: ", testNb++);
{
- // Aquire resources
+ // Acquire resources
size_t const srcSize = COMPRESSIBLE_NOISE_LENGTH;
void* src = malloc(srcSize);
size_t const dstSize = ZSTD_compressBound(srcSize);