summaryrefslogtreecommitdiff
path: root/libraries/base/GHC/IO/Encoding/CodePage/API.hs
diff options
context:
space:
mode:
authorKavon Farvardin <kavon@farvard.in>2018-09-23 15:29:37 -0500
committerKavon Farvardin <kavon@farvard.in>2018-09-23 15:29:37 -0500
commit84c2ad99582391005b5e873198b15e9e9eb4f78d (patch)
treecaa8c2f2ec7e97fbb4977263c6817c9af5025cf4 /libraries/base/GHC/IO/Encoding/CodePage/API.hs
parent8ddb47cfcf5776e9a3c55fd37947c8a95e00fa12 (diff)
parente68b439fe5de61b9a2ca51af472185c62ccb8b46 (diff)
downloadhaskell-wip/T13904.tar.gz
update to current master againwip/T13904
Diffstat (limited to 'libraries/base/GHC/IO/Encoding/CodePage/API.hs')
-rw-r--r--libraries/base/GHC/IO/Encoding/CodePage/API.hs4
1 files changed, 2 insertions, 2 deletions
diff --git a/libraries/base/GHC/IO/Encoding/CodePage/API.hs b/libraries/base/GHC/IO/Encoding/CodePage/API.hs
index f1d9d93e8f..b31ebe96f5 100644
--- a/libraries/base/GHC/IO/Encoding/CodePage/API.hs
+++ b/libraries/base/GHC/IO/Encoding/CodePage/API.hs
@@ -285,7 +285,7 @@ cpEncode cp _max_char_size = \ibuf obuf -> do
return (why2, mbuf', obuf)
#else
case why2 of
- -- If we succesfully translate all of the UTF-16 buffer, we need to know why
+ -- If we successfully translate all of the UTF-16 buffer, we need to know why
-- we weren't able to get any more UTF-16 out of the UTF-32 buffer
InputUnderflow | isEmptyBuffer mbuf' -> return (why1, ibuf', obuf)
| otherwise -> errorWithoutStackTrace "cpEncode: impossible underflown UTF-16 buffer"
@@ -361,7 +361,7 @@ bSearch msg code ibuf mbuf target_to_elems = go
--
-- Luckily if we have InvalidSequence/OutputUnderflow and we do not appear to have reached
-- the target, what we should do is the same as normal because the fraction of ibuf that our
- -- first "code" coded succesfully must be invalid-sequence-free, and ibuf will always
+ -- first "code" coded successfully must be invalid-sequence-free, and ibuf will always
-- have been decoded as far as the first invalid sequence in it.
case bufferElems mbuf `compare` target_to_elems of
-- Coding n "from" chars from the input yields exactly as many "to" chars