Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- data StringContent a = StringContent {}
- data Null a = Null {}
- data False a = False {}
- data True a = True {}
- data Number a = Number {}
- data EscapeSequence a = EscapeSequence {}
- type AnonymousDQuote = Token "\"" 7
- type AnonymousRBracket = Token "]" 6
- type AnonymousLBracket = Token "[" 5
- type AnonymousColon = Token ":" 4
- type AnonymousRBrace = Token "}" 3
- type AnonymousComma = Token "," 2
- type AnonymousLBrace = Token "{" 1
- data String a = String {
- ann :: a
- extraChildren :: (Maybe (StringContent a))
- data Pair a = Pair {}
- data Object a = Object {
- ann :: a
- extraChildren :: ([] (Pair a))
- data Document a = Document {
- ann :: a
- extraChildren :: (Value a)
- data Array a = Array {
- ann :: a
- extraChildren :: ([] (Value a))
- newtype Value a = Value ((:+:) ((:+:) Array ((:+:) False Null)) ((:+:) ((:+:) Number Object) ((:+:) String True)) a)
- data ((f :: k -> Type) :+: (g :: k -> Type)) (p :: k) :: forall k. (k -> Type) -> (k -> Type) -> k -> Type
Documentation
data StringContent a Source #
The content of a string literal.
This is defined rather than being derived from the grammar to represent it as just the textual content, without explicit representation of escape sequences.
Instances
Instances
Functor Null Source # | |
Foldable Null Source # | |
Defined in TreeSitter.JSON.AST fold :: Monoid m => Null m -> m # foldMap :: Monoid m => (a -> m) -> Null a -> m # foldr :: (a -> b -> b) -> b -> Null a -> b # foldr' :: (a -> b -> b) -> b -> Null a -> b # foldl :: (b -> a -> b) -> b -> Null a -> b # foldl' :: (b -> a -> b) -> b -> Null a -> b # foldr1 :: (a -> a -> a) -> Null a -> a # foldl1 :: (a -> a -> a) -> Null a -> a # elem :: Eq a => a -> Null a -> Bool # maximum :: Ord a => Null a -> a # | |
Traversable Null Source # | |
SymbolMatching Null Source # | |
Defined in TreeSitter.JSON.AST symbolMatch :: Proxy Null -> Node -> Bool showFailure :: Proxy Null -> Node -> String | |
Unmarshal Null Source # | |
Defined in TreeSitter.JSON.AST unmarshalNode :: (Carrier sig m, Member (Reader ByteString) sig, Member (Reader (Ptr Cursor)) sig, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (Null a) | |
Eq a => Eq (Null a) Source # | |
Ord a => Ord (Null a) Source # | |
Show a => Show (Null a) Source # | |
Generic (Null a) Source # | |
Generic1 Null Source # | |
type Rep (Null a) Source # | |
Defined in TreeSitter.JSON.AST type Rep (Null a) = D1 (MetaData "Null" "TreeSitter.JSON.AST" "tree-sitter-json-0.3.0.0-inplace" False) (C1 (MetaCons "Null" PrefixI True) (S1 (MetaSel (Just "ann") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a) :*: S1 (MetaSel (Just "text") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Text))) | |
type Rep1 Null Source # | |
Defined in TreeSitter.JSON.AST type Rep1 Null = D1 (MetaData "Null" "TreeSitter.JSON.AST" "tree-sitter-json-0.3.0.0-inplace" False) (C1 (MetaCons "Null" PrefixI True) (S1 (MetaSel (Just "ann") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1 :*: S1 (MetaSel (Just "text") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Text))) |
Instances
Instances
Functor True Source # | |
Foldable True Source # | |
Defined in TreeSitter.JSON.AST fold :: Monoid m => True m -> m # foldMap :: Monoid m => (a -> m) -> True a -> m # foldr :: (a -> b -> b) -> b -> True a -> b # foldr' :: (a -> b -> b) -> b -> True a -> b # foldl :: (b -> a -> b) -> b -> True a -> b # foldl' :: (b -> a -> b) -> b -> True a -> b # foldr1 :: (a -> a -> a) -> True a -> a # foldl1 :: (a -> a -> a) -> True a -> a # elem :: Eq a => a -> True a -> Bool # maximum :: Ord a => True a -> a # | |
Traversable True Source # | |
SymbolMatching True Source # | |
Defined in TreeSitter.JSON.AST symbolMatch :: Proxy True -> Node -> Bool showFailure :: Proxy True -> Node -> String | |
Unmarshal True Source # | |
Defined in TreeSitter.JSON.AST unmarshalNode :: (Carrier sig m, Member (Reader ByteString) sig, Member (Reader (Ptr Cursor)) sig, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (True a) | |
Eq a => Eq (True a) Source # | |
Ord a => Ord (True a) Source # | |
Show a => Show (True a) Source # | |
Generic (True a) Source # | |
Generic1 True Source # | |
type Rep (True a) Source # | |
Defined in TreeSitter.JSON.AST type Rep (True a) = D1 (MetaData "True" "TreeSitter.JSON.AST" "tree-sitter-json-0.3.0.0-inplace" False) (C1 (MetaCons "True" PrefixI True) (S1 (MetaSel (Just "ann") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a) :*: S1 (MetaSel (Just "text") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Text))) | |
type Rep1 True Source # | |
Defined in TreeSitter.JSON.AST type Rep1 True = D1 (MetaData "True" "TreeSitter.JSON.AST" "tree-sitter-json-0.3.0.0-inplace" False) (C1 (MetaCons "True" PrefixI True) (S1 (MetaSel (Just "ann") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1 :*: S1 (MetaSel (Just "text") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Text))) |
Instances
data EscapeSequence a Source #
Instances
type AnonymousDQuote = Token "\"" 7 Source #
type AnonymousRBracket = Token "]" 6 Source #
type AnonymousLBracket = Token "[" 5 Source #
type AnonymousColon = Token ":" 4 Source #
type AnonymousRBrace = Token "}" 3 Source #
type AnonymousComma = Token "," 2 Source #
type AnonymousLBrace = Token "{" 1 Source #
String | |
|
Instances
Instances
Object | |
|
Instances
Document | |
|
Instances
Array | |
|
Instances
Functor Array Source # | |
Foldable Array Source # | |
Defined in TreeSitter.JSON.AST fold :: Monoid m => Array m -> m # foldMap :: Monoid m => (a -> m) -> Array a -> m # foldr :: (a -> b -> b) -> b -> Array a -> b # foldr' :: (a -> b -> b) -> b -> Array a -> b # foldl :: (b -> a -> b) -> b -> Array a -> b # foldl' :: (b -> a -> b) -> b -> Array a -> b # foldr1 :: (a -> a -> a) -> Array a -> a # foldl1 :: (a -> a -> a) -> Array a -> a # elem :: Eq a => a -> Array a -> Bool # maximum :: Ord a => Array a -> a # minimum :: Ord a => Array a -> a # | |
Traversable Array Source # | |
SymbolMatching Array Source # | |
Defined in TreeSitter.JSON.AST symbolMatch :: Proxy Array -> Node -> Bool showFailure :: Proxy Array -> Node -> String | |
Unmarshal Array Source # | |
Defined in TreeSitter.JSON.AST unmarshalNode :: (Carrier sig m, Member (Reader ByteString) sig, Member (Reader (Ptr Cursor)) sig, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (Array a) | |
Eq a => Eq (Array a) Source # | |
Ord a => Ord (Array a) Source # | |
Show a => Show (Array a) Source # | |
Generic (Array a) Source # | |
Generic1 Array Source # | |
type Rep (Array a) Source # | |
Defined in TreeSitter.JSON.AST type Rep (Array a) = D1 (MetaData "Array" "TreeSitter.JSON.AST" "tree-sitter-json-0.3.0.0-inplace" False) (C1 (MetaCons "Array" PrefixI True) (S1 (MetaSel (Just "ann") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a) :*: S1 (MetaSel (Just "extraChildren") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [Value a]))) | |
type Rep1 Array Source # | |
Defined in TreeSitter.JSON.AST type Rep1 Array = D1 (MetaData "Array" "TreeSitter.JSON.AST" "tree-sitter-json-0.3.0.0-inplace" False) (C1 (MetaCons "Array" PrefixI True) (S1 (MetaSel (Just "ann") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1 :*: S1 (MetaSel (Just "extraChildren") NoSourceUnpackedness NoSourceStrictness DecidedLazy) ([] :.: Rec1 Value))) |
Instances
Functor Value Source # | |
Foldable Value Source # | |
Defined in TreeSitter.JSON.AST fold :: Monoid m => Value m -> m # foldMap :: Monoid m => (a -> m) -> Value a -> m # foldr :: (a -> b -> b) -> b -> Value a -> b # foldr' :: (a -> b -> b) -> b -> Value a -> b # foldl :: (b -> a -> b) -> b -> Value a -> b # foldl' :: (b -> a -> b) -> b -> Value a -> b # foldr1 :: (a -> a -> a) -> Value a -> a # foldl1 :: (a -> a -> a) -> Value a -> a # elem :: Eq a => a -> Value a -> Bool # maximum :: Ord a => Value a -> a # minimum :: Ord a => Value a -> a # | |
Traversable Value Source # | |
SymbolMatching Value Source # | |
Defined in TreeSitter.JSON.AST symbolMatch :: Proxy Value -> Node -> Bool showFailure :: Proxy Value -> Node -> String | |
Unmarshal Value Source # | |
Defined in TreeSitter.JSON.AST unmarshalNode :: (Carrier sig m, Member (Reader ByteString) sig, Member (Reader (Ptr Cursor)) sig, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (Value a) | |
Eq a => Eq (Value a) Source # | |
Ord a => Ord (Value a) Source # | |
Show a => Show (Value a) Source # | |
Generic (Value a) Source # | |
Generic1 Value Source # | |
type Rep (Value a) Source # | |
Defined in TreeSitter.JSON.AST type Rep (Value a) = D1 (MetaData "Value" "TreeSitter.JSON.AST" "tree-sitter-json-0.3.0.0-inplace" True) (C1 (MetaCons "Value" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (((Array :+: (False :+: Null)) :+: ((Number :+: Object) :+: (String :+: True))) a)))) | |
type Rep1 Value Source # | |
Defined in TreeSitter.JSON.AST type Rep1 Value = D1 (MetaData "Value" "TreeSitter.JSON.AST" "tree-sitter-json-0.3.0.0-inplace" True) (C1 (MetaCons "Value" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 ((Array :+: (False :+: Null)) :+: ((Number :+: Object) :+: (String :+: True)))))) |
data ((f :: k -> Type) :+: (g :: k -> Type)) (p :: k) :: forall k. (k -> Type) -> (k -> Type) -> k -> Type infixr 5 #
Sums: encode choice between constructors
Instances
(GEffect m m' l l', GEffect m m' r r') => GEffect m m' (l :+: r) (l' :+: r') | |
(GHFunctor m m' l l', GHFunctor m m' r r') => GHFunctor m m' (l :+: r) (l' :+: r') | |
Defined in Control.Effect.Carrier | |
Generic1 (f :+: g :: k -> Type) | |
(GSum arity a, GSum arity b) => GSum arity (a :+: b) | |
(Functor f, Functor g) => Functor (f :+: g) | Since: base-4.9.0.0 |
(Foldable f, Foldable g) => Foldable (f :+: g) | Since: base-4.9.0.0 |
Defined in Data.Foldable fold :: Monoid m => (f :+: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :+: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :+: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :+: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :+: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :+: g) a -> b # foldr1 :: (a -> a -> a) -> (f :+: g) a -> a # foldl1 :: (a -> a -> a) -> (f :+: g) a -> a # toList :: (f :+: g) a -> [a] # length :: (f :+: g) a -> Int # elem :: Eq a => a -> (f :+: g) a -> Bool # maximum :: Ord a => (f :+: g) a -> a # minimum :: Ord a => (f :+: g) a -> a # | |
(Traversable f, Traversable g) => Traversable (f :+: g) | Since: base-4.9.0.0 |
(SymbolMatching f, SymbolMatching g) => SymbolMatching (f :+: g) | |
Defined in TreeSitter.Unmarshal symbolMatch :: Proxy (f :+: g) -> Node -> Bool showFailure :: Proxy (f :+: g) -> Node -> String | |
(Unmarshal f, Unmarshal g, SymbolMatching f, SymbolMatching g) => Unmarshal (f :+: g) | |
Defined in TreeSitter.Unmarshal unmarshalNode :: (Carrier sig m, Member (Reader ByteString) sig, Member (Reader (Ptr Cursor)) sig, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m ((f :+: g) a) | |
(GUnmarshal f, GUnmarshal g, SymbolMatching f, SymbolMatching g) => GUnmarshal (f :+: g) | |
Defined in TreeSitter.Unmarshal gunmarshalNode :: (Carrier sig m, Member (Reader ByteString) sig, Member (Reader (Ptr Cursor)) sig, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m ((f :+: g) a) | |
(SumSize a, SumSize b) => SumSize (a :+: b) | |
Defined in Data.Hashable.Generic.Instances | |
(GSumGet a, GSumGet b) => GSumGet (a :+: b) | |
(SumSize a, SumSize b) => SumSize (a :+: b) | |
Defined in Data.Binary.Generic | |
(GSumPut a, GSumPut b) => GSumPut (a :+: b) | |
(Eq (f p), Eq (g p)) => Eq ((f :+: g) p) | Since: base-4.7.0.0 |
(Ord (f p), Ord (g p)) => Ord ((f :+: g) p) | Since: base-4.7.0.0 |
(Read (f p), Read (g p)) => Read ((f :+: g) p) | Since: base-4.7.0.0 |
(Show (f p), Show (g p)) => Show ((f :+: g) p) | Since: base-4.7.0.0 |
Generic ((f :+: g) p) | |
type Rep1 (f :+: g :: k -> Type) | Since: base-4.9.0.0 |
Defined in GHC.Generics type Rep1 (f :+: g :: k -> Type) = D1 (MetaData ":+:" "GHC.Generics" "base" False) (C1 (MetaCons "L1" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 f)) :+: C1 (MetaCons "R1" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 g))) | |
type Rep ((f :+: g) p) | Since: base-4.7.0.0 |
Defined in GHC.Generics type Rep ((f :+: g) p) = D1 (MetaData ":+:" "GHC.Generics" "base" False) (C1 (MetaCons "L1" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (f p))) :+: C1 (MetaCons "R1" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (g p)))) |