lib/zstd
1
0
Fork 0
mirror of https://github.com/facebook/zstd.git synced 2025-07-29 11:21:22 +03:00
Code Activity

Fix new typos found by codespell

Browse Source
This commit is contained in:
Dimitri Papadopoulos
2024-11-26 11:15:39 +01:00
parent 1958fff050
commit fcf88ae39b
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
doc/zstd_compression_format.md
View File

@ -1120,7 +1120,7 @@ For the purpose of counting total allocated probability points, it counts as one
Symbols probabilities are read one by one, in order. Symbols probabilities are read one by one, in order.
After each probability is decoded, the total nb of probability points is updated. After each probability is decoded, the total nb of probability points is updated.
This is used to dermine how many bits must be read to decode the probability of next symbol. This is used to determine how many bits must be read to decode the probability of next symbol.
When a symbol has a __probability__ of `zero` (decoded from reading a Value `1`), When a symbol has a __probability__ of `zero` (decoded from reading a Value `1`),
it is followed by a 2-bits repeat flag. it is followed by a 2-bits repeat flag.

2
lib/compress/hist.h
View File

@ -75,7 +75,7 @@ unsigned HIST_count_simple(unsigned* count, unsigned* maxSymbolValuePtr,
const void* src, size_t srcSize); const void* src, size_t srcSize);
/*! HIST_add() : /*! HIST_add() :
* Lowest level: just add nb of occurences of characters from @src into @count. * Lowest level: just add nb of occurrences of characters from @src into @count.
* @count is not reset. @count array is presumed large enough (i.e. 1 KB). * @count is not reset. @count array is presumed large enough (i.e. 1 KB).
@ This function does not need any additional stack memory. @ This function does not need any additional stack memory.
*/ */