Fix new typos found by codespell

This commit is contained in:
Dimitri Papadopoulos
2024-06-20 20:12:16 +02:00
parent 17b5315016
commit 2d736d9c50
4 changed files with 6 additions and 6 deletions
+1 -1
View File
@@ -298,7 +298,7 @@ size_t ZSTD_freeDCtx(ZSTD_DCtx* dctx); </b>/* accept NULL pointer */<b>
* Special: value 0 means "use default strategy". */ * Special: value 0 means "use default strategy". */
ZSTD_c_targetCBlockSize=130, </b>/* v1.5.6+<b> ZSTD_c_targetCBlockSize=130, </b>/* v1.5.6+<b>
* 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. * Bound by ZSTD_TARGETCBLOCKSIZE_MIN and ZSTD_TARGETCBLOCKSIZE_MAX.
* Note that it's not a guarantee, just a convergence target (default:0). * Note that it's not a guarantee, just a convergence target (default:0).
* No target when targetCBlockSize == 0. * No target when targetCBlockSize == 0.
+3 -3
View File
@@ -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: /* The high-level approach of the SIMD row based match finder is as follows:
* - Figure out where to insert the new entry: * - 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. * - 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 contex reset, so when the same table is used * - 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 intorducing phantom matches. * 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 * - 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. * which row to insert into.
* - Determine the correct position within the row to insert the entry into. Each row of 15 or 31 can * - Determine the correct position within the row to insert the entry into. Each row of 15 or 31 can
+1 -1
View File
@@ -395,7 +395,7 @@ typedef enum {
* Special: value 0 means "use default strategy". */ * Special: value 0 means "use default strategy". */
ZSTD_c_targetCBlockSize=130, /* v1.5.6+ 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. * Bound by ZSTD_TARGETCBLOCKSIZE_MIN and ZSTD_TARGETCBLOCKSIZE_MAX.
* Note that it's not a guarantee, just a convergence target (default:0). * Note that it's not a guarantee, just a convergence target (default:0).
* No target when targetCBlockSize == 0. * No target when targetCBlockSize == 0.
+1 -1
View File
@@ -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++); DISPLAYLEVEL(3, "test%3i : Test single-shot fallback for magicless mode: ", testNb++);
{ {
// Aquire resources // Acquire resources
size_t const srcSize = COMPRESSIBLE_NOISE_LENGTH; size_t const srcSize = COMPRESSIBLE_NOISE_LENGTH;
void* src = malloc(srcSize); void* src = malloc(srcSize);
size_t const dstSize = ZSTD_compressBound(srcSize); size_t const dstSize = ZSTD_compressBound(srcSize);