diff options
| author | Brian Wignall <brianwignall@gmail.com> | 2019-12-19 09:11:42 -0500 |
|---|---|---|
| committer | Marge Bot <ben+marge-bot@smart-cactus.org> | 2020-01-04 15:55:06 -0500 |
| commit | 3c9dc06ba2034e867c9169e60e854539875654fd (patch) | |
| tree | f06e599ca380ee9ad599918b2ae4c78cd4afce2b /libraries/base/codepages/MakeTable.hs | |
| parent | b2e0323f318959c879629ef277f6433b44473c4b (diff) | |
| download | haskell-3c9dc06ba2034e867c9169e60e854539875654fd.tar.gz | |
Fix typos, via a Levenshtein-style corrector
Diffstat (limited to 'libraries/base/codepages/MakeTable.hs')
| -rw-r--r-- | libraries/base/codepages/MakeTable.hs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/libraries/base/codepages/MakeTable.hs b/libraries/base/codepages/MakeTable.hs index b276e4b1a0..0806e268eb 100644 --- a/libraries/base/codepages/MakeTable.hs +++ b/libraries/base/codepages/MakeTable.hs @@ -138,7 +138,7 @@ mkConvArray xs = "ConvArray \"" ++ concatMap mkHex xs ++ "\"#" -- -- Fix a block size S which is a power of two. We compress an array of N -- entries (where N>>S) as follows. First, split the array into blocks of size --- S, then remove all repeate blocks to form the "value" array. Then construct +-- S, then remove all repeated blocks to form the "value" array. Then construct -- a separate "index" array which maps the position of blocks in the old array -- to a position in the value array. -- |