Fix new typos found by codespell

diff --git a/doc/zstd_compression_format.md b/doc/zstd_compression_format.md
index 78279ce71a195e046aff63c3b1f18e33386b48c9..a2bf20cbc7620e82dae6bd93f55ad348b2f9144f 100644 (file)
--- a/doc/zstd_compression_format.md
+++ b/doc/zstd_compression_format.md
@@ -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.
 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`),
 it is followed by a 2-bits repeat flag.

diff --git a/lib/compress/hist.h b/lib/compress/hist.h
index e6e39d34890aa99373777e6d4cebdfceee5fb60d..bea2a9ebff1325e47e19d5e93f794f6e87715c20 100644 (file)
--- a/lib/compress/hist.h
+++ b/lib/compress/hist.h
@@ -75,7 +75,7 @@ unsigned HIST_count_simple(unsigned* count, unsigned* maxSymbolValuePtr,
                            const void* src, size_t srcSize);
 
 /*! 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).
  @  This function does not need any additional stack memory.
  */