packages feed

Z-Data 0.1.8.0 → 0.1.9.0

raw patch · 42 files changed

+3233/−1040 lines, 42 files

Files

ChangeLog.md view
@@ -1,5 +1,11 @@ # Revision history for Z-Data +## 0.1.9.0  -- 2020-10-23++* Add `Z.Data.Vecotr.Hex`, `Z.Data.Vector.Base64` module.+* Improve `Z.Data.Builder` 's performance, remove `AllocateStrategy`, `buildAndRun`.+* Remove `TextBuilder` newtype from `Z.Data.Text.ShowT`, add `buildText`, `unsafeBuildText` to `Z.Data.Builder`.+ ## 0.1.8.0  -- 2020-10-23  * Rename `ascii` to `vecASCII` in `Z.Data.Vector.QQ` to match array QQ.
Z-Data.cabal view
@@ -1,6 +1,6 @@ cabal-version:              2.4 name:                       Z-Data-version:                    0.1.8.0+version:                    0.1.9.0 synopsis:                   Array, vector and text description:                This package provides array, slice and text operations license:                    BSD-3-Clause@@ -50,6 +50,12 @@                             third_party/fastvalidate-utf-8/include/simdasciicheck.h                             third_party/fastvalidate-utf-8/include/simdutf8check.h +                            -- Turbo-Base64+                            third_party/Turbo-Base64/conf.h+                            third_party/Turbo-Base64/turbob64_.h+                            third_party/Turbo-Base64/turbob64avx2.c++ source-repository head     type:     git     location: git://github.com/haskell-Z/z-data.git@@ -79,6 +85,8 @@                             Z.Data.Vector.FlatIntSet                             Z.Data.Vector.FlatMap                             Z.Data.Vector.FlatSet+                            Z.Data.Vector.Hex+                            Z.Data.Vector.Base64                              Z.Data.Text                             Z.Data.Text.Base@@ -135,18 +143,17 @@                             third_party/utf8rewind/source/internal                             third_party/utf8rewind/source                             third_party/fastvalidate-utf-8/include+                            third_party/Turbo-Base64     includes:               bytes.h                             dtoa.h                             text.h                             utf8rewind.h                             simdasciicheck.h                             simdutf8check.h+                            turbob64.h     install-includes:       bytes.h                             dtoa.h                             text.h-                            utf8rewind.h-                            simdasciicheck.h-                            simdutf8check.h     c-sources:              cbits/bytes.c                             cbits/dtoa.c                             cbits/text.c@@ -159,6 +166,9 @@                             third_party/utf8rewind/source/internal/seeking.c                             third_party/utf8rewind/source/internal/streaming.c                             third_party/utf8rewind/source/utf8rewind.c+                            third_party/Turbo-Base64/turbob64c.c+                            third_party/Turbo-Base64/turbob64d.c+                            third_party/Turbo-Base64/turbob64sse.c      default-language:       Haskell2010     build-tool-depends:     hsc2hs:hsc2hs, hspec-discover:hspec-discover@@ -168,6 +178,7 @@                             -Wno-incomplete-patterns                             -- ploymorphic pattern synonym messed exhaustiveness checker     default-extensions:     BangPatterns+                            BinaryLiterals                             CApiFFI                             ConstraintKinds                             CPP @@ -220,15 +231,16 @@                             Z.Data.Parser.NumericSpec                             Z.Data.Array.UnalignedSpec                             Z.Data.Text.BaseSpec-                            Z.Data.Text.ShowTSpec                             Z.Data.Text.ExtraSpec                             Z.Data.Text.SearchSpec+                            Z.Data.Text.ShowTSpec                             Z.Data.Vector.BaseSpec                             Z.Data.Vector.ExtraSpec                             Z.Data.Vector.SearchSpec                             Z.Data.Vector.SortSpec                             Z.Data.Vector.FlatMapSpec                             Z.Data.Vector.FlatSetSpec+                            Z.Data.Vector.HexSpec                             Z.ForeignSpec      build-depends:          Z-Data
Z/Data/Array.hs view
@@ -67,7 +67,7 @@ import           Z.Data.Array.UnliftedArray  --- | Bottom value (@throw ('UndefinedElement' "Data.Array.uninitialized")@)+-- | Bottom value (@throw ('UndefinedElement' 'Data.Array.uninitialized')@) -- for initialize new boxed array('Array', 'SmallArray'..). -- uninitialized :: a@@ -583,6 +583,6 @@ castArray = unsafeCoerce#  --- | Cast between arrays+-- | Cast between mutable arrays castMutableArray :: (Arr arr a, Cast a b) => MArr arr s a -> MArr arr s b castMutableArray = unsafeCoerce#
Z/Data/Array/UnliftedArray.hs view
@@ -46,6 +46,7 @@ import GHC.Exts import GHC.IO.Unsafe +-- | Types with 'GHC.Exts.TYPE' 'GHC.Exts.UnliftedRep', which can be stored \/ retrieved in 'ArrayArray#'. class PrimUnlifted a where     writeUnliftedArray# :: MutableArrayArray# s -> Int# -> a -> State# s -> State# s     readUnliftedArray# :: MutableArrayArray# s -> Int# -> State# s -> (# State# s, a #)@@ -135,9 +136,11 @@  -------------------------------------------------------------------------------- +-- | Mutable array holding 'PrimUnlifted' values. data MutableUnliftedArray s a     = MutableUnliftedArray (MutableArrayArray# s) +-- | Array holding 'PrimUnlifted' values. data UnliftedArray a     = UnliftedArray ArrayArray#
Z/Data/Builder.hs view
@@ -20,12 +20,11 @@   , buildBytesWith   , buildBytesList   , buildBytesListWith-  , buildAndRun-  , buildAndRunWith+  , buildText+  , unsafeBuildText     -- * Basic buiders   , bytes   , ensureN-  , atMost   , writeN    -- * Pritimive builders   , encodePrim@@ -42,7 +41,7 @@   , intWith   , integer   -- ** Fixded size hexidecimal formatting-  , hex, heX+  , hex, hexUpper   -- ** IEEE float formating   , FFormat(..)   , double@@ -51,6 +50,14 @@   , floatWith   , scientific   , scientificWith+  -- * Patterns+  , pattern PLUS+  , pattern MINUS+  , pattern ZERO+  , pattern SPACE+  , pattern DOT+  , pattern LITTLE_E+  , pattern BIG_E     -- * Builder helpers   , paren, curly, square, angle, quotes, squotes, colon, comma, intercalateVec, intercalateList   ) where
Z/Data/Builder/Base.hs view
@@ -9,47 +9,37 @@ Portability : non-portable  A 'Builder' records a buffer writing function, which can be 'mappend' in O(1) via composition.-In Z-Data a 'Builder' are designed to deal with different 'AllocateStrategy', it affects how-'Builder' react when writing across buffer boundaries: -  * When building a short strict 'Bytes' with 'buildBytes/buildByteswith',-    we do a 'DoubleBuffer'.+  * When building a short strict 'Bytes' with 'buildBytes'\/'buildBytesWith', we double the buffer+    each time buffer is full. -  * When building a large lazy @[Bytes]@ with 'buildBytesList/buildBytesListwith',-    we do an 'InsertChunk'.+  * When building a large lazy @[Bytes]@ with 'buildBytesList'\/'buildBytesListWith',+    we insert a new chunk when buffer is full. -  * When building and consuming are interlaced with 'buildAndRun/buildAndRunWith',-    we do an 'OneShotAction'.  Most of the time using combinators from this module to build 'Builder' s is enough,-but in case of rolling something shining from the ground, keep an eye on correct-'AllocateStrategy' handling.+but in case of rolling something shining from the ground, keep an eye on correct 'BuildResult' handling.  -}  module Z.Data.Builder.Base   ( -- * Builder type-    AllocateStrategy(..)-  , Buffer(..)-  , BuildStep-  , Builder(..)+    Builder(..)   , append+  , Buffer(..), freezeBuffer+  , BuildResult(..)+  , BuildStep    -- * Running a builder   , buildBytes   , buildBytesWith   , buildBytesList   , buildBytesListWith-  , buildAndRun-  , buildAndRunWith+  , buildText+  , unsafeBuildText     -- * Basic buiders   , bytes   , ensureN-  , atMost   , writeN-   -- * Boundary handling-  , doubleBuffer-  , insertChunk-  , oneShotAction    -- * Pritimive builders   , encodePrim   , encodePrimLE@@ -62,41 +52,50 @@  import           Control.Monad import           Control.Monad.Primitive-import           Control.Monad.ST-import           Control.Monad.ST.Unsafe            (unsafeInterleaveST)-import           Data.Bits                          (shiftL, shiftR, (.&.))-import           Data.Primitive.Ptr                 (copyPtrToMutablePrimArray)+import           Data.Bits                          (unsafeShiftL, unsafeShiftR, (.&.)) import           Data.Word import           Data.Int import           GHC.CString                        (unpackCString#, unpackCStringUtf8#) import           GHC.Exts-import qualified Z.Data.Array                     as A+import           GHC.Stack+import           Data.Primitive.PrimArray import           Z.Data.Array.Unaligned import qualified Z.Data.Text.Base                 as T import qualified Z.Data.Text.UTF8Codec            as T import qualified Z.Data.Vector.Base               as V import qualified Z.Data.Vector                    as V+import           Z.Foreign import           System.IO.Unsafe import           Test.QuickCheck.Arbitrary (Arbitrary(..), CoArbitrary(..)) --- | 'AllocateStrategy' will decide how each 'BuildStep' proceed when previous buffer is not enough.+-- | Helper type to help ghc unpack ---data AllocateStrategy s-    = DoubleBuffer       -- Double the buffer and continue building-    | InsertChunk {-# UNPACK #-} !Int   -- Insert a new chunk and continue building-    | OneShotAction (V.Bytes -> ST s ())  -- Freeze current chunk and perform action with it.-                                        -- Use the 'V.Bytes' argument outside the action is dangerous-                                        -- since we will reuse the buffer after action finished.+data Buffer = Buffer {-# UNPACK #-} !(MutablePrimArray RealWorld Word8)  -- ^ the buffer content+                     {-# UNPACK #-} !Int  -- ^ writing offset --- | Helper type to help ghc unpack+-- | Freeze buffer and return a 'V.Bytes'. ---data Buffer s = Buffer {-# UNPACK #-} !(A.MutablePrimArray s Word8)  -- ^ the buffer content-                       {-# UNPACK #-} !Int  -- ^ writing offset+-- Note the mutable buffer array will be shrinked with 'shrinkMutablePrimArray', which may not+-- able to be reused.+freezeBuffer :: Buffer -> IO V.Bytes+{-# INLINE freezeBuffer #-}+freezeBuffer (Buffer buf offset) = do+    siz <- getSizeofMutablePrimArray buf+    when (offset < siz) (shrinkMutablePrimArray buf offset)+    !arr <- unsafeFreezePrimArray buf+    return (V.PrimVector arr 0 offset)  -- | @BuilderStep@ is a function that fill buffer under given conditions. ---type BuildStep s = Buffer s -> ST s [V.Bytes]+type BuildStep = Buffer -> IO BuildResult +-- | 'BuildSignal's abstract signals to the caller of a 'BuildStep'. There are+-- three signals: 'Done', 'BufferFull', or 'InsertBytes' signals+data BuildResult+    = Done {-# UNPACK #-} !Buffer+    | BufferFull {-# UNPACK #-} !Buffer {-# UNPACK #-} !Int BuildStep+    | InsertBytes {-# UNPACK #-} !Buffer V.Bytes BuildStep+ -- | @Builder@ is a monad to help compose @BuilderStep@. With next @BuilderStep@ continuation, -- we can do interesting things like perform some action, or interleave the build process. --@@ -106,29 +105,28 @@ -- * @\\NUL@ will be written as @\xC0 \x80@. -- * @\\xD800@ ~ @\\xDFFF@ will be encoded in three bytes as normal UTF-8 codepoints. ---newtype Builder a = Builder-    { runBuilder :: forall s. AllocateStrategy s -> (a -> BuildStep s) -> BuildStep s}+newtype Builder a = Builder { runBuilder :: (a -> BuildStep) -> BuildStep }  instance Show (Builder a) where     show = show . buildBytes  instance Functor Builder where     {-# INLINE fmap #-}-    fmap f (Builder b) = Builder (\ al k -> b al (k . f))+    fmap f (Builder b) = Builder (\ k -> b (k . f))     {-# INLINE (<$) #-}-    a <$ (Builder b) = Builder (\ al k -> b al (\ _ -> k a))+    a <$ (Builder b) = Builder (\ k -> b (\ _ -> k a))  instance Applicative Builder where     {-# INLINE pure #-}-    pure x = Builder (\ _ k -> k x)+    pure x = Builder (\ k -> k x)     {-# INLINE (<*>) #-}-    (Builder f) <*> (Builder b) = Builder (\ al k -> f al ( \ ab -> b al (k . ab)))+    (Builder f) <*> (Builder b) = Builder (\ k -> f ( \ ab -> b (k . ab)))     {-# INLINE (*>) #-}     (*>) = append  instance Monad Builder where     {-# INLINE (>>=) #-}-    (Builder b) >>= f = Builder (\ al k -> b al ( \ a -> runBuilder (f a) al k))+    (Builder b) >>= f = Builder (\ k -> b ( \ a -> runBuilder (f a) k))     {-# INLINE (>>) #-}     (>>) = append @@ -174,201 +172,140 @@ charModifiedUTF8 :: Char -> Builder () {-# INLINE charModifiedUTF8 #-} charModifiedUTF8 chr = do-    ensureN 4-    Builder (\ _  k (Buffer mba i) -> do-        i' <- T.encodeCharModifiedUTF8 mba i chr-        k () (Buffer mba i'))+    ensureN 4 (\ mba i -> T.encodeCharModifiedUTF8 mba i chr)  packAddrModified :: Addr# -> Builder () packAddrModified addr0# = copy addr0#   where     len = fromIntegral . unsafeDupablePerformIO $ V.c_strlen addr0#     copy addr# = do-        ensureN len-        Builder (\ _  k (Buffer mba i) -> do-           copyPtrToMutablePrimArray mba i (Ptr addr#) len-           k () (Buffer mba (i + len)))+        writeN len (\ mba i -> copyPtrToMutablePrimArray mba i (Ptr addr#) len)  append :: Builder a -> Builder b -> Builder b {-# INLINE append #-}-append (Builder f) (Builder g) = Builder (\ al k -> f al ( \ _ ->  g al k))+append (Builder f) (Builder g) = Builder (\ k -> f ( \ _ ->  g k))  --------------------------------------------------------------------------------  -- | Write a 'V.Bytes'. bytes :: V.Bytes -> Builder () {-# INLINE bytes #-}-bytes bs@(V.PrimVector arr s l) = Builder (\ strategy k buffer@(Buffer buf offset) ->-    case strategy of-        DoubleBuffer -> copy strategy k buffer-        InsertChunk chunkSiz-            | l <= chunkSiz `shiftR` 1 ->-                copy strategy k buffer -- the copy limit is half the chunk size-            | offset /= 0 ->-                 insertChunk chunkSiz 0 (\ buffer' -> (bs:) `fmap` k () buffer') buffer-            | otherwise -> (bs:) `fmap` k () buffer-        OneShotAction action -> do-            chunkSiz <- A.sizeofMutableArr buf-            case () of-                _-                    | l <= chunkSiz `shiftR` 1 ->-                        copy strategy k buffer-                    | offset /= 0 ->-                        oneShotAction action 0 (\ buffer' -> action bs >> k () buffer') buffer-                    | otherwise -> action bs >> k () buffer)-  where-    copy :: forall s. AllocateStrategy s -> (() -> BuildStep s) -> BuildStep s-    copy strategy k =-        runBuilder (ensureN l) strategy ( \ _ (Buffer buf offset) -> do-                A.copyArr buf offset arr s l-                k () (Buffer buf (offset+l)))-    {-# INLINE copy #-}---- | Ensure that there are at least @n@ many elements available.-ensureN :: Int -> Builder ()-{-# INLINE ensureN #-}-ensureN !n = Builder $ \ strategy k buffer@(Buffer buf offset) -> do-    siz <- A.sizeofMutableArr buf  -- You may think doing this will be slow-                                   -- but this value lives in CPU cache for most of the time-    if siz - offset >= n-    then k () buffer-    else handleBoundary strategy n k buffer-  where-    {-# NOINLINE handleBoundary #-} -- Don't inline this branchy code-    handleBoundary DoubleBuffer n' k buffer = doubleBuffer n' (k ()) buffer-    handleBoundary (InsertChunk chunkSiz) n' k buffer = insertChunk chunkSiz n' (k ()) buffer-    handleBoundary (OneShotAction action) n' k buffer = oneShotAction action n' (k ()) buffer---------------------------------------------------------------------------------------- Handle chunk boundary--doubleBuffer :: Int -> BuildStep s -> BuildStep s-doubleBuffer !wantSiz k (Buffer buf offset) = do-    !siz <- A.sizeofMutableArr buf-    let !siz' = max (offset + wantSiz `shiftL` 1)-                    (siz `shiftL` 1)-    buf' <- A.resizeMutableArr buf siz'   -- double the buffer-    k (Buffer buf' offset)                -- continue building-{-# INLINE doubleBuffer #-}--insertChunk :: Int -> Int -> BuildStep s -> BuildStep s-{-# INLINE insertChunk #-}-insertChunk !chunkSiz !wantSiz k (Buffer buf offset) = do-    !siz <- A.sizeofMutableArr buf-    case () of-        _-            | offset /= 0 -> do-                when (offset < siz)-                    (A.shrinkMutableArr buf offset)            -- shrink old buffer if not full-                arr <- A.unsafeFreezeArr buf                   -- popup old buffer-                buf' <- A.newArr (max wantSiz chunkSiz)        -- make a new buffer-                xs <- unsafeInterleaveST (k (Buffer buf' 0))   -- delay the rest building process-                let v = V.fromArr arr 0 offset-                v `seq` pure (v : xs)-            | wantSiz <= siz -> k (Buffer buf 0) -- this should certainly not hold, but we still guard it-            | otherwise -> do-                buf' <- A.newArr (max wantSiz chunkSiz)        -- make a new buffer-                k (Buffer buf' 0)--oneShotAction :: (V.Bytes -> ST s ()) -> Int -> BuildStep s -> BuildStep s-{-# INLINE oneShotAction #-}-oneShotAction action !wantSiz k (Buffer buf offset) = do-    !siz <- A.sizeofMutableArr buf-    case () of-        _-            | offset /= 0 -> do-                arr <- A.unsafeFreezeArr buf             -- popup old buffer-                action (V.PrimVector arr 0 offset)-                if wantSiz <= siz-                then k (Buffer buf 0)                    -- continue building with old buf-                else do-                    buf' <- A.newArr wantSiz             -- make a new buffer-                    k (Buffer buf' 0)-            | wantSiz <= siz -> k (Buffer buf 0)-            | otherwise -> do-                buf' <- A.newArr wantSiz                -- make a new buffer-                k (Buffer buf' 0 )+bytes bs@(V.PrimVector arr s l) = Builder (\ k buffer@(Buffer buf offset) -> do+    siz <- getSizeofMutablePrimArray buf+    if siz - offset >= l+    then do+        copyPrimArray buf offset arr s l+        k () (Buffer buf (offset+l))+    else return (InsertBytes buffer bs (k ()))) -- bytes should be copied in outer handling  -------------------------------------------------------------------------------- --- | shortcut to 'buildBytesWith' 'V.defaultInitSize'.+-- | Shortcut to 'buildBytesWith' 'V.defaultInitSize'. buildBytes :: Builder a -> V.Bytes {-# INLINE buildBytes #-} buildBytes = buildBytesWith V.defaultInitSize --- | run Builder with 'DoubleBuffer' strategy, which is suitable+-- | Build some bytes and validate if it's UTF8 bytes.+buildText :: HasCallStack => Builder a -> T.Text+{-# INLINE buildText #-}+buildText = T.validate . buildBytesWith V.defaultInitSize++-- | Build some bytes assuming it's UTF8 encoding.+--+-- Be carefully use this function because you could constrcut illegal 'T.Text' values.+-- Check 'Z.Data.Text.ShowT' for UTF8 encoding builders. This functions is intended to+-- be used in debug only.+unsafeBuildText :: Builder a -> T.Text+{-# INLINE unsafeBuildText #-}+unsafeBuildText = T.Text . buildBytesWith V.defaultInitSize++-- | Run Builder with doubling buffer strategy, which is suitable -- for building short bytes. buildBytesWith :: Int -> Builder a -> V.Bytes {-# INLINABLE buildBytesWith #-}-buildBytesWith initSiz (Builder b) = runST $ do-    buf <- A.newArr initSiz-    [bs] <- b DoubleBuffer lastStep (Buffer buf 0 )-    pure bs+buildBytesWith initSiz (Builder b) = unsafePerformIO $ do+    buf <- newPrimArray initSiz+    loop =<< b (\ _ -> return . Done) (Buffer buf 0)   where-    lastStep _ (Buffer buf offset) = do-        siz <- A.sizeofMutableArr buf-        when (offset < siz) (A.shrinkMutableArr buf offset)-        arr <- A.unsafeFreezeArr buf-        pure [V.PrimVector arr 0 offset]+    loop r = case r of+        Done buffer -> freezeBuffer buffer+        BufferFull (Buffer buf offset) wantSiz k -> do+            !siz <- getSizeofMutablePrimArray buf+            let !siz' = max (offset + wantSiz `unsafeShiftL` 1)+                            (siz `unsafeShiftL` 1)+            buf' <- resizeMutablePrimArray buf siz'   -- grow buffer+            loop =<< k (Buffer buf' offset)+        InsertBytes (Buffer buf offset) (V.PrimVector arr s l) k -> do+            !siz <- getSizeofMutablePrimArray buf+            let !siz' = max (offset + l `unsafeShiftL` 1)+                            (siz `unsafeShiftL` 1)+            buf' <- resizeMutablePrimArray buf siz'   -- grow buffer+            copyPrimArray buf' offset arr s l+            loop =<< k (Buffer buf' (offset+l)) --- | shortcut to 'buildBytesListWith' 'V.defaultChunkSize'.+-- | Shortcut to 'buildBytesListWith' 'V.defaultChunkSize'. buildBytesList :: Builder a -> [V.Bytes] {-# INLINE buildBytesList #-} buildBytesList = buildBytesListWith  V.smallChunkSize V.defaultChunkSize --- | run Builder with 'InsertChunk' strategy, which is suitable--- for building lazy bytes chunks.+-- | Run Builder with inserting chunk strategy, which is suitable+-- for building a list of bytes chunks and processing them in a streaming ways. buildBytesListWith :: Int -> Int -> Builder a -> [V.Bytes] {-# INLINABLE buildBytesListWith #-}-buildBytesListWith initSiz chunkSiz (Builder b) = runST $ do-    buf <- A.newArr initSiz-    b (InsertChunk chunkSiz) lastStep (Buffer buf 0)-  where-    lastStep _ (Buffer buf offset) = do-        arr <- A.unsafeFreezeArr buf-        pure [V.PrimVector arr 0 offset]---- | shortcut to 'buildAndRunWith' 'V.defaultChunkSize'.-buildAndRun :: (V.Bytes -> IO ()) -> Builder a -> IO ()-buildAndRun = buildAndRunWith V.defaultChunkSize---- | run Builder with 'OneShotAction' strategy, which is suitable--- for doing effects while building.-buildAndRunWith :: Int -> (V.Bytes -> IO ()) -> Builder a -> IO ()-buildAndRunWith chunkSiz action (Builder b) = do-    buf <- A.newArr chunkSiz-    _ <- stToIO (b (OneShotAction (\ bs -> ioToPrim (action bs))) lastStep (Buffer buf 0))-    pure ()+buildBytesListWith initSiz chunkSiz (Builder b) = unsafePerformIO $ do+    buf <- newPrimArray initSiz+    loop [] =<< b (\ _ -> return . Done) (Buffer buf 0)   where-    lastStep :: a -> BuildStep RealWorld-    lastStep _ (Buffer buf offset) = do-        arr <- A.unsafeFreezeArr buf-        ioToPrim (action (V.PrimVector arr 0 offset))-        pure [] -- to match the silly pure type-{-# INLINABLE buildAndRun #-}+    loop acc r = case r of+        Done buffer -> do+            !v <- freezeBuffer buffer+            return (reverse (v : acc))+        BufferFull buffer@(Buffer _ offset) wantSiz k -> do+            let !siz' = max chunkSiz wantSiz+            buf' <- newPrimArray siz'   -- new buffer+            if (offset == 0)+            then loop acc =<< k (Buffer buf' 0)+            else do+                !v <- freezeBuffer buffer+                loop (v : acc) =<< k (Buffer buf' 0)+        InsertBytes buffer@(Buffer _ offset) v@(V.PrimVector arr s l) k -> do+            if (offset == 0)+            then loop (v : acc) =<< k buffer+            else do+                !v' <- freezeBuffer buffer+                buf' <- newPrimArray chunkSiz   -- new buffer+                if (l < chunkSiz `unsafeShiftR` 1)+                then do+                    copyPrimArray buf' 0 arr s l+                    loop (v' : acc) =<< k (Buffer buf' l)+                else loop (v : v' : acc) =<< k (Buffer buf' 0)  -------------------------------------------------------------------------------- -atMost :: Int  -- ^ size bound-       -> (forall s. A.MutablePrimArray s Word8 -> Int -> ST s Int)  -- ^ the writer which pure a new offset-                                                                       -- for next write+ensureN :: Int  -- ^ size bound+       -> (MutablePrimArray RealWorld Word8 -> Int -> IO Int)  -- ^ the writer which return a new offset+                                                               -- for next write        -> Builder ()-{-# INLINE atMost #-}-atMost n f = ensureN n `append`-    Builder (\ _  k (Buffer buf offset ) ->-        f buf offset >>= \ offset' -> k () (Buffer buf offset'))+{-# INLINE ensureN #-}+ensureN !n f = Builder (\ k buffer@(Buffer buf offset) -> do+    siz <- getSizeofMutablePrimArray buf+    if n + offset <= siz+    then f buf offset >>= \ offset' -> k () (Buffer buf offset')+    else return (BufferFull buffer n (\ (Buffer buf' offset') -> do+        f buf' offset' >>= \ offset'' -> k () (Buffer buf' offset''))))  writeN :: Int  -- ^ size bound-       -> (forall s. A.MutablePrimArray s Word8 -> Int -> ST s ())  -- ^ the writer which pure a new offset-                                                                    -- for next write+       -> (MutablePrimArray RealWorld Word8 -> Int -> IO ())  -- ^ the writer should write exactly N bytes        -> Builder () {-# INLINE writeN #-}-writeN n f = ensureN n `append`-    Builder (\ _  k (Buffer buf offset ) ->-        f buf offset >> k () (Buffer buf (offset+n)))+writeN !n f = Builder (\ k buffer@(Buffer buf offset) -> do+    siz <- getSizeofMutablePrimArray buf+    if n + offset <= siz+    then f buf offset >> k () (Buffer buf (offset+n))+    else return (BufferFull buffer n (\ (Buffer buf' offset') -> do+        f buf' offset' >> k () (Buffer buf' (offset'+n))))) --- | write primitive types in host byte order.+-- | Write a primitive type in host byte order. encodePrim :: forall a. Unaligned a => a -> Builder () {-# INLINE encodePrim #-} {-# SPECIALIZE INLINE encodePrim :: Word -> Builder () #-}@@ -382,14 +319,11 @@ {-# SPECIALIZE INLINE encodePrim :: Int16 -> Builder () #-} {-# SPECIALIZE INLINE encodePrim :: Int8 -> Builder () #-} encodePrim x = do-    ensureN n-    Builder (\ _  k (Buffer mpa i) -> do-        writePrimWord8ArrayAs mpa i x-        k () (Buffer mpa (i + n)))+    writeN n (\ mpa i -> writePrimWord8ArrayAs mpa i x)   where     n = unalignedSize (undefined :: a) --- | write primitive types with little endianess.+-- | Write a primitive type with little endianess. encodePrimLE :: forall a. Unaligned (LE a) => a -> Builder () {-# INLINE encodePrimLE #-} {-# SPECIALIZE INLINE encodePrimLE :: Word -> Builder () #-}@@ -402,7 +336,7 @@ {-# SPECIALIZE INLINE encodePrimLE :: Int16 -> Builder () #-} encodePrimLE = encodePrim . LE --- | write primitive types with big endianess.+-- | Write a primitive type with big endianess. encodePrimBE :: forall a. Unaligned (BE a) => a -> Builder () {-# INLINE encodePrimBE #-} {-# SPECIALIZE INLINE encodePrimBE :: Word -> Builder () #-}@@ -441,10 +375,7 @@   where     len = fromIntegral . unsafeDupablePerformIO $ V.c_strlen addr0#     copy addr# = do-        ensureN len-        Builder (\ _  k (Buffer mba i) -> do-           copyPtrToMutablePrimArray mba i (Ptr addr#) len-           k () (Buffer mba (i + len)))+        writeN len (\ mba i -> copyPtrToMutablePrimArray mba i (Ptr addr#) len)  packUTF8Addr :: Addr# -> Builder () packUTF8Addr addr0# = validateAndCopy addr0#@@ -454,10 +385,7 @@     validateAndCopy addr#         | valid == 0 = mapM_ charUTF8 (unpackCString# addr#)         | otherwise = do-            ensureN len-            Builder (\ _  k (Buffer mba i) -> do-               copyPtrToMutablePrimArray mba i (Ptr addr#) len-               k () (Buffer mba (i + len)))+            writeN len (\ mba i -> copyPtrToMutablePrimArray mba i (Ptr addr#) len)  -- | Turn 'Char' into 'Builder' with UTF8 encoding --@@ -465,10 +393,7 @@ charUTF8 :: Char -> Builder () {-# INLINE charUTF8 #-} charUTF8 chr = do-    ensureN 4-    Builder (\ _  k (Buffer mba i) -> do-        i' <- T.encodeChar mba i chr-        k () (Buffer mba i'))+    ensureN 4 (\ mba i -> T.encodeChar mba i chr)  -- | Turn 'String' into 'Builder' with ASCII7 encoding --@@ -483,11 +408,7 @@ char7 :: Char -> Builder () {-# INLINE char7 #-} char7 chr = do-    ensureN 1-    Builder (\ _  k (Buffer mpa i) -> do-        let x = V.c2w chr .&. 0x7F-        writePrimWord8ArrayAs mpa i x-        k () (Buffer mpa (i+1)))+    writeN 1 (\ mpa i -> writePrimWord8ArrayAs mpa i (V.c2w chr .&. 0x7F))  -- | Turn 'String' into 'Builder' with ASCII8 encoding --@@ -506,11 +427,7 @@ char8 :: Char -> Builder () {-# INLINE char8 #-} char8 chr = do-    ensureN 1-    Builder (\ _  k (Buffer mpa i) -> do-        let x = V.c2w chr-        writePrimWord8ArrayAs mpa i x-        k () (Buffer mpa (i+1)))+    writeN 1 (\ mpa i -> writePrimWord8ArrayAs mpa i (V.c2w chr))  -- | Write UTF8 encoded 'Text' using 'Builder'. --@@ -617,3 +534,4 @@     go [] = pure ()     go [x] = f x     go (x:xs') = f x >> s >> go xs'+
Z/Data/Builder/Numeric.hs view
@@ -21,7 +21,7 @@   , intWith   , integer   -- * Fixded size hexidecimal formatting-  , hex, heX+  , hex, hexUpper   -- * IEEE float formating   , FFormat(..)   , double@@ -30,19 +30,24 @@   , floatWith   , scientific   , scientificWith+  -- * Patterns+  , pattern PLUS+  , pattern MINUS+  , pattern ZERO+  , pattern SPACE+  , pattern DOT+  , pattern LITTLE_E+  , pattern BIG_E   -- * Misc   , grisu3   , grisu3_sp-  , i2wDec, i2wHex, i2wHeX+  , i2wDec, i2wHex, i2wHexUpper   , countDigits   , c_intWith, hs_intWith ) where  import           Control.Monad-import           Control.Monad.ST-import           Control.Monad.ST.Unsafe import           Data.Bits-import           Data.Char import           Data.Int import qualified Data.List                           as List import           Data.Primitive.ByteArray@@ -133,14 +138,14 @@ c_intWith (IFormat{..}) x     | x < 0 =         let !x' = (fromIntegral (complement x) :: Word64) + 1-        in atMost width' (\ (MutablePrimArray mba#) i ->-            unsafeIOToST (c_int_dec x' (-1) width pad (unsafeCoerce# mba#) i))+        in ensureN width' (\ (MutablePrimArray mba#) i ->+            (c_int_dec x' (-1) width pad (unsafeCoerce# mba#) i))     | posSign =-        atMost width' (\ (MutablePrimArray mba#) i ->-            unsafeIOToST (c_int_dec (fromIntegral x) 1 width pad (unsafeCoerce# mba#) i))+        ensureN width' (\ (MutablePrimArray mba#) i ->+            (c_int_dec (fromIntegral x) 1 width pad (unsafeCoerce# mba#) i))     | otherwise =-        atMost width' (\ (MutablePrimArray mba#) i ->-            unsafeIOToST (c_int_dec (fromIntegral x) 0 width pad (unsafeCoerce# mba#) i))+        ensureN width' (\ (MutablePrimArray mba#) i ->+            (c_int_dec (fromIntegral x) 0 width pad (unsafeCoerce# mba#) i))   where     width' = max 21 width     pad = case padding of NoPadding          -> 0@@ -162,12 +167,12 @@                 !qq = -q            -- all digits except last one                 !rr = i2wDec (-r)      -- last digits                 !n = countDigits qq-                !n' = n + 2         -- extra two bytes: minus and last digit+                !n' = n + 2         -- extra two bytes: MINUS and last digit             if width > n'             then case padding of                 NoPadding ->                     writeN n' $ \marr off -> do-                        writePrimArray marr off minus                       -- leading minus+                        writePrimArray marr off MINUS                       -- leading MINUS                         let off' = off + 1                         writePositiveDec marr off' n qq                      -- digits                         let off'' = off' + n@@ -175,9 +180,9 @@                 ZeroPadding ->                     writeN width $ \marr off -> do                         let !leadingN = width-n'-                        writePrimArray marr off minus                   -- leading minus+                        writePrimArray marr off MINUS                   -- leading MINUS                         let off' = off + 1-                        setPrimArray marr off' leadingN zero            -- leading zeros+                        setPrimArray marr off' leadingN ZERO            -- leading zeros                         let off'' = off' + leadingN                         writePositiveDec marr off'' n qq                 -- digits                         let off''' = off'' + n@@ -185,9 +190,9 @@                 LeftSpacePadding ->                     writeN width $ \marr off -> do                         let !leadingN = width-n'-                        setPrimArray marr off leadingN space            -- leading spaces+                        setPrimArray marr off leadingN SPACE            -- leading spaces                         let off' = off + leadingN-                        writePrimArray marr off' minus                  -- leading minus+                        writePrimArray marr off' MINUS                  -- leading MINUS                         let off'' = off' + 1                         writePositiveDec marr off'' n qq                 -- digits                         let off''' = off'' + n@@ -195,16 +200,16 @@                 RightSpacePadding ->                     writeN width $ \marr off -> do                         let !trailingN = width-n'-                        writePrimArray marr off minus                   -- leading minus+                        writePrimArray marr off MINUS                   -- leading MINUS                         let off' = off + 1                         writePositiveDec marr off' n qq                  -- digits                         let off'' = off' + n                         writePrimArray marr off'' rr                    -- last digit                         let off''' = off'' + 1-                        setPrimArray marr off''' trailingN space        -- trailing spaces+                        setPrimArray marr off''' trailingN SPACE        -- trailing spaces             else                 writeN n' $ \marr off -> do-                    writePrimArray marr off minus                       -- leading minus+                    writePrimArray marr off MINUS                       -- leading MINUS                     let off' = off + 1                     writePositiveDec marr off' n qq                      -- digits                     let off'' = off' + n@@ -212,41 +217,41 @@         else do             let !qq = -i                 !n = countDigits qq-                !n' = n + 1  -- extra byte: minus+                !n' = n + 1  -- extra byte: MINUS             if width > n'             then case padding of                 NoPadding ->                     writeN n' $ \marr off -> do-                        writePrimArray marr off minus                       -- leading minus+                        writePrimArray marr off MINUS                       -- leading MINUS                         let off' = off + 1                         writePositiveDec marr off' n qq                      -- digits                 ZeroPadding ->                     writeN width $ \marr off -> do                         let !leadingN = width-n'-                        writePrimArray marr off minus                   -- leading minus+                        writePrimArray marr off MINUS                   -- leading MINUS                         let off' = off + 1-                        setPrimArray marr off' leadingN zero            -- leading zeros+                        setPrimArray marr off' leadingN ZERO            -- leading zeros                         let off'' = off' + leadingN                         writePositiveDec marr off'' n qq                 -- digits                 LeftSpacePadding ->                     writeN width $ \marr off -> do                         let !leadingN = width-n'-                        setPrimArray marr off leadingN space            -- leading spaces+                        setPrimArray marr off leadingN SPACE            -- leading spaces                         let off' = off + leadingN-                        writePrimArray marr off' minus                  -- leading minus+                        writePrimArray marr off' MINUS                  -- leading MINUS                         let off'' = off' + 1                         writePositiveDec marr off'' n qq                 -- digits                 RightSpacePadding ->                     writeN width $ \marr off -> do                         let !trailingN = width-n'-                        writePrimArray marr off minus                   -- leading minus+                        writePrimArray marr off MINUS                   -- leading MINUS                         let off' = off + 1                         writePositiveDec marr off' n qq                  -- digits                         let off'' = off' + n-                        setPrimArray marr off'' trailingN space         -- trailing spaces+                        setPrimArray marr off'' trailingN SPACE         -- trailing spaces             else                 writeN n' $ \marr off -> do-                    writePrimArray marr off minus                       -- leading minus+                    writePrimArray marr off MINUS                       -- leading MINUS                     let off' = off + 1                     writePositiveDec marr off' n qq                      -- digits     | otherwise = positiveInt format i@@ -262,36 +267,36 @@             then case padding of                 NoPadding ->                     writeN n' $ \marr off -> do-                        writePrimArray marr off plus                    -- leading plus+                        writePrimArray marr off PLUS                    -- leading PLUS                         let off' = off + 1                         writePositiveDec marr off' n i                   -- digits                 ZeroPadding ->                     writeN width $ \marr off -> do                         let !leadingN = width-n'-                        writePrimArray marr off plus                    -- leading plus+                        writePrimArray marr off PLUS                    -- leading PLUS                         let off' = off + 1-                        setPrimArray marr off' leadingN zero            -- leading zeros+                        setPrimArray marr off' leadingN ZERO            -- leading zeros                         let off'' = off' + leadingN                         writePositiveDec marr off'' n i                  -- digits                 LeftSpacePadding ->                     writeN width $ \marr off -> do                         let !leadingN = width-n'-                        setPrimArray marr off leadingN space            -- leading spaces+                        setPrimArray marr off leadingN SPACE            -- leading spaces                         let off' = off + leadingN-                        writePrimArray marr off' plus                   -- leading plus+                        writePrimArray marr off' PLUS                   -- leading PLUS                         let off'' = off' + 1                         writePositiveDec marr off'' n i                  -- digits                 RightSpacePadding ->                     writeN width $ \marr off -> do                         let !trailingN = width-n'-                        writePrimArray marr off plus                    -- leading plus+                        writePrimArray marr off PLUS                    -- leading PLUS                         let off' = off + 1                         writePositiveDec marr off' n i                   -- digits                         let off'' = off' + n-                        setPrimArray marr off'' trailingN space         -- trailing spaces+                        setPrimArray marr off'' trailingN SPACE         -- trailing spaces             else                 writeN n' $ \marr off -> do-                    writePrimArray marr off plus                        -- leading plus+                    writePrimArray marr off PLUS                        -- leading PLUS                     let off' = off + 1                     writePositiveDec marr off' n i                       -- digits @@ -303,13 +308,13 @@                 ZeroPadding ->                     writeN width $ \marr off -> do                         let !leadingN = width-n-                        setPrimArray marr off leadingN zero             -- leading zeros+                        setPrimArray marr off leadingN ZERO             -- leading zeros                         let off' = off + leadingN                         writePositiveDec marr off' n i                   -- digits                 LeftSpacePadding ->                     writeN width $ \marr off -> do                         let !leadingN = width-n-                        setPrimArray marr off leadingN space            -- leading spaces+                        setPrimArray marr off leadingN SPACE            -- leading spaces                         let off' = off + leadingN                         writePositiveDec marr off' n i                   -- digits                 RightSpacePadding ->@@ -317,17 +322,17 @@                         let !trailingN = width-n                         writePositiveDec marr off n i                    -- digits                         let off' = off + n-                        setPrimArray marr off' trailingN space          -- trailing spaces+                        setPrimArray marr off' trailingN SPACE          -- trailing spaces             else                 writeN n $ \marr off -> do                     writePositiveDec marr off n i                        -- digits  writePositiveDec :: (Integral a)-                => forall s. MutablePrimArray s Word8       -- ^ The buffer+                => MutablePrimArray RealWorld Word8       -- ^ The buffer                 -> Int                                      -- ^ writing offset                 -> Int                                      -- ^ total digits                 -> a                                        -- ^ the value-                -> ST s ()+                -> IO () {-# INLINE writePositiveDec #-} writePositiveDec marr off0 ds = go (off0 + ds - 1)   where@@ -369,7 +374,7 @@ #endif -- Divide and conquer implementation of string conversion integer n0-    | n0 < 0    = encodePrim minus >> integer' (-n0)+    | n0 < 0    = encodePrim MINUS >> integer' (-n0)     | otherwise = integer' n0   where     integer' :: Integer -> Builder ()@@ -408,7 +413,7 @@      -- Split n into digits in base p. We first split n into digits     -- in base p*p and then split each of these digits into two.-    -- Note that the first 'digit' modulo p*p may have a leading zero+    -- Note that the first 'digit' modulo p*p may have a leading ZERO     -- in base p that we need to drop - this is what jsplith takes care of.     -- jsplitb the handles the remaining digits.     jsplitf :: Integer -> Integer -> [Integer]@@ -460,38 +465,35 @@            | otherwise = go (k + 12) (v `quot` 1000000000000)         fin v n = if v >= n then 1 else 0 -minus, plus, zero, space :: Word8-{-# INLINE plus #-}-{-# INLINE minus #-}-{-# INLINE zero #-}-{-# INLINE space #-}-plus = 43-minus = 45-zero = 48-space = 32+pattern MINUS, PLUS, ZERO, SPACE, DOT, LITTLE_E, BIG_E :: Word8+pattern PLUS     = 43+pattern MINUS    = 45+pattern ZERO     = 48+pattern SPACE    = 32+pattern DOT      = 46+pattern LITTLE_E = 101+pattern BIG_E    = 69  -- | Decimal digit to ASCII digit. i2wDec :: (Integral a) => a -> Word8 {-# INLINE i2wDec #-}-i2wDec v = zero + fromIntegral v---- | Decimal digit to ASCII char.-i2cDec :: (Integral a) => a -> Char-{-# INLINE i2cDec #-}-i2cDec v = chr . fromIntegral $ zero + fromIntegral v+{-# SPECIALIZE INLINE i2wDec :: Int -> Word8 #-}+i2wDec v = ZERO + fromIntegral v  -- | Hexadecimal digit to ASCII char. i2wHex :: (Integral a) => a -> Word8 {-# INLINE i2wHex #-}+{-# SPECIALIZE INLINE i2wHex :: Int -> Word8 #-} i2wHex v-    | v <= 9    = zero + fromIntegral v+    | v <= 9    = ZERO + fromIntegral v     | otherwise = 87 + fromIntegral v       -- fromEnum 'a' - 10  -- | Hexadecimal digit to UPPERCASED ASCII char.-i2wHeX :: (Integral a) => a -> Word8-{-# INLINE i2wHeX #-}-i2wHeX v-    | v <= 9    = zero + fromIntegral v+i2wHexUpper :: (Integral a) => a -> Word8+{-# INLINE i2wHexUpper #-}+{-# SPECIALIZE INLINE i2wHexUpper :: Int -> Word8 #-}+i2wHexUpper v+    | v <= 9    = ZERO + fromIntegral v     | otherwise = 55 + fromIntegral v       -- fromEnum 'A' - 10  --------------------------------------------------------------------------------@@ -534,9 +536,9 @@   -- | The UPPERCASED version of 'hex'.-heX :: forall a. (FiniteBits a, Integral a) => a -> Builder ()-{-# INLINE heX #-}-heX w = writeN hexSiz (go w (hexSiz-2))+hexUpper :: forall a. (FiniteBits a, Integral a) => a -> Builder ()+{-# INLINE hexUpper #-}+hexUpper w = writeN hexSiz (go w (hexSiz-2))   where     bitSiz = finiteBitSize (undefined :: a)     hexSiz = (bitSiz+3) `unsafeShiftR` 2@@ -552,7 +554,7 @@             writePrimArray marr (off + 1) $ indexOffPtr hexDigitTableUpper (j+1)         | d < 0  = do         -- for FiniteBits instances which has extra bits             let !i = fromIntegral v .&. 0x0F :: Int-            writePrimArray marr off $ i2wHeX i+            writePrimArray marr off $ i2wHexUpper i  -------------------------------------------------------------------------------- @@ -611,85 +613,112 @@     | x == 0                    = doFmt fmt decs ([0], 0)     | otherwise                 = doFmt fmt decs (grisu3 x) -- Grisu only handles strictly positive finite numbers. +-- | A faster version of 'Sci.toDecimalDigits' in case of small coefficient.+positiveSciToDigits :: Sci.Scientific -> ([Int], Int)+positiveSciToDigits sci =+    if c == 0+        then ([0], 0)+        else case c of+#ifdef INTEGER_GMP+            (S# i#) -> goI (I# i#) 0 []+#endif+            _ -> go c 0 []+  where+    sci' = Sci.normalize sci+    !c = Sci.coefficient sci'+    !e = Sci.base10Exponent sci'++    go :: Integer -> Int -> [Int] -> ([Int], Int)+    go 0 !n ds = let !ne = n + e in (ds, ne)+    go i !n ds = case i `quotRemInteger` 10 of+                     (# q, r #) -> go q (n+1) (d:ds)+                       where+                         !d = fromIntegral r+#ifdef INTEGER_GMP+    goI :: Int -> Int -> [Int] -> ([Int], Int)+    goI 0 !n ds = let !ne = n + e in (ds, ne)+    goI i !n ds = case i `quotRem` 10 of (q, !r) -> goI q (n+1) (r:ds)+#endif+ -- | Worker function to do formatting. doFmt :: FFormat       -> Maybe Int -- ^ Number of decimal places to render.       -> ([Int], Int) -- ^ List of digits and exponent       -> Builder () {-# INLINABLE doFmt #-}-doFmt format decs (is, e) =-    let ds = map i2cDec is-    in case format of-        Generic ->-            doFmt (if e < 0 || e > 7 then Exponent else Fixed) decs (is,e)-        Exponent ->-            case decs of-                Nothing ->-                    let show_e' = int (e-1)-                    in case ds of-                        "0"     -> "0.0e0"-                        [d]     -> char8 d >> ".0e" >> show_e'-                        (d:ds') -> char8 d >> char8 '.' >>-                                        string8 ds' >> char8 'e' >> show_e'-                        []      -> error "doFmt/Exponent: []"-                Just dec-                    | dec <= 0 ->-                    -- decimal point as well (ghc trac #15115).-                    -- Note that this handles negative precisions as well for consistency-                    -- (see ghc trac #15509).-                        case is of-                            [0] -> "0e0"-                            _ -> do-                                let (ei,is') = roundTo 10 1 is-                                    n:_ = map i2cDec (if ei > 0 then init is' else is')-                                char8 n-                                char8 'e'-                                int (e-1+ei)-                Just dec ->-                    let dec' = max dec 1 in-                    case is of-                        [0] -> do-                                char8 '0'-                                char8 '.'-                                replicateM_ dec' $ char8 '0'-                                char8 'e'-                                char8 '0'-                        _ -> do-                            let (ei,is') = roundTo 10 (dec'+1) is-                                (d:ds') = map i2cDec (if ei > 0 then init is' else is')-                            char8 d-                            char8 '.'-                            string8 ds'-                            char8 'e'-                            int (e-1+ei)-        Fixed ->-            let mk0 ls = case ls of { "" -> char8 '0' ; _ -> string8 ls}-            in case decs of-                Nothing-                    | e <= 0    -> do-                                char8 '0'-                                char8 '.'-                                replicateM_ (-e) $ char8 '0'-                                string8 ds-                    | otherwise ->-                        let f 0 s    rs  = mk0 (reverse s) >> char8 '.' >> mk0 rs-                            f n s    ""  = f (n-1) ('0':s) ""-                            f n s (r:rs) = f (n-1) (r:s) rs-                        in f e "" ds-                Just dec ->-                    let dec' = max dec 0-                    in if e >= 0-                        then-                            let (ei,is') = roundTo 10 (dec' + e) is-                                (ls,rs)  = splitAt (e+ei) (map i2cDec is')-                            in mk0 ls >>-                                (unless (List.null rs) $ char8 '.' >> string8 rs)-                        else-                            let (ei,is') = roundTo 10 dec' (List.replicate (-e) 0 ++ is)-                                d:ds' = map i2cDec (if ei > 0 then is' else 0:is')-                            in char8 d >>-                                (unless (List.null ds') $ char8 '.' >> string8 ds')+doFmt format decs (is, e) = case format of+    Generic -> doFmt (if e < 0 || e > 7 then Exponent else Fixed) decs (is,e)+    Exponent -> case decs of+        Nothing -> case is of+            [0]     -> "0.0e0"+            [i]     -> encodeDigit i >> ".0e" >> int (e-1)+            (i:is') -> do+                encodeDigit i+                encodePrim DOT+                encodeDigits is'+                encodePrim LITTLE_E+                int (e-1)+            []      -> error "doFmt/Exponent: []"+        Just dec+            | dec <= 0 ->+            -- decimal point as well (ghc trac #15115).+            -- Note that this handles negative precisions as well for consistency+            -- (see ghc trac #15509).+                case is of+                    [0] -> "0e0"+                    _ -> do+                        let (ei,is') = roundTo 10 1 is+                            n:_ = if ei > 0 then List.init is' else is'+                        encodeDigit n+                        encodePrim LITTLE_E+                        int (e-1+ei)+        Just dec ->+            let !dec' = max dec 1 in+            case is of+                [0] -> do+                    "0." >> encodeZeros dec' >> "e0"+                _ -> do+                    let (ei,is') = roundTo 10 (dec'+1) is+                        (d:ds') = if ei > 0 then List.init is' else is'+                    encodeDigit d+                    encodePrim DOT+                    encodeDigits ds'+                    encodePrim LITTLE_E+                    int (e-1+ei)+    Fixed -> case decs of+        Nothing+            | e <= 0    -> do+                "0."+                encodeZeros (-e)+                encodeDigits is+            | otherwise -> insertDot e is+        Just dec ->+            let !dec' = max dec 0+            in if e >= 0+                then do+                    let (ei,is') = roundTo 10 (dec' + e) is+                        (ls,rs)  = splitAt (e+ei) is'+                    mk0 ls+                    (unless (List.null rs) $ encodePrim DOT >> encodeDigits rs)+                else do+                    let (ei,is') = roundTo 10 dec' (List.replicate (-e) 0 ++ is)+                        d:ds' = if ei > 0 then is' else 0:is'+                    encodeDigit d+                    (unless (List.null ds') $ encodePrim DOT >> encodeDigits ds')+  where+    encodeDigit = encodePrim . i2wDec +    encodeDigits = mapM_ encodeDigit++    encodeZeros n = replicateM_ n (encodePrim ZERO)++    mk0 [] = encodePrim ZERO+    mk0 ls = encodeDigits ls++    insertDot 0     rs = encodePrim DOT >> mk0 rs+    insertDot n     [] = encodePrim ZERO >> insertDot (n-1) []+    insertDot n (r:rs) = encodeDigit r >> insertDot (n-1) rs+  ------------------------------------------------------------------------------ -- Conversion of 'Float's and 'Double's to ASCII in decimal using Grisu3 ------------------------------------------------------------------------@@ -762,5 +791,5 @@                -> Builder () {-# INLINE scientificWith #-} scientificWith fmt decs scntfc-   | scntfc < 0 = char8 '-' <> doFmt fmt decs (Sci.toDecimalDigits (-scntfc))-   | otherwise  =              doFmt fmt decs (Sci.toDecimalDigits   scntfc)+   | scntfc < 0 = char8 '-' <> doFmt fmt decs (positiveSciToDigits (-scntfc))+   | otherwise  =              doFmt fmt decs (positiveSciToDigits   scntfc)
Z/Data/Builder/Numeric/DigitTable.hs view
@@ -9,6 +9,7 @@ Stability   : experimental Portability : non-portable +Internal module, provides lookup table for converting numeric value into ASCII bytes. -} module Z.Data.Builder.Numeric.DigitTable where
Z/Data/CBytes.hs view
@@ -7,7 +7,7 @@ Stability   : experimental Portability : non-portable -This module provide 'CBytes' with some useful instances \/ tools for retrieving, storing or processing+This module provides 'CBytes' with some useful instances \/ tools for retrieving, storing or processing short byte sequences, such as file path, environment variables, etc.  -}@@ -78,7 +78,7 @@ -- interface, e.g. libuv do this when deal with file paths. -- -- 'CBytes' don't support O(1) slicing, it's not suitable to use it to store large byte--- chunk, If you need advance editing, convert 'CBytes' to 'V.Bytes' with 'CB' pattern or+-- chunk, If you need advance editing, convert 'CBytes' to\/from 'V.Bytes' with 'CB' pattern or -- 'toBytes' \/ 'fromBytes', then use vector combinators. -- -- When textual represatation is needed e.g. converting to 'String', 'T.Text', 'Show' instance, etc.,@@ -195,9 +195,11 @@         return (CBytes pa))  -- | This instance provide UTF8 guarantee, illegal codepoints will be written as 'T.replacementChar's.+--+-- Escaping rule is same with 'String'. instance T.ShowT CBytes where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ = T.stringUTF8 . show . unpack+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ = T.stringUTF8 . show . unpack  -- | JSON instances check if 'CBytes' is proper UTF8 encoded, -- if it is, decode/encode it as 'T.Text', otherwise as 'V.Bytes'.@@ -229,7 +231,7 @@     {-# INLINE encodeJSON #-}     encodeJSON cbytes = case toTextMaybe cbytes of         Just t -> JSON.encodeJSON t-        Nothing -> B.square . JSON.commaVec' . toBytes $ cbytes+        Nothing -> B.square . JSON.commaSepVec . toBytes $ cbytes  -- | Concatenate two 'CBytes'. append :: CBytes -> CBytes -> CBytes
Z/Data/JSON.hs view
@@ -50,27 +50,46 @@   * 'NonEmpty', 'Vector', 'PrimVector', 'HashSet', 'FlatSet', 'FlatIntSet' are also encoded to JSON array.   * 'HashMap', 'FlatMap', 'FlatIntMap' are encoded to JSON object. -There're some modifying options if you providing a custom 'Settings', which allow you to modify field name or constructor-name, but please don't produce control characters during your modification, since we assume field labels and constructor-name won't contain them, thus we can save an extra escaping pass. To use constom 'Settings' just write:+There're some modifying options if you providing a custom 'Settings', which allow you to modify field name or constructor name, but please don't produce control characters during your modification, since we assume field labels and constructor name won't contain them, thus we can save an extra escaping pass. To use constom 'Settings' just write:  @-    data T = T {fooBar :: Int, fooQux :: [Int]} deriving (Generic)-    instance ToValue T where toValue = JSON.gToValue JSON.defaultSettings{ JSON.fieldFmt = JSON.snakeCase } . from+    {-# LANGUAGE DeriveGeneric, DeriveAnyClass, DerivingStrategies #-}+    import GHC.Generics+    import qualified Z.Data.JSON as JSON+    import qualified Z.Data.Text as T +    data T = T {fooT :: Int, barT :: [Int]} deriving Generic+    instance JSON.ToValue T where+        -- You can omit following definition if you don't need to change settings+        toValue = JSON.gToValue JSON.defaultSettings{ JSON.fieldFmt = JSON.snakeCase } . from++    -- define this instances if you need fast JSON encoding(without convert to JSON.Value first)+    instance JSON.EncodeJSON T where+        -- You can omit following definition if you don't need to change settings+        encodeJSON = JSON.gEncodeJSON JSON.defaultSettings{ JSON.fieldFmt = JSON.snakeCase } . from+     > JSON.toValue (T 0 [1,2,3])-    Object [(\"foo_bar\",Number 0.0),(\"bar_qux\",Array [Number 1.0,Number 2.0,Number 3.0])]+    Object [(\"foo_t\",Number 0.0),(\"bar_t\",Array [Number 1.0,Number 2.0,Number 3.0])]++    data T2 = T2 {fooT2 :: Int, barT2 :: T.Text} deriving Generic+                                                 deriving anyclass ( JSON.FromValue+                                                                   , JSON.ToValue+                                                                   , JSON.EncodeJSON)+    > @  = Write instances manually. -You can write 'ToValue' and 'FromValue' instances by hand if the 'Generic' based one doesn't suit you. Here is an example-similar to aeson's.+You can write 'ToValue' and 'FromValue' instances by hand if the 'Generic' based one doesn't suit you.+Here is an example similar to aeson's.  @     import qualified Z.Data.Text          as T     import qualified Z.Data.Vector        as V     import qualified Z.Data.Builder       as B+    import qualified Z.Data.JSON          as JSON+    import           Z.Data.JSON          ((.:), kv, commaSepList,+                                           FromValue(..), ToValue(..), EncodeJSON(..))      data Person = Person { name :: T.Text , age  :: Int } deriving Show @@ -83,10 +102,10 @@         toValue (Person n a) = JSON.Object $ V.pack [(\"name\", toValue n),(\"age\", toValue a)]      instance EncodeJSON Person where-        encodeJSON (Person n a) = B.curly $ do-            B.quotes \"name\" >> B.colon >> encodeJSON n-            B.comma-            B.quotes \"age\" >> B.colon >> encodeJSON a+        encodeJSON (Person n a) = B.curly . commaSepList $ [+              \"name\" `kv` string n+            , \"age\" `kv` B.int a+            ]      > toValue (Person \"Joe\" 12)     Object [(\"name\",String \"Joe\"),(\"age\",Number 12.0)]@@ -98,12 +117,10 @@  The 'Value' type is different from aeson's one in that we use @Vector (Text, Value)@ to represent JSON objects, thus we can choose different strategies on key duplication, the lookup map type, etc. so instead of a single 'withObject',-we provide 'withHashMap', 'withHashMapR', 'withFlatMap' and 'withFlatMapR' which use different lookup map type, and different-key order piority. Most of time 'FlatMap' is faster than 'HashMap' since we only use the lookup map once, the cost of-constructing a 'HashMap' is higher. If you want to directly working on key-values, 'withKeyValues' provide key-values-vector access.+we provide 'withHashMap', 'withHashMapR', 'withFlatMap' and 'withFlatMapR' which use different lookup map type, and different key order piority. Most of time 'FlatMap' is faster than 'HashMap' since we only use the lookup map once, the cost of constructing a 'HashMap' is higher. If you want to directly working on key-values, 'withKeyValues' provide key-values vector access.  There're some useful tools to help write encoding code in "Z.Data.JSON.Builder" module, such as JSON string escaping tool, etc.+ If you don't particularly care for fast encoding, you can also use 'toValue' together with value builder, the overhead is usually very small.  -}@@ -111,7 +128,8 @@ module Z.Data.JSON   ( -- * Encode & Decode     DecodeError-  , decode, decode', decodeText, decodeText', decodeChunks, decodeChunks', encodeBytes, encodeText, encodeTextBuilder+  , decode, decode', decodeText, decodeText', decodeChunks, decodeChunks'+  , encodeBytes, encodeBytesList, encodeText     -- * Value type   , Value(..)     -- * parse into JSON Value@@ -129,6 +147,11 @@   , EncodeJSON(..)   , defaultSettings, Settings(..), snakeCase, trainCase   , gToValue, gFromValue, gEncodeJSON+  -- * Helper for manually writing encoders+  , kv, kv'+  , string+  , commaSepList+  , commaSepVec   ) where
Z/Data/JSON/Base.hs view
@@ -15,7 +15,8 @@ module Z.Data.JSON.Base   ( -- * Encode & Decode     DecodeError-  , decode, decode', decodeText, decodeText', decodeChunks, decodeChunks', encodeBytes, encodeText, encodeTextBuilder+  , decode, decode', decodeText, decodeText', decodeChunks, decodeChunks'+  , encodeBytes, encodeBytesList, encodeText   -- * Re-export 'Value' type   , Value(..)     -- * parse into JSON Value@@ -36,9 +37,11 @@   , Field, GWriteFields(..), GMergeFields(..), GConstrToValue(..)   , LookupTable, GFromFields(..), GBuildLookup(..), GConstrFromValue(..)   , GAddPunctuation(..), GConstrEncodeJSON(..)-  -- * Internal Helper-  , commaList'-  , commaVec'+  -- * Helper for manually writing encoders+  , JB.kv, JB.kv'+  , JB.string+  , commaSepList+  , commaSepVec   ) where  import           Control.Applicative@@ -86,7 +89,6 @@ import qualified Z.Data.JSON.Builder        as JB import qualified Z.Data.Parser              as P import qualified Z.Data.Parser.Numeric      as P-import qualified Z.Data.Text.Base           as T import qualified Z.Data.Text                as T import qualified Z.Data.Text.ShowT          as T import qualified Z.Data.Vector.Base         as V@@ -161,15 +163,15 @@ {-# INLINE encodeBytes #-} encodeBytes = B.buildBytes . encodeJSON +-- | Encode data to JSON bytes chunks.+encodeBytesList :: EncodeJSON a => a -> [V.Bytes]+{-# INLINE encodeBytesList #-}+encodeBytesList = B.buildBytesList . encodeJSON+ -- | Text version 'encodeBytes'. encodeText :: EncodeJSON a => a -> T.Text {-# INLINE encodeText #-}-encodeText = T.buildText . encodeTextBuilder---- | JSON Docs are guaranteed to be valid UTF-8 texts, so we provide this.-encodeTextBuilder :: EncodeJSON a => a -> T.TextBuilder ()-{-# INLINE encodeTextBuilder #-}-encodeTextBuilder = T.unsafeFromBuilder . encodeJSON+encodeText = T.Text . encodeBytes  -- | Run a 'Converter' with input value. convert :: (a -> Converter r) -> a -> Either ConvertError r@@ -195,18 +197,22 @@         -- ^ path of a embedded (JSON) String   deriving (Eq, Show, Typeable, Ord, Generic, NFData) -data ConvertError = ConvertError { errPath :: [PathElement], errMsg :: T.Text } deriving (Eq, Ord, Generic, NFData)+data ConvertError = ConvertError+    { errPath :: [PathElement], errMsg :: T.Text }+        deriving (Eq, Ord, Generic, NFData)  instance Show ConvertError where-    -- TODO use standard format-    show (ConvertError paths msg) = T.unpack . T.buildText $ do+    show = T.toString++instance T.ShowT ConvertError where+    toUTF8BuilderP _ (ConvertError paths msg) = do         "<"         mapM_ renderPath (reverse paths)         "> "         T.text msg       where         renderPath (Index ix) = T.char7 '[' >> T.int ix >> T.char7 ']'-        renderPath (Key k) = T.char7 '.' >> (T.unsafeFromBuilder $ JB.string k)+        renderPath (Key k) = T.char7 '.' >> (JB.string k)         renderPath Embedded = "<Embedded>"  -- | 'Converter' for convert result from JSON 'Value'.@@ -346,7 +352,7 @@ {-# INLINE withBoundedScientific #-} withBoundedScientific name f (Number x)     | e <= 1024 = f x-    | otherwise = fail' . T.buildText $ do+    | otherwise = fail' . B.unsafeBuildText $ do         "converting "         T.text name         " failed, found a number with exponent "@@ -362,7 +368,7 @@ withBoundedIntegral name f (Number x) =     case toBoundedInteger x of         Just i -> f i-        _      -> fail' . T.buildText $ do+        _      -> fail' . B.unsafeBuildText $ do             "converting "             T.text name             "failed, value is either floating or will cause over or underflow: "@@ -478,14 +484,14 @@ --------------------------------------------------------------------------------  -- | Use @,@ as separator to connect list of builders.-commaList' :: EncodeJSON a => [a] -> B.Builder ()-{-# INLINE commaList' #-}-commaList' = B.intercalateList B.comma encodeJSON+commaSepList :: EncodeJSON a => [a] -> B.Builder ()+{-# INLINE commaSepList #-}+commaSepList = B.intercalateList B.comma encodeJSON  -- | Use @,@ as separator to connect a vector of builders.-commaVec' :: (EncodeJSON a, V.Vec v a) => v a ->  B.Builder ()-{-# INLINE commaVec' #-}-commaVec' = B.intercalateVec B.comma encodeJSON+commaSepVec :: (EncodeJSON a, V.Vec v a) => v a ->  B.Builder ()+{-# INLINE commaSepVec #-}+commaSepVec = B.intercalateVec B.comma encodeJSON  -------------------------------------------------------------------------------- @@ -799,7 +805,8 @@ instance GBuildLookup (S1 (MetaSel Nothing u ss ds) f) where     {-# INLINE gBuildLookup #-}     gBuildLookup _ siz name (Array v)-        | siz' /= siz = fail' . T.buildText $ do+        -- we have to check size here to use 'unsafeIndexM' later+        | siz' /= siz = fail' . B.unsafeBuildText $ do             "converting "             T.text name             " failed, product size mismatch, expected "@@ -812,18 +819,9 @@  instance GBuildLookup (S1 ((MetaSel (Just l) u ss ds)) f) where     {-# INLINE gBuildLookup #-}-    gBuildLookup _ siz name (Object v)-        | siz' /= siz = fail' . T.buildText $ do-            "converting "-            T.text name-            " failed, product size mismatch, expected "-            T.int siz-            ", get"-            T.int siz'-        | otherwise = pure m-      where siz' = FM.size m-            m = FM.packVectorR v-    gBuildLookup _ _   name x       = typeMismatch name "Object" x+    -- we don't check size, so that duplicated keys are preserved+    gBuildLookup _ _ _ (Object v) = pure $! FM.packVectorR v+    gBuildLookup _ _ name x       = typeMismatch name "Object" x  -------------------------------------------------------------------------------- -- Constructors@@ -903,9 +901,10 @@ instance ToValue T.Text     where {{-# INLINE toValue #-}; toValue = String;} instance EncodeJSON T.Text where {{-# INLINE encodeJSON #-}; encodeJSON = JB.string;} +-- | Note this instance doesn't reject large input instance FromValue Scientific where {{-# INLINE fromValue #-}; fromValue = withScientific "Scientific" pure;} instance ToValue Scientific where {{-# INLINE toValue #-}; toValue = Number;}-instance EncodeJSON Scientific where {{-# INLINE encodeJSON #-}; encodeJSON = B.scientific;}+instance EncodeJSON Scientific where {{-# INLINE encodeJSON #-}; encodeJSON = JB.scientific;}  -- | default instance prefer later key instance FromValue a => FromValue (FM.FlatMap T.Text a) where@@ -956,7 +955,7 @@ instance ToValue a => ToValue (FIM.FlatIntMap a) where     {-# INLINE toValue #-}     toValue = Object . V.map' toKV . FIM.sortedKeyValues-      where toKV (V.IPair i x) = let !k = T.buildText (T.int i)+      where toKV (V.IPair i x) = let !k = T.toText i                                      !v = toValue x                                  in (k, v) instance EncodeJSON a => EncodeJSON (FIM.FlatIntMap a) where@@ -986,7 +985,7 @@     toValue = Array . V.map toValue instance EncodeJSON a => EncodeJSON (A.Array a) where     {-# INLINE encodeJSON #-}-    encodeJSON = B.square . commaVec'+    encodeJSON = B.square . commaSepVec  instance FromValue a => FromValue (A.SmallArray a) where     {-# INLINE fromValue #-}@@ -997,7 +996,7 @@     toValue = Array . V.map toValue instance EncodeJSON a => EncodeJSON (A.SmallArray a) where     {-# INLINE encodeJSON #-}-    encodeJSON = B.square . commaVec'+    encodeJSON = B.square . commaSepVec  instance (Prim a, FromValue a) => FromValue (A.PrimArray a) where     {-# INLINE fromValue #-}@@ -1008,7 +1007,7 @@     toValue = Array . V.map toValue instance (Prim a, EncodeJSON a) => EncodeJSON (A.PrimArray a) where     {-# INLINE encodeJSON #-}-    encodeJSON = B.square . commaVec'+    encodeJSON = B.square . commaSepVec  instance FromValue A.ByteArray where     {-# INLINE fromValue #-}@@ -1024,7 +1023,7 @@ instance EncodeJSON A.ByteArray where     {-# INLINE encodeJSON #-}     encodeJSON (A.ByteArray ba#) =-        B.square (commaVec' (A.PrimArray ba# :: A.PrimArray Word8))+        B.square (commaSepVec (A.PrimArray ba# :: A.PrimArray Word8))  instance (A.PrimUnlifted a, FromValue a) => FromValue (A.UnliftedArray a) where     {-# INLINE fromValue #-}@@ -1035,7 +1034,7 @@     toValue = Array . V.map toValue instance (A.PrimUnlifted a, EncodeJSON a) => EncodeJSON (A.UnliftedArray a) where     {-# INLINE encodeJSON #-}-    encodeJSON = B.square . commaVec'+    encodeJSON = B.square . commaSepVec  instance FromValue a => FromValue (V.Vector a) where     {-# INLINE fromValue #-}@@ -1046,7 +1045,7 @@     toValue = Array . V.map toValue instance EncodeJSON a => EncodeJSON (V.Vector a) where     {-# INLINE encodeJSON #-}-    encodeJSON = B.square . commaVec'+    encodeJSON = B.square . commaSepVec  instance (Prim a, FromValue a) => FromValue (V.PrimVector a) where     {-# INLINE fromValue #-}@@ -1057,7 +1056,7 @@     toValue = Array . V.map toValue instance (Prim a, EncodeJSON a) => EncodeJSON (V.PrimVector a) where     {-# INLINE encodeJSON #-}-    encodeJSON = B.square . commaVec'+    encodeJSON = B.square . commaSepVec  instance (Eq a, Hashable a, FromValue a) => FromValue (HS.HashSet a) where     {-# INLINE fromValue #-}@@ -1080,7 +1079,7 @@     toValue = Array . V.pack . map toValue instance EncodeJSON a => EncodeJSON [a] where     {-# INLINE encodeJSON #-}-    encodeJSON = B.square . commaList'+    encodeJSON = B.square . commaSepList  instance FromValue a => FromValue (NonEmpty a) where     {-# INLINE fromValue #-}@@ -1177,7 +1176,7 @@     fromValue = withBoundedScientific "Integer" $ \ n ->         case Scientific.floatingOrInteger n :: Either Double Integer of             Right x -> pure x-            Left _  -> fail' . T.buildText $ do+            Left _  -> fail' . B.unsafeBuildText $ do                 "converting Integer failed, unexpected floating number "                 T.scientific n instance ToValue Integer where@@ -1191,12 +1190,12 @@     {-# INLINE fromValue #-}     fromValue = withBoundedScientific "Natural" $ \ n ->         if n < 0-        then fail' . T.buildText $ do+        then fail' . B.unsafeBuildText $ do                 "converting Natural failed, unexpected negative number "                 T.scientific n         else case Scientific.floatingOrInteger n :: Either Double Natural of             Right x -> pure x-            Left _  -> fail' . T.buildText $ do+            Left _  -> fail' . B.unsafeBuildText $ do                 "converting Natural failed, unexpected floating number "                 T.scientific n instance ToValue Natural where@@ -1244,7 +1243,7 @@     fromValue (Number x) =         case toBoundedInteger x of             Just i -> return (ExitFailure i)-            _      -> fail' . T.buildText $ do+            _      -> fail' . B.unsafeBuildText $ do                 "converting ExitCode failed, value is either floating or will cause over or underflow: "                 T.scientific x     fromValue _ =  fail' "converting ExitCode failed, expected a string or number"
Z/Data/JSON/Builder.hs view
@@ -18,18 +18,20 @@   , array   , array'   , string+  , scientific     -- * Builder helpers   , kv, kv'     -- * Re-export 'Value' type   , Value(..)   ) where +import           Control.Monad import qualified Z.Data.Builder                 as B import qualified Z.Data.Text                    as T import qualified Z.Data.Text.ShowT              as T import           Z.Data.Vector.Base             as V import           Z.Data.JSON.Value              (Value(..))-+import           Data.Scientific              (Scientific, base10Exponent, coefficient)  -- | Use @:@ as separator to connect a label(no need to escape, only add quotes) with field builders. kv :: T.Text -> B.Builder () -> B.Builder ()@@ -47,7 +49,7 @@ value (Object kvs) = object kvs value (Array vs) = array vs value (String t) = string t-value (Number n) = B.scientific n+value (Number n) = scientific n value (Bool True) = "true" value (Bool False) = "false" value Null = "null"@@ -85,3 +87,16 @@ string :: T.Text -> B.Builder () {-# INLINE string #-} string = T.escapeTextJSON++-- | This builder try to render integer when (0 <= e < 1024), and scientific notation otherwise.+scientific :: Scientific -> B.Builder ()+{-# INLINE scientific #-}+scientific s+    | e < 0 || e >= 1024 = B.scientific s+    | e == 0 = B.integer c+    | otherwise = do+        B.integer c+        when (c /= 0) (replicateM_ e (B.encodePrim B.ZERO))+  where+    e = base10Exponent s+    c = coefficient s
Z/Data/JSON/Value.hs view
@@ -91,7 +91,8 @@            | Number {-# UNPACK #-} !Scientific            | Bool   !Bool            | Null-         deriving (Eq, Show, Typeable, Generic, ShowT)+         deriving (Eq, Show, Typeable, Generic)+         deriving anyclass ShowT  instance NFData Value where     {-# INLINE rnf #-}
Z/Data/Parser/Numeric.hs view
@@ -44,6 +44,8 @@ import qualified Data.Scientific          as Sci import           Data.Word import qualified Z.Data.Builder.Numeric as B+import           Z.Data.Builder.Numeric (pattern PLUS, pattern MINUS, pattern ZERO,+                                         pattern DOT, pattern LITTLE_E, pattern BIG_E) import           Z.Data.Parser.Base     (Parser, (<?>)) import qualified Z.Data.Parser.Base     as P import qualified Z.Data.Vector.Base     as V@@ -52,12 +54,6 @@ #define WORD64_MAX_DIGITS_LEN 19 #define INT64_MAX_DIGITS_LEN 18 -#define PLUS     43-#define MINUS    45-#define DOT      46-#define LITTLE_E 101-#define BIG_E    69-#define C_0 48  -- | Parse and decode an unsigned hex number, fail in case of overflow. The hex digits -- @\'a\'@ through @\'f\'@ may be upper or lower case.@@ -409,7 +405,7 @@     !sign <- P.peek     when (sign == MINUS) (P.skipWord8) -- no leading plus is allowed     !intPart <- P.takeWhile1 isDigit-    when (V.length intPart > 1 && V.head intPart == C_0) (P.fail' "leading zeros are not allowed")+    when (V.length intPart > 1 && V.head intPart == ZERO) (P.fail' "leading zeros are not allowed")     mdot <- P.peekMaybe     !sci <- case mdot of         Just DOT -> do
Z/Data/Text/Base.hs view
@@ -764,8 +764,8 @@ if it is unstable. If the result is MAYBE, the string does not necessarily have to be normalized. -For more information, please review [Unicode Standard Annex #15 - Unicode-Normalization Forms](http://www.unicode.org/reports/tr15/).+For more information, please review <http://www.unicode.org/reports/tr15/ Unicode Standard Annex #15 - Unicode+Normalization Forms>. -} isNormalizedTo :: NormalizeMode -> Text -> NormalizationResult isNormalizedTo nmode (Text (V.PrimVector (PrimArray arr#) (I# s#) l@(I# l#)))@@ -895,7 +895,7 @@ Certain code points (or combinations of code points) apply rules based on the locale. For more information about these exceptional code points, please refer to the Unicode standard:-ftp://ftp.unicode.org/Public/UNIDATA/SpecialCasing.txt+<ftp://ftp.unicode.org/Public/UNIDATA/SpecialCasing.txt> -} toLowerWith :: Locale -> Text -> Text toLowerWith locale (Text (V.PrimVector (PrimArray arr#) (I# s#) l@(I# l#)))@@ -933,7 +933,7 @@ Certain code points (or combinations of code points) apply rules based on the locale. For more information about these exceptional code points, please refer to the Unicode standard:-ftp://ftp.unicode.org/Public/UNIDATA/SpecialCasing.txt+<ftp://ftp.unicode.org/Public/UNIDATA/SpecialCasing.txt> -} toUpperWith :: Locale -> Text -> Text toUpperWith locale (Text (V.PrimVector (PrimArray arr#) (I# s#) l@(I# l#)))@@ -983,7 +983,7 @@ Certain code points (or combinations of code points) apply rules based on the locale. For more information about these exceptional code points, please refer to the Unicode standard:-ftp://ftp.unicode.org/Public/UNIDATA/SpecialCasing.txt+<ftp://ftp.unicode.org/Public/UNIDATA/SpecialCasing.txt> -}  toTitleWith :: Locale -> Text -> Text
Z/Data/Text/ShowT.hs view
@@ -7,51 +7,55 @@ Stability   : experimental Portability : non-portable -Base on UTF8 compatible textual builders from 'Z.Data.Builder', we provide a newtype wrapper-'TextBuilder' which can be directly used to build 'Text'.+This module re-exports some UTF8 compatible textual builders from 'Z.Data.Builder'. -We also provide faster alternative to 'Show' class, i.e. 'ShowT', which also provides 'Generic'-based instances deriving.+We also provide a faster alternative to 'Show' class, i.e. 'ShowT', which can be deriving using 'Generic'.+For example to use 'ShowT' class: +@+{-# LANGUAGE DeriveGeneric, DeriveAnyClass, DerivingStrategies #-}++import qualified Z.Data.Text.ShowT as T++data Foo = Bar Bytes | Qux Text Int deriving Generic+                                    deriving anyclass T.ShowT++@+ -}  module Z.Data.Text.ShowT   ( -- * ShowT class-    ShowT(..), showT, toBuilder, toBytes, toString-  -- * Textual Builder-  , TextBuilder-  , getBuilder-  , unsafeFromBuilder-  , buildText+    ShowT(..), toText, toString, toUTF8Builder, toUTF8Bytes   -- * Basic UTF8 builders-  , stringUTF8, charUTF8, string7, char7, text, escapeTextJSON+  , escapeTextJSON+  , B.stringUTF8, B.charUTF8, B.string7, B.char7, B.text   -- * Numeric builders   -- ** Integral type formatting   , B.IFormat(..)   , B.defaultIFormat   , B.Padding(..)-  , int-  , intWith-  , integer+  , B.int+  , B.intWith+  , B.integer   -- ** Fixded size hexidecimal formatting-  , hex, heX+  , B.hex, B.hexUpper   -- ** IEEE float formating   , B.FFormat(..)-  , double-  , doubleWith-  , float-  , floatWith-  , scientific-  , scientificWith-  -- * Builder helpers-  , paren, parenWhen, curly, square, angle, quotes, squotes, colon, comma, intercalateVec, intercalateList+  , B.double+  , B.doubleWith+  , B.float+  , B.floatWith+  , B.scientific+  , B.scientificWith+  -- * Helpers+  , B.paren, B.curly, B.square, B.angle, B.quotes, B.squotes+  , B.colon, B.comma, B.intercalateVec, B.intercalateList+  , parenWhen   ) where  import           Control.Monad-import           Control.Monad.ST.Unsafe        (unsafeIOToST) import qualified Data.Scientific                as Sci-import           Data.String-import           Data.Bits import           Data.Fixed import           Data.Primitive.PrimArray import           Data.Functor.Compose@@ -76,7 +80,6 @@ import           GHC.Word import           Data.Version import           System.Exit-import           Test.QuickCheck.Arbitrary (Arbitrary(..), CoArbitrary(..)) import           Data.Primitive.Types import qualified Z.Data.Builder.Base            as B import qualified Z.Data.Builder.Numeric         as B@@ -87,241 +90,9 @@  #define DOUBLE_QUOTE 34 --- | Buidlers which guarantee UTF-8 encoding, thus can be used to build--- text directly.------ Notes on 'IsString' instance: It's recommended to use 'IsString' instance, there's a rewrite rule to--- turn encoding loop into a memcpy, which is much faster (the same rule also apply to 'stringUTF8').--- Different from @Builder ()@, @TextBuilder ()@'s 'IsString' instance will give you desired UTF8 guarantees:------ * @\NUL@ will be written directly as @\x00@.------ * @\xD800@ ~ @\xDFFF@ will be replaced by replacement char.----newtype TextBuilder a = TextBuilder { getBuilder :: B.Builder a }-    deriving newtype (Functor, Applicative, Monad)--deriving newtype instance Semigroup (TextBuilder ())-deriving newtype instance Monoid (TextBuilder ())--instance (a ~ ()) => IsString (TextBuilder a) where-    {-# INLINE fromString #-}-    fromString = TextBuilder <$> B.stringUTF8--instance Arbitrary (TextBuilder ()) where-    arbitrary = TextBuilder . B.text <$> arbitrary-    shrink b = TextBuilder . B.text <$> shrink (buildText b)--instance CoArbitrary (TextBuilder ()) where-    coarbitrary = coarbitrary . buildText--instance Show (TextBuilder a) where-    show = show . buildText--instance ShowT (TextBuilder a) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ b = quotes (void b)---- | Build a 'Text' using 'TextBuilder', which provide UTF-8 encoding guarantee.-buildText :: TextBuilder a -> Text-{-# INLINE buildText #-}-buildText = Text . B.buildBytes . getBuilder---- | Unsafely turn a 'B.Builder' into 'TextBuilder', thus it's user's responsibility to--- ensure only UTF-8 complied bytes are written.-unsafeFromBuilder :: B.Builder a -> TextBuilder a-{-# INLINE unsafeFromBuilder #-}-unsafeFromBuilder = TextBuilder- ------------------------------------------------------------------------------------ | Turn 'String' into 'TextBuilder' with UTF8 encoding------ Illegal codepoints will be written as 'T.replacementChar's. This function will be rewritten into a memcpy if possible, (running a fast UTF-8 validation at runtime first).-stringUTF8 :: String -> TextBuilder ()-{-# INLINE stringUTF8 #-}-stringUTF8 = TextBuilder . B.stringUTF8---- | Turn 'Char' into 'TextBuilder' with UTF8 encoding------ Illegal codepoints will be written as 'T.replacementChar's.-charUTF8 :: Char -> TextBuilder ()-{-# INLINE charUTF8 #-}-charUTF8 = TextBuilder . B.charUTF8---- | Turn 'String' into 'TextBuilder' with ASCII7 encoding------ Codepoints beyond @'\x7F'@ will be chopped.-string7 :: String -> TextBuilder ()-{-# INLINE string7 #-}-string7 = TextBuilder . B.string7---- | Turn 'Char' into 'TextBuilder' with ASCII7 encoding------ Codepoints beyond @'\x7F'@ will be chopped.-char7 :: Char -> TextBuilder ()-{-# INLINE char7 #-}-char7 = TextBuilder . B.char7---- | Write UTF8 encoded 'T.Text' using 'Builder'.------ Note, if you're trying to write string literals builders,--- please open 'OverloadedStrings' and use 'Builder's 'IsString' instance,--- it will be rewritten into a memcpy.-text :: T.Text -> TextBuilder ()-{-# INLINE text #-}-text = TextBuilder . B.text-------------------------------------------------------------------------------------- | @int = intWith defaultIFormat@-int :: (Integral a, Bounded a) => a -> TextBuilder ()-{-# INLINE int #-}-int = TextBuilder . B.int---- | Format a 'Bounded' 'Integral' type like @Int@ or @Word16@ into decimal ascii digits.-intWith :: (Integral a, Bounded a)-        => B.IFormat-        -> a-        -> TextBuilder ()-{-# INLINE intWith #-}-intWith fmt x = TextBuilder $ B.intWith fmt x---- | Format a 'Integer' into decimal ascii digits.-integer :: Integer -> TextBuilder ()-{-# INLINE integer #-}-integer = TextBuilder . B.integer---- | Format a 'FiniteBits' 'Integral' type into hex nibbles.-hex :: (FiniteBits a, Integral a) => a -> TextBuilder ()-{-# INLINE hex #-}-hex = TextBuilder . B.hex---- | The UPPERCASED version of 'hex'.-heX :: (FiniteBits a, Integral a) => a -> TextBuilder ()-{-# INLINE heX #-}-heX = TextBuilder . B.heX---- | Decimal encoding of an IEEE 'Float'.------ Using standard decimal notation for arguments whose absolute value lies--- between @0.1@ and @9,999,999@, and scientific notation otherwise.-float :: Float -> TextBuilder ()-{-# INLINE float #-}-float = TextBuilder . B.float---- | Format single-precision float using drisu3 with dragon4 fallback.-floatWith :: B.FFormat-          -> Maybe Int  -- ^ Number of decimal places to render.-          -> Float-          -> TextBuilder ()-{-# INLINE floatWith #-}-floatWith fmt ds x = TextBuilder (B.floatWith fmt ds x)----- | Decimal encoding of an IEEE 'Double'.------ Using standard decimal notation for arguments whose absolute value lies--- between @0.1@ and @9,999,999@, and scientific notation otherwise.-double :: Double -> TextBuilder ()-{-# INLINE double #-}-double = TextBuilder . B.double---- | Format double-precision float using drisu3 with dragon4 fallback.-doubleWith :: B.FFormat-           -> Maybe Int  -- ^ Number of decimal places to render.-           -> Double-           -> TextBuilder ()-{-# INLINE doubleWith #-}-doubleWith fmt ds x = TextBuilder (B.doubleWith fmt ds x)----- | A @Builder@ which renders a scientific number to full--- precision, using standard decimal notation for arguments whose--- absolute value lies between @0.1@ and @9,999,999@, and scientific--- notation otherwise.-scientific :: Sci.Scientific -> TextBuilder ()-{-# INLINE scientific #-}-scientific = TextBuilder . B.scientific---- | Like 'scientific' but provides rendering options.-scientificWith :: B.FFormat-               -> Maybe Int  -- ^ Number of decimal places to render.-               -> Sci.Scientific-               -> TextBuilder ()-{-# INLINE scientificWith #-}-scientificWith fmt ds x = TextBuilder (B.scientificWith fmt ds x)-------------------------------------------------------------------------------------- | add @(...)@ to original builder.-paren :: TextBuilder () -> TextBuilder ()-{-# INLINE paren #-}-paren (TextBuilder b) = TextBuilder (B.paren b)---- | Add "(..)" around builders when condition is met, otherwise add nothing.------ This is useful when defining 'ShowT' instances.-parenWhen :: Bool -> TextBuilder () -> TextBuilder ()-{-# INLINE parenWhen #-}-parenWhen True b = paren b-parenWhen _    b = b---- | add @{...}@ to original builder.-curly :: TextBuilder () -> TextBuilder ()-{-# INLINE curly #-}-curly (TextBuilder b) = TextBuilder (B.curly b)---- | add @[...]@ to original builder.-square :: TextBuilder () -> TextBuilder ()-{-# INLINE square #-}-square (TextBuilder b) = TextBuilder (B.square b)---- | add @<...>@ to original builder.-angle :: TextBuilder () -> TextBuilder ()-{-# INLINE angle #-}-angle (TextBuilder b) = TextBuilder (B.angle b)---- | add @"..."@ to original builder.-quotes :: TextBuilder () -> TextBuilder ()-{-# INLINE quotes #-}-quotes (TextBuilder b) = TextBuilder (B.quotes b)---- | add @'...'@ to original builder.-squotes :: TextBuilder () -> TextBuilder ()-{-# INLINE squotes #-}-squotes (TextBuilder b) = TextBuilder (B.squotes b)---- | write an ASCII @:@-colon ::  TextBuilder ()-{-# INLINE colon #-}-colon = TextBuilder B.colon---- | write an ASCII @,@-comma ::  TextBuilder ()-{-# INLINE comma #-}-comma = TextBuilder B.comma---- | Use separator to connect a vector of builders.-intercalateVec :: (V.Vec v a)-               => TextBuilder ()            -- ^ the seperator-               -> (a -> TextBuilder ())     -- ^ value formatter-               -> v a                       -- ^ value list-               ->  TextBuilder ()-{-# INLINE intercalateVec #-}-intercalateVec (TextBuilder s) f = TextBuilder . B.intercalateVec s (getBuilder . f)---- | Use separator to connect a list of builders.-intercalateList :: TextBuilder ()           -- ^ the seperator-                -> (a -> TextBuilder ())    -- ^ value formatter-                -> [a]                      -- ^ value vector-                -> TextBuilder ()-{-# INLINE intercalateList #-}-intercalateList (TextBuilder s) f = TextBuilder . B.intercalateList s (getBuilder . f)---------------------------------------------------------------------------------- -- Data types---+ -- | A class similar to 'Show', serving the purpose that quickly convert a data type to a 'Text' value. -- -- You can use newtype or generic deriving to implement instance of this class quickly:@@ -337,155 +108,169 @@ --  newtype FooInt = FooInt Int deriving (Generic) --                            deriving anyclass ShowT ----- > showT (FooInt 3)+-- > toText (FooInt 3) -- > "FooInt 3" -- --  newtype FooInt = FooInt Int deriving (Generic) --                            deriving newtype ShowT ----- > showT (FooInt 3)+-- > toText (FooInt 3) -- > "3" -- @ -- class ShowT a where-    toTextBuilder :: Int -> a  -> TextBuilder ()-    default toTextBuilder :: (Generic a, GToText (Rep a)) => Int -> a -> TextBuilder ()-    toTextBuilder p = gToTextBuilder p . from+    -- | Convert data to 'B.Builder' with precendence.+    --+    -- You should return a 'B.Builder' writing in UTF8 encoding only, i.e.+    --+    -- @Z.Data.Text.validateMaybe (Z.Data.Builder.buildBytes (toUTF8BuilderP p a)) /= Nothing@+    toUTF8BuilderP :: Int -> a  -> B.Builder () -class GToText f where-    gToTextBuilder :: Int -> f a -> TextBuilder ()+    default toUTF8BuilderP :: (Generic a, GToText (Rep a)) => Int -> a -> B.Builder ()+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP p = gToUTF8BuilderP p . from +-- | Convert data to 'B.Builder'.+toUTF8Builder :: ShowT a => a  -> B.Builder ()+{-# INLINE toUTF8Builder #-}+toUTF8Builder = toUTF8BuilderP 0 +-- | Convert data to 'V.Bytes' in UTF8 encoding.+toUTF8Bytes :: ShowT a => a -> V.Bytes+{-# INLINE toUTF8Bytes #-}+toUTF8Bytes = B.buildBytes . toUTF8BuilderP 0++-- | Convert data to 'Text'.+toText :: ShowT a => a -> Text+{-# INLINE toText #-}+toText = Text . toUTF8Bytes++-- | Convert data to 'String', faster 'show' replacement.+toString :: ShowT a => a -> String+{-# INLINE toString #-}+toString = T.unpack . toText++class GToText f where+    gToUTF8BuilderP :: Int -> f a -> B.Builder ()+ class GFieldToText f where-    gFieldToTextBuilder :: B.Builder () -> Int -> f a -> B.Builder ()+    gFieldToUTF8BuilderP :: B.Builder () -> Int -> f a -> B.Builder ()  instance (GFieldToText a, GFieldToText b) => GFieldToText (a :*: b) where-    {-# INLINE gFieldToTextBuilder #-}-    gFieldToTextBuilder sep p (a :*: b) =-        gFieldToTextBuilder sep p a >> sep >> gFieldToTextBuilder sep p b+    {-# INLINE gFieldToUTF8BuilderP #-}+    gFieldToUTF8BuilderP sep p (a :*: b) =+        gFieldToUTF8BuilderP sep p a >> sep >> gFieldToUTF8BuilderP sep p b  instance (GToText f) => GFieldToText (S1 (MetaSel Nothing u ss ds) f) where-    {-# INLINE gFieldToTextBuilder #-}-    gFieldToTextBuilder _ p (M1 x) = getBuilder (gToTextBuilder p x)+    {-# INLINE gFieldToUTF8BuilderP #-}+    gFieldToUTF8BuilderP _ p (M1 x) = gToUTF8BuilderP p x  instance (GToText f, Selector (MetaSel (Just l) u ss ds)) => GFieldToText (S1 (MetaSel (Just l) u ss ds) f) where-    {-# INLINE gFieldToTextBuilder #-}-    gFieldToTextBuilder _ _ m1@(M1 x) =-        B.stringModifiedUTF8 (selName m1) >> " = " >> getBuilder (gToTextBuilder 0 x)+    {-# INLINE gFieldToUTF8BuilderP #-}+    gFieldToUTF8BuilderP _ _ m1@(M1 x) =+        B.stringModifiedUTF8 (selName m1) >> " = " >> gToUTF8BuilderP 0 x  instance GToText V1 where-    {-# INLINE gToTextBuilder #-}-    gToTextBuilder _ = error "Z.Data.TextBuilder: empty data type"+    {-# INLINE gToUTF8BuilderP #-}+    gToUTF8BuilderP _ = error "Z.Data.Text.ShowT: empty data type"  instance (GToText f, GToText g) => GToText (f :+: g) where-    {-# INLINE gToTextBuilder #-}-    gToTextBuilder p (L1 x) = gToTextBuilder p x-    gToTextBuilder p (R1 x) = gToTextBuilder p x+    {-# INLINE gToUTF8BuilderP #-}+    gToUTF8BuilderP p (L1 x) = gToUTF8BuilderP p x+    gToUTF8BuilderP p (R1 x) = gToUTF8BuilderP p x  -- | Constructor without payload, convert to String instance (Constructor c) => GToText (C1 c U1) where-    {-# INLINE gToTextBuilder #-}-    gToTextBuilder _ m1 =-        TextBuilder . B.stringModifiedUTF8 $ conName m1+    {-# INLINE gToUTF8BuilderP #-}+    gToUTF8BuilderP _ m1 = B.stringModifiedUTF8 $ conName m1  -- | Constructor with payloads instance (GFieldToText (S1 sc f), Constructor c) => GToText (C1 c (S1 sc f)) where-    {-# INLINE gToTextBuilder #-}-    gToTextBuilder p m1@(M1 x) =-        parenWhen (p > 10) . TextBuilder $ do+    {-# INLINE gToUTF8BuilderP #-}+    gToUTF8BuilderP p m1@(M1 x) =+        parenWhen (p > 10) $ do             B.stringModifiedUTF8 $ conName m1             B.char8 ' '             if conIsRecord m1-            then B.curly $ gFieldToTextBuilder (B.char7 ',' >> B.char7 ' ') p x-            else gFieldToTextBuilder (B.char7 ' ') 11 x+            then B.curly $ gFieldToUTF8BuilderP (B.char7 ',' >> B.char7 ' ') p x+            else gFieldToUTF8BuilderP (B.char7 ' ') 11 x  instance (GFieldToText (a :*: b), Constructor c) => GToText (C1 c (a :*: b)) where-    {-# INLINE gToTextBuilder #-}-    gToTextBuilder p m1@(M1 x) =+    {-# INLINE gToUTF8BuilderP #-}+    gToUTF8BuilderP p m1@(M1 x) =         case conFixity m1 of-            Prefix -> parenWhen (p > 10) . TextBuilder $ do+            Prefix -> parenWhen (p > 10) $ do                 B.stringModifiedUTF8 $ conName m1                 B.char8 ' '                 if conIsRecord m1-                then B.curly $ gFieldToTextBuilder (B.char7 ',' >> B.char7 ' ') p x-                else gFieldToTextBuilder (B.char7 ' ') 11 x-            Infix _ p' -> parenWhen (p > p') . TextBuilder $ do-                gFieldToTextBuilder+                then B.curly $ gFieldToUTF8BuilderP (B.char7 ',' >> B.char7 ' ') p x+                else gFieldToUTF8BuilderP (B.char7 ' ') 11 x+            Infix _ p' -> parenWhen (p > p') $ do+                gFieldToUTF8BuilderP                     (B.char8 ' ' >> B.stringModifiedUTF8 (conName m1) >> B.char8 ' ') (p'+1) x  instance ShowT a => GToText (K1 i a) where-    {-# INLINE gToTextBuilder #-}-    gToTextBuilder p (K1 x) = toTextBuilder p x+    {-# INLINE gToUTF8BuilderP #-}+    gToUTF8BuilderP p (K1 x) = toUTF8BuilderP p x +-- | Add "(..)" around builders when condition is met, otherwise add nothing.+--+-- This is useful when defining 'ShowT' instances.+parenWhen :: Bool -> B.Builder () -> B.Builder ()+{-# INLINE parenWhen #-}+parenWhen True b = B.paren b+parenWhen _    b = b+ -------------------------------------------------------------------------------- -- Data types instance GToText f => GToText (D1 c f) where-    {-# INLINE gToTextBuilder #-}-    gToTextBuilder p (M1 x) = gToTextBuilder p x---- | Directly convert data to 'Text'.-showT :: ShowT a => a -> Text-{-# INLINE showT #-}-showT = buildText .  toTextBuilder 0---- | Directly convert data to 'B.Builder'.-toBuilder :: ShowT a => a -> B.Builder ()-{-# INLINE toBuilder #-}-toBuilder = getBuilder . toTextBuilder 0---- | Directly convert data to 'V.Bytes'.-toBytes :: ShowT a => a -> V.Bytes-{-# INLINE toBytes #-}-toBytes = B.buildBytes .  toBuilder---- | Faster 'show' replacement.-toString :: ShowT a => a -> String-{-# INLINE toString #-}-toString = T.unpack . showT+    {-# INLINE gToUTF8BuilderP #-}+    gToUTF8BuilderP p (M1 x) = gToUTF8BuilderP p x  instance ShowT Bool where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ True = TextBuilder "True"-    toTextBuilder _ _    = TextBuilder "False"+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ True = "True"+    toUTF8BuilderP _ _    = "False" + instance ShowT Char where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ = TextBuilder . B.string8 . show+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ = B.string8 . show -instance ShowT Double where {{-# INLINE toTextBuilder #-}; toTextBuilder _ = double;}-instance ShowT Float  where {{-# INLINE toTextBuilder #-}; toTextBuilder _ = float;}+instance ShowT Double where {{-# INLINE toUTF8BuilderP #-}; toUTF8BuilderP _ = B.double;}+instance ShowT Float  where {{-# INLINE toUTF8BuilderP #-}; toUTF8BuilderP _ = B.float;} -instance ShowT Int     where {{-# INLINE toTextBuilder #-}; toTextBuilder _ = int;}-instance ShowT Int8    where {{-# INLINE toTextBuilder #-}; toTextBuilder _ = int;}-instance ShowT Int16   where {{-# INLINE toTextBuilder #-}; toTextBuilder _ = int;}-instance ShowT Int32   where {{-# INLINE toTextBuilder #-}; toTextBuilder _ = int;}-instance ShowT Int64   where {{-# INLINE toTextBuilder #-}; toTextBuilder _ = int;}-instance ShowT Word     where {{-# INLINE toTextBuilder #-}; toTextBuilder _ = int;}-instance ShowT Word8    where {{-# INLINE toTextBuilder #-}; toTextBuilder _ = int;}-instance ShowT Word16   where {{-# INLINE toTextBuilder #-}; toTextBuilder _ = int;}-instance ShowT Word32   where {{-# INLINE toTextBuilder #-}; toTextBuilder _ = int;}-instance ShowT Word64   where {{-# INLINE toTextBuilder #-}; toTextBuilder _ = int;}+instance ShowT Int     where {{-# INLINE toUTF8BuilderP #-}; toUTF8BuilderP _ = B.int;}+instance ShowT Int8    where {{-# INLINE toUTF8BuilderP #-}; toUTF8BuilderP _ = B.int;}+instance ShowT Int16   where {{-# INLINE toUTF8BuilderP #-}; toUTF8BuilderP _ = B.int;}+instance ShowT Int32   where {{-# INLINE toUTF8BuilderP #-}; toUTF8BuilderP _ = B.int;}+instance ShowT Int64   where {{-# INLINE toUTF8BuilderP #-}; toUTF8BuilderP _ = B.int;}+instance ShowT Word    where {{-# INLINE toUTF8BuilderP #-}; toUTF8BuilderP _ = B.int;}+instance ShowT Word8   where {{-# INLINE toUTF8BuilderP #-}; toUTF8BuilderP _ = B.int;}+instance ShowT Word16  where {{-# INLINE toUTF8BuilderP #-}; toUTF8BuilderP _ = B.int;}+instance ShowT Word32  where {{-# INLINE toUTF8BuilderP #-}; toUTF8BuilderP _ = B.int;}+instance ShowT Word64  where {{-# INLINE toUTF8BuilderP #-}; toUTF8BuilderP _ = B.int;} -instance ShowT Integer  where {{-# INLINE toTextBuilder #-}; toTextBuilder _ = integer;}-instance ShowT Natural  where {{-# INLINE toTextBuilder #-}; toTextBuilder _ = integer . fromIntegral}+instance ShowT Integer  where {{-# INLINE toUTF8BuilderP #-}; toUTF8BuilderP _ = B.integer;}+instance ShowT Natural  where {{-# INLINE toUTF8BuilderP #-}; toUTF8BuilderP _ = B.integer . fromIntegral} instance ShowT Ordering where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ GT = TextBuilder "GT"-    toTextBuilder _ EQ = TextBuilder "EQ"-    toTextBuilder _ _  = TextBuilder "LT"+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ GT = "GT"+    toUTF8BuilderP _ EQ = "EQ"+    toUTF8BuilderP _ _  = "LT"  instance ShowT () where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ () = TextBuilder "()"+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ () = "()"  instance ShowT Version where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ = stringUTF8 . show+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ = B.stringUTF8 . show  -- | The escaping rules is same with 'Show' instance: we reuse JSON escaping rules here, so it will be faster. instance ShowT Text where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ = TextBuilder . escapeTextJSON+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ = escapeTextJSON  -- | Escape text using JSON string escaping rules and add double quotes, escaping rules: --@@ -504,16 +289,14 @@ escapeTextJSON :: T.Text -> B.Builder () {-# INLINE escapeTextJSON #-} escapeTextJSON (T.Text (V.PrimVector ba@(PrimArray ba#) s l)) = do-    let siz = escape_json_string_length ba# s l-    B.ensureN siz-    B.Builder (\ _  k (B.Buffer mba@(MutablePrimArray mba#) i) -> do+    let !siz = escape_json_string_length ba# s l+    B.writeN siz (\ mba@(MutablePrimArray mba#) i -> do         if siz == l+2   -- no need to escape         then do             writePrimArray mba i DOUBLE_QUOTE             copyPrimArray mba (i+1) ba s l             writePrimArray mba (i+1+l) DOUBLE_QUOTE-        else void $ unsafeIOToST (escape_json_string ba# s l (unsafeCoerce# mba#) i)-        k () (B.Buffer mba (i+siz)))+        else void (escape_json_string ba# s l (unsafeCoerce# mba#) i))  foreign import ccall unsafe escape_json_string_length     :: ByteArray# -> Int -> Int -> Int@@ -522,108 +305,106 @@     :: ByteArray# -> Int -> Int -> MutableByteArray# RealWorld -> Int -> IO Int  instance ShowT Sci.Scientific where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ = scientific+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ = B.scientific  instance ShowT a => ShowT [a] where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ = square . intercalateList comma (toTextBuilder 0)+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ = B.square . B.intercalateList B.comma (toUTF8BuilderP 0)  instance ShowT a => ShowT (A.Array a) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ = square . intercalateVec comma (toTextBuilder 0)+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ = B.square . B.intercalateVec B.comma (toUTF8BuilderP 0)  instance ShowT a => ShowT (A.SmallArray a) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ = square . intercalateVec comma (toTextBuilder 0)+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ = B.square . B.intercalateVec B.comma (toUTF8BuilderP 0)  instance (A.PrimUnlifted a, ShowT a) => ShowT (A.UnliftedArray a) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ = square . intercalateVec comma (toTextBuilder 0)+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ = B.square . B.intercalateVec B.comma (toUTF8BuilderP 0)  instance (Prim a, ShowT a) => ShowT (A.PrimArray a) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ = square . intercalateVec comma (toTextBuilder 0)+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ = B.square . B.intercalateVec B.comma (toUTF8BuilderP 0)  instance ShowT a => ShowT (V.Vector a) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ = square . intercalateVec comma (toTextBuilder 0)+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ = B.square . B.intercalateVec B.comma (toUTF8BuilderP 0)  instance (Prim a, ShowT a) => ShowT (V.PrimVector a) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ = square . intercalateVec comma (toTextBuilder 0)+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ = B.square . B.intercalateVec B.comma (toUTF8BuilderP 0)  instance (ShowT a, ShowT b) => ShowT (a, b) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ (a, b) = paren $  toTextBuilder 0 a-                     >> comma >> toTextBuilder 0 b+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ (a, b) = B.paren $  toUTF8BuilderP 0 a+                     >> B.comma >> toUTF8BuilderP 0 b  instance (ShowT a, ShowT b, ShowT c) => ShowT (a, b, c) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ (a, b, c) = paren $  toTextBuilder 0 a-                     >> comma >> toTextBuilder 0 b-                     >> comma >> toTextBuilder 0 c+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ (a, b, c) = B.paren $  toUTF8BuilderP 0 a+                     >> B.comma >> toUTF8BuilderP 0 b+                     >> B.comma >> toUTF8BuilderP 0 c  instance (ShowT a, ShowT b, ShowT c, ShowT d) => ShowT (a, b, c, d) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ (a, b, c, d) = paren $  toTextBuilder 0 a-                     >> comma >> toTextBuilder 0 b-                     >> comma >> toTextBuilder 0 c-                     >> comma >> toTextBuilder 0 d+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ (a, b, c, d) = B.paren $  toUTF8BuilderP 0 a+                     >> B.comma >> toUTF8BuilderP 0 b+                     >> B.comma >> toUTF8BuilderP 0 c+                     >> B.comma >> toUTF8BuilderP 0 d  instance (ShowT a, ShowT b, ShowT c, ShowT d, ShowT e) => ShowT (a, b, c, d, e) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ (a, b, c, d, e) = paren $  toTextBuilder 0 a-                     >> comma >> toTextBuilder 0 b-                     >> comma >> toTextBuilder 0 c-                     >> comma >> toTextBuilder 0 d-                     >> comma >> toTextBuilder 0 e+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ (a, b, c, d, e) = B.paren $  toUTF8BuilderP 0 a+                     >> B.comma >> toUTF8BuilderP 0 b+                     >> B.comma >> toUTF8BuilderP 0 c+                     >> B.comma >> toUTF8BuilderP 0 d+                     >> B.comma >> toUTF8BuilderP 0 e  instance (ShowT a, ShowT b, ShowT c, ShowT d, ShowT e, ShowT f) => ShowT (a, b, c, d, e, f) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ (a, b, c, d, e, f) = paren $  toTextBuilder 0 a-                     >> comma >> toTextBuilder 0 b-                     >> comma >> toTextBuilder 0 c-                     >> comma >> toTextBuilder 0 d-                     >> comma >> toTextBuilder 0 e-                     >> comma >> toTextBuilder 0 f+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ (a, b, c, d, e, f) = B.paren $  toUTF8BuilderP 0 a+                     >> B.comma >> toUTF8BuilderP 0 b+                     >> B.comma >> toUTF8BuilderP 0 c+                     >> B.comma >> toUTF8BuilderP 0 d+                     >> B.comma >> toUTF8BuilderP 0 e+                     >> B.comma >> toUTF8BuilderP 0 f  instance (ShowT a, ShowT b, ShowT c, ShowT d, ShowT e, ShowT f, ShowT g) => ShowT (a, b, c, d, e, f, g) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ (a, b, c, d, e, f, g) = paren $  toTextBuilder 0 a-                     >> comma >> toTextBuilder 0 b-                     >> comma >> toTextBuilder 0 c-                     >> comma >> toTextBuilder 0 d-                     >> comma >> toTextBuilder 0 e-                     >> comma >> toTextBuilder 0 f-                     >> comma >> toTextBuilder 0 g+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ (a, b, c, d, e, f, g) = B.paren $  toUTF8BuilderP 0 a+                     >> B.comma >> toUTF8BuilderP 0 b+                     >> B.comma >> toUTF8BuilderP 0 c+                     >> B.comma >> toUTF8BuilderP 0 d+                     >> B.comma >> toUTF8BuilderP 0 e+                     >> B.comma >> toUTF8BuilderP 0 f+                     >> B.comma >> toUTF8BuilderP 0 g  instance ShowT a => ShowT (Maybe a) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder p (Just x) = parenWhen (p > 10) $ do TextBuilder "Just "-                                                       toTextBuilder 11 x-    toTextBuilder _ _        = TextBuilder "Nothing"+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP p (Just x) = parenWhen (p > 10) $ "Just " >> toUTF8BuilderP 11 x+    toUTF8BuilderP _ _        = "Nothing"  instance (ShowT a, ShowT b) => ShowT (Either a b) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder p (Left x) = parenWhen (p > 10) $ do TextBuilder "Left "-                                                       toTextBuilder 11 x-    toTextBuilder p (Right x) = parenWhen (p > 10) $ do TextBuilder "Right "-                                                        toTextBuilder 11 x+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP p (Left x) = parenWhen (p > 10) $ "Left " >> toUTF8BuilderP 11 x+    toUTF8BuilderP p (Right x) = parenWhen (p > 10) $ "Right " >> toUTF8BuilderP 11 x  instance (ShowT a, Integral a) => ShowT (Ratio a) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder p r = parenWhen (p > 10) $ do toTextBuilder 8 (numerator r)-                                                TextBuilder " % "-                                                toTextBuilder 8 (denominator r)+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP p r = parenWhen (p > 10) $ do+        toUTF8BuilderP 8 (numerator r)+        " % "+        toUTF8BuilderP 8 (denominator r)  instance HasResolution a => ShowT (Fixed a) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ = TextBuilder . B.string8 .  show+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ = B.string8 .  show  instance ShowT CallStack where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ = TextBuilder . B.string8 .  show+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ = B.string8 .  show  deriving newtype instance ShowT CChar deriving newtype instance ShowT CSChar@@ -653,13 +434,13 @@ deriving newtype instance ShowT CDouble  instance ShowT (Ptr a) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ (Ptr a) =-        "0x" >> hex (W# (int2Word#(addr2Int# a)))+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ (Ptr a) =+        "0x" >> B.hex (W# (int2Word#(addr2Int# a))) instance ShowT (ForeignPtr a) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder _ (ForeignPtr a _) =-        "0x" >> hex (W# (int2Word#(addr2Int# a)))+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ (ForeignPtr a _) =+        "0x" >> B.hex (W# (int2Word#(addr2Int# a)))  deriving anyclass instance ShowT ExitCode
Z/Data/Text/UTF8Codec.hs view
@@ -36,9 +36,9 @@ -- | Encode a 'Char' into bytes, write 'replacementChar' for invalid unicode codepoint. -- -- This function assumed there're enough space for encoded bytes, and return the advanced index.-encodeChar :: MutablePrimArray s Word8 -> Int -> Char -> ST s Int+encodeChar :: PrimMonad m => MutablePrimArray (PrimState m) Word8 -> Int -> Char -> m Int {-# INLINE encodeChar #-}-encodeChar (MutablePrimArray mba#) (I# i#) (C# c#) = ST (\ s# ->+encodeChar (MutablePrimArray mba#) (I# i#) (C# c#) = primitive (\ s# ->     let !(# s1#, j# #) = encodeChar# mba# i# c# s# in (# s1#, I# j# #))  -- | The unboxed version of 'encodeChar'.
Z/Data/Vector/Base.hs view
@@ -61,7 +61,7 @@   -- * Searching by equality   , elem, notElem, elemIndex   -- * Misc-  , IPair(..), mapIPair'+  , IPair(..), mapIPair', fromIPair, toIPair   , defaultInitSize   , chunkOverhead   , defaultChunkSize@@ -488,6 +488,7 @@ -- | 'Bytes' is just primitive word8 vectors. type Bytes = PrimVector Word8 +-- | This instance use 'packASCII', which may silently chop bytes, use it with ASCII literals only. instance (a ~ Word8) => IsString (PrimVector a) where     {-# INLINE fromString #-}     fromString = packASCII@@ -528,7 +529,7 @@ w2c (W8# w#) = C# (chr# (word2Int# w#))  -- | Unsafe conversion between 'Char' and 'Word8'. This is a no-op and--- silently truncates to 8 bits Chars > '\255'. It is provided as+-- silently truncates to 8 bits Chars > @\\255@. It is provided as -- convenience for PrimVector construction. c2w :: Char -> Word8 {-# INLINE c2w #-}@@ -554,10 +555,10 @@ -- | Create a vector with a initial size N array (which may not be the final array). -- create' :: Vec v a-        => Int                                                      -- ^ length in elements of type @a@-        -> (forall s. MArr (IArray v) s a -> ST s (IPair (MArr (IArray v) s a)))  -- ^ initialization function-                                                                    --   return a result size and array-                                                                    --   the result must start from index 0+        => Int+        -- ^ length in elements of type @a@+        -> (forall s. MArr (IArray v) s a -> ST s (IPair (MArr (IArray v) s a)))+        -- ^ initialization function return a result size and array, the result must start from index 0         -> v a {-# INLINE create' #-} create' n0 fill = runST (do@@ -1241,11 +1242,11 @@ data IPair a = IPair { ifst :: {-# UNPACK #-}!Int, isnd :: a } deriving (Show, Eq, Ord)  instance (Arbitrary v) => Arbitrary (IPair v) where-    arbitrary = iPairFromTuple <$> arbitrary-    shrink v = iPairFromTuple <$> shrink (iPairToTuple v)+    arbitrary = toIPair <$> arbitrary+    shrink v = toIPair <$> shrink (fromIPair v)  instance (CoArbitrary v) => CoArbitrary (IPair v) where-    coarbitrary = coarbitrary . iPairToTuple+    coarbitrary = coarbitrary . fromIPair  instance Functor IPair where     {-# INLINE fmap #-}@@ -1260,15 +1261,15 @@ {-# INLINE mapIPair' #-} mapIPair' f (IPair i v) = let !v' = f v in IPair i v' -iPairToTuple :: IPair a -> (Int, a)-{-# INLINE iPairToTuple #-}-iPairToTuple (IPair i v) = (i, v)+fromIPair :: IPair a -> (Int, a)+{-# INLINE fromIPair #-}+fromIPair (IPair i v) = (i, v) -iPairFromTuple :: (Int, a) -> IPair a-{-# INLINE iPairFromTuple #-}-iPairFromTuple (i, v) = IPair i v+toIPair :: (Int, a) -> IPair a+{-# INLINE toIPair #-}+toIPair (i, v) = IPair i v --- | The chunk size used for I\/O. Currently set to @16k-chunkOverhead@+-- | The chunk size used for I\/O. Currently set to @16k - chunkOverhead@ defaultChunkSize :: Int {-# INLINE defaultChunkSize #-} defaultChunkSize = 16 * 1024 - chunkOverhead
+ Z/Data/Vector/Base64.hs view
@@ -0,0 +1,146 @@+{-|+Module      : Z.Data.Vector.Base64+Description : Base64 codec for bytes.+Copyright   : (c) Dong Han, 2017-2018+License     : BSD+Maintainer  : winterland1989@gmail.com+Stability   : experimental+Portability : non-portable++This module provides base64 encoding & decoding tools, as well as 'Base64Bytes' newtype with base64 textual instances.++-}++module Z.Data.Vector.Base64+  ( -- * The Base64Bytes type+    Base64Bytes(..)+  -- * Encoding & Decoding functions+  , base64Encode+  , base64EncodeLength+  , base64EncodeText+  , base64EncodeBuilder+  , base64Decode+  , base64Decode'+  , base64DecodeLength+  , Base64DecodeException(..)+  -- * Internal C FFIs+  ,  hs_base64_encode, hs_base64_decode+  ) where++import           Control.Exception+import           Data.Word+import           Data.Bits                      (unsafeShiftL, unsafeShiftR, (.&.))+import           Data.Hashable                  (Hashable(..))+import           GHC.Stack+import           System.IO.Unsafe+import qualified Z.Data.Vector.Base         as V+import qualified Z.Data.Builder.Base        as B+import qualified Z.Data.Text.Base           as T+import qualified Z.Data.Text.ShowT          as T+import qualified Z.Data.JSON                as JSON+import           Z.Foreign++-- | New type wrapper for 'V.Bytes' with base64 encoding Show\/JSON instances.+newtype Base64Bytes = Base64Bytes { unBase64Bytes :: V.Bytes }+    deriving (Eq, Ord)+    deriving newtype (Monoid, Semigroup, Hashable)++instance Show Base64Bytes where+    show (Base64Bytes bs) = T.unpack $ base64EncodeText bs++instance T.ShowT Base64Bytes where+    {-# INLINABLE toUTF8BuilderP #-}+    toUTF8BuilderP _ (Base64Bytes bs) = B.quotes (base64EncodeBuilder bs)++instance JSON.FromValue Base64Bytes where+    {-# INLINE fromValue #-}+    fromValue = JSON.withText "Z.Data.Text.Base64Bytes" $ \ t ->+        case base64Decode (T.getUTF8Bytes t) of+            Just bs -> return (Base64Bytes bs)+            Nothing -> JSON.fail' "illegal base64 encoding bytes"++instance JSON.ToValue Base64Bytes where+    {-# INLINE toValue #-}+    toValue (Base64Bytes bs) = JSON.String (base64EncodeText bs)++instance JSON.EncodeJSON Base64Bytes where+    {-# INLINE encodeJSON #-}+    encodeJSON (Base64Bytes bs) = base64EncodeBuilder bs++-- | Encode 'V.Bytes' using base64 encoding.+base64Encode :: V.Bytes -> V.Bytes+{-# INLINABLE base64Encode #-}+base64Encode (V.PrimVector arr s l) = fst . unsafeDupablePerformIO $ do+    allocPrimVectorUnsafe (base64EncodeLength l) $ \ buf# ->+        withPrimArrayUnsafe arr $ \ parr _ ->+            hs_base64_encode buf# 0 parr s l++-- | Return the encoded length of a given input length, always a multipler of 4.+base64EncodeLength :: Int -> Int+{-# INLINABLE base64EncodeLength #-}+base64EncodeLength n = ((n+2) `quot` 3) `unsafeShiftL` 2++-- | 'B.Builder' version of 'base64Encode'.+base64EncodeBuilder :: V.Bytes -> B.Builder ()+{-# INLINABLE base64EncodeBuilder #-}+base64EncodeBuilder (V.PrimVector arr s l) =+    B.writeN (base64EncodeLength l) (\ (MutablePrimArray mba#) i -> do+        withPrimArrayUnsafe arr $ \ parr _ ->+            hs_base64_encode mba# i parr s l)++-- | Text version of 'base64Encode'.+base64EncodeText :: V.Bytes -> T.Text+{-# INLINABLE base64EncodeText #-}+base64EncodeText = T.Text . base64Encode++-- | Decode a base64 encoding string, return Nothing on illegal bytes or incomplete input.+base64Decode :: V.Bytes -> Maybe V.Bytes+{-# INLINABLE base64Decode #-}+base64Decode ba+    | inputLen == 0 = Just V.empty+    | decodeLen == -1 = Nothing+    | otherwise = unsafeDupablePerformIO $ do+        ((V.PrimVector arr s' _), r) <- withPrimVectorUnsafe ba $ \ ba# s l ->+            allocPrimVectorUnsafe decodeLen $ \ buf# ->+                hs_base64_decode buf# ba# s l+        if r == 0+        then return Nothing+        else return (Just (V.PrimVector arr s' r))+  where+    inputLen = V.length ba+    decodeLen = base64DecodeLength inputLen++-- | Exception during base64 decoding.+data Base64DecodeException = IllegalBase64Bytes V.Bytes CallStack+                           | IncompleteBase64Bytes V.Bytes CallStack+                        deriving Show+instance Exception Base64DecodeException++-- | Decode a base64 encoding string, throw 'Base64DecodeException' on error.+base64Decode' :: HasCallStack => V.Bytes -> V.Bytes+{-# INLINABLE base64Decode' #-}+base64Decode' ba+    | inputLen == 0 = V.empty+    | decodeLen == -1 = throw (IncompleteBase64Bytes ba callStack)+    | otherwise = unsafeDupablePerformIO $ do+        ((V.PrimVector arr s' _), r) <- withPrimVectorUnsafe ba $ \ ba# s l ->+            allocPrimVectorUnsafe decodeLen $ \ buf# ->+                hs_base64_decode buf# ba# s l+        if r == 0+        then throwIO (IllegalBase64Bytes ba callStack)+        else return (V.PrimVector arr s' r)+  where+    inputLen = V.length ba+    decodeLen = base64DecodeLength inputLen++-- | Return the upper bound of decoded length of a given input length+-- , return -1 if illegal(not a multipler of 4).+base64DecodeLength :: Int -> Int+{-# INLINABLE base64DecodeLength #-}+base64DecodeLength n | n .&. 3 == 1 = -1+                     | otherwise = (n `unsafeShiftR` 2) * 3++--------------------------------------------------------------------------------++foreign import ccall unsafe hs_base64_encode :: MBA# Word8 -> Int -> BA# Word8 -> Int -> Int -> IO ()+foreign import ccall unsafe hs_base64_decode :: MBA# Word8 -> BA# Word8 -> Int -> Int -> IO Int
Z/Data/Vector/FlatIntMap.hs view
@@ -27,8 +27,7 @@     -- * fold and traverse   , foldrWithKey, foldrWithKey', foldlWithKey, foldlWithKey', traverseWithKey     -- * binary & linear search on vectors-  , binarySearch-  , linearSearch, linearSearchR+  , linearSearch, linearSearchR, binarySearch   ) where  import           Control.DeepSeq@@ -54,11 +53,11 @@     deriving (Show, Eq, Ord, Typeable)  instance T.ShowT v => T.ShowT (FlatIntMap v) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder p (FlatIntMap vec) = T.parenWhen (p > 10) $ do-        T.unsafeFromBuilder "FlatIntMap {"+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP p (FlatIntMap vec) = T.parenWhen (p > 10) $ do+        "FlatIntMap{"         T.intercalateVec T.comma (\ (V.IPair i v) ->-            T.toTextBuilder 0 i >> ":" >> T.toTextBuilder 0 v) vec+            T.toUTF8Builder i >> T.char7 ':' >> T.toUTF8Builder v) vec         T.char7 '}'  instance (Arbitrary v) => Arbitrary (FlatIntMap v) where@@ -197,9 +196,9 @@ insert k v (FlatIntMap vec@(V.Vector arr s l)) =     case binarySearch vec k of         Left i -> FlatIntMap (V.create (l+1) (\ marr -> do-            when (i>s) $ A.copySmallArray marr 0 arr s (i-s)+            when (i>0) $ A.copySmallArray marr 0 arr s i             A.writeSmallArray marr i (V.IPair k v)-            when (i<(s+l)) $ A.copySmallArray marr (i+1) arr i (s+l-i)))+            when (i<l) $ A.copySmallArray marr (i+1) arr (i+s) (l-i)))         Right i -> FlatIntMap (V.Vector (runST (do             let arr' = A.cloneSmallArray arr s l             marr <- A.unsafeThawSmallArray arr'@@ -213,10 +212,9 @@     case binarySearch vec k of         Left _  -> m         Right i -> FlatIntMap $ V.create (l-1) (\ marr -> do-            when (i>s) $ A.copySmallArray marr 0 arr s (i-s)-            let !end = s+l-                !j = i+1-            when (end > j) $ A.copySmallArray marr 0 arr j (end-j))+            when (i>0) $ A.copySmallArray marr 0 arr s i+            let i' = i+1+            when (i'<l) $ A.copySmallArray marr i arr (i'+s) (l-i'))  -- | /O(N)/ Modify a value by key. --@@ -228,7 +226,7 @@         Left _  -> m         Right i -> FlatIntMap $ V.create l (\ marr -> do             A.copySmallArray marr 0 arr s l-            let !v' = f (V.isnd (A.indexSmallArray arr i))+            let !v' = f (V.isnd (A.indexSmallArray arr (i+s)))             A.writeSmallArray marr i (V.IPair k v'))  -- | /O(n+m)/ Merge two 'FlatIntMap', prefer right value on key duplication.
Z/Data/Vector/FlatIntSet.hs view
@@ -23,7 +23,7 @@   , delete   , insert   , merge-    -- * binary & linear search on vectors+    -- * search on vectors   , binarySearch   ) where @@ -47,10 +47,10 @@     deriving (Show, Eq, Ord, Typeable)  instance T.ShowT FlatIntSet where-    {-# INLINE toTextBuilder #-}-    toTextBuilder p (FlatIntSet vec) = T.parenWhen (p > 10) $ do-        T.unsafeFromBuilder "FlatIntSet {"-        T.intercalateVec T.comma (T.toTextBuilder 0) vec+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP p (FlatIntSet vec) = T.parenWhen (p > 10) $ do+        "FlatIntSet{"+        T.intercalateVec T.comma T.toUTF8Builder vec         T.char7 '}'  instance Semigroup.Semigroup FlatIntSet where@@ -149,9 +149,9 @@ insert v m@(FlatIntSet vec@(V.PrimVector arr s l)) =     case binarySearch vec v of         Left i -> FlatIntSet (V.create (l+1) (\ marr -> do-            when (i>s) $ A.copyPrimArray marr 0 arr s (i-s)+            when (i>0) $ A.copyPrimArray marr 0 arr s i             A.writePrimArray marr i v-            when (i<(s+l)) $ A.copyPrimArray marr (i+1) arr i (s+l-i)))+            when (i<l) $ A.copyPrimArray marr (i+1) arr (i+s) (l-i)))         Right _ -> m  -- | /O(N)/ Delete a value.@@ -161,10 +161,9 @@     case binarySearch vec v of         Left _ -> m         Right i -> FlatIntSet $ V.create (l-1) (\ marr -> do-            when (i>s) $ A.copyPrimArray marr 0 arr s (i-s)-            let !end = s+l-                !j = i+1-            when (end > j) $ A.copyPrimArray marr 0 arr j (end-j))+            when (i>0) $ A.copyPrimArray marr 0 arr s i+            let i' = i+1+            when (i'<l) $ A.copyPrimArray marr i arr (i'+s) (l-i'))  -- | /O(n+m)/ Merge two 'FlatIntSet', prefer right value on value duplication. merge :: FlatIntSet -> FlatIntSet -> FlatIntSet
Z/Data/Vector/FlatMap.hs view
@@ -26,9 +26,8 @@   , merge, mergeWithKey'     -- * fold and traverse   , foldrWithKey, foldrWithKey', foldlWithKey, foldlWithKey', traverseWithKey-    -- * binary & linear search on vectors-  , binarySearch-  , linearSearch, linearSearchR+    -- * search on vectors+  , linearSearch, linearSearchR, binarySearch   ) where  import           Control.DeepSeq@@ -54,11 +53,11 @@     deriving (Show, Eq, Ord, Typeable)  instance (T.ShowT k, T.ShowT v) => T.ShowT (FlatMap k v) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder p (FlatMap vec) = T.parenWhen (p > 10) $ do-        T.unsafeFromBuilder "FlatMap {"+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP p (FlatMap vec) = T.parenWhen (p > 10) $ do+        "FlatMap{"         T.intercalateVec T.comma (\ (k, v) ->-            T.toTextBuilder 0 k >> ":" >> T.toTextBuilder 0 v) vec+            T.toUTF8Builder k >> T.char7 ':' >> T.toUTF8Builder v) vec         T.char7 '}'  instance (Ord k, Arbitrary k, Arbitrary v) => Arbitrary (FlatMap k v) where@@ -197,9 +196,9 @@ insert k v (FlatMap vec@(V.Vector arr s l)) =     case binarySearch vec k of         Left i -> FlatMap (V.create (l+1) (\ marr -> do-            when (i>s) $ A.copySmallArray marr 0 arr s (i-s)+            when (i>0) $ A.copySmallArray marr 0 arr s i             A.writeSmallArray marr i (k, v)-            when (i<(s+l)) $ A.copySmallArray marr (i+1) arr i (s+l-i)))+            when (i<l) $ A.copySmallArray marr (i+1) arr (i+s) (l-i)))         Right i -> FlatMap (V.Vector (runST (do             let arr' = A.cloneSmallArray arr s l             marr <- A.unsafeThawSmallArray arr'@@ -213,10 +212,9 @@     case binarySearch vec k of         Left _ -> m         Right i -> FlatMap $ V.create (l-1) (\ marr -> do-            when (i>s) $ A.copySmallArray marr 0 arr s (i-s)-            let !end = s+l-                !j = i+1-            when (end > j) $ A.copySmallArray marr 0 arr j (end-j))+            when (i>0) $ A.copySmallArray marr 0 arr s i+            let i' = i+1+            when (i'<l) $ A.copySmallArray marr i arr (i'+s) (l-i'))  -- | /O(N)/ Modify a value by key. --@@ -228,7 +226,7 @@         Left _ -> m         Right i -> FlatMap $ V.create l (\ marr -> do             A.copySmallArray marr 0 arr s l-            let !v' = f (snd (A.indexSmallArray arr i))+            let !v' = f (snd (A.indexSmallArray arr (i+s)))             A.writeSmallArray marr i (k, v'))  -- | /O(n+m)/ Merge two 'FlatMap', prefer right value on key duplication.
Z/Data/Vector/FlatSet.hs view
@@ -23,7 +23,7 @@   , delete   , insert   , merge-    -- * binary & linear search on vectors+    -- * search on vectors   , binarySearch   ) where @@ -47,10 +47,10 @@     deriving (Show, Eq, Ord, Typeable, Foldable)  instance T.ShowT v => T.ShowT (FlatSet v) where-    {-# INLINE toTextBuilder #-}-    toTextBuilder p (FlatSet vec) = T.parenWhen (p > 10) $ do-        T.unsafeFromBuilder "FlatSet {"-        T.intercalateVec T.comma (T.toTextBuilder 0) vec+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP p (FlatSet vec) = T.parenWhen (p > 10) $ do+        "FlatSet{"+        T.intercalateVec T.comma T.toUTF8Builder vec         T.char7 '}'  instance Ord v => Semigroup.Semigroup (FlatSet v) where@@ -149,9 +149,9 @@ insert v m@(FlatSet vec@(V.Vector arr s l)) =     case binarySearch vec v of         Left i -> FlatSet (V.create (l+1) (\ marr -> do-            when (i>s) $ A.copySmallArray marr 0 arr s (i-s)+            when (i>0) $ A.copySmallArray marr 0 arr s i             A.writeSmallArray marr i v-            when (i<(s+l)) $ A.copySmallArray marr (i+1) arr i (s+l-i)))+            when (i<l) $ A.copySmallArray marr (i+1) arr (i+s) (l-i)))         Right _ -> m  -- | /O(N)/ Delete a value from set.@@ -161,10 +161,9 @@     case binarySearch vec v of         Left _ -> m         Right i -> FlatSet $ V.create (l-1) (\ marr -> do-            when (i>s) $ A.copySmallArray marr 0 arr s (i-s)-            let !end = s+l-                !j = i+1-            when (end > j) $ A.copySmallArray marr 0 arr j (end-j))+            when (i>0) $ A.copySmallArray marr 0 arr s i+            let i' = i+1+            when (i'<l) $ A.copySmallArray marr i arr (i'+s) (l-i'))  -- | /O(n+m)/ Merge two 'FlatSet', prefer right value on value duplication. merge :: forall v . Ord v => FlatSet v -> FlatSet v -> FlatSet v@@ -196,7 +195,7 @@  -------------------------------------------------------------------------------- --- | Find the value's index in the vector slice, if value exists return 'Right',+-- | Find the value's index in the vector, if value exists return 'Right', -- otherwise 'Left', i.e. the insert index -- -- This function only works on ascending sorted vectors.@@ -208,13 +207,13 @@     go !s !e         | s == e =             let v = arr `A.indexSmallArray` s-            in case v' `compare` v of LT -> Left s-                                      GT -> let !s' = s+1 in Left s'-                                      _  -> Right s+            in case v' `compare` v of LT -> Left (s-s0)+                                      GT -> let !s' = s+1 in Left (s'-s0)+                                      _  -> Right (s-s0)         | s >  e = Left s         | otherwise =             let !mid = (s+e) `shiftR` 1                 v = arr `A.indexSmallArray` mid             in case v' `compare` v of LT -> go s (mid-1)                                       GT -> go (mid+1) e-                                      _  -> Right mid+                                      _  -> Right (mid-s0)
+ Z/Data/Vector/Hex.hs view
@@ -0,0 +1,135 @@+{-|+Module      : Z.Data.Vector.Hex+Description : Hex codec for bytes.+Copyright   : (c) Dong Han, 2017-2018+License     : BSD+Maintainer  : winterland1989@gmail.com+Stability   : experimental+Portability : non-portable++This module provides hex encoding & decoding tools, as well as 'HexBytes' newtype with hex textual instances.++-}++module Z.Data.Vector.Hex+  ( -- * The HexBytes type+    HexBytes(..)+  -- * Encoding & Decoding functions+  , hexEncode+  , hexEncodeText+  , hexEncodeBuilder+  , hexDecode+  , hexDecode'+  , HexDecodeException(..)+  -- * Internal C FFIs+  ,  hs_hex_encode, hs_hex_encode_upper, hs_hex_decode+  ) where++import           Control.Exception+import           Data.Word+import           Data.Bits                      (unsafeShiftL, unsafeShiftR, (.&.))+import           Data.Hashable                  (Hashable(..))+import           GHC.Stack+import           System.IO.Unsafe+import qualified Z.Data.Vector.Base         as V+import qualified Z.Data.Builder.Base        as B+import qualified Z.Data.Text.Base           as T+import qualified Z.Data.Text.ShowT          as T+import qualified Z.Data.JSON                as JSON+import           Z.Foreign++-- | New type wrapper for 'V.Bytes' with hex encoding(uppercase) Show\/JSON instances.+newtype HexBytes = HexBytes { unHexBytes :: V.Bytes }+    deriving (Eq, Ord)+    deriving newtype (Monoid, Semigroup, Hashable)++instance Show HexBytes where+    show (HexBytes bs) = T.unpack $ hexEncodeText True bs++instance T.ShowT HexBytes where+    {-# INLINE toUTF8BuilderP #-}+    toUTF8BuilderP _ (HexBytes bs) = B.quotes (hexEncodeBuilder True bs)++instance JSON.FromValue HexBytes where+    {-# INLINE fromValue #-}+    fromValue = JSON.withText "Z.Data.Text.HexBytes" $ \ t ->+        case hexDecode (T.getUTF8Bytes t) of+            Just bs -> return (HexBytes bs)+            Nothing -> JSON.fail' "illegal hex encoding bytes"++instance JSON.ToValue HexBytes where+    {-# INLINE toValue #-}+    toValue (HexBytes bs) = JSON.String (hexEncodeText True bs)++instance JSON.EncodeJSON HexBytes where+    {-# INLINE encodeJSON #-}+    encodeJSON (HexBytes bs) = hexEncodeBuilder True bs++-- | Encode 'V.Bytes' using hex(base16) encoding.+hexEncode :: Bool   -- ^ uppercase?+          -> V.Bytes -> V.Bytes+{-# INLINE hexEncode #-}+hexEncode upper (V.PrimVector arr s l) = fst . unsafeDupablePerformIO $ do+    allocPrimVectorUnsafe (l `unsafeShiftL` 1) $ \ buf# ->+        withPrimArrayUnsafe arr $ \ parr _ ->+            if upper+            then hs_hex_encode_upper buf# 0 parr s l+            else hs_hex_encode buf# 0 parr s l+++-- | 'B.Builder' version of 'hexEncode'.+hexEncodeBuilder :: Bool -- ^ uppercase?+                 -> V.Bytes -> B.Builder ()+{-# INLINE hexEncodeBuilder #-}+hexEncodeBuilder upper (V.PrimVector arr s l) =+    B.writeN (l `unsafeShiftL` 1) (\ (MutablePrimArray mba#) i -> do+        withPrimArrayUnsafe arr $ \ parr _ ->+            if upper+            then hs_hex_encode_upper mba# i parr s l+            else hs_hex_encode mba# i parr s l)++-- | Text version of 'hexEncode'.+hexEncodeText :: Bool   -- ^ uppercase?+              -> V.Bytes -> T.Text+{-# INLINE hexEncodeText #-}+hexEncodeText upper = T.Text . hexEncode upper++-- | Decode a hex encoding string, return Nothing on illegal bytes or incomplete input.+hexDecode :: V.Bytes -> Maybe V.Bytes+{-# INLINABLE hexDecode #-}+hexDecode ba+    | V.length ba == 0 = Just V.empty+    | V.length ba .&. 1 == 1 = Nothing+    | otherwise = unsafeDupablePerformIO $ do+        (out, r) <- withPrimVectorUnsafe ba $ \ ba# s l ->+            allocPrimVectorUnsafe (l `unsafeShiftR` 1) $ \ buf# ->+                hs_hex_decode buf# ba# s l+        if r < 0+        then return Nothing+        else return (Just out)++-- | Exception during hex decoding.+data HexDecodeException = IllegalHexBytes V.Bytes CallStack+                        | IncompleteHexBytes V.Bytes CallStack+                    deriving Show+instance Exception HexDecodeException++-- | Decode a hex encoding string, throw 'HexDecodeException' on error.+hexDecode' :: HasCallStack => V.Bytes -> V.Bytes+{-# INLINABLE hexDecode' #-}+hexDecode' ba+    | V.length ba == 0 = V.empty+    | V.length ba .&. 1 == 1 = throw (IncompleteHexBytes ba callStack)+    | otherwise = unsafeDupablePerformIO $ do+        (out, r) <- withPrimVectorUnsafe ba $ \ ba# s l ->+            allocPrimVectorUnsafe (l `unsafeShiftR` 1) $ \ buf# ->+                hs_hex_decode buf# ba# s l+        if r < 0+        then throwIO (IllegalHexBytes ba callStack)+        else return out++--------------------------------------------------------------------------------++foreign import ccall unsafe hs_hex_encode :: MBA# Word8 -> Int -> BA# Word8 -> Int -> Int -> IO ()+foreign import ccall unsafe hs_hex_encode_upper :: MBA# Word8 -> Int -> BA# Word8 -> Int -> Int -> IO ()+foreign import ccall unsafe hs_hex_decode :: MBA# Word8 -> BA# Word8 -> Int -> Int -> IO Int
Z/Data/Vector/Search.hs view
@@ -123,7 +123,7 @@         r  -> (r, Just w)  --- | /O(n)/ find the first index and element matching the predicate+-- | /O(n)/ Find the first index and element matching the predicate -- in a vector from right to left, if there isn't one, return '(-1, Nothing)'. findR :: Vec v a => (a -> Bool) -> v a -> (Int, Maybe a) {-# INLINE [1] findR #-}
Z/Foreign.hs view
@@ -147,7 +147,7 @@ -- HsInt sum_first (StgMutArrPtrs *arr, HsInt len) { --   StgArrBytes **bufs = (StgArrBytes**)arr->payload; -- #else--- HsInt sum_first_unsafe (StgArrBytes **bufs, HsInt len) {+-- HsInt sum_first (StgArrBytes **bufs, HsInt len) { -- #endif --   int res = 0; --   for(StgWord ix = 0;ix < len;ix++) {@@ -160,7 +160,7 @@ -- -- Haskell source, all elements in the argument array must be -- -- either ByteArray\# or MutableByteArray\#. This is not enforced -- -- by the type system in this example since ArrayArray is untyped.--- foreign import ccall unsafe "sum_first" sumFirst :: BAArray# -> Int -> IO CInt+-- foreign import ccall unsafe "sum_first" sumFirst :: BAArray# Int -> Int -> IO CInt -- @ -- type BAArray# a = ArrayArray#
cbits/bytes.c view
@@ -27,6 +27,10 @@ */  #include <bytes.h>+#include <turbob64.h>+#ifdef __AVX2__+#include <turbob64avx2.c>+#endif  HsInt hs_memchr(uint8_t *a, HsInt aoff, uint8_t b, HsInt n) {     a += aoff;@@ -134,4 +138,133 @@         src--;     }     return NULL;+}+++static const char* BIN_TO_HEX = +	"000102030405060708090a0b0c0d0e0f"+	"101112131415161718191a1b1c1d1e1f"+	"202122232425262728292a2b2c2d2e2f"+	"303132333435363738393a3b3c3d3e3f"+	"404142434445464748494a4b4c4d4e4f"+	"505152535455565758595a5b5c5d5e5f"+	"606162636465666768696a6b6c6d6e6f"+	"707172737475767778797a7b7c7d7e7f"+	"808182838485868788898a8b8c8d8e8f"+	"909192939495969798999a9b9c9d9e9f"+	"a0a1a2a3a4a5a6a7a8a9aaabacadaeaf"+	"b0b1b2b3b4b5b6b7b8b9babbbcbdbebf"+	"c0c1c2c3c4c5c6c7c8c9cacbcccdcecf"+	"d0d1d2d3d4d5d6d7d8d9dadbdcdddedf"+	"e0e1e2e3e4e5e6e7e8e9eaebecedeeef"+	"f0f1f2f3f4f5f6f7f8f9fafbfcfdfeff";++static const char* BIN_TO_HEX_UPPER = +	"000102030405060708090A0B0C0D0E0F"+	"101112131415161718191A1B1C1D1E1F"+	"202122232425262728292A2B2C2D2E2F"+	"303132333435363738393A3B3C3D3E3F"+	"404142434445464748494A4B4C4D4E4F"+	"505152535455565758595A5B5C5D5E5F"+	"606162636465666768696A6B6C6D6E6F"+	"707172737475767778797A7B7C7D7E7F"+	"808182838485868788898A8B8C8D8E8F"+	"909192939495969798999A9B9C9D9E9F"+	"A0A1A2A3A4A5A6A7A8A9AAABACADAEAF"+	"B0B1B2B3B4B5B6B7B8B9BABBBCBDBEBF"+	"C0C1C2C3C4C5C6C7C8C9CACBCCCDCECF"+	"D0D1D2D3D4D5D6D7D8D9DADBDCDDDEDF"+	"E0E1E2E3E4E5E6E7E8E9EAEBECEDEEEF"+	"F0F1F2F3F4F5F6F7F8F9FAFBFCFDFEFF";++void hs_hex_encode(char* output, HsInt output_off, const uint8_t* input, HsInt input_off, HsInt input_length){+    uint16_t* output_ptr = (uint16_t*)(output+output_off);+    const uint8_t* input_ptr = input + input_off;+    uint16_t* table = (uint16_t*)BIN_TO_HEX;+    for(size_t i = 0; i != input_length;) {+        *(output_ptr++) = table[input_ptr[i++]];+    }+}++void hs_hex_encode_upper(char* output, HsInt output_off, const uint8_t* input, HsInt input_off, HsInt input_length){+    uint16_t* output_ptr = (uint16_t*)(output+output_off);+    const uint8_t* input_ptr = input + input_off;+    uint16_t* table = (uint16_t*)BIN_TO_HEX_UPPER;+    for(size_t i = 0; i != input_length;) {+        *(output_ptr++) = table[input_ptr[i++]];+    }+}++/*+* Mapping of hex characters to either their binary equivalent+* or to an error code.+*  If valid hex (0-9 A-F a-f), the value.+*  Otherwise 0xFF+* Warning: this table assumes ASCII character encodings+*/+static const uint8_t HEX_TO_BIN[256] = {+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0x80, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x00, 0x01,+    0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E,+    0x0F, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x0A, 0x0B, 0x0C,+    0x0D, 0x0E, 0x0F, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,+    0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF };++HsInt hs_hex_decode(uint8_t* output, const uint8_t* input, HsInt input_off, HsInt input_length) {+    input = input+input_off;+    for(size_t i = 0; i != input_length;) {+        const uint8_t hi = HEX_TO_BIN[input[i++]];+        const uint8_t lo = HEX_TO_BIN[input[i++]];+        if((hi | lo) & 0xF0) { +            return -1;+        }+        else {+            *(output++) = hi << 4 | lo;+        }+    }+    return 0;+}++void hs_base64_encode(uint8_t* output, HsInt output_off, const uint8_t* input, HsInt off, HsInt len){+#if defined(__AVX2__)+    tb64avx2enc(input+off, (size_t)len, output+output_off);+#elif defined(__AVX__)+    tb64avxenc(input+off, (size_t)len, output+output_off);+#elif defined(__SSE3__)+    tb64sseenc(input+off, (size_t)len, output+output_off);+#else+    tb64xenc(input+off, (size_t)len, output+output_off);+#endif+}++HsInt hs_base64_decode(uint8_t* output, const uint8_t* input, HsInt off, HsInt len){+#if defined(__AVX2__)+    return (HsInt)tb64avx2dec(input+off, (size_t)len, output);+#elif defined(__AVX__)+    return (HsInt)tb64avxdec(input+off, (size_t)len, output);+#elif defined(__SSE3__)+    return (HsInt)tb64ssedec(input+off, (size_t)len, output);+#else+    return (HsInt)tb64xdec(input+off, (size_t)len, output);+#endif }
cbits/text.c view
@@ -10,54 +10,46 @@  HsInt ascii_validate(const char* p, HsInt off, HsInt len){     const char* q = p + off;-#ifdef __AVX2__+#if defined(__AVX2__)     return (HsInt)validate_ascii_fast_avx(q, (size_t)len);-#else-#ifdef __SSE2__+#elif defined(__SSE2__)     return (HsInt)validate_ascii_fast(q, (size_t)len); #else     return (HsInt)ascii_u64(q, (size_t)len); #endif-#endif } // for some reason unknown, on windows we have to supply a seperated version of ascii_validate // otherwise we got segfault if we import the same FFI with different type (Addr# vs ByteArray#) HsInt ascii_validate_addr(const char* p, HsInt len){-#ifdef __AVX2__+#if defined(__AVX2__)     return (HsInt)validate_ascii_fast_avx(p, (size_t)len);-#else-#ifdef __SSE2__+#elif defined(__SSE2__)     return (HsInt)validate_ascii_fast(p, (size_t)len); #else     return (HsInt)ascii_u64(p, (size_t)len); #endif-#endif }  HsInt utf8_validate(const char* p, HsInt off, HsInt len){     const char* q = p + off;-#ifdef __AVX2__+#if defined(__AVX2__)     return (HsInt)validate_utf8_fast_avx(q, (size_t)len);-#else-#ifdef __SSE2__+#elif defined(__SSE2__)     return (HsInt)validate_utf8_fast(q, (size_t)len); #else     return utf8_validate_slow(q, (size_t)len); #endif-#endif } // for some reason unknown, on windows we have to supply a seperated version of utf8_validate // otherwise we got segfault if we import the same FFI with different type (Addr# vs ByteArray#) HsInt utf8_validate_addr(const char* p, HsInt len){-#ifdef __AVX2__+#if defined(__AVX2__)     return (HsInt)validate_utf8_fast_avx(p, (size_t)len);-#else-#ifdef __SSE2__+#elif defined(__SSE2__)     return (HsInt)validate_utf8_fast(p, (size_t)len); #else     return utf8_validate_slow(p, (size_t)len); #endif-#endif }  ////////////////////////////////////////////////////////////////////////////////@@ -309,27 +301,38 @@     return (-1); } +/* rfc8259+ The representation of strings is similar to conventions used in the C+ family of programming languages.  A string begins and ends with+ quotation marks.  All Unicode characters may be placed within the+ quotation marks, except for the characters that MUST be escaped:+ quotation mark, reverse solidus, and the control characters (U+0000+ through U+001F).+*/+static const int escape_char_length[256] =+  { 6,6,6,6,6,6,6,6,2,2,2,6,2,2,6,6,+    6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,+    1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,+    1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,+    1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,+    1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,+    1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,+    1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,+    1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,+    1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,+    1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,+    1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,+    1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,+    1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,+    1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,+    1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1};+ HsInt escape_json_string_length(const unsigned char *src, HsInt srcoff, HsInt srclen){     HsInt rv = 2; // for start and end quotes      const unsigned char *i = src + srcoff;     const unsigned char *srcend = i + srclen;     for (; i < srcend; i++) {-        switch (*i) {-            case '\b': rv += 2; break;-            case '\f': rv += 2; break;-            case '\n': rv += 2; break;-            case '\r': rv += 2; break;-            case '\t': rv += 2; break;-            case '\"': rv += 2; break;-            case '\\': rv += 2; break;-            case '/': rv += 2; break;-            default:-                if (*i <= 0x1F) {-                    rv += 6;-                } else {-                    rv += 1;-                }-        }+        rv += escape_char_length[*i];     }     return rv; }@@ -344,26 +347,29 @@     unsigned char *j = dest + desoff;     *j++ = '\"'; // start quote     for (; i < srcend; i++){-        switch (*i) {-            case '\b': *j++ = '\\'; *j++ = 'b'; break;-            case '\f': *j++ = '\\'; *j++ = 'f'; break;-            case '\n': *j++ = '\\'; *j++ = 'n'; break;-            case '\r': *j++ = '\\'; *j++ = 'r'; break;-            case '\t': *j++ = '\\'; *j++ = 't'; break;-            case '\"': *j++ = '\\'; *j++ = '\"'; break;-            case '\\': *j++ = '\\'; *j++ = '\\'; break;-            case '/': *j++ = '\\'; *j++ = '/'; break;-            default: -                if (*i <= 0x1F) {+        if (escape_char_length[*i] == 1) {+            *j++ = *i;+        } else {+            switch (*i) {+                case '\"': *j++ = '\\'; *j++ = '\"'; break;+                case '\\': *j++ = '\\'; *j++ = '\\'; break;+                case '\b': *j++ = '\\'; *j++ = 'b'; break;+                case '\f': *j++ = '\\'; *j++ = 'f'; break;+                case '\n': *j++ = '\\'; *j++ = 'n'; break;+                case '\r': *j++ = '\\'; *j++ = 'r'; break;+                case '\t': *j++ = '\\'; *j++ = 't'; break;+                // case '/': *j++ = '\\'; *j++ = '/'; break;+                // see note above, solidus is not required to be escaped by rfc8259+                // it often appears in JSON(URL strings..)+                // for performance consideration it's omitted +                default:                      *j++ = '\\';                     *j++ = 'u';                     *j++ = '0';                     *j++ = '0';                     *j++ = DEC2HEX[*i >> 4];                     *j++ = DEC2HEX[*i & 0xF];-                } else {-                    *j++ = *i;-                }+            }         }     }     *j++ = '\"'; // end quote@@ -500,3 +506,4 @@ HsInt utf8_iscategory(const char* p, HsInt off, HsInt len, size_t flags){     return (HsInt)utf8iscategory(p+off, len, flags); }+
include/bytes.h view
@@ -37,3 +37,10 @@ HsInt hs_memrchr(uint8_t *a, HsInt aoff, uint8_t c, HsInt n); HsInt hs_fnv_hash_addr(const unsigned char* str, HsInt len, HsInt salt); HsInt hs_fnv_hash(const unsigned char* str, HsInt offset, HsInt len, HsInt salt);++void hs_hex_encode(char* output, HsInt output_off, const uint8_t* input, HsInt input_off, HsInt input_length);+void hs_hex_encode_upper(char* output, HsInt output_off, const uint8_t* input, HsInt input_off, HsInt input_length);+HsInt hs_hex_decode(uint8_t* output, const uint8_t* input, HsInt input_off, HsInt input_length);++void hs_base64_encode(uint8_t* output, HsInt output_off, const uint8_t* input, HsInt input_off, HsInt input_length);+HsInt hs_base64_decode(uint8_t* output, const uint8_t* input, HsInt input_off, HsInt input_length);
include/text.h view
@@ -58,3 +58,4 @@ HsInt utf8_totitle_length(const char* p, HsInt off, HsInt len, size_t locale);  HsInt utf8_iscategory(const char* p, HsInt off, HsInt len, size_t flags);+
test/Z/Data/Builder/NumericSpec.hs view
@@ -159,30 +159,30 @@         prop "hex roundtrip" $ \ i ->             i === (read' . T.unpack . T.validate . B.buildBytes $ B.hex @Int8 i) -    describe "heX roundtrip" $ do+    describe "hexUpper roundtrip" $ do          let read' s = read $ "0x" ++ s -        prop "heX roundtrip" $ \ i ->-            i === (read' . T.unpack . T.validate . B.buildBytes $ B.heX @Word i)-        prop "heX roundtrip" $ \ i ->-            i === (read' . T.unpack . T.validate . B.buildBytes $ B.heX @Int i)-        prop "heX roundtrip" $ \ i ->-            i === (read' . T.unpack . T.validate . B.buildBytes $ B.heX @Word64 i)-        prop "heX roundtrip" $ \ i ->-            i === (read' . T.unpack . T.validate . B.buildBytes $ B.heX @Int64 i)-        prop "heX roundtrip" $ \ i ->-            i === (read' . T.unpack . T.validate . B.buildBytes $ B.heX @Word32 i)-        prop "heX roundtrip" $ \ i ->-            i === (read' . T.unpack . T.validate . B.buildBytes $ B.heX @Int32 i)-        prop "heX roundtrip" $ \ i ->-            i === (read' . T.unpack . T.validate . B.buildBytes $ B.heX @Word16 i)-        prop "heX roundtrip" $ \ i ->-            i === (read' . T.unpack . T.validate . B.buildBytes $ B.heX @Int16 i)-        prop "heX roundtrip" $ \ i ->-            i === (read' . T.unpack . T.validate . B.buildBytes $ B.heX @Word8 i)-        prop "heX roundtrip" $ \ i ->-            i === (read' . T.unpack . T.validate . B.buildBytes $ B.heX @Int8 i)+        prop "hexUpper roundtrip" $ \ i ->+            i === (read' . T.unpack . T.validate . B.buildBytes $ B.hexUpper @Word i)+        prop "hexUpper roundtrip" $ \ i ->+            i === (read' . T.unpack . T.validate . B.buildBytes $ B.hexUpper @Int i)+        prop "hexUpper roundtrip" $ \ i ->+            i === (read' . T.unpack . T.validate . B.buildBytes $ B.hexUpper @Word64 i)+        prop "hexUpper roundtrip" $ \ i ->+            i === (read' . T.unpack . T.validate . B.buildBytes $ B.hexUpper @Int64 i)+        prop "hexUpper roundtrip" $ \ i ->+            i === (read' . T.unpack . T.validate . B.buildBytes $ B.hexUpper @Word32 i)+        prop "hexUpper roundtrip" $ \ i ->+            i === (read' . T.unpack . T.validate . B.buildBytes $ B.hexUpper @Int32 i)+        prop "hexUpper roundtrip" $ \ i ->+            i === (read' . T.unpack . T.validate . B.buildBytes $ B.hexUpper @Word16 i)+        prop "hexUpper roundtrip" $ \ i ->+            i === (read' . T.unpack . T.validate . B.buildBytes $ B.hexUpper @Int16 i)+        prop "hexUpper roundtrip" $ \ i ->+            i === (read' . T.unpack . T.validate . B.buildBytes $ B.hexUpper @Word8 i)+        prop "hexUpper roundtrip" $ \ i ->+            i === (read' . T.unpack . T.validate . B.buildBytes $ B.hexUpper @Int8 i)      describe "int === show" $ do         prop "int === show" $ \ i ->@@ -253,6 +253,17 @@         prop "doubleWith === formatRealFloat" $ \ i l ->             formatRealFloat FFExponent l i ===                 (T.unpack . T.validate . B.buildBytes  $ B.doubleWith B.Exponent l i)++    describe "scientificWith === formatScientific" $ do+        prop "scientificWith === formatScientific" $ \ i (Positive l) ->+            Sci.formatScientific Sci.Generic (Just l) i ===+                (T.unpack . T.validate . B.buildBytes  $ B.scientificWith B.Generic (Just l) i)+        prop "scientificWith === formatScientific" $ \ i l ->+            Sci.formatScientific Sci.Fixed l i ===+                (T.unpack . T.validate . B.buildBytes  $ B.scientificWith  B.Fixed l i)+        prop "scientificWith === formatScientific" $ \ i (Positive l) ->+            Sci.formatScientific Sci.Exponent (Just l) i ===+                (T.unpack . T.validate . B.buildBytes  $ B.scientificWith B.Exponent (Just l) i)      describe "grisu3, grisu3_sp === floatToDigits 10" $ do         prop "grisu3 === floatToDigits" $ \ (Positive f) ->
test/Z/Data/JSON/BaseSpec.hs view
@@ -74,4 +74,5 @@     it "control characters are escaped" $         JSON.encodeText (T.pack $ map toEnum [0..0x1F]) ===             "\"\\u0000\\u0001\\u0002\\u0003\\u0004\\u0005\\u0006\\u0007\\b\\t\\n\\u000b\\f\\r\\u000e\\u000f\-            \\\u0010\\u0011\\u0012\\u0013\\u0014\\u0015\\u0016\\u0017\\u0018\\u0019\\u001a\\u001b\\u001c\\u001d\\u001e\\u001f\""+            \\\u0010\\u0011\\u0012\\u0013\\u0014\\u0015\\u0016\\u0017\\u0018\\u0019\+            \\\u001a\\u001b\\u001c\\u001d\\u001e\\u001f\""
test/Z/Data/Text/ShowTSpec.hs view
@@ -39,21 +39,21 @@ spec = describe "JSON Base instances" $ do      it "Nullary constructor are encoded as text" $-        showT (Nullary :: T Integer) === "Nullary"+        toText (Nullary :: T Integer) === "Nullary"      it "Unary constructor are encoded as single field" $-        showT (Unary 123456 :: T Integer) === "Unary 123456"+        toText (Unary 123456 :: T Integer) === "Unary 123456"      it "Product are encoded as multiple field" $-        showT (Product "ABC" (Just 'x') (123456::Integer)) ===+        toText (Product "ABC" (Just 'x') (123456::Integer)) ===             "Product \"ABC\" (Just 'x') 123456"      it "Record are encoded as key values" $-        showT (Record 0.123456 Nothing (Just (123456::Integer))) ===+        toText (Record 0.123456 Nothing (Just (123456::Integer))) ===             "Record {testOne = 0.123456, testTwo = Nothing, testThree = Just 123456}"      it "List are encode as array" $-        showT (List [Nullary+        toText (List [Nullary             , Unary 123456             , (Product "ABC" (Just 'x') (123456::Integer))             , (Record 0.123456 Nothing (Just (123456::Integer)))]) ===
test/Z/Data/Vector/FlatMapSpec.hs view
@@ -17,7 +17,7 @@  spec :: Spec spec = do-    describe "flatmap-semigroup-monoid" $ do+    describe "flatmap-semigroup-monoid" . modifyMaxSuccess (*5) . modifyMaxSize (*5) $ do         prop "flatmap monoid unit law" $ \ (m :: FMS)  ->             (m <> FM.empty) === m         prop "flatmap monoid unit law" $ \ (m :: FMS) ->
test/Z/Data/Vector/FlatSetSpec.hs view
@@ -17,7 +17,7 @@  spec :: Spec spec = do-    describe "flatset-semigroup-monoid" $ do+    describe "flatset-semigroup-monoid" . modifyMaxSuccess (*10) . modifyMaxSize (*10) $ do         prop "flatset monoid unit law" $ \ (m :: FMS)  ->             (m <> FS.empty) === m         prop "flatset monoid unit law" $ \ (m :: FMS) ->
+ test/Z/Data/Vector/HexSpec.hs view
@@ -0,0 +1,16 @@+module Z.Data.Vector.HexSpec where++import           Data.Word+import qualified Z.Data.Vector.Hex     as H+import qualified Z.Data.Vector         as V+import           Test.QuickCheck+import           Test.QuickCheck.Function+import           Test.QuickCheck.Property+import           Test.Hspec+import           Test.Hspec.QuickCheck++spec :: Spec+spec = describe "text-HexBytes" . modifyMaxSuccess (*50) . modifyMaxSize (*50) $ do+    describe "encoding props " $ do+        prop "hexDecode' . hexEncode === id" $ \ xs u ->+            (H.hexDecode' (H.hexEncode u xs) === xs)
+ third_party/Turbo-Base64/conf.h view
@@ -0,0 +1,257 @@+/**+    Copyright (C) powturbo 2013-2019+    GPL v2 License+  +    This program is free software; you can redistribute it and/or modify+    it under the terms of the GNU General Public License as published by+    the Free Software Foundation; either version 2 of the License, or+    (at your option) any later version.++    This program is distributed in the hope that it will be useful,+    but WITHOUT ANY WARRANTY; without even the implied warranty of+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the+    GNU General Public License for more details.++    You should have received a copy of the GNU General Public License along+    with this program; if not, write to the Free Software Foundation, Inc.,+    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.++    - homepage : https://sites.google.com/site/powturbo/+    - github   : https://github.com/powturbo+    - twitter  : https://twitter.com/powturbo+    - email    : powturbo [_AT_] gmail [_DOT_] com+**/++//	   conf.h - config & common +#ifndef CONF_H+#define CONF_H+//------------------------- Compiler ------------------------------------------+  #if defined(__GNUC__)+#include <stdint.h>+#define ALIGNED(t,v,n)  t v __attribute__ ((aligned (n))) +#define ALWAYS_INLINE   inline __attribute__((always_inline))+#define NOINLINE        __attribute__((noinline))+#define _PACKED 		__attribute__ ((packed))+#define likely(x)     	__builtin_expect((x),1)+#define unlikely(x)   	__builtin_expect((x),0)++#define popcnt32(_x_) 	__builtin_popcount(_x_)+#define popcnt64(_x_) 	__builtin_popcountll(_x_)++    #if defined(__i386__) || defined(__x86_64__)+//__bsr32:     1:0,2:1,3:1,4:2,5:2,6:2,7:2,8:3,9:3,10:3,11:3,12:3,13:3,14:3,15:3,16:4,17:4,18:4,19:4,20:4,21:4,22:4,23:4,24:4,25:4,26:4,27:4,28:4,29:4,30:4,31:4,32:5+//  bsr32: 0:0,1:1,2:2,3:2,4:3,5:3,6:3,7:3,8:4,9:4,10:4,11:4,12:4,13:4,14:4,15:4,16:5,17:5,18:5,19:5,20:5,21:5,22:5,23:5,24:5,25:5,26:5,27:5,28:5,29:5,30:5,31:5,32:6,+static inline int    __bsr32(               int x) {             asm("bsr  %1,%0" : "=r" (x) : "rm" (x) ); return x; }+static inline int      bsr32(               int x) { int b = -1; asm("bsrl %1,%0" : "+r" (b) : "rm" (x) ); return b + 1; }+static inline int      bsr64(uint64_t x) { return x?64 - __builtin_clzll(x):0; }++static inline unsigned rol32(unsigned x, int s) { asm ("roll %%cl,%0" :"=r" (x) :"0" (x),"c" (s)); return x; }+static inline unsigned ror32(unsigned x, int s) { asm ("rorl %%cl,%0" :"=r" (x) :"0" (x),"c" (s)); return x; }+static inline uint64_t rol64(uint64_t x, int s) { asm ("rolq %%cl,%0" :"=r" (x) :"0" (x),"c" (s)); return x; }+static inline uint64_t ror64(uint64_t x, int s) { asm ("rorq %%cl,%0" :"=r" (x) :"0" (x),"c" (s)); return x; }+    #else+static inline int    __bsr32(unsigned x          ) { return   31 - __builtin_clz(  x); }+static inline int      bsr32(int x               ) { return x?32 - __builtin_clz(  x):0; }+static inline int      bsr64(uint64_t x) { return x?64 - __builtin_clzll(x):0; }++static inline unsigned rol32(unsigned x, int s) { return x << s | x >> (32 - s); }+static inline unsigned ror32(unsigned x, int s) { return x >> s | x << (32 - s); }+static inline unsigned rol64(unsigned x, int s) { return x << s | x >> (64 - s); }+static inline unsigned ror64(unsigned x, int s) { return x >> s | x << (64 - s); }+    #endif++#define ctz64(_x_) __builtin_ctzll(_x_)+#define ctz32(_x_) __builtin_ctz(_x_)    // 0:32  ctz32(1<<a) = a (a=1..31)+#define clz64(_x_) __builtin_clzll(_x_)+#define clz32(_x_) __builtin_clz(_x_)++//#define bswap8(x)    (x) +    #if __GNUC__ > 4 || __GNUC__ == 4 && __GNUC_MINOR__ >= 8+#define bswap16(x) __builtin_bswap16(x)+    #else+static inline unsigned short bswap16(unsigned short x) { return __builtin_bswap32(x << 16); }+    #endif+#define bswap32(x) __builtin_bswap32(x)+#define bswap64(x) __builtin_bswap64(x)++  #elif _MSC_VER //----------------------------------------------------+#include <windows.h>+#include <intrin.h>+    #if _MSC_VER < 1600+#include "vs/stdint.h"+#define __builtin_prefetch(x,a)+#define inline          __inline+    #else +#include <stdint.h>+#define __builtin_prefetch(x,a) _mm_prefetch(x, _MM_HINT_NTA)+    #endif+	+#define ALIGNED(t,v,n)  __declspec(align(n)) t v+#define ALWAYS_INLINE	__forceinline+#define NOINLINE		__declspec(noinline)+#define THREADLOCAL		__declspec(thread)+#define likely(x)     	(x)+#define unlikely(x)   	(x)++static inline int __bsr32(unsigned x) { unsigned long z=0; _BitScanReverse(&z, x); return z; }+static inline int bsr32(  unsigned x) { unsigned long z;   _BitScanReverse(&z, x); return x?z+1:0; }+static inline int ctz32(  unsigned x) { unsigned long z;   _BitScanForward(&z, x); return x?z:32; }+static inline int clz32(  unsigned x) { unsigned long z;   _BitScanReverse(&z, x); return x?31-z:32; }+  #if !defined(_M_ARM64) && !defined(_M_X64)+static inline unsigned char _BitScanForward64(unsigned long* ret, uint64_t x) {+  unsigned long x0 = (unsigned long)x, top, bottom;         _BitScanForward(&top, (unsigned long)(x >> 32)); _BitScanForward(&bottom, x0);               +  *ret = x0 ? bottom : 32 + top;  return x != 0; +}+static unsigned char _BitScanReverse64(unsigned long* ret, uint64_t x) {+  unsigned long x1 = (unsigned long)(x >> 32), top, bottom; _BitScanReverse(&top, x1);                       _BitScanReverse(&bottom, (unsigned long)x); +  *ret = x1 ? top + 32 : bottom;  return x != 0; +}+  #endif+static inline int bsr64(uint64_t x) { unsigned long z=0; _BitScanReverse64(&z, x); return x?z+1:0; }+static inline int ctz64(uint64_t x) { unsigned long z;   _BitScanForward64(&z, x); return x?z:64; }+static inline int clz64(uint64_t x) { unsigned long z;   _BitScanReverse64(&z, x); return x?63-z:64; }++#define rol32(x,s) _lrotl(x, s)+#define ror32(x,s) _lrotr(x, s)++#define bswap16(x) _byteswap_ushort(x)+#define bswap32(x) _byteswap_ulong(x)+#define bswap64(x) _byteswap_uint64(x)++#define popcnt32(x) __popcnt(x)+  #ifdef _WIN64+#define popcnt64(x) __popcnt64(x)+  #else+#define popcnt64(x) (popcnt32(x) + popcnt32(x>>32))+  #endif++#define sleep(x)    Sleep(x/1000)+#define fseeko      _fseeki64+#define ftello      _ftelli64+#define strcasecmp  _stricmp+#define strncasecmp _strnicmp+#define strtoull    _strtoui64+static inline double round(double num) { return (num > 0.0) ? floor(num + 0.5) : ceil(num - 0.5); }+  #endif ++#define bsr8(_x_)  bsr32(_x_)+#define bsr16(_x_) bsr32(_x_)+#define ctz8(_x_)  ctz32(_x_)+#define ctz16(_x_) ctz32(_x_)+#define clz8(_x_)  (clz32(_x_)-24)+#define clz16(_x_) (clz32(_x_)-16)++#define popcnt8(x)  popcnt32(x) +#define popcnt16(x) popcnt32(x) ++//--------------- Unaligned memory access -------------------------------------+  #ifdef UA_MEMCPY+#include <string.h>+static inline unsigned short     ctou16(const void *cp) { unsigned short     x; memcpy(&x, cp, sizeof(x)); return x; }+static inline unsigned           ctou32(const void *cp) { unsigned           x; memcpy(&x, cp, sizeof(x)); return x; }+static inline unsigned long long ctou64(const void *cp) { unsigned long long x; memcpy(&x, cp, sizeof(x)); return x; }+static inline size_t             ctousz(const void *cp) { size_t             x; memcpy(&x, cp, sizeof(x)); return x; }+static inline float              ctof32(const void *cp) { float              x; memcpy(&x, cp, sizeof(x)); return x; }+static inline double             ctof64(const void *cp) { double             x; memcpy(&x, cp, sizeof(x)); return x; }++static inline void               stou16(      void *cp, unsigned short     x) { memcpy(cp, &x, sizeof(x)); }+static inline void               stou32(      void *cp, unsigned           x) { memcpy(cp, &x, sizeof(x)); }+static inline void               stou64(      void *cp, unsigned long long x) { memcpy(cp, &x, sizeof(x)); }+static inline void               stousz(      void *cp, size_t             x) { memcpy(cp, &x, sizeof(x)); }+static inline void               stof32(      void *cp, float              x) { memcpy(cp, &x, sizeof(x)); }+static inline void               stof64(      void *cp, double             x) { memcpy(cp, &x, sizeof(x)); }+  #elif defined(__i386__) || defined(__x86_64__) || \+    defined(_M_IX86) || defined(_M_AMD64) || _MSC_VER ||\+    defined(__powerpc__) || defined(__s390__) ||\+    defined(__ARM_FEATURE_UNALIGNED) || defined(__aarch64__) || defined(__arm__) ||\+    defined(__ARM_ARCH_4__) || defined(__ARM_ARCH_4T__) || \+    defined(__ARM_ARCH_5__) || defined(__ARM_ARCH_5T__) || defined(__ARM_ARCH_5TE__) || defined(__ARM_ARCH_5TEJ__) || \+    defined(__ARM_ARCH_6__) || defined(__ARM_ARCH_6J__) || defined(__ARM_ARCH_6K__)  || defined(__ARM_ARCH_6T2__) || defined(__ARM_ARCH_6Z__)   || defined(__ARM_ARCH_6ZK__)+#define ctou16(_cp_) (*(unsigned short *)(_cp_))+#define ctou32(_cp_) (*(unsigned       *)(_cp_))+#define ctof32(_cp_) (*(float          *)(_cp_))++    #if defined(__i386__) || defined(__x86_64__) || defined(__powerpc__) || defined(__s390__) || defined(_MSC_VER) +#define ctou64(_cp_)       (*(uint64_t *)(_cp_))+#define ctof64(_cp_)       (*(double   *)(_cp_))+    #elif defined(__ARM_FEATURE_UNALIGNED)+struct _PACKED longu     { uint64_t l; };+struct _PACKED doubleu   { double   d; };+#define ctou64(_cp_) ((struct longu     *)(_cp_))->l+#define ctof64(_cp_) ((struct doubleu   *)(_cp_))->d+    #endif++  #elif defined(__ARM_ARCH_7__) || defined(__ARM_ARCH_7A__) || defined(__ARM_ARCH_7M__) || defined(__ARM_ARCH_7R__) || defined(__ARM_ARCH_7S__)+struct _PACKED shortu    { unsigned short     s; };+struct _PACKED unsignedu { unsigned           u; };+struct _PACKED longu     { uint64_t           l; };+struct _PACKED floatu    { float              f; };+struct _PACKED doubleu   { double             d; };++#define ctou16(_cp_) ((struct shortu    *)(_cp_))->s+#define ctou32(_cp_) ((struct unsignedu *)(_cp_))->u+#define ctou64(_cp_) ((struct longu     *)(_cp_))->l+#define ctof32(_cp_) ((struct floatu    *)(_cp_))->f+#define ctof64(_cp_) ((struct doubleu   *)(_cp_))->d+  #else+#error "unknown cpu"	  +  #endif++#define ctou24(_cp_) (ctou32(_cp_) & 0xffffff)+#define ctou48(_cp_) (ctou64(_cp_) & 0xffffffffffffull)+#define ctou8(_cp_) (*(_cp_))+//--------------------- wordsize ----------------------------------------------+  #if defined(__64BIT__) || defined(_LP64) || defined(__LP64__) || defined(_WIN64) ||\+    defined(__x86_64__) || defined(_M_X64) ||\+    defined(__ia64) || defined(_M_IA64) ||\+    defined(__aarch64__) ||\+    defined(__mips64) ||\+    defined(__powerpc64__) || defined(__ppc64__) || defined(__PPC64__) ||\+    defined(__s390x__)+#define __WORDSIZE 64+  #else+#define __WORDSIZE 32 +  #endif+#endif++//---------------------misc ---------------------------------------------------+#define BZHI64(_u_, _b_) ((_u_) & ((1ull<<(_b_))-1))+#define BZHI32(_u_, _b_) ((_u_) & ((1u  <<(_b_))-1))+#define BZHI16(_u_, _b_) BZHI32(_u_, _b_)+#define BZHI8(_u_, _b_)  BZHI32(_u_, _b_)++#define SIZE_ROUNDUP(_n_, _a_) (((size_t)(_n_) + (size_t)((_a_) - 1)) & ~(size_t)((_a_) - 1))+#define ALIGN_DOWN(__ptr, __a) ((void *)((uintptr_t)(__ptr) & ~(uintptr_t)((__a) - 1)))+  +#define TEMPLATE2_(_x_, _y_) _x_##_y_+#define TEMPLATE2(_x_, _y_) TEMPLATE2_(_x_,_y_)++#define TEMPLATE3_(_x_,_y_,_z_) _x_##_y_##_z_+#define TEMPLATE3(_x_,_y_,_z_) TEMPLATE3_(_x_, _y_, _z_)++#define CACHE_LINE_SIZE     64+#define PREFETCH_DISTANCE   (CACHE_LINE_SIZE*4)+//--- NDEBUG -------+#include <stdio.h>+  #ifdef _MSC_VER+    #ifdef NDEBUG+#define AS(expr, fmt, ...)+#define AC(expr, fmt, ...) do { if(!(expr)) { fprintf(stderr, fmt, ##__VA_ARGS__ ); fflush(stderr); abort(); } } while(0)+#define die(fmt, ...) do { fprintf(stderr, fmt, ##__VA_ARGS__ ); fflush(stderr); exit(-1); } while(0)+    #else+#define AS(expr, fmt, ...) do { if(!(expr)) { fflush(stdout);fprintf(stderr, "%s:%s:%d:", __FILE__, __FUNCTION__, __LINE__); fprintf(stderr, fmt, ##__VA_ARGS__ ); fflush(stderr); abort(); } } while(0)+#define AC(expr, fmt, ...) do { if(!(expr)) { fflush(stdout);fprintf(stderr, "%s:%s:%d:", __FILE__, __FUNCTION__, __LINE__); fprintf(stderr, fmt, ##__VA_ARGS__ ); fflush(stderr); abort(); } } while(0)+#define die(fmt, ...) do { fprintf(stderr, "%s:%s:%d:", __FILE__, __FUNCTION__, __LINE__); fprintf(stderr, fmt, ##__VA_ARGS__ ); fflush(stderr); exit(-1); } while(0)+    #endif+  #else +    #ifdef NDEBUG+#define AS(expr, fmt,args...)+#define AC(expr, fmt,args...) do { if(!(expr)) { fprintf(stderr, fmt, ## args ); fflush(stderr); abort(); } } while(0)+#define die(fmt,args...) do { fprintf(stderr, fmt, ## args ); fflush(stderr); exit(-1); } while(0)+    #else+#define AS(expr, fmt,args...) do { if(!(expr)) { fflush(stdout);fprintf(stderr, "%s:%s:%d:", __FILE__, __FUNCTION__, __LINE__); fprintf(stderr, fmt, ## args ); fflush(stderr); abort(); } } while(0)+#define AC(expr, fmt,args...) do { if(!(expr)) { fflush(stdout);fprintf(stderr, "%s:%s:%d:", __FILE__, __FUNCTION__, __LINE__); fprintf(stderr, fmt, ## args ); fflush(stderr); abort(); } } while(0)+#define die(fmt,args...) do { fprintf(stderr, "%s:%s:%d:", __FILE__, __FUNCTION__, __LINE__); fprintf(stderr, fmt, ## args ); fflush(stderr); exit(-1); } while(0)+    #endif+  #endif+
+ third_party/Turbo-Base64/turbob64_.h view
@@ -0,0 +1,143 @@+size_t _tb64xdec( const unsigned char *in, size_t inlen, unsigned char *out);
+size_t tb64memcpy(const unsigned char *in, size_t inlen, unsigned char *out);  // testing only
+
+#define PREFETCH(_ip_,_i_,_rw_) __builtin_prefetch(_ip_+(_i_),_rw_)
+
+  #if defined(__BYTE_ORDER__) && (__BYTE_ORDER__ == __ORDER_BIG_ENDIAN__)
+#define BSWAP32(a) a 
+#define BSWAP64(a) a 
+  #else
+#define BSWAP32(a) bswap32(a)
+#define BSWAP64(a) bswap64(a)
+  #endif  
+
+  #ifdef NB64CHECK
+#define CHECK0(a)
+#define CHECK1(a)
+  #else
+#define CHECK0(a) a
+    #ifdef B64CHECK
+#define CHECK1(a) a
+    #else
+#define CHECK1(a)
+    #endif
+  #endif
+
+//--------------------- Encoding ----------------------------------------------------------
+extern unsigned char tb64lutse[];
+
+#define SU32(_u_) (tb64lutse[(_u_>> 8) & 0x3f] << 24 |\
+                   tb64lutse[(_u_>>14) & 0x3f] << 16 |\
+                   tb64lutse[(_u_>>20) & 0x3f] <<  8 |\
+                   tb64lutse[(_u_>>26) & 0x3f])
+
+#define ETAIL()\
+  unsigned _l = (in+inlen) - ip;\
+  if(_l == 3) { unsigned _u = ip[0]<<24 | ip[1]<<16 | ip[2]<<8; stou32(op, SU32(_u)); op+=4; ip+=3; }\
+  else if(_l) { *op++ = tb64lutse[(ip[0]>>2)&0x3f];\
+    if(_l == 2) *op++ = tb64lutse[(ip[0] & 0x3) << 4 | (ip[1] & 0xf0) >> 4],\
+                *op++ = tb64lutse[(ip[1] & 0xf) << 2];\
+    else        *op++ = tb64lutse[(ip[0] & 0x3) << 4], *op++ = '=';\
+    *op++ = '=';\
+  }
+
+  
+extern const unsigned short tb64lutxe[];
+#define XU32(_u_) (tb64lutxe[(_u_ >>  8) & 0xfff] << 16 |\
+                   tb64lutxe[ _u_ >> 20])
+
+#define EXTAIL() for(; op < (out+outlen)-4; op += 4, ip += 3) { unsigned _u = BSWAP32(ctou32(ip)); stou32(op, XU32(_u)); } ETAIL()
+//--------------------- Decoding ----------------------------------------------------------  
+extern const unsigned tb64lutxd0[];
+extern const unsigned tb64lutxd1[];
+extern const unsigned tb64lutxd2[];
+extern const unsigned tb64lutxd3[];
+
+#define DU32(_u_) (tb64lutxd0[(unsigned char)(_u_     )] |\
+                   tb64lutxd1[(unsigned char)(_u_>>  8)] |\
+                   tb64lutxd2[(unsigned char)(_u_>> 16)] |\
+                   tb64lutxd3[                _u_>> 24 ] )
+
+  #if 0
+static ALWAYS_INLINE size_t _tb64xd(const unsigned char *in, size_t inlen, unsigned char *out) {
+  const unsigned char *ip    = in;
+        unsigned char *op    = out;  
+  for(; ip < (in+inlen)-4; ip += 4, op += 3) { unsigned u = ctou32(ip); u = DU32(u); stou32(op, u); }
+
+  unsigned u = 0, l = (in+inlen) - ip; 
+  if(l == 4) 																	// last 4 bytes
+    if(    ip[3]=='=') { l = 3; 
+      if(  ip[2]=='=') { l = 2; 
+        if(ip[1]=='=')   l = 1; 
+	  }
+	}
+  unsigned char *up = (unsigned char *)&u;
+  switch(l) {
+    case 4: u = ctou32(ip); u = DU32(u);                                   *op++ = up[0]; *op++ = up[1]; *op++ = up[2]; break; // 4->3 bytes
+    case 3: u = tb64lutxd0[ip[0]] | tb64lutxd1[ip[1]] | tb64lutxd2[ip[2]]; *op++ = up[0]; *op++ = up[1];                break; // 3->2 bytes
+    case 2: u = tb64lutxd0[ip[0]] | tb64lutxd1[ip[1]];                     *op++ = up[0];                               break; // 2->1 byte
+    case 1: u = tb64lutxd0[ip[0]];                                         *op++ = up[0];                               break; // 1->1 byte
+  }
+  return op-out;
+}
+  #else
+static ALWAYS_INLINE size_t _tb64xd(const unsigned char *in, size_t inlen, unsigned char *out) { 
+  const unsigned char *ip    = in;
+        unsigned char *op    = out;  
+        unsigned      cu     = 0;
+  for(; ip < (in+inlen)-4; ip += 4, op += 3) { unsigned u = ctou32(ip); u = DU32(u); stou32(op, u); cu |= u; }
+
+  unsigned u = 0, l = (in+inlen) - ip; 
+  if(l == 4) 																	// last 4 bytes
+    if(    ip[3]=='=') { l = 3; 
+      if(  ip[2]=='=') { l = 2; 
+        if(ip[1]=='=')   l = 1; 
+	  }
+	}
+  unsigned char *up = (unsigned char *)&u;
+  switch(l) {
+    case 4: u = ctou32(ip); u = DU32(u);                                   *op++ = up[0]; *op++ = up[1]; *op++ = up[2]; cu |= u; break; // 4->3 bytes
+    case 3: u = tb64lutxd0[ip[0]] | tb64lutxd1[ip[1]] | tb64lutxd2[ip[2]]; *op++ = up[0]; *op++ = up[1];                cu |= u; break; // 3->2 bytes
+    case 2: u = tb64lutxd0[ip[0]] | tb64lutxd1[ip[1]];                     *op++ = up[0];                               cu |= u; break; // 2->1 byte
+    case 1: u = tb64lutxd0[ip[0]];                                         *op++ = up[0];                               cu |= u; break; // 1->1 byte
+  }
+  return (cu == -1)?0:(op-out);
+}
+  #endif
+//--------------------------- sse -----------------------------------------------------------------
+
+#if defined(__SSSE3__)
+#include <tmmintrin.h>
+#define MM_PACK8TO6(v, cpv) {\
+  const __m128i merge_ab_and_bc = _mm_maddubs_epi16(v,            _mm_set1_epi32(0x01400140));  /*/dec_reshuffle: https://arxiv.org/abs/1704.00605 P.17*/\
+                              v = _mm_madd_epi16(merge_ab_and_bc, _mm_set1_epi32(0x00011000));\
+                              v = _mm_shuffle_epi8(v, cpv);\
+}
+
+#define MM_MAP8TO6(iv, shifted, delta_asso, delta_values, ov) { /*map 8-bits ascii to 6-bits bin*/\
+                shifted    = _mm_srli_epi32(iv, 3);\
+  const __m128i delta_hash = _mm_avg_epu8(_mm_shuffle_epi8(delta_asso, iv), shifted);\
+                        ov = _mm_add_epi8(_mm_shuffle_epi8(delta_values, delta_hash), iv);\
+}
+
+#define MM_B64CHK(iv, shifted, check_asso, check_values, vx) {\
+  const __m128i check_hash = _mm_avg_epu8( _mm_shuffle_epi8(check_asso, iv), shifted);\
+  const __m128i        chk = _mm_adds_epi8(_mm_shuffle_epi8(check_values, check_hash), iv);\
+                        vx = _mm_or_si128(vx, chk);\
+}
+
+static ALWAYS_INLINE __m128i mm_map6to8(const __m128i v) {
+  const __m128i offsets = _mm_set_epi8( 0, 0,-16,-19, -4, -4, -4, -4,   -4, -4, -4, -4, -4, -4, 71, 65);
+
+  __m128i vidx = _mm_subs_epu8(v,   _mm_set1_epi8(51));
+          vidx = _mm_sub_epi8(vidx, _mm_cmpgt_epi8(v, _mm_set1_epi8(25)));
+  return _mm_add_epi8(v, _mm_shuffle_epi8(offsets, vidx));
+}
+
+static ALWAYS_INLINE __m128i mm_unpack6to8(__m128i v) {
+  __m128i va = _mm_mulhi_epu16(_mm_and_si128(v, _mm_set1_epi32(0x0fc0fc00)), _mm_set1_epi32(0x04000040));
+  __m128i vb = _mm_mullo_epi16(_mm_and_si128(v, _mm_set1_epi32(0x003f03f0)), _mm_set1_epi32(0x01000010));
+  return       _mm_or_si128(va, vb);                        
+}
+#endif
+
+ third_party/Turbo-Base64/turbob64avx2.c view
@@ -0,0 +1,244 @@+/**
+Copyright (c) 2016-2019, Powturbo
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
+IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
+TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
+PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
+TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+    - homepage : https://sites.google.com/site/powturbo/
+    - github   : https://github.com/powturbo
+    - twitter  : https://twitter.com/powturbo
+    - email    : powturbo [_AT_] gmail [_DOT_] com
+**/
+// SSE + AVX2 Based on:
+// http://0x80.pl/articles/index.html#base64-algorithm-update
+// https://arxiv.org/abs/1704.00605
+// https://gist.github.com/aqrit/a2ccea48d7cac7e9d4d99f19d4759666 (decode)
+
+#include <immintrin.h>
+
+#define UA_MEMCPY
+#include "conf.h"
+#include "turbob64.h"
+#include "turbob64_.h"
+
+//--------------------- Decode ----------------------------------------------------------------------
+#define MM256_PACK8TO6(v,cpv) {\
+  const __m256i merge_ab_and_bc = _mm256_maddubs_epi16(v,            _mm256_set1_epi32(0x01400140));\
+                              v = _mm256_madd_epi16(merge_ab_and_bc, _mm256_set1_epi32(0x00011000));\
+                              v = _mm256_shuffle_epi8(v, cpv);\
+}
+
+#define MM256_MAP8TO6(iv, shifted, delta_asso, delta_values, ov) { /*map 8-bits ascii to 6-bits bin*/\
+                shifted    = _mm256_srli_epi32(iv, 3);\
+  const __m256i delta_hash = _mm256_avg_epu8(_mm256_shuffle_epi8(delta_asso, iv), shifted);\
+                        ov = _mm256_add_epi8(_mm256_shuffle_epi8(delta_values, delta_hash), iv);\
+}
+
+#define MM256_B64CHK(iv, shifted, check_asso, check_values, vx) {\
+  const __m256i check_hash = _mm256_avg_epu8( _mm256_shuffle_epi8(check_asso, iv), shifted);\
+  const __m256i        chk = _mm256_adds_epi8(_mm256_shuffle_epi8(check_values, check_hash), iv);\
+                        vx = _mm256_or_si256(vx, chk);\
+}
+
+#define OVD 8
+size_t tb64avx2dec(const unsigned char *in, size_t inlen, unsigned char *out) {
+  if(inlen >= 32+OVD) { 
+    const unsigned char *ip;
+          unsigned char *op; 
+    __m256i vx = _mm256_setzero_si256();
+    const __m256i delta_asso   = _mm256_setr_epi8(0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,   0x00, 0x00, 0x00, 0x00, 0x00, 0x0f, 0x00, 0x0f,
+                                                  0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,   0x00, 0x00, 0x00, 0x00, 0x00, 0x0f, 0x00, 0x0f);
+    const __m256i delta_values = _mm256_setr_epi8(0x00, 0x00, 0x00, 0x13, 0x04, 0xbf, 0xbf, 0xb9,   0xb9, 0x00, 0x10, 0xc3, 0xbf, 0xbf, 0xb9, 0xb9,
+                                                  0x00, 0x00, 0x00, 0x13, 0x04, 0xbf, 0xbf, 0xb9,   0xb9, 0x00, 0x10, 0xc3, 0xbf, 0xbf, 0xb9, 0xb9);
+      #ifndef NB64CHECK
+    const __m256i check_asso   = _mm256_setr_epi8(0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,   0x01, 0x01, 0x03, 0x07, 0x0b, 0x0b, 0x0b, 0x0f,
+                                                  0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,   0x01, 0x01, 0x03, 0x07, 0x0b, 0x0b, 0x0b, 0x0f);
+    const __m256i check_values = _mm256_setr_epi8(0x80, 0x80, 0x80, 0x80, 0xcf, 0xbf, 0xd5, 0xa6,   0xb5, 0x86, 0xd1, 0x80, 0xb1, 0x80, 0x91, 0x80,
+                                                  0x80, 0x80, 0x80, 0x80, 0xcf, 0xbf, 0xd5, 0xa6,   0xb5, 0x86, 0xd1, 0x80, 0xb1, 0x80, 0x91, 0x80);
+      #endif
+          __m256i          cpv = _mm256_set_epi8( -1, -1, -1, -1, 12, 13, 14,  8,    9, 10,  4,  5,  6,  0,  1,  2,
+                                                  -1, -1, -1, -1, 12, 13, 14,  8,    9, 10,  4,  5,  6,  0,  1,  2);
+
+    for(ip = in, op = out; ip < (in+inlen)-(64+OVD); ip += 64, op += (64/4)*3) {           
+      __m256i          iv0 = _mm256_loadu_si256((__m256i *)ip);    
+      __m256i          iv1 = _mm256_loadu_si256((__m256i *)(ip+32)); 
+   
+      __m256i ov0,shifted0; MM256_MAP8TO6(iv0, shifted0, delta_asso, delta_values, ov0); MM256_PACK8TO6(ov0, cpv);
+      __m256i ov1,shifted1; MM256_MAP8TO6(iv1, shifted1, delta_asso, delta_values, ov1); MM256_PACK8TO6(ov1, cpv); PREFETCH(ip,1024,0); 
+      
+      _mm_storeu_si128((__m128i*) op,       _mm256_castsi256_si128(ov0));
+      _mm_storeu_si128((__m128i*)(op + 12), _mm256_extracti128_si256(ov0, 1));                          
+      _mm_storeu_si128((__m128i*)(op + 24), _mm256_castsi256_si128(ov1));
+      _mm_storeu_si128((__m128i*)(op + 36), _mm256_extracti128_si256(ov1, 1));                         
+ 
+      CHECK0(MM256_B64CHK(iv0, shifted0, check_asso, check_values, vx));
+      CHECK1(MM256_B64CHK(iv1, shifted1, delta_asso, delta_values, vx));
+    }
+
+    if(ip < (in+inlen)-(32+OVD)) {
+      __m256i          iv0 = _mm256_loadu_si256((__m256i *)ip);      
+      __m256i ov0,shifted0; MM256_MAP8TO6(iv0, shifted0, delta_asso, delta_values, ov0); MM256_PACK8TO6(ov0, cpv);
+      
+      _mm_storeu_si128((__m128i*) op,       _mm256_castsi256_si128(ov0));
+      _mm_storeu_si128((__m128i*)(op + 12), _mm256_extracti128_si256(ov0, 1));                          
+      ip +=  32;
+      op += (32/4)*3;
+      CHECK1(MM256_B64CHK(iv0, shifted0, check_asso, check_values, vx));
+    }
+    size_t rc;
+    if(!(rc = _tb64xdec(ip, inlen-(ip-in), op)) || _mm256_movemask_epi8(vx)) return 0;
+    return (op-out)+rc; 
+  }
+  return _tb64xdec(in, inlen, out);
+}
+
+//-------------------- Encode ----------------------------------------------------------------------
+static ALWAYS_INLINE __m256i mm256_map6to8(const __m256i v) { /*map 6-bits bin to 8-bits ascii (https://arxiv.org/abs/1704.00605) */
+  __m256i vidx = _mm256_subs_epu8(v,   _mm256_set1_epi8(51));
+          vidx = _mm256_sub_epi8(vidx, _mm256_cmpgt_epi8(v, _mm256_set1_epi8(25)));
+
+  const __m256i offsets = _mm256_set_epi8(0, 0, -16, -19, -4, -4, -4, -4,   -4, -4, -4, -4, -4, -4, 71, 65,
+                                          0, 0, -16, -19, -4, -4, -4, -4,   -4, -4, -4, -4, -4, -4, 71, 65);
+  return _mm256_add_epi8(v, _mm256_shuffle_epi8(offsets, vidx));
+}
+
+static ALWAYS_INLINE __m256i mm256_unpack6to8(__m256i v) { /* https://arxiv.org/abs/1704.00605 p.12*/
+  __m256i va = _mm256_mulhi_epu16(_mm256_and_si256(v, _mm256_set1_epi32(0x0fc0fc00)), _mm256_set1_epi32(0x04000040));
+  __m256i vb = _mm256_mullo_epi16(_mm256_and_si256(v, _mm256_set1_epi32(0x003f03f0)), _mm256_set1_epi32(0x01000010));
+  return _mm256_or_si256(va, vb);
+}
+
+size_t tb64avx2enc(const unsigned char* in, size_t inlen, unsigned char *out) {
+  const unsigned char *ip = in; 
+        unsigned char *op = out;
+        size_t   outlen = TB64ENCLEN(inlen);
+  
+  if(outlen >= 32+OVD) {
+    const __m256i    shuf = _mm256_set_epi8(10,11, 9,10, 7, 8, 6, 7, 4,   5, 3, 4, 1, 2, 0, 1,
+                                            10,11, 9,10, 7, 8, 6, 7, 4,   5, 3, 4, 1, 2, 0, 1);
+
+    for(; op <= (out+outlen)-(64+OVD); op += 64, ip += (64/4)*3) {     								         
+      __m256i v0 = _mm256_castsi128_si256(    _mm_loadu_si128((__m128i *) ip));      
+              v0 = _mm256_inserti128_si256(v0,_mm_loadu_si128((__m128i *)(ip+12)),1);   
+      __m256i v1 = _mm256_castsi128_si256(    _mm_loadu_si128((__m128i *)(ip+24)));      
+              v1 = _mm256_inserti128_si256(v1,_mm_loadu_si128((__m128i *)(ip+36)),1);   
+
+      v0 = _mm256_shuffle_epi8(v0, shuf); v0 = mm256_unpack6to8(v0); v0 = mm256_map6to8(v0);                                                                                                           
+      v1 = _mm256_shuffle_epi8(v1, shuf); v1 = mm256_unpack6to8(v1); v1 = mm256_map6to8(v1);  PREFETCH(ip, 1024, 0);   
+
+      _mm256_storeu_si256((__m256i*) op,     v0);                                            
+      _mm256_storeu_si256((__m256i*)(op+32), v1);    
+    }
+    if(op <= (out+outlen)-(32+OVD)) {
+      __m256i v0 = _mm256_castsi128_si256(    _mm_loadu_si128((__m128i *) ip));      
+              v0 = _mm256_inserti128_si256(v0,_mm_loadu_si128((__m128i *)(ip+12)),1);   
+      v0 = _mm256_shuffle_epi8(v0, shuf); v0 = mm256_unpack6to8(v0); v0 = mm256_map6to8(v0);                                                                                                           
+      _mm256_storeu_si256((__m256i*) op, v0);                                            
+      op +=  32; 
+      ip += (32/4)*3;
+    }
+  }
+  EXTAIL();
+  return outlen;
+}
+
+//------- optimized functions for short strings only --------------------------
+// can read beyond the input buffer end, 
+// therefore input buffer size must be 32 bytes larger than input length
+
+size_t _tb64avx2dec(const unsigned char *in, size_t inlen, unsigned char *out) {
+  if(inlen >= 16) { 
+    const unsigned char *ip;
+          unsigned char *op; 
+    const __m256i delta_asso   = _mm256_setr_epi8(0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,   0x00, 0x00, 0x00, 0x00, 0x00, 0x0f, 0x00, 0x0f,
+                                                  0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,   0x00, 0x00, 0x00, 0x00, 0x00, 0x0f, 0x00, 0x0f);
+    const __m256i delta_values = _mm256_setr_epi8(0x00, 0x00, 0x00, 0x13, 0x04, 0xbf, 0xbf, 0xb9,   0xb9, 0x00, 0x10, 0xc3, 0xbf, 0xbf, 0xb9, 0xb9,
+                                                  0x00, 0x00, 0x00, 0x13, 0x04, 0xbf, 0xbf, 0xb9,   0xb9, 0x00, 0x10, 0xc3, 0xbf, 0xbf, 0xb9, 0xb9);
+      #ifndef NB64CHECK
+    const __m256i check_asso   = _mm256_setr_epi8(0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,   0x01, 0x01, 0x03, 0x07, 0x0b, 0x0b, 0x0b, 0x0f,
+                                                  0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,   0x01, 0x01, 0x03, 0x07, 0x0b, 0x0b, 0x0b, 0x0f);
+    const __m256i check_values = _mm256_setr_epi8(0x80, 0x80, 0x80, 0x80, 0xcf, 0xbf, 0xd5, 0xa6,   0xb5, 0x86, 0xd1, 0x80, 0xb1, 0x80, 0x91, 0x80,
+                                                  0x80, 0x80, 0x80, 0x80, 0xcf, 0xbf, 0xd5, 0xa6,   0xb5, 0x86, 0xd1, 0x80, 0xb1, 0x80, 0x91, 0x80);
+      #endif
+    const __m256i          cpv = _mm256_set_epi8( -1, -1, -1, -1, 12, 13, 14,  8,    9, 10,  4,  5,  6,  0,  1,  2,
+                                                  -1, -1, -1, -1, 12, 13, 14,  8,    9, 10,  4,  5,  6,  0,  1,  2);
+    __m256i vx = _mm256_setzero_si256();
+    for(ip = in, op = out; ip < (in+inlen)-32; ip += 32, op += (32/4)*3) {
+      __m256i          iv0 = _mm256_loadu_si256((__m256i *)ip);
+      __m256i ov0,shifted0; MM256_MAP8TO6(iv0, shifted0, delta_asso, delta_values, ov0); MM256_PACK8TO6(ov0, cpv);
+      
+      _mm_storeu_si128((__m128i*) op,       _mm256_castsi256_si128(ov0));
+      _mm_storeu_si128((__m128i*)(op + 12), _mm256_extracti128_si256(ov0, 1));                          
+      CHECK0(MM256_B64CHK(iv0, shifted0, check_asso, check_values, vx));
+    }
+
+    unsigned cx;
+    if(ip < (in+inlen)-16) {
+      __m128i iv0 = _mm_loadu_si128((__m128i *) ip);
+      __m128i _vx = _mm_or_si128(_mm256_extracti128_si256(vx, 1), _mm256_castsi256_si128(vx));
+      __m128i ov0, shifted0; MM_MAP8TO6( iv0, shifted0,_mm256_castsi256_si128(delta_asso),_mm256_castsi256_si128(delta_values), ov0); 
+	                         MM_PACK8TO6(ov0, _mm256_castsi256_si128(cpv));
+      _mm_storeu_si128((__m128i*) op, ov0);  
+      ip += 16; op += (16/4)*3;
+      CHECK0(MM_B64CHK(iv0, shifted0, _mm256_castsi256_si128(check_asso), _mm256_castsi256_si128(check_values), _vx));
+      cx = _mm_movemask_epi8(_vx);
+    } else
+      cx = _mm256_movemask_epi8(vx);
+
+    size_t rc = _tb64xd(ip, inlen-(ip-in), op);
+    if(!rc || cx) return 0;
+    return (op-out)+rc;
+  }
+  return _tb64xd(in, inlen, out);
+}
+
+size_t _tb64avx2enc(const unsigned char* in, size_t inlen, unsigned char *out) {
+  const unsigned char *ip = in; 
+        unsigned char *op = out;
+        size_t   outlen = TB64ENCLEN(inlen);
+  if(outlen >= 32+4) { 
+    const __m256i    shuf = _mm256_set_epi8(10,11, 9,10, 7, 8, 6, 7, 4,   5, 3, 4, 1, 2, 0, 1,
+                                            10,11, 9,10, 7, 8, 6, 7, 4,   5, 3, 4, 1, 2, 0, 1);
+
+    for(; op <= (out+outlen)-32; op += 32, ip += (32/4)*3) {
+      __m256i v0 = _mm256_castsi128_si256(    _mm_loadu_si128((__m128i *) ip));      
+              v0 = _mm256_inserti128_si256(v0,_mm_loadu_si128((__m128i *)(ip+12)),1);   
+      v0 = _mm256_shuffle_epi8(v0, shuf); v0 = mm256_unpack6to8(v0); v0 = mm256_map6to8(v0);                                                                                                           
+      _mm256_storeu_si256((__m256i*) op,     v0);                                            
+    }
+  }
+  if(op <= (out+outlen)-(16+4)) {
+    const __m128i    shuf = _mm_set_epi8(10,11, 9,10, 7, 8, 6, 7, 4,   5, 3, 4, 1, 2, 0, 1);
+
+    __m128i v0 = _mm_loadu_si128((__m128i*)ip);
+            v0 = _mm_shuffle_epi8(v0, shuf);
+            v0 = mm_unpack6to8(v0);
+            v0 = mm_map6to8(v0);
+    _mm_storeu_si128((__m128i*) op, v0);                                          
+    op += 16; ip += (16/4)*3;
+  }
+  EXTAIL();
+  return outlen;
+}
+
+ third_party/Turbo-Base64/turbob64c.c view
@@ -0,0 +1,369 @@+/**
+Copyright (c) 2016-2019, Powturbo
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
+IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
+TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
+PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
+TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+    - homepage : https://sites.google.com/site/powturbo/
+    - github   : https://github.com/powturbo
+    - twitter  : https://twitter.com/powturbo
+    - email    : powturbo [_AT_] gmail [_DOT_] com
+**/
+//------------- TurboBase64 : Base64 encoding ----------------------
+#define UA_MEMCPY
+#include "conf.h"
+#include "turbob64.h"
+#include "turbob64_.h"
+
+#define NES 128    
+#define NEX 128 
+
+size_t tb64enclen(size_t n) { return TB64ENCLEN(n); }
+
+//----------------------- small 64 bytes lut encoding ---------------------------------------
+#define SI32(_i_) { \
+  unsigned _u0 = BSWAP32(ctou32(ip+_i_*6    ));\
+  unsigned _u1 = BSWAP32(ctou32(ip+_i_*6 + 3));\
+  _u0 = SU32(_u0);\
+  _u1 = SU32(_u1);\
+  stou32(op+_i_*8    , _u0);\
+  stou32(op+_i_*8 + 4, _u1);\
+}
+
+unsigned char tb64lutse[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+
+#define OVS 8
+size_t tb64senc(const unsigned char *in, size_t inlen, unsigned char *out) {
+  const  unsigned char *ip    = in;
+         unsigned char *op    = out;
+         size_t        outlen = TB64ENCLEN(inlen);
+ 		 
+  if(outlen >= 16+OVS) {
+      #if NES >= 64	  
+    for(; op <= (out+outlen)-(NES+OVS); op += NES, ip += (NES/4)*3) {                     // 96/48->128/64 bytes
+      SI32(0); SI32(1); SI32( 2); SI32( 3); SI32( 4); SI32( 5); SI32( 6); SI32( 7); 
+        #if NES >= 128	  
+      SI32(8); SI32(9); SI32(10); SI32(11); SI32(12); SI32(13); SI32(14); SI32(15);    
+	    #endif
+	                                                                                  PREFETCH(ip,256, 0);
+    }
+	  #endif
+    for(; op <= (out+outlen)-(16+OVS); op += 16, ip += (16/4)*3) { SI32(0); SI32(1); }
+  }
+  for(; op < (out+outlen)-4; op += 4, ip += 3) { unsigned _u = BSWAP32(ctou32(ip)); stou32(op, SU32(_u)); }\
+  ETAIL(); 
+  return outlen;
+}
+
+//---------------------- Fast encoding with 4k LUT ------------------------------------------------------------
+const unsigned short tb64lutxe[1<<12] = { 
+0x4141,0x4241,0x4341,0x4441,0x4541,0x4641,0x4741,0x4841,0x4941,0x4a41,0x4b41,0x4c41,0x4d41,0x4e41,0x4f41,0x5041,
+0x5141,0x5241,0x5341,0x5441,0x5541,0x5641,0x5741,0x5841,0x5941,0x5a41,0x6141,0x6241,0x6341,0x6441,0x6541,0x6641,
+0x6741,0x6841,0x6941,0x6a41,0x6b41,0x6c41,0x6d41,0x6e41,0x6f41,0x7041,0x7141,0x7241,0x7341,0x7441,0x7541,0x7641,
+0x7741,0x7841,0x7941,0x7a41,0x3041,0x3141,0x3241,0x3341,0x3441,0x3541,0x3641,0x3741,0x3841,0x3941,0x2b41,0x2f41,
+0x4142,0x4242,0x4342,0x4442,0x4542,0x4642,0x4742,0x4842,0x4942,0x4a42,0x4b42,0x4c42,0x4d42,0x4e42,0x4f42,0x5042,
+0x5142,0x5242,0x5342,0x5442,0x5542,0x5642,0x5742,0x5842,0x5942,0x5a42,0x6142,0x6242,0x6342,0x6442,0x6542,0x6642,
+0x6742,0x6842,0x6942,0x6a42,0x6b42,0x6c42,0x6d42,0x6e42,0x6f42,0x7042,0x7142,0x7242,0x7342,0x7442,0x7542,0x7642,
+0x7742,0x7842,0x7942,0x7a42,0x3042,0x3142,0x3242,0x3342,0x3442,0x3542,0x3642,0x3742,0x3842,0x3942,0x2b42,0x2f42,
+0x4143,0x4243,0x4343,0x4443,0x4543,0x4643,0x4743,0x4843,0x4943,0x4a43,0x4b43,0x4c43,0x4d43,0x4e43,0x4f43,0x5043,
+0x5143,0x5243,0x5343,0x5443,0x5543,0x5643,0x5743,0x5843,0x5943,0x5a43,0x6143,0x6243,0x6343,0x6443,0x6543,0x6643,
+0x6743,0x6843,0x6943,0x6a43,0x6b43,0x6c43,0x6d43,0x6e43,0x6f43,0x7043,0x7143,0x7243,0x7343,0x7443,0x7543,0x7643,
+0x7743,0x7843,0x7943,0x7a43,0x3043,0x3143,0x3243,0x3343,0x3443,0x3543,0x3643,0x3743,0x3843,0x3943,0x2b43,0x2f43,
+0x4144,0x4244,0x4344,0x4444,0x4544,0x4644,0x4744,0x4844,0x4944,0x4a44,0x4b44,0x4c44,0x4d44,0x4e44,0x4f44,0x5044,
+0x5144,0x5244,0x5344,0x5444,0x5544,0x5644,0x5744,0x5844,0x5944,0x5a44,0x6144,0x6244,0x6344,0x6444,0x6544,0x6644,
+0x6744,0x6844,0x6944,0x6a44,0x6b44,0x6c44,0x6d44,0x6e44,0x6f44,0x7044,0x7144,0x7244,0x7344,0x7444,0x7544,0x7644,
+0x7744,0x7844,0x7944,0x7a44,0x3044,0x3144,0x3244,0x3344,0x3444,0x3544,0x3644,0x3744,0x3844,0x3944,0x2b44,0x2f44,
+0x4145,0x4245,0x4345,0x4445,0x4545,0x4645,0x4745,0x4845,0x4945,0x4a45,0x4b45,0x4c45,0x4d45,0x4e45,0x4f45,0x5045,
+0x5145,0x5245,0x5345,0x5445,0x5545,0x5645,0x5745,0x5845,0x5945,0x5a45,0x6145,0x6245,0x6345,0x6445,0x6545,0x6645,
+0x6745,0x6845,0x6945,0x6a45,0x6b45,0x6c45,0x6d45,0x6e45,0x6f45,0x7045,0x7145,0x7245,0x7345,0x7445,0x7545,0x7645,
+0x7745,0x7845,0x7945,0x7a45,0x3045,0x3145,0x3245,0x3345,0x3445,0x3545,0x3645,0x3745,0x3845,0x3945,0x2b45,0x2f45,
+0x4146,0x4246,0x4346,0x4446,0x4546,0x4646,0x4746,0x4846,0x4946,0x4a46,0x4b46,0x4c46,0x4d46,0x4e46,0x4f46,0x5046,
+0x5146,0x5246,0x5346,0x5446,0x5546,0x5646,0x5746,0x5846,0x5946,0x5a46,0x6146,0x6246,0x6346,0x6446,0x6546,0x6646,
+0x6746,0x6846,0x6946,0x6a46,0x6b46,0x6c46,0x6d46,0x6e46,0x6f46,0x7046,0x7146,0x7246,0x7346,0x7446,0x7546,0x7646,
+0x7746,0x7846,0x7946,0x7a46,0x3046,0x3146,0x3246,0x3346,0x3446,0x3546,0x3646,0x3746,0x3846,0x3946,0x2b46,0x2f46,
+0x4147,0x4247,0x4347,0x4447,0x4547,0x4647,0x4747,0x4847,0x4947,0x4a47,0x4b47,0x4c47,0x4d47,0x4e47,0x4f47,0x5047,
+0x5147,0x5247,0x5347,0x5447,0x5547,0x5647,0x5747,0x5847,0x5947,0x5a47,0x6147,0x6247,0x6347,0x6447,0x6547,0x6647,
+0x6747,0x6847,0x6947,0x6a47,0x6b47,0x6c47,0x6d47,0x6e47,0x6f47,0x7047,0x7147,0x7247,0x7347,0x7447,0x7547,0x7647,
+0x7747,0x7847,0x7947,0x7a47,0x3047,0x3147,0x3247,0x3347,0x3447,0x3547,0x3647,0x3747,0x3847,0x3947,0x2b47,0x2f47,
+0x4148,0x4248,0x4348,0x4448,0x4548,0x4648,0x4748,0x4848,0x4948,0x4a48,0x4b48,0x4c48,0x4d48,0x4e48,0x4f48,0x5048,
+0x5148,0x5248,0x5348,0x5448,0x5548,0x5648,0x5748,0x5848,0x5948,0x5a48,0x6148,0x6248,0x6348,0x6448,0x6548,0x6648,
+0x6748,0x6848,0x6948,0x6a48,0x6b48,0x6c48,0x6d48,0x6e48,0x6f48,0x7048,0x7148,0x7248,0x7348,0x7448,0x7548,0x7648,
+0x7748,0x7848,0x7948,0x7a48,0x3048,0x3148,0x3248,0x3348,0x3448,0x3548,0x3648,0x3748,0x3848,0x3948,0x2b48,0x2f48,
+0x4149,0x4249,0x4349,0x4449,0x4549,0x4649,0x4749,0x4849,0x4949,0x4a49,0x4b49,0x4c49,0x4d49,0x4e49,0x4f49,0x5049,
+0x5149,0x5249,0x5349,0x5449,0x5549,0x5649,0x5749,0x5849,0x5949,0x5a49,0x6149,0x6249,0x6349,0x6449,0x6549,0x6649,
+0x6749,0x6849,0x6949,0x6a49,0x6b49,0x6c49,0x6d49,0x6e49,0x6f49,0x7049,0x7149,0x7249,0x7349,0x7449,0x7549,0x7649,
+0x7749,0x7849,0x7949,0x7a49,0x3049,0x3149,0x3249,0x3349,0x3449,0x3549,0x3649,0x3749,0x3849,0x3949,0x2b49,0x2f49,
+0x414a,0x424a,0x434a,0x444a,0x454a,0x464a,0x474a,0x484a,0x494a,0x4a4a,0x4b4a,0x4c4a,0x4d4a,0x4e4a,0x4f4a,0x504a,
+0x514a,0x524a,0x534a,0x544a,0x554a,0x564a,0x574a,0x584a,0x594a,0x5a4a,0x614a,0x624a,0x634a,0x644a,0x654a,0x664a,
+0x674a,0x684a,0x694a,0x6a4a,0x6b4a,0x6c4a,0x6d4a,0x6e4a,0x6f4a,0x704a,0x714a,0x724a,0x734a,0x744a,0x754a,0x764a,
+0x774a,0x784a,0x794a,0x7a4a,0x304a,0x314a,0x324a,0x334a,0x344a,0x354a,0x364a,0x374a,0x384a,0x394a,0x2b4a,0x2f4a,
+0x414b,0x424b,0x434b,0x444b,0x454b,0x464b,0x474b,0x484b,0x494b,0x4a4b,0x4b4b,0x4c4b,0x4d4b,0x4e4b,0x4f4b,0x504b,
+0x514b,0x524b,0x534b,0x544b,0x554b,0x564b,0x574b,0x584b,0x594b,0x5a4b,0x614b,0x624b,0x634b,0x644b,0x654b,0x664b,
+0x674b,0x684b,0x694b,0x6a4b,0x6b4b,0x6c4b,0x6d4b,0x6e4b,0x6f4b,0x704b,0x714b,0x724b,0x734b,0x744b,0x754b,0x764b,
+0x774b,0x784b,0x794b,0x7a4b,0x304b,0x314b,0x324b,0x334b,0x344b,0x354b,0x364b,0x374b,0x384b,0x394b,0x2b4b,0x2f4b,
+0x414c,0x424c,0x434c,0x444c,0x454c,0x464c,0x474c,0x484c,0x494c,0x4a4c,0x4b4c,0x4c4c,0x4d4c,0x4e4c,0x4f4c,0x504c,
+0x514c,0x524c,0x534c,0x544c,0x554c,0x564c,0x574c,0x584c,0x594c,0x5a4c,0x614c,0x624c,0x634c,0x644c,0x654c,0x664c,
+0x674c,0x684c,0x694c,0x6a4c,0x6b4c,0x6c4c,0x6d4c,0x6e4c,0x6f4c,0x704c,0x714c,0x724c,0x734c,0x744c,0x754c,0x764c,
+0x774c,0x784c,0x794c,0x7a4c,0x304c,0x314c,0x324c,0x334c,0x344c,0x354c,0x364c,0x374c,0x384c,0x394c,0x2b4c,0x2f4c,
+0x414d,0x424d,0x434d,0x444d,0x454d,0x464d,0x474d,0x484d,0x494d,0x4a4d,0x4b4d,0x4c4d,0x4d4d,0x4e4d,0x4f4d,0x504d,
+0x514d,0x524d,0x534d,0x544d,0x554d,0x564d,0x574d,0x584d,0x594d,0x5a4d,0x614d,0x624d,0x634d,0x644d,0x654d,0x664d,
+0x674d,0x684d,0x694d,0x6a4d,0x6b4d,0x6c4d,0x6d4d,0x6e4d,0x6f4d,0x704d,0x714d,0x724d,0x734d,0x744d,0x754d,0x764d,
+0x774d,0x784d,0x794d,0x7a4d,0x304d,0x314d,0x324d,0x334d,0x344d,0x354d,0x364d,0x374d,0x384d,0x394d,0x2b4d,0x2f4d,
+0x414e,0x424e,0x434e,0x444e,0x454e,0x464e,0x474e,0x484e,0x494e,0x4a4e,0x4b4e,0x4c4e,0x4d4e,0x4e4e,0x4f4e,0x504e,
+0x514e,0x524e,0x534e,0x544e,0x554e,0x564e,0x574e,0x584e,0x594e,0x5a4e,0x614e,0x624e,0x634e,0x644e,0x654e,0x664e,
+0x674e,0x684e,0x694e,0x6a4e,0x6b4e,0x6c4e,0x6d4e,0x6e4e,0x6f4e,0x704e,0x714e,0x724e,0x734e,0x744e,0x754e,0x764e,
+0x774e,0x784e,0x794e,0x7a4e,0x304e,0x314e,0x324e,0x334e,0x344e,0x354e,0x364e,0x374e,0x384e,0x394e,0x2b4e,0x2f4e,
+0x414f,0x424f,0x434f,0x444f,0x454f,0x464f,0x474f,0x484f,0x494f,0x4a4f,0x4b4f,0x4c4f,0x4d4f,0x4e4f,0x4f4f,0x504f,
+0x514f,0x524f,0x534f,0x544f,0x554f,0x564f,0x574f,0x584f,0x594f,0x5a4f,0x614f,0x624f,0x634f,0x644f,0x654f,0x664f,
+0x674f,0x684f,0x694f,0x6a4f,0x6b4f,0x6c4f,0x6d4f,0x6e4f,0x6f4f,0x704f,0x714f,0x724f,0x734f,0x744f,0x754f,0x764f,
+0x774f,0x784f,0x794f,0x7a4f,0x304f,0x314f,0x324f,0x334f,0x344f,0x354f,0x364f,0x374f,0x384f,0x394f,0x2b4f,0x2f4f,
+0x4150,0x4250,0x4350,0x4450,0x4550,0x4650,0x4750,0x4850,0x4950,0x4a50,0x4b50,0x4c50,0x4d50,0x4e50,0x4f50,0x5050,
+0x5150,0x5250,0x5350,0x5450,0x5550,0x5650,0x5750,0x5850,0x5950,0x5a50,0x6150,0x6250,0x6350,0x6450,0x6550,0x6650,
+0x6750,0x6850,0x6950,0x6a50,0x6b50,0x6c50,0x6d50,0x6e50,0x6f50,0x7050,0x7150,0x7250,0x7350,0x7450,0x7550,0x7650,
+0x7750,0x7850,0x7950,0x7a50,0x3050,0x3150,0x3250,0x3350,0x3450,0x3550,0x3650,0x3750,0x3850,0x3950,0x2b50,0x2f50,
+0x4151,0x4251,0x4351,0x4451,0x4551,0x4651,0x4751,0x4851,0x4951,0x4a51,0x4b51,0x4c51,0x4d51,0x4e51,0x4f51,0x5051,
+0x5151,0x5251,0x5351,0x5451,0x5551,0x5651,0x5751,0x5851,0x5951,0x5a51,0x6151,0x6251,0x6351,0x6451,0x6551,0x6651,
+0x6751,0x6851,0x6951,0x6a51,0x6b51,0x6c51,0x6d51,0x6e51,0x6f51,0x7051,0x7151,0x7251,0x7351,0x7451,0x7551,0x7651,
+0x7751,0x7851,0x7951,0x7a51,0x3051,0x3151,0x3251,0x3351,0x3451,0x3551,0x3651,0x3751,0x3851,0x3951,0x2b51,0x2f51,
+0x4152,0x4252,0x4352,0x4452,0x4552,0x4652,0x4752,0x4852,0x4952,0x4a52,0x4b52,0x4c52,0x4d52,0x4e52,0x4f52,0x5052,
+0x5152,0x5252,0x5352,0x5452,0x5552,0x5652,0x5752,0x5852,0x5952,0x5a52,0x6152,0x6252,0x6352,0x6452,0x6552,0x6652,
+0x6752,0x6852,0x6952,0x6a52,0x6b52,0x6c52,0x6d52,0x6e52,0x6f52,0x7052,0x7152,0x7252,0x7352,0x7452,0x7552,0x7652,
+0x7752,0x7852,0x7952,0x7a52,0x3052,0x3152,0x3252,0x3352,0x3452,0x3552,0x3652,0x3752,0x3852,0x3952,0x2b52,0x2f52,
+0x4153,0x4253,0x4353,0x4453,0x4553,0x4653,0x4753,0x4853,0x4953,0x4a53,0x4b53,0x4c53,0x4d53,0x4e53,0x4f53,0x5053,
+0x5153,0x5253,0x5353,0x5453,0x5553,0x5653,0x5753,0x5853,0x5953,0x5a53,0x6153,0x6253,0x6353,0x6453,0x6553,0x6653,
+0x6753,0x6853,0x6953,0x6a53,0x6b53,0x6c53,0x6d53,0x6e53,0x6f53,0x7053,0x7153,0x7253,0x7353,0x7453,0x7553,0x7653,
+0x7753,0x7853,0x7953,0x7a53,0x3053,0x3153,0x3253,0x3353,0x3453,0x3553,0x3653,0x3753,0x3853,0x3953,0x2b53,0x2f53,
+0x4154,0x4254,0x4354,0x4454,0x4554,0x4654,0x4754,0x4854,0x4954,0x4a54,0x4b54,0x4c54,0x4d54,0x4e54,0x4f54,0x5054,
+0x5154,0x5254,0x5354,0x5454,0x5554,0x5654,0x5754,0x5854,0x5954,0x5a54,0x6154,0x6254,0x6354,0x6454,0x6554,0x6654,
+0x6754,0x6854,0x6954,0x6a54,0x6b54,0x6c54,0x6d54,0x6e54,0x6f54,0x7054,0x7154,0x7254,0x7354,0x7454,0x7554,0x7654,
+0x7754,0x7854,0x7954,0x7a54,0x3054,0x3154,0x3254,0x3354,0x3454,0x3554,0x3654,0x3754,0x3854,0x3954,0x2b54,0x2f54,
+0x4155,0x4255,0x4355,0x4455,0x4555,0x4655,0x4755,0x4855,0x4955,0x4a55,0x4b55,0x4c55,0x4d55,0x4e55,0x4f55,0x5055,
+0x5155,0x5255,0x5355,0x5455,0x5555,0x5655,0x5755,0x5855,0x5955,0x5a55,0x6155,0x6255,0x6355,0x6455,0x6555,0x6655,
+0x6755,0x6855,0x6955,0x6a55,0x6b55,0x6c55,0x6d55,0x6e55,0x6f55,0x7055,0x7155,0x7255,0x7355,0x7455,0x7555,0x7655,
+0x7755,0x7855,0x7955,0x7a55,0x3055,0x3155,0x3255,0x3355,0x3455,0x3555,0x3655,0x3755,0x3855,0x3955,0x2b55,0x2f55,
+0x4156,0x4256,0x4356,0x4456,0x4556,0x4656,0x4756,0x4856,0x4956,0x4a56,0x4b56,0x4c56,0x4d56,0x4e56,0x4f56,0x5056,
+0x5156,0x5256,0x5356,0x5456,0x5556,0x5656,0x5756,0x5856,0x5956,0x5a56,0x6156,0x6256,0x6356,0x6456,0x6556,0x6656,
+0x6756,0x6856,0x6956,0x6a56,0x6b56,0x6c56,0x6d56,0x6e56,0x6f56,0x7056,0x7156,0x7256,0x7356,0x7456,0x7556,0x7656,
+0x7756,0x7856,0x7956,0x7a56,0x3056,0x3156,0x3256,0x3356,0x3456,0x3556,0x3656,0x3756,0x3856,0x3956,0x2b56,0x2f56,
+0x4157,0x4257,0x4357,0x4457,0x4557,0x4657,0x4757,0x4857,0x4957,0x4a57,0x4b57,0x4c57,0x4d57,0x4e57,0x4f57,0x5057,
+0x5157,0x5257,0x5357,0x5457,0x5557,0x5657,0x5757,0x5857,0x5957,0x5a57,0x6157,0x6257,0x6357,0x6457,0x6557,0x6657,
+0x6757,0x6857,0x6957,0x6a57,0x6b57,0x6c57,0x6d57,0x6e57,0x6f57,0x7057,0x7157,0x7257,0x7357,0x7457,0x7557,0x7657,
+0x7757,0x7857,0x7957,0x7a57,0x3057,0x3157,0x3257,0x3357,0x3457,0x3557,0x3657,0x3757,0x3857,0x3957,0x2b57,0x2f57,
+0x4158,0x4258,0x4358,0x4458,0x4558,0x4658,0x4758,0x4858,0x4958,0x4a58,0x4b58,0x4c58,0x4d58,0x4e58,0x4f58,0x5058,
+0x5158,0x5258,0x5358,0x5458,0x5558,0x5658,0x5758,0x5858,0x5958,0x5a58,0x6158,0x6258,0x6358,0x6458,0x6558,0x6658,
+0x6758,0x6858,0x6958,0x6a58,0x6b58,0x6c58,0x6d58,0x6e58,0x6f58,0x7058,0x7158,0x7258,0x7358,0x7458,0x7558,0x7658,
+0x7758,0x7858,0x7958,0x7a58,0x3058,0x3158,0x3258,0x3358,0x3458,0x3558,0x3658,0x3758,0x3858,0x3958,0x2b58,0x2f58,
+0x4159,0x4259,0x4359,0x4459,0x4559,0x4659,0x4759,0x4859,0x4959,0x4a59,0x4b59,0x4c59,0x4d59,0x4e59,0x4f59,0x5059,
+0x5159,0x5259,0x5359,0x5459,0x5559,0x5659,0x5759,0x5859,0x5959,0x5a59,0x6159,0x6259,0x6359,0x6459,0x6559,0x6659,
+0x6759,0x6859,0x6959,0x6a59,0x6b59,0x6c59,0x6d59,0x6e59,0x6f59,0x7059,0x7159,0x7259,0x7359,0x7459,0x7559,0x7659,
+0x7759,0x7859,0x7959,0x7a59,0x3059,0x3159,0x3259,0x3359,0x3459,0x3559,0x3659,0x3759,0x3859,0x3959,0x2b59,0x2f59,
+0x415a,0x425a,0x435a,0x445a,0x455a,0x465a,0x475a,0x485a,0x495a,0x4a5a,0x4b5a,0x4c5a,0x4d5a,0x4e5a,0x4f5a,0x505a,
+0x515a,0x525a,0x535a,0x545a,0x555a,0x565a,0x575a,0x585a,0x595a,0x5a5a,0x615a,0x625a,0x635a,0x645a,0x655a,0x665a,
+0x675a,0x685a,0x695a,0x6a5a,0x6b5a,0x6c5a,0x6d5a,0x6e5a,0x6f5a,0x705a,0x715a,0x725a,0x735a,0x745a,0x755a,0x765a,
+0x775a,0x785a,0x795a,0x7a5a,0x305a,0x315a,0x325a,0x335a,0x345a,0x355a,0x365a,0x375a,0x385a,0x395a,0x2b5a,0x2f5a,
+0x4161,0x4261,0x4361,0x4461,0x4561,0x4661,0x4761,0x4861,0x4961,0x4a61,0x4b61,0x4c61,0x4d61,0x4e61,0x4f61,0x5061,
+0x5161,0x5261,0x5361,0x5461,0x5561,0x5661,0x5761,0x5861,0x5961,0x5a61,0x6161,0x6261,0x6361,0x6461,0x6561,0x6661,
+0x6761,0x6861,0x6961,0x6a61,0x6b61,0x6c61,0x6d61,0x6e61,0x6f61,0x7061,0x7161,0x7261,0x7361,0x7461,0x7561,0x7661,
+0x7761,0x7861,0x7961,0x7a61,0x3061,0x3161,0x3261,0x3361,0x3461,0x3561,0x3661,0x3761,0x3861,0x3961,0x2b61,0x2f61,
+0x4162,0x4262,0x4362,0x4462,0x4562,0x4662,0x4762,0x4862,0x4962,0x4a62,0x4b62,0x4c62,0x4d62,0x4e62,0x4f62,0x5062,
+0x5162,0x5262,0x5362,0x5462,0x5562,0x5662,0x5762,0x5862,0x5962,0x5a62,0x6162,0x6262,0x6362,0x6462,0x6562,0x6662,
+0x6762,0x6862,0x6962,0x6a62,0x6b62,0x6c62,0x6d62,0x6e62,0x6f62,0x7062,0x7162,0x7262,0x7362,0x7462,0x7562,0x7662,
+0x7762,0x7862,0x7962,0x7a62,0x3062,0x3162,0x3262,0x3362,0x3462,0x3562,0x3662,0x3762,0x3862,0x3962,0x2b62,0x2f62,
+0x4163,0x4263,0x4363,0x4463,0x4563,0x4663,0x4763,0x4863,0x4963,0x4a63,0x4b63,0x4c63,0x4d63,0x4e63,0x4f63,0x5063,
+0x5163,0x5263,0x5363,0x5463,0x5563,0x5663,0x5763,0x5863,0x5963,0x5a63,0x6163,0x6263,0x6363,0x6463,0x6563,0x6663,
+0x6763,0x6863,0x6963,0x6a63,0x6b63,0x6c63,0x6d63,0x6e63,0x6f63,0x7063,0x7163,0x7263,0x7363,0x7463,0x7563,0x7663,
+0x7763,0x7863,0x7963,0x7a63,0x3063,0x3163,0x3263,0x3363,0x3463,0x3563,0x3663,0x3763,0x3863,0x3963,0x2b63,0x2f63,
+0x4164,0x4264,0x4364,0x4464,0x4564,0x4664,0x4764,0x4864,0x4964,0x4a64,0x4b64,0x4c64,0x4d64,0x4e64,0x4f64,0x5064,
+0x5164,0x5264,0x5364,0x5464,0x5564,0x5664,0x5764,0x5864,0x5964,0x5a64,0x6164,0x6264,0x6364,0x6464,0x6564,0x6664,
+0x6764,0x6864,0x6964,0x6a64,0x6b64,0x6c64,0x6d64,0x6e64,0x6f64,0x7064,0x7164,0x7264,0x7364,0x7464,0x7564,0x7664,
+0x7764,0x7864,0x7964,0x7a64,0x3064,0x3164,0x3264,0x3364,0x3464,0x3564,0x3664,0x3764,0x3864,0x3964,0x2b64,0x2f64,
+0x4165,0x4265,0x4365,0x4465,0x4565,0x4665,0x4765,0x4865,0x4965,0x4a65,0x4b65,0x4c65,0x4d65,0x4e65,0x4f65,0x5065,
+0x5165,0x5265,0x5365,0x5465,0x5565,0x5665,0x5765,0x5865,0x5965,0x5a65,0x6165,0x6265,0x6365,0x6465,0x6565,0x6665,
+0x6765,0x6865,0x6965,0x6a65,0x6b65,0x6c65,0x6d65,0x6e65,0x6f65,0x7065,0x7165,0x7265,0x7365,0x7465,0x7565,0x7665,
+0x7765,0x7865,0x7965,0x7a65,0x3065,0x3165,0x3265,0x3365,0x3465,0x3565,0x3665,0x3765,0x3865,0x3965,0x2b65,0x2f65,
+0x4166,0x4266,0x4366,0x4466,0x4566,0x4666,0x4766,0x4866,0x4966,0x4a66,0x4b66,0x4c66,0x4d66,0x4e66,0x4f66,0x5066,
+0x5166,0x5266,0x5366,0x5466,0x5566,0x5666,0x5766,0x5866,0x5966,0x5a66,0x6166,0x6266,0x6366,0x6466,0x6566,0x6666,
+0x6766,0x6866,0x6966,0x6a66,0x6b66,0x6c66,0x6d66,0x6e66,0x6f66,0x7066,0x7166,0x7266,0x7366,0x7466,0x7566,0x7666,
+0x7766,0x7866,0x7966,0x7a66,0x3066,0x3166,0x3266,0x3366,0x3466,0x3566,0x3666,0x3766,0x3866,0x3966,0x2b66,0x2f66,
+0x4167,0x4267,0x4367,0x4467,0x4567,0x4667,0x4767,0x4867,0x4967,0x4a67,0x4b67,0x4c67,0x4d67,0x4e67,0x4f67,0x5067,
+0x5167,0x5267,0x5367,0x5467,0x5567,0x5667,0x5767,0x5867,0x5967,0x5a67,0x6167,0x6267,0x6367,0x6467,0x6567,0x6667,
+0x6767,0x6867,0x6967,0x6a67,0x6b67,0x6c67,0x6d67,0x6e67,0x6f67,0x7067,0x7167,0x7267,0x7367,0x7467,0x7567,0x7667,
+0x7767,0x7867,0x7967,0x7a67,0x3067,0x3167,0x3267,0x3367,0x3467,0x3567,0x3667,0x3767,0x3867,0x3967,0x2b67,0x2f67,
+0x4168,0x4268,0x4368,0x4468,0x4568,0x4668,0x4768,0x4868,0x4968,0x4a68,0x4b68,0x4c68,0x4d68,0x4e68,0x4f68,0x5068,
+0x5168,0x5268,0x5368,0x5468,0x5568,0x5668,0x5768,0x5868,0x5968,0x5a68,0x6168,0x6268,0x6368,0x6468,0x6568,0x6668,
+0x6768,0x6868,0x6968,0x6a68,0x6b68,0x6c68,0x6d68,0x6e68,0x6f68,0x7068,0x7168,0x7268,0x7368,0x7468,0x7568,0x7668,
+0x7768,0x7868,0x7968,0x7a68,0x3068,0x3168,0x3268,0x3368,0x3468,0x3568,0x3668,0x3768,0x3868,0x3968,0x2b68,0x2f68,
+0x4169,0x4269,0x4369,0x4469,0x4569,0x4669,0x4769,0x4869,0x4969,0x4a69,0x4b69,0x4c69,0x4d69,0x4e69,0x4f69,0x5069,
+0x5169,0x5269,0x5369,0x5469,0x5569,0x5669,0x5769,0x5869,0x5969,0x5a69,0x6169,0x6269,0x6369,0x6469,0x6569,0x6669,
+0x6769,0x6869,0x6969,0x6a69,0x6b69,0x6c69,0x6d69,0x6e69,0x6f69,0x7069,0x7169,0x7269,0x7369,0x7469,0x7569,0x7669,
+0x7769,0x7869,0x7969,0x7a69,0x3069,0x3169,0x3269,0x3369,0x3469,0x3569,0x3669,0x3769,0x3869,0x3969,0x2b69,0x2f69,
+0x416a,0x426a,0x436a,0x446a,0x456a,0x466a,0x476a,0x486a,0x496a,0x4a6a,0x4b6a,0x4c6a,0x4d6a,0x4e6a,0x4f6a,0x506a,
+0x516a,0x526a,0x536a,0x546a,0x556a,0x566a,0x576a,0x586a,0x596a,0x5a6a,0x616a,0x626a,0x636a,0x646a,0x656a,0x666a,
+0x676a,0x686a,0x696a,0x6a6a,0x6b6a,0x6c6a,0x6d6a,0x6e6a,0x6f6a,0x706a,0x716a,0x726a,0x736a,0x746a,0x756a,0x766a,
+0x776a,0x786a,0x796a,0x7a6a,0x306a,0x316a,0x326a,0x336a,0x346a,0x356a,0x366a,0x376a,0x386a,0x396a,0x2b6a,0x2f6a,
+0x416b,0x426b,0x436b,0x446b,0x456b,0x466b,0x476b,0x486b,0x496b,0x4a6b,0x4b6b,0x4c6b,0x4d6b,0x4e6b,0x4f6b,0x506b,
+0x516b,0x526b,0x536b,0x546b,0x556b,0x566b,0x576b,0x586b,0x596b,0x5a6b,0x616b,0x626b,0x636b,0x646b,0x656b,0x666b,
+0x676b,0x686b,0x696b,0x6a6b,0x6b6b,0x6c6b,0x6d6b,0x6e6b,0x6f6b,0x706b,0x716b,0x726b,0x736b,0x746b,0x756b,0x766b,
+0x776b,0x786b,0x796b,0x7a6b,0x306b,0x316b,0x326b,0x336b,0x346b,0x356b,0x366b,0x376b,0x386b,0x396b,0x2b6b,0x2f6b,
+0x416c,0x426c,0x436c,0x446c,0x456c,0x466c,0x476c,0x486c,0x496c,0x4a6c,0x4b6c,0x4c6c,0x4d6c,0x4e6c,0x4f6c,0x506c,
+0x516c,0x526c,0x536c,0x546c,0x556c,0x566c,0x576c,0x586c,0x596c,0x5a6c,0x616c,0x626c,0x636c,0x646c,0x656c,0x666c,
+0x676c,0x686c,0x696c,0x6a6c,0x6b6c,0x6c6c,0x6d6c,0x6e6c,0x6f6c,0x706c,0x716c,0x726c,0x736c,0x746c,0x756c,0x766c,
+0x776c,0x786c,0x796c,0x7a6c,0x306c,0x316c,0x326c,0x336c,0x346c,0x356c,0x366c,0x376c,0x386c,0x396c,0x2b6c,0x2f6c,
+0x416d,0x426d,0x436d,0x446d,0x456d,0x466d,0x476d,0x486d,0x496d,0x4a6d,0x4b6d,0x4c6d,0x4d6d,0x4e6d,0x4f6d,0x506d,
+0x516d,0x526d,0x536d,0x546d,0x556d,0x566d,0x576d,0x586d,0x596d,0x5a6d,0x616d,0x626d,0x636d,0x646d,0x656d,0x666d,
+0x676d,0x686d,0x696d,0x6a6d,0x6b6d,0x6c6d,0x6d6d,0x6e6d,0x6f6d,0x706d,0x716d,0x726d,0x736d,0x746d,0x756d,0x766d,
+0x776d,0x786d,0x796d,0x7a6d,0x306d,0x316d,0x326d,0x336d,0x346d,0x356d,0x366d,0x376d,0x386d,0x396d,0x2b6d,0x2f6d,
+0x416e,0x426e,0x436e,0x446e,0x456e,0x466e,0x476e,0x486e,0x496e,0x4a6e,0x4b6e,0x4c6e,0x4d6e,0x4e6e,0x4f6e,0x506e,
+0x516e,0x526e,0x536e,0x546e,0x556e,0x566e,0x576e,0x586e,0x596e,0x5a6e,0x616e,0x626e,0x636e,0x646e,0x656e,0x666e,
+0x676e,0x686e,0x696e,0x6a6e,0x6b6e,0x6c6e,0x6d6e,0x6e6e,0x6f6e,0x706e,0x716e,0x726e,0x736e,0x746e,0x756e,0x766e,
+0x776e,0x786e,0x796e,0x7a6e,0x306e,0x316e,0x326e,0x336e,0x346e,0x356e,0x366e,0x376e,0x386e,0x396e,0x2b6e,0x2f6e,
+0x416f,0x426f,0x436f,0x446f,0x456f,0x466f,0x476f,0x486f,0x496f,0x4a6f,0x4b6f,0x4c6f,0x4d6f,0x4e6f,0x4f6f,0x506f,
+0x516f,0x526f,0x536f,0x546f,0x556f,0x566f,0x576f,0x586f,0x596f,0x5a6f,0x616f,0x626f,0x636f,0x646f,0x656f,0x666f,
+0x676f,0x686f,0x696f,0x6a6f,0x6b6f,0x6c6f,0x6d6f,0x6e6f,0x6f6f,0x706f,0x716f,0x726f,0x736f,0x746f,0x756f,0x766f,
+0x776f,0x786f,0x796f,0x7a6f,0x306f,0x316f,0x326f,0x336f,0x346f,0x356f,0x366f,0x376f,0x386f,0x396f,0x2b6f,0x2f6f,
+0x4170,0x4270,0x4370,0x4470,0x4570,0x4670,0x4770,0x4870,0x4970,0x4a70,0x4b70,0x4c70,0x4d70,0x4e70,0x4f70,0x5070,
+0x5170,0x5270,0x5370,0x5470,0x5570,0x5670,0x5770,0x5870,0x5970,0x5a70,0x6170,0x6270,0x6370,0x6470,0x6570,0x6670,
+0x6770,0x6870,0x6970,0x6a70,0x6b70,0x6c70,0x6d70,0x6e70,0x6f70,0x7070,0x7170,0x7270,0x7370,0x7470,0x7570,0x7670,
+0x7770,0x7870,0x7970,0x7a70,0x3070,0x3170,0x3270,0x3370,0x3470,0x3570,0x3670,0x3770,0x3870,0x3970,0x2b70,0x2f70,
+0x4171,0x4271,0x4371,0x4471,0x4571,0x4671,0x4771,0x4871,0x4971,0x4a71,0x4b71,0x4c71,0x4d71,0x4e71,0x4f71,0x5071,
+0x5171,0x5271,0x5371,0x5471,0x5571,0x5671,0x5771,0x5871,0x5971,0x5a71,0x6171,0x6271,0x6371,0x6471,0x6571,0x6671,
+0x6771,0x6871,0x6971,0x6a71,0x6b71,0x6c71,0x6d71,0x6e71,0x6f71,0x7071,0x7171,0x7271,0x7371,0x7471,0x7571,0x7671,
+0x7771,0x7871,0x7971,0x7a71,0x3071,0x3171,0x3271,0x3371,0x3471,0x3571,0x3671,0x3771,0x3871,0x3971,0x2b71,0x2f71,
+0x4172,0x4272,0x4372,0x4472,0x4572,0x4672,0x4772,0x4872,0x4972,0x4a72,0x4b72,0x4c72,0x4d72,0x4e72,0x4f72,0x5072,
+0x5172,0x5272,0x5372,0x5472,0x5572,0x5672,0x5772,0x5872,0x5972,0x5a72,0x6172,0x6272,0x6372,0x6472,0x6572,0x6672,
+0x6772,0x6872,0x6972,0x6a72,0x6b72,0x6c72,0x6d72,0x6e72,0x6f72,0x7072,0x7172,0x7272,0x7372,0x7472,0x7572,0x7672,
+0x7772,0x7872,0x7972,0x7a72,0x3072,0x3172,0x3272,0x3372,0x3472,0x3572,0x3672,0x3772,0x3872,0x3972,0x2b72,0x2f72,
+0x4173,0x4273,0x4373,0x4473,0x4573,0x4673,0x4773,0x4873,0x4973,0x4a73,0x4b73,0x4c73,0x4d73,0x4e73,0x4f73,0x5073,
+0x5173,0x5273,0x5373,0x5473,0x5573,0x5673,0x5773,0x5873,0x5973,0x5a73,0x6173,0x6273,0x6373,0x6473,0x6573,0x6673,
+0x6773,0x6873,0x6973,0x6a73,0x6b73,0x6c73,0x6d73,0x6e73,0x6f73,0x7073,0x7173,0x7273,0x7373,0x7473,0x7573,0x7673,
+0x7773,0x7873,0x7973,0x7a73,0x3073,0x3173,0x3273,0x3373,0x3473,0x3573,0x3673,0x3773,0x3873,0x3973,0x2b73,0x2f73,
+0x4174,0x4274,0x4374,0x4474,0x4574,0x4674,0x4774,0x4874,0x4974,0x4a74,0x4b74,0x4c74,0x4d74,0x4e74,0x4f74,0x5074,
+0x5174,0x5274,0x5374,0x5474,0x5574,0x5674,0x5774,0x5874,0x5974,0x5a74,0x6174,0x6274,0x6374,0x6474,0x6574,0x6674,
+0x6774,0x6874,0x6974,0x6a74,0x6b74,0x6c74,0x6d74,0x6e74,0x6f74,0x7074,0x7174,0x7274,0x7374,0x7474,0x7574,0x7674,
+0x7774,0x7874,0x7974,0x7a74,0x3074,0x3174,0x3274,0x3374,0x3474,0x3574,0x3674,0x3774,0x3874,0x3974,0x2b74,0x2f74,
+0x4175,0x4275,0x4375,0x4475,0x4575,0x4675,0x4775,0x4875,0x4975,0x4a75,0x4b75,0x4c75,0x4d75,0x4e75,0x4f75,0x5075,
+0x5175,0x5275,0x5375,0x5475,0x5575,0x5675,0x5775,0x5875,0x5975,0x5a75,0x6175,0x6275,0x6375,0x6475,0x6575,0x6675,
+0x6775,0x6875,0x6975,0x6a75,0x6b75,0x6c75,0x6d75,0x6e75,0x6f75,0x7075,0x7175,0x7275,0x7375,0x7475,0x7575,0x7675,
+0x7775,0x7875,0x7975,0x7a75,0x3075,0x3175,0x3275,0x3375,0x3475,0x3575,0x3675,0x3775,0x3875,0x3975,0x2b75,0x2f75,
+0x4176,0x4276,0x4376,0x4476,0x4576,0x4676,0x4776,0x4876,0x4976,0x4a76,0x4b76,0x4c76,0x4d76,0x4e76,0x4f76,0x5076,
+0x5176,0x5276,0x5376,0x5476,0x5576,0x5676,0x5776,0x5876,0x5976,0x5a76,0x6176,0x6276,0x6376,0x6476,0x6576,0x6676,
+0x6776,0x6876,0x6976,0x6a76,0x6b76,0x6c76,0x6d76,0x6e76,0x6f76,0x7076,0x7176,0x7276,0x7376,0x7476,0x7576,0x7676,
+0x7776,0x7876,0x7976,0x7a76,0x3076,0x3176,0x3276,0x3376,0x3476,0x3576,0x3676,0x3776,0x3876,0x3976,0x2b76,0x2f76,
+0x4177,0x4277,0x4377,0x4477,0x4577,0x4677,0x4777,0x4877,0x4977,0x4a77,0x4b77,0x4c77,0x4d77,0x4e77,0x4f77,0x5077,
+0x5177,0x5277,0x5377,0x5477,0x5577,0x5677,0x5777,0x5877,0x5977,0x5a77,0x6177,0x6277,0x6377,0x6477,0x6577,0x6677,
+0x6777,0x6877,0x6977,0x6a77,0x6b77,0x6c77,0x6d77,0x6e77,0x6f77,0x7077,0x7177,0x7277,0x7377,0x7477,0x7577,0x7677,
+0x7777,0x7877,0x7977,0x7a77,0x3077,0x3177,0x3277,0x3377,0x3477,0x3577,0x3677,0x3777,0x3877,0x3977,0x2b77,0x2f77,
+0x4178,0x4278,0x4378,0x4478,0x4578,0x4678,0x4778,0x4878,0x4978,0x4a78,0x4b78,0x4c78,0x4d78,0x4e78,0x4f78,0x5078,
+0x5178,0x5278,0x5378,0x5478,0x5578,0x5678,0x5778,0x5878,0x5978,0x5a78,0x6178,0x6278,0x6378,0x6478,0x6578,0x6678,
+0x6778,0x6878,0x6978,0x6a78,0x6b78,0x6c78,0x6d78,0x6e78,0x6f78,0x7078,0x7178,0x7278,0x7378,0x7478,0x7578,0x7678,
+0x7778,0x7878,0x7978,0x7a78,0x3078,0x3178,0x3278,0x3378,0x3478,0x3578,0x3678,0x3778,0x3878,0x3978,0x2b78,0x2f78,
+0x4179,0x4279,0x4379,0x4479,0x4579,0x4679,0x4779,0x4879,0x4979,0x4a79,0x4b79,0x4c79,0x4d79,0x4e79,0x4f79,0x5079,
+0x5179,0x5279,0x5379,0x5479,0x5579,0x5679,0x5779,0x5879,0x5979,0x5a79,0x6179,0x6279,0x6379,0x6479,0x6579,0x6679,
+0x6779,0x6879,0x6979,0x6a79,0x6b79,0x6c79,0x6d79,0x6e79,0x6f79,0x7079,0x7179,0x7279,0x7379,0x7479,0x7579,0x7679,
+0x7779,0x7879,0x7979,0x7a79,0x3079,0x3179,0x3279,0x3379,0x3479,0x3579,0x3679,0x3779,0x3879,0x3979,0x2b79,0x2f79,
+0x417a,0x427a,0x437a,0x447a,0x457a,0x467a,0x477a,0x487a,0x497a,0x4a7a,0x4b7a,0x4c7a,0x4d7a,0x4e7a,0x4f7a,0x507a,
+0x517a,0x527a,0x537a,0x547a,0x557a,0x567a,0x577a,0x587a,0x597a,0x5a7a,0x617a,0x627a,0x637a,0x647a,0x657a,0x667a,
+0x677a,0x687a,0x697a,0x6a7a,0x6b7a,0x6c7a,0x6d7a,0x6e7a,0x6f7a,0x707a,0x717a,0x727a,0x737a,0x747a,0x757a,0x767a,
+0x777a,0x787a,0x797a,0x7a7a,0x307a,0x317a,0x327a,0x337a,0x347a,0x357a,0x367a,0x377a,0x387a,0x397a,0x2b7a,0x2f7a,
+0x4130,0x4230,0x4330,0x4430,0x4530,0x4630,0x4730,0x4830,0x4930,0x4a30,0x4b30,0x4c30,0x4d30,0x4e30,0x4f30,0x5030,
+0x5130,0x5230,0x5330,0x5430,0x5530,0x5630,0x5730,0x5830,0x5930,0x5a30,0x6130,0x6230,0x6330,0x6430,0x6530,0x6630,
+0x6730,0x6830,0x6930,0x6a30,0x6b30,0x6c30,0x6d30,0x6e30,0x6f30,0x7030,0x7130,0x7230,0x7330,0x7430,0x7530,0x7630,
+0x7730,0x7830,0x7930,0x7a30,0x3030,0x3130,0x3230,0x3330,0x3430,0x3530,0x3630,0x3730,0x3830,0x3930,0x2b30,0x2f30,
+0x4131,0x4231,0x4331,0x4431,0x4531,0x4631,0x4731,0x4831,0x4931,0x4a31,0x4b31,0x4c31,0x4d31,0x4e31,0x4f31,0x5031,
+0x5131,0x5231,0x5331,0x5431,0x5531,0x5631,0x5731,0x5831,0x5931,0x5a31,0x6131,0x6231,0x6331,0x6431,0x6531,0x6631,
+0x6731,0x6831,0x6931,0x6a31,0x6b31,0x6c31,0x6d31,0x6e31,0x6f31,0x7031,0x7131,0x7231,0x7331,0x7431,0x7531,0x7631,
+0x7731,0x7831,0x7931,0x7a31,0x3031,0x3131,0x3231,0x3331,0x3431,0x3531,0x3631,0x3731,0x3831,0x3931,0x2b31,0x2f31,
+0x4132,0x4232,0x4332,0x4432,0x4532,0x4632,0x4732,0x4832,0x4932,0x4a32,0x4b32,0x4c32,0x4d32,0x4e32,0x4f32,0x5032,
+0x5132,0x5232,0x5332,0x5432,0x5532,0x5632,0x5732,0x5832,0x5932,0x5a32,0x6132,0x6232,0x6332,0x6432,0x6532,0x6632,
+0x6732,0x6832,0x6932,0x6a32,0x6b32,0x6c32,0x6d32,0x6e32,0x6f32,0x7032,0x7132,0x7232,0x7332,0x7432,0x7532,0x7632,
+0x7732,0x7832,0x7932,0x7a32,0x3032,0x3132,0x3232,0x3332,0x3432,0x3532,0x3632,0x3732,0x3832,0x3932,0x2b32,0x2f32,
+0x4133,0x4233,0x4333,0x4433,0x4533,0x4633,0x4733,0x4833,0x4933,0x4a33,0x4b33,0x4c33,0x4d33,0x4e33,0x4f33,0x5033,
+0x5133,0x5233,0x5333,0x5433,0x5533,0x5633,0x5733,0x5833,0x5933,0x5a33,0x6133,0x6233,0x6333,0x6433,0x6533,0x6633,
+0x6733,0x6833,0x6933,0x6a33,0x6b33,0x6c33,0x6d33,0x6e33,0x6f33,0x7033,0x7133,0x7233,0x7333,0x7433,0x7533,0x7633,
+0x7733,0x7833,0x7933,0x7a33,0x3033,0x3133,0x3233,0x3333,0x3433,0x3533,0x3633,0x3733,0x3833,0x3933,0x2b33,0x2f33,
+0x4134,0x4234,0x4334,0x4434,0x4534,0x4634,0x4734,0x4834,0x4934,0x4a34,0x4b34,0x4c34,0x4d34,0x4e34,0x4f34,0x5034,
+0x5134,0x5234,0x5334,0x5434,0x5534,0x5634,0x5734,0x5834,0x5934,0x5a34,0x6134,0x6234,0x6334,0x6434,0x6534,0x6634,
+0x6734,0x6834,0x6934,0x6a34,0x6b34,0x6c34,0x6d34,0x6e34,0x6f34,0x7034,0x7134,0x7234,0x7334,0x7434,0x7534,0x7634,
+0x7734,0x7834,0x7934,0x7a34,0x3034,0x3134,0x3234,0x3334,0x3434,0x3534,0x3634,0x3734,0x3834,0x3934,0x2b34,0x2f34,
+0x4135,0x4235,0x4335,0x4435,0x4535,0x4635,0x4735,0x4835,0x4935,0x4a35,0x4b35,0x4c35,0x4d35,0x4e35,0x4f35,0x5035,
+0x5135,0x5235,0x5335,0x5435,0x5535,0x5635,0x5735,0x5835,0x5935,0x5a35,0x6135,0x6235,0x6335,0x6435,0x6535,0x6635,
+0x6735,0x6835,0x6935,0x6a35,0x6b35,0x6c35,0x6d35,0x6e35,0x6f35,0x7035,0x7135,0x7235,0x7335,0x7435,0x7535,0x7635,
+0x7735,0x7835,0x7935,0x7a35,0x3035,0x3135,0x3235,0x3335,0x3435,0x3535,0x3635,0x3735,0x3835,0x3935,0x2b35,0x2f35,
+0x4136,0x4236,0x4336,0x4436,0x4536,0x4636,0x4736,0x4836,0x4936,0x4a36,0x4b36,0x4c36,0x4d36,0x4e36,0x4f36,0x5036,
+0x5136,0x5236,0x5336,0x5436,0x5536,0x5636,0x5736,0x5836,0x5936,0x5a36,0x6136,0x6236,0x6336,0x6436,0x6536,0x6636,
+0x6736,0x6836,0x6936,0x6a36,0x6b36,0x6c36,0x6d36,0x6e36,0x6f36,0x7036,0x7136,0x7236,0x7336,0x7436,0x7536,0x7636,
+0x7736,0x7836,0x7936,0x7a36,0x3036,0x3136,0x3236,0x3336,0x3436,0x3536,0x3636,0x3736,0x3836,0x3936,0x2b36,0x2f36,
+0x4137,0x4237,0x4337,0x4437,0x4537,0x4637,0x4737,0x4837,0x4937,0x4a37,0x4b37,0x4c37,0x4d37,0x4e37,0x4f37,0x5037,
+0x5137,0x5237,0x5337,0x5437,0x5537,0x5637,0x5737,0x5837,0x5937,0x5a37,0x6137,0x6237,0x6337,0x6437,0x6537,0x6637,
+0x6737,0x6837,0x6937,0x6a37,0x6b37,0x6c37,0x6d37,0x6e37,0x6f37,0x7037,0x7137,0x7237,0x7337,0x7437,0x7537,0x7637,
+0x7737,0x7837,0x7937,0x7a37,0x3037,0x3137,0x3237,0x3337,0x3437,0x3537,0x3637,0x3737,0x3837,0x3937,0x2b37,0x2f37,
+0x4138,0x4238,0x4338,0x4438,0x4538,0x4638,0x4738,0x4838,0x4938,0x4a38,0x4b38,0x4c38,0x4d38,0x4e38,0x4f38,0x5038,
+0x5138,0x5238,0x5338,0x5438,0x5538,0x5638,0x5738,0x5838,0x5938,0x5a38,0x6138,0x6238,0x6338,0x6438,0x6538,0x6638,
+0x6738,0x6838,0x6938,0x6a38,0x6b38,0x6c38,0x6d38,0x6e38,0x6f38,0x7038,0x7138,0x7238,0x7338,0x7438,0x7538,0x7638,
+0x7738,0x7838,0x7938,0x7a38,0x3038,0x3138,0x3238,0x3338,0x3438,0x3538,0x3638,0x3738,0x3838,0x3938,0x2b38,0x2f38,
+0x4139,0x4239,0x4339,0x4439,0x4539,0x4639,0x4739,0x4839,0x4939,0x4a39,0x4b39,0x4c39,0x4d39,0x4e39,0x4f39,0x5039,
+0x5139,0x5239,0x5339,0x5439,0x5539,0x5639,0x5739,0x5839,0x5939,0x5a39,0x6139,0x6239,0x6339,0x6439,0x6539,0x6639,
+0x6739,0x6839,0x6939,0x6a39,0x6b39,0x6c39,0x6d39,0x6e39,0x6f39,0x7039,0x7139,0x7239,0x7339,0x7439,0x7539,0x7639,
+0x7739,0x7839,0x7939,0x7a39,0x3039,0x3139,0x3239,0x3339,0x3439,0x3539,0x3639,0x3739,0x3839,0x3939,0x2b39,0x2f39,
+0x412b,0x422b,0x432b,0x442b,0x452b,0x462b,0x472b,0x482b,0x492b,0x4a2b,0x4b2b,0x4c2b,0x4d2b,0x4e2b,0x4f2b,0x502b,
+0x512b,0x522b,0x532b,0x542b,0x552b,0x562b,0x572b,0x582b,0x592b,0x5a2b,0x612b,0x622b,0x632b,0x642b,0x652b,0x662b,
+0x672b,0x682b,0x692b,0x6a2b,0x6b2b,0x6c2b,0x6d2b,0x6e2b,0x6f2b,0x702b,0x712b,0x722b,0x732b,0x742b,0x752b,0x762b,
+0x772b,0x782b,0x792b,0x7a2b,0x302b,0x312b,0x322b,0x332b,0x342b,0x352b,0x362b,0x372b,0x382b,0x392b,0x2b2b,0x2f2b,
+0x412f,0x422f,0x432f,0x442f,0x452f,0x462f,0x472f,0x482f,0x492f,0x4a2f,0x4b2f,0x4c2f,0x4d2f,0x4e2f,0x4f2f,0x502f,
+0x512f,0x522f,0x532f,0x542f,0x552f,0x562f,0x572f,0x582f,0x592f,0x5a2f,0x612f,0x622f,0x632f,0x642f,0x652f,0x662f,
+0x672f,0x682f,0x692f,0x6a2f,0x6b2f,0x6c2f,0x6d2f,0x6e2f,0x6f2f,0x702f,0x712f,0x722f,0x732f,0x742f,0x752f,0x762f,
+0x772f,0x782f,0x792f,0x7a2f,0x302f,0x312f,0x322f,0x332f,0x342f,0x352f,0x362f,0x372f,0x382f,0x392f,0x2b2f,0x2f2f };
+ 
+#define XI32(_i_) {\
+  unsigned _u0 = u0x, _u1 = u1x;\
+  u0x = BSWAP32(ctou32(ip+6+_i_*6  ));  \
+  u1x = BSWAP32(ctou32(ip+6+_i_*6+3));\
+  _u0 = XU32(_u0); stou32(op+_i_*8, _u0);\
+  _u1 = XU32(_u1); stou32(op+_i_*8+4, _u1); \
+}                  
+
+#define OVX 12
+size_t tb64xenc(const unsigned char *in, size_t inlen, unsigned char *out) {
+  const  unsigned char *ip    = in;
+         unsigned char *op    = out;
+         size_t        outlen = TB64ENCLEN(inlen);
+  
+  if(outlen >= 8+OVX) {
+    unsigned           u0x = BSWAP32(ctou32(ip  )),
+                       u1x = BSWAP32(ctou32(ip+3));
+	  #if NEX >= 64		 
+    for(; op <= (out+outlen)-(NEX+OVX); op += NEX, ip += (NEX/4)*3) { PREFETCH(ip,256, 0);// unrolling 96/48->128/64 bytes
+      XI32(0); XI32(1); XI32( 2); XI32( 3); XI32( 4); XI32( 5); XI32( 6); XI32( 7);     
+        #if NEX >= 128	  
+      XI32(8); XI32(9); XI32(10); XI32(11); XI32(12); XI32(13); XI32(14); XI32(15);      
+	    #endif																						
+    }
+	  #endif
+    for(; op <= (out+outlen)-(16+OVX); op += 16, ip += (16/4)*3) { XI32(0); XI32(1); } // unrolling 12->16 bytes
+     if(  op <= (out+outlen)-( 8+OVX))                           { XI32(0); op += 8, ip += (8/4)*3; }		  
+  }
+  EXTAIL();
+  return outlen;
+}
+
+ third_party/Turbo-Base64/turbob64d.c view
@@ -0,0 +1,410 @@+/**
+Copyright (c) 2016-2019, Powturbo
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
+IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
+TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
+PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
+TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+    - homepage : https://sites.google.com/site/powturbo/
+    - github   : https://github.com/powturbo
+    - twitter  : https://twitter.com/powturbo
+    - email    : powturbo [_AT_] gmail [_DOT_] com
+**/
+//------------- TurboBase64 : Base64 decoding -------------------
+#define UA_MEMCPY
+#include "conf.h"
+#include "turbob64.h"
+#include "turbob64_.h"
+
+  #if defined(TB64SHORT) && TB64SHORT < 128
+#define NDS 64    
+#define NDX 64 
+  #else
+#define NDS 128    
+#define NDX 128 
+  #endif	
+
+//--------------------- Decoding with small lut (only 64 bytes used)------------------------------------
+
+#define _ 0xff // invald entry
+static const unsigned char lut[] = {
+ _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _,
+ _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _,
+ _, _, _, _, _, _, _, _, _, _, _,62, _, _, _,63,
+52,53,54,55,56,57,58,59,60,61, _, _, _, _, _, _,
+ _, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10,11,12,13,14,
+15,16,17,18,19,20,21,22,23,24,25, _, _, _, _, _,
+ _,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,
+41,42,43,44,45,46,47,48,49,50,51, _, _, _, _, _,
+ _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _,
+ _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _,
+ _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _,
+ _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _,
+ _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _,
+ _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _,
+ _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _,
+ _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _ 
+};
+#undef _
+
+#define LU32(_u_) BSWAP32(lut[(unsigned char)(_u_     )] << 26 |\
+                          lut[(unsigned char)(_u_>>  8)] << 20 |\
+                          lut[(unsigned char)(_u_>> 16)] << 14 |\
+                          lut[                _u_>> 24 ] <<  8)
+
+#define LU32C(_u_)       (lut[(unsigned char)(_u_     )] |\
+                          lut[(unsigned char)(_u_>>  8)] |\
+                          lut[(unsigned char)(_u_>> 16)] |\
+                          lut[                _u_>> 24 ])
+
+#define LI32C(_i_) {\
+  unsigned _u = ctou32(ip+_i_*8);   CHECK0(cu|= LU32C(_u)); _u = LU32(_u);\
+  unsigned _v = ctou32(ip+_i_*8+4); CHECK1(cu|= LU32C(_v)); _v = LU32(_v);\
+  stou32(op+ _i_*6  , _u);\
+  stou32(op+ _i_*6+3, _v);\
+}
+
+  #ifdef B64CHECK
+#define LI32(a) LI32C(a)
+  #else
+#define LI32(_i_) { \
+  unsigned _u = ctou32(ip+_i_*8);    _u = LU32(_u);\
+  unsigned _v = ctou32(ip+_i_*8+4);  _v = LU32(_v);\
+  stou32(op+ _i_*6  , _u);\
+  stou32(op+ _i_*6+3, _v);\
+}
+  #endif
+
+#define OVS 4
+size_t tb64sdec(const unsigned char *in, size_t inlen, unsigned char *out) {
+  const unsigned char *ip = in;
+        unsigned char *op = out;
+        unsigned cu = 0;
+  if(!inlen || (inlen&3)) return 0;
+  
+    #if NDS >= 64
+  if(inlen >= 8+OVS) {
+    size_t _inlen = inlen - OVS;
+    for(; ip < (in+inlen)-(NDS+OVS); ip += NDS, op += (NDS/4)*3) {		    // decode 128/64->96/48 bytes			
+      LI32C(0); LI32(1); LI32( 2); LI32( 3); LI32( 4); LI32( 5); LI32( 6); LI32( 7);  
+        #if NDS >= 128	  
+      LI32(8);  LI32(9); LI32(10); LI32(11); LI32(12); LI32(13); LI32(14); LI32(15);   	
+	    #endif
+	                                                                                  PREFETCH(ip,384, 0);
+    }
+	#endif
+    for(; ip < (in+inlen)-(16+OVS); ip += 16, op += (16/4)*3) { LI32(0); LI32(1); }
+    if(   ip < (in+inlen)-( 8+OVS))                           { LI32(0); ip += 8; op += (8/4)*3; }
+  }
+  
+  for(; ip < (in+inlen)-4; ip += 4, op += 3) { unsigned u = ctou32(ip); cu |= LU32C(u); u = LU32(u); stou32(op, u); }
+
+  unsigned u = 0, l = inlen - (ip-in);  
+  if(l == 4) 															// last 4 bytes
+    if(    ip[3]=='=') { l = 3; 
+      if(  ip[2]=='=') { l = 2; 
+        if(ip[1]=='=')   l = 1; 
+	  }
+	}                                       
+  unsigned char *up = (unsigned char *)&u;
+  switch(l) {
+    case 4: u = ctou32(ip); cu |= LU32C(u); u = LU32(u);                   *op++ = up[0]; *op++ = up[1]; *op++ = up[2];                                             break; // 4->3 bytes
+    case 3: u = BSWAP32(lut[ip[0]]<<26 | lut[ip[1]]<<20 | lut[ip[2]]<<14); *op++ = up[0]; *op++ = up[1];                cu |= lut[ip[0]] | lut[ip[1]] | lut[ip[2]]; break; // 3->2 bytes
+    case 2: u = BSWAP32(lut[ip[0]]<<26 | lut[ip[1]]<<20);                  *op++ = up[0];                               cu |= lut[ip[0]] | lut[ip[1]];              break; // 2->1 byte
+    case 1: u = BSWAP32(lut[ip[0]]);                                       *op++ = up[0];                               cu |= lut[ip[0]];                           break; // 1->1 byte
+  } 
+  return (cu == 0xff)?0:(op-out);
+}
+
+//---- Fast decoding with pre shifted lookup table: 4k=4*4*256, (but only 4*4*64 = 1024 bytes used) for fast decoding ----------
+
+  #if defined(__BYTE_ORDER__) && (__BYTE_ORDER__ == __ORDER_BIG_ENDIAN__)
+#define _ -1 // invalid entry
+const unsigned tb64lutxd0[] = {
+         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _, 
+         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,
+         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,0xf8000000,         _,         _,         _,0xfc000000,
+0xd0000000,0xd4000000,0xd8000000,0xdc000000,0xe0000000,0xe4000000,0xe8000000,0xec000000,0xf0000000,0xf4000000,         _,         _,         _,         _,         _,         _,
+         _,0x00000000,0x04000000,0x08000000,0x0c000000,0x10000000,0x14000000,0x18000000,0x1c000000,0x20000000,0x24000000,0x28000000,0x2c000000,0x30000000,0x34000000,0x38000000,
+0x3c000000,0x40000000,0x44000000,0x48000000,0x4c000000,0x50000000,0x54000000,0x58000000,0x5c000000,0x60000000,0x64000000,         _,         _,         _,         _,         _,
+         _,0x68000000,0x6c000000,0x70000000,0x74000000,0x78000000,0x7c000000,0x80000000,0x84000000,0x88000000,0x8c000000,0x90000000,0x94000000,0x98000000,0x9c000000,0xa0000000,
+0xa4000000,0xa8000000,0xac000000,0xb0000000,0xb4000000,0xb8000000,0xbc000000,0xc0000000,0xc4000000,0xc8000000,0xcc000000,         _,         _,         _,         _,         _,
+         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,
+         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,
+         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,
+         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,
+         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,
+         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _, 
+         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,
+         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _,         _
+};
+
+const unsigned tb64lutxd1[] = {
+        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,
+        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,
+        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,0x3e00000,        _,        _,        _,0x3f00000,
+0x3400000,0x3500000,0x3600000,0x3700000,0x3800000,0x3900000,0x3a00000,0x3b00000,0x3c00000,0x3d00000,        _,        _,        _,        _,        _,        _,
+        _,0x0000000,0x0100000,0x0200000,0x0300000,0x0400000,0x0500000,0x0600000,0x0700000,0x0800000,0x0900000,0x0a00000,0x0b00000,0x0c00000,0x0d00000,0x0e00000,
+0x0f00000,0x1000000,0x1100000,0x1200000,0x1300000,0x1400000,0x1500000,0x1600000,0x1700000,0x1800000,0x1900000,        _,        _,        _,        _,        _,
+        _,0x1a00000,0x1b00000,0x1c00000,0x1d00000,0x1e00000,0x1f00000,0x2000000,0x2100000,0x2200000,0x2300000,0x2400000,0x2500000,0x2600000,0x2700000,0x2800000,
+0x2900000,0x2a00000,0x2b00000,0x2c00000,0x2d00000,0x2e00000,0x2f00000,0x3000000,0x3100000,0x3200000,0x3300000,        _,        _,        _,        _,        _,
+        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,
+        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,
+        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,
+        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,
+        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,
+        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,
+        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,
+        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,        _,         _
+};
+
+const unsigned tb64lutxd2[] = {
+      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,
+      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,
+      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,0xf8000,      _,      _,      _,0xfc000,
+0xd0000,0xd4000,0xd8000,0xdc000,0xe0000,0xe4000,0xe8000,0xec000,0xf0000,0xf4000,      _,      _,      _,      _,      _,      _,
+      _,0x00000,0x04000,0x08000,0x0c000,0x10000,0x14000,0x18000,0x1c000,0x20000,0x24000,0x28000,0x2c000,0x30000,0x34000,0x38000,
+0x3c000,0x40000,0x44000,0x48000,0x4c000,0x50000,0x54000,0x58000,0x5c000,0x60000,0x64000,      _,      _,      _,      _,      _,
+      _,0x68000,0x6c000,0x70000,0x74000,0x78000,0x7c000,0x80000,0x84000,0x88000,0x8c000,0x90000,0x94000,0x98000,0x9c000,0xa0000,
+0xa4000,0xa8000,0xac000,0xb0000,0xb4000,0xb8000,0xbc000,0xc0000,0xc4000,0xc8000,0xcc000,      _,      _,      _,      _,      _,
+      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,
+      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,
+      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,
+      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,
+      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,
+      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _, 
+      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,
+      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _,      _
+};
+
+const unsigned tb64lutxd3[] = {
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,0x3e00,     _,     _,     _,0x3f00,
+0x3400,0x3500,0x3600,0x3700,0x3800,0x3900,0x3a00,0x3b00,0x3c00,0x3d00,     _,     _,     _,     _,     _,     _,
+     _,0x0000,0x0100,0x0200,0x0300,0x0400,0x0500,0x0600,0x0700,0x0800,0x0900,0x0a00,0x0b00,0x0c00,0x0d00,0x0e00,
+0x0f00,0x1000,0x1100,0x1200,0x1300,0x1400,0x1500,0x1600,0x1700,0x1800,0x1900,     _,     _,     _,     _,     _,
+     _,0x1a00,0x1b00,0x1c00,0x1d00,0x1e00,0x1f00,0x2000,0x2100,0x2200,0x2300,0x2400,0x2500,0x2600,0x2700,0x2800,
+0x2900,0x2a00,0x2b00,0x2c00,0x2d00,0x2e00,0x2f00,0x3000,0x3100,0x3200,0x3300,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _
+};
+#undef _
+
+  #else
+#define _ -1 // invalid entry
+const unsigned tb64lutxd0[] = { 
+   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,
+   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,
+   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,0xf8,   _,   _,   _,0xfc,
+0xd0,0xd4,0xd8,0xdc,0xe0,0xe4,0xe8,0xec,0xf0,0xf4,   _,   _,   _,   _,   _,   _,
+   _,0x00,0x04,0x08,0x0c,0x10,0x14,0x18,0x1c,0x20,0x24,0x28,0x2c,0x30,0x34,0x38,
+0x3c,0x40,0x44,0x48,0x4c,0x50,0x54,0x58,0x5c,0x60,0x64,   _,   _,   _,   _,   _,
+   _,0x68,0x6c,0x70,0x74,0x78,0x7c,0x80,0x84,0x88,0x8c,0x90,0x94,0x98,0x9c,0xa0,
+0xa4,0xa8,0xac,0xb0,0xb4,0xb8,0xbc,0xc0,0xc4,0xc8,0xcc,   _,   _,   _,   _,   _,
+   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,
+   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,
+   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,
+   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,
+   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,
+   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,
+   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,
+   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _,   _
+};
+
+const unsigned tb64lutxd1[] = {
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,0xe003,     _,     _,     _,0xf003,
+0x4003,0x5003,0x6003,0x7003,0x8003,0x9003,0xa003,0xb003,0xc003,0xd003,     _,     _,     _,     _,     _,     _,
+     _,0x0000,0x1000,0x2000,0x3000,0x4000,0x5000,0x6000,0x7000,0x8000,0x9000,0xa000,0xb000,0xc000,0xd000,0xe000,
+0xf000,0x0001,0x1001,0x2001,0x3001,0x4001,0x5001,0x6001,0x7001,0x8001,0x9001,     _,     _,     _,     _,     _,
+     _,0xa001,0xb001,0xc001,0xd001,0xe001,0xf001,0x0002,0x1002,0x2002,0x3002,0x4002,0x5002,0x6002,0x7002,0x8002,
+0x9002,0xa002,0xb002,0xc002,0xd002,0xe002,0xf002,0x0003,0x1003,0x2003,0x3003,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,
+     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _,     _
+};
+
+const unsigned tb64lutxd2[] = {
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,0x800f00,       _,       _,       _,0xc00f00,
+0x000d00,0x400d00,0x800d00,0xc00d00,0x000e00,0x400e00,0x800e00,0xc00e00,0x000f00,0x400f00,       _,       _,       _,       _,       _,       _,
+       _,0x000000,0x400000,0x800000,0xc00000,0x000100,0x400100,0x800100,0xc00100,0x000200,0x400200,0x800200,0xc00200,0x000300,0x400300,0x800300,
+0xc00300,0x000400,0x400400,0x800400,0xc00400,0x000500,0x400500,0x800500,0xc00500,0x000600,0x400600,       _,       _,       _,       _,       _,
+       _,0x800600,0xc00600,0x000700,0x400700,0x800700,0xc00700,0x000800,0x400800,0x800800,0xc00800,0x000900,0x400900,0x800900,0xc00900,0x000a00,
+0x400a00,0x800a00,0xc00a00,0x000b00,0x400b00,0x800b00,0xc00b00,0x000c00,0x400c00,0x800c00,0xc00c00,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _
+};
+
+const unsigned tb64lutxd3[] = {
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,0x3e0000,       _,       _,       _,0x3f0000,
+0x340000,0x350000,0x360000,0x370000,0x380000,0x390000,0x3a0000,0x3b0000,0x3c0000,0x3d0000,       _,       _,       _,       _,       _,       _,
+       _,0x000000,0x010000,0x020000,0x030000,0x040000,0x050000,0x060000,0x070000,0x080000,0x090000,0x0a0000,0x0b0000,0x0c0000,0x0d0000,0x0e0000,
+0x0f0000,0x100000,0x110000,0x120000,0x130000,0x140000,0x150000,0x160000,0x170000,0x180000,0x190000,       _,       _,       _,       _,       _,
+       _,0x1a0000,0x1b0000,0x1c0000,0x1d0000,0x1e0000,0x1f0000,0x200000,0x210000,0x220000,0x230000,0x240000,0x250000,0x260000,0x270000,0x280000,
+0x290000,0x2a0000,0x2b0000,0x2c0000,0x2d0000,0x2e0000,0x2f0000,0x300000,0x310000,0x320000,0x330000,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,
+       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _,       _
+};
+#undef _
+  #endif
+
+  #ifdef __ARM_NEON
+#define DI32(_i_)  { unsigned _u = ux; ux = ctou32(ip+8+_i_*8);\
+                     unsigned _v = vx; vx = ctou32(ip+8+_i_*8+4);\
+                     stou64(op+ _i_*6  , DU32(_u));\
+                     stou32(op+ _i_*6+3, DU32(_v));\
+				   }
+#define DI32C(_i_) { unsigned _u = ux; ux = ctou32(ip+8+_i_*8);\
+                     unsigned _v = vx; vx = ctou32(ip+8+_i_*8+4);\
+                     _u = DU32(_u); CHECK0(cu |= _u); stou64(op+ _i_*6  , _u);\
+                     _v = DU32(_v); CHECK1(cu |= _v); stou32(op+ _i_*6+3, _v);\
+                   }
+  #else                   
+#define DI32(_i_)  { unsigned _u = ux; ux = ctou32(ip+8+_i_*8);   stou32(op+ _i_*6  , DU32(_u));\
+                     unsigned _v = vx; vx = ctou32(ip+8+_i_*8+4); stou32(op+ _i_*6+3, DU32(_v));\
+                   }
+#define DI32C(_i_) { unsigned _u = ux; ux = ctou32(ip+8+_i_*8);   _u = DU32(_u); CHECK0(cu |= _u); stou32(op+ _i_*6  , _u);\
+                     unsigned _v = vx; vx = ctou32(ip+8+_i_*8+4); _v = DU32(_v); CHECK1(cu |= _v); stou32(op+ _i_*6+3, _v);\
+                   }
+  #endif				
+
+  #ifdef NCHECK
+#define DI32C(a) DI32(a)
+  #else
+    #ifdef B64CHECK
+#undef DI32
+#define DI32(a) DI32C(a)
+    #endif
+#endif
+
+size_t tb64declen(const unsigned char *in, size_t inlen) {
+  if(!inlen || (inlen&3)) return 0;
+
+  size_t outlen = (inlen/4)*3;
+  const unsigned char *ip = in+inlen;
+  if(    ip[-1]=='=') { outlen--; 
+    if(  ip[-2]=='=') { outlen--; 
+      if(ip[-3]=='=')   outlen--; 
+	}
+  }
+  return outlen;
+}
+
+#define OVX 4  
+size_t tb64xdec(const unsigned char *in, size_t inlen, unsigned char *out) { 
+  const unsigned char *ip    = in;
+        unsigned char *op    = out;  
+        unsigned      cu     = 0;
+  if(!inlen || (inlen&3)) return 0;
+  
+    #ifdef B64CHECK
+  #define NDX 64
+    #else
+  #define NDX 128
+	#endif
+  if(inlen >= 8+OVX) { 															// 8/16x loop unrolling: decode 128/64->96/48 bytes
+    unsigned ux = ctou32(ip), 
+	         vx = ctou32(ip+4);
+	  #if NDX >= 64
+    for(; ip < (in+inlen)-(NDX+OVX); ip += NDX, op += (NDX/4)*3) {
+      DI32C(0); DI32(1); DI32( 2); DI32( 3); DI32( 4); DI32( 5); DI32( 6); DI32( 7); 
+	    #if NDX > 64
+	  DI32(8);  DI32(9); DI32(10); DI32(11); DI32(12); DI32(13); DI32(14); DI32(15);
+	    #endif
+																					PREFETCH(ip, 256, 0);  
+    }
+	  #endif
+    for(; ip < (in+inlen)-(16+OVX); ip += 16, op += (16/4)*3) { DI32(0); DI32(1); }
+    if(   ip < (in+inlen)-(8+OVX))                            { DI32(0); ip += 8, op += (8/4)*3; }
+  }
+  for(; ip < (in+inlen)-4; ip += 4, op += 3) { unsigned u = ctou32(ip); u = DU32(u); stou32(op, u); cu |= u; }
+
+  unsigned u = 0, l = (in+inlen) - ip; 
+  if(l == 4) 																	// last 4 bytes
+    if(    ip[3]=='=') { l = 3; 
+      if(  ip[2]=='=') { l = 2; 
+        if(ip[1]=='=')   l = 1; 
+	  }
+	}
+  unsigned char *up = (unsigned char *)&u;
+  switch(l) {
+    case 4: u = ctou32(ip); u = DU32(u);                 *op++ = up[0]; *op++ = up[1]; *op++ = up[2]; cu |= u; break; // 4->3 bytes
+    case 3: u = tb64lutxd0[ip[0]] | tb64lutxd1[ip[1]] | tb64lutxd2[ip[2]]; *op++ = up[0]; *op++ = up[1];                cu |= u; break; // 3->2 bytes
+    case 2: u = tb64lutxd0[ip[0]] | tb64lutxd1[ip[1]];               *op++ = up[0];                               cu |= u; break; // 2->1 byte
+    case 1: u = tb64lutxd0[ip[0]];                             *op++ = up[0];                               cu |= u; break; // 1->1 byte
+  }
+  return (cu == -1)?0:(op-out);
+}
+
+size_t _tb64xdec(const unsigned char *in, size_t inlen, unsigned char *out) { 
+  const unsigned char *ip    = in;
+        unsigned char *op    = out;  
+        unsigned      cu     = 0;
+  for(; ip < (in+inlen)-4; ip += 4, op += 3) { unsigned u = ctou32(ip); u = DU32(u); stou32(op, u); cu |= u; }
+
+  unsigned u = 0, l = (in+inlen) - ip; 
+  if(l == 4) 																	// last 4 bytes
+    if(    ip[3]=='=') { l = 3; 
+      if(  ip[2]=='=') { l = 2; 
+        if(ip[1]=='=')   l = 1; 
+	  }
+	}
+  unsigned char *up = (unsigned char *)&u;
+  switch(l) {
+    case 4: u = ctou32(ip); u = DU32(u);                                   *op++ = up[0]; *op++ = up[1]; *op++ = up[2]; cu |= u; break; // 4->3 bytes
+    case 3: u = tb64lutxd0[ip[0]] | tb64lutxd1[ip[1]] | tb64lutxd2[ip[2]]; *op++ = up[0]; *op++ = up[1];                cu |= u; break; // 3->2 bytes
+    case 2: u = tb64lutxd0[ip[0]] | tb64lutxd1[ip[1]];                     *op++ = up[0];                               cu |= u; break; // 2->1 byte
+    case 1: u = tb64lutxd0[ip[0]];                                         *op++ = up[0];                               cu |= u; break; // 1->1 byte
+  }
+  return (cu == -1)?0:(op-out);
+}
+
+ third_party/Turbo-Base64/turbob64sse.c view
@@ -0,0 +1,525 @@+/**
+Copyright (c) 2016-2019, Powturbo
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
+IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
+TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
+PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
+TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+    - homepage : https://sites.google.com/site/powturbo/
+    - github   : https://github.com/powturbo
+    - twitter  : https://twitter.com/powturbo
+    - email    : powturbo [_AT_] gmail [_DOT_] com
+**/
+// TubeBase64: ssse3 + arm neon functions (see also turbob64avx2)
+
+#include <string.h>
+
+  #if defined(__AVX__)
+#include <immintrin.h>
+#define FUNPREF tb64avx
+  #elif defined(__SSE4_1__)
+#include <smmintrin.h>
+#define FUNPREF tb64sse
+  #elif defined(__SSSE3__)
+    #ifdef __powerpc64__
+#define __SSE__   1
+#define __SSE2__  1
+#define __SSE3__  1
+#define NO_WARN_X86_INTRINSICS 1
+    #endif
+#define FUNPREF tb64sse
+#include <tmmintrin.h>
+  #elif defined(__SSE2__)
+#include <emmintrin.h>
+  #elif defined(__ARM_NEON)
+#include <arm_neon.h>
+  #endif
+  
+#define UA_MEMCPY
+#include "conf.h"
+#include "turbob64.h"
+#include "turbob64_.h"
+
+#ifdef __ARM_NEON  //----------------------------------- arm neon --------------------------------
+
+#define _ 0xff // invald entry
+static const unsigned char lut[] = {
+ _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _,
+ _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _,
+ _, _, _, _, _, _, _, _, _, _, _,62, _, _, _,63,
+52,53,54,55,56,57,58,59,60,61, _, _, _, _, _, _,
+ _, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10,11,12,13,14,
+15,16,17,18,19,20,21,22,23,24,25, _, _, _, _, _,
+ _,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,
+41,42,43,44,45,46,47,48,49,50,51, _, _, _, _, _,
+};
+#undef _
+
+  #ifndef vld1q_u8_x4
+static inline uint8x16x4_t vld1q_u8_x4(const uint8_t *lut) {
+  uint8x16x4_t v;
+  v.val[0] = vld1q_u8(lut);
+  v.val[1] = vld1q_u8(lut+16);
+  v.val[2] = vld1q_u8(lut+32);
+  v.val[3] = vld1q_u8(lut+48);
+  return v;
+}
+  #endif
+
+#define B64D(iv, ov) {\
+    iv.val[0] = vqtbx4q_u8(vqtbl4q_u8(vlut1, veorq_u8(iv.val[0], cv40)), vlut0, iv.val[0]);\
+    iv.val[1] = vqtbx4q_u8(vqtbl4q_u8(vlut1, veorq_u8(iv.val[1], cv40)), vlut0, iv.val[1]);\
+    iv.val[2] = vqtbx4q_u8(vqtbl4q_u8(vlut1, veorq_u8(iv.val[2], cv40)), vlut0, iv.val[2]);\
+    iv.val[3] = vqtbx4q_u8(vqtbl4q_u8(vlut1, veorq_u8(iv.val[3], cv40)), vlut0, iv.val[3]);\
+\
+	ov.val[0] = vorrq_u8(vshlq_n_u8(iv.val[0], 2), vshrq_n_u8(iv.val[1], 4));\
+	ov.val[1] = vorrq_u8(vshlq_n_u8(iv.val[1], 4), vshrq_n_u8(iv.val[2], 2));\
+	ov.val[2] = vorrq_u8(vshlq_n_u8(iv.val[2], 6),            iv.val[3]    );\
+}
+
+#define _MM_B64CHK(iv, xv) xv = vorrq_u8(xv, vorrq_u8(vorrq_u8(iv.val[0], iv.val[1]), vorrq_u8(iv.val[2], iv.val[3])))
+
+size_t tb64ssedec(const unsigned char *in, size_t inlen, unsigned char *out) {
+  const unsigned char *ip;
+        unsigned char *op; 
+  const uint8x16x4_t vlut0 = vld1q_u8_x4( lut),
+                     vlut1 = vld1q_u8_x4(&lut[64]);
+  const uint8x16_t    cv40 = vdupq_n_u8(0x40);
+        uint8x16_t      xv = vdupq_n_u8(0);
+  #define ND 256
+  for(ip = in, op = out; ip != in+(inlen&~(ND-1)); ip += ND, op += (ND/4)*3) { PREFETCH(ip,256,0);	
+    uint8x16x4_t iv0 = vld4q_u8(ip),
+                 iv1 = vld4q_u8(ip+64);                                                    
+	uint8x16x3_t ov0,ov1; 
+    B64D(iv0, ov0);
+      #if ND > 128
+	CHECK1(_MM_B64CHK(iv0,xv));
+      #else
+	CHECK0(_MM_B64CHK(iv0,xv));
+      #endif
+	B64D(iv1, ov1); CHECK1(_MM_B64CHK(iv1,xv));
+      #if ND > 128
+    iv0 = vld4q_u8(ip+128);
+    iv1 = vld4q_u8(ip+192);              
+      #endif
+	vst3q_u8(op,    ov0);       
+	vst3q_u8(op+48, ov1);                                                                                                                                                                       
+      #if ND > 128
+	B64D(iv0,ov0);	CHECK1(_MM_B64CHK(iv0,xv));
+	B64D(iv1,ov1); 
+	vst3q_u8(op+ 96, ov0);       
+	vst3q_u8(op+144, ov1);                                                                                                                                                                       
+	CHECK0(_MM_B64CHK(iv1,xv));
+      #endif
+  }
+  for(                 ; ip != in+(inlen&~(64-1)); ip += 64, op += (64/4)*3) { 	
+    uint8x16x4_t iv = vld4q_u8(ip);
+	uint8x16x3_t ov; B64D(iv,ov);
+	vst3q_u8(op, ov);                                                                                                                          
+	CHECK0(xv = vorrq_u8(xv, vorrq_u8(vorrq_u8(iv.val[0], iv.val[1]), vorrq_u8(iv.val[2], iv.val[3]))));
+  }
+  size_t rc;
+  if(!(rc=tb64xdec(ip, inlen&(64-1), op)) || vaddvq_u8(vshrq_n_u8(xv,7))) return 0; //decode all
+  return (op-out)+rc; 
+}
+
+//--------------------------------------------------------------------------------------------------
+#define B64E(iv, ov) {\
+  ov.val[0] =                                             vshrq_n_u8(iv.val[0], 2);\
+  ov.val[1] = vandq_u8(vorrq_u8(vshlq_n_u8(iv.val[0], 4), vshrq_n_u8(iv.val[1], 4)), cv3f);\
+  ov.val[2] = vandq_u8(vorrq_u8(vshlq_n_u8(iv.val[1], 2), vshrq_n_u8(iv.val[2], 6)), cv3f);\
+  ov.val[3] = vandq_u8(                    iv.val[2],                                cv3f);\
+\
+  ov.val[0] = vqtbl4q_u8(vlut, ov.val[0]);\
+  ov.val[1] = vqtbl4q_u8(vlut, ov.val[1]);\
+  ov.val[2] = vqtbl4q_u8(vlut, ov.val[2]);\
+  ov.val[3] = vqtbl4q_u8(vlut, ov.val[3]);\
+}
+
+size_t tb64sseenc(const unsigned char* in, size_t inlen, unsigned char *out) {
+  static unsigned char lut[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+  const unsigned char *ip; 
+        unsigned char *op;
+  const size_t      outlen = TB64ENCLEN(inlen);
+  const uint8x16x4_t vlut = vld1q_u8_x4(lut);
+  const uint8x16_t   cv3f = vdupq_n_u8(0x3f);
+
+  #define NE 128 // 256//
+  for(ip = in, op = out; op != out+(outlen&~(NE-1)); op += NE, ip += (NE/4)*3) { 	 							
+          uint8x16x3_t iv0 = vld3q_u8(ip),
+                       iv1 = vld3q_u8(ip+48);                   
+
+    uint8x16x4_t ov0,ov1; B64E(iv0, ov0); B64E(iv1, ov1);                                       
+      #if NE > 128 
+    iv0 = vld3q_u8(ip+ 96);
+    iv1 = vld3q_u8(ip+144);                   
+      #endif
+	vst4q_u8(op,    ov0);                                                       
+	vst4q_u8(op+64, ov1);                          	//PREFETCH(ip,256,0);                                                  
+      #if NE > 128 
+                         B64E(iv0, ov0); B64E(iv1, ov1);                                             
+ 	vst4q_u8(op+128, ov0);                                                       
+	vst4q_u8(op+192, ov1);                          	                                            
+          #endif
+  }
+  for(                 ; op != out+(outlen&~(64-1)); op += 64, ip += (64/4)*3) { 								
+    const uint8x16x3_t iv = vld3q_u8(ip);
+    uint8x16x4_t       ov; 
+    B64E(iv, ov); 
+	vst4q_u8(op,ov);                                                       
+  } 
+  EXTAIL();
+  return outlen;
+}
+
+#elif defined(__SSSE3__) //----------------- SSSE3 / SSE4.1 / AVX (derived from the AVX2 functions ) -----------------------------------------------------------------
+
+#define OVD 4
+size_t TEMPLATE2(FUNPREF, dec)(const unsigned char *in, size_t inlen, unsigned char *out) {
+  if(inlen >= 16+OVD) {
+    const unsigned char *ip;
+          unsigned char *op; 
+      #ifdef __AVX__
+    #define ND 64
+      #else
+    #define ND 32
+      #endif
+    __m128i vx = _mm_setzero_si128();
+    const __m128i delta_asso   = _mm_setr_epi8(0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,  0x00, 0x00, 0x00, 0x00, 0x00, 0x0f, 0x00, 0x0f);
+    const __m128i delta_values = _mm_setr_epi8(0x00, 0x00, 0x00, 0x13, 0x04, 0xbf, 0xbf, 0xb9,  0xb9, 0x00, 0x10, 0xc3, 0xbf, 0xbf, 0xb9, 0xb9);
+      #ifndef NB64CHECK
+    const __m128i check_asso   = _mm_setr_epi8(0x0d, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,  0x01, 0x01, 0x03, 0x07, 0x0b, 0x0b, 0x0b, 0x0f);
+    const __m128i check_values = _mm_setr_epi8(0x80, 0x80, 0x80, 0x80, 0xcf, 0xbf, 0xd5, 0xa6,  0xb5, 0x86, 0xd1, 0x80, 0xb1, 0x80, 0x91, 0x80);    
+      #endif
+    const __m128i          cpv = _mm_set_epi8( -1, -1, -1, -1, 12, 13, 14,  8,    9, 10,  4,  5,  6,  0,  1,  2);
+
+    for(ip = in, op = out; ip < (in+inlen)-(ND+OVD); ip += ND, op += (ND/4)*3) {
+      __m128i iv0 = _mm_loadu_si128((__m128i *) ip),
+              iv1 = _mm_loadu_si128((__m128i *)(ip+16));
+                                                                                
+      __m128i ov0,shifted0; MM_MAP8TO6(iv0, shifted0,delta_asso, delta_values, ov0); MM_PACK8TO6(ov0, cpv);
+      __m128i ov1,shifted1; MM_MAP8TO6(iv1, shifted1,delta_asso, delta_values, ov1); MM_PACK8TO6(ov1, cpv);
+
+      _mm_storeu_si128((__m128i*) op,     ov0);                                                  
+      _mm_storeu_si128((__m128i*)(op+12), ov1);                                             PREFETCH(ip,1024,0);                                        
+
+        #if ND > 32
+      __m128i iv2 = _mm_loadu_si128((__m128i *)(ip+32)),
+              iv3 = _mm_loadu_si128((__m128i *)(ip+48));
+        #endif
+      
+      CHECK0(MM_B64CHK(iv0, shifted0, check_asso, check_values, vx));
+      CHECK1(MM_B64CHK(iv1, shifted1, check_asso, check_values, vx));
+
+        #if ND > 32
+      __m128i ov2,shifted2; MM_MAP8TO6(iv2, shifted2,delta_asso, delta_values, ov2); MM_PACK8TO6(ov2, cpv);
+      __m128i ov3,shifted3; MM_MAP8TO6(iv3, shifted3,delta_asso, delta_values, ov3); MM_PACK8TO6(ov3, cpv);
+    
+      _mm_storeu_si128((__m128i*)(op+24), ov2);                                                  
+      _mm_storeu_si128((__m128i*)(op+36), ov3);                                                                                 
+      CHECK1(MM_B64CHK(iv2, shifted2, check_asso, check_values, vx));
+      CHECK1(MM_B64CHK(iv3, shifted3, check_asso, check_values, vx));
+        #endif
+    }
+      #ifdef __AVX__
+    for(; ip < (in+inlen)-(16+OVD); ip += 16, op += (16/4)*3) {
+      #else
+    if(ip < (in+inlen)-(16+OVD)) {
+      #endif
+      __m128i iv0 = _mm_loadu_si128((__m128i *) ip);
+      __m128i ov0, shifted0; MM_MAP8TO6(iv0, shifted0,delta_asso, delta_values, ov0); MM_PACK8TO6(ov0, cpv);
+      _mm_storeu_si128((__m128i*) op, ov0);                                                  
+      CHECK1(MM_B64CHK(iv0, shifted0, check_asso, check_values, vx));
+        #ifndef __AVX__
+      ip += 16; op += (16/4)*3;
+        #endif
+    }
+    size_t rc;
+    if(!(rc = _tb64xdec(ip, inlen-(ip-in), op)) || _mm_movemask_epi8(vx)) return 0;
+    return (op-out)+rc;
+  }
+  return _tb64xdec(in, inlen, out);
+}
+
+#define OVE 8
+size_t TEMPLATE2(FUNPREF, enc)(const unsigned char* in, size_t inlen, unsigned char *out) { 
+  const unsigned char *ip = in; 
+        unsigned char *op = out;
+  size_t   outlen = TB64ENCLEN(inlen); 
+    #ifdef __AVX__
+  #define NE 64
+    #else
+  #define NE 32
+    #endif
+  if(outlen >= 16+OVE) {
+    const __m128i shuf    = _mm_set_epi8(10,11,  9, 10,  7,  8,  6,  7,    4,  5,  3,  4,  1,  2,  0,  1);
+
+    for(; op <= (out+outlen)-(NE+OVE); op += NE, ip += (NE/4)*3) {                       PREFETCH(ip,1024,0);            
+      __m128i v0 = _mm_loadu_si128((__m128i*)ip),   
+              v1 = _mm_loadu_si128((__m128i*)(ip+12)); 
+        #if NE > 32
+      __m128i v2 = _mm_loadu_si128((__m128i*)(ip+24)),
+              v3 = _mm_loadu_si128((__m128i*)(ip+36)); 
+        #endif
+              v0 = _mm_shuffle_epi8(v0, shuf);
+              v1 = _mm_shuffle_epi8(v1, shuf);
+              v0 = mm_unpack6to8(v0);
+              v1 = mm_unpack6to8(v1);
+              v0 = mm_map6to8(v0);
+              v1 = mm_map6to8(v1);
+      _mm_storeu_si128((__m128i*) op,     v0);                                          
+      _mm_storeu_si128((__m128i*)(op+16), v1);                                          
+        #if NE > 32
+              v2 = _mm_shuffle_epi8(v2, shuf);
+              v3 = _mm_shuffle_epi8(v3, shuf);
+              v2 = mm_unpack6to8(v2);
+              v3 = mm_unpack6to8(v3);
+              v2 = mm_map6to8(v2);
+              v3 = mm_map6to8(v3);
+      _mm_storeu_si128((__m128i*)(op+32), v2);                                          
+      _mm_storeu_si128((__m128i*)(op+48), v3);                                          
+        #endif            
+    }
+
+    for(; op <= (out+outlen)-(16+OVE); op += 16, ip += (16/4)*3) {
+      __m128i v0 = _mm_loadu_si128((__m128i*)ip);
+              v0 = _mm_shuffle_epi8(v0, shuf);
+              v0 = mm_unpack6to8(v0);
+              v0 = mm_map6to8(v0);
+      _mm_storeu_si128((__m128i*) op, v0);                                          
+    }
+  }
+  EXTAIL();
+  return outlen;
+}
+#endif
+
+//-------------------------------------------------------------------------------------------------------------------
+#if !defined(__AVX__) //include only 1 time
+size_t tb64memcpy(const unsigned char* in, size_t inlen, unsigned char *out) {
+  memcpy(out, in, inlen);
+  return inlen;
+}
+ 
+static unsigned _cpuisa;
+//--------------------- CPU detection -------------------------------------------
+    #if defined(__i386__) || defined(__x86_64__)
+      #if _MSC_VER >=1300
+#include <intrin.h>
+      #elif defined (__INTEL_COMPILER)
+#include <x86intrin.h>
+      #endif
+
+static inline void cpuid(int reg[4], int id) {
+      #if defined (_MSC_VER) //|| defined (__INTEL_COMPILER)
+  __cpuidex(reg, id, 0);
+      #elif defined(__i386__) || defined(__x86_64__)
+  __asm("cpuid" : "=a"(reg[0]),"=b"(reg[1]),"=c"(reg[2]),"=d"(reg[3]) : "a"(id),"c"(0) : );
+      #endif
+}
+
+static inline uint64_t xgetbv (int ctr) {
+      #if(defined _MSC_VER && (_MSC_FULL_VER >= 160040219) || defined __INTEL_COMPILER)
+  return _xgetbv(ctr);
+      #elif defined(__i386__) || defined(__x86_64__)
+  unsigned a, d;
+  __asm("xgetbv" : "=a"(a),"=d"(d) : "c"(ctr) : );
+  return (uint64_t)d << 32 | a;
+      #else
+  unsigned a=0, d=0;
+  return (uint64_t)d << 32 | a;
+      #endif
+}
+    #endif
+
+#define AVX512F     0x001
+#define AVX512DQ    0x002
+#define AVX512IFMA  0x004
+#define AVX512PF    0x008
+#define AVX512ER    0x010
+#define AVX512CD    0x020
+#define AVX512BW    0x040
+#define AVX512VL    0x080
+#define AVX512VNNI  0x100
+#define AVX512VBMI  0x200
+#define AVX512VBMI2 0x400
+
+#define IS_SSE       0x10
+#define IS_SSE2      0x20
+#define IS_SSE3      0x30
+#define IS_SSSE3     0x32
+#define IS_POWER9    0x34 // powerpc
+#define IS_NEON      0x38 // arm neon
+#define IS_SSE41     0x40
+#define IS_SSE41x    0x41 //+popcount
+#define IS_SSE42     0x42
+#define IS_AVX       0x50
+#define IS_AVX2      0x60
+#define IS_AVX512    0x800
+
+unsigned cpuisa(void) {
+  int c[4] = {0};
+  if(_cpuisa) return _cpuisa;
+  _cpuisa++;
+    #if defined(__i386__) || defined(__x86_64__)
+  cpuid(c, 0);
+  if(c[0]) {
+    cpuid(c, 1);
+    //family = ((c >> 8) & 0xf) + ((c >> 20) & 0xff)
+    //model  = ((c >> 4) & 0xf) + ((c >> 12) & 0xf0)
+    if( c[3] & (1 << 25)) {         _cpuisa  = IS_SSE;
+    if( c[3] & (1 << 26)) {         _cpuisa  = IS_SSE2;
+    if( c[2] & (1 <<  0)) {         _cpuisa  = IS_SSE3;
+      //                            _cpuisa  = IS_SSE3SLOW; // Atom SSSE3 slow
+    if( c[2] & (1 <<  9)) {         _cpuisa  = IS_SSSE3;
+    if( c[2] & (1 << 19)) {         _cpuisa  = IS_SSE41;
+    if( c[2] & (1 << 23)) {         _cpuisa  = IS_SSE41x; // +popcount
+    if( c[2] & (1 << 20)) {         _cpuisa  = IS_SSE42;  // SSE4.2
+    if((c[2] & (1 << 28)) &&
+       (c[2] & (1 << 27)) &&                           // OSXSAVE
+       (c[2] & (1 << 26)) &&                           // XSAVE
+       (xgetbv(0) & 6)==6) {        _cpuisa  = IS_AVX; // AVX
+      if(c[2]& (1 <<  3))           _cpuisa |= 1;      // +FMA3
+      if(c[2]& (1 << 16))           _cpuisa |= 2;      // +FMA4
+      if(c[2]& (1 << 25))           _cpuisa |= 4;      // +AES
+      cpuid(c, 7);
+      if(c[1] & (1 << 5)) {         _cpuisa = IS_AVX2;
+        if(c[1] & (1 << 16)) {
+          cpuid(c, 0xd);
+          if((c[0] & 0x60)==0x60) { _cpuisa = IS_AVX512;
+            cpuid(c, 7);
+            if(c[1] & (1<<16))      _cpuisa |= AVX512F;
+            if(c[1] & (1<<17))      _cpuisa |= AVX512DQ;
+            if(c[1] & (1<<21))      _cpuisa |= AVX512IFMA;
+            if(c[1] & (1<<26))      _cpuisa |= AVX512PF;
+            if(c[1] & (1<<27))      _cpuisa |= AVX512ER;
+            if(c[1] & (1<<28))      _cpuisa |= AVX512CD;
+            if(c[1] & (1<<30))      _cpuisa |= AVX512BW;
+            if(c[1] & (1u<<31))     _cpuisa |= AVX512VL;
+            if(c[2] & (1<< 1))      _cpuisa |= AVX512VBMI;
+            if(c[2] & (1<<11))      _cpuisa |= AVX512VNNI;
+            if(c[2] & (1<< 6))      _cpuisa |= AVX512VBMI2;
+      }}}
+    }}}}}}}}}
+    #elif defined(__powerpc64__)
+  _cpuisa = IS_POWER9; // power9
+    #elif defined(__ARM_NEON)
+  _cpuisa = IS_NEON; // ARM_NEON
+    #endif
+  return _cpuisa;
+}
+
+unsigned cpuini(unsigned cpuisa) { if(cpuisa) _cpuisa = cpuisa; return _cpuisa; }
+
+char *cpustr(unsigned cpuisa) {
+  if(!cpuisa) cpuisa = _cpuisa;
+    #if defined(__i386__) || defined(__x86_64__)
+  if(cpuisa >= IS_AVX512) {
+    if(cpuisa & AVX512VBMI2) return "avx512vbmi2";
+    if(cpuisa & AVX512VBMI)  return "avx512vbmi";
+    if(cpuisa & AVX512VNNI)  return "avx512vnni";
+    if(cpuisa & AVX512VL)    return "avx512vl";
+    if(cpuisa & AVX512BW)    return "avx512bw";
+    if(cpuisa & AVX512CD)    return "avx512cd";
+    if(cpuisa & AVX512ER)    return "avx512er";
+    if(cpuisa & AVX512PF)    return "avx512pf";
+    if(cpuisa & AVX512IFMA)  return "avx512ifma";
+    if(cpuisa & AVX512DQ)    return "avx512dq";
+    if(cpuisa & AVX512F)     return "avx512f";
+    return "avx512";
+  }
+  else if(cpuisa >= IS_AVX2)    return "avx2";
+  else if(cpuisa >= IS_AVX)
+    switch(cpuisa&0xf) {
+      case 1: return "avx+fma3";
+      case 2: return "avx+fma4";
+      case 4: return "avx+aes";
+      case 5: return "avx+fma3+aes";
+      default:return "avx";
+    }
+  else if(cpuisa >= IS_SSE42)   return "sse4.2";
+  else if(cpuisa >= IS_SSE41x)  return "sse4.1+popcnt";
+  else if(cpuisa >= IS_SSE41)   return "sse4.1";
+  else if(cpuisa >= IS_SSSE3)   return "ssse3";
+  else if(cpuisa >= IS_SSE3)    return "sse3";
+  else if(cpuisa >= IS_SSE2)    return "sse2";
+  else if(cpuisa >= IS_SSE)     return "sse";
+     #elif defined(__powerpc64__)
+  if(cpuisa >= IS_POWER9)       return "power9";
+    #elif defined(__ARM_NEON)
+  if(cpuisa >= IS_NEON)         return "arm_neon";
+    #endif
+  return "none";
+}
+
+//---------------------------------------------------------------------------------
+TB64FUNC _tb64e = tb64xenc;
+TB64FUNC _tb64d = tb64xdec;
+
+static int tb64set;
+ 
+void tb64ini(unsigned id, unsigned isshort) { 
+  int i; 
+  if(tb64set) return; 
+  tb64set++;   
+  i = id?id:cpuisa();
+    #if defined(__i386__) || defined(__x86_64__)
+      #ifdef USE_AVX512
+  if(i >= IS_AVX512) {  
+    _tb64e = i >= (IS_AVX512|AVX512VL)?tb64avx2enc:tb64avx2enc; 
+    _tb64d = tb64avx512dec;
+  } else 
+      #endif
+      #ifndef NO_AVX2
+  if(i >= IS_AVX2) {  
+    _tb64e = isshort?_tb64avx2enc:tb64avx2enc; 
+    _tb64d = isshort?_tb64avx2dec:tb64avx2dec;
+  } else 
+      #endif
+      #ifndef NO_AVX
+    if(i >= IS_AVX) {  
+    _tb64e = tb64avxenc; 
+    _tb64d = tb64avxdec;
+  } else 
+      #endif
+    #endif
+    #if defined(__i386__) || defined(__x86_64__) || defined(__ARM_NEON) || defined(__powerpc64__)
+      #ifndef NO_SSE
+  if(i >= IS_SSSE3) {  
+    _tb64e = tb64sseenc; 
+    _tb64d = tb64ssedec;
+  }
+      #endif
+    #endif
+}
+
+size_t tb64enc(const unsigned char *in, size_t inlen, unsigned char *out) {
+  if(!tb64set) tb64ini(0,0);
+  return _tb64e(in,inlen,out);
+}
+size_t tb64dec(const unsigned char *in, size_t inlen, unsigned char *out) {
+  if(!tb64set) tb64ini(0,0);
+  return _tb64d(in,inlen,out);
+}
+#endif
+