| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Data.Aeson.Decoding.Tokens
Contents
Description
Token definitions.
Synopsis
- data Tokens k e
- data Lit
- data Number
- data TkArray k e
- = TkItem (Tokens (TkArray k e) e)
- | TkArrayEnd k
- | TkArrayErr e
- data TkRecord k e
- = TkPair !Key (Tokens (TkRecord k e) e)
- | TkRecordEnd k
- | TkRecordErr e
Types
A well-formed JSON token stream.
Note: Lit exists to make Tokens have only 6 constructors.
This may or may not have impact on performance.
Since: 2.1.2.0
Instances
Instances details
Instance details
Defined in Data.Aeson.Decoding.Tokens
Instance details
Defined in Data.Aeson.Decoding.Tokens
Methods
bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Tokens a b -> f (Tokens c d) #
Instance details
Defined in Data.Aeson.Decoding.Tokens
Methods
fold :: Monoid m => Tokens k m -> m #
foldMap :: Monoid m => (a -> m) -> Tokens k a -> m #
foldMap' :: Monoid m => (a -> m) -> Tokens k a -> m #
foldr :: (a -> b -> b) -> b -> Tokens k a -> b #
foldr' :: (a -> b -> b) -> b -> Tokens k a -> b #
foldl :: (b -> a -> b) -> b -> Tokens k a -> b #
foldl' :: (b -> a -> b) -> b -> Tokens k a -> b #
foldr1 :: (a -> a -> a) -> Tokens k a -> a #
foldl1 :: (a -> a -> a) -> Tokens k a -> a #
elem :: Eq a => a -> Tokens k a -> Bool #
maximum :: Ord a => Tokens k a -> a #
minimum :: Ord a => Tokens k a -> a #
Instance details
Defined in Data.Aeson.Decoding.Tokens
Literals. null, true, false.
Instances
Instances details
Numbers
We preserve whether the number was integral, decimal or in scientific form.
Constructors
Instances
Instances details
Array tokens.
Instances
Instances details
Instance details
Defined in Data.Aeson.Decoding.Tokens
Instance details
Defined in Data.Aeson.Decoding.Tokens
Methods
bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> TkArray a b -> f (TkArray c d) #
Instance details
Defined in Data.Aeson.Decoding.Tokens
Methods
fold :: Monoid m => TkArray k m -> m #
foldMap :: Monoid m => (a -> m) -> TkArray k a -> m #
foldMap' :: Monoid m => (a -> m) -> TkArray k a -> m #
foldr :: (a -> b -> b) -> b -> TkArray k a -> b #
foldr' :: (a -> b -> b) -> b -> TkArray k a -> b #
foldl :: (b -> a -> b) -> b -> TkArray k a -> b #
foldl' :: (b -> a -> b) -> b -> TkArray k a -> b #
foldr1 :: (a -> a -> a) -> TkArray k a -> a #
foldl1 :: (a -> a -> a) -> TkArray k a -> a #
toList :: TkArray k a -> [a] #
length :: TkArray k a -> Int #
elem :: Eq a => a -> TkArray k a -> Bool #
maximum :: Ord a => TkArray k a -> a #
minimum :: Ord a => TkArray k a -> a #
Instance details
Defined in Data.Aeson.Decoding.Tokens
Record tokens.
Instances
Instances details
Instance details
Defined in Data.Aeson.Decoding.Tokens
Instance details
Defined in Data.Aeson.Decoding.Tokens
Methods
bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> TkRecord a b -> f (TkRecord c d) #
Instance details
Defined in Data.Aeson.Decoding.Tokens
Methods
fold :: Monoid m => TkRecord k m -> m #
foldMap :: Monoid m => (a -> m) -> TkRecord k a -> m #
foldMap' :: Monoid m => (a -> m) -> TkRecord k a -> m #
foldr :: (a -> b -> b) -> b -> TkRecord k a -> b #
foldr' :: (a -> b -> b) -> b -> TkRecord k a -> b #
foldl :: (b -> a -> b) -> b -> TkRecord k a -> b #
foldl' :: (b -> a -> b) -> b -> TkRecord k a -> b #
foldr1 :: (a -> a -> a) -> TkRecord k a -> a #
foldl1 :: (a -> a -> a) -> TkRecord k a -> a #
toList :: TkRecord k a -> [a] #
null :: TkRecord k a -> Bool #
length :: TkRecord k a -> Int #
elem :: Eq a => a -> TkRecord k a -> Bool #
maximum :: Ord a => TkRecord k a -> a #
minimum :: Ord a => TkRecord k a -> a #
Instance details
Defined in Data.Aeson.Decoding.Tokens