waargonaut-0.8.0.2: src/Waargonaut/Decode/Types.hs
{-# LANGUAGE DeriveFunctor #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE TypeFamilies #-}
-- |
--
-- Types for the succinct data structure decoder
--
module Waargonaut.Decode.Types
( ParseFn
, Cursor
, CursorHistory
, Decoder (..)
, DecodeResult (..)
, JCurs (..)
, mkCursor
, jsonTypeAt
, JsonType(..)
) where
import Control.Lens (Rewrapped,
Wrapped (..),
iso)
import Control.Monad.Except (MonadError (..))
import Control.Monad.Morph (MFunctor (..),
MMonad (..))
import Control.Monad.Reader (MonadReader,
ReaderT (..))
import Control.Monad.State (MonadState)
import Control.Monad.Trans.Class (MonadTrans (lift))
import Data.Functor.Alt (Alt (..))
import qualified Data.Text as Text
import Data.ByteString (ByteString)
import HaskellWorks.Data.Json.Standard.Cursor.Fast (Cursor,fromByteStringViaBlanking)
import HaskellWorks.Data.Json.Standard.Cursor.Generic (cursorRank)
import HaskellWorks.Data.Json.Standard.Cursor.Type (JsonType (..),
JsonTypeAt (..))
import HaskellWorks.Data.Positioning (Count)
import Waargonaut.Decode.Internal (CursorHistory', DecodeError (..),
DecodeResultT (..),
ZipperMove (BranchFail),
recordZipperMove)
import Waargonaut.Types (Json)
-- | We define the index of our 'CursorHistory'' to be the 'HaskellWorks.Data.Positioning.Count'.
type CursorHistory =
CursorHistory' Count
-- | Convenience alias for the type of the function we will use to parse
-- the input string into the 'Json' structure.
type ParseFn =
ByteString -> Either DecodeError Json
-- | 'Decoder' type that is used directly to convert 'Json' structures to other
-- data types.
--
newtype Decoder f a = Decoder
{ runDecoder :: ParseFn -> JCurs -> DecodeResultT Count DecodeError f a
}
deriving Functor
instance Monad f => Applicative (Decoder f) where
pure a = Decoder $ \_ _ -> pure a
aToB <*> a = Decoder $ \p c ->
runDecoder aToB p c <*> runDecoder a p c
instance Monad f => Alt (Decoder f) where
a <!> b = Decoder $ \p c -> catchError (runDecoder a p c) $ \e -> do
recordZipperMove (BranchFail . Text.pack $ show e) (cursorRank $ unJCurs c)
runDecoder b p c
instance Monad f => Monad (Decoder f) where
return = pure
a >>= aToFb = Decoder $ \p c -> do
r <- runDecoder a p c
runDecoder (aToFb r) p c
instance Monad f => MonadError DecodeError (Decoder f) where
throwError e = Decoder (\_ _ -> throwError e)
catchError d handle = Decoder $ \p c ->
catchError (runDecoder d p c) (\e -> runDecoder (handle e) p c)
instance MonadTrans Decoder where
lift fa = Decoder (\ _ _ -> lift fa)
instance MFunctor Decoder where
hoist nat (Decoder pjdr) = Decoder (\p -> hoist nat . pjdr p)
-- | Wrapper type for the 'SuccinctCursor'
newtype JCurs = JCurs
{ unJCurs :: Cursor
} deriving JsonTypeAt
instance JCurs ~ t => Rewrapped JCurs t
instance Wrapped JCurs where
type Unwrapped JCurs = Cursor
_Wrapped' = iso unJCurs JCurs
-- | Take a 'ByteString' input and build an index of the JSON structure inside
--
mkCursor :: ByteString -> JCurs
mkCursor = JCurs . fromByteStringViaBlanking
-- | Provide some of the type parameters that the underlying 'DecodeResultT'
-- requires. This contains the state and error management as we walk around our
-- zipper and decode our JSON input.
--
-- Addtionally we keep our parsing function in a 'ReaderT' such that it's
-- accessible for all of the decoding steps.
--
newtype DecodeResult f a = DecodeResult
{ unDecodeResult :: ReaderT ParseFn (DecodeResultT Count DecodeError f) a
}
deriving ( Functor
, Applicative
, Monad
, MonadReader ParseFn
, MonadError DecodeError
, MonadState CursorHistory
)
instance MonadTrans DecodeResult where
lift = DecodeResult . lift . lift
instance MFunctor DecodeResult where
hoist nat (DecodeResult dr) = DecodeResult (hoist (hoist nat) dr)
instance MMonad DecodeResult where
embed f (DecodeResult dr) = DecodeResult . ReaderT $ \p ->
embed (flip runReaderT p . unDecodeResult . f) $ runReaderT dr p