module Codec.Binary.Base16
( EncIncData(..)
, EncIncRes(..)
, encodeInc
, encode
, DecIncData(..)
, DecIncRes(..)
, decodeInc
, decode
, chop
, unchop
) where
import Codec.Binary.Util
import Control.Monad
import Data.Array
import Data.Bits
import Data.Maybe
import Data.Word
import qualified Data.Map as M
_encMap :: [(Word8, Char)]
_encMap =
[ (Word8
0, Char
'0'), (Word8
1, Char
'1'), (Word8
2, Char
'2'), (Word8
3, Char
'3'), (Word8
4, Char
'4')
, (Word8
5, Char
'5'), (Word8
6, Char
'6'), (Word8
7, Char
'7'), (Word8
8, Char
'8'), (Word8
9, Char
'9')
, (Word8
10, Char
'A'), (Word8
11, Char
'B'), (Word8
12, Char
'C'), (Word8
13, Char
'D'), (Word8
14, Char
'E')
, (Word8
15, Char
'F') ]
encodeArray :: Array Word8 Char
encodeArray :: Array Word8 Char
encodeArray = forall i e. Ix i => (i, i) -> [(i, e)] -> Array i e
array (Word8
0, Word8
64) [(Word8, Char)]
_encMap
decodeMap :: M.Map Char Word8
decodeMap :: Map Char Word8
decodeMap = forall k a. Ord k => [(k, a)] -> Map k a
M.fromList [(forall a b. (a, b) -> b
snd (Word8, Char)
i, forall a b. (a, b) -> a
fst (Word8, Char)
i) | (Word8, Char)
i <- [(Word8, Char)]
_encMap]
encodeInc :: EncIncData -> EncIncRes String
encodeInc :: EncIncData -> EncIncRes String
encodeInc EncIncData
EDone = forall i. i -> EncIncRes i
EFinal []
encodeInc (EChunk [Word8]
os) = forall i. i -> (EncIncData -> EncIncRes i) -> EncIncRes i
EPart (forall (t :: * -> *) a. Foldable t => t [a] -> [a]
concat forall a b. (a -> b) -> a -> b
$ forall a b. (a -> b) -> [a] -> [b]
map Word8 -> String
toHex [Word8]
os) EncIncData -> EncIncRes String
encodeInc
encode :: [Word8] -> String
encode :: [Word8] -> String
encode = forall {a}. (EncIncData -> EncIncRes [a]) -> [Word8] -> [a]
encoder EncIncData -> EncIncRes String
encodeInc
decodeInc :: DecIncData String -> DecIncRes String
decodeInc :: DecIncData String -> DecIncRes String
decodeInc DecIncData String
d = String -> DecIncData String -> DecIncRes String
dI [] DecIncData String
d
where
dec2 :: String -> Maybe Word8
dec2 String
cs = let
ds :: [Maybe Word8]
ds = forall a b. (a -> b) -> [a] -> [b]
map (forall a b c. (a -> b -> c) -> b -> a -> c
flip forall k a. Ord k => k -> Map k a -> Maybe a
M.lookup Map Char Word8
decodeMap) String
cs
es :: [Word8]
es@[Word8
e1, Word8
e2] = forall a b. (a -> b) -> [a] -> [b]
map forall a. HasCallStack => Maybe a -> a
fromJust [Maybe Word8]
ds
o :: Word8
o = Word8
e1 forall a. Bits a => a -> Int -> a
`shiftL` Int
4 forall a. Bits a => a -> a -> a
.|. Word8
e2
allJust :: [Maybe a] -> Bool
allJust = forall (t :: * -> *). Foldable t => t Bool -> Bool
and forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a b. (a -> b) -> [a] -> [b]
map forall a. Maybe a -> Bool
isJust
in if forall {a}. [Maybe a] -> Bool
allJust [Maybe Word8]
ds
then forall a. a -> Maybe a
Just Word8
o
else forall a. Maybe a
Nothing
dI :: String -> DecIncData String -> DecIncRes String
dI [] DecIncData String
DDone = forall i. [Word8] -> i -> DecIncRes i
DFinal [] []
dI String
lo DecIncData String
DDone = forall i. [Word8] -> i -> DecIncRes i
DFail [] String
lo
dI String
lo (DChunk String
s) = [Word8] -> String -> DecIncRes String
doDec [] (String
lo forall a. [a] -> [a] -> [a]
++ String
s)
where
doDec :: [Word8] -> String -> DecIncRes String
doDec [Word8]
acc s' :: String
s'@(Char
c1:Char
c2:String
cs) = forall b a. b -> (a -> b) -> Maybe a -> b
maybe
(forall i. [Word8] -> i -> DecIncRes i
DFail [Word8]
acc String
s')
(\ Word8
b -> [Word8] -> String -> DecIncRes String
doDec ([Word8]
acc forall a. [a] -> [a] -> [a]
++ [Word8
b]) String
cs)
(String -> Maybe Word8
dec2 [Char
c1, Char
c2])
doDec [Word8]
acc String
s = forall i. [Word8] -> (DecIncData i -> DecIncRes i) -> DecIncRes i
DPart [Word8]
acc (String -> DecIncData String -> DecIncRes String
dI String
s)
decode :: String -> Maybe [Word8]
decode :: String -> Maybe [Word8]
decode = forall i. (DecIncData i -> DecIncRes i) -> i -> Maybe [Word8]
decoder DecIncData String -> DecIncRes String
decodeInc
chop :: Int
-> String
-> [String]
chop :: Int -> String -> [String]
chop Int
n String
"" = []
chop Int
n String
s = let
enc_len :: Int
enc_len | Int
n forall a. Ord a => a -> a -> Bool
< Int
2 = Int
2
| Bool
otherwise = Int
n forall a. Integral a => a -> a -> a
`div` Int
2 forall a. Num a => a -> a -> a
* Int
2
in forall a. Int -> [a] -> [a]
take Int
enc_len String
s forall a. a -> [a] -> [a]
: Int -> String -> [String]
chop Int
n (forall a. Int -> [a] -> [a]
drop Int
enc_len String
s)
unchop :: [String]
-> String
unchop :: [String] -> String
unchop = forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr forall a. [a] -> [a] -> [a]
(++) String
""