{-# LANGUAGE TypeFamilies #-}
module Ecluse.Core.Registry.Json.Shape (
Shape (..),
Members,
namedMembers,
everyMember,
knownMembers,
prepareMembers,
listedMember,
Mode (..),
MemberKey (..),
memberText,
Build (..),
Trees (..),
readShape,
) where
import Data.Aeson (Value (..))
import Data.Aeson.Key qualified as Key
import Data.Aeson.KeyMap qualified as KeyMap
import Data.HashMap.Strict qualified as HashMap
import Data.JsonStream.Lexer (Cursor, Element (..), PlainString, decodeString)
import Data.JsonStream.Lexer qualified as Lexer
import Data.Vector qualified as V
import Ecluse.Core.Registry.Json.Intern (Entry, InternTable, Interned (..), Name, PreparedName, decodedName, entryKeeps, entryString, entryText, internName, internPreparedName, nameBytes, nameText, plainName, prepareName)
import Ecluse.Core.Registry.Json.Walk (Walk (..), isString, memberName, nestingLimit, readString, skipFrom, tooDeep, withElement, withScanned)
data Shape
=
Scalar !Int
|
Generic !Int
|
ObjectWith !Int Members Shape
|
ArrayWith !Int Shape Shape
|
StringOr !Int Shape
|
ObjectOr Value Members
|
Checked !Int Shape
data Members = Members (HashMap.HashMap ByteString Member) (Maybe Shape)
data Member = Member (Key.Key, Shape) (Maybe PreparedName)
namedMembers :: [(Text, Shape)] -> Members
namedMembers :: [(Text, Shape)] -> Members
namedMembers [(Text, Shape)]
entries = HashMap ByteString Member -> Maybe Shape -> Members
Members ((Member -> Member -> Member)
-> [(ByteString, Member)] -> HashMap ByteString Member
forall k v.
(Eq k, Hashable k) =>
(v -> v -> v) -> [(k, v)] -> HashMap k v
HashMap.fromListWith (\Member
_ Member
earlier -> Member
earlier) [(Text -> ByteString
forall a b. ConvertUtf8 a b => a -> b
encodeUtf8 Text
name, (Key, Shape) -> Maybe PreparedName -> Member
Member (Text -> Key
Key.fromText Text
name, Shape
shape) Maybe PreparedName
forall a. Maybe a
Nothing) | (Text
name, Shape
shape) <- [(Text, Shape)]
entries]) Maybe Shape
forall a. Maybe a
Nothing
everyMember :: Shape -> Members
everyMember :: Shape -> Members
everyMember = HashMap ByteString Member -> Maybe Shape -> Members
Members HashMap ByteString Member
forall a. Monoid a => a
mempty (Maybe Shape -> Members)
-> (Shape -> Maybe Shape) -> Shape -> Members
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Shape -> Maybe Shape
forall a. a -> Maybe a
Just
knownMembers :: [Text] -> Shape -> Members
knownMembers :: [Text] -> Shape -> Members
knownMembers [Text]
names Shape
shape = HashMap ByteString Member -> Maybe Shape -> Members
Members ([(ByteString, Member)] -> HashMap ByteString Member
forall k v. (Eq k, Hashable k) => [(k, v)] -> HashMap k v
HashMap.fromList [(Text -> ByteString
forall a b. ConvertUtf8 a b => a -> b
encodeUtf8 Text
name, (Key, Shape) -> Maybe PreparedName -> Member
Member (Text -> Key
Key.fromText Text
name, Shape
shape) Maybe PreparedName
forall a. Maybe a
Nothing) | Text
name <- [Text]
names]) (Shape -> Maybe Shape
forall a. a -> Maybe a
Just Shape
shape)
prepareMembers :: InternTable -> Members -> Members
prepareMembers :: InternTable -> Members -> Members
prepareMembers InternTable
table (Members HashMap ByteString Member
named Maybe Shape
other) = HashMap ByteString Member -> Maybe Shape -> Members
Members ((Member -> Member)
-> HashMap ByteString Member -> HashMap ByteString Member
forall v1 v2 k. (v1 -> v2) -> HashMap k v1 -> HashMap k v2
HashMap.map Member -> Member
prepare HashMap ByteString Member
named) Maybe Shape
other
where
prepare :: Member -> Member
prepare (Member schema :: (Key, Shape)
schema@(Key
key, Shape
_) Maybe PreparedName
_) =
let !prepared :: PreparedName
prepared = InternTable -> Text -> PreparedName
prepareName InternTable
table (Key -> Text
Key.toText Key
key)
in (Key, Shape) -> Maybe PreparedName -> Member
Member (Key, Shape)
schema (PreparedName -> Maybe PreparedName
forall a. a -> Maybe a
Just PreparedName
prepared)
listedMember :: Members -> Name -> Maybe (Key.Key, Shape)
listedMember :: Members -> Name -> Maybe (Key, Shape)
listedMember Members
members Name
name = case Members -> Name -> Maybe Member
findMember Members
members Name
name of
Just (Member (Key, Shape)
schema Maybe PreparedName
_) -> (Key, Shape) -> Maybe (Key, Shape)
forall a. a -> Maybe a
Just (Key, Shape)
schema
Maybe Member
Nothing -> Maybe (Key, Shape)
forall a. Maybe a
Nothing
{-# INLINE listedMember #-}
findMember :: Members -> Name -> Maybe Member
findMember :: Members -> Name -> Maybe Member
findMember (Members HashMap ByteString Member
named Maybe Shape
_) Name
name
| HashMap ByteString Member -> Bool
forall k v. HashMap k v -> Bool
HashMap.null HashMap ByteString Member
named = Maybe Member
forall a. Maybe a
Nothing
| Bool
otherwise = ByteString -> HashMap ByteString Member -> Maybe Member
forall k v. (Eq k, Hashable k) => k -> HashMap k v -> Maybe v
HashMap.lookup (Name -> ByteString
nameBytes Name
name) HashMap ByteString Member
named
{-# INLINE findMember #-}
data Mode = Share | Keep
data MemberKey = SharedKey !Entry | OwnKey !Key.Key
memberText :: MemberKey -> Text
memberText :: MemberKey -> Text
memberText = \case
SharedKey Entry
entry -> Entry -> Text
entryText Entry
entry
OwnKey Key
key -> Key -> Text
Key.toText Key
key
{-# INLINE memberText #-}
class (Walk r) => Build b r where
type Built b
type Fields b
type Items b
sharedString :: b -> Entry -> (Built b -> r) -> r
ownString :: b -> Name -> (Built b -> r) -> r
integer :: b -> Int -> (Built b -> r) -> r
whole :: b -> Value -> (Built b -> r) -> r
emptyContainer :: b -> (Built b -> r) -> r
openObject :: b -> (Fields b -> r) -> r
beginMember :: b -> MemberKey -> Fields b -> (Bool -> r) -> r
addMember :: b -> MemberKey -> Built b -> Fields b -> (Fields b -> r) -> r
dropValue :: b -> Built b -> r -> r
closeObject :: b -> Fields b -> (Built b -> r) -> r
openArray :: b -> (Items b -> r) -> r
addItem :: b -> Built b -> Items b -> (Items b -> r) -> r
closeArray :: b -> Int -> Items b -> (Built b -> r) -> r
data Trees = Trees
instance (Walk r) => Build Trees r where
type Built Trees = Value
type Fields Trees = KeyMap.KeyMap Value
type Items Trees = [Value]
sharedString :: Trees -> Entry -> (Built Trees -> r) -> r
sharedString Trees
_ Entry
entry Built Trees -> r
next = Built Trees -> r
next (Entry -> Value
entryString Entry
entry)
ownString :: Trees -> Name -> (Built Trees -> r) -> r
ownString Trees
_ Name
name Built Trees -> r
next = Built Trees -> r
next (Text -> Value
String (Name -> Text
nameText Name
name))
integer :: Trees -> Int -> (Built Trees -> r) -> r
integer Trees
_ Int
number Built Trees -> r
next = let !value :: Value
value = Scientific -> Value
Number (Int -> Scientific
forall a b. (Integral a, Num b) => a -> b
fromIntegral Int
number) in Built Trees -> r
next Value
Built Trees
value
whole :: Trees -> Value -> (Built Trees -> r) -> r
whole Trees
_ Value
value Built Trees -> r
next = Built Trees -> r
next Value
Built Trees
value
emptyContainer :: Trees -> (Built Trees -> r) -> r
emptyContainer Trees
_ Built Trees -> r
next = Built Trees -> r
next Value
Built Trees
emptyArray
openObject :: Trees -> (Fields Trees -> r) -> r
openObject Trees
_ Fields Trees -> r
next = Fields Trees -> r
next KeyMap Value
Fields Trees
forall v. KeyMap v
KeyMap.empty
beginMember :: Trees -> MemberKey -> Fields Trees -> (Bool -> r) -> r
beginMember Trees
_ MemberKey
key Fields Trees
fields Bool -> r
next = Bool -> r
next (Key -> KeyMap Value -> Bool
forall a. Key -> KeyMap a -> Bool
KeyMap.member (Text -> Key
Key.fromText (MemberKey -> Text
memberText MemberKey
key)) KeyMap Value
Fields Trees
fields)
addMember :: Trees
-> MemberKey
-> Built Trees
-> Fields Trees
-> (Fields Trees -> r)
-> r
addMember Trees
_ MemberKey
key Built Trees
value Fields Trees
fields Fields Trees -> r
next = Fields Trees -> r
next (Key -> Value -> KeyMap Value -> KeyMap Value
forall v. Key -> v -> KeyMap v -> KeyMap v
KeyMap.insert (Text -> Key
Key.fromText (MemberKey -> Text
memberText MemberKey
key)) Value
Built Trees
value KeyMap Value
Fields Trees
fields)
dropValue :: Trees -> Built Trees -> r -> r
dropValue Trees
_ Built Trees
_ r
next = r
next
closeObject :: Trees -> Fields Trees -> (Built Trees -> r) -> r
closeObject Trees
_ Fields Trees
fields Built Trees -> r
next = Built Trees -> r
next (KeyMap Value -> Value
Object KeyMap Value
Fields Trees
fields)
openArray :: Trees -> (Items Trees -> r) -> r
openArray Trees
_ Items Trees -> r
next = Items Trees -> r
next []
addItem :: Trees -> Built Trees -> Items Trees -> (Items Trees -> r) -> r
addItem Trees
_ Built Trees
value Items Trees
values Items Trees -> r
next = Items Trees -> r
next (Value
Built Trees
value Value -> [Value] -> [Value]
forall a. a -> [a] -> [a]
: [Value]
Items Trees
values)
closeArray :: Trees -> Int -> Items Trees -> (Built Trees -> r) -> r
closeArray Trees
_ Int
count Items Trees
values Built Trees -> r
next = let !array :: Value
array = Array -> Value
Array (Int -> [Value] -> Array
forall a. Int -> [a] -> Vector a
V.fromListN Int
count ([Value] -> [Value]
forall a. [a] -> [a]
reverse [Value]
Items Trees
values)) in Built Trees -> r
next Value
Built Trees
array
{-# INLINE sharedString #-}
{-# INLINE ownString #-}
{-# INLINE integer #-}
{-# INLINE whole #-}
{-# INLINE emptyContainer #-}
{-# INLINE openObject #-}
{-# INLINE beginMember #-}
{-# INLINE addMember #-}
{-# INLINE dropValue #-}
{-# INLINE closeObject #-}
{-# INLINE openArray #-}
{-# INLINE addItem #-}
{-# INLINE closeArray #-}
readShape :: (Build b r) => b -> Shape -> Mode -> InternTable -> Element -> Cursor -> (Built b -> InternTable -> Cursor -> r) -> r
readShape :: forall b r.
Build b r =>
b
-> Shape
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
readShape b
build = b
-> Int
-> Bool
-> Shape
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
forall b r.
Build b r =>
b
-> Int
-> Bool
-> Shape
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
readAt b
build Int
0 Bool
False
{-# INLINEABLE readShape #-}
readAt :: (Build b r) => b -> Int -> Bool -> Shape -> Mode -> InternTable -> Element -> Cursor -> (Built b -> InternTable -> Cursor -> r) -> r
readAt :: forall b r.
Build b r =>
b
-> Int
-> Bool
-> Shape
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
readAt b
build Int
open Bool
raced Shape
shape Mode
mode InternTable
table Element
element Cursor
rest Built b -> InternTable -> Cursor -> r
next = case Shape
shape of
Scalar Int
budget
| Int
budget Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
<= Int
0 -> Int -> Element -> Cursor -> r
forall r. Walk r => Int -> Element -> Cursor -> r
tooDeepAt Int
open Element
element Cursor
rest
| Bool
otherwise -> b
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> (Cursor -> r)
-> r
forall b r.
Build b r =>
b
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> (Cursor -> r)
-> r
readScalar b
build Mode
mode InternTable
table Element
element Cursor
rest Built b -> InternTable -> Cursor -> r
next (\Cursor
after -> b -> (Built b -> r) -> r
forall b r. Build b r => b -> (Built b -> r) -> r
emptyContainer b
build (\Built b
value -> Built b -> InternTable -> Cursor -> r
next Built b
value InternTable
table Cursor
after))
Generic Int
budget
| Int
budget Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
<= Int
0 -> Int -> Element -> Cursor -> r
forall r. Walk r => Int -> Element -> Cursor -> r
tooDeepAt Int
open Element
element Cursor
rest
| Bool
otherwise -> case Element
element of
Element
ObjectBegin -> b
-> Int
-> Members
-> Mode
-> InternTable
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
forall b r.
Build b r =>
b
-> Int
-> Members
-> Mode
-> InternTable
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
readObject b
build (Bool -> Int
entering Bool
raced) (Shape -> Members
everyMember (Int -> Shape
Generic (Int
budget Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
1))) Mode
mode InternTable
table Cursor
rest Built b -> InternTable -> Cursor -> r
next
Element
ArrayBegin -> b
-> Int
-> Shape
-> Mode
-> InternTable
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
forall b r.
Build b r =>
b
-> Int
-> Shape
-> Mode
-> InternTable
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
readArray b
build (Bool -> Int
entering Bool
True) (Int -> Shape
Generic (Int
budget Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
1)) Mode
mode InternTable
table Cursor
rest Built b -> InternTable -> Cursor -> r
next
Element
_ -> b
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> (Cursor -> r)
-> r
forall b r.
Build b r =>
b
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> (Cursor -> r)
-> r
readScalar b
build Mode
mode InternTable
table Element
element Cursor
rest Built b -> InternTable -> Cursor -> r
next (\Cursor
_ -> Text -> r
forall r. Walk r => Text -> r
failWith Text
"unexpected container")
ObjectWith Int
budget Members
members Shape
fallback
| Int
budget Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
<= Int
0 -> Int -> Element -> Cursor -> r
forall r. Walk r => Int -> Element -> Cursor -> r
tooDeepAt Int
open Element
element Cursor
rest
| Element
ObjectBegin <- Element
element -> b
-> Int
-> Members
-> Mode
-> InternTable
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
forall b r.
Build b r =>
b
-> Int
-> Members
-> Mode
-> InternTable
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
readObject b
build (Bool -> Int
entering Bool
raced) Members
members Mode
mode InternTable
table Cursor
rest Built b -> InternTable -> Cursor -> r
next
| Bool
otherwise -> b
-> Int
-> Bool
-> Shape
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
forall b r.
Build b r =>
b
-> Int
-> Bool
-> Shape
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
readAt b
build Int
open Bool
True Shape
fallback Mode
mode InternTable
table Element
element Cursor
rest Built b -> InternTable -> Cursor -> r
next
ArrayWith Int
budget Shape
item Shape
fallback
| Int
budget Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
<= Int
0 -> Int -> Element -> Cursor -> r
forall r. Walk r => Int -> Element -> Cursor -> r
tooDeepAt Int
open Element
element Cursor
rest
| Element
ArrayBegin <- Element
element -> b
-> Int
-> Shape
-> Mode
-> InternTable
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
forall b r.
Build b r =>
b
-> Int
-> Shape
-> Mode
-> InternTable
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
readArray b
build (Bool -> Int
entering Bool
raced) Shape
item Mode
mode InternTable
table Cursor
rest Built b -> InternTable -> Cursor -> r
next
| Bool
otherwise -> b
-> Int
-> Bool
-> Shape
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
forall b r.
Build b r =>
b
-> Int
-> Bool
-> Shape
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
readAt b
build Int
open Bool
True Shape
fallback Mode
mode InternTable
table Element
element Cursor
rest Built b -> InternTable -> Cursor -> r
next
StringOr Int
budget Shape
other
| Int
budget Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
<= Int
0 -> Int -> Element -> Cursor -> r
forall r. Walk r => Int -> Element -> Cursor -> r
tooDeepAt Int
open Element
element Cursor
rest
| Element -> Bool
isString Element
element -> Element -> Cursor -> (Name -> Cursor -> r) -> r
forall r. Walk r => Element -> Cursor -> (Name -> Cursor -> r) -> r
readString Element
element Cursor
rest (b
-> Mode
-> InternTable
-> (Built b -> InternTable -> Cursor -> r)
-> Name
-> Cursor
-> r
forall b r.
Build b r =>
b
-> Mode
-> InternTable
-> (Built b -> InternTable -> Cursor -> r)
-> Name
-> Cursor
-> r
string b
build Mode
mode InternTable
table Built b -> InternTable -> Cursor -> r
next)
| Bool
otherwise -> b
-> Int
-> Bool
-> Shape
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
forall b r.
Build b r =>
b
-> Int
-> Bool
-> Shape
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
readAt b
build Int
open Bool
True Shape
other Mode
mode InternTable
table Element
element Cursor
rest Built b -> InternTable -> Cursor -> r
next
ObjectOr Value
fallback Members
members
| Element
ObjectBegin <- Element
element -> b
-> Int
-> Members
-> Mode
-> InternTable
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
forall b r.
Build b r =>
b
-> Int
-> Members
-> Mode
-> InternTable
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
readObject b
build (Bool -> Int
entering Bool
raced) Members
members Mode
mode InternTable
table Cursor
rest Built b -> InternTable -> Cursor -> r
next
| Bool
otherwise -> Element -> Cursor -> (Cursor -> r) -> r
forall r. Walk r => Element -> Cursor -> (Cursor -> r) -> r
skipFrom Element
element Cursor
rest (\Cursor
after -> b -> Value -> (Built b -> r) -> r
forall b r. Build b r => b -> Value -> (Built b -> r) -> r
whole b
build Value
fallback (\Built b
value -> Built b -> InternTable -> Cursor -> r
next Built b
value InternTable
table Cursor
after))
Checked Int
budget Shape
inner
| Int
budget Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
<= Int
0 -> Int -> Element -> Cursor -> r
forall r. Walk r => Int -> Element -> Cursor -> r
tooDeepAt Int
open Element
element Cursor
rest
| Bool
otherwise -> b
-> Int
-> Bool
-> Shape
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
forall b r.
Build b r =>
b
-> Int
-> Bool
-> Shape
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
readAt b
build Int
open Bool
raced Shape
inner Mode
mode InternTable
table Element
element Cursor
rest Built b -> InternTable -> Cursor -> r
next
where
entering :: Bool -> Int
entering Bool
racing
| Int
open Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
0 = Int
open Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1
| Bool
racing = Int
1
| Bool
otherwise = Int
0
{-# INLINEABLE readAt #-}
tooDeepAt :: (Walk r) => Int -> Element -> Cursor -> r
tooDeepAt :: forall r. Walk r => Int -> Element -> Cursor -> r
tooDeepAt Int
open Element
element Cursor
rest
| Int
open Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
0 = Element -> Cursor -> (Cursor -> r) -> r
forall r. Walk r => Element -> Cursor -> (Cursor -> r) -> r
skipFrom Element
element Cursor
rest (Int -> Cursor -> r
forall r. Walk r => Int -> Cursor -> r
raceFailure Int
open)
| Bool
otherwise = Element -> Cursor -> r
forall r. Walk r => Element -> Cursor -> r
tooDeep Element
element Cursor
rest
{-# INLINEABLE tooDeepAt #-}
raceFailure :: (Walk r) => Int -> Cursor -> r
raceFailure :: forall r. Walk r => Int -> Cursor -> r
raceFailure !Int
level Cursor
tokens = case Cursor -> Scanned
Lexer.next Cursor
tokens of
Scanned
Lexer.Failed -> Text -> r
forall r. Walk r => Text -> r
failWith Text
"the JSON lexer failed"
Lexer.More Cursor
_ -> Text -> r
forall r. Walk r => Text -> r
failWith Text
nestingLimit
Lexer.Token Element
element Cursor
rest -> case Element
element of
Element
ArrayEnd -> Cursor -> r
closed Cursor
rest
Element
ObjectEnd -> Cursor -> r
closed Cursor
rest
Element
ArrayBegin -> Int -> Cursor -> r
forall r. Walk r => Int -> Cursor -> r
raceFailure (Int
level Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1) Cursor
rest
Element
ObjectBegin -> Int -> Cursor -> r
forall r. Walk r => Int -> Cursor -> r
raceFailure (Int
level Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1) Cursor
rest
StringContent ByteString
_ -> Cursor -> r
longString Cursor
rest
Element
StringEnd -> Text -> r
forall r. Walk r => Text -> r
failWith Text
"unexpected end of string"
Element
_ -> Int -> Cursor -> r
forall r. Walk r => Int -> Cursor -> r
raceFailure Int
level Cursor
rest
where
closed :: Cursor -> r
closed Cursor
rest
| Int
level Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
<= Int
1 = Text -> r
forall r. Walk r => Text -> r
failWith Text
nestingLimit
| Bool
otherwise = Int -> Cursor -> r
forall r. Walk r => Int -> Cursor -> r
raceFailure (Int
level Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
1) Cursor
rest
longString :: Cursor -> r
longString Cursor
cursor = case Cursor -> Scanned
Lexer.next Cursor
cursor of
Scanned
Lexer.Failed -> Text -> r
forall r. Walk r => Text -> r
failWith Text
"the JSON lexer failed"
Lexer.More Cursor
_ -> Text -> r
forall r. Walk r => Text -> r
failWith Text
nestingLimit
Lexer.Token (StringContent ByteString
_) Cursor
rest -> Cursor -> r
longString Cursor
rest
Lexer.Token Element
StringEnd Cursor
rest -> Int -> Cursor -> r
forall r. Walk r => Int -> Cursor -> r
raceFailure Int
level Cursor
rest
Lexer.Token Element
_ Cursor
_ -> Text -> r
forall r. Walk r => Text -> r
failWith Text
"unexpected token in a string"
{-# INLINEABLE raceFailure #-}
readScalar :: (Build b r) => b -> Mode -> InternTable -> Element -> Cursor -> (Built b -> InternTable -> Cursor -> r) -> (Cursor -> r) -> r
readScalar :: forall b r.
Build b r =>
b
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> (Cursor -> r)
-> r
readScalar b
build Mode
mode InternTable
table Element
element Cursor
rest Built b -> InternTable -> Cursor -> r
next Cursor -> r
container = case Element
element of
JInteger CLong
number -> b -> Int -> (Built b -> r) -> r
forall b r. Build b r => b -> Int -> (Built b -> r) -> r
integer b
build (CLong -> Int
forall a b. (Integral a, Num b) => a -> b
fromIntegral CLong
number) (\Built b
value -> Built b -> InternTable -> Cursor -> r
next Built b
value InternTable
table Cursor
rest)
JValue (String Text
text) -> b
-> Mode
-> InternTable
-> (Built b -> InternTable -> Cursor -> r)
-> Name
-> Cursor
-> r
forall b r.
Build b r =>
b
-> Mode
-> InternTable
-> (Built b -> InternTable -> Cursor -> r)
-> Name
-> Cursor
-> r
string b
build Mode
mode InternTable
table Built b -> InternTable -> Cursor -> r
next (Text -> Name
decodedName Text
text) Cursor
rest
JValue Value
value -> b -> Value -> (Built b -> r) -> r
forall b r. Build b r => b -> Value -> (Built b -> r) -> r
whole b
build Value
value (\Built b
built -> Built b -> InternTable -> Cursor -> r
next Built b
built InternTable
table Cursor
rest)
Element
ObjectBegin -> Element -> Cursor -> (Cursor -> r) -> r
forall r. Walk r => Element -> Cursor -> (Cursor -> r) -> r
skipFrom Element
element Cursor
rest Cursor -> r
container
Element
ArrayBegin -> Element -> Cursor -> (Cursor -> r) -> r
forall r. Walk r => Element -> Cursor -> (Cursor -> r) -> r
skipFrom Element
element Cursor
rest Cursor -> r
container
Element
_
| Element -> Bool
isString Element
element -> Element -> Cursor -> (Name -> Cursor -> r) -> r
forall r. Walk r => Element -> Cursor -> (Name -> Cursor -> r) -> r
readString Element
element Cursor
rest (b
-> Mode
-> InternTable
-> (Built b -> InternTable -> Cursor -> r)
-> Name
-> Cursor
-> r
forall b r.
Build b r =>
b
-> Mode
-> InternTable
-> (Built b -> InternTable -> Cursor -> r)
-> Name
-> Cursor
-> r
string b
build Mode
mode InternTable
table Built b -> InternTable -> Cursor -> r
next)
| Bool
otherwise -> Text -> r
forall r. Walk r => Text -> r
failWith Text
"unexpected token where a value belongs"
{-# INLINEABLE readScalar #-}
string :: (Build b r) => b -> Mode -> InternTable -> (Built b -> InternTable -> Cursor -> r) -> Name -> Cursor -> r
string :: forall b r.
Build b r =>
b
-> Mode
-> InternTable
-> (Built b -> InternTable -> Cursor -> r)
-> Name
-> Cursor
-> r
string b
build Mode
mode InternTable
table Built b -> InternTable -> Cursor -> r
next Name
name Cursor
after = case Mode
mode of
Mode
Keep -> b -> Name -> (Built b -> r) -> r
forall b r. Build b r => b -> Name -> (Built b -> r) -> r
ownString b
build Name
name (\Built b
value -> Built b -> InternTable -> Cursor -> r
next Built b
value InternTable
table Cursor
after)
Mode
Share -> case Name -> InternTable -> Interned
internName Name
name InternTable
table of
Interned Entry
entry InternTable
held -> b -> Entry -> (Built b -> r) -> r
forall b r. Build b r => b -> Entry -> (Built b -> r) -> r
sharedString b
build Entry
entry (\Built b
value -> Built b -> InternTable -> Cursor -> r
next Built b
value InternTable
held Cursor
after)
{-# INLINE string #-}
readObject :: (Build b r) => b -> Int -> Members -> Mode -> InternTable -> Cursor -> (Built b -> InternTable -> Cursor -> r) -> r
readObject :: forall b r.
Build b r =>
b
-> Int
-> Members
-> Mode
-> InternTable
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
readObject b
build Int
open members :: Members
members@(Members HashMap ByteString Member
_ Maybe Shape
other) Mode
mode InternTable
table0 Cursor
tokens0 Built b -> InternTable -> Cursor -> r
next = b -> (Fields b -> r) -> r
forall b r. Build b r => b -> (Fields b -> r) -> r
openObject b
build (\Fields b
fields0 -> InternTable -> Fields b -> Cursor -> r
loop InternTable
table0 Fields b
fields0 Cursor
tokens0)
where
loop :: InternTable -> Fields b -> Cursor -> r
loop InternTable
table !Fields b
fields Cursor
tokens = case Cursor -> Scanned
Lexer.next Cursor
tokens of
Lexer.Token Element
ObjectEnd Cursor
rest -> b -> Fields b -> (Built b -> r) -> r
forall b r. Build b r => b -> Fields b -> (Built b -> r) -> r
closeObject b
build Fields b
fields (\Built b
built -> Built b -> InternTable -> Cursor -> r
next Built b
built InternTable
table Cursor
rest)
Lexer.Token (StringPlain PlainString
bytes) Cursor
rest -> InternTable -> Fields b -> Name -> Cursor -> r
member InternTable
table Fields b
fields (PlainString -> Name
plainName PlainString
bytes) Cursor
rest
Scanned
scanned -> Scanned -> (Element -> Cursor -> r) -> r
forall r. Walk r => Scanned -> (Element -> Cursor -> r) -> r
withScanned Scanned
scanned ((Element -> Cursor -> r) -> r) -> (Element -> Cursor -> r) -> r
forall a b. (a -> b) -> a -> b
$ \Element
element Cursor
rest -> case Element
element of
Element
ObjectEnd -> b -> Fields b -> (Built b -> r) -> r
forall b r. Build b r => b -> Fields b -> (Built b -> r) -> r
closeObject b
build Fields b
fields (\Built b
built -> Built b -> InternTable -> Cursor -> r
next Built b
built InternTable
table Cursor
rest)
Element
_ -> Element -> Cursor -> (Name -> Cursor -> r) -> (Cursor -> r) -> r
forall r.
Walk r =>
Element -> Cursor -> (Name -> Cursor -> r) -> (Cursor -> r) -> r
memberName Element
element Cursor
rest (InternTable -> Fields b -> Name -> Cursor -> r
member InternTable
table Fields b
fields) (InternTable -> Fields b -> Cursor -> r
loop InternTable
table Fields b
fields)
member :: InternTable -> Fields b -> Name -> Cursor -> r
member InternTable
table Fields b
fields Name
name Cursor
rest = case Members -> Name -> Maybe Member
findMember Members
members Name
name of
Just (Member (Key
shared, Shape
shape) Maybe PreparedName
prepared) -> InternTable
-> Fields b
-> Name
-> Maybe Key
-> Maybe PreparedName
-> Shape
-> Cursor
-> r
value InternTable
table Fields b
fields Name
name (Key -> Maybe Key
forall a. a -> Maybe a
Just Key
shared) Maybe PreparedName
prepared Shape
shape Cursor
rest
Maybe Member
Nothing -> case Maybe Shape
other of
Just Shape
shape -> InternTable
-> Fields b
-> Name
-> Maybe Key
-> Maybe PreparedName
-> Shape
-> Cursor
-> r
value InternTable
table Fields b
fields Name
name Maybe Key
forall a. Maybe a
Nothing Maybe PreparedName
forall a. Maybe a
Nothing Shape
shape Cursor
rest
Maybe Shape
Nothing -> Cursor -> (Element -> Cursor -> r) -> r
forall r. Walk r => Cursor -> (Element -> Cursor -> r) -> r
withElement Cursor
rest ((Element -> Cursor -> r) -> r) -> (Element -> Cursor -> r) -> r
forall a b. (a -> b) -> a -> b
$ \Element
element Cursor
afterKey -> Element -> Cursor -> (Cursor -> r) -> r
forall r. Walk r => Element -> Cursor -> (Cursor -> r) -> r
skipFrom Element
element Cursor
afterKey (InternTable -> Fields b -> Cursor -> r
loop InternTable
table Fields b
fields)
value :: InternTable
-> Fields b
-> Name
-> Maybe Key
-> Maybe PreparedName
-> Shape
-> Cursor
-> r
value InternTable
table Fields b
fields Name
name Maybe Key
shared Maybe PreparedName
prepared Shape
shape Cursor
rest = case Mode
mode of
Mode
Keep -> MemberKey -> Mode -> InternTable -> r
keyed (Key -> MemberKey
OwnKey (Key -> Maybe Key -> Key
forall a. a -> Maybe a -> a
fromMaybe (Text -> Key
Key.fromText (Name -> Text
nameText Name
name)) Maybe Key
shared)) Mode
Keep InternTable
table
Mode
Share -> case Interned
-> (PreparedName -> Interned) -> Maybe PreparedName -> Interned
forall b a. b -> (a -> b) -> Maybe a -> b
maybe (Name -> InternTable -> Interned
internName Name
name InternTable
table) (PreparedName -> InternTable -> Interned
`internPreparedName` InternTable
table) Maybe PreparedName
prepared of
Interned Entry
entry InternTable
held -> MemberKey -> Mode -> InternTable -> r
keyed (Entry -> MemberKey
SharedKey Entry
entry) (if Entry -> Bool
entryKeeps Entry
entry then Mode
Keep else Mode
Share) InternTable
held
where
keyed :: MemberKey -> Mode -> InternTable -> r
keyed MemberKey
key !Mode
valueMode InternTable
held = b -> MemberKey -> Fields b -> (Bool -> r) -> r
forall b r.
Build b r =>
b -> MemberKey -> Fields b -> (Bool -> r) -> r
beginMember b
build MemberKey
key Fields b
fields ((Bool -> r) -> r) -> (Bool -> r) -> r
forall a b. (a -> b) -> a -> b
$ \ !Bool
repeated ->
if Bool
repeated
then Cursor -> (Element -> Cursor -> r) -> r
forall r. Walk r => Cursor -> (Element -> Cursor -> r) -> r
withElement Cursor
rest ((Element -> Cursor -> r) -> r) -> (Element -> Cursor -> r) -> r
forall a b. (a -> b) -> a -> b
$ \Element
element Cursor
afterKey ->
b
-> Direct -> InternTable -> (Built b -> InternTable -> r) -> r -> r
forall b r.
Build b r =>
b
-> Direct -> InternTable -> (Built b -> InternTable -> r) -> r -> r
withDirect b
build (Shape -> Mode -> InternTable -> Element -> Direct
direct Shape
shape Mode
Keep InternTable
table Element
element) InternTable
table (\Built b
ignored InternTable
_ -> b -> Built b -> r -> r
forall b r. Build b r => b -> Built b -> r -> r
dropValue b
build Built b
ignored (InternTable -> Fields b -> Cursor -> r
loop InternTable
table Fields b
fields Cursor
afterKey)) (r -> r) -> r -> r
forall a b. (a -> b) -> a -> b
$
b
-> Int
-> Bool
-> Shape
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
forall b r.
Build b r =>
b
-> Int
-> Bool
-> Shape
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
readAt b
build Int
open Bool
False Shape
shape Mode
Keep InternTable
table Element
element Cursor
afterKey (\Built b
ignored InternTable
_ -> b -> Built b -> r -> r
forall b r. Build b r => b -> Built b -> r -> r
dropValue b
build Built b
ignored (r -> r) -> (Cursor -> r) -> Cursor -> r
forall b c a. (b -> c) -> (a -> b) -> a -> c
. InternTable -> Fields b -> Cursor -> r
loop InternTable
table Fields b
fields)
else Cursor -> (Element -> Cursor -> r) -> r
forall r. Walk r => Cursor -> (Element -> Cursor -> r) -> r
withElement Cursor
rest ((Element -> Cursor -> r) -> r) -> (Element -> Cursor -> r) -> r
forall a b. (a -> b) -> a -> b
$ \Element
element Cursor
afterKey ->
b
-> Direct -> InternTable -> (Built b -> InternTable -> r) -> r -> r
forall b r.
Build b r =>
b
-> Direct -> InternTable -> (Built b -> InternTable -> r) -> r -> r
withDirect b
build (Shape -> Mode -> InternTable -> Element -> Direct
direct Shape
shape Mode
valueMode InternTable
held Element
element) InternTable
held (\Built b
field InternTable
table' -> b -> MemberKey -> Built b -> Fields b -> (Fields b -> r) -> r
forall b r.
Build b r =>
b -> MemberKey -> Built b -> Fields b -> (Fields b -> r) -> r
addMember b
build MemberKey
key Built b
field Fields b
fields (\Fields b
fields' -> InternTable -> Fields b -> Cursor -> r
loop InternTable
table' Fields b
fields' Cursor
afterKey)) (r -> r) -> r -> r
forall a b. (a -> b) -> a -> b
$
b
-> Int
-> Bool
-> Shape
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
forall b r.
Build b r =>
b
-> Int
-> Bool
-> Shape
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
readAt b
build Int
open Bool
False Shape
shape Mode
valueMode InternTable
held Element
element Cursor
afterKey ((Built b -> InternTable -> Cursor -> r) -> r)
-> (Built b -> InternTable -> Cursor -> r) -> r
forall a b. (a -> b) -> a -> b
$ \Built b
field InternTable
table' Cursor
afterValue ->
b -> MemberKey -> Built b -> Fields b -> (Fields b -> r) -> r
forall b r.
Build b r =>
b -> MemberKey -> Built b -> Fields b -> (Fields b -> r) -> r
addMember b
build MemberKey
key Built b
field Fields b
fields (\Fields b
fields' -> InternTable -> Fields b -> Cursor -> r
loop InternTable
table' Fields b
fields' Cursor
afterValue)
{-# INLINE keyed #-}
{-# INLINEABLE readObject #-}
readArray :: (Build b r) => b -> Int -> Shape -> Mode -> InternTable -> Cursor -> (Built b -> InternTable -> Cursor -> r) -> r
readArray :: forall b r.
Build b r =>
b
-> Int
-> Shape
-> Mode
-> InternTable
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
readArray b
build Int
open Shape
item Mode
mode InternTable
table0 Cursor
tokens0 Built b -> InternTable -> Cursor -> r
next = b -> (Items b -> r) -> r
forall b r. Build b r => b -> (Items b -> r) -> r
openArray b
build (\Items b
items0 -> InternTable -> Int -> Items b -> Cursor -> r
loop InternTable
table0 Int
0 Items b
items0 Cursor
tokens0)
where
loop :: InternTable -> Int -> Items b -> Cursor -> r
loop InternTable
table !Int
count Items b
items Cursor
tokens = Cursor -> (Element -> Cursor -> r) -> r
forall r. Walk r => Cursor -> (Element -> Cursor -> r) -> r
withElement Cursor
tokens ((Element -> Cursor -> r) -> r) -> (Element -> Cursor -> r) -> r
forall a b. (a -> b) -> a -> b
$ \Element
element Cursor
rest -> case Element
element of
Element
ArrayEnd -> b -> Int -> Items b -> (Built b -> r) -> r
forall b r. Build b r => b -> Int -> Items b -> (Built b -> r) -> r
closeArray b
build Int
count Items b
items (\Built b
array -> Built b -> InternTable -> Cursor -> r
next Built b
array InternTable
table Cursor
rest)
Element
_ ->
b
-> Direct -> InternTable -> (Built b -> InternTable -> r) -> r -> r
forall b r.
Build b r =>
b
-> Direct -> InternTable -> (Built b -> InternTable -> r) -> r -> r
withDirect b
build (Shape -> Mode -> InternTable -> Element -> Direct
direct Shape
item Mode
mode InternTable
table Element
element) InternTable
table (\Built b
field InternTable
table' -> b -> Built b -> Items b -> (Items b -> r) -> r
forall b r.
Build b r =>
b -> Built b -> Items b -> (Items b -> r) -> r
addItem b
build Built b
field Items b
items (\Items b
items' -> InternTable -> Int -> Items b -> Cursor -> r
loop InternTable
table' (Int
count Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1) Items b
items' Cursor
rest)) (r -> r) -> r -> r
forall a b. (a -> b) -> a -> b
$
b
-> Int
-> Bool
-> Shape
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
forall b r.
Build b r =>
b
-> Int
-> Bool
-> Shape
-> Mode
-> InternTable
-> Element
-> Cursor
-> (Built b -> InternTable -> Cursor -> r)
-> r
readAt b
build Int
open Bool
False Shape
item Mode
mode InternTable
table Element
element Cursor
rest ((Built b -> InternTable -> Cursor -> r) -> r)
-> (Built b -> InternTable -> Cursor -> r) -> r
forall a b. (a -> b) -> a -> b
$ \Built b
field InternTable
table' Cursor
afterValue ->
b -> Built b -> Items b -> (Items b -> r) -> r
forall b r.
Build b r =>
b -> Built b -> Items b -> (Items b -> r) -> r
addItem b
build Built b
field Items b
items (\Items b
items' -> InternTable -> Int -> Items b -> Cursor -> r
loop InternTable
table' (Int
count Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1) Items b
items' Cursor
afterValue)
{-# INLINEABLE readArray #-}
data Direct
= DirectShared !Entry !InternTable
| DirectOwn !Name
| DirectInteger !Int
| DirectWhole !Value
| Indirect
withDirect :: (Build b r) => b -> Direct -> InternTable -> (Built b -> InternTable -> r) -> r -> r
withDirect :: forall b r.
Build b r =>
b
-> Direct -> InternTable -> (Built b -> InternTable -> r) -> r -> r
withDirect b
build Direct
scalar InternTable
table Built b -> InternTable -> r
next r
indirect = case Direct
scalar of
DirectShared Entry
entry InternTable
held -> b -> Entry -> (Built b -> r) -> r
forall b r. Build b r => b -> Entry -> (Built b -> r) -> r
sharedString b
build Entry
entry (Built b -> InternTable -> r
`next` InternTable
held)
DirectOwn Name
name -> b -> Name -> (Built b -> r) -> r
forall b r. Build b r => b -> Name -> (Built b -> r) -> r
ownString b
build Name
name (Built b -> InternTable -> r
`next` InternTable
table)
DirectInteger Int
number -> b -> Int -> (Built b -> r) -> r
forall b r. Build b r => b -> Int -> (Built b -> r) -> r
integer b
build Int
number (Built b -> InternTable -> r
`next` InternTable
table)
DirectWhole Value
value -> b -> Value -> (Built b -> r) -> r
forall b r. Build b r => b -> Value -> (Built b -> r) -> r
whole b
build Value
value (Built b -> InternTable -> r
`next` InternTable
table)
Direct
Indirect -> r
indirect
{-# INLINE withDirect #-}
direct :: Shape -> Mode -> InternTable -> Element -> Direct
direct :: Shape -> Mode -> InternTable -> Element -> Direct
direct Shape
shape Mode
mode InternTable
table Element
element
| Bool
takesToken = Mode -> InternTable -> Element -> Direct
scalarToken Mode
mode InternTable
table Element
element
| Bool
otherwise = Shape -> Mode -> InternTable -> Element -> Direct
directThrough Shape
shape Mode
mode InternTable
table Element
element
where
takesToken :: Bool
takesToken = case Shape
shape of
Scalar Int
budget -> Int
budget Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
0
Generic Int
budget -> Int
budget Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
0
StringOr Int
budget Shape
_ -> Int
budget Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
0 Bool -> Bool -> Bool
&& Bool
completeString
Shape
_ -> Bool
False
completeString :: Bool
completeString = case Element
element of
StringPlain{} -> Bool
True
StringEncoded{} -> Bool
True
JValue (String Text
_) -> Bool
True
Element
_ -> Bool
False
{-# INLINE direct #-}
directThrough :: Shape -> Mode -> InternTable -> Element -> Direct
directThrough :: Shape -> Mode -> InternTable -> Element -> Direct
directThrough Shape
shape Mode
mode InternTable
table Element
element = case Shape
shape of
Scalar Int
budget | Int
budget Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
0 -> Mode -> InternTable -> Element -> Direct
scalarToken Mode
mode InternTable
table Element
element
Generic Int
budget | Int
budget Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
0 -> Mode -> InternTable -> Element -> Direct
scalarToken Mode
mode InternTable
table Element
element
ObjectWith Int
budget Members
_ Shape
fallback | Int
budget Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
0 -> Shape -> Mode -> InternTable -> Element -> Direct
directThrough Shape
fallback Mode
mode InternTable
table Element
element
ArrayWith Int
budget Shape
_ Shape
fallback | Int
budget Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
0 -> Shape -> Mode -> InternTable -> Element -> Direct
directThrough Shape
fallback Mode
mode InternTable
table Element
element
StringOr Int
budget Shape
other
| Int
budget Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
0 -> case Element
element of
StringPlain{} -> Mode -> InternTable -> Element -> Direct
scalarToken Mode
mode InternTable
table Element
element
StringEncoded{} -> Mode -> InternTable -> Element -> Direct
scalarToken Mode
mode InternTable
table Element
element
JValue (String Text
_) -> Mode -> InternTable -> Element -> Direct
scalarToken Mode
mode InternTable
table Element
element
Element
_ -> Shape -> Mode -> InternTable -> Element -> Direct
directThrough Shape
other Mode
mode InternTable
table Element
element
ObjectOr Value
fallback Members
_ -> case Element
element of
StringPlain{} -> Value -> Direct
DirectWhole Value
fallback
StringEncoded{} -> Value -> Direct
DirectWhole Value
fallback
JValue Value
_ -> Value -> Direct
DirectWhole Value
fallback
JInteger CLong
_ -> Value -> Direct
DirectWhole Value
fallback
Element
_ -> Direct
Indirect
Checked Int
budget Shape
inner | Int
budget Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
0 -> Shape -> Mode -> InternTable -> Element -> Direct
directThrough Shape
inner Mode
mode InternTable
table Element
element
Shape
_ -> Direct
Indirect
scalarToken :: Mode -> InternTable -> Element -> Direct
scalarToken :: Mode -> InternTable -> Element -> Direct
scalarToken Mode
mode InternTable
table = \case
StringPlain PlainString
bytes -> case Mode
mode of
Mode
Keep -> Name -> Direct
DirectOwn (PlainString -> Name
plainName PlainString
bytes)
Mode
Share -> Interned -> Direct
shared (PlainString -> InternTable -> Interned
internPlain PlainString
bytes InternTable
table)
StringEncoded ByteString
bytes -> (UnicodeException -> Direct)
-> (Text -> Direct) -> Either UnicodeException Text -> Direct
forall a c b. (a -> c) -> (b -> c) -> Either a b -> c
either (Direct -> UnicodeException -> Direct
forall a b. a -> b -> a
const Direct
Indirect) Text -> Direct
decoded (ByteString -> Either UnicodeException Text
decodeString ByteString
bytes)
JValue (String Text
text) -> Text -> Direct
decoded Text
text
JValue Value
scalar -> Value -> Direct
DirectWhole Value
scalar
JInteger CLong
number -> Int -> Direct
DirectInteger (CLong -> Int
forall a b. (Integral a, Num b) => a -> b
fromIntegral CLong
number)
Element
_ -> Direct
Indirect
where
decoded :: Text -> Direct
decoded Text
text = case Mode
mode of
Mode
Keep -> Name -> Direct
DirectOwn (Text -> Name
decodedName Text
text)
Mode
Share -> Interned -> Direct
shared (Text -> InternTable -> Interned
internDecoded Text
text InternTable
table)
shared :: Interned -> Direct
shared (Interned Entry
entry InternTable
held) = Entry -> InternTable -> Direct
DirectShared Entry
entry InternTable
held
{-# INLINE scalarToken #-}
internPlain :: PlainString -> InternTable -> Interned
internPlain :: PlainString -> InternTable -> Interned
internPlain PlainString
bytes = Name -> InternTable -> Interned
internName (PlainString -> Name
plainName PlainString
bytes)
{-# NOINLINE internPlain #-}
internDecoded :: Text -> InternTable -> Interned
internDecoded :: Text -> InternTable -> Interned
internDecoded Text
text = Name -> InternTable -> Interned
internName (Text -> Name
decodedName Text
text)
{-# NOINLINE internDecoded #-}
emptyArray :: Value
emptyArray :: Value
emptyArray = Array -> Value
Array Array
forall a. Monoid a => a
mempty