Safe Haskell	None
Language	Haskell2010

TreeSitter.Go.AST

Documentation

debugSymbolNames :: [String] Source #

type AnonymousRBrace = Token "}" 22 Source #

type AnonymousPipePipe = Token "||" 77 Source #

type AnonymousPipeEqual = Token "|=" 39 Source #

type AnonymousPipe = Token "|" 69 Source #

type AnonymousLBrace = Token "{" 21 Source #

type AnonymousVar = Token "var" 13 Source #

data TypeIdentifier a Source #

Constructors

TypeIdentifier
Fields ann :: a text :: Text

Instances

Instances details

Functor TypeIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> TypeIdentifier a -> TypeIdentifier b # (<$) :: a -> TypeIdentifier b -> TypeIdentifier a #
Foldable TypeIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => TypeIdentifier m -> m # foldMap :: Monoid m => (a -> m) -> TypeIdentifier a -> m # foldMap' :: Monoid m => (a -> m) -> TypeIdentifier a -> m # foldr :: (a -> b -> b) -> b -> TypeIdentifier a -> b # foldr' :: (a -> b -> b) -> b -> TypeIdentifier a -> b # foldl :: (b -> a -> b) -> b -> TypeIdentifier a -> b # foldl' :: (b -> a -> b) -> b -> TypeIdentifier a -> b # foldr1 :: (a -> a -> a) -> TypeIdentifier a -> a # foldl1 :: (a -> a -> a) -> TypeIdentifier a -> a # toList :: TypeIdentifier a -> [a] # null :: TypeIdentifier a -> Bool # length :: TypeIdentifier a -> Int # elem :: Eq a => a -> TypeIdentifier a -> Bool # maximum :: Ord a => TypeIdentifier a -> a # minimum :: Ord a => TypeIdentifier a -> a # sum :: Num a => TypeIdentifier a -> a # product :: Num a => TypeIdentifier a -> a #
Traversable TypeIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> TypeIdentifier a -> f (TypeIdentifier b) # sequenceA :: Applicative f => TypeIdentifier (f a) -> f (TypeIdentifier a) # mapM :: Monad m => (a -> m b) -> TypeIdentifier a -> m (TypeIdentifier b) # sequence :: Monad m => TypeIdentifier (m a) -> m (TypeIdentifier a) #
SymbolMatching TypeIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy TypeIdentifier -> Node -> Bool showFailure :: Proxy TypeIdentifier -> Node -> String
Unmarshal TypeIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (TypeIdentifier a)
Eq a => Eq (TypeIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: TypeIdentifier a -> TypeIdentifier a -> Bool # (/=) :: TypeIdentifier a -> TypeIdentifier a -> Bool #
Ord a => Ord (TypeIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: TypeIdentifier a -> TypeIdentifier a -> Ordering # (<) :: TypeIdentifier a -> TypeIdentifier a -> Bool # (<=) :: TypeIdentifier a -> TypeIdentifier a -> Bool # (>) :: TypeIdentifier a -> TypeIdentifier a -> Bool # (>=) :: TypeIdentifier a -> TypeIdentifier a -> Bool # max :: TypeIdentifier a -> TypeIdentifier a -> TypeIdentifier a # min :: TypeIdentifier a -> TypeIdentifier a -> TypeIdentifier a #
Show a => Show (TypeIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> TypeIdentifier a -> ShowS # show :: TypeIdentifier a -> String # showList :: [TypeIdentifier a] -> ShowS #
Generic (TypeIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (TypeIdentifier a) :: Type -> Type # Methods from :: TypeIdentifier a -> Rep (TypeIdentifier a) x # to :: Rep (TypeIdentifier a) x -> TypeIdentifier a #
Generic1 TypeIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 TypeIdentifier :: k -> Type # Methods from1 :: forall (a :: k). TypeIdentifier a -> Rep1 TypeIdentifier a # to1 :: forall (a :: k). Rep1 TypeIdentifier a -> TypeIdentifier a #
type Rep (TypeIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (TypeIdentifier a) = D1 ('MetaData "TypeIdentifier" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "TypeIdentifier" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Rep1 TypeIdentifier Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 TypeIdentifier = D1 ('MetaData "TypeIdentifier" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "TypeIdentifier" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

type AnonymousType = Token "type" 16 Source #

data True a Source #

Constructors

True
Fields ann :: a text :: Text

Instances

Instances details

Functor True Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> True a -> True b # (<$) :: a -> True b -> True a #
Foldable True Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => True m -> m # foldMap :: Monoid m => (a -> m) -> True a -> 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 # toList :: True a -> [a] # null :: True a -> Bool # length :: True a -> Int # elem :: Eq a => a -> True a -> Bool # maximum :: Ord a => True a -> a # minimum :: Ord a => True a -> a # sum :: Num a => True a -> a # product :: Num a => True a -> a #
Traversable True Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> True a -> f (True b) # sequenceA :: Applicative f => True (f a) -> f (True a) # mapM :: Monad m => (a -> m b) -> True a -> m (True b) # sequence :: Monad m => True (m a) -> m (True a) #
SymbolMatching True Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy True -> Node -> Bool showFailure :: Proxy True -> Node -> String
Unmarshal True Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (True a)
Eq a => Eq (True a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: True a -> True a -> Bool # (/=) :: True a -> True a -> Bool #
Ord a => Ord (True a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: True a -> True a -> Ordering # (<) :: True a -> True a -> Bool # (<=) :: True a -> True a -> Bool # (>) :: True a -> True a -> Bool # (>=) :: True a -> True a -> Bool # max :: True a -> True a -> True a # min :: True a -> True a -> True a #
Show a => Show (True a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> True a -> ShowS # show :: True a -> String # showList :: [True a] -> ShowS #
Generic (True a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (True a) :: Type -> Type # Methods from :: True a -> Rep (True a) x # to :: Rep (True a) x -> True a #
Generic1 True Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 True :: k -> Type # Methods from1 :: forall (a :: k). True a -> Rep1 True a # to1 :: forall (a :: k). Rep1 True a -> True a #
type Rep (True a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (True a) = D1 ('MetaData "True" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.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 #
Instance details Defined in TreeSitter.Go.AST type Rep1 True = D1 ('MetaData "True" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.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)))

type AnonymousSwitch = Token "switch" 53 Source #

type AnonymousStruct = Token "struct" 20 Source #

type AnonymousSelect = Token "select" 56 Source #

data RuneLiteral a Source #

Constructors

RuneLiteral
Fields ann :: a text :: Text

Instances

Instances details

Functor RuneLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> RuneLiteral a -> RuneLiteral b # (<$) :: a -> RuneLiteral b -> RuneLiteral a #
Foldable RuneLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => RuneLiteral m -> m # foldMap :: Monoid m => (a -> m) -> RuneLiteral a -> m # foldMap' :: Monoid m => (a -> m) -> RuneLiteral a -> m # foldr :: (a -> b -> b) -> b -> RuneLiteral a -> b # foldr' :: (a -> b -> b) -> b -> RuneLiteral a -> b # foldl :: (b -> a -> b) -> b -> RuneLiteral a -> b # foldl' :: (b -> a -> b) -> b -> RuneLiteral a -> b # foldr1 :: (a -> a -> a) -> RuneLiteral a -> a # foldl1 :: (a -> a -> a) -> RuneLiteral a -> a # toList :: RuneLiteral a -> [a] # null :: RuneLiteral a -> Bool # length :: RuneLiteral a -> Int # elem :: Eq a => a -> RuneLiteral a -> Bool # maximum :: Ord a => RuneLiteral a -> a # minimum :: Ord a => RuneLiteral a -> a # sum :: Num a => RuneLiteral a -> a # product :: Num a => RuneLiteral a -> a #
Traversable RuneLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> RuneLiteral a -> f (RuneLiteral b) # sequenceA :: Applicative f => RuneLiteral (f a) -> f (RuneLiteral a) # mapM :: Monad m => (a -> m b) -> RuneLiteral a -> m (RuneLiteral b) # sequence :: Monad m => RuneLiteral (m a) -> m (RuneLiteral a) #
SymbolMatching RuneLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy RuneLiteral -> Node -> Bool showFailure :: Proxy RuneLiteral -> Node -> String
Unmarshal RuneLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (RuneLiteral a)
Eq a => Eq (RuneLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: RuneLiteral a -> RuneLiteral a -> Bool # (/=) :: RuneLiteral a -> RuneLiteral a -> Bool #
Ord a => Ord (RuneLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: RuneLiteral a -> RuneLiteral a -> Ordering # (<) :: RuneLiteral a -> RuneLiteral a -> Bool # (<=) :: RuneLiteral a -> RuneLiteral a -> Bool # (>) :: RuneLiteral a -> RuneLiteral a -> Bool # (>=) :: RuneLiteral a -> RuneLiteral a -> Bool # max :: RuneLiteral a -> RuneLiteral a -> RuneLiteral a # min :: RuneLiteral a -> RuneLiteral a -> RuneLiteral a #
Show a => Show (RuneLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> RuneLiteral a -> ShowS # show :: RuneLiteral a -> String # showList :: [RuneLiteral a] -> ShowS #
Generic (RuneLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (RuneLiteral a) :: Type -> Type # Methods from :: RuneLiteral a -> Rep (RuneLiteral a) x # to :: Rep (RuneLiteral a) x -> RuneLiteral a #
Generic1 RuneLiteral Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 RuneLiteral :: k -> Type # Methods from1 :: forall (a :: k). RuneLiteral a -> Rep1 RuneLiteral a # to1 :: forall (a :: k). Rep1 RuneLiteral a -> RuneLiteral a #
type Rep (RuneLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (RuneLiteral a) = D1 ('MetaData "RuneLiteral" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "RuneLiteral" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Rep1 RuneLiteral Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 RuneLiteral = D1 ('MetaData "RuneLiteral" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "RuneLiteral" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

type AnonymousReturn = Token "return" 46 Source #

data RawStringLiteral a Source #

Constructors

RawStringLiteral
Fields ann :: a text :: Text

Instances

Instances details

Functor RawStringLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> RawStringLiteral a -> RawStringLiteral b # (<$) :: a -> RawStringLiteral b -> RawStringLiteral a #
Foldable RawStringLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => RawStringLiteral m -> m # foldMap :: Monoid m => (a -> m) -> RawStringLiteral a -> m # foldMap' :: Monoid m => (a -> m) -> RawStringLiteral a -> m # foldr :: (a -> b -> b) -> b -> RawStringLiteral a -> b # foldr' :: (a -> b -> b) -> b -> RawStringLiteral a -> b # foldl :: (b -> a -> b) -> b -> RawStringLiteral a -> b # foldl' :: (b -> a -> b) -> b -> RawStringLiteral a -> b # foldr1 :: (a -> a -> a) -> RawStringLiteral a -> a # foldl1 :: (a -> a -> a) -> RawStringLiteral a -> a # toList :: RawStringLiteral a -> [a] # null :: RawStringLiteral a -> Bool # length :: RawStringLiteral a -> Int # elem :: Eq a => a -> RawStringLiteral a -> Bool # maximum :: Ord a => RawStringLiteral a -> a # minimum :: Ord a => RawStringLiteral a -> a # sum :: Num a => RawStringLiteral a -> a # product :: Num a => RawStringLiteral a -> a #
Traversable RawStringLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> RawStringLiteral a -> f (RawStringLiteral b) # sequenceA :: Applicative f => RawStringLiteral (f a) -> f (RawStringLiteral a) # mapM :: Monad m => (a -> m b) -> RawStringLiteral a -> m (RawStringLiteral b) # sequence :: Monad m => RawStringLiteral (m a) -> m (RawStringLiteral a) #
SymbolMatching RawStringLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy RawStringLiteral -> Node -> Bool showFailure :: Proxy RawStringLiteral -> Node -> String
Unmarshal RawStringLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (RawStringLiteral a)
Eq a => Eq (RawStringLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: RawStringLiteral a -> RawStringLiteral a -> Bool # (/=) :: RawStringLiteral a -> RawStringLiteral a -> Bool #
Ord a => Ord (RawStringLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: RawStringLiteral a -> RawStringLiteral a -> Ordering # (<) :: RawStringLiteral a -> RawStringLiteral a -> Bool # (<=) :: RawStringLiteral a -> RawStringLiteral a -> Bool # (>) :: RawStringLiteral a -> RawStringLiteral a -> Bool # (>=) :: RawStringLiteral a -> RawStringLiteral a -> Bool # max :: RawStringLiteral a -> RawStringLiteral a -> RawStringLiteral a # min :: RawStringLiteral a -> RawStringLiteral a -> RawStringLiteral a #
Show a => Show (RawStringLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> RawStringLiteral a -> ShowS # show :: RawStringLiteral a -> String # showList :: [RawStringLiteral a] -> ShowS #
Generic (RawStringLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (RawStringLiteral a) :: Type -> Type # Methods from :: RawStringLiteral a -> Rep (RawStringLiteral a) x # to :: Rep (RawStringLiteral a) x -> RawStringLiteral a #
Generic1 RawStringLiteral Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 RawStringLiteral :: k -> Type # Methods from1 :: forall (a :: k). RawStringLiteral a -> Rep1 RawStringLiteral a # to1 :: forall (a :: k). Rep1 RawStringLiteral a -> RawStringLiteral a #
type Rep (RawStringLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (RawStringLiteral a) = D1 ('MetaData "RawStringLiteral" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "RawStringLiteral" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Rep1 RawStringLiteral Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 RawStringLiteral = D1 ('MetaData "RawStringLiteral" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "RawStringLiteral" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

type AnonymousRange = Token "range" 52 Source #

data PackageIdentifier a Source #

Constructors

PackageIdentifier
Fields ann :: a text :: Text

Instances

Instances details

Functor PackageIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> PackageIdentifier a -> PackageIdentifier b # (<$) :: a -> PackageIdentifier b -> PackageIdentifier a #
Foldable PackageIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => PackageIdentifier m -> m # foldMap :: Monoid m => (a -> m) -> PackageIdentifier a -> m # foldMap' :: Monoid m => (a -> m) -> PackageIdentifier a -> m # foldr :: (a -> b -> b) -> b -> PackageIdentifier a -> b # foldr' :: (a -> b -> b) -> b -> PackageIdentifier a -> b # foldl :: (b -> a -> b) -> b -> PackageIdentifier a -> b # foldl' :: (b -> a -> b) -> b -> PackageIdentifier a -> b # foldr1 :: (a -> a -> a) -> PackageIdentifier a -> a # foldl1 :: (a -> a -> a) -> PackageIdentifier a -> a # toList :: PackageIdentifier a -> [a] # null :: PackageIdentifier a -> Bool # length :: PackageIdentifier a -> Int # elem :: Eq a => a -> PackageIdentifier a -> Bool # maximum :: Ord a => PackageIdentifier a -> a # minimum :: Ord a => PackageIdentifier a -> a # sum :: Num a => PackageIdentifier a -> a # product :: Num a => PackageIdentifier a -> a #
Traversable PackageIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> PackageIdentifier a -> f (PackageIdentifier b) # sequenceA :: Applicative f => PackageIdentifier (f a) -> f (PackageIdentifier a) # mapM :: Monad m => (a -> m b) -> PackageIdentifier a -> m (PackageIdentifier b) # sequence :: Monad m => PackageIdentifier (m a) -> m (PackageIdentifier a) #
SymbolMatching PackageIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy PackageIdentifier -> Node -> Bool showFailure :: Proxy PackageIdentifier -> Node -> String
Unmarshal PackageIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (PackageIdentifier a)
Eq a => Eq (PackageIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: PackageIdentifier a -> PackageIdentifier a -> Bool # (/=) :: PackageIdentifier a -> PackageIdentifier a -> Bool #
Ord a => Ord (PackageIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: PackageIdentifier a -> PackageIdentifier a -> Ordering # (<) :: PackageIdentifier a -> PackageIdentifier a -> Bool # (<=) :: PackageIdentifier a -> PackageIdentifier a -> Bool # (>) :: PackageIdentifier a -> PackageIdentifier a -> Bool # (>=) :: PackageIdentifier a -> PackageIdentifier a -> Bool # max :: PackageIdentifier a -> PackageIdentifier a -> PackageIdentifier a # min :: PackageIdentifier a -> PackageIdentifier a -> PackageIdentifier a #
Show a => Show (PackageIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> PackageIdentifier a -> ShowS # show :: PackageIdentifier a -> String # showList :: [PackageIdentifier a] -> ShowS #
Generic (PackageIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (PackageIdentifier a) :: Type -> Type # Methods from :: PackageIdentifier a -> Rep (PackageIdentifier a) x # to :: Rep (PackageIdentifier a) x -> PackageIdentifier a #
Generic1 PackageIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 PackageIdentifier :: k -> Type # Methods from1 :: forall (a :: k). PackageIdentifier a -> Rep1 PackageIdentifier a # to1 :: forall (a :: k). Rep1 PackageIdentifier a -> PackageIdentifier a #
type Rep (PackageIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (PackageIdentifier a) = D1 ('MetaData "PackageIdentifier" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "PackageIdentifier" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Rep1 PackageIdentifier Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 PackageIdentifier = D1 ('MetaData "PackageIdentifier" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "PackageIdentifier" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

type AnonymousPackage = Token "package" 4 Source #

data Nil a Source #

Constructors

Nil
Fields ann :: a text :: Text

Instances

Instances details

Functor Nil Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> Nil a -> Nil b # (<$) :: a -> Nil b -> Nil a #
Foldable Nil Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => Nil m -> m # foldMap :: Monoid m => (a -> m) -> Nil a -> m # foldMap' :: Monoid m => (a -> m) -> Nil a -> m # foldr :: (a -> b -> b) -> b -> Nil a -> b # foldr' :: (a -> b -> b) -> b -> Nil a -> b # foldl :: (b -> a -> b) -> b -> Nil a -> b # foldl' :: (b -> a -> b) -> b -> Nil a -> b # foldr1 :: (a -> a -> a) -> Nil a -> a # foldl1 :: (a -> a -> a) -> Nil a -> a # toList :: Nil a -> [a] # null :: Nil a -> Bool # length :: Nil a -> Int # elem :: Eq a => a -> Nil a -> Bool # maximum :: Ord a => Nil a -> a # minimum :: Ord a => Nil a -> a # sum :: Num a => Nil a -> a # product :: Num a => Nil a -> a #
Traversable Nil Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> Nil a -> f (Nil b) # sequenceA :: Applicative f => Nil (f a) -> f (Nil a) # mapM :: Monad m => (a -> m b) -> Nil a -> m (Nil b) # sequence :: Monad m => Nil (m a) -> m (Nil a) #
SymbolMatching Nil Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy Nil -> Node -> Bool showFailure :: Proxy Nil -> Node -> String
Unmarshal Nil Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (Nil a)
Eq a => Eq (Nil a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: Nil a -> Nil a -> Bool # (/=) :: Nil a -> Nil a -> Bool #
Ord a => Ord (Nil a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: Nil a -> Nil a -> Ordering # (<) :: Nil a -> Nil a -> Bool # (<=) :: Nil a -> Nil a -> Bool # (>) :: Nil a -> Nil a -> Bool # (>=) :: Nil a -> Nil a -> Bool # max :: Nil a -> Nil a -> Nil a # min :: Nil a -> Nil a -> Nil a #
Show a => Show (Nil a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> Nil a -> ShowS # show :: Nil a -> String # showList :: [Nil a] -> ShowS #
Generic (Nil a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (Nil a) :: Type -> Type # Methods from :: Nil a -> Rep (Nil a) x # to :: Rep (Nil a) x -> Nil a #
Generic1 Nil Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 Nil :: k -> Type # Methods from1 :: forall (a :: k). Nil a -> Rep1 Nil a # to1 :: forall (a :: k). Rep1 Nil a -> Nil a #
type Rep (Nil a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (Nil a) = D1 ('MetaData "Nil" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "Nil" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Rep1 Nil Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 Nil = D1 ('MetaData "Nil" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "Nil" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

type AnonymousMap = Token "map" 24 Source #

data LabelName a Source #

Constructors

LabelName
Fields ann :: a text :: Text

Instances

Instances details

Functor LabelName Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> LabelName a -> LabelName b # (<$) :: a -> LabelName b -> LabelName a #
Foldable LabelName Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => LabelName m -> m # foldMap :: Monoid m => (a -> m) -> LabelName a -> m # foldMap' :: Monoid m => (a -> m) -> LabelName a -> m # foldr :: (a -> b -> b) -> b -> LabelName a -> b # foldr' :: (a -> b -> b) -> b -> LabelName a -> b # foldl :: (b -> a -> b) -> b -> LabelName a -> b # foldl' :: (b -> a -> b) -> b -> LabelName a -> b # foldr1 :: (a -> a -> a) -> LabelName a -> a # foldl1 :: (a -> a -> a) -> LabelName a -> a # toList :: LabelName a -> [a] # null :: LabelName a -> Bool # length :: LabelName a -> Int # elem :: Eq a => a -> LabelName a -> Bool # maximum :: Ord a => LabelName a -> a # minimum :: Ord a => LabelName a -> a # sum :: Num a => LabelName a -> a # product :: Num a => LabelName a -> a #
Traversable LabelName Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> LabelName a -> f (LabelName b) # sequenceA :: Applicative f => LabelName (f a) -> f (LabelName a) # mapM :: Monad m => (a -> m b) -> LabelName a -> m (LabelName b) # sequence :: Monad m => LabelName (m a) -> m (LabelName a) #
SymbolMatching LabelName Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy LabelName -> Node -> Bool showFailure :: Proxy LabelName -> Node -> String
Unmarshal LabelName Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (LabelName a)
Eq a => Eq (LabelName a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: LabelName a -> LabelName a -> Bool # (/=) :: LabelName a -> LabelName a -> Bool #
Ord a => Ord (LabelName a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: LabelName a -> LabelName a -> Ordering # (<) :: LabelName a -> LabelName a -> Bool # (<=) :: LabelName a -> LabelName a -> Bool # (>) :: LabelName a -> LabelName a -> Bool # (>=) :: LabelName a -> LabelName a -> Bool # max :: LabelName a -> LabelName a -> LabelName a # min :: LabelName a -> LabelName a -> LabelName a #
Show a => Show (LabelName a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> LabelName a -> ShowS # show :: LabelName a -> String # showList :: [LabelName a] -> ShowS #
Generic (LabelName a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (LabelName a) :: Type -> Type # Methods from :: LabelName a -> Rep (LabelName a) x # to :: Rep (LabelName a) x -> LabelName a #
Generic1 LabelName Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 LabelName :: k -> Type # Methods from1 :: forall (a :: k). LabelName a -> Rep1 LabelName a # to1 :: forall (a :: k). Rep1 LabelName a -> LabelName a #
type Rep (LabelName a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (LabelName a) = D1 ('MetaData "LabelName" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "LabelName" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Rep1 LabelName Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 LabelName = D1 ('MetaData "LabelName" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "LabelName" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

type AnonymousInterface = Token "interface" 23 Source #

data IntLiteral a Source #

Constructors

IntLiteral
Fields ann :: a text :: Text

Instances

Instances details

Functor IntLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> IntLiteral a -> IntLiteral b # (<$) :: a -> IntLiteral b -> IntLiteral a #
Foldable IntLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => IntLiteral m -> m # foldMap :: Monoid m => (a -> m) -> IntLiteral a -> m # foldMap' :: Monoid m => (a -> m) -> IntLiteral a -> m # foldr :: (a -> b -> b) -> b -> IntLiteral a -> b # foldr' :: (a -> b -> b) -> b -> IntLiteral a -> b # foldl :: (b -> a -> b) -> b -> IntLiteral a -> b # foldl' :: (b -> a -> b) -> b -> IntLiteral a -> b # foldr1 :: (a -> a -> a) -> IntLiteral a -> a # foldl1 :: (a -> a -> a) -> IntLiteral a -> a # toList :: IntLiteral a -> [a] # null :: IntLiteral a -> Bool # length :: IntLiteral a -> Int # elem :: Eq a => a -> IntLiteral a -> Bool # maximum :: Ord a => IntLiteral a -> a # minimum :: Ord a => IntLiteral a -> a # sum :: Num a => IntLiteral a -> a # product :: Num a => IntLiteral a -> a #
Traversable IntLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> IntLiteral a -> f (IntLiteral b) # sequenceA :: Applicative f => IntLiteral (f a) -> f (IntLiteral a) # mapM :: Monad m => (a -> m b) -> IntLiteral a -> m (IntLiteral b) # sequence :: Monad m => IntLiteral (m a) -> m (IntLiteral a) #
SymbolMatching IntLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy IntLiteral -> Node -> Bool showFailure :: Proxy IntLiteral -> Node -> String
Unmarshal IntLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (IntLiteral a)
Eq a => Eq (IntLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: IntLiteral a -> IntLiteral a -> Bool # (/=) :: IntLiteral a -> IntLiteral a -> Bool #
Ord a => Ord (IntLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: IntLiteral a -> IntLiteral a -> Ordering # (<) :: IntLiteral a -> IntLiteral a -> Bool # (<=) :: IntLiteral a -> IntLiteral a -> Bool # (>) :: IntLiteral a -> IntLiteral a -> Bool # (>=) :: IntLiteral a -> IntLiteral a -> Bool # max :: IntLiteral a -> IntLiteral a -> IntLiteral a # min :: IntLiteral a -> IntLiteral a -> IntLiteral a #
Show a => Show (IntLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> IntLiteral a -> ShowS # show :: IntLiteral a -> String # showList :: [IntLiteral a] -> ShowS #
Generic (IntLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (IntLiteral a) :: Type -> Type # Methods from :: IntLiteral a -> Rep (IntLiteral a) x # to :: Rep (IntLiteral a) x -> IntLiteral a #
Generic1 IntLiteral Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 IntLiteral :: k -> Type # Methods from1 :: forall (a :: k). IntLiteral a -> Rep1 IntLiteral a # to1 :: forall (a :: k). Rep1 IntLiteral a -> IntLiteral a #
type Rep (IntLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (IntLiteral a) = D1 ('MetaData "IntLiteral" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "IntLiteral" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Rep1 IntLiteral Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 IntLiteral = D1 ('MetaData "IntLiteral" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "IntLiteral" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

type AnonymousImport = Token "import" 5 Source #

data ImaginaryLiteral a Source #

Constructors

ImaginaryLiteral
Fields ann :: a text :: Text

Instances

Instances details

Functor ImaginaryLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ImaginaryLiteral a -> ImaginaryLiteral b # (<$) :: a -> ImaginaryLiteral b -> ImaginaryLiteral a #
Foldable ImaginaryLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ImaginaryLiteral m -> m # foldMap :: Monoid m => (a -> m) -> ImaginaryLiteral a -> m # foldMap' :: Monoid m => (a -> m) -> ImaginaryLiteral a -> m # foldr :: (a -> b -> b) -> b -> ImaginaryLiteral a -> b # foldr' :: (a -> b -> b) -> b -> ImaginaryLiteral a -> b # foldl :: (b -> a -> b) -> b -> ImaginaryLiteral a -> b # foldl' :: (b -> a -> b) -> b -> ImaginaryLiteral a -> b # foldr1 :: (a -> a -> a) -> ImaginaryLiteral a -> a # foldl1 :: (a -> a -> a) -> ImaginaryLiteral a -> a # toList :: ImaginaryLiteral a -> [a] # null :: ImaginaryLiteral a -> Bool # length :: ImaginaryLiteral a -> Int # elem :: Eq a => a -> ImaginaryLiteral a -> Bool # maximum :: Ord a => ImaginaryLiteral a -> a # minimum :: Ord a => ImaginaryLiteral a -> a # sum :: Num a => ImaginaryLiteral a -> a # product :: Num a => ImaginaryLiteral a -> a #
Traversable ImaginaryLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ImaginaryLiteral a -> f (ImaginaryLiteral b) # sequenceA :: Applicative f => ImaginaryLiteral (f a) -> f (ImaginaryLiteral a) # mapM :: Monad m => (a -> m b) -> ImaginaryLiteral a -> m (ImaginaryLiteral b) # sequence :: Monad m => ImaginaryLiteral (m a) -> m (ImaginaryLiteral a) #
SymbolMatching ImaginaryLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ImaginaryLiteral -> Node -> Bool showFailure :: Proxy ImaginaryLiteral -> Node -> String
Unmarshal ImaginaryLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ImaginaryLiteral a)
Eq a => Eq (ImaginaryLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ImaginaryLiteral a -> ImaginaryLiteral a -> Bool # (/=) :: ImaginaryLiteral a -> ImaginaryLiteral a -> Bool #
Ord a => Ord (ImaginaryLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ImaginaryLiteral a -> ImaginaryLiteral a -> Ordering # (<) :: ImaginaryLiteral a -> ImaginaryLiteral a -> Bool # (<=) :: ImaginaryLiteral a -> ImaginaryLiteral a -> Bool # (>) :: ImaginaryLiteral a -> ImaginaryLiteral a -> Bool # (>=) :: ImaginaryLiteral a -> ImaginaryLiteral a -> Bool # max :: ImaginaryLiteral a -> ImaginaryLiteral a -> ImaginaryLiteral a # min :: ImaginaryLiteral a -> ImaginaryLiteral a -> ImaginaryLiteral a #
Show a => Show (ImaginaryLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ImaginaryLiteral a -> ShowS # show :: ImaginaryLiteral a -> String # showList :: [ImaginaryLiteral a] -> ShowS #
Generic (ImaginaryLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ImaginaryLiteral a) :: Type -> Type # Methods from :: ImaginaryLiteral a -> Rep (ImaginaryLiteral a) x # to :: Rep (ImaginaryLiteral a) x -> ImaginaryLiteral a #
Generic1 ImaginaryLiteral Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ImaginaryLiteral :: k -> Type # Methods from1 :: forall (a :: k). ImaginaryLiteral a -> Rep1 ImaginaryLiteral a # to1 :: forall (a :: k). Rep1 ImaginaryLiteral a -> ImaginaryLiteral a #
type Rep (ImaginaryLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ImaginaryLiteral a) = D1 ('MetaData "ImaginaryLiteral" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ImaginaryLiteral" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Rep1 ImaginaryLiteral Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ImaginaryLiteral = D1 ('MetaData "ImaginaryLiteral" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ImaginaryLiteral" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

type AnonymousIf = Token "if" 49 Source #

data Identifier a Source #

Constructors

Identifier
Fields ann :: a text :: Text

Instances

Instances details

Functor Identifier Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> Identifier a -> Identifier b # (<$) :: a -> Identifier b -> Identifier a #
Foldable Identifier Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => Identifier m -> m # foldMap :: Monoid m => (a -> m) -> Identifier a -> m # foldMap' :: Monoid m => (a -> m) -> Identifier a -> m # foldr :: (a -> b -> b) -> b -> Identifier a -> b # foldr' :: (a -> b -> b) -> b -> Identifier a -> b # foldl :: (b -> a -> b) -> b -> Identifier a -> b # foldl' :: (b -> a -> b) -> b -> Identifier a -> b # foldr1 :: (a -> a -> a) -> Identifier a -> a # foldl1 :: (a -> a -> a) -> Identifier a -> a # toList :: Identifier a -> [a] # null :: Identifier a -> Bool # length :: Identifier a -> Int # elem :: Eq a => a -> Identifier a -> Bool # maximum :: Ord a => Identifier a -> a # minimum :: Ord a => Identifier a -> a # sum :: Num a => Identifier a -> a # product :: Num a => Identifier a -> a #
Traversable Identifier Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> Identifier a -> f (Identifier b) # sequenceA :: Applicative f => Identifier (f a) -> f (Identifier a) # mapM :: Monad m => (a -> m b) -> Identifier a -> m (Identifier b) # sequence :: Monad m => Identifier (m a) -> m (Identifier a) #
SymbolMatching Identifier Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy Identifier -> Node -> Bool showFailure :: Proxy Identifier -> Node -> String
Unmarshal Identifier Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (Identifier a)
Eq a => Eq (Identifier a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: Identifier a -> Identifier a -> Bool # (/=) :: Identifier a -> Identifier a -> Bool #
Ord a => Ord (Identifier a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: Identifier a -> Identifier a -> Ordering # (<) :: Identifier a -> Identifier a -> Bool # (<=) :: Identifier a -> Identifier a -> Bool # (>) :: Identifier a -> Identifier a -> Bool # (>=) :: Identifier a -> Identifier a -> Bool # max :: Identifier a -> Identifier a -> Identifier a # min :: Identifier a -> Identifier a -> Identifier a #
Show a => Show (Identifier a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> Identifier a -> ShowS # show :: Identifier a -> String # showList :: [Identifier a] -> ShowS #
Generic (Identifier a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (Identifier a) :: Type -> Type # Methods from :: Identifier a -> Rep (Identifier a) x # to :: Rep (Identifier a) x -> Identifier a #
Generic1 Identifier Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 Identifier :: k -> Type # Methods from1 :: forall (a :: k). Identifier a -> Rep1 Identifier a # to1 :: forall (a :: k). Rep1 Identifier a -> Identifier a #
type Rep (Identifier a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (Identifier a) = D1 ('MetaData "Identifier" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "Identifier" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Rep1 Identifier Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 Identifier = D1 ('MetaData "Identifier" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "Identifier" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

type AnonymousGoto = Token "goto" 45 Source #

type AnonymousGo = Token "go" 47 Source #

type AnonymousFunc = Token "func" 14 Source #

type AnonymousFor = Token "for" 51 Source #

data FloatLiteral a Source #

Constructors

FloatLiteral
Fields ann :: a text :: Text

Instances

Instances details

Functor FloatLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> FloatLiteral a -> FloatLiteral b # (<$) :: a -> FloatLiteral b -> FloatLiteral a #
Foldable FloatLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => FloatLiteral m -> m # foldMap :: Monoid m => (a -> m) -> FloatLiteral a -> m # foldMap' :: Monoid m => (a -> m) -> FloatLiteral a -> m # foldr :: (a -> b -> b) -> b -> FloatLiteral a -> b # foldr' :: (a -> b -> b) -> b -> FloatLiteral a -> b # foldl :: (b -> a -> b) -> b -> FloatLiteral a -> b # foldl' :: (b -> a -> b) -> b -> FloatLiteral a -> b # foldr1 :: (a -> a -> a) -> FloatLiteral a -> a # foldl1 :: (a -> a -> a) -> FloatLiteral a -> a # toList :: FloatLiteral a -> [a] # null :: FloatLiteral a -> Bool # length :: FloatLiteral a -> Int # elem :: Eq a => a -> FloatLiteral a -> Bool # maximum :: Ord a => FloatLiteral a -> a # minimum :: Ord a => FloatLiteral a -> a # sum :: Num a => FloatLiteral a -> a # product :: Num a => FloatLiteral a -> a #
Traversable FloatLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> FloatLiteral a -> f (FloatLiteral b) # sequenceA :: Applicative f => FloatLiteral (f a) -> f (FloatLiteral a) # mapM :: Monad m => (a -> m b) -> FloatLiteral a -> m (FloatLiteral b) # sequence :: Monad m => FloatLiteral (m a) -> m (FloatLiteral a) #
SymbolMatching FloatLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy FloatLiteral -> Node -> Bool showFailure :: Proxy FloatLiteral -> Node -> String
Unmarshal FloatLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (FloatLiteral a)
Eq a => Eq (FloatLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: FloatLiteral a -> FloatLiteral a -> Bool # (/=) :: FloatLiteral a -> FloatLiteral a -> Bool #
Ord a => Ord (FloatLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: FloatLiteral a -> FloatLiteral a -> Ordering # (<) :: FloatLiteral a -> FloatLiteral a -> Bool # (<=) :: FloatLiteral a -> FloatLiteral a -> Bool # (>) :: FloatLiteral a -> FloatLiteral a -> Bool # (>=) :: FloatLiteral a -> FloatLiteral a -> Bool # max :: FloatLiteral a -> FloatLiteral a -> FloatLiteral a # min :: FloatLiteral a -> FloatLiteral a -> FloatLiteral a #
Show a => Show (FloatLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> FloatLiteral a -> ShowS # show :: FloatLiteral a -> String # showList :: [FloatLiteral a] -> ShowS #
Generic (FloatLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (FloatLiteral a) :: Type -> Type # Methods from :: FloatLiteral a -> Rep (FloatLiteral a) x # to :: Rep (FloatLiteral a) x -> FloatLiteral a #
Generic1 FloatLiteral Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 FloatLiteral :: k -> Type # Methods from1 :: forall (a :: k). FloatLiteral a -> Rep1 FloatLiteral a # to1 :: forall (a :: k). Rep1 FloatLiteral a -> FloatLiteral a #
type Rep (FloatLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (FloatLiteral a) = D1 ('MetaData "FloatLiteral" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "FloatLiteral" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Rep1 FloatLiteral Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 FloatLiteral = D1 ('MetaData "FloatLiteral" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "FloatLiteral" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

data FieldIdentifier a Source #

Constructors

FieldIdentifier
Fields ann :: a text :: Text

Instances

Instances details

Functor FieldIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> FieldIdentifier a -> FieldIdentifier b # (<$) :: a -> FieldIdentifier b -> FieldIdentifier a #
Foldable FieldIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => FieldIdentifier m -> m # foldMap :: Monoid m => (a -> m) -> FieldIdentifier a -> m # foldMap' :: Monoid m => (a -> m) -> FieldIdentifier a -> m # foldr :: (a -> b -> b) -> b -> FieldIdentifier a -> b # foldr' :: (a -> b -> b) -> b -> FieldIdentifier a -> b # foldl :: (b -> a -> b) -> b -> FieldIdentifier a -> b # foldl' :: (b -> a -> b) -> b -> FieldIdentifier a -> b # foldr1 :: (a -> a -> a) -> FieldIdentifier a -> a # foldl1 :: (a -> a -> a) -> FieldIdentifier a -> a # toList :: FieldIdentifier a -> [a] # null :: FieldIdentifier a -> Bool # length :: FieldIdentifier a -> Int # elem :: Eq a => a -> FieldIdentifier a -> Bool # maximum :: Ord a => FieldIdentifier a -> a # minimum :: Ord a => FieldIdentifier a -> a # sum :: Num a => FieldIdentifier a -> a # product :: Num a => FieldIdentifier a -> a #
Traversable FieldIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> FieldIdentifier a -> f (FieldIdentifier b) # sequenceA :: Applicative f => FieldIdentifier (f a) -> f (FieldIdentifier a) # mapM :: Monad m => (a -> m b) -> FieldIdentifier a -> m (FieldIdentifier b) # sequence :: Monad m => FieldIdentifier (m a) -> m (FieldIdentifier a) #
SymbolMatching FieldIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy FieldIdentifier -> Node -> Bool showFailure :: Proxy FieldIdentifier -> Node -> String
Unmarshal FieldIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (FieldIdentifier a)
Eq a => Eq (FieldIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: FieldIdentifier a -> FieldIdentifier a -> Bool # (/=) :: FieldIdentifier a -> FieldIdentifier a -> Bool #
Ord a => Ord (FieldIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: FieldIdentifier a -> FieldIdentifier a -> Ordering # (<) :: FieldIdentifier a -> FieldIdentifier a -> Bool # (<=) :: FieldIdentifier a -> FieldIdentifier a -> Bool # (>) :: FieldIdentifier a -> FieldIdentifier a -> Bool # (>=) :: FieldIdentifier a -> FieldIdentifier a -> Bool # max :: FieldIdentifier a -> FieldIdentifier a -> FieldIdentifier a # min :: FieldIdentifier a -> FieldIdentifier a -> FieldIdentifier a #
Show a => Show (FieldIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> FieldIdentifier a -> ShowS # show :: FieldIdentifier a -> String # showList :: [FieldIdentifier a] -> ShowS #
Generic (FieldIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (FieldIdentifier a) :: Type -> Type # Methods from :: FieldIdentifier a -> Rep (FieldIdentifier a) x # to :: Rep (FieldIdentifier a) x -> FieldIdentifier a #
Generic1 FieldIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 FieldIdentifier :: k -> Type # Methods from1 :: forall (a :: k). FieldIdentifier a -> Rep1 FieldIdentifier a # to1 :: forall (a :: k). Rep1 FieldIdentifier a -> FieldIdentifier a #
type Rep (FieldIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (FieldIdentifier a) = D1 ('MetaData "FieldIdentifier" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "FieldIdentifier" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Rep1 FieldIdentifier Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 FieldIdentifier = D1 ('MetaData "FieldIdentifier" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "FieldIdentifier" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

data False a Source #

Constructors

False
Fields ann :: a text :: Text

Instances

Instances details

Functor False Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> False a -> False b # (<$) :: a -> False b -> False a #
Foldable False Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => False m -> m # foldMap :: Monoid m => (a -> m) -> False a -> m # foldMap' :: Monoid m => (a -> m) -> False a -> m # foldr :: (a -> b -> b) -> b -> False a -> b # foldr' :: (a -> b -> b) -> b -> False a -> b # foldl :: (b -> a -> b) -> b -> False a -> b # foldl' :: (b -> a -> b) -> b -> False a -> b # foldr1 :: (a -> a -> a) -> False a -> a # foldl1 :: (a -> a -> a) -> False a -> a # toList :: False a -> [a] # null :: False a -> Bool # length :: False a -> Int # elem :: Eq a => a -> False a -> Bool # maximum :: Ord a => False a -> a # minimum :: Ord a => False a -> a # sum :: Num a => False a -> a # product :: Num a => False a -> a #
Traversable False Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> False a -> f (False b) # sequenceA :: Applicative f => False (f a) -> f (False a) # mapM :: Monad m => (a -> m b) -> False a -> m (False b) # sequence :: Monad m => False (m a) -> m (False a) #
SymbolMatching False Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy False -> Node -> Bool showFailure :: Proxy False -> Node -> String
Unmarshal False Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (False a)
Eq a => Eq (False a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: False a -> False a -> Bool # (/=) :: False a -> False a -> Bool #
Ord a => Ord (False a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: False a -> False a -> Ordering # (<) :: False a -> False a -> Bool # (<=) :: False a -> False a -> Bool # (>) :: False a -> False a -> Bool # (>=) :: False a -> False a -> Bool # max :: False a -> False a -> False a # min :: False a -> False a -> False a #
Show a => Show (False a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> False a -> ShowS # show :: False a -> String # showList :: [False a] -> ShowS #
Generic (False a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (False a) :: Type -> Type # Methods from :: False a -> Rep (False a) x # to :: Rep (False a) x -> False a #
Generic1 False Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 False :: k -> Type # Methods from1 :: forall (a :: k). False a -> Rep1 False a # to1 :: forall (a :: k). Rep1 False a -> False a #
type Rep (False a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (False a) = D1 ('MetaData "False" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "False" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Rep1 False Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 False = D1 ('MetaData "False" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "False" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

type AnonymousFallthrough = Token "fallthrough" 42 Source #

data EscapeSequence a Source #

Constructors

EscapeSequence
Fields ann :: a text :: Text

Instances

Instances details

Functor EscapeSequence Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> EscapeSequence a -> EscapeSequence b # (<$) :: a -> EscapeSequence b -> EscapeSequence a #
Foldable EscapeSequence Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => EscapeSequence m -> m # foldMap :: Monoid m => (a -> m) -> EscapeSequence a -> m # foldMap' :: Monoid m => (a -> m) -> EscapeSequence a -> m # foldr :: (a -> b -> b) -> b -> EscapeSequence a -> b # foldr' :: (a -> b -> b) -> b -> EscapeSequence a -> b # foldl :: (b -> a -> b) -> b -> EscapeSequence a -> b # foldl' :: (b -> a -> b) -> b -> EscapeSequence a -> b # foldr1 :: (a -> a -> a) -> EscapeSequence a -> a # foldl1 :: (a -> a -> a) -> EscapeSequence a -> a # toList :: EscapeSequence a -> [a] # null :: EscapeSequence a -> Bool # length :: EscapeSequence a -> Int # elem :: Eq a => a -> EscapeSequence a -> Bool # maximum :: Ord a => EscapeSequence a -> a # minimum :: Ord a => EscapeSequence a -> a # sum :: Num a => EscapeSequence a -> a # product :: Num a => EscapeSequence a -> a #
Traversable EscapeSequence Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> EscapeSequence a -> f (EscapeSequence b) # sequenceA :: Applicative f => EscapeSequence (f a) -> f (EscapeSequence a) # mapM :: Monad m => (a -> m b) -> EscapeSequence a -> m (EscapeSequence b) # sequence :: Monad m => EscapeSequence (m a) -> m (EscapeSequence a) #
SymbolMatching EscapeSequence Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy EscapeSequence -> Node -> Bool showFailure :: Proxy EscapeSequence -> Node -> String
Unmarshal EscapeSequence Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (EscapeSequence a)
Eq a => Eq (EscapeSequence a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: EscapeSequence a -> EscapeSequence a -> Bool # (/=) :: EscapeSequence a -> EscapeSequence a -> Bool #
Ord a => Ord (EscapeSequence a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: EscapeSequence a -> EscapeSequence a -> Ordering # (<) :: EscapeSequence a -> EscapeSequence a -> Bool # (<=) :: EscapeSequence a -> EscapeSequence a -> Bool # (>) :: EscapeSequence a -> EscapeSequence a -> Bool # (>=) :: EscapeSequence a -> EscapeSequence a -> Bool # max :: EscapeSequence a -> EscapeSequence a -> EscapeSequence a # min :: EscapeSequence a -> EscapeSequence a -> EscapeSequence a #
Show a => Show (EscapeSequence a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> EscapeSequence a -> ShowS # show :: EscapeSequence a -> String # showList :: [EscapeSequence a] -> ShowS #
Generic (EscapeSequence a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (EscapeSequence a) :: Type -> Type # Methods from :: EscapeSequence a -> Rep (EscapeSequence a) x # to :: Rep (EscapeSequence a) x -> EscapeSequence a #
Generic1 EscapeSequence Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 EscapeSequence :: k -> Type # Methods from1 :: forall (a :: k). EscapeSequence a -> Rep1 EscapeSequence a # to1 :: forall (a :: k). Rep1 EscapeSequence a -> EscapeSequence a #
type Rep (EscapeSequence a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (EscapeSequence a) = D1 ('MetaData "EscapeSequence" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "EscapeSequence" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Rep1 EscapeSequence Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 EscapeSequence = D1 ('MetaData "EscapeSequence" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "EscapeSequence" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

type AnonymousElse = Token "else" 50 Source #

type AnonymousDefer = Token "defer" 48 Source #

type AnonymousDefault = Token "default" 55 Source #

type AnonymousContinue = Token "continue" 44 Source #

type AnonymousConst = Token "const" 10 Source #

type AnonymousChan = Token "chan" 25 Source #

type AnonymousCase = Token "case" 54 Source #

type AnonymousBreak = Token "break" 43 Source #

data BlankIdentifier a Source #

Constructors

BlankIdentifier
Fields ann :: a text :: Text

Instances

Instances details

Functor BlankIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> BlankIdentifier a -> BlankIdentifier b # (<$) :: a -> BlankIdentifier b -> BlankIdentifier a #
Foldable BlankIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => BlankIdentifier m -> m # foldMap :: Monoid m => (a -> m) -> BlankIdentifier a -> m # foldMap' :: Monoid m => (a -> m) -> BlankIdentifier a -> m # foldr :: (a -> b -> b) -> b -> BlankIdentifier a -> b # foldr' :: (a -> b -> b) -> b -> BlankIdentifier a -> b # foldl :: (b -> a -> b) -> b -> BlankIdentifier a -> b # foldl' :: (b -> a -> b) -> b -> BlankIdentifier a -> b # foldr1 :: (a -> a -> a) -> BlankIdentifier a -> a # foldl1 :: (a -> a -> a) -> BlankIdentifier a -> a # toList :: BlankIdentifier a -> [a] # null :: BlankIdentifier a -> Bool # length :: BlankIdentifier a -> Int # elem :: Eq a => a -> BlankIdentifier a -> Bool # maximum :: Ord a => BlankIdentifier a -> a # minimum :: Ord a => BlankIdentifier a -> a # sum :: Num a => BlankIdentifier a -> a # product :: Num a => BlankIdentifier a -> a #
Traversable BlankIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> BlankIdentifier a -> f (BlankIdentifier b) # sequenceA :: Applicative f => BlankIdentifier (f a) -> f (BlankIdentifier a) # mapM :: Monad m => (a -> m b) -> BlankIdentifier a -> m (BlankIdentifier b) # sequence :: Monad m => BlankIdentifier (m a) -> m (BlankIdentifier a) #
SymbolMatching BlankIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy BlankIdentifier -> Node -> Bool showFailure :: Proxy BlankIdentifier -> Node -> String
Unmarshal BlankIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (BlankIdentifier a)
Eq a => Eq (BlankIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: BlankIdentifier a -> BlankIdentifier a -> Bool # (/=) :: BlankIdentifier a -> BlankIdentifier a -> Bool #
Ord a => Ord (BlankIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: BlankIdentifier a -> BlankIdentifier a -> Ordering # (<) :: BlankIdentifier a -> BlankIdentifier a -> Bool # (<=) :: BlankIdentifier a -> BlankIdentifier a -> Bool # (>) :: BlankIdentifier a -> BlankIdentifier a -> Bool # (>=) :: BlankIdentifier a -> BlankIdentifier a -> Bool # max :: BlankIdentifier a -> BlankIdentifier a -> BlankIdentifier a # min :: BlankIdentifier a -> BlankIdentifier a -> BlankIdentifier a #
Show a => Show (BlankIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> BlankIdentifier a -> ShowS # show :: BlankIdentifier a -> String # showList :: [BlankIdentifier a] -> ShowS #
Generic (BlankIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (BlankIdentifier a) :: Type -> Type # Methods from :: BlankIdentifier a -> Rep (BlankIdentifier a) x # to :: Rep (BlankIdentifier a) x -> BlankIdentifier a #
Generic1 BlankIdentifier Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 BlankIdentifier :: k -> Type # Methods from1 :: forall (a :: k). BlankIdentifier a -> Rep1 BlankIdentifier a # to1 :: forall (a :: k). Rep1 BlankIdentifier a -> BlankIdentifier a #
type Rep (BlankIdentifier a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (BlankIdentifier a) = D1 ('MetaData "BlankIdentifier" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "BlankIdentifier" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Rep1 BlankIdentifier Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 BlankIdentifier = D1 ('MetaData "BlankIdentifier" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "BlankIdentifier" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

type AnonymousCaretEqual = Token "^=" 40 Source #

type AnonymousCaret = Token "^" 62 Source #

type AnonymousRBracket = Token "]" 19 Source #

type AnonymousLBracket = Token "[" 18 Source #

type AnonymousRAngleRAngleEqual = Token ">>=" 34 Source #

type AnonymousRAngleRAngle = Token ">>" 67 Source #

type AnonymousRAngleEqual = Token ">=" 75 Source #

type AnonymousRAngle = Token ">" 74 Source #

type AnonymousEqualEqual = Token "==" 70 Source #

type AnonymousEqual = Token "=" 12 Source #

type AnonymousLAngleEqual = Token "<=" 73 Source #

type AnonymousLAngleLAngleEqual = Token "<<=" 33 Source #

type AnonymousLAngleLAngle = Token "<<" 66 Source #

type AnonymousLAngleMinus = Token "<-" 26 Source #

type AnonymousLAngle = Token "<" 72 Source #

type AnonymousSemicolon = Token ";" 3 Source #

type AnonymousColonEqual = Token ":=" 27 Source #

type AnonymousColon = Token ":" 41 Source #

type AnonymousSlashEqual = Token "/=" 31 Source #

type AnonymousSlash = Token "/" 64 Source #

type AnonymousDotDotDot = Token "..." 15 Source #

type AnonymousDot = Token "." 6 Source #

type AnonymousMinusEqual = Token "-=" 38 Source #

type AnonymousMinusMinus = Token "--" 29 Source #

type AnonymousMinus = Token "-" 60 Source #

type AnonymousComma = Token "," 11 Source #

type AnonymousPlusEqual = Token "+=" 37 Source #

type AnonymousPlusPlus = Token "++" 28 Source #

type AnonymousPlus = Token "+" 59 Source #

type AnonymousStarEqual = Token "*=" 30 Source #

type AnonymousStar = Token "*" 17 Source #

type AnonymousRParen = Token ")" 9 Source #

type AnonymousLParen = Token "(" 8 Source #

type AnonymousAmpersandCaretEqual = Token "&^=" 36 Source #

type AnonymousAmpersandCaret = Token "&^" 68 Source #

type AnonymousAmpersandEqual = Token "&=" 35 Source #

type AnonymousAmpersandAmpersand = Token "&&" 76 Source #

type AnonymousAmpersand = Token "&" 63 Source #

type AnonymousPercentEqual = Token "%=" 32 Source #

type AnonymousPercent = Token "%" 65 Source #

type AnonymousDQuote = Token "\"" 79 Source #

type AnonymousBangEqual = Token "!=" 71 Source #

type AnonymousBang = Token "!" 61 Source #

type AnonymousLF = Token "\n" 2 Source #

data VariadicParameterDeclaration a Source #

Constructors

VariadicParameterDeclaration
Fields ann :: a name :: (Maybe (Identifier a)) type' :: (Type a)

Instances

Instances details

Functor VariadicParameterDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> VariadicParameterDeclaration a -> VariadicParameterDeclaration b # (<$) :: a -> VariadicParameterDeclaration b -> VariadicParameterDeclaration a #
Foldable VariadicParameterDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => VariadicParameterDeclaration m -> m # foldMap :: Monoid m => (a -> m) -> VariadicParameterDeclaration a -> m # foldMap' :: Monoid m => (a -> m) -> VariadicParameterDeclaration a -> m # foldr :: (a -> b -> b) -> b -> VariadicParameterDeclaration a -> b # foldr' :: (a -> b -> b) -> b -> VariadicParameterDeclaration a -> b # foldl :: (b -> a -> b) -> b -> VariadicParameterDeclaration a -> b # foldl' :: (b -> a -> b) -> b -> VariadicParameterDeclaration a -> b # foldr1 :: (a -> a -> a) -> VariadicParameterDeclaration a -> a # foldl1 :: (a -> a -> a) -> VariadicParameterDeclaration a -> a # toList :: VariadicParameterDeclaration a -> [a] # null :: VariadicParameterDeclaration a -> Bool # length :: VariadicParameterDeclaration a -> Int # elem :: Eq a => a -> VariadicParameterDeclaration a -> Bool # maximum :: Ord a => VariadicParameterDeclaration a -> a # minimum :: Ord a => VariadicParameterDeclaration a -> a # sum :: Num a => VariadicParameterDeclaration a -> a # product :: Num a => VariadicParameterDeclaration a -> a #
Traversable VariadicParameterDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> VariadicParameterDeclaration a -> f (VariadicParameterDeclaration b) # sequenceA :: Applicative f => VariadicParameterDeclaration (f a) -> f (VariadicParameterDeclaration a) # mapM :: Monad m => (a -> m b) -> VariadicParameterDeclaration a -> m (VariadicParameterDeclaration b) # sequence :: Monad m => VariadicParameterDeclaration (m a) -> m (VariadicParameterDeclaration a) #
SymbolMatching VariadicParameterDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy VariadicParameterDeclaration -> Node -> Bool showFailure :: Proxy VariadicParameterDeclaration -> Node -> String
Unmarshal VariadicParameterDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (VariadicParameterDeclaration a)
Eq a => Eq (VariadicParameterDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: VariadicParameterDeclaration a -> VariadicParameterDeclaration a -> Bool # (/=) :: VariadicParameterDeclaration a -> VariadicParameterDeclaration a -> Bool #
Ord a => Ord (VariadicParameterDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: VariadicParameterDeclaration a -> VariadicParameterDeclaration a -> Ordering # (<) :: VariadicParameterDeclaration a -> VariadicParameterDeclaration a -> Bool # (<=) :: VariadicParameterDeclaration a -> VariadicParameterDeclaration a -> Bool # (>) :: VariadicParameterDeclaration a -> VariadicParameterDeclaration a -> Bool # (>=) :: VariadicParameterDeclaration a -> VariadicParameterDeclaration a -> Bool # max :: VariadicParameterDeclaration a -> VariadicParameterDeclaration a -> VariadicParameterDeclaration a # min :: VariadicParameterDeclaration a -> VariadicParameterDeclaration a -> VariadicParameterDeclaration a #
Show a => Show (VariadicParameterDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> VariadicParameterDeclaration a -> ShowS # show :: VariadicParameterDeclaration a -> String # showList :: [VariadicParameterDeclaration a] -> ShowS #
Generic (VariadicParameterDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (VariadicParameterDeclaration a) :: Type -> Type # Methods from :: VariadicParameterDeclaration a -> Rep (VariadicParameterDeclaration a) x # to :: Rep (VariadicParameterDeclaration a) x -> VariadicParameterDeclaration a #
Generic1 VariadicParameterDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 VariadicParameterDeclaration :: k -> Type # Methods from1 :: forall (a :: k). VariadicParameterDeclaration a -> Rep1 VariadicParameterDeclaration a # to1 :: forall (a :: k). Rep1 VariadicParameterDeclaration a -> VariadicParameterDeclaration a #
type Rep (VariadicParameterDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (VariadicParameterDeclaration a) = D1 ('MetaData "VariadicParameterDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "VariadicParameterDeclaration" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Identifier a))) :: S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type a)))))
type Rep1 VariadicParameterDeclaration Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 VariadicParameterDeclaration = D1 ('MetaData "VariadicParameterDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "VariadicParameterDeclaration" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 Identifier) :: S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Type))))

data VariadicArgument a Source #

Constructors

VariadicArgument
Fields ann :: a extraChildren :: (Expression a)

Instances

Instances details

Functor VariadicArgument Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> VariadicArgument a -> VariadicArgument b # (<$) :: a -> VariadicArgument b -> VariadicArgument a #
Foldable VariadicArgument Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => VariadicArgument m -> m # foldMap :: Monoid m => (a -> m) -> VariadicArgument a -> m # foldMap' :: Monoid m => (a -> m) -> VariadicArgument a -> m # foldr :: (a -> b -> b) -> b -> VariadicArgument a -> b # foldr' :: (a -> b -> b) -> b -> VariadicArgument a -> b # foldl :: (b -> a -> b) -> b -> VariadicArgument a -> b # foldl' :: (b -> a -> b) -> b -> VariadicArgument a -> b # foldr1 :: (a -> a -> a) -> VariadicArgument a -> a # foldl1 :: (a -> a -> a) -> VariadicArgument a -> a # toList :: VariadicArgument a -> [a] # null :: VariadicArgument a -> Bool # length :: VariadicArgument a -> Int # elem :: Eq a => a -> VariadicArgument a -> Bool # maximum :: Ord a => VariadicArgument a -> a # minimum :: Ord a => VariadicArgument a -> a # sum :: Num a => VariadicArgument a -> a # product :: Num a => VariadicArgument a -> a #
Traversable VariadicArgument Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> VariadicArgument a -> f (VariadicArgument b) # sequenceA :: Applicative f => VariadicArgument (f a) -> f (VariadicArgument a) # mapM :: Monad m => (a -> m b) -> VariadicArgument a -> m (VariadicArgument b) # sequence :: Monad m => VariadicArgument (m a) -> m (VariadicArgument a) #
SymbolMatching VariadicArgument Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy VariadicArgument -> Node -> Bool showFailure :: Proxy VariadicArgument -> Node -> String
Unmarshal VariadicArgument Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (VariadicArgument a)
Eq a => Eq (VariadicArgument a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: VariadicArgument a -> VariadicArgument a -> Bool # (/=) :: VariadicArgument a -> VariadicArgument a -> Bool #
Ord a => Ord (VariadicArgument a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: VariadicArgument a -> VariadicArgument a -> Ordering # (<) :: VariadicArgument a -> VariadicArgument a -> Bool # (<=) :: VariadicArgument a -> VariadicArgument a -> Bool # (>) :: VariadicArgument a -> VariadicArgument a -> Bool # (>=) :: VariadicArgument a -> VariadicArgument a -> Bool # max :: VariadicArgument a -> VariadicArgument a -> VariadicArgument a # min :: VariadicArgument a -> VariadicArgument a -> VariadicArgument a #
Show a => Show (VariadicArgument a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> VariadicArgument a -> ShowS # show :: VariadicArgument a -> String # showList :: [VariadicArgument a] -> ShowS #
Generic (VariadicArgument a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (VariadicArgument a) :: Type -> Type # Methods from :: VariadicArgument a -> Rep (VariadicArgument a) x # to :: Rep (VariadicArgument a) x -> VariadicArgument a #
Generic1 VariadicArgument Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 VariadicArgument :: k -> Type # Methods from1 :: forall (a :: k). VariadicArgument a -> Rep1 VariadicArgument a # to1 :: forall (a :: k). Rep1 VariadicArgument a -> VariadicArgument a #
type Rep (VariadicArgument a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (VariadicArgument a) = D1 ('MetaData "VariadicArgument" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "VariadicArgument" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a))))
type Rep1 VariadicArgument Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 VariadicArgument = D1 ('MetaData "VariadicArgument" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "VariadicArgument" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression)))

data VarSpec a Source #

Constructors

VarSpec
Fields ann :: a value :: (Maybe (ExpressionList a)) name :: (NonEmpty ((:+:) AnonymousComma Identifier a)) type' :: (Maybe (Type a))

Instances

Instances details

Functor VarSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> VarSpec a -> VarSpec b # (<$) :: a -> VarSpec b -> VarSpec a #
Foldable VarSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => VarSpec m -> m # foldMap :: Monoid m => (a -> m) -> VarSpec a -> m # foldMap' :: Monoid m => (a -> m) -> VarSpec a -> m # foldr :: (a -> b -> b) -> b -> VarSpec a -> b # foldr' :: (a -> b -> b) -> b -> VarSpec a -> b # foldl :: (b -> a -> b) -> b -> VarSpec a -> b # foldl' :: (b -> a -> b) -> b -> VarSpec a -> b # foldr1 :: (a -> a -> a) -> VarSpec a -> a # foldl1 :: (a -> a -> a) -> VarSpec a -> a # toList :: VarSpec a -> [a] # null :: VarSpec a -> Bool # length :: VarSpec a -> Int # elem :: Eq a => a -> VarSpec a -> Bool # maximum :: Ord a => VarSpec a -> a # minimum :: Ord a => VarSpec a -> a # sum :: Num a => VarSpec a -> a # product :: Num a => VarSpec a -> a #
Traversable VarSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> VarSpec a -> f (VarSpec b) # sequenceA :: Applicative f => VarSpec (f a) -> f (VarSpec a) # mapM :: Monad m => (a -> m b) -> VarSpec a -> m (VarSpec b) # sequence :: Monad m => VarSpec (m a) -> m (VarSpec a) #
SymbolMatching VarSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy VarSpec -> Node -> Bool showFailure :: Proxy VarSpec -> Node -> String
Unmarshal VarSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (VarSpec a)
Eq a => Eq (VarSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: VarSpec a -> VarSpec a -> Bool # (/=) :: VarSpec a -> VarSpec a -> Bool #
Ord a => Ord (VarSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: VarSpec a -> VarSpec a -> Ordering # (<) :: VarSpec a -> VarSpec a -> Bool # (<=) :: VarSpec a -> VarSpec a -> Bool # (>) :: VarSpec a -> VarSpec a -> Bool # (>=) :: VarSpec a -> VarSpec a -> Bool # max :: VarSpec a -> VarSpec a -> VarSpec a # min :: VarSpec a -> VarSpec a -> VarSpec a #
Show a => Show (VarSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> VarSpec a -> ShowS # show :: VarSpec a -> String # showList :: [VarSpec a] -> ShowS #
Generic (VarSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (VarSpec a) :: Type -> Type # Methods from :: VarSpec a -> Rep (VarSpec a) x # to :: Rep (VarSpec a) x -> VarSpec a #
Generic1 VarSpec Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 VarSpec :: k -> Type # Methods from1 :: forall (a :: k). VarSpec a -> Rep1 VarSpec a # to1 :: forall (a :: k). Rep1 VarSpec a -> VarSpec a #
type Rep (VarSpec a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (VarSpec a) = D1 ('MetaData "VarSpec" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "VarSpec" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: S1 ('MetaSel ('Just "value") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (ExpressionList a)))) :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NonEmpty ((AnonymousComma :+: Identifier) a))) :*: S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Type a))))))
type Rep1 VarSpec Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 VarSpec = D1 ('MetaData "VarSpec" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "VarSpec" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: S1 ('MetaSel ('Just "value") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 ExpressionList)) :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (NonEmpty :.: Rec1 (AnonymousComma :+: Identifier)) :*: S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 Type))))

data VarDeclaration a Source #

Constructors

VarDeclaration
Fields ann :: a extraChildren :: ([] (VarSpec a))

Instances

Instances details

Functor VarDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> VarDeclaration a -> VarDeclaration b # (<$) :: a -> VarDeclaration b -> VarDeclaration a #
Foldable VarDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => VarDeclaration m -> m # foldMap :: Monoid m => (a -> m) -> VarDeclaration a -> m # foldMap' :: Monoid m => (a -> m) -> VarDeclaration a -> m # foldr :: (a -> b -> b) -> b -> VarDeclaration a -> b # foldr' :: (a -> b -> b) -> b -> VarDeclaration a -> b # foldl :: (b -> a -> b) -> b -> VarDeclaration a -> b # foldl' :: (b -> a -> b) -> b -> VarDeclaration a -> b # foldr1 :: (a -> a -> a) -> VarDeclaration a -> a # foldl1 :: (a -> a -> a) -> VarDeclaration a -> a # toList :: VarDeclaration a -> [a] # null :: VarDeclaration a -> Bool # length :: VarDeclaration a -> Int # elem :: Eq a => a -> VarDeclaration a -> Bool # maximum :: Ord a => VarDeclaration a -> a # minimum :: Ord a => VarDeclaration a -> a # sum :: Num a => VarDeclaration a -> a # product :: Num a => VarDeclaration a -> a #
Traversable VarDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> VarDeclaration a -> f (VarDeclaration b) # sequenceA :: Applicative f => VarDeclaration (f a) -> f (VarDeclaration a) # mapM :: Monad m => (a -> m b) -> VarDeclaration a -> m (VarDeclaration b) # sequence :: Monad m => VarDeclaration (m a) -> m (VarDeclaration a) #
SymbolMatching VarDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy VarDeclaration -> Node -> Bool showFailure :: Proxy VarDeclaration -> Node -> String
Unmarshal VarDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (VarDeclaration a)
Eq a => Eq (VarDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: VarDeclaration a -> VarDeclaration a -> Bool # (/=) :: VarDeclaration a -> VarDeclaration a -> Bool #
Ord a => Ord (VarDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: VarDeclaration a -> VarDeclaration a -> Ordering # (<) :: VarDeclaration a -> VarDeclaration a -> Bool # (<=) :: VarDeclaration a -> VarDeclaration a -> Bool # (>) :: VarDeclaration a -> VarDeclaration a -> Bool # (>=) :: VarDeclaration a -> VarDeclaration a -> Bool # max :: VarDeclaration a -> VarDeclaration a -> VarDeclaration a # min :: VarDeclaration a -> VarDeclaration a -> VarDeclaration a #
Show a => Show (VarDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> VarDeclaration a -> ShowS # show :: VarDeclaration a -> String # showList :: [VarDeclaration a] -> ShowS #
Generic (VarDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (VarDeclaration a) :: Type -> Type # Methods from :: VarDeclaration a -> Rep (VarDeclaration a) x # to :: Rep (VarDeclaration a) x -> VarDeclaration a #
Generic1 VarDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 VarDeclaration :: k -> Type # Methods from1 :: forall (a :: k). VarDeclaration a -> Rep1 VarDeclaration a # to1 :: forall (a :: k). Rep1 VarDeclaration a -> VarDeclaration a #
type Rep (VarDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (VarDeclaration a) = D1 ('MetaData "VarDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "VarDeclaration" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [VarSpec a])))
type Rep1 VarDeclaration Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 VarDeclaration = D1 ('MetaData "VarDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "VarDeclaration" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 VarSpec)))

data UnaryExpression a Source #

Constructors

UnaryExpression
Fields ann :: a operator :: ((:+:) ((:+:) AnonymousBang ((:+:) AnonymousAmpersand AnonymousStar)) ((:+:) ((:+:) AnonymousPlus AnonymousMinus) ((:+:) AnonymousLAngleMinus AnonymousCaret)) a) operand :: (Expression a)

Instances

Instances details

Functor UnaryExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> UnaryExpression a -> UnaryExpression b # (<$) :: a -> UnaryExpression b -> UnaryExpression a #
Foldable UnaryExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => UnaryExpression m -> m # foldMap :: Monoid m => (a -> m) -> UnaryExpression a -> m # foldMap' :: Monoid m => (a -> m) -> UnaryExpression a -> m # foldr :: (a -> b -> b) -> b -> UnaryExpression a -> b # foldr' :: (a -> b -> b) -> b -> UnaryExpression a -> b # foldl :: (b -> a -> b) -> b -> UnaryExpression a -> b # foldl' :: (b -> a -> b) -> b -> UnaryExpression a -> b # foldr1 :: (a -> a -> a) -> UnaryExpression a -> a # foldl1 :: (a -> a -> a) -> UnaryExpression a -> a # toList :: UnaryExpression a -> [a] # null :: UnaryExpression a -> Bool # length :: UnaryExpression a -> Int # elem :: Eq a => a -> UnaryExpression a -> Bool # maximum :: Ord a => UnaryExpression a -> a # minimum :: Ord a => UnaryExpression a -> a # sum :: Num a => UnaryExpression a -> a # product :: Num a => UnaryExpression a -> a #
Traversable UnaryExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> UnaryExpression a -> f (UnaryExpression b) # sequenceA :: Applicative f => UnaryExpression (f a) -> f (UnaryExpression a) # mapM :: Monad m => (a -> m b) -> UnaryExpression a -> m (UnaryExpression b) # sequence :: Monad m => UnaryExpression (m a) -> m (UnaryExpression a) #
SymbolMatching UnaryExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy UnaryExpression -> Node -> Bool showFailure :: Proxy UnaryExpression -> Node -> String
Unmarshal UnaryExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (UnaryExpression a)
Eq a => Eq (UnaryExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: UnaryExpression a -> UnaryExpression a -> Bool # (/=) :: UnaryExpression a -> UnaryExpression a -> Bool #
Ord a => Ord (UnaryExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: UnaryExpression a -> UnaryExpression a -> Ordering # (<) :: UnaryExpression a -> UnaryExpression a -> Bool # (<=) :: UnaryExpression a -> UnaryExpression a -> Bool # (>) :: UnaryExpression a -> UnaryExpression a -> Bool # (>=) :: UnaryExpression a -> UnaryExpression a -> Bool # max :: UnaryExpression a -> UnaryExpression a -> UnaryExpression a # min :: UnaryExpression a -> UnaryExpression a -> UnaryExpression a #
Show a => Show (UnaryExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> UnaryExpression a -> ShowS # show :: UnaryExpression a -> String # showList :: [UnaryExpression a] -> ShowS #
Generic (UnaryExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (UnaryExpression a) :: Type -> Type # Methods from :: UnaryExpression a -> Rep (UnaryExpression a) x # to :: Rep (UnaryExpression a) x -> UnaryExpression a #
Generic1 UnaryExpression Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 UnaryExpression :: k -> Type # Methods from1 :: forall (a :: k). UnaryExpression a -> Rep1 UnaryExpression a # to1 :: forall (a :: k). Rep1 UnaryExpression a -> UnaryExpression a #
type Rep (UnaryExpression a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (UnaryExpression a) = D1 ('MetaData "UnaryExpression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "UnaryExpression" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "operator") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (((AnonymousBang :+: (AnonymousAmpersand :+: AnonymousStar)) :+: ((AnonymousPlus :+: AnonymousMinus) :+: (AnonymousLAngleMinus :+: AnonymousCaret))) a)) :: S1 ('MetaSel ('Just "operand") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a)))))
type Rep1 UnaryExpression Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 UnaryExpression = D1 ('MetaData "UnaryExpression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "UnaryExpression" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "operator") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 ((AnonymousBang :+: (AnonymousAmpersand :+: AnonymousStar)) :+: ((AnonymousPlus :+: AnonymousMinus) :+: (AnonymousLAngleMinus :+: AnonymousCaret)))) :: S1 ('MetaSel ('Just "operand") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression))))

data TypeSwitchStatement a Source #

Constructors

TypeSwitchStatement
Fields ann :: a value :: (Expression a) alias :: (Maybe (ExpressionList a)) initializer :: (Maybe (SimpleStatement a)) extraChildren :: ([] ((:+:) DefaultCase TypeCase a))

Instances

Instances details

Functor TypeSwitchStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> TypeSwitchStatement a -> TypeSwitchStatement b # (<$) :: a -> TypeSwitchStatement b -> TypeSwitchStatement a #
Foldable TypeSwitchStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => TypeSwitchStatement m -> m # foldMap :: Monoid m => (a -> m) -> TypeSwitchStatement a -> m # foldMap' :: Monoid m => (a -> m) -> TypeSwitchStatement a -> m # foldr :: (a -> b -> b) -> b -> TypeSwitchStatement a -> b # foldr' :: (a -> b -> b) -> b -> TypeSwitchStatement a -> b # foldl :: (b -> a -> b) -> b -> TypeSwitchStatement a -> b # foldl' :: (b -> a -> b) -> b -> TypeSwitchStatement a -> b # foldr1 :: (a -> a -> a) -> TypeSwitchStatement a -> a # foldl1 :: (a -> a -> a) -> TypeSwitchStatement a -> a # toList :: TypeSwitchStatement a -> [a] # null :: TypeSwitchStatement a -> Bool # length :: TypeSwitchStatement a -> Int # elem :: Eq a => a -> TypeSwitchStatement a -> Bool # maximum :: Ord a => TypeSwitchStatement a -> a # minimum :: Ord a => TypeSwitchStatement a -> a # sum :: Num a => TypeSwitchStatement a -> a # product :: Num a => TypeSwitchStatement a -> a #
Traversable TypeSwitchStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> TypeSwitchStatement a -> f (TypeSwitchStatement b) # sequenceA :: Applicative f => TypeSwitchStatement (f a) -> f (TypeSwitchStatement a) # mapM :: Monad m => (a -> m b) -> TypeSwitchStatement a -> m (TypeSwitchStatement b) # sequence :: Monad m => TypeSwitchStatement (m a) -> m (TypeSwitchStatement a) #
SymbolMatching TypeSwitchStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy TypeSwitchStatement -> Node -> Bool showFailure :: Proxy TypeSwitchStatement -> Node -> String
Unmarshal TypeSwitchStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (TypeSwitchStatement a)
Eq a => Eq (TypeSwitchStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: TypeSwitchStatement a -> TypeSwitchStatement a -> Bool # (/=) :: TypeSwitchStatement a -> TypeSwitchStatement a -> Bool #
Ord a => Ord (TypeSwitchStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: TypeSwitchStatement a -> TypeSwitchStatement a -> Ordering # (<) :: TypeSwitchStatement a -> TypeSwitchStatement a -> Bool # (<=) :: TypeSwitchStatement a -> TypeSwitchStatement a -> Bool # (>) :: TypeSwitchStatement a -> TypeSwitchStatement a -> Bool # (>=) :: TypeSwitchStatement a -> TypeSwitchStatement a -> Bool # max :: TypeSwitchStatement a -> TypeSwitchStatement a -> TypeSwitchStatement a # min :: TypeSwitchStatement a -> TypeSwitchStatement a -> TypeSwitchStatement a #
Show a => Show (TypeSwitchStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> TypeSwitchStatement a -> ShowS # show :: TypeSwitchStatement a -> String # showList :: [TypeSwitchStatement a] -> ShowS #
Generic (TypeSwitchStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (TypeSwitchStatement a) :: Type -> Type # Methods from :: TypeSwitchStatement a -> Rep (TypeSwitchStatement a) x # to :: Rep (TypeSwitchStatement a) x -> TypeSwitchStatement a #
Generic1 TypeSwitchStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 TypeSwitchStatement :: k -> Type # Methods from1 :: forall (a :: k). TypeSwitchStatement a -> Rep1 TypeSwitchStatement a # to1 :: forall (a :: k). Rep1 TypeSwitchStatement a -> TypeSwitchStatement a #
type Rep (TypeSwitchStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (TypeSwitchStatement a) = D1 ('MetaData "TypeSwitchStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "TypeSwitchStatement" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: S1 ('MetaSel ('Just "value") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a))) :: (S1 ('MetaSel ('Just "alias") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (ExpressionList a))) :: (S1 ('MetaSel ('Just "initializer") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (SimpleStatement a))) :: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(DefaultCase :+: TypeCase) a])))))
type Rep1 TypeSwitchStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 TypeSwitchStatement = D1 ('MetaData "TypeSwitchStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "TypeSwitchStatement" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: S1 ('MetaSel ('Just "value") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression)) :: (S1 ('MetaSel ('Just "alias") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 ExpressionList) :: (S1 ('MetaSel ('Just "initializer") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 SimpleStatement) :: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 (DefaultCase :+: TypeCase))))))

data TypeSpec a Source #

Constructors

TypeSpec
Fields ann :: a name :: (TypeIdentifier a) type' :: (Type a)

Instances

Instances details

Functor TypeSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> TypeSpec a -> TypeSpec b # (<$) :: a -> TypeSpec b -> TypeSpec a #
Foldable TypeSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => TypeSpec m -> m # foldMap :: Monoid m => (a -> m) -> TypeSpec a -> m # foldMap' :: Monoid m => (a -> m) -> TypeSpec a -> m # foldr :: (a -> b -> b) -> b -> TypeSpec a -> b # foldr' :: (a -> b -> b) -> b -> TypeSpec a -> b # foldl :: (b -> a -> b) -> b -> TypeSpec a -> b # foldl' :: (b -> a -> b) -> b -> TypeSpec a -> b # foldr1 :: (a -> a -> a) -> TypeSpec a -> a # foldl1 :: (a -> a -> a) -> TypeSpec a -> a # toList :: TypeSpec a -> [a] # null :: TypeSpec a -> Bool # length :: TypeSpec a -> Int # elem :: Eq a => a -> TypeSpec a -> Bool # maximum :: Ord a => TypeSpec a -> a # minimum :: Ord a => TypeSpec a -> a # sum :: Num a => TypeSpec a -> a # product :: Num a => TypeSpec a -> a #
Traversable TypeSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> TypeSpec a -> f (TypeSpec b) # sequenceA :: Applicative f => TypeSpec (f a) -> f (TypeSpec a) # mapM :: Monad m => (a -> m b) -> TypeSpec a -> m (TypeSpec b) # sequence :: Monad m => TypeSpec (m a) -> m (TypeSpec a) #
SymbolMatching TypeSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy TypeSpec -> Node -> Bool showFailure :: Proxy TypeSpec -> Node -> String
Unmarshal TypeSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (TypeSpec a)
Eq a => Eq (TypeSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: TypeSpec a -> TypeSpec a -> Bool # (/=) :: TypeSpec a -> TypeSpec a -> Bool #
Ord a => Ord (TypeSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: TypeSpec a -> TypeSpec a -> Ordering # (<) :: TypeSpec a -> TypeSpec a -> Bool # (<=) :: TypeSpec a -> TypeSpec a -> Bool # (>) :: TypeSpec a -> TypeSpec a -> Bool # (>=) :: TypeSpec a -> TypeSpec a -> Bool # max :: TypeSpec a -> TypeSpec a -> TypeSpec a # min :: TypeSpec a -> TypeSpec a -> TypeSpec a #
Show a => Show (TypeSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> TypeSpec a -> ShowS # show :: TypeSpec a -> String # showList :: [TypeSpec a] -> ShowS #
Generic (TypeSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (TypeSpec a) :: Type -> Type # Methods from :: TypeSpec a -> Rep (TypeSpec a) x # to :: Rep (TypeSpec a) x -> TypeSpec a #
Generic1 TypeSpec Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 TypeSpec :: k -> Type # Methods from1 :: forall (a :: k). TypeSpec a -> Rep1 TypeSpec a # to1 :: forall (a :: k). Rep1 TypeSpec a -> TypeSpec a #
type Rep (TypeSpec a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (TypeSpec a) = D1 ('MetaData "TypeSpec" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "TypeSpec" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (TypeIdentifier a)) :: S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type a)))))
type Rep1 TypeSpec Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 TypeSpec = D1 ('MetaData "TypeSpec" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "TypeSpec" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 TypeIdentifier) :: S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Type))))

data TypeDeclaration a Source #

Constructors

TypeDeclaration
Fields ann :: a extraChildren :: ([] ((:+:) TypeAlias TypeSpec a))

Instances

Instances details

Functor TypeDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> TypeDeclaration a -> TypeDeclaration b # (<$) :: a -> TypeDeclaration b -> TypeDeclaration a #
Foldable TypeDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => TypeDeclaration m -> m # foldMap :: Monoid m => (a -> m) -> TypeDeclaration a -> m # foldMap' :: Monoid m => (a -> m) -> TypeDeclaration a -> m # foldr :: (a -> b -> b) -> b -> TypeDeclaration a -> b # foldr' :: (a -> b -> b) -> b -> TypeDeclaration a -> b # foldl :: (b -> a -> b) -> b -> TypeDeclaration a -> b # foldl' :: (b -> a -> b) -> b -> TypeDeclaration a -> b # foldr1 :: (a -> a -> a) -> TypeDeclaration a -> a # foldl1 :: (a -> a -> a) -> TypeDeclaration a -> a # toList :: TypeDeclaration a -> [a] # null :: TypeDeclaration a -> Bool # length :: TypeDeclaration a -> Int # elem :: Eq a => a -> TypeDeclaration a -> Bool # maximum :: Ord a => TypeDeclaration a -> a # minimum :: Ord a => TypeDeclaration a -> a # sum :: Num a => TypeDeclaration a -> a # product :: Num a => TypeDeclaration a -> a #
Traversable TypeDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> TypeDeclaration a -> f (TypeDeclaration b) # sequenceA :: Applicative f => TypeDeclaration (f a) -> f (TypeDeclaration a) # mapM :: Monad m => (a -> m b) -> TypeDeclaration a -> m (TypeDeclaration b) # sequence :: Monad m => TypeDeclaration (m a) -> m (TypeDeclaration a) #
SymbolMatching TypeDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy TypeDeclaration -> Node -> Bool showFailure :: Proxy TypeDeclaration -> Node -> String
Unmarshal TypeDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (TypeDeclaration a)
Eq a => Eq (TypeDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: TypeDeclaration a -> TypeDeclaration a -> Bool # (/=) :: TypeDeclaration a -> TypeDeclaration a -> Bool #
Ord a => Ord (TypeDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: TypeDeclaration a -> TypeDeclaration a -> Ordering # (<) :: TypeDeclaration a -> TypeDeclaration a -> Bool # (<=) :: TypeDeclaration a -> TypeDeclaration a -> Bool # (>) :: TypeDeclaration a -> TypeDeclaration a -> Bool # (>=) :: TypeDeclaration a -> TypeDeclaration a -> Bool # max :: TypeDeclaration a -> TypeDeclaration a -> TypeDeclaration a # min :: TypeDeclaration a -> TypeDeclaration a -> TypeDeclaration a #
Show a => Show (TypeDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> TypeDeclaration a -> ShowS # show :: TypeDeclaration a -> String # showList :: [TypeDeclaration a] -> ShowS #
Generic (TypeDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (TypeDeclaration a) :: Type -> Type # Methods from :: TypeDeclaration a -> Rep (TypeDeclaration a) x # to :: Rep (TypeDeclaration a) x -> TypeDeclaration a #
Generic1 TypeDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 TypeDeclaration :: k -> Type # Methods from1 :: forall (a :: k). TypeDeclaration a -> Rep1 TypeDeclaration a # to1 :: forall (a :: k). Rep1 TypeDeclaration a -> TypeDeclaration a #
type Rep (TypeDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (TypeDeclaration a) = D1 ('MetaData "TypeDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "TypeDeclaration" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(TypeAlias :+: TypeSpec) a])))
type Rep1 TypeDeclaration Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 TypeDeclaration = D1 ('MetaData "TypeDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "TypeDeclaration" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 (TypeAlias :+: TypeSpec))))

data TypeConversionExpression a Source #

Constructors

TypeConversionExpression
Fields ann :: a type' :: (Type a) operand :: (Expression a)

Instances

Instances details

Functor TypeConversionExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> TypeConversionExpression a -> TypeConversionExpression b # (<$) :: a -> TypeConversionExpression b -> TypeConversionExpression a #
Foldable TypeConversionExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => TypeConversionExpression m -> m # foldMap :: Monoid m => (a -> m) -> TypeConversionExpression a -> m # foldMap' :: Monoid m => (a -> m) -> TypeConversionExpression a -> m # foldr :: (a -> b -> b) -> b -> TypeConversionExpression a -> b # foldr' :: (a -> b -> b) -> b -> TypeConversionExpression a -> b # foldl :: (b -> a -> b) -> b -> TypeConversionExpression a -> b # foldl' :: (b -> a -> b) -> b -> TypeConversionExpression a -> b # foldr1 :: (a -> a -> a) -> TypeConversionExpression a -> a # foldl1 :: (a -> a -> a) -> TypeConversionExpression a -> a # toList :: TypeConversionExpression a -> [a] # null :: TypeConversionExpression a -> Bool # length :: TypeConversionExpression a -> Int # elem :: Eq a => a -> TypeConversionExpression a -> Bool # maximum :: Ord a => TypeConversionExpression a -> a # minimum :: Ord a => TypeConversionExpression a -> a # sum :: Num a => TypeConversionExpression a -> a # product :: Num a => TypeConversionExpression a -> a #
Traversable TypeConversionExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> TypeConversionExpression a -> f (TypeConversionExpression b) # sequenceA :: Applicative f => TypeConversionExpression (f a) -> f (TypeConversionExpression a) # mapM :: Monad m => (a -> m b) -> TypeConversionExpression a -> m (TypeConversionExpression b) # sequence :: Monad m => TypeConversionExpression (m a) -> m (TypeConversionExpression a) #
SymbolMatching TypeConversionExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy TypeConversionExpression -> Node -> Bool showFailure :: Proxy TypeConversionExpression -> Node -> String
Unmarshal TypeConversionExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (TypeConversionExpression a)
Eq a => Eq (TypeConversionExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: TypeConversionExpression a -> TypeConversionExpression a -> Bool # (/=) :: TypeConversionExpression a -> TypeConversionExpression a -> Bool #
Ord a => Ord (TypeConversionExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: TypeConversionExpression a -> TypeConversionExpression a -> Ordering # (<) :: TypeConversionExpression a -> TypeConversionExpression a -> Bool # (<=) :: TypeConversionExpression a -> TypeConversionExpression a -> Bool # (>) :: TypeConversionExpression a -> TypeConversionExpression a -> Bool # (>=) :: TypeConversionExpression a -> TypeConversionExpression a -> Bool # max :: TypeConversionExpression a -> TypeConversionExpression a -> TypeConversionExpression a # min :: TypeConversionExpression a -> TypeConversionExpression a -> TypeConversionExpression a #
Show a => Show (TypeConversionExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> TypeConversionExpression a -> ShowS # show :: TypeConversionExpression a -> String # showList :: [TypeConversionExpression a] -> ShowS #
Generic (TypeConversionExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (TypeConversionExpression a) :: Type -> Type # Methods from :: TypeConversionExpression a -> Rep (TypeConversionExpression a) x # to :: Rep (TypeConversionExpression a) x -> TypeConversionExpression a #
Generic1 TypeConversionExpression Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 TypeConversionExpression :: k -> Type # Methods from1 :: forall (a :: k). TypeConversionExpression a -> Rep1 TypeConversionExpression a # to1 :: forall (a :: k). Rep1 TypeConversionExpression a -> TypeConversionExpression a #
type Rep (TypeConversionExpression a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (TypeConversionExpression a) = D1 ('MetaData "TypeConversionExpression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "TypeConversionExpression" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type a)) :: S1 ('MetaSel ('Just "operand") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a)))))
type Rep1 TypeConversionExpression Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 TypeConversionExpression = D1 ('MetaData "TypeConversionExpression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "TypeConversionExpression" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Type) :: S1 ('MetaSel ('Just "operand") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression))))

data TypeCase a Source #

Constructors

TypeCase
Fields ann :: a type' :: (NonEmpty ((:+:) AnonymousComma Type a)) extraChildren :: ([] (Statement a))

Instances

Instances details

Functor TypeCase Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> TypeCase a -> TypeCase b # (<$) :: a -> TypeCase b -> TypeCase a #
Foldable TypeCase Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => TypeCase m -> m # foldMap :: Monoid m => (a -> m) -> TypeCase a -> m # foldMap' :: Monoid m => (a -> m) -> TypeCase a -> m # foldr :: (a -> b -> b) -> b -> TypeCase a -> b # foldr' :: (a -> b -> b) -> b -> TypeCase a -> b # foldl :: (b -> a -> b) -> b -> TypeCase a -> b # foldl' :: (b -> a -> b) -> b -> TypeCase a -> b # foldr1 :: (a -> a -> a) -> TypeCase a -> a # foldl1 :: (a -> a -> a) -> TypeCase a -> a # toList :: TypeCase a -> [a] # null :: TypeCase a -> Bool # length :: TypeCase a -> Int # elem :: Eq a => a -> TypeCase a -> Bool # maximum :: Ord a => TypeCase a -> a # minimum :: Ord a => TypeCase a -> a # sum :: Num a => TypeCase a -> a # product :: Num a => TypeCase a -> a #
Traversable TypeCase Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> TypeCase a -> f (TypeCase b) # sequenceA :: Applicative f => TypeCase (f a) -> f (TypeCase a) # mapM :: Monad m => (a -> m b) -> TypeCase a -> m (TypeCase b) # sequence :: Monad m => TypeCase (m a) -> m (TypeCase a) #
SymbolMatching TypeCase Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy TypeCase -> Node -> Bool showFailure :: Proxy TypeCase -> Node -> String
Unmarshal TypeCase Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (TypeCase a)
Eq a => Eq (TypeCase a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: TypeCase a -> TypeCase a -> Bool # (/=) :: TypeCase a -> TypeCase a -> Bool #
Ord a => Ord (TypeCase a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: TypeCase a -> TypeCase a -> Ordering # (<) :: TypeCase a -> TypeCase a -> Bool # (<=) :: TypeCase a -> TypeCase a -> Bool # (>) :: TypeCase a -> TypeCase a -> Bool # (>=) :: TypeCase a -> TypeCase a -> Bool # max :: TypeCase a -> TypeCase a -> TypeCase a # min :: TypeCase a -> TypeCase a -> TypeCase a #
Show a => Show (TypeCase a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> TypeCase a -> ShowS # show :: TypeCase a -> String # showList :: [TypeCase a] -> ShowS #
Generic (TypeCase a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (TypeCase a) :: Type -> Type # Methods from :: TypeCase a -> Rep (TypeCase a) x # to :: Rep (TypeCase a) x -> TypeCase a #
Generic1 TypeCase Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 TypeCase :: k -> Type # Methods from1 :: forall (a :: k). TypeCase a -> Rep1 TypeCase a # to1 :: forall (a :: k). Rep1 TypeCase a -> TypeCase a #
type Rep (TypeCase a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (TypeCase a) = D1 ('MetaData "TypeCase" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "TypeCase" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NonEmpty ((AnonymousComma :+: Type) a))) :: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Statement a]))))
type Rep1 TypeCase Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 TypeCase = D1 ('MetaData "TypeCase" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "TypeCase" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (NonEmpty :.: Rec1 (AnonymousComma :+: Type)) :: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 Statement))))

data TypeAssertionExpression a Source #

Constructors

TypeAssertionExpression
Fields ann :: a type' :: (Type a) operand :: (Expression a)

Instances

Instances details

Functor TypeAssertionExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> TypeAssertionExpression a -> TypeAssertionExpression b # (<$) :: a -> TypeAssertionExpression b -> TypeAssertionExpression a #
Foldable TypeAssertionExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => TypeAssertionExpression m -> m # foldMap :: Monoid m => (a -> m) -> TypeAssertionExpression a -> m # foldMap' :: Monoid m => (a -> m) -> TypeAssertionExpression a -> m # foldr :: (a -> b -> b) -> b -> TypeAssertionExpression a -> b # foldr' :: (a -> b -> b) -> b -> TypeAssertionExpression a -> b # foldl :: (b -> a -> b) -> b -> TypeAssertionExpression a -> b # foldl' :: (b -> a -> b) -> b -> TypeAssertionExpression a -> b # foldr1 :: (a -> a -> a) -> TypeAssertionExpression a -> a # foldl1 :: (a -> a -> a) -> TypeAssertionExpression a -> a # toList :: TypeAssertionExpression a -> [a] # null :: TypeAssertionExpression a -> Bool # length :: TypeAssertionExpression a -> Int # elem :: Eq a => a -> TypeAssertionExpression a -> Bool # maximum :: Ord a => TypeAssertionExpression a -> a # minimum :: Ord a => TypeAssertionExpression a -> a # sum :: Num a => TypeAssertionExpression a -> a # product :: Num a => TypeAssertionExpression a -> a #
Traversable TypeAssertionExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> TypeAssertionExpression a -> f (TypeAssertionExpression b) # sequenceA :: Applicative f => TypeAssertionExpression (f a) -> f (TypeAssertionExpression a) # mapM :: Monad m => (a -> m b) -> TypeAssertionExpression a -> m (TypeAssertionExpression b) # sequence :: Monad m => TypeAssertionExpression (m a) -> m (TypeAssertionExpression a) #
SymbolMatching TypeAssertionExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy TypeAssertionExpression -> Node -> Bool showFailure :: Proxy TypeAssertionExpression -> Node -> String
Unmarshal TypeAssertionExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (TypeAssertionExpression a)
Eq a => Eq (TypeAssertionExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: TypeAssertionExpression a -> TypeAssertionExpression a -> Bool # (/=) :: TypeAssertionExpression a -> TypeAssertionExpression a -> Bool #
Ord a => Ord (TypeAssertionExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: TypeAssertionExpression a -> TypeAssertionExpression a -> Ordering # (<) :: TypeAssertionExpression a -> TypeAssertionExpression a -> Bool # (<=) :: TypeAssertionExpression a -> TypeAssertionExpression a -> Bool # (>) :: TypeAssertionExpression a -> TypeAssertionExpression a -> Bool # (>=) :: TypeAssertionExpression a -> TypeAssertionExpression a -> Bool # max :: TypeAssertionExpression a -> TypeAssertionExpression a -> TypeAssertionExpression a # min :: TypeAssertionExpression a -> TypeAssertionExpression a -> TypeAssertionExpression a #
Show a => Show (TypeAssertionExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> TypeAssertionExpression a -> ShowS # show :: TypeAssertionExpression a -> String # showList :: [TypeAssertionExpression a] -> ShowS #
Generic (TypeAssertionExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (TypeAssertionExpression a) :: Type -> Type # Methods from :: TypeAssertionExpression a -> Rep (TypeAssertionExpression a) x # to :: Rep (TypeAssertionExpression a) x -> TypeAssertionExpression a #
Generic1 TypeAssertionExpression Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 TypeAssertionExpression :: k -> Type # Methods from1 :: forall (a :: k). TypeAssertionExpression a -> Rep1 TypeAssertionExpression a # to1 :: forall (a :: k). Rep1 TypeAssertionExpression a -> TypeAssertionExpression a #
type Rep (TypeAssertionExpression a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (TypeAssertionExpression a) = D1 ('MetaData "TypeAssertionExpression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "TypeAssertionExpression" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type a)) :: S1 ('MetaSel ('Just "operand") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a)))))
type Rep1 TypeAssertionExpression Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 TypeAssertionExpression = D1 ('MetaData "TypeAssertionExpression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "TypeAssertionExpression" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Type) :: S1 ('MetaSel ('Just "operand") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression))))

data TypeAlias a Source #

Constructors

TypeAlias
Fields ann :: a name :: (TypeIdentifier a) type' :: (Type a)

Instances

Instances details

Functor TypeAlias Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> TypeAlias a -> TypeAlias b # (<$) :: a -> TypeAlias b -> TypeAlias a #
Foldable TypeAlias Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => TypeAlias m -> m # foldMap :: Monoid m => (a -> m) -> TypeAlias a -> m # foldMap' :: Monoid m => (a -> m) -> TypeAlias a -> m # foldr :: (a -> b -> b) -> b -> TypeAlias a -> b # foldr' :: (a -> b -> b) -> b -> TypeAlias a -> b # foldl :: (b -> a -> b) -> b -> TypeAlias a -> b # foldl' :: (b -> a -> b) -> b -> TypeAlias a -> b # foldr1 :: (a -> a -> a) -> TypeAlias a -> a # foldl1 :: (a -> a -> a) -> TypeAlias a -> a # toList :: TypeAlias a -> [a] # null :: TypeAlias a -> Bool # length :: TypeAlias a -> Int # elem :: Eq a => a -> TypeAlias a -> Bool # maximum :: Ord a => TypeAlias a -> a # minimum :: Ord a => TypeAlias a -> a # sum :: Num a => TypeAlias a -> a # product :: Num a => TypeAlias a -> a #
Traversable TypeAlias Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> TypeAlias a -> f (TypeAlias b) # sequenceA :: Applicative f => TypeAlias (f a) -> f (TypeAlias a) # mapM :: Monad m => (a -> m b) -> TypeAlias a -> m (TypeAlias b) # sequence :: Monad m => TypeAlias (m a) -> m (TypeAlias a) #
SymbolMatching TypeAlias Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy TypeAlias -> Node -> Bool showFailure :: Proxy TypeAlias -> Node -> String
Unmarshal TypeAlias Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (TypeAlias a)
Eq a => Eq (TypeAlias a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: TypeAlias a -> TypeAlias a -> Bool # (/=) :: TypeAlias a -> TypeAlias a -> Bool #
Ord a => Ord (TypeAlias a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: TypeAlias a -> TypeAlias a -> Ordering # (<) :: TypeAlias a -> TypeAlias a -> Bool # (<=) :: TypeAlias a -> TypeAlias a -> Bool # (>) :: TypeAlias a -> TypeAlias a -> Bool # (>=) :: TypeAlias a -> TypeAlias a -> Bool # max :: TypeAlias a -> TypeAlias a -> TypeAlias a # min :: TypeAlias a -> TypeAlias a -> TypeAlias a #
Show a => Show (TypeAlias a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> TypeAlias a -> ShowS # show :: TypeAlias a -> String # showList :: [TypeAlias a] -> ShowS #
Generic (TypeAlias a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (TypeAlias a) :: Type -> Type # Methods from :: TypeAlias a -> Rep (TypeAlias a) x # to :: Rep (TypeAlias a) x -> TypeAlias a #
Generic1 TypeAlias Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 TypeAlias :: k -> Type # Methods from1 :: forall (a :: k). TypeAlias a -> Rep1 TypeAlias a # to1 :: forall (a :: k). Rep1 TypeAlias a -> TypeAlias a #
type Rep (TypeAlias a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (TypeAlias a) = D1 ('MetaData "TypeAlias" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "TypeAlias" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (TypeIdentifier a)) :: S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type a)))))
type Rep1 TypeAlias Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 TypeAlias = D1 ('MetaData "TypeAlias" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "TypeAlias" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 TypeIdentifier) :: S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Type))))

data StructType a Source #

Constructors

StructType
Fields ann :: a extraChildren :: (FieldDeclarationList a)

Instances

Instances details

Functor StructType Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> StructType a -> StructType b # (<$) :: a -> StructType b -> StructType a #
Foldable StructType Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => StructType m -> m # foldMap :: Monoid m => (a -> m) -> StructType a -> m # foldMap' :: Monoid m => (a -> m) -> StructType a -> m # foldr :: (a -> b -> b) -> b -> StructType a -> b # foldr' :: (a -> b -> b) -> b -> StructType a -> b # foldl :: (b -> a -> b) -> b -> StructType a -> b # foldl' :: (b -> a -> b) -> b -> StructType a -> b # foldr1 :: (a -> a -> a) -> StructType a -> a # foldl1 :: (a -> a -> a) -> StructType a -> a # toList :: StructType a -> [a] # null :: StructType a -> Bool # length :: StructType a -> Int # elem :: Eq a => a -> StructType a -> Bool # maximum :: Ord a => StructType a -> a # minimum :: Ord a => StructType a -> a # sum :: Num a => StructType a -> a # product :: Num a => StructType a -> a #
Traversable StructType Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> StructType a -> f (StructType b) # sequenceA :: Applicative f => StructType (f a) -> f (StructType a) # mapM :: Monad m => (a -> m b) -> StructType a -> m (StructType b) # sequence :: Monad m => StructType (m a) -> m (StructType a) #
SymbolMatching StructType Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy StructType -> Node -> Bool showFailure :: Proxy StructType -> Node -> String
Unmarshal StructType Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (StructType a)
Eq a => Eq (StructType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: StructType a -> StructType a -> Bool # (/=) :: StructType a -> StructType a -> Bool #
Ord a => Ord (StructType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: StructType a -> StructType a -> Ordering # (<) :: StructType a -> StructType a -> Bool # (<=) :: StructType a -> StructType a -> Bool # (>) :: StructType a -> StructType a -> Bool # (>=) :: StructType a -> StructType a -> Bool # max :: StructType a -> StructType a -> StructType a # min :: StructType a -> StructType a -> StructType a #
Show a => Show (StructType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> StructType a -> ShowS # show :: StructType a -> String # showList :: [StructType a] -> ShowS #
Generic (StructType a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (StructType a) :: Type -> Type # Methods from :: StructType a -> Rep (StructType a) x # to :: Rep (StructType a) x -> StructType a #
Generic1 StructType Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 StructType :: k -> Type # Methods from1 :: forall (a :: k). StructType a -> Rep1 StructType a # to1 :: forall (a :: k). Rep1 StructType a -> StructType a #
type Rep (StructType a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (StructType a) = D1 ('MetaData "StructType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "StructType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (FieldDeclarationList a))))
type Rep1 StructType Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 StructType = D1 ('MetaData "StructType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "StructType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 FieldDeclarationList)))

data SourceFile a Source #

Constructors

SourceFile
Fields ann :: a extraChildren :: ([] ((:+:) ((:+:) ConstDeclaration ((:+:) FunctionDeclaration ImportDeclaration)) ((:+:) ((:+:) MethodDeclaration PackageClause) ((:+:) TypeDeclaration VarDeclaration)) a))

Instances

Instances details

Functor SourceFile Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> SourceFile a -> SourceFile b # (<$) :: a -> SourceFile b -> SourceFile a #
Foldable SourceFile Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => SourceFile m -> m # foldMap :: Monoid m => (a -> m) -> SourceFile a -> m # foldMap' :: Monoid m => (a -> m) -> SourceFile a -> m # foldr :: (a -> b -> b) -> b -> SourceFile a -> b # foldr' :: (a -> b -> b) -> b -> SourceFile a -> b # foldl :: (b -> a -> b) -> b -> SourceFile a -> b # foldl' :: (b -> a -> b) -> b -> SourceFile a -> b # foldr1 :: (a -> a -> a) -> SourceFile a -> a # foldl1 :: (a -> a -> a) -> SourceFile a -> a # toList :: SourceFile a -> [a] # null :: SourceFile a -> Bool # length :: SourceFile a -> Int # elem :: Eq a => a -> SourceFile a -> Bool # maximum :: Ord a => SourceFile a -> a # minimum :: Ord a => SourceFile a -> a # sum :: Num a => SourceFile a -> a # product :: Num a => SourceFile a -> a #
Traversable SourceFile Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> SourceFile a -> f (SourceFile b) # sequenceA :: Applicative f => SourceFile (f a) -> f (SourceFile a) # mapM :: Monad m => (a -> m b) -> SourceFile a -> m (SourceFile b) # sequence :: Monad m => SourceFile (m a) -> m (SourceFile a) #
SymbolMatching SourceFile Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy SourceFile -> Node -> Bool showFailure :: Proxy SourceFile -> Node -> String
Unmarshal SourceFile Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (SourceFile a)
Eq a => Eq (SourceFile a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: SourceFile a -> SourceFile a -> Bool # (/=) :: SourceFile a -> SourceFile a -> Bool #
Ord a => Ord (SourceFile a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: SourceFile a -> SourceFile a -> Ordering # (<) :: SourceFile a -> SourceFile a -> Bool # (<=) :: SourceFile a -> SourceFile a -> Bool # (>) :: SourceFile a -> SourceFile a -> Bool # (>=) :: SourceFile a -> SourceFile a -> Bool # max :: SourceFile a -> SourceFile a -> SourceFile a # min :: SourceFile a -> SourceFile a -> SourceFile a #
Show a => Show (SourceFile a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> SourceFile a -> ShowS # show :: SourceFile a -> String # showList :: [SourceFile a] -> ShowS #
Generic (SourceFile a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (SourceFile a) :: Type -> Type # Methods from :: SourceFile a -> Rep (SourceFile a) x # to :: Rep (SourceFile a) x -> SourceFile a #
Generic1 SourceFile Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 SourceFile :: k -> Type # Methods from1 :: forall (a :: k). SourceFile a -> Rep1 SourceFile a # to1 :: forall (a :: k). Rep1 SourceFile a -> SourceFile a #
type Rep (SourceFile a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (SourceFile a) = D1 ('MetaData "SourceFile" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "SourceFile" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [((ConstDeclaration :+: (FunctionDeclaration :+: ImportDeclaration)) :+: ((MethodDeclaration :+: PackageClause) :+: (TypeDeclaration :+: VarDeclaration))) a])))
type Rep1 SourceFile Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 SourceFile = D1 ('MetaData "SourceFile" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "SourceFile" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 ((ConstDeclaration :+: (FunctionDeclaration :+: ImportDeclaration)) :+: ((MethodDeclaration :+: PackageClause) :+: (TypeDeclaration :+: VarDeclaration))))))

data SliceType a Source #

Constructors

SliceType
Fields ann :: a element :: (Type a)

Instances

Instances details

Functor SliceType Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> SliceType a -> SliceType b # (<$) :: a -> SliceType b -> SliceType a #
Foldable SliceType Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => SliceType m -> m # foldMap :: Monoid m => (a -> m) -> SliceType a -> m # foldMap' :: Monoid m => (a -> m) -> SliceType a -> m # foldr :: (a -> b -> b) -> b -> SliceType a -> b # foldr' :: (a -> b -> b) -> b -> SliceType a -> b # foldl :: (b -> a -> b) -> b -> SliceType a -> b # foldl' :: (b -> a -> b) -> b -> SliceType a -> b # foldr1 :: (a -> a -> a) -> SliceType a -> a # foldl1 :: (a -> a -> a) -> SliceType a -> a # toList :: SliceType a -> [a] # null :: SliceType a -> Bool # length :: SliceType a -> Int # elem :: Eq a => a -> SliceType a -> Bool # maximum :: Ord a => SliceType a -> a # minimum :: Ord a => SliceType a -> a # sum :: Num a => SliceType a -> a # product :: Num a => SliceType a -> a #
Traversable SliceType Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> SliceType a -> f (SliceType b) # sequenceA :: Applicative f => SliceType (f a) -> f (SliceType a) # mapM :: Monad m => (a -> m b) -> SliceType a -> m (SliceType b) # sequence :: Monad m => SliceType (m a) -> m (SliceType a) #
SymbolMatching SliceType Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy SliceType -> Node -> Bool showFailure :: Proxy SliceType -> Node -> String
Unmarshal SliceType Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (SliceType a)
Eq a => Eq (SliceType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: SliceType a -> SliceType a -> Bool # (/=) :: SliceType a -> SliceType a -> Bool #
Ord a => Ord (SliceType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: SliceType a -> SliceType a -> Ordering # (<) :: SliceType a -> SliceType a -> Bool # (<=) :: SliceType a -> SliceType a -> Bool # (>) :: SliceType a -> SliceType a -> Bool # (>=) :: SliceType a -> SliceType a -> Bool # max :: SliceType a -> SliceType a -> SliceType a # min :: SliceType a -> SliceType a -> SliceType a #
Show a => Show (SliceType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> SliceType a -> ShowS # show :: SliceType a -> String # showList :: [SliceType a] -> ShowS #
Generic (SliceType a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (SliceType a) :: Type -> Type # Methods from :: SliceType a -> Rep (SliceType a) x # to :: Rep (SliceType a) x -> SliceType a #
Generic1 SliceType Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 SliceType :: k -> Type # Methods from1 :: forall (a :: k). SliceType a -> Rep1 SliceType a # to1 :: forall (a :: k). Rep1 SliceType a -> SliceType a #
type Rep (SliceType a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (SliceType a) = D1 ('MetaData "SliceType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "SliceType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "element") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type a))))
type Rep1 SliceType Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 SliceType = D1 ('MetaData "SliceType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "SliceType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "element") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Type)))

data SliceExpression a Source #

Constructors

SliceExpression
Fields ann :: a start :: (Maybe (Expression a)) capacity :: (Maybe (Expression a)) end :: (Maybe (Expression a)) operand :: (Expression a)

Instances

Instances details

Functor SliceExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> SliceExpression a -> SliceExpression b # (<$) :: a -> SliceExpression b -> SliceExpression a #
Foldable SliceExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => SliceExpression m -> m # foldMap :: Monoid m => (a -> m) -> SliceExpression a -> m # foldMap' :: Monoid m => (a -> m) -> SliceExpression a -> m # foldr :: (a -> b -> b) -> b -> SliceExpression a -> b # foldr' :: (a -> b -> b) -> b -> SliceExpression a -> b # foldl :: (b -> a -> b) -> b -> SliceExpression a -> b # foldl' :: (b -> a -> b) -> b -> SliceExpression a -> b # foldr1 :: (a -> a -> a) -> SliceExpression a -> a # foldl1 :: (a -> a -> a) -> SliceExpression a -> a # toList :: SliceExpression a -> [a] # null :: SliceExpression a -> Bool # length :: SliceExpression a -> Int # elem :: Eq a => a -> SliceExpression a -> Bool # maximum :: Ord a => SliceExpression a -> a # minimum :: Ord a => SliceExpression a -> a # sum :: Num a => SliceExpression a -> a # product :: Num a => SliceExpression a -> a #
Traversable SliceExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> SliceExpression a -> f (SliceExpression b) # sequenceA :: Applicative f => SliceExpression (f a) -> f (SliceExpression a) # mapM :: Monad m => (a -> m b) -> SliceExpression a -> m (SliceExpression b) # sequence :: Monad m => SliceExpression (m a) -> m (SliceExpression a) #
SymbolMatching SliceExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy SliceExpression -> Node -> Bool showFailure :: Proxy SliceExpression -> Node -> String
Unmarshal SliceExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (SliceExpression a)
Eq a => Eq (SliceExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: SliceExpression a -> SliceExpression a -> Bool # (/=) :: SliceExpression a -> SliceExpression a -> Bool #
Ord a => Ord (SliceExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: SliceExpression a -> SliceExpression a -> Ordering # (<) :: SliceExpression a -> SliceExpression a -> Bool # (<=) :: SliceExpression a -> SliceExpression a -> Bool # (>) :: SliceExpression a -> SliceExpression a -> Bool # (>=) :: SliceExpression a -> SliceExpression a -> Bool # max :: SliceExpression a -> SliceExpression a -> SliceExpression a # min :: SliceExpression a -> SliceExpression a -> SliceExpression a #
Show a => Show (SliceExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> SliceExpression a -> ShowS # show :: SliceExpression a -> String # showList :: [SliceExpression a] -> ShowS #
Generic (SliceExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (SliceExpression a) :: Type -> Type # Methods from :: SliceExpression a -> Rep (SliceExpression a) x # to :: Rep (SliceExpression a) x -> SliceExpression a #
Generic1 SliceExpression Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 SliceExpression :: k -> Type # Methods from1 :: forall (a :: k). SliceExpression a -> Rep1 SliceExpression a # to1 :: forall (a :: k). Rep1 SliceExpression a -> SliceExpression a #
type Rep (SliceExpression a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (SliceExpression a) = D1 ('MetaData "SliceExpression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "SliceExpression" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: S1 ('MetaSel ('Just "start") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Expression a)))) :: (S1 ('MetaSel ('Just "capacity") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Expression a))) :: (S1 ('MetaSel ('Just "end") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Expression a))) :: S1 ('MetaSel ('Just "operand") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a))))))
type Rep1 SliceExpression Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 SliceExpression = D1 ('MetaData "SliceExpression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "SliceExpression" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: S1 ('MetaSel ('Just "start") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 Expression)) :: (S1 ('MetaSel ('Just "capacity") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 Expression) :: (S1 ('MetaSel ('Just "end") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 Expression) :: S1 ('MetaSel ('Just "operand") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression)))))

data ShortVarDeclaration a Source #

Constructors

ShortVarDeclaration
Fields ann :: a left :: (ExpressionList a) right :: (ExpressionList a)

Instances

Instances details

Functor ShortVarDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ShortVarDeclaration a -> ShortVarDeclaration b # (<$) :: a -> ShortVarDeclaration b -> ShortVarDeclaration a #
Foldable ShortVarDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ShortVarDeclaration m -> m # foldMap :: Monoid m => (a -> m) -> ShortVarDeclaration a -> m # foldMap' :: Monoid m => (a -> m) -> ShortVarDeclaration a -> m # foldr :: (a -> b -> b) -> b -> ShortVarDeclaration a -> b # foldr' :: (a -> b -> b) -> b -> ShortVarDeclaration a -> b # foldl :: (b -> a -> b) -> b -> ShortVarDeclaration a -> b # foldl' :: (b -> a -> b) -> b -> ShortVarDeclaration a -> b # foldr1 :: (a -> a -> a) -> ShortVarDeclaration a -> a # foldl1 :: (a -> a -> a) -> ShortVarDeclaration a -> a # toList :: ShortVarDeclaration a -> [a] # null :: ShortVarDeclaration a -> Bool # length :: ShortVarDeclaration a -> Int # elem :: Eq a => a -> ShortVarDeclaration a -> Bool # maximum :: Ord a => ShortVarDeclaration a -> a # minimum :: Ord a => ShortVarDeclaration a -> a # sum :: Num a => ShortVarDeclaration a -> a # product :: Num a => ShortVarDeclaration a -> a #
Traversable ShortVarDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ShortVarDeclaration a -> f (ShortVarDeclaration b) # sequenceA :: Applicative f => ShortVarDeclaration (f a) -> f (ShortVarDeclaration a) # mapM :: Monad m => (a -> m b) -> ShortVarDeclaration a -> m (ShortVarDeclaration b) # sequence :: Monad m => ShortVarDeclaration (m a) -> m (ShortVarDeclaration a) #
SymbolMatching ShortVarDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ShortVarDeclaration -> Node -> Bool showFailure :: Proxy ShortVarDeclaration -> Node -> String
Unmarshal ShortVarDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ShortVarDeclaration a)
Eq a => Eq (ShortVarDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ShortVarDeclaration a -> ShortVarDeclaration a -> Bool # (/=) :: ShortVarDeclaration a -> ShortVarDeclaration a -> Bool #
Ord a => Ord (ShortVarDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ShortVarDeclaration a -> ShortVarDeclaration a -> Ordering # (<) :: ShortVarDeclaration a -> ShortVarDeclaration a -> Bool # (<=) :: ShortVarDeclaration a -> ShortVarDeclaration a -> Bool # (>) :: ShortVarDeclaration a -> ShortVarDeclaration a -> Bool # (>=) :: ShortVarDeclaration a -> ShortVarDeclaration a -> Bool # max :: ShortVarDeclaration a -> ShortVarDeclaration a -> ShortVarDeclaration a # min :: ShortVarDeclaration a -> ShortVarDeclaration a -> ShortVarDeclaration a #
Show a => Show (ShortVarDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ShortVarDeclaration a -> ShowS # show :: ShortVarDeclaration a -> String # showList :: [ShortVarDeclaration a] -> ShowS #
Generic (ShortVarDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ShortVarDeclaration a) :: Type -> Type # Methods from :: ShortVarDeclaration a -> Rep (ShortVarDeclaration a) x # to :: Rep (ShortVarDeclaration a) x -> ShortVarDeclaration a #
Generic1 ShortVarDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ShortVarDeclaration :: k -> Type # Methods from1 :: forall (a :: k). ShortVarDeclaration a -> Rep1 ShortVarDeclaration a # to1 :: forall (a :: k). Rep1 ShortVarDeclaration a -> ShortVarDeclaration a #
type Rep (ShortVarDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ShortVarDeclaration a) = D1 ('MetaData "ShortVarDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ShortVarDeclaration" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "left") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ExpressionList a)) :: S1 ('MetaSel ('Just "right") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ExpressionList a)))))
type Rep1 ShortVarDeclaration Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ShortVarDeclaration = D1 ('MetaData "ShortVarDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ShortVarDeclaration" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "left") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 ExpressionList) :: S1 ('MetaSel ('Just "right") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 ExpressionList))))

data SendStatement a Source #

Constructors

SendStatement
Fields ann :: a value :: (Expression a) channel :: (Expression a)

Instances

Instances details

Functor SendStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> SendStatement a -> SendStatement b # (<$) :: a -> SendStatement b -> SendStatement a #
Foldable SendStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => SendStatement m -> m # foldMap :: Monoid m => (a -> m) -> SendStatement a -> m # foldMap' :: Monoid m => (a -> m) -> SendStatement a -> m # foldr :: (a -> b -> b) -> b -> SendStatement a -> b # foldr' :: (a -> b -> b) -> b -> SendStatement a -> b # foldl :: (b -> a -> b) -> b -> SendStatement a -> b # foldl' :: (b -> a -> b) -> b -> SendStatement a -> b # foldr1 :: (a -> a -> a) -> SendStatement a -> a # foldl1 :: (a -> a -> a) -> SendStatement a -> a # toList :: SendStatement a -> [a] # null :: SendStatement a -> Bool # length :: SendStatement a -> Int # elem :: Eq a => a -> SendStatement a -> Bool # maximum :: Ord a => SendStatement a -> a # minimum :: Ord a => SendStatement a -> a # sum :: Num a => SendStatement a -> a # product :: Num a => SendStatement a -> a #
Traversable SendStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> SendStatement a -> f (SendStatement b) # sequenceA :: Applicative f => SendStatement (f a) -> f (SendStatement a) # mapM :: Monad m => (a -> m b) -> SendStatement a -> m (SendStatement b) # sequence :: Monad m => SendStatement (m a) -> m (SendStatement a) #
SymbolMatching SendStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy SendStatement -> Node -> Bool showFailure :: Proxy SendStatement -> Node -> String
Unmarshal SendStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (SendStatement a)
Eq a => Eq (SendStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: SendStatement a -> SendStatement a -> Bool # (/=) :: SendStatement a -> SendStatement a -> Bool #
Ord a => Ord (SendStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: SendStatement a -> SendStatement a -> Ordering # (<) :: SendStatement a -> SendStatement a -> Bool # (<=) :: SendStatement a -> SendStatement a -> Bool # (>) :: SendStatement a -> SendStatement a -> Bool # (>=) :: SendStatement a -> SendStatement a -> Bool # max :: SendStatement a -> SendStatement a -> SendStatement a # min :: SendStatement a -> SendStatement a -> SendStatement a #
Show a => Show (SendStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> SendStatement a -> ShowS # show :: SendStatement a -> String # showList :: [SendStatement a] -> ShowS #
Generic (SendStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (SendStatement a) :: Type -> Type # Methods from :: SendStatement a -> Rep (SendStatement a) x # to :: Rep (SendStatement a) x -> SendStatement a #
Generic1 SendStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 SendStatement :: k -> Type # Methods from1 :: forall (a :: k). SendStatement a -> Rep1 SendStatement a # to1 :: forall (a :: k). Rep1 SendStatement a -> SendStatement a #
type Rep (SendStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (SendStatement a) = D1 ('MetaData "SendStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "SendStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "value") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a)) :: S1 ('MetaSel ('Just "channel") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a)))))
type Rep1 SendStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 SendStatement = D1 ('MetaData "SendStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "SendStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "value") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression) :: S1 ('MetaSel ('Just "channel") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression))))

data SelectorExpression a Source #

Constructors

SelectorExpression
Fields ann :: a field :: (FieldIdentifier a) operand :: (Expression a)

Instances

Instances details

Functor SelectorExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> SelectorExpression a -> SelectorExpression b # (<$) :: a -> SelectorExpression b -> SelectorExpression a #
Foldable SelectorExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => SelectorExpression m -> m # foldMap :: Monoid m => (a -> m) -> SelectorExpression a -> m # foldMap' :: Monoid m => (a -> m) -> SelectorExpression a -> m # foldr :: (a -> b -> b) -> b -> SelectorExpression a -> b # foldr' :: (a -> b -> b) -> b -> SelectorExpression a -> b # foldl :: (b -> a -> b) -> b -> SelectorExpression a -> b # foldl' :: (b -> a -> b) -> b -> SelectorExpression a -> b # foldr1 :: (a -> a -> a) -> SelectorExpression a -> a # foldl1 :: (a -> a -> a) -> SelectorExpression a -> a # toList :: SelectorExpression a -> [a] # null :: SelectorExpression a -> Bool # length :: SelectorExpression a -> Int # elem :: Eq a => a -> SelectorExpression a -> Bool # maximum :: Ord a => SelectorExpression a -> a # minimum :: Ord a => SelectorExpression a -> a # sum :: Num a => SelectorExpression a -> a # product :: Num a => SelectorExpression a -> a #
Traversable SelectorExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> SelectorExpression a -> f (SelectorExpression b) # sequenceA :: Applicative f => SelectorExpression (f a) -> f (SelectorExpression a) # mapM :: Monad m => (a -> m b) -> SelectorExpression a -> m (SelectorExpression b) # sequence :: Monad m => SelectorExpression (m a) -> m (SelectorExpression a) #
SymbolMatching SelectorExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy SelectorExpression -> Node -> Bool showFailure :: Proxy SelectorExpression -> Node -> String
Unmarshal SelectorExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (SelectorExpression a)
Eq a => Eq (SelectorExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: SelectorExpression a -> SelectorExpression a -> Bool # (/=) :: SelectorExpression a -> SelectorExpression a -> Bool #
Ord a => Ord (SelectorExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: SelectorExpression a -> SelectorExpression a -> Ordering # (<) :: SelectorExpression a -> SelectorExpression a -> Bool # (<=) :: SelectorExpression a -> SelectorExpression a -> Bool # (>) :: SelectorExpression a -> SelectorExpression a -> Bool # (>=) :: SelectorExpression a -> SelectorExpression a -> Bool # max :: SelectorExpression a -> SelectorExpression a -> SelectorExpression a # min :: SelectorExpression a -> SelectorExpression a -> SelectorExpression a #
Show a => Show (SelectorExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> SelectorExpression a -> ShowS # show :: SelectorExpression a -> String # showList :: [SelectorExpression a] -> ShowS #
Generic (SelectorExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (SelectorExpression a) :: Type -> Type # Methods from :: SelectorExpression a -> Rep (SelectorExpression a) x # to :: Rep (SelectorExpression a) x -> SelectorExpression a #
Generic1 SelectorExpression Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 SelectorExpression :: k -> Type # Methods from1 :: forall (a :: k). SelectorExpression a -> Rep1 SelectorExpression a # to1 :: forall (a :: k). Rep1 SelectorExpression a -> SelectorExpression a #
type Rep (SelectorExpression a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (SelectorExpression a) = D1 ('MetaData "SelectorExpression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "SelectorExpression" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "field") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (FieldIdentifier a)) :: S1 ('MetaSel ('Just "operand") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a)))))
type Rep1 SelectorExpression Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 SelectorExpression = D1 ('MetaData "SelectorExpression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "SelectorExpression" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "field") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 FieldIdentifier) :: S1 ('MetaSel ('Just "operand") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression))))

data SelectStatement a Source #

Constructors

SelectStatement
Fields ann :: a extraChildren :: ([] ((:+:) CommunicationCase DefaultCase a))

Instances

Instances details

Functor SelectStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> SelectStatement a -> SelectStatement b # (<$) :: a -> SelectStatement b -> SelectStatement a #
Foldable SelectStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => SelectStatement m -> m # foldMap :: Monoid m => (a -> m) -> SelectStatement a -> m # foldMap' :: Monoid m => (a -> m) -> SelectStatement a -> m # foldr :: (a -> b -> b) -> b -> SelectStatement a -> b # foldr' :: (a -> b -> b) -> b -> SelectStatement a -> b # foldl :: (b -> a -> b) -> b -> SelectStatement a -> b # foldl' :: (b -> a -> b) -> b -> SelectStatement a -> b # foldr1 :: (a -> a -> a) -> SelectStatement a -> a # foldl1 :: (a -> a -> a) -> SelectStatement a -> a # toList :: SelectStatement a -> [a] # null :: SelectStatement a -> Bool # length :: SelectStatement a -> Int # elem :: Eq a => a -> SelectStatement a -> Bool # maximum :: Ord a => SelectStatement a -> a # minimum :: Ord a => SelectStatement a -> a # sum :: Num a => SelectStatement a -> a # product :: Num a => SelectStatement a -> a #
Traversable SelectStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> SelectStatement a -> f (SelectStatement b) # sequenceA :: Applicative f => SelectStatement (f a) -> f (SelectStatement a) # mapM :: Monad m => (a -> m b) -> SelectStatement a -> m (SelectStatement b) # sequence :: Monad m => SelectStatement (m a) -> m (SelectStatement a) #
SymbolMatching SelectStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy SelectStatement -> Node -> Bool showFailure :: Proxy SelectStatement -> Node -> String
Unmarshal SelectStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (SelectStatement a)
Eq a => Eq (SelectStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: SelectStatement a -> SelectStatement a -> Bool # (/=) :: SelectStatement a -> SelectStatement a -> Bool #
Ord a => Ord (SelectStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: SelectStatement a -> SelectStatement a -> Ordering # (<) :: SelectStatement a -> SelectStatement a -> Bool # (<=) :: SelectStatement a -> SelectStatement a -> Bool # (>) :: SelectStatement a -> SelectStatement a -> Bool # (>=) :: SelectStatement a -> SelectStatement a -> Bool # max :: SelectStatement a -> SelectStatement a -> SelectStatement a # min :: SelectStatement a -> SelectStatement a -> SelectStatement a #
Show a => Show (SelectStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> SelectStatement a -> ShowS # show :: SelectStatement a -> String # showList :: [SelectStatement a] -> ShowS #
Generic (SelectStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (SelectStatement a) :: Type -> Type # Methods from :: SelectStatement a -> Rep (SelectStatement a) x # to :: Rep (SelectStatement a) x -> SelectStatement a #
Generic1 SelectStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 SelectStatement :: k -> Type # Methods from1 :: forall (a :: k). SelectStatement a -> Rep1 SelectStatement a # to1 :: forall (a :: k). Rep1 SelectStatement a -> SelectStatement a #
type Rep (SelectStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (SelectStatement a) = D1 ('MetaData "SelectStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "SelectStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(CommunicationCase :+: DefaultCase) a])))
type Rep1 SelectStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 SelectStatement = D1 ('MetaData "SelectStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "SelectStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 (CommunicationCase :+: DefaultCase))))

data ReturnStatement a Source #

Constructors

ReturnStatement
Fields ann :: a extraChildren :: (Maybe (ExpressionList a))

Instances

Instances details

Functor ReturnStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ReturnStatement a -> ReturnStatement b # (<$) :: a -> ReturnStatement b -> ReturnStatement a #
Foldable ReturnStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ReturnStatement m -> m # foldMap :: Monoid m => (a -> m) -> ReturnStatement a -> m # foldMap' :: Monoid m => (a -> m) -> ReturnStatement a -> m # foldr :: (a -> b -> b) -> b -> ReturnStatement a -> b # foldr' :: (a -> b -> b) -> b -> ReturnStatement a -> b # foldl :: (b -> a -> b) -> b -> ReturnStatement a -> b # foldl' :: (b -> a -> b) -> b -> ReturnStatement a -> b # foldr1 :: (a -> a -> a) -> ReturnStatement a -> a # foldl1 :: (a -> a -> a) -> ReturnStatement a -> a # toList :: ReturnStatement a -> [a] # null :: ReturnStatement a -> Bool # length :: ReturnStatement a -> Int # elem :: Eq a => a -> ReturnStatement a -> Bool # maximum :: Ord a => ReturnStatement a -> a # minimum :: Ord a => ReturnStatement a -> a # sum :: Num a => ReturnStatement a -> a # product :: Num a => ReturnStatement a -> a #
Traversable ReturnStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ReturnStatement a -> f (ReturnStatement b) # sequenceA :: Applicative f => ReturnStatement (f a) -> f (ReturnStatement a) # mapM :: Monad m => (a -> m b) -> ReturnStatement a -> m (ReturnStatement b) # sequence :: Monad m => ReturnStatement (m a) -> m (ReturnStatement a) #
SymbolMatching ReturnStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ReturnStatement -> Node -> Bool showFailure :: Proxy ReturnStatement -> Node -> String
Unmarshal ReturnStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ReturnStatement a)
Eq a => Eq (ReturnStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ReturnStatement a -> ReturnStatement a -> Bool # (/=) :: ReturnStatement a -> ReturnStatement a -> Bool #
Ord a => Ord (ReturnStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ReturnStatement a -> ReturnStatement a -> Ordering # (<) :: ReturnStatement a -> ReturnStatement a -> Bool # (<=) :: ReturnStatement a -> ReturnStatement a -> Bool # (>) :: ReturnStatement a -> ReturnStatement a -> Bool # (>=) :: ReturnStatement a -> ReturnStatement a -> Bool # max :: ReturnStatement a -> ReturnStatement a -> ReturnStatement a # min :: ReturnStatement a -> ReturnStatement a -> ReturnStatement a #
Show a => Show (ReturnStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ReturnStatement a -> ShowS # show :: ReturnStatement a -> String # showList :: [ReturnStatement a] -> ShowS #
Generic (ReturnStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ReturnStatement a) :: Type -> Type # Methods from :: ReturnStatement a -> Rep (ReturnStatement a) x # to :: Rep (ReturnStatement a) x -> ReturnStatement a #
Generic1 ReturnStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ReturnStatement :: k -> Type # Methods from1 :: forall (a :: k). ReturnStatement a -> Rep1 ReturnStatement a # to1 :: forall (a :: k). Rep1 ReturnStatement a -> ReturnStatement a #
type Rep (ReturnStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ReturnStatement a) = D1 ('MetaData "ReturnStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ReturnStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (ExpressionList a)))))
type Rep1 ReturnStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ReturnStatement = D1 ('MetaData "ReturnStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ReturnStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 ExpressionList)))

data ReceiveStatement a Source #

Constructors

ReceiveStatement
Fields ann :: a left :: (Maybe (ExpressionList a)) right :: (Expression a)

Instances

Instances details

Functor ReceiveStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ReceiveStatement a -> ReceiveStatement b # (<$) :: a -> ReceiveStatement b -> ReceiveStatement a #
Foldable ReceiveStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ReceiveStatement m -> m # foldMap :: Monoid m => (a -> m) -> ReceiveStatement a -> m # foldMap' :: Monoid m => (a -> m) -> ReceiveStatement a -> m # foldr :: (a -> b -> b) -> b -> ReceiveStatement a -> b # foldr' :: (a -> b -> b) -> b -> ReceiveStatement a -> b # foldl :: (b -> a -> b) -> b -> ReceiveStatement a -> b # foldl' :: (b -> a -> b) -> b -> ReceiveStatement a -> b # foldr1 :: (a -> a -> a) -> ReceiveStatement a -> a # foldl1 :: (a -> a -> a) -> ReceiveStatement a -> a # toList :: ReceiveStatement a -> [a] # null :: ReceiveStatement a -> Bool # length :: ReceiveStatement a -> Int # elem :: Eq a => a -> ReceiveStatement a -> Bool # maximum :: Ord a => ReceiveStatement a -> a # minimum :: Ord a => ReceiveStatement a -> a # sum :: Num a => ReceiveStatement a -> a # product :: Num a => ReceiveStatement a -> a #
Traversable ReceiveStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ReceiveStatement a -> f (ReceiveStatement b) # sequenceA :: Applicative f => ReceiveStatement (f a) -> f (ReceiveStatement a) # mapM :: Monad m => (a -> m b) -> ReceiveStatement a -> m (ReceiveStatement b) # sequence :: Monad m => ReceiveStatement (m a) -> m (ReceiveStatement a) #
SymbolMatching ReceiveStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ReceiveStatement -> Node -> Bool showFailure :: Proxy ReceiveStatement -> Node -> String
Unmarshal ReceiveStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ReceiveStatement a)
Eq a => Eq (ReceiveStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ReceiveStatement a -> ReceiveStatement a -> Bool # (/=) :: ReceiveStatement a -> ReceiveStatement a -> Bool #
Ord a => Ord (ReceiveStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ReceiveStatement a -> ReceiveStatement a -> Ordering # (<) :: ReceiveStatement a -> ReceiveStatement a -> Bool # (<=) :: ReceiveStatement a -> ReceiveStatement a -> Bool # (>) :: ReceiveStatement a -> ReceiveStatement a -> Bool # (>=) :: ReceiveStatement a -> ReceiveStatement a -> Bool # max :: ReceiveStatement a -> ReceiveStatement a -> ReceiveStatement a # min :: ReceiveStatement a -> ReceiveStatement a -> ReceiveStatement a #
Show a => Show (ReceiveStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ReceiveStatement a -> ShowS # show :: ReceiveStatement a -> String # showList :: [ReceiveStatement a] -> ShowS #
Generic (ReceiveStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ReceiveStatement a) :: Type -> Type # Methods from :: ReceiveStatement a -> Rep (ReceiveStatement a) x # to :: Rep (ReceiveStatement a) x -> ReceiveStatement a #
Generic1 ReceiveStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ReceiveStatement :: k -> Type # Methods from1 :: forall (a :: k). ReceiveStatement a -> Rep1 ReceiveStatement a # to1 :: forall (a :: k). Rep1 ReceiveStatement a -> ReceiveStatement a #
type Rep (ReceiveStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ReceiveStatement a) = D1 ('MetaData "ReceiveStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ReceiveStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "left") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (ExpressionList a))) :: S1 ('MetaSel ('Just "right") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a)))))
type Rep1 ReceiveStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ReceiveStatement = D1 ('MetaData "ReceiveStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ReceiveStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "left") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 ExpressionList) :: S1 ('MetaSel ('Just "right") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression))))

data RangeClause a Source #

Constructors

RangeClause
Fields ann :: a left :: (Maybe (ExpressionList a)) right :: (Expression a)

Instances

Instances details

Functor RangeClause Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> RangeClause a -> RangeClause b # (<$) :: a -> RangeClause b -> RangeClause a #
Foldable RangeClause Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => RangeClause m -> m # foldMap :: Monoid m => (a -> m) -> RangeClause a -> m # foldMap' :: Monoid m => (a -> m) -> RangeClause a -> m # foldr :: (a -> b -> b) -> b -> RangeClause a -> b # foldr' :: (a -> b -> b) -> b -> RangeClause a -> b # foldl :: (b -> a -> b) -> b -> RangeClause a -> b # foldl' :: (b -> a -> b) -> b -> RangeClause a -> b # foldr1 :: (a -> a -> a) -> RangeClause a -> a # foldl1 :: (a -> a -> a) -> RangeClause a -> a # toList :: RangeClause a -> [a] # null :: RangeClause a -> Bool # length :: RangeClause a -> Int # elem :: Eq a => a -> RangeClause a -> Bool # maximum :: Ord a => RangeClause a -> a # minimum :: Ord a => RangeClause a -> a # sum :: Num a => RangeClause a -> a # product :: Num a => RangeClause a -> a #
Traversable RangeClause Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> RangeClause a -> f (RangeClause b) # sequenceA :: Applicative f => RangeClause (f a) -> f (RangeClause a) # mapM :: Monad m => (a -> m b) -> RangeClause a -> m (RangeClause b) # sequence :: Monad m => RangeClause (m a) -> m (RangeClause a) #
SymbolMatching RangeClause Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy RangeClause -> Node -> Bool showFailure :: Proxy RangeClause -> Node -> String
Unmarshal RangeClause Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (RangeClause a)
Eq a => Eq (RangeClause a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: RangeClause a -> RangeClause a -> Bool # (/=) :: RangeClause a -> RangeClause a -> Bool #
Ord a => Ord (RangeClause a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: RangeClause a -> RangeClause a -> Ordering # (<) :: RangeClause a -> RangeClause a -> Bool # (<=) :: RangeClause a -> RangeClause a -> Bool # (>) :: RangeClause a -> RangeClause a -> Bool # (>=) :: RangeClause a -> RangeClause a -> Bool # max :: RangeClause a -> RangeClause a -> RangeClause a # min :: RangeClause a -> RangeClause a -> RangeClause a #
Show a => Show (RangeClause a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> RangeClause a -> ShowS # show :: RangeClause a -> String # showList :: [RangeClause a] -> ShowS #
Generic (RangeClause a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (RangeClause a) :: Type -> Type # Methods from :: RangeClause a -> Rep (RangeClause a) x # to :: Rep (RangeClause a) x -> RangeClause a #
Generic1 RangeClause Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 RangeClause :: k -> Type # Methods from1 :: forall (a :: k). RangeClause a -> Rep1 RangeClause a # to1 :: forall (a :: k). Rep1 RangeClause a -> RangeClause a #
type Rep (RangeClause a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (RangeClause a) = D1 ('MetaData "RangeClause" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "RangeClause" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "left") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (ExpressionList a))) :: S1 ('MetaSel ('Just "right") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a)))))
type Rep1 RangeClause Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 RangeClause = D1 ('MetaData "RangeClause" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "RangeClause" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "left") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 ExpressionList) :: S1 ('MetaSel ('Just "right") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression))))

data QualifiedType a Source #

Constructors

QualifiedType
Fields ann :: a name :: (TypeIdentifier a) package :: (PackageIdentifier a)

Instances

Instances details

Functor QualifiedType Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> QualifiedType a -> QualifiedType b # (<$) :: a -> QualifiedType b -> QualifiedType a #
Foldable QualifiedType Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => QualifiedType m -> m # foldMap :: Monoid m => (a -> m) -> QualifiedType a -> m # foldMap' :: Monoid m => (a -> m) -> QualifiedType a -> m # foldr :: (a -> b -> b) -> b -> QualifiedType a -> b # foldr' :: (a -> b -> b) -> b -> QualifiedType a -> b # foldl :: (b -> a -> b) -> b -> QualifiedType a -> b # foldl' :: (b -> a -> b) -> b -> QualifiedType a -> b # foldr1 :: (a -> a -> a) -> QualifiedType a -> a # foldl1 :: (a -> a -> a) -> QualifiedType a -> a # toList :: QualifiedType a -> [a] # null :: QualifiedType a -> Bool # length :: QualifiedType a -> Int # elem :: Eq a => a -> QualifiedType a -> Bool # maximum :: Ord a => QualifiedType a -> a # minimum :: Ord a => QualifiedType a -> a # sum :: Num a => QualifiedType a -> a # product :: Num a => QualifiedType a -> a #
Traversable QualifiedType Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> QualifiedType a -> f (QualifiedType b) # sequenceA :: Applicative f => QualifiedType (f a) -> f (QualifiedType a) # mapM :: Monad m => (a -> m b) -> QualifiedType a -> m (QualifiedType b) # sequence :: Monad m => QualifiedType (m a) -> m (QualifiedType a) #
SymbolMatching QualifiedType Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy QualifiedType -> Node -> Bool showFailure :: Proxy QualifiedType -> Node -> String
Unmarshal QualifiedType Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (QualifiedType a)
Eq a => Eq (QualifiedType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: QualifiedType a -> QualifiedType a -> Bool # (/=) :: QualifiedType a -> QualifiedType a -> Bool #
Ord a => Ord (QualifiedType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: QualifiedType a -> QualifiedType a -> Ordering # (<) :: QualifiedType a -> QualifiedType a -> Bool # (<=) :: QualifiedType a -> QualifiedType a -> Bool # (>) :: QualifiedType a -> QualifiedType a -> Bool # (>=) :: QualifiedType a -> QualifiedType a -> Bool # max :: QualifiedType a -> QualifiedType a -> QualifiedType a # min :: QualifiedType a -> QualifiedType a -> QualifiedType a #
Show a => Show (QualifiedType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> QualifiedType a -> ShowS # show :: QualifiedType a -> String # showList :: [QualifiedType a] -> ShowS #
Generic (QualifiedType a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (QualifiedType a) :: Type -> Type # Methods from :: QualifiedType a -> Rep (QualifiedType a) x # to :: Rep (QualifiedType a) x -> QualifiedType a #
Generic1 QualifiedType Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 QualifiedType :: k -> Type # Methods from1 :: forall (a :: k). QualifiedType a -> Rep1 QualifiedType a # to1 :: forall (a :: k). Rep1 QualifiedType a -> QualifiedType a #
type Rep (QualifiedType a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (QualifiedType a) = D1 ('MetaData "QualifiedType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "QualifiedType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (TypeIdentifier a)) :: S1 ('MetaSel ('Just "package") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (PackageIdentifier a)))))
type Rep1 QualifiedType Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 QualifiedType = D1 ('MetaData "QualifiedType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "QualifiedType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 TypeIdentifier) :: S1 ('MetaSel ('Just "package") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 PackageIdentifier))))

data PointerType a Source #

Constructors

PointerType
Fields ann :: a extraChildren :: (Type a)

Instances

Instances details

Functor PointerType Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> PointerType a -> PointerType b # (<$) :: a -> PointerType b -> PointerType a #
Foldable PointerType Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => PointerType m -> m # foldMap :: Monoid m => (a -> m) -> PointerType a -> m # foldMap' :: Monoid m => (a -> m) -> PointerType a -> m # foldr :: (a -> b -> b) -> b -> PointerType a -> b # foldr' :: (a -> b -> b) -> b -> PointerType a -> b # foldl :: (b -> a -> b) -> b -> PointerType a -> b # foldl' :: (b -> a -> b) -> b -> PointerType a -> b # foldr1 :: (a -> a -> a) -> PointerType a -> a # foldl1 :: (a -> a -> a) -> PointerType a -> a # toList :: PointerType a -> [a] # null :: PointerType a -> Bool # length :: PointerType a -> Int # elem :: Eq a => a -> PointerType a -> Bool # maximum :: Ord a => PointerType a -> a # minimum :: Ord a => PointerType a -> a # sum :: Num a => PointerType a -> a # product :: Num a => PointerType a -> a #
Traversable PointerType Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> PointerType a -> f (PointerType b) # sequenceA :: Applicative f => PointerType (f a) -> f (PointerType a) # mapM :: Monad m => (a -> m b) -> PointerType a -> m (PointerType b) # sequence :: Monad m => PointerType (m a) -> m (PointerType a) #
SymbolMatching PointerType Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy PointerType -> Node -> Bool showFailure :: Proxy PointerType -> Node -> String
Unmarshal PointerType Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (PointerType a)
Eq a => Eq (PointerType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: PointerType a -> PointerType a -> Bool # (/=) :: PointerType a -> PointerType a -> Bool #
Ord a => Ord (PointerType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: PointerType a -> PointerType a -> Ordering # (<) :: PointerType a -> PointerType a -> Bool # (<=) :: PointerType a -> PointerType a -> Bool # (>) :: PointerType a -> PointerType a -> Bool # (>=) :: PointerType a -> PointerType a -> Bool # max :: PointerType a -> PointerType a -> PointerType a # min :: PointerType a -> PointerType a -> PointerType a #
Show a => Show (PointerType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> PointerType a -> ShowS # show :: PointerType a -> String # showList :: [PointerType a] -> ShowS #
Generic (PointerType a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (PointerType a) :: Type -> Type # Methods from :: PointerType a -> Rep (PointerType a) x # to :: Rep (PointerType a) x -> PointerType a #
Generic1 PointerType Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 PointerType :: k -> Type # Methods from1 :: forall (a :: k). PointerType a -> Rep1 PointerType a # to1 :: forall (a :: k). Rep1 PointerType a -> PointerType a #
type Rep (PointerType a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (PointerType a) = D1 ('MetaData "PointerType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "PointerType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type a))))
type Rep1 PointerType Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 PointerType = D1 ('MetaData "PointerType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "PointerType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Type)))

data ParenthesizedType a Source #

Constructors

ParenthesizedType
Fields ann :: a extraChildren :: (Type a)

Instances

Instances details

Functor ParenthesizedType Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ParenthesizedType a -> ParenthesizedType b # (<$) :: a -> ParenthesizedType b -> ParenthesizedType a #
Foldable ParenthesizedType Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ParenthesizedType m -> m # foldMap :: Monoid m => (a -> m) -> ParenthesizedType a -> m # foldMap' :: Monoid m => (a -> m) -> ParenthesizedType a -> m # foldr :: (a -> b -> b) -> b -> ParenthesizedType a -> b # foldr' :: (a -> b -> b) -> b -> ParenthesizedType a -> b # foldl :: (b -> a -> b) -> b -> ParenthesizedType a -> b # foldl' :: (b -> a -> b) -> b -> ParenthesizedType a -> b # foldr1 :: (a -> a -> a) -> ParenthesizedType a -> a # foldl1 :: (a -> a -> a) -> ParenthesizedType a -> a # toList :: ParenthesizedType a -> [a] # null :: ParenthesizedType a -> Bool # length :: ParenthesizedType a -> Int # elem :: Eq a => a -> ParenthesizedType a -> Bool # maximum :: Ord a => ParenthesizedType a -> a # minimum :: Ord a => ParenthesizedType a -> a # sum :: Num a => ParenthesizedType a -> a # product :: Num a => ParenthesizedType a -> a #
Traversable ParenthesizedType Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ParenthesizedType a -> f (ParenthesizedType b) # sequenceA :: Applicative f => ParenthesizedType (f a) -> f (ParenthesizedType a) # mapM :: Monad m => (a -> m b) -> ParenthesizedType a -> m (ParenthesizedType b) # sequence :: Monad m => ParenthesizedType (m a) -> m (ParenthesizedType a) #
SymbolMatching ParenthesizedType Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ParenthesizedType -> Node -> Bool showFailure :: Proxy ParenthesizedType -> Node -> String
Unmarshal ParenthesizedType Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ParenthesizedType a)
Eq a => Eq (ParenthesizedType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ParenthesizedType a -> ParenthesizedType a -> Bool # (/=) :: ParenthesizedType a -> ParenthesizedType a -> Bool #
Ord a => Ord (ParenthesizedType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ParenthesizedType a -> ParenthesizedType a -> Ordering # (<) :: ParenthesizedType a -> ParenthesizedType a -> Bool # (<=) :: ParenthesizedType a -> ParenthesizedType a -> Bool # (>) :: ParenthesizedType a -> ParenthesizedType a -> Bool # (>=) :: ParenthesizedType a -> ParenthesizedType a -> Bool # max :: ParenthesizedType a -> ParenthesizedType a -> ParenthesizedType a # min :: ParenthesizedType a -> ParenthesizedType a -> ParenthesizedType a #
Show a => Show (ParenthesizedType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ParenthesizedType a -> ShowS # show :: ParenthesizedType a -> String # showList :: [ParenthesizedType a] -> ShowS #
Generic (ParenthesizedType a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ParenthesizedType a) :: Type -> Type # Methods from :: ParenthesizedType a -> Rep (ParenthesizedType a) x # to :: Rep (ParenthesizedType a) x -> ParenthesizedType a #
Generic1 ParenthesizedType Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ParenthesizedType :: k -> Type # Methods from1 :: forall (a :: k). ParenthesizedType a -> Rep1 ParenthesizedType a # to1 :: forall (a :: k). Rep1 ParenthesizedType a -> ParenthesizedType a #
type Rep (ParenthesizedType a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ParenthesizedType a) = D1 ('MetaData "ParenthesizedType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ParenthesizedType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type a))))
type Rep1 ParenthesizedType Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ParenthesizedType = D1 ('MetaData "ParenthesizedType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ParenthesizedType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Type)))

data ParenthesizedExpression a Source #

Constructors

ParenthesizedExpression
Fields ann :: a extraChildren :: (Expression a)

Instances

Instances details

Functor ParenthesizedExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ParenthesizedExpression a -> ParenthesizedExpression b # (<$) :: a -> ParenthesizedExpression b -> ParenthesizedExpression a #
Foldable ParenthesizedExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ParenthesizedExpression m -> m # foldMap :: Monoid m => (a -> m) -> ParenthesizedExpression a -> m # foldMap' :: Monoid m => (a -> m) -> ParenthesizedExpression a -> m # foldr :: (a -> b -> b) -> b -> ParenthesizedExpression a -> b # foldr' :: (a -> b -> b) -> b -> ParenthesizedExpression a -> b # foldl :: (b -> a -> b) -> b -> ParenthesizedExpression a -> b # foldl' :: (b -> a -> b) -> b -> ParenthesizedExpression a -> b # foldr1 :: (a -> a -> a) -> ParenthesizedExpression a -> a # foldl1 :: (a -> a -> a) -> ParenthesizedExpression a -> a # toList :: ParenthesizedExpression a -> [a] # null :: ParenthesizedExpression a -> Bool # length :: ParenthesizedExpression a -> Int # elem :: Eq a => a -> ParenthesizedExpression a -> Bool # maximum :: Ord a => ParenthesizedExpression a -> a # minimum :: Ord a => ParenthesizedExpression a -> a # sum :: Num a => ParenthesizedExpression a -> a # product :: Num a => ParenthesizedExpression a -> a #
Traversable ParenthesizedExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ParenthesizedExpression a -> f (ParenthesizedExpression b) # sequenceA :: Applicative f => ParenthesizedExpression (f a) -> f (ParenthesizedExpression a) # mapM :: Monad m => (a -> m b) -> ParenthesizedExpression a -> m (ParenthesizedExpression b) # sequence :: Monad m => ParenthesizedExpression (m a) -> m (ParenthesizedExpression a) #
SymbolMatching ParenthesizedExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ParenthesizedExpression -> Node -> Bool showFailure :: Proxy ParenthesizedExpression -> Node -> String
Unmarshal ParenthesizedExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ParenthesizedExpression a)
Eq a => Eq (ParenthesizedExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ParenthesizedExpression a -> ParenthesizedExpression a -> Bool # (/=) :: ParenthesizedExpression a -> ParenthesizedExpression a -> Bool #
Ord a => Ord (ParenthesizedExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ParenthesizedExpression a -> ParenthesizedExpression a -> Ordering # (<) :: ParenthesizedExpression a -> ParenthesizedExpression a -> Bool # (<=) :: ParenthesizedExpression a -> ParenthesizedExpression a -> Bool # (>) :: ParenthesizedExpression a -> ParenthesizedExpression a -> Bool # (>=) :: ParenthesizedExpression a -> ParenthesizedExpression a -> Bool # max :: ParenthesizedExpression a -> ParenthesizedExpression a -> ParenthesizedExpression a # min :: ParenthesizedExpression a -> ParenthesizedExpression a -> ParenthesizedExpression a #
Show a => Show (ParenthesizedExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ParenthesizedExpression a -> ShowS # show :: ParenthesizedExpression a -> String # showList :: [ParenthesizedExpression a] -> ShowS #
Generic (ParenthesizedExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ParenthesizedExpression a) :: Type -> Type # Methods from :: ParenthesizedExpression a -> Rep (ParenthesizedExpression a) x # to :: Rep (ParenthesizedExpression a) x -> ParenthesizedExpression a #
Generic1 ParenthesizedExpression Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ParenthesizedExpression :: k -> Type # Methods from1 :: forall (a :: k). ParenthesizedExpression a -> Rep1 ParenthesizedExpression a # to1 :: forall (a :: k). Rep1 ParenthesizedExpression a -> ParenthesizedExpression a #
type Rep (ParenthesizedExpression a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ParenthesizedExpression a) = D1 ('MetaData "ParenthesizedExpression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ParenthesizedExpression" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a))))
type Rep1 ParenthesizedExpression Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ParenthesizedExpression = D1 ('MetaData "ParenthesizedExpression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ParenthesizedExpression" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression)))

data ParameterList a Source #

Constructors

ParameterList
Fields ann :: a extraChildren :: ([] ((:+:) ParameterDeclaration VariadicParameterDeclaration a))

Instances

Instances details

Functor ParameterList Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ParameterList a -> ParameterList b # (<$) :: a -> ParameterList b -> ParameterList a #
Foldable ParameterList Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ParameterList m -> m # foldMap :: Monoid m => (a -> m) -> ParameterList a -> m # foldMap' :: Monoid m => (a -> m) -> ParameterList a -> m # foldr :: (a -> b -> b) -> b -> ParameterList a -> b # foldr' :: (a -> b -> b) -> b -> ParameterList a -> b # foldl :: (b -> a -> b) -> b -> ParameterList a -> b # foldl' :: (b -> a -> b) -> b -> ParameterList a -> b # foldr1 :: (a -> a -> a) -> ParameterList a -> a # foldl1 :: (a -> a -> a) -> ParameterList a -> a # toList :: ParameterList a -> [a] # null :: ParameterList a -> Bool # length :: ParameterList a -> Int # elem :: Eq a => a -> ParameterList a -> Bool # maximum :: Ord a => ParameterList a -> a # minimum :: Ord a => ParameterList a -> a # sum :: Num a => ParameterList a -> a # product :: Num a => ParameterList a -> a #
Traversable ParameterList Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ParameterList a -> f (ParameterList b) # sequenceA :: Applicative f => ParameterList (f a) -> f (ParameterList a) # mapM :: Monad m => (a -> m b) -> ParameterList a -> m (ParameterList b) # sequence :: Monad m => ParameterList (m a) -> m (ParameterList a) #
SymbolMatching ParameterList Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ParameterList -> Node -> Bool showFailure :: Proxy ParameterList -> Node -> String
Unmarshal ParameterList Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ParameterList a)
Eq a => Eq (ParameterList a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ParameterList a -> ParameterList a -> Bool # (/=) :: ParameterList a -> ParameterList a -> Bool #
Ord a => Ord (ParameterList a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ParameterList a -> ParameterList a -> Ordering # (<) :: ParameterList a -> ParameterList a -> Bool # (<=) :: ParameterList a -> ParameterList a -> Bool # (>) :: ParameterList a -> ParameterList a -> Bool # (>=) :: ParameterList a -> ParameterList a -> Bool # max :: ParameterList a -> ParameterList a -> ParameterList a # min :: ParameterList a -> ParameterList a -> ParameterList a #
Show a => Show (ParameterList a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ParameterList a -> ShowS # show :: ParameterList a -> String # showList :: [ParameterList a] -> ShowS #
Generic (ParameterList a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ParameterList a) :: Type -> Type # Methods from :: ParameterList a -> Rep (ParameterList a) x # to :: Rep (ParameterList a) x -> ParameterList a #
Generic1 ParameterList Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ParameterList :: k -> Type # Methods from1 :: forall (a :: k). ParameterList a -> Rep1 ParameterList a # to1 :: forall (a :: k). Rep1 ParameterList a -> ParameterList a #
type Rep (ParameterList a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ParameterList a) = D1 ('MetaData "ParameterList" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ParameterList" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(ParameterDeclaration :+: VariadicParameterDeclaration) a])))
type Rep1 ParameterList Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ParameterList = D1 ('MetaData "ParameterList" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ParameterList" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 (ParameterDeclaration :+: VariadicParameterDeclaration))))

data ParameterDeclaration a Source #

Constructors

ParameterDeclaration
Fields ann :: a name :: ([] ((:+:) AnonymousComma Identifier a)) type' :: (Type a)

Instances

Instances details

Functor ParameterDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ParameterDeclaration a -> ParameterDeclaration b # (<$) :: a -> ParameterDeclaration b -> ParameterDeclaration a #
Foldable ParameterDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ParameterDeclaration m -> m # foldMap :: Monoid m => (a -> m) -> ParameterDeclaration a -> m # foldMap' :: Monoid m => (a -> m) -> ParameterDeclaration a -> m # foldr :: (a -> b -> b) -> b -> ParameterDeclaration a -> b # foldr' :: (a -> b -> b) -> b -> ParameterDeclaration a -> b # foldl :: (b -> a -> b) -> b -> ParameterDeclaration a -> b # foldl' :: (b -> a -> b) -> b -> ParameterDeclaration a -> b # foldr1 :: (a -> a -> a) -> ParameterDeclaration a -> a # foldl1 :: (a -> a -> a) -> ParameterDeclaration a -> a # toList :: ParameterDeclaration a -> [a] # null :: ParameterDeclaration a -> Bool # length :: ParameterDeclaration a -> Int # elem :: Eq a => a -> ParameterDeclaration a -> Bool # maximum :: Ord a => ParameterDeclaration a -> a # minimum :: Ord a => ParameterDeclaration a -> a # sum :: Num a => ParameterDeclaration a -> a # product :: Num a => ParameterDeclaration a -> a #
Traversable ParameterDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ParameterDeclaration a -> f (ParameterDeclaration b) # sequenceA :: Applicative f => ParameterDeclaration (f a) -> f (ParameterDeclaration a) # mapM :: Monad m => (a -> m b) -> ParameterDeclaration a -> m (ParameterDeclaration b) # sequence :: Monad m => ParameterDeclaration (m a) -> m (ParameterDeclaration a) #
SymbolMatching ParameterDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ParameterDeclaration -> Node -> Bool showFailure :: Proxy ParameterDeclaration -> Node -> String
Unmarshal ParameterDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ParameterDeclaration a)
Eq a => Eq (ParameterDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ParameterDeclaration a -> ParameterDeclaration a -> Bool # (/=) :: ParameterDeclaration a -> ParameterDeclaration a -> Bool #
Ord a => Ord (ParameterDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ParameterDeclaration a -> ParameterDeclaration a -> Ordering # (<) :: ParameterDeclaration a -> ParameterDeclaration a -> Bool # (<=) :: ParameterDeclaration a -> ParameterDeclaration a -> Bool # (>) :: ParameterDeclaration a -> ParameterDeclaration a -> Bool # (>=) :: ParameterDeclaration a -> ParameterDeclaration a -> Bool # max :: ParameterDeclaration a -> ParameterDeclaration a -> ParameterDeclaration a # min :: ParameterDeclaration a -> ParameterDeclaration a -> ParameterDeclaration a #
Show a => Show (ParameterDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ParameterDeclaration a -> ShowS # show :: ParameterDeclaration a -> String # showList :: [ParameterDeclaration a] -> ShowS #
Generic (ParameterDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ParameterDeclaration a) :: Type -> Type # Methods from :: ParameterDeclaration a -> Rep (ParameterDeclaration a) x # to :: Rep (ParameterDeclaration a) x -> ParameterDeclaration a #
Generic1 ParameterDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ParameterDeclaration :: k -> Type # Methods from1 :: forall (a :: k). ParameterDeclaration a -> Rep1 ParameterDeclaration a # to1 :: forall (a :: k). Rep1 ParameterDeclaration a -> ParameterDeclaration a #
type Rep (ParameterDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ParameterDeclaration a) = D1 ('MetaData "ParameterDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ParameterDeclaration" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(AnonymousComma :+: Identifier) a]) :: S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type a)))))
type Rep1 ParameterDeclaration Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ParameterDeclaration = D1 ('MetaData "ParameterDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ParameterDeclaration" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 (AnonymousComma :+: Identifier)) :: S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Type))))

data PackageClause a Source #

Constructors

PackageClause
Fields ann :: a extraChildren :: (PackageIdentifier a)

Instances

Instances details

Functor PackageClause Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> PackageClause a -> PackageClause b # (<$) :: a -> PackageClause b -> PackageClause a #
Foldable PackageClause Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => PackageClause m -> m # foldMap :: Monoid m => (a -> m) -> PackageClause a -> m # foldMap' :: Monoid m => (a -> m) -> PackageClause a -> m # foldr :: (a -> b -> b) -> b -> PackageClause a -> b # foldr' :: (a -> b -> b) -> b -> PackageClause a -> b # foldl :: (b -> a -> b) -> b -> PackageClause a -> b # foldl' :: (b -> a -> b) -> b -> PackageClause a -> b # foldr1 :: (a -> a -> a) -> PackageClause a -> a # foldl1 :: (a -> a -> a) -> PackageClause a -> a # toList :: PackageClause a -> [a] # null :: PackageClause a -> Bool # length :: PackageClause a -> Int # elem :: Eq a => a -> PackageClause a -> Bool # maximum :: Ord a => PackageClause a -> a # minimum :: Ord a => PackageClause a -> a # sum :: Num a => PackageClause a -> a # product :: Num a => PackageClause a -> a #
Traversable PackageClause Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> PackageClause a -> f (PackageClause b) # sequenceA :: Applicative f => PackageClause (f a) -> f (PackageClause a) # mapM :: Monad m => (a -> m b) -> PackageClause a -> m (PackageClause b) # sequence :: Monad m => PackageClause (m a) -> m (PackageClause a) #
SymbolMatching PackageClause Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy PackageClause -> Node -> Bool showFailure :: Proxy PackageClause -> Node -> String
Unmarshal PackageClause Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (PackageClause a)
Eq a => Eq (PackageClause a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: PackageClause a -> PackageClause a -> Bool # (/=) :: PackageClause a -> PackageClause a -> Bool #
Ord a => Ord (PackageClause a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: PackageClause a -> PackageClause a -> Ordering # (<) :: PackageClause a -> PackageClause a -> Bool # (<=) :: PackageClause a -> PackageClause a -> Bool # (>) :: PackageClause a -> PackageClause a -> Bool # (>=) :: PackageClause a -> PackageClause a -> Bool # max :: PackageClause a -> PackageClause a -> PackageClause a # min :: PackageClause a -> PackageClause a -> PackageClause a #
Show a => Show (PackageClause a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> PackageClause a -> ShowS # show :: PackageClause a -> String # showList :: [PackageClause a] -> ShowS #
Generic (PackageClause a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (PackageClause a) :: Type -> Type # Methods from :: PackageClause a -> Rep (PackageClause a) x # to :: Rep (PackageClause a) x -> PackageClause a #
Generic1 PackageClause Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 PackageClause :: k -> Type # Methods from1 :: forall (a :: k). PackageClause a -> Rep1 PackageClause a # to1 :: forall (a :: k). Rep1 PackageClause a -> PackageClause a #
type Rep (PackageClause a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (PackageClause a) = D1 ('MetaData "PackageClause" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "PackageClause" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (PackageIdentifier a))))
type Rep1 PackageClause Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 PackageClause = D1 ('MetaData "PackageClause" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "PackageClause" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 PackageIdentifier)))

data MethodSpecList a Source #

Constructors

MethodSpecList
Fields ann :: a extraChildren :: ([] ((:+:) MethodSpec ((:+:) QualifiedType TypeIdentifier) a))

Instances

Instances details

Functor MethodSpecList Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> MethodSpecList a -> MethodSpecList b # (<$) :: a -> MethodSpecList b -> MethodSpecList a #
Foldable MethodSpecList Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => MethodSpecList m -> m # foldMap :: Monoid m => (a -> m) -> MethodSpecList a -> m # foldMap' :: Monoid m => (a -> m) -> MethodSpecList a -> m # foldr :: (a -> b -> b) -> b -> MethodSpecList a -> b # foldr' :: (a -> b -> b) -> b -> MethodSpecList a -> b # foldl :: (b -> a -> b) -> b -> MethodSpecList a -> b # foldl' :: (b -> a -> b) -> b -> MethodSpecList a -> b # foldr1 :: (a -> a -> a) -> MethodSpecList a -> a # foldl1 :: (a -> a -> a) -> MethodSpecList a -> a # toList :: MethodSpecList a -> [a] # null :: MethodSpecList a -> Bool # length :: MethodSpecList a -> Int # elem :: Eq a => a -> MethodSpecList a -> Bool # maximum :: Ord a => MethodSpecList a -> a # minimum :: Ord a => MethodSpecList a -> a # sum :: Num a => MethodSpecList a -> a # product :: Num a => MethodSpecList a -> a #
Traversable MethodSpecList Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> MethodSpecList a -> f (MethodSpecList b) # sequenceA :: Applicative f => MethodSpecList (f a) -> f (MethodSpecList a) # mapM :: Monad m => (a -> m b) -> MethodSpecList a -> m (MethodSpecList b) # sequence :: Monad m => MethodSpecList (m a) -> m (MethodSpecList a) #
SymbolMatching MethodSpecList Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy MethodSpecList -> Node -> Bool showFailure :: Proxy MethodSpecList -> Node -> String
Unmarshal MethodSpecList Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (MethodSpecList a)
Eq a => Eq (MethodSpecList a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: MethodSpecList a -> MethodSpecList a -> Bool # (/=) :: MethodSpecList a -> MethodSpecList a -> Bool #
Ord a => Ord (MethodSpecList a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: MethodSpecList a -> MethodSpecList a -> Ordering # (<) :: MethodSpecList a -> MethodSpecList a -> Bool # (<=) :: MethodSpecList a -> MethodSpecList a -> Bool # (>) :: MethodSpecList a -> MethodSpecList a -> Bool # (>=) :: MethodSpecList a -> MethodSpecList a -> Bool # max :: MethodSpecList a -> MethodSpecList a -> MethodSpecList a # min :: MethodSpecList a -> MethodSpecList a -> MethodSpecList a #
Show a => Show (MethodSpecList a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> MethodSpecList a -> ShowS # show :: MethodSpecList a -> String # showList :: [MethodSpecList a] -> ShowS #
Generic (MethodSpecList a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (MethodSpecList a) :: Type -> Type # Methods from :: MethodSpecList a -> Rep (MethodSpecList a) x # to :: Rep (MethodSpecList a) x -> MethodSpecList a #
Generic1 MethodSpecList Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 MethodSpecList :: k -> Type # Methods from1 :: forall (a :: k). MethodSpecList a -> Rep1 MethodSpecList a # to1 :: forall (a :: k). Rep1 MethodSpecList a -> MethodSpecList a #
type Rep (MethodSpecList a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (MethodSpecList a) = D1 ('MetaData "MethodSpecList" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "MethodSpecList" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(MethodSpec :+: (QualifiedType :+: TypeIdentifier)) a])))
type Rep1 MethodSpecList Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 MethodSpecList = D1 ('MetaData "MethodSpecList" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "MethodSpecList" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 (MethodSpec :+: (QualifiedType :+: TypeIdentifier)))))

data MethodSpec a Source #

Constructors

MethodSpec
Fields ann :: a result :: (Maybe ((:+:) SimpleType ParameterList a)) name :: (FieldIdentifier a) parameters :: (ParameterList a)

Instances

Instances details

Functor MethodSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> MethodSpec a -> MethodSpec b # (<$) :: a -> MethodSpec b -> MethodSpec a #
Foldable MethodSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => MethodSpec m -> m # foldMap :: Monoid m => (a -> m) -> MethodSpec a -> m # foldMap' :: Monoid m => (a -> m) -> MethodSpec a -> m # foldr :: (a -> b -> b) -> b -> MethodSpec a -> b # foldr' :: (a -> b -> b) -> b -> MethodSpec a -> b # foldl :: (b -> a -> b) -> b -> MethodSpec a -> b # foldl' :: (b -> a -> b) -> b -> MethodSpec a -> b # foldr1 :: (a -> a -> a) -> MethodSpec a -> a # foldl1 :: (a -> a -> a) -> MethodSpec a -> a # toList :: MethodSpec a -> [a] # null :: MethodSpec a -> Bool # length :: MethodSpec a -> Int # elem :: Eq a => a -> MethodSpec a -> Bool # maximum :: Ord a => MethodSpec a -> a # minimum :: Ord a => MethodSpec a -> a # sum :: Num a => MethodSpec a -> a # product :: Num a => MethodSpec a -> a #
Traversable MethodSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> MethodSpec a -> f (MethodSpec b) # sequenceA :: Applicative f => MethodSpec (f a) -> f (MethodSpec a) # mapM :: Monad m => (a -> m b) -> MethodSpec a -> m (MethodSpec b) # sequence :: Monad m => MethodSpec (m a) -> m (MethodSpec a) #
SymbolMatching MethodSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy MethodSpec -> Node -> Bool showFailure :: Proxy MethodSpec -> Node -> String
Unmarshal MethodSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (MethodSpec a)
Eq a => Eq (MethodSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: MethodSpec a -> MethodSpec a -> Bool # (/=) :: MethodSpec a -> MethodSpec a -> Bool #
Ord a => Ord (MethodSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: MethodSpec a -> MethodSpec a -> Ordering # (<) :: MethodSpec a -> MethodSpec a -> Bool # (<=) :: MethodSpec a -> MethodSpec a -> Bool # (>) :: MethodSpec a -> MethodSpec a -> Bool # (>=) :: MethodSpec a -> MethodSpec a -> Bool # max :: MethodSpec a -> MethodSpec a -> MethodSpec a # min :: MethodSpec a -> MethodSpec a -> MethodSpec a #
Show a => Show (MethodSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> MethodSpec a -> ShowS # show :: MethodSpec a -> String # showList :: [MethodSpec a] -> ShowS #
Generic (MethodSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (MethodSpec a) :: Type -> Type # Methods from :: MethodSpec a -> Rep (MethodSpec a) x # to :: Rep (MethodSpec a) x -> MethodSpec a #
Generic1 MethodSpec Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 MethodSpec :: k -> Type # Methods from1 :: forall (a :: k). MethodSpec a -> Rep1 MethodSpec a # to1 :: forall (a :: k). Rep1 MethodSpec a -> MethodSpec a #
type Rep (MethodSpec a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (MethodSpec a) = D1 ('MetaData "MethodSpec" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "MethodSpec" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: S1 ('MetaSel ('Just "result") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe ((SimpleType :+: ParameterList) a)))) :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (FieldIdentifier a)) :*: S1 ('MetaSel ('Just "parameters") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ParameterList a)))))
type Rep1 MethodSpec Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 MethodSpec = D1 ('MetaData "MethodSpec" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "MethodSpec" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: S1 ('MetaSel ('Just "result") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 (SimpleType :+: ParameterList))) :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 FieldIdentifier) :*: S1 ('MetaSel ('Just "parameters") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 ParameterList))))

data MethodDeclaration a Source #

Constructors

MethodDeclaration
Fields ann :: a body :: (Maybe (Block a)) result :: (Maybe ((:+:) SimpleType ParameterList a)) receiver :: (ParameterList a) name :: (FieldIdentifier a) parameters :: (ParameterList a)

Instances

Instances details

Functor MethodDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> MethodDeclaration a -> MethodDeclaration b # (<$) :: a -> MethodDeclaration b -> MethodDeclaration a #
Foldable MethodDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => MethodDeclaration m -> m # foldMap :: Monoid m => (a -> m) -> MethodDeclaration a -> m # foldMap' :: Monoid m => (a -> m) -> MethodDeclaration a -> m # foldr :: (a -> b -> b) -> b -> MethodDeclaration a -> b # foldr' :: (a -> b -> b) -> b -> MethodDeclaration a -> b # foldl :: (b -> a -> b) -> b -> MethodDeclaration a -> b # foldl' :: (b -> a -> b) -> b -> MethodDeclaration a -> b # foldr1 :: (a -> a -> a) -> MethodDeclaration a -> a # foldl1 :: (a -> a -> a) -> MethodDeclaration a -> a # toList :: MethodDeclaration a -> [a] # null :: MethodDeclaration a -> Bool # length :: MethodDeclaration a -> Int # elem :: Eq a => a -> MethodDeclaration a -> Bool # maximum :: Ord a => MethodDeclaration a -> a # minimum :: Ord a => MethodDeclaration a -> a # sum :: Num a => MethodDeclaration a -> a # product :: Num a => MethodDeclaration a -> a #
Traversable MethodDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> MethodDeclaration a -> f (MethodDeclaration b) # sequenceA :: Applicative f => MethodDeclaration (f a) -> f (MethodDeclaration a) # mapM :: Monad m => (a -> m b) -> MethodDeclaration a -> m (MethodDeclaration b) # sequence :: Monad m => MethodDeclaration (m a) -> m (MethodDeclaration a) #
SymbolMatching MethodDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy MethodDeclaration -> Node -> Bool showFailure :: Proxy MethodDeclaration -> Node -> String
Unmarshal MethodDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (MethodDeclaration a)
Eq a => Eq (MethodDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: MethodDeclaration a -> MethodDeclaration a -> Bool # (/=) :: MethodDeclaration a -> MethodDeclaration a -> Bool #
Ord a => Ord (MethodDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: MethodDeclaration a -> MethodDeclaration a -> Ordering # (<) :: MethodDeclaration a -> MethodDeclaration a -> Bool # (<=) :: MethodDeclaration a -> MethodDeclaration a -> Bool # (>) :: MethodDeclaration a -> MethodDeclaration a -> Bool # (>=) :: MethodDeclaration a -> MethodDeclaration a -> Bool # max :: MethodDeclaration a -> MethodDeclaration a -> MethodDeclaration a # min :: MethodDeclaration a -> MethodDeclaration a -> MethodDeclaration a #
Show a => Show (MethodDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> MethodDeclaration a -> ShowS # show :: MethodDeclaration a -> String # showList :: [MethodDeclaration a] -> ShowS #
Generic (MethodDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (MethodDeclaration a) :: Type -> Type # Methods from :: MethodDeclaration a -> Rep (MethodDeclaration a) x # to :: Rep (MethodDeclaration a) x -> MethodDeclaration a #
Generic1 MethodDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 MethodDeclaration :: k -> Type # Methods from1 :: forall (a :: k). MethodDeclaration a -> Rep1 MethodDeclaration a # to1 :: forall (a :: k). Rep1 MethodDeclaration a -> MethodDeclaration a #
type Rep (MethodDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (MethodDeclaration a) = D1 ('MetaData "MethodDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "MethodDeclaration" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "body") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Block a))) :: S1 ('MetaSel ('Just "result") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe ((SimpleType :+: ParameterList) a))))) :: (S1 ('MetaSel ('Just "receiver") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ParameterList a)) :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (FieldIdentifier a)) :*: S1 ('MetaSel ('Just "parameters") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ParameterList a))))))
type Rep1 MethodDeclaration Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 MethodDeclaration = D1 ('MetaData "MethodDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "MethodDeclaration" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "body") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 Block) :: S1 ('MetaSel ('Just "result") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 (SimpleType :+: ParameterList)))) :: (S1 ('MetaSel ('Just "receiver") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 ParameterList) :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 FieldIdentifier) :*: S1 ('MetaSel ('Just "parameters") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 ParameterList)))))

data MapType a Source #

Constructors

MapType
Fields ann :: a value :: (Type a) key :: (Type a)

Instances

Instances details

Functor MapType Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> MapType a -> MapType b # (<$) :: a -> MapType b -> MapType a #
Foldable MapType Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => MapType m -> m # foldMap :: Monoid m => (a -> m) -> MapType a -> m # foldMap' :: Monoid m => (a -> m) -> MapType a -> m # foldr :: (a -> b -> b) -> b -> MapType a -> b # foldr' :: (a -> b -> b) -> b -> MapType a -> b # foldl :: (b -> a -> b) -> b -> MapType a -> b # foldl' :: (b -> a -> b) -> b -> MapType a -> b # foldr1 :: (a -> a -> a) -> MapType a -> a # foldl1 :: (a -> a -> a) -> MapType a -> a # toList :: MapType a -> [a] # null :: MapType a -> Bool # length :: MapType a -> Int # elem :: Eq a => a -> MapType a -> Bool # maximum :: Ord a => MapType a -> a # minimum :: Ord a => MapType a -> a # sum :: Num a => MapType a -> a # product :: Num a => MapType a -> a #
Traversable MapType Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> MapType a -> f (MapType b) # sequenceA :: Applicative f => MapType (f a) -> f (MapType a) # mapM :: Monad m => (a -> m b) -> MapType a -> m (MapType b) # sequence :: Monad m => MapType (m a) -> m (MapType a) #
SymbolMatching MapType Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy MapType -> Node -> Bool showFailure :: Proxy MapType -> Node -> String
Unmarshal MapType Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (MapType a)
Eq a => Eq (MapType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: MapType a -> MapType a -> Bool # (/=) :: MapType a -> MapType a -> Bool #
Ord a => Ord (MapType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: MapType a -> MapType a -> Ordering # (<) :: MapType a -> MapType a -> Bool # (<=) :: MapType a -> MapType a -> Bool # (>) :: MapType a -> MapType a -> Bool # (>=) :: MapType a -> MapType a -> Bool # max :: MapType a -> MapType a -> MapType a # min :: MapType a -> MapType a -> MapType a #
Show a => Show (MapType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> MapType a -> ShowS # show :: MapType a -> String # showList :: [MapType a] -> ShowS #
Generic (MapType a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (MapType a) :: Type -> Type # Methods from :: MapType a -> Rep (MapType a) x # to :: Rep (MapType a) x -> MapType a #
Generic1 MapType Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 MapType :: k -> Type # Methods from1 :: forall (a :: k). MapType a -> Rep1 MapType a # to1 :: forall (a :: k). Rep1 MapType a -> MapType a #
type Rep (MapType a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (MapType a) = D1 ('MetaData "MapType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "MapType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "value") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type a)) :: S1 ('MetaSel ('Just "key") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type a)))))
type Rep1 MapType Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 MapType = D1 ('MetaData "MapType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "MapType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "value") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Type) :: S1 ('MetaSel ('Just "key") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Type))))

data LiteralValue a Source #

Constructors

LiteralValue
Fields ann :: a extraChildren :: ([] ((:+:) Element KeyedElement a))

Instances

Instances details

Functor LiteralValue Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> LiteralValue a -> LiteralValue b # (<$) :: a -> LiteralValue b -> LiteralValue a #
Foldable LiteralValue Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => LiteralValue m -> m # foldMap :: Monoid m => (a -> m) -> LiteralValue a -> m # foldMap' :: Monoid m => (a -> m) -> LiteralValue a -> m # foldr :: (a -> b -> b) -> b -> LiteralValue a -> b # foldr' :: (a -> b -> b) -> b -> LiteralValue a -> b # foldl :: (b -> a -> b) -> b -> LiteralValue a -> b # foldl' :: (b -> a -> b) -> b -> LiteralValue a -> b # foldr1 :: (a -> a -> a) -> LiteralValue a -> a # foldl1 :: (a -> a -> a) -> LiteralValue a -> a # toList :: LiteralValue a -> [a] # null :: LiteralValue a -> Bool # length :: LiteralValue a -> Int # elem :: Eq a => a -> LiteralValue a -> Bool # maximum :: Ord a => LiteralValue a -> a # minimum :: Ord a => LiteralValue a -> a # sum :: Num a => LiteralValue a -> a # product :: Num a => LiteralValue a -> a #
Traversable LiteralValue Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> LiteralValue a -> f (LiteralValue b) # sequenceA :: Applicative f => LiteralValue (f a) -> f (LiteralValue a) # mapM :: Monad m => (a -> m b) -> LiteralValue a -> m (LiteralValue b) # sequence :: Monad m => LiteralValue (m a) -> m (LiteralValue a) #
SymbolMatching LiteralValue Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy LiteralValue -> Node -> Bool showFailure :: Proxy LiteralValue -> Node -> String
Unmarshal LiteralValue Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (LiteralValue a)
Eq a => Eq (LiteralValue a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: LiteralValue a -> LiteralValue a -> Bool # (/=) :: LiteralValue a -> LiteralValue a -> Bool #
Ord a => Ord (LiteralValue a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: LiteralValue a -> LiteralValue a -> Ordering # (<) :: LiteralValue a -> LiteralValue a -> Bool # (<=) :: LiteralValue a -> LiteralValue a -> Bool # (>) :: LiteralValue a -> LiteralValue a -> Bool # (>=) :: LiteralValue a -> LiteralValue a -> Bool # max :: LiteralValue a -> LiteralValue a -> LiteralValue a # min :: LiteralValue a -> LiteralValue a -> LiteralValue a #
Show a => Show (LiteralValue a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> LiteralValue a -> ShowS # show :: LiteralValue a -> String # showList :: [LiteralValue a] -> ShowS #
Generic (LiteralValue a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (LiteralValue a) :: Type -> Type # Methods from :: LiteralValue a -> Rep (LiteralValue a) x # to :: Rep (LiteralValue a) x -> LiteralValue a #
Generic1 LiteralValue Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 LiteralValue :: k -> Type # Methods from1 :: forall (a :: k). LiteralValue a -> Rep1 LiteralValue a # to1 :: forall (a :: k). Rep1 LiteralValue a -> LiteralValue a #
type Rep (LiteralValue a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (LiteralValue a) = D1 ('MetaData "LiteralValue" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "LiteralValue" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(Element :+: KeyedElement) a])))
type Rep1 LiteralValue Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 LiteralValue = D1 ('MetaData "LiteralValue" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "LiteralValue" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 (Element :+: KeyedElement))))

data LabeledStatement a Source #

Constructors

LabeledStatement
Fields ann :: a label :: (LabelName a) extraChildren :: (Maybe (Statement a))

Instances

Instances details

Functor LabeledStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> LabeledStatement a -> LabeledStatement b # (<$) :: a -> LabeledStatement b -> LabeledStatement a #
Foldable LabeledStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => LabeledStatement m -> m # foldMap :: Monoid m => (a -> m) -> LabeledStatement a -> m # foldMap' :: Monoid m => (a -> m) -> LabeledStatement a -> m # foldr :: (a -> b -> b) -> b -> LabeledStatement a -> b # foldr' :: (a -> b -> b) -> b -> LabeledStatement a -> b # foldl :: (b -> a -> b) -> b -> LabeledStatement a -> b # foldl' :: (b -> a -> b) -> b -> LabeledStatement a -> b # foldr1 :: (a -> a -> a) -> LabeledStatement a -> a # foldl1 :: (a -> a -> a) -> LabeledStatement a -> a # toList :: LabeledStatement a -> [a] # null :: LabeledStatement a -> Bool # length :: LabeledStatement a -> Int # elem :: Eq a => a -> LabeledStatement a -> Bool # maximum :: Ord a => LabeledStatement a -> a # minimum :: Ord a => LabeledStatement a -> a # sum :: Num a => LabeledStatement a -> a # product :: Num a => LabeledStatement a -> a #
Traversable LabeledStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> LabeledStatement a -> f (LabeledStatement b) # sequenceA :: Applicative f => LabeledStatement (f a) -> f (LabeledStatement a) # mapM :: Monad m => (a -> m b) -> LabeledStatement a -> m (LabeledStatement b) # sequence :: Monad m => LabeledStatement (m a) -> m (LabeledStatement a) #
SymbolMatching LabeledStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy LabeledStatement -> Node -> Bool showFailure :: Proxy LabeledStatement -> Node -> String
Unmarshal LabeledStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (LabeledStatement a)
Eq a => Eq (LabeledStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: LabeledStatement a -> LabeledStatement a -> Bool # (/=) :: LabeledStatement a -> LabeledStatement a -> Bool #
Ord a => Ord (LabeledStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: LabeledStatement a -> LabeledStatement a -> Ordering # (<) :: LabeledStatement a -> LabeledStatement a -> Bool # (<=) :: LabeledStatement a -> LabeledStatement a -> Bool # (>) :: LabeledStatement a -> LabeledStatement a -> Bool # (>=) :: LabeledStatement a -> LabeledStatement a -> Bool # max :: LabeledStatement a -> LabeledStatement a -> LabeledStatement a # min :: LabeledStatement a -> LabeledStatement a -> LabeledStatement a #
Show a => Show (LabeledStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> LabeledStatement a -> ShowS # show :: LabeledStatement a -> String # showList :: [LabeledStatement a] -> ShowS #
Generic (LabeledStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (LabeledStatement a) :: Type -> Type # Methods from :: LabeledStatement a -> Rep (LabeledStatement a) x # to :: Rep (LabeledStatement a) x -> LabeledStatement a #
Generic1 LabeledStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 LabeledStatement :: k -> Type # Methods from1 :: forall (a :: k). LabeledStatement a -> Rep1 LabeledStatement a # to1 :: forall (a :: k). Rep1 LabeledStatement a -> LabeledStatement a #
type Rep (LabeledStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (LabeledStatement a) = D1 ('MetaData "LabeledStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "LabeledStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "label") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (LabelName a)) :: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Statement a))))))
type Rep1 LabeledStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 LabeledStatement = D1 ('MetaData "LabeledStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "LabeledStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "label") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 LabelName) :: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 Statement))))

data KeyedElement a Source #

Constructors

KeyedElement
Fields ann :: a extraChildren :: (NonEmpty ((:+:) Expression ((:+:) FieldIdentifier LiteralValue) a))

Instances

Instances details

Functor KeyedElement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> KeyedElement a -> KeyedElement b # (<$) :: a -> KeyedElement b -> KeyedElement a #
Foldable KeyedElement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => KeyedElement m -> m # foldMap :: Monoid m => (a -> m) -> KeyedElement a -> m # foldMap' :: Monoid m => (a -> m) -> KeyedElement a -> m # foldr :: (a -> b -> b) -> b -> KeyedElement a -> b # foldr' :: (a -> b -> b) -> b -> KeyedElement a -> b # foldl :: (b -> a -> b) -> b -> KeyedElement a -> b # foldl' :: (b -> a -> b) -> b -> KeyedElement a -> b # foldr1 :: (a -> a -> a) -> KeyedElement a -> a # foldl1 :: (a -> a -> a) -> KeyedElement a -> a # toList :: KeyedElement a -> [a] # null :: KeyedElement a -> Bool # length :: KeyedElement a -> Int # elem :: Eq a => a -> KeyedElement a -> Bool # maximum :: Ord a => KeyedElement a -> a # minimum :: Ord a => KeyedElement a -> a # sum :: Num a => KeyedElement a -> a # product :: Num a => KeyedElement a -> a #
Traversable KeyedElement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> KeyedElement a -> f (KeyedElement b) # sequenceA :: Applicative f => KeyedElement (f a) -> f (KeyedElement a) # mapM :: Monad m => (a -> m b) -> KeyedElement a -> m (KeyedElement b) # sequence :: Monad m => KeyedElement (m a) -> m (KeyedElement a) #
SymbolMatching KeyedElement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy KeyedElement -> Node -> Bool showFailure :: Proxy KeyedElement -> Node -> String
Unmarshal KeyedElement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (KeyedElement a)
Eq a => Eq (KeyedElement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: KeyedElement a -> KeyedElement a -> Bool # (/=) :: KeyedElement a -> KeyedElement a -> Bool #
Ord a => Ord (KeyedElement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: KeyedElement a -> KeyedElement a -> Ordering # (<) :: KeyedElement a -> KeyedElement a -> Bool # (<=) :: KeyedElement a -> KeyedElement a -> Bool # (>) :: KeyedElement a -> KeyedElement a -> Bool # (>=) :: KeyedElement a -> KeyedElement a -> Bool # max :: KeyedElement a -> KeyedElement a -> KeyedElement a # min :: KeyedElement a -> KeyedElement a -> KeyedElement a #
Show a => Show (KeyedElement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> KeyedElement a -> ShowS # show :: KeyedElement a -> String # showList :: [KeyedElement a] -> ShowS #
Generic (KeyedElement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (KeyedElement a) :: Type -> Type # Methods from :: KeyedElement a -> Rep (KeyedElement a) x # to :: Rep (KeyedElement a) x -> KeyedElement a #
Generic1 KeyedElement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 KeyedElement :: k -> Type # Methods from1 :: forall (a :: k). KeyedElement a -> Rep1 KeyedElement a # to1 :: forall (a :: k). Rep1 KeyedElement a -> KeyedElement a #
type Rep (KeyedElement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (KeyedElement a) = D1 ('MetaData "KeyedElement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "KeyedElement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NonEmpty ((Expression :+: (FieldIdentifier :+: LiteralValue)) a)))))
type Rep1 KeyedElement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 KeyedElement = D1 ('MetaData "KeyedElement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "KeyedElement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (NonEmpty :.: Rec1 (Expression :+: (FieldIdentifier :+: LiteralValue)))))

data InterpretedStringLiteral a Source #

Constructors

InterpretedStringLiteral
Fields ann :: a extraChildren :: ([] (EscapeSequence a))

Instances

Instances details

Functor InterpretedStringLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> InterpretedStringLiteral a -> InterpretedStringLiteral b # (<$) :: a -> InterpretedStringLiteral b -> InterpretedStringLiteral a #
Foldable InterpretedStringLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => InterpretedStringLiteral m -> m # foldMap :: Monoid m => (a -> m) -> InterpretedStringLiteral a -> m # foldMap' :: Monoid m => (a -> m) -> InterpretedStringLiteral a -> m # foldr :: (a -> b -> b) -> b -> InterpretedStringLiteral a -> b # foldr' :: (a -> b -> b) -> b -> InterpretedStringLiteral a -> b # foldl :: (b -> a -> b) -> b -> InterpretedStringLiteral a -> b # foldl' :: (b -> a -> b) -> b -> InterpretedStringLiteral a -> b # foldr1 :: (a -> a -> a) -> InterpretedStringLiteral a -> a # foldl1 :: (a -> a -> a) -> InterpretedStringLiteral a -> a # toList :: InterpretedStringLiteral a -> [a] # null :: InterpretedStringLiteral a -> Bool # length :: InterpretedStringLiteral a -> Int # elem :: Eq a => a -> InterpretedStringLiteral a -> Bool # maximum :: Ord a => InterpretedStringLiteral a -> a # minimum :: Ord a => InterpretedStringLiteral a -> a # sum :: Num a => InterpretedStringLiteral a -> a # product :: Num a => InterpretedStringLiteral a -> a #
Traversable InterpretedStringLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> InterpretedStringLiteral a -> f (InterpretedStringLiteral b) # sequenceA :: Applicative f => InterpretedStringLiteral (f a) -> f (InterpretedStringLiteral a) # mapM :: Monad m => (a -> m b) -> InterpretedStringLiteral a -> m (InterpretedStringLiteral b) # sequence :: Monad m => InterpretedStringLiteral (m a) -> m (InterpretedStringLiteral a) #
SymbolMatching InterpretedStringLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy InterpretedStringLiteral -> Node -> Bool showFailure :: Proxy InterpretedStringLiteral -> Node -> String
Unmarshal InterpretedStringLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (InterpretedStringLiteral a)
Eq a => Eq (InterpretedStringLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: InterpretedStringLiteral a -> InterpretedStringLiteral a -> Bool # (/=) :: InterpretedStringLiteral a -> InterpretedStringLiteral a -> Bool #
Ord a => Ord (InterpretedStringLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: InterpretedStringLiteral a -> InterpretedStringLiteral a -> Ordering # (<) :: InterpretedStringLiteral a -> InterpretedStringLiteral a -> Bool # (<=) :: InterpretedStringLiteral a -> InterpretedStringLiteral a -> Bool # (>) :: InterpretedStringLiteral a -> InterpretedStringLiteral a -> Bool # (>=) :: InterpretedStringLiteral a -> InterpretedStringLiteral a -> Bool # max :: InterpretedStringLiteral a -> InterpretedStringLiteral a -> InterpretedStringLiteral a # min :: InterpretedStringLiteral a -> InterpretedStringLiteral a -> InterpretedStringLiteral a #
Show a => Show (InterpretedStringLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> InterpretedStringLiteral a -> ShowS # show :: InterpretedStringLiteral a -> String # showList :: [InterpretedStringLiteral a] -> ShowS #
Generic (InterpretedStringLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (InterpretedStringLiteral a) :: Type -> Type # Methods from :: InterpretedStringLiteral a -> Rep (InterpretedStringLiteral a) x # to :: Rep (InterpretedStringLiteral a) x -> InterpretedStringLiteral a #
Generic1 InterpretedStringLiteral Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 InterpretedStringLiteral :: k -> Type # Methods from1 :: forall (a :: k). InterpretedStringLiteral a -> Rep1 InterpretedStringLiteral a # to1 :: forall (a :: k). Rep1 InterpretedStringLiteral a -> InterpretedStringLiteral a #
type Rep (InterpretedStringLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (InterpretedStringLiteral a) = D1 ('MetaData "InterpretedStringLiteral" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "InterpretedStringLiteral" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [EscapeSequence a])))
type Rep1 InterpretedStringLiteral Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 InterpretedStringLiteral = D1 ('MetaData "InterpretedStringLiteral" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "InterpretedStringLiteral" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 EscapeSequence)))

data InterfaceType a Source #

Constructors

InterfaceType
Fields ann :: a extraChildren :: (MethodSpecList a)

Instances

Instances details

Functor InterfaceType Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> InterfaceType a -> InterfaceType b # (<$) :: a -> InterfaceType b -> InterfaceType a #
Foldable InterfaceType Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => InterfaceType m -> m # foldMap :: Monoid m => (a -> m) -> InterfaceType a -> m # foldMap' :: Monoid m => (a -> m) -> InterfaceType a -> m # foldr :: (a -> b -> b) -> b -> InterfaceType a -> b # foldr' :: (a -> b -> b) -> b -> InterfaceType a -> b # foldl :: (b -> a -> b) -> b -> InterfaceType a -> b # foldl' :: (b -> a -> b) -> b -> InterfaceType a -> b # foldr1 :: (a -> a -> a) -> InterfaceType a -> a # foldl1 :: (a -> a -> a) -> InterfaceType a -> a # toList :: InterfaceType a -> [a] # null :: InterfaceType a -> Bool # length :: InterfaceType a -> Int # elem :: Eq a => a -> InterfaceType a -> Bool # maximum :: Ord a => InterfaceType a -> a # minimum :: Ord a => InterfaceType a -> a # sum :: Num a => InterfaceType a -> a # product :: Num a => InterfaceType a -> a #
Traversable InterfaceType Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> InterfaceType a -> f (InterfaceType b) # sequenceA :: Applicative f => InterfaceType (f a) -> f (InterfaceType a) # mapM :: Monad m => (a -> m b) -> InterfaceType a -> m (InterfaceType b) # sequence :: Monad m => InterfaceType (m a) -> m (InterfaceType a) #
SymbolMatching InterfaceType Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy InterfaceType -> Node -> Bool showFailure :: Proxy InterfaceType -> Node -> String
Unmarshal InterfaceType Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (InterfaceType a)
Eq a => Eq (InterfaceType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: InterfaceType a -> InterfaceType a -> Bool # (/=) :: InterfaceType a -> InterfaceType a -> Bool #
Ord a => Ord (InterfaceType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: InterfaceType a -> InterfaceType a -> Ordering # (<) :: InterfaceType a -> InterfaceType a -> Bool # (<=) :: InterfaceType a -> InterfaceType a -> Bool # (>) :: InterfaceType a -> InterfaceType a -> Bool # (>=) :: InterfaceType a -> InterfaceType a -> Bool # max :: InterfaceType a -> InterfaceType a -> InterfaceType a # min :: InterfaceType a -> InterfaceType a -> InterfaceType a #
Show a => Show (InterfaceType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> InterfaceType a -> ShowS # show :: InterfaceType a -> String # showList :: [InterfaceType a] -> ShowS #
Generic (InterfaceType a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (InterfaceType a) :: Type -> Type # Methods from :: InterfaceType a -> Rep (InterfaceType a) x # to :: Rep (InterfaceType a) x -> InterfaceType a #
Generic1 InterfaceType Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 InterfaceType :: k -> Type # Methods from1 :: forall (a :: k). InterfaceType a -> Rep1 InterfaceType a # to1 :: forall (a :: k). Rep1 InterfaceType a -> InterfaceType a #
type Rep (InterfaceType a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (InterfaceType a) = D1 ('MetaData "InterfaceType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "InterfaceType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (MethodSpecList a))))
type Rep1 InterfaceType Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 InterfaceType = D1 ('MetaData "InterfaceType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "InterfaceType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 MethodSpecList)))

data IndexExpression a Source #

Constructors

IndexExpression
Fields ann :: a operand :: (Expression a) index :: (Expression a)

Instances

Instances details

Functor IndexExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> IndexExpression a -> IndexExpression b # (<$) :: a -> IndexExpression b -> IndexExpression a #
Foldable IndexExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => IndexExpression m -> m # foldMap :: Monoid m => (a -> m) -> IndexExpression a -> m # foldMap' :: Monoid m => (a -> m) -> IndexExpression a -> m # foldr :: (a -> b -> b) -> b -> IndexExpression a -> b # foldr' :: (a -> b -> b) -> b -> IndexExpression a -> b # foldl :: (b -> a -> b) -> b -> IndexExpression a -> b # foldl' :: (b -> a -> b) -> b -> IndexExpression a -> b # foldr1 :: (a -> a -> a) -> IndexExpression a -> a # foldl1 :: (a -> a -> a) -> IndexExpression a -> a # toList :: IndexExpression a -> [a] # null :: IndexExpression a -> Bool # length :: IndexExpression a -> Int # elem :: Eq a => a -> IndexExpression a -> Bool # maximum :: Ord a => IndexExpression a -> a # minimum :: Ord a => IndexExpression a -> a # sum :: Num a => IndexExpression a -> a # product :: Num a => IndexExpression a -> a #
Traversable IndexExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> IndexExpression a -> f (IndexExpression b) # sequenceA :: Applicative f => IndexExpression (f a) -> f (IndexExpression a) # mapM :: Monad m => (a -> m b) -> IndexExpression a -> m (IndexExpression b) # sequence :: Monad m => IndexExpression (m a) -> m (IndexExpression a) #
SymbolMatching IndexExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy IndexExpression -> Node -> Bool showFailure :: Proxy IndexExpression -> Node -> String
Unmarshal IndexExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (IndexExpression a)
Eq a => Eq (IndexExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: IndexExpression a -> IndexExpression a -> Bool # (/=) :: IndexExpression a -> IndexExpression a -> Bool #
Ord a => Ord (IndexExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: IndexExpression a -> IndexExpression a -> Ordering # (<) :: IndexExpression a -> IndexExpression a -> Bool # (<=) :: IndexExpression a -> IndexExpression a -> Bool # (>) :: IndexExpression a -> IndexExpression a -> Bool # (>=) :: IndexExpression a -> IndexExpression a -> Bool # max :: IndexExpression a -> IndexExpression a -> IndexExpression a # min :: IndexExpression a -> IndexExpression a -> IndexExpression a #
Show a => Show (IndexExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> IndexExpression a -> ShowS # show :: IndexExpression a -> String # showList :: [IndexExpression a] -> ShowS #
Generic (IndexExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (IndexExpression a) :: Type -> Type # Methods from :: IndexExpression a -> Rep (IndexExpression a) x # to :: Rep (IndexExpression a) x -> IndexExpression a #
Generic1 IndexExpression Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 IndexExpression :: k -> Type # Methods from1 :: forall (a :: k). IndexExpression a -> Rep1 IndexExpression a # to1 :: forall (a :: k). Rep1 IndexExpression a -> IndexExpression a #
type Rep (IndexExpression a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (IndexExpression a) = D1 ('MetaData "IndexExpression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "IndexExpression" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "operand") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a)) :: S1 ('MetaSel ('Just "index") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a)))))
type Rep1 IndexExpression Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 IndexExpression = D1 ('MetaData "IndexExpression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "IndexExpression" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "operand") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression) :: S1 ('MetaSel ('Just "index") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression))))

data IncStatement a Source #

Constructors

IncStatement
Fields ann :: a extraChildren :: (Expression a)

Instances

Instances details

Functor IncStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> IncStatement a -> IncStatement b # (<$) :: a -> IncStatement b -> IncStatement a #
Foldable IncStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => IncStatement m -> m # foldMap :: Monoid m => (a -> m) -> IncStatement a -> m # foldMap' :: Monoid m => (a -> m) -> IncStatement a -> m # foldr :: (a -> b -> b) -> b -> IncStatement a -> b # foldr' :: (a -> b -> b) -> b -> IncStatement a -> b # foldl :: (b -> a -> b) -> b -> IncStatement a -> b # foldl' :: (b -> a -> b) -> b -> IncStatement a -> b # foldr1 :: (a -> a -> a) -> IncStatement a -> a # foldl1 :: (a -> a -> a) -> IncStatement a -> a # toList :: IncStatement a -> [a] # null :: IncStatement a -> Bool # length :: IncStatement a -> Int # elem :: Eq a => a -> IncStatement a -> Bool # maximum :: Ord a => IncStatement a -> a # minimum :: Ord a => IncStatement a -> a # sum :: Num a => IncStatement a -> a # product :: Num a => IncStatement a -> a #
Traversable IncStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> IncStatement a -> f (IncStatement b) # sequenceA :: Applicative f => IncStatement (f a) -> f (IncStatement a) # mapM :: Monad m => (a -> m b) -> IncStatement a -> m (IncStatement b) # sequence :: Monad m => IncStatement (m a) -> m (IncStatement a) #
SymbolMatching IncStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy IncStatement -> Node -> Bool showFailure :: Proxy IncStatement -> Node -> String
Unmarshal IncStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (IncStatement a)
Eq a => Eq (IncStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: IncStatement a -> IncStatement a -> Bool # (/=) :: IncStatement a -> IncStatement a -> Bool #
Ord a => Ord (IncStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: IncStatement a -> IncStatement a -> Ordering # (<) :: IncStatement a -> IncStatement a -> Bool # (<=) :: IncStatement a -> IncStatement a -> Bool # (>) :: IncStatement a -> IncStatement a -> Bool # (>=) :: IncStatement a -> IncStatement a -> Bool # max :: IncStatement a -> IncStatement a -> IncStatement a # min :: IncStatement a -> IncStatement a -> IncStatement a #
Show a => Show (IncStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> IncStatement a -> ShowS # show :: IncStatement a -> String # showList :: [IncStatement a] -> ShowS #
Generic (IncStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (IncStatement a) :: Type -> Type # Methods from :: IncStatement a -> Rep (IncStatement a) x # to :: Rep (IncStatement a) x -> IncStatement a #
Generic1 IncStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 IncStatement :: k -> Type # Methods from1 :: forall (a :: k). IncStatement a -> Rep1 IncStatement a # to1 :: forall (a :: k). Rep1 IncStatement a -> IncStatement a #
type Rep (IncStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (IncStatement a) = D1 ('MetaData "IncStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "IncStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a))))
type Rep1 IncStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 IncStatement = D1 ('MetaData "IncStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "IncStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression)))

data ImportSpecList a Source #

Constructors

ImportSpecList
Fields ann :: a extraChildren :: ([] (ImportSpec a))

Instances

Instances details

Functor ImportSpecList Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ImportSpecList a -> ImportSpecList b # (<$) :: a -> ImportSpecList b -> ImportSpecList a #
Foldable ImportSpecList Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ImportSpecList m -> m # foldMap :: Monoid m => (a -> m) -> ImportSpecList a -> m # foldMap' :: Monoid m => (a -> m) -> ImportSpecList a -> m # foldr :: (a -> b -> b) -> b -> ImportSpecList a -> b # foldr' :: (a -> b -> b) -> b -> ImportSpecList a -> b # foldl :: (b -> a -> b) -> b -> ImportSpecList a -> b # foldl' :: (b -> a -> b) -> b -> ImportSpecList a -> b # foldr1 :: (a -> a -> a) -> ImportSpecList a -> a # foldl1 :: (a -> a -> a) -> ImportSpecList a -> a # toList :: ImportSpecList a -> [a] # null :: ImportSpecList a -> Bool # length :: ImportSpecList a -> Int # elem :: Eq a => a -> ImportSpecList a -> Bool # maximum :: Ord a => ImportSpecList a -> a # minimum :: Ord a => ImportSpecList a -> a # sum :: Num a => ImportSpecList a -> a # product :: Num a => ImportSpecList a -> a #
Traversable ImportSpecList Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ImportSpecList a -> f (ImportSpecList b) # sequenceA :: Applicative f => ImportSpecList (f a) -> f (ImportSpecList a) # mapM :: Monad m => (a -> m b) -> ImportSpecList a -> m (ImportSpecList b) # sequence :: Monad m => ImportSpecList (m a) -> m (ImportSpecList a) #
SymbolMatching ImportSpecList Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ImportSpecList -> Node -> Bool showFailure :: Proxy ImportSpecList -> Node -> String
Unmarshal ImportSpecList Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ImportSpecList a)
Eq a => Eq (ImportSpecList a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ImportSpecList a -> ImportSpecList a -> Bool # (/=) :: ImportSpecList a -> ImportSpecList a -> Bool #
Ord a => Ord (ImportSpecList a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ImportSpecList a -> ImportSpecList a -> Ordering # (<) :: ImportSpecList a -> ImportSpecList a -> Bool # (<=) :: ImportSpecList a -> ImportSpecList a -> Bool # (>) :: ImportSpecList a -> ImportSpecList a -> Bool # (>=) :: ImportSpecList a -> ImportSpecList a -> Bool # max :: ImportSpecList a -> ImportSpecList a -> ImportSpecList a # min :: ImportSpecList a -> ImportSpecList a -> ImportSpecList a #
Show a => Show (ImportSpecList a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ImportSpecList a -> ShowS # show :: ImportSpecList a -> String # showList :: [ImportSpecList a] -> ShowS #
Generic (ImportSpecList a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ImportSpecList a) :: Type -> Type # Methods from :: ImportSpecList a -> Rep (ImportSpecList a) x # to :: Rep (ImportSpecList a) x -> ImportSpecList a #
Generic1 ImportSpecList Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ImportSpecList :: k -> Type # Methods from1 :: forall (a :: k). ImportSpecList a -> Rep1 ImportSpecList a # to1 :: forall (a :: k). Rep1 ImportSpecList a -> ImportSpecList a #
type Rep (ImportSpecList a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ImportSpecList a) = D1 ('MetaData "ImportSpecList" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ImportSpecList" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [ImportSpec a])))
type Rep1 ImportSpecList Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ImportSpecList = D1 ('MetaData "ImportSpecList" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ImportSpecList" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 ImportSpec)))

data ImportSpec a Source #

Constructors

ImportSpec
Fields ann :: a path :: ((:+:) InterpretedStringLiteral RawStringLiteral a) name :: (Maybe ((:+:) BlankIdentifier ((:+:) Dot PackageIdentifier) a))

Instances

Instances details

Functor ImportSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ImportSpec a -> ImportSpec b # (<$) :: a -> ImportSpec b -> ImportSpec a #
Foldable ImportSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ImportSpec m -> m # foldMap :: Monoid m => (a -> m) -> ImportSpec a -> m # foldMap' :: Monoid m => (a -> m) -> ImportSpec a -> m # foldr :: (a -> b -> b) -> b -> ImportSpec a -> b # foldr' :: (a -> b -> b) -> b -> ImportSpec a -> b # foldl :: (b -> a -> b) -> b -> ImportSpec a -> b # foldl' :: (b -> a -> b) -> b -> ImportSpec a -> b # foldr1 :: (a -> a -> a) -> ImportSpec a -> a # foldl1 :: (a -> a -> a) -> ImportSpec a -> a # toList :: ImportSpec a -> [a] # null :: ImportSpec a -> Bool # length :: ImportSpec a -> Int # elem :: Eq a => a -> ImportSpec a -> Bool # maximum :: Ord a => ImportSpec a -> a # minimum :: Ord a => ImportSpec a -> a # sum :: Num a => ImportSpec a -> a # product :: Num a => ImportSpec a -> a #
Traversable ImportSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ImportSpec a -> f (ImportSpec b) # sequenceA :: Applicative f => ImportSpec (f a) -> f (ImportSpec a) # mapM :: Monad m => (a -> m b) -> ImportSpec a -> m (ImportSpec b) # sequence :: Monad m => ImportSpec (m a) -> m (ImportSpec a) #
SymbolMatching ImportSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ImportSpec -> Node -> Bool showFailure :: Proxy ImportSpec -> Node -> String
Unmarshal ImportSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ImportSpec a)
Eq a => Eq (ImportSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ImportSpec a -> ImportSpec a -> Bool # (/=) :: ImportSpec a -> ImportSpec a -> Bool #
Ord a => Ord (ImportSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ImportSpec a -> ImportSpec a -> Ordering # (<) :: ImportSpec a -> ImportSpec a -> Bool # (<=) :: ImportSpec a -> ImportSpec a -> Bool # (>) :: ImportSpec a -> ImportSpec a -> Bool # (>=) :: ImportSpec a -> ImportSpec a -> Bool # max :: ImportSpec a -> ImportSpec a -> ImportSpec a # min :: ImportSpec a -> ImportSpec a -> ImportSpec a #
Show a => Show (ImportSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ImportSpec a -> ShowS # show :: ImportSpec a -> String # showList :: [ImportSpec a] -> ShowS #
Generic (ImportSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ImportSpec a) :: Type -> Type # Methods from :: ImportSpec a -> Rep (ImportSpec a) x # to :: Rep (ImportSpec a) x -> ImportSpec a #
Generic1 ImportSpec Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ImportSpec :: k -> Type # Methods from1 :: forall (a :: k). ImportSpec a -> Rep1 ImportSpec a # to1 :: forall (a :: k). Rep1 ImportSpec a -> ImportSpec a #
type Rep (ImportSpec a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ImportSpec a) = D1 ('MetaData "ImportSpec" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ImportSpec" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "path") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ((InterpretedStringLiteral :+: RawStringLiteral) a)) :: S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe ((BlankIdentifier :+: (Dot :+: PackageIdentifier)) a))))))
type Rep1 ImportSpec Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ImportSpec = D1 ('MetaData "ImportSpec" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ImportSpec" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "path") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 (InterpretedStringLiteral :+: RawStringLiteral)) :: S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 (BlankIdentifier :+: (Dot :+: PackageIdentifier))))))

data ImportDeclaration a Source #

Constructors

ImportDeclaration
Fields ann :: a extraChildren :: ((:+:) ImportSpec ImportSpecList a)

Instances

Instances details

Functor ImportDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ImportDeclaration a -> ImportDeclaration b # (<$) :: a -> ImportDeclaration b -> ImportDeclaration a #
Foldable ImportDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ImportDeclaration m -> m # foldMap :: Monoid m => (a -> m) -> ImportDeclaration a -> m # foldMap' :: Monoid m => (a -> m) -> ImportDeclaration a -> m # foldr :: (a -> b -> b) -> b -> ImportDeclaration a -> b # foldr' :: (a -> b -> b) -> b -> ImportDeclaration a -> b # foldl :: (b -> a -> b) -> b -> ImportDeclaration a -> b # foldl' :: (b -> a -> b) -> b -> ImportDeclaration a -> b # foldr1 :: (a -> a -> a) -> ImportDeclaration a -> a # foldl1 :: (a -> a -> a) -> ImportDeclaration a -> a # toList :: ImportDeclaration a -> [a] # null :: ImportDeclaration a -> Bool # length :: ImportDeclaration a -> Int # elem :: Eq a => a -> ImportDeclaration a -> Bool # maximum :: Ord a => ImportDeclaration a -> a # minimum :: Ord a => ImportDeclaration a -> a # sum :: Num a => ImportDeclaration a -> a # product :: Num a => ImportDeclaration a -> a #
Traversable ImportDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ImportDeclaration a -> f (ImportDeclaration b) # sequenceA :: Applicative f => ImportDeclaration (f a) -> f (ImportDeclaration a) # mapM :: Monad m => (a -> m b) -> ImportDeclaration a -> m (ImportDeclaration b) # sequence :: Monad m => ImportDeclaration (m a) -> m (ImportDeclaration a) #
SymbolMatching ImportDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ImportDeclaration -> Node -> Bool showFailure :: Proxy ImportDeclaration -> Node -> String
Unmarshal ImportDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ImportDeclaration a)
Eq a => Eq (ImportDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ImportDeclaration a -> ImportDeclaration a -> Bool # (/=) :: ImportDeclaration a -> ImportDeclaration a -> Bool #
Ord a => Ord (ImportDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ImportDeclaration a -> ImportDeclaration a -> Ordering # (<) :: ImportDeclaration a -> ImportDeclaration a -> Bool # (<=) :: ImportDeclaration a -> ImportDeclaration a -> Bool # (>) :: ImportDeclaration a -> ImportDeclaration a -> Bool # (>=) :: ImportDeclaration a -> ImportDeclaration a -> Bool # max :: ImportDeclaration a -> ImportDeclaration a -> ImportDeclaration a # min :: ImportDeclaration a -> ImportDeclaration a -> ImportDeclaration a #
Show a => Show (ImportDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ImportDeclaration a -> ShowS # show :: ImportDeclaration a -> String # showList :: [ImportDeclaration a] -> ShowS #
Generic (ImportDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ImportDeclaration a) :: Type -> Type # Methods from :: ImportDeclaration a -> Rep (ImportDeclaration a) x # to :: Rep (ImportDeclaration a) x -> ImportDeclaration a #
Generic1 ImportDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ImportDeclaration :: k -> Type # Methods from1 :: forall (a :: k). ImportDeclaration a -> Rep1 ImportDeclaration a # to1 :: forall (a :: k). Rep1 ImportDeclaration a -> ImportDeclaration a #
type Rep (ImportDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ImportDeclaration a) = D1 ('MetaData "ImportDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ImportDeclaration" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ((ImportSpec :+: ImportSpecList) a))))
type Rep1 ImportDeclaration Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ImportDeclaration = D1 ('MetaData "ImportDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ImportDeclaration" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 (ImportSpec :+: ImportSpecList))))

data ImplicitLengthArrayType a Source #

Constructors

ImplicitLengthArrayType
Fields ann :: a element :: (Type a)

Instances

Instances details

Functor ImplicitLengthArrayType Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ImplicitLengthArrayType a -> ImplicitLengthArrayType b # (<$) :: a -> ImplicitLengthArrayType b -> ImplicitLengthArrayType a #
Foldable ImplicitLengthArrayType Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ImplicitLengthArrayType m -> m # foldMap :: Monoid m => (a -> m) -> ImplicitLengthArrayType a -> m # foldMap' :: Monoid m => (a -> m) -> ImplicitLengthArrayType a -> m # foldr :: (a -> b -> b) -> b -> ImplicitLengthArrayType a -> b # foldr' :: (a -> b -> b) -> b -> ImplicitLengthArrayType a -> b # foldl :: (b -> a -> b) -> b -> ImplicitLengthArrayType a -> b # foldl' :: (b -> a -> b) -> b -> ImplicitLengthArrayType a -> b # foldr1 :: (a -> a -> a) -> ImplicitLengthArrayType a -> a # foldl1 :: (a -> a -> a) -> ImplicitLengthArrayType a -> a # toList :: ImplicitLengthArrayType a -> [a] # null :: ImplicitLengthArrayType a -> Bool # length :: ImplicitLengthArrayType a -> Int # elem :: Eq a => a -> ImplicitLengthArrayType a -> Bool # maximum :: Ord a => ImplicitLengthArrayType a -> a # minimum :: Ord a => ImplicitLengthArrayType a -> a # sum :: Num a => ImplicitLengthArrayType a -> a # product :: Num a => ImplicitLengthArrayType a -> a #
Traversable ImplicitLengthArrayType Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ImplicitLengthArrayType a -> f (ImplicitLengthArrayType b) # sequenceA :: Applicative f => ImplicitLengthArrayType (f a) -> f (ImplicitLengthArrayType a) # mapM :: Monad m => (a -> m b) -> ImplicitLengthArrayType a -> m (ImplicitLengthArrayType b) # sequence :: Monad m => ImplicitLengthArrayType (m a) -> m (ImplicitLengthArrayType a) #
SymbolMatching ImplicitLengthArrayType Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ImplicitLengthArrayType -> Node -> Bool showFailure :: Proxy ImplicitLengthArrayType -> Node -> String
Unmarshal ImplicitLengthArrayType Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ImplicitLengthArrayType a)
Eq a => Eq (ImplicitLengthArrayType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ImplicitLengthArrayType a -> ImplicitLengthArrayType a -> Bool # (/=) :: ImplicitLengthArrayType a -> ImplicitLengthArrayType a -> Bool #
Ord a => Ord (ImplicitLengthArrayType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ImplicitLengthArrayType a -> ImplicitLengthArrayType a -> Ordering # (<) :: ImplicitLengthArrayType a -> ImplicitLengthArrayType a -> Bool # (<=) :: ImplicitLengthArrayType a -> ImplicitLengthArrayType a -> Bool # (>) :: ImplicitLengthArrayType a -> ImplicitLengthArrayType a -> Bool # (>=) :: ImplicitLengthArrayType a -> ImplicitLengthArrayType a -> Bool # max :: ImplicitLengthArrayType a -> ImplicitLengthArrayType a -> ImplicitLengthArrayType a # min :: ImplicitLengthArrayType a -> ImplicitLengthArrayType a -> ImplicitLengthArrayType a #
Show a => Show (ImplicitLengthArrayType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ImplicitLengthArrayType a -> ShowS # show :: ImplicitLengthArrayType a -> String # showList :: [ImplicitLengthArrayType a] -> ShowS #
Generic (ImplicitLengthArrayType a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ImplicitLengthArrayType a) :: Type -> Type # Methods from :: ImplicitLengthArrayType a -> Rep (ImplicitLengthArrayType a) x # to :: Rep (ImplicitLengthArrayType a) x -> ImplicitLengthArrayType a #
Generic1 ImplicitLengthArrayType Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ImplicitLengthArrayType :: k -> Type # Methods from1 :: forall (a :: k). ImplicitLengthArrayType a -> Rep1 ImplicitLengthArrayType a # to1 :: forall (a :: k). Rep1 ImplicitLengthArrayType a -> ImplicitLengthArrayType a #
type Rep (ImplicitLengthArrayType a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ImplicitLengthArrayType a) = D1 ('MetaData "ImplicitLengthArrayType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ImplicitLengthArrayType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "element") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type a))))
type Rep1 ImplicitLengthArrayType Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ImplicitLengthArrayType = D1 ('MetaData "ImplicitLengthArrayType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ImplicitLengthArrayType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "element") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Type)))

data IfStatement a Source #

Constructors

IfStatement
Fields ann :: a alternative :: (Maybe ((:+:) Block IfStatement a)) initializer :: (Maybe (SimpleStatement a)) consequence :: (Block a) condition :: (Expression a)

Instances

Instances details

Functor IfStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> IfStatement a -> IfStatement b # (<$) :: a -> IfStatement b -> IfStatement a #
Foldable IfStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => IfStatement m -> m # foldMap :: Monoid m => (a -> m) -> IfStatement a -> m # foldMap' :: Monoid m => (a -> m) -> IfStatement a -> m # foldr :: (a -> b -> b) -> b -> IfStatement a -> b # foldr' :: (a -> b -> b) -> b -> IfStatement a -> b # foldl :: (b -> a -> b) -> b -> IfStatement a -> b # foldl' :: (b -> a -> b) -> b -> IfStatement a -> b # foldr1 :: (a -> a -> a) -> IfStatement a -> a # foldl1 :: (a -> a -> a) -> IfStatement a -> a # toList :: IfStatement a -> [a] # null :: IfStatement a -> Bool # length :: IfStatement a -> Int # elem :: Eq a => a -> IfStatement a -> Bool # maximum :: Ord a => IfStatement a -> a # minimum :: Ord a => IfStatement a -> a # sum :: Num a => IfStatement a -> a # product :: Num a => IfStatement a -> a #
Traversable IfStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> IfStatement a -> f (IfStatement b) # sequenceA :: Applicative f => IfStatement (f a) -> f (IfStatement a) # mapM :: Monad m => (a -> m b) -> IfStatement a -> m (IfStatement b) # sequence :: Monad m => IfStatement (m a) -> m (IfStatement a) #
SymbolMatching IfStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy IfStatement -> Node -> Bool showFailure :: Proxy IfStatement -> Node -> String
Unmarshal IfStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (IfStatement a)
Eq a => Eq (IfStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: IfStatement a -> IfStatement a -> Bool # (/=) :: IfStatement a -> IfStatement a -> Bool #
Ord a => Ord (IfStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: IfStatement a -> IfStatement a -> Ordering # (<) :: IfStatement a -> IfStatement a -> Bool # (<=) :: IfStatement a -> IfStatement a -> Bool # (>) :: IfStatement a -> IfStatement a -> Bool # (>=) :: IfStatement a -> IfStatement a -> Bool # max :: IfStatement a -> IfStatement a -> IfStatement a # min :: IfStatement a -> IfStatement a -> IfStatement a #
Show a => Show (IfStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> IfStatement a -> ShowS # show :: IfStatement a -> String # showList :: [IfStatement a] -> ShowS #
Generic (IfStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (IfStatement a) :: Type -> Type # Methods from :: IfStatement a -> Rep (IfStatement a) x # to :: Rep (IfStatement a) x -> IfStatement a #
Generic1 IfStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 IfStatement :: k -> Type # Methods from1 :: forall (a :: k). IfStatement a -> Rep1 IfStatement a # to1 :: forall (a :: k). Rep1 IfStatement a -> IfStatement a #
type Rep (IfStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (IfStatement a) = D1 ('MetaData "IfStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "IfStatement" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: S1 ('MetaSel ('Just "alternative") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe ((Block :+: IfStatement) a)))) :: (S1 ('MetaSel ('Just "initializer") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (SimpleStatement a))) :: (S1 ('MetaSel ('Just "consequence") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Block a)) :: S1 ('MetaSel ('Just "condition") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a))))))
type Rep1 IfStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 IfStatement = D1 ('MetaData "IfStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "IfStatement" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: S1 ('MetaSel ('Just "alternative") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 (Block :+: IfStatement))) :: (S1 ('MetaSel ('Just "initializer") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 SimpleStatement) :: (S1 ('MetaSel ('Just "consequence") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Block) :: S1 ('MetaSel ('Just "condition") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression)))))

data GotoStatement a Source #

Constructors

GotoStatement
Fields ann :: a extraChildren :: (LabelName a)

Instances

Instances details

Functor GotoStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> GotoStatement a -> GotoStatement b # (<$) :: a -> GotoStatement b -> GotoStatement a #
Foldable GotoStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => GotoStatement m -> m # foldMap :: Monoid m => (a -> m) -> GotoStatement a -> m # foldMap' :: Monoid m => (a -> m) -> GotoStatement a -> m # foldr :: (a -> b -> b) -> b -> GotoStatement a -> b # foldr' :: (a -> b -> b) -> b -> GotoStatement a -> b # foldl :: (b -> a -> b) -> b -> GotoStatement a -> b # foldl' :: (b -> a -> b) -> b -> GotoStatement a -> b # foldr1 :: (a -> a -> a) -> GotoStatement a -> a # foldl1 :: (a -> a -> a) -> GotoStatement a -> a # toList :: GotoStatement a -> [a] # null :: GotoStatement a -> Bool # length :: GotoStatement a -> Int # elem :: Eq a => a -> GotoStatement a -> Bool # maximum :: Ord a => GotoStatement a -> a # minimum :: Ord a => GotoStatement a -> a # sum :: Num a => GotoStatement a -> a # product :: Num a => GotoStatement a -> a #
Traversable GotoStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> GotoStatement a -> f (GotoStatement b) # sequenceA :: Applicative f => GotoStatement (f a) -> f (GotoStatement a) # mapM :: Monad m => (a -> m b) -> GotoStatement a -> m (GotoStatement b) # sequence :: Monad m => GotoStatement (m a) -> m (GotoStatement a) #
SymbolMatching GotoStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy GotoStatement -> Node -> Bool showFailure :: Proxy GotoStatement -> Node -> String
Unmarshal GotoStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (GotoStatement a)
Eq a => Eq (GotoStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: GotoStatement a -> GotoStatement a -> Bool # (/=) :: GotoStatement a -> GotoStatement a -> Bool #
Ord a => Ord (GotoStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: GotoStatement a -> GotoStatement a -> Ordering # (<) :: GotoStatement a -> GotoStatement a -> Bool # (<=) :: GotoStatement a -> GotoStatement a -> Bool # (>) :: GotoStatement a -> GotoStatement a -> Bool # (>=) :: GotoStatement a -> GotoStatement a -> Bool # max :: GotoStatement a -> GotoStatement a -> GotoStatement a # min :: GotoStatement a -> GotoStatement a -> GotoStatement a #
Show a => Show (GotoStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> GotoStatement a -> ShowS # show :: GotoStatement a -> String # showList :: [GotoStatement a] -> ShowS #
Generic (GotoStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (GotoStatement a) :: Type -> Type # Methods from :: GotoStatement a -> Rep (GotoStatement a) x # to :: Rep (GotoStatement a) x -> GotoStatement a #
Generic1 GotoStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 GotoStatement :: k -> Type # Methods from1 :: forall (a :: k). GotoStatement a -> Rep1 GotoStatement a # to1 :: forall (a :: k). Rep1 GotoStatement a -> GotoStatement a #
type Rep (GotoStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (GotoStatement a) = D1 ('MetaData "GotoStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "GotoStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (LabelName a))))
type Rep1 GotoStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 GotoStatement = D1 ('MetaData "GotoStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "GotoStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 LabelName)))

data GoStatement a Source #

Constructors

GoStatement
Fields ann :: a extraChildren :: (Expression a)

Instances

Instances details

Functor GoStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> GoStatement a -> GoStatement b # (<$) :: a -> GoStatement b -> GoStatement a #
Foldable GoStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => GoStatement m -> m # foldMap :: Monoid m => (a -> m) -> GoStatement a -> m # foldMap' :: Monoid m => (a -> m) -> GoStatement a -> m # foldr :: (a -> b -> b) -> b -> GoStatement a -> b # foldr' :: (a -> b -> b) -> b -> GoStatement a -> b # foldl :: (b -> a -> b) -> b -> GoStatement a -> b # foldl' :: (b -> a -> b) -> b -> GoStatement a -> b # foldr1 :: (a -> a -> a) -> GoStatement a -> a # foldl1 :: (a -> a -> a) -> GoStatement a -> a # toList :: GoStatement a -> [a] # null :: GoStatement a -> Bool # length :: GoStatement a -> Int # elem :: Eq a => a -> GoStatement a -> Bool # maximum :: Ord a => GoStatement a -> a # minimum :: Ord a => GoStatement a -> a # sum :: Num a => GoStatement a -> a # product :: Num a => GoStatement a -> a #
Traversable GoStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> GoStatement a -> f (GoStatement b) # sequenceA :: Applicative f => GoStatement (f a) -> f (GoStatement a) # mapM :: Monad m => (a -> m b) -> GoStatement a -> m (GoStatement b) # sequence :: Monad m => GoStatement (m a) -> m (GoStatement a) #
SymbolMatching GoStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy GoStatement -> Node -> Bool showFailure :: Proxy GoStatement -> Node -> String
Unmarshal GoStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (GoStatement a)
Eq a => Eq (GoStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: GoStatement a -> GoStatement a -> Bool # (/=) :: GoStatement a -> GoStatement a -> Bool #
Ord a => Ord (GoStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: GoStatement a -> GoStatement a -> Ordering # (<) :: GoStatement a -> GoStatement a -> Bool # (<=) :: GoStatement a -> GoStatement a -> Bool # (>) :: GoStatement a -> GoStatement a -> Bool # (>=) :: GoStatement a -> GoStatement a -> Bool # max :: GoStatement a -> GoStatement a -> GoStatement a # min :: GoStatement a -> GoStatement a -> GoStatement a #
Show a => Show (GoStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> GoStatement a -> ShowS # show :: GoStatement a -> String # showList :: [GoStatement a] -> ShowS #
Generic (GoStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (GoStatement a) :: Type -> Type # Methods from :: GoStatement a -> Rep (GoStatement a) x # to :: Rep (GoStatement a) x -> GoStatement a #
Generic1 GoStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 GoStatement :: k -> Type # Methods from1 :: forall (a :: k). GoStatement a -> Rep1 GoStatement a # to1 :: forall (a :: k). Rep1 GoStatement a -> GoStatement a #
type Rep (GoStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (GoStatement a) = D1 ('MetaData "GoStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "GoStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a))))
type Rep1 GoStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 GoStatement = D1 ('MetaData "GoStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "GoStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression)))

data FunctionType a Source #

Constructors

FunctionType
Fields ann :: a result :: (Maybe ((:+:) SimpleType ParameterList a)) parameters :: (ParameterList a)

Instances

Instances details

Functor FunctionType Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> FunctionType a -> FunctionType b # (<$) :: a -> FunctionType b -> FunctionType a #
Foldable FunctionType Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => FunctionType m -> m # foldMap :: Monoid m => (a -> m) -> FunctionType a -> m # foldMap' :: Monoid m => (a -> m) -> FunctionType a -> m # foldr :: (a -> b -> b) -> b -> FunctionType a -> b # foldr' :: (a -> b -> b) -> b -> FunctionType a -> b # foldl :: (b -> a -> b) -> b -> FunctionType a -> b # foldl' :: (b -> a -> b) -> b -> FunctionType a -> b # foldr1 :: (a -> a -> a) -> FunctionType a -> a # foldl1 :: (a -> a -> a) -> FunctionType a -> a # toList :: FunctionType a -> [a] # null :: FunctionType a -> Bool # length :: FunctionType a -> Int # elem :: Eq a => a -> FunctionType a -> Bool # maximum :: Ord a => FunctionType a -> a # minimum :: Ord a => FunctionType a -> a # sum :: Num a => FunctionType a -> a # product :: Num a => FunctionType a -> a #
Traversable FunctionType Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> FunctionType a -> f (FunctionType b) # sequenceA :: Applicative f => FunctionType (f a) -> f (FunctionType a) # mapM :: Monad m => (a -> m b) -> FunctionType a -> m (FunctionType b) # sequence :: Monad m => FunctionType (m a) -> m (FunctionType a) #
SymbolMatching FunctionType Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy FunctionType -> Node -> Bool showFailure :: Proxy FunctionType -> Node -> String
Unmarshal FunctionType Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (FunctionType a)
Eq a => Eq (FunctionType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: FunctionType a -> FunctionType a -> Bool # (/=) :: FunctionType a -> FunctionType a -> Bool #
Ord a => Ord (FunctionType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: FunctionType a -> FunctionType a -> Ordering # (<) :: FunctionType a -> FunctionType a -> Bool # (<=) :: FunctionType a -> FunctionType a -> Bool # (>) :: FunctionType a -> FunctionType a -> Bool # (>=) :: FunctionType a -> FunctionType a -> Bool # max :: FunctionType a -> FunctionType a -> FunctionType a # min :: FunctionType a -> FunctionType a -> FunctionType a #
Show a => Show (FunctionType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> FunctionType a -> ShowS # show :: FunctionType a -> String # showList :: [FunctionType a] -> ShowS #
Generic (FunctionType a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (FunctionType a) :: Type -> Type # Methods from :: FunctionType a -> Rep (FunctionType a) x # to :: Rep (FunctionType a) x -> FunctionType a #
Generic1 FunctionType Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 FunctionType :: k -> Type # Methods from1 :: forall (a :: k). FunctionType a -> Rep1 FunctionType a # to1 :: forall (a :: k). Rep1 FunctionType a -> FunctionType a #
type Rep (FunctionType a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (FunctionType a) = D1 ('MetaData "FunctionType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "FunctionType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "result") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe ((SimpleType :+: ParameterList) a))) :: S1 ('MetaSel ('Just "parameters") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ParameterList a)))))
type Rep1 FunctionType Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 FunctionType = D1 ('MetaData "FunctionType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "FunctionType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "result") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 (SimpleType :+: ParameterList)) :: S1 ('MetaSel ('Just "parameters") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 ParameterList))))

data FunctionDeclaration a Source #

Constructors

FunctionDeclaration
Fields ann :: a body :: (Maybe (Block a)) result :: (Maybe ((:+:) SimpleType ParameterList a)) name :: (Identifier a) parameters :: (ParameterList a)

Instances

Instances details

Functor FunctionDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> FunctionDeclaration a -> FunctionDeclaration b # (<$) :: a -> FunctionDeclaration b -> FunctionDeclaration a #
Foldable FunctionDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => FunctionDeclaration m -> m # foldMap :: Monoid m => (a -> m) -> FunctionDeclaration a -> m # foldMap' :: Monoid m => (a -> m) -> FunctionDeclaration a -> m # foldr :: (a -> b -> b) -> b -> FunctionDeclaration a -> b # foldr' :: (a -> b -> b) -> b -> FunctionDeclaration a -> b # foldl :: (b -> a -> b) -> b -> FunctionDeclaration a -> b # foldl' :: (b -> a -> b) -> b -> FunctionDeclaration a -> b # foldr1 :: (a -> a -> a) -> FunctionDeclaration a -> a # foldl1 :: (a -> a -> a) -> FunctionDeclaration a -> a # toList :: FunctionDeclaration a -> [a] # null :: FunctionDeclaration a -> Bool # length :: FunctionDeclaration a -> Int # elem :: Eq a => a -> FunctionDeclaration a -> Bool # maximum :: Ord a => FunctionDeclaration a -> a # minimum :: Ord a => FunctionDeclaration a -> a # sum :: Num a => FunctionDeclaration a -> a # product :: Num a => FunctionDeclaration a -> a #
Traversable FunctionDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> FunctionDeclaration a -> f (FunctionDeclaration b) # sequenceA :: Applicative f => FunctionDeclaration (f a) -> f (FunctionDeclaration a) # mapM :: Monad m => (a -> m b) -> FunctionDeclaration a -> m (FunctionDeclaration b) # sequence :: Monad m => FunctionDeclaration (m a) -> m (FunctionDeclaration a) #
SymbolMatching FunctionDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy FunctionDeclaration -> Node -> Bool showFailure :: Proxy FunctionDeclaration -> Node -> String
Unmarshal FunctionDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (FunctionDeclaration a)
Eq a => Eq (FunctionDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: FunctionDeclaration a -> FunctionDeclaration a -> Bool # (/=) :: FunctionDeclaration a -> FunctionDeclaration a -> Bool #
Ord a => Ord (FunctionDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: FunctionDeclaration a -> FunctionDeclaration a -> Ordering # (<) :: FunctionDeclaration a -> FunctionDeclaration a -> Bool # (<=) :: FunctionDeclaration a -> FunctionDeclaration a -> Bool # (>) :: FunctionDeclaration a -> FunctionDeclaration a -> Bool # (>=) :: FunctionDeclaration a -> FunctionDeclaration a -> Bool # max :: FunctionDeclaration a -> FunctionDeclaration a -> FunctionDeclaration a # min :: FunctionDeclaration a -> FunctionDeclaration a -> FunctionDeclaration a #
Show a => Show (FunctionDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> FunctionDeclaration a -> ShowS # show :: FunctionDeclaration a -> String # showList :: [FunctionDeclaration a] -> ShowS #
Generic (FunctionDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (FunctionDeclaration a) :: Type -> Type # Methods from :: FunctionDeclaration a -> Rep (FunctionDeclaration a) x # to :: Rep (FunctionDeclaration a) x -> FunctionDeclaration a #
Generic1 FunctionDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 FunctionDeclaration :: k -> Type # Methods from1 :: forall (a :: k). FunctionDeclaration a -> Rep1 FunctionDeclaration a # to1 :: forall (a :: k). Rep1 FunctionDeclaration a -> FunctionDeclaration a #
type Rep (FunctionDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (FunctionDeclaration a) = D1 ('MetaData "FunctionDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "FunctionDeclaration" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: S1 ('MetaSel ('Just "body") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Block a)))) :: (S1 ('MetaSel ('Just "result") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe ((SimpleType :+: ParameterList) a))) :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Identifier a)) :: S1 ('MetaSel ('Just "parameters") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ParameterList a))))))
type Rep1 FunctionDeclaration Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 FunctionDeclaration = D1 ('MetaData "FunctionDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "FunctionDeclaration" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: S1 ('MetaSel ('Just "body") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 Block)) :: (S1 ('MetaSel ('Just "result") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 (SimpleType :+: ParameterList)) :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Identifier) :: S1 ('MetaSel ('Just "parameters") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 ParameterList)))))

data FuncLiteral a Source #

Constructors

FuncLiteral
Fields ann :: a body :: (Block a) result :: (Maybe ((:+:) SimpleType ParameterList a)) parameters :: (ParameterList a)

Instances

Instances details

Functor FuncLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> FuncLiteral a -> FuncLiteral b # (<$) :: a -> FuncLiteral b -> FuncLiteral a #
Foldable FuncLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => FuncLiteral m -> m # foldMap :: Monoid m => (a -> m) -> FuncLiteral a -> m # foldMap' :: Monoid m => (a -> m) -> FuncLiteral a -> m # foldr :: (a -> b -> b) -> b -> FuncLiteral a -> b # foldr' :: (a -> b -> b) -> b -> FuncLiteral a -> b # foldl :: (b -> a -> b) -> b -> FuncLiteral a -> b # foldl' :: (b -> a -> b) -> b -> FuncLiteral a -> b # foldr1 :: (a -> a -> a) -> FuncLiteral a -> a # foldl1 :: (a -> a -> a) -> FuncLiteral a -> a # toList :: FuncLiteral a -> [a] # null :: FuncLiteral a -> Bool # length :: FuncLiteral a -> Int # elem :: Eq a => a -> FuncLiteral a -> Bool # maximum :: Ord a => FuncLiteral a -> a # minimum :: Ord a => FuncLiteral a -> a # sum :: Num a => FuncLiteral a -> a # product :: Num a => FuncLiteral a -> a #
Traversable FuncLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> FuncLiteral a -> f (FuncLiteral b) # sequenceA :: Applicative f => FuncLiteral (f a) -> f (FuncLiteral a) # mapM :: Monad m => (a -> m b) -> FuncLiteral a -> m (FuncLiteral b) # sequence :: Monad m => FuncLiteral (m a) -> m (FuncLiteral a) #
SymbolMatching FuncLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy FuncLiteral -> Node -> Bool showFailure :: Proxy FuncLiteral -> Node -> String
Unmarshal FuncLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (FuncLiteral a)
Eq a => Eq (FuncLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: FuncLiteral a -> FuncLiteral a -> Bool # (/=) :: FuncLiteral a -> FuncLiteral a -> Bool #
Ord a => Ord (FuncLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: FuncLiteral a -> FuncLiteral a -> Ordering # (<) :: FuncLiteral a -> FuncLiteral a -> Bool # (<=) :: FuncLiteral a -> FuncLiteral a -> Bool # (>) :: FuncLiteral a -> FuncLiteral a -> Bool # (>=) :: FuncLiteral a -> FuncLiteral a -> Bool # max :: FuncLiteral a -> FuncLiteral a -> FuncLiteral a # min :: FuncLiteral a -> FuncLiteral a -> FuncLiteral a #
Show a => Show (FuncLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> FuncLiteral a -> ShowS # show :: FuncLiteral a -> String # showList :: [FuncLiteral a] -> ShowS #
Generic (FuncLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (FuncLiteral a) :: Type -> Type # Methods from :: FuncLiteral a -> Rep (FuncLiteral a) x # to :: Rep (FuncLiteral a) x -> FuncLiteral a #
Generic1 FuncLiteral Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 FuncLiteral :: k -> Type # Methods from1 :: forall (a :: k). FuncLiteral a -> Rep1 FuncLiteral a # to1 :: forall (a :: k). Rep1 FuncLiteral a -> FuncLiteral a #
type Rep (FuncLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (FuncLiteral a) = D1 ('MetaData "FuncLiteral" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "FuncLiteral" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: S1 ('MetaSel ('Just "body") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Block a))) :: (S1 ('MetaSel ('Just "result") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe ((SimpleType :+: ParameterList) a))) :*: S1 ('MetaSel ('Just "parameters") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ParameterList a)))))
type Rep1 FuncLiteral Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 FuncLiteral = D1 ('MetaData "FuncLiteral" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "FuncLiteral" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: S1 ('MetaSel ('Just "body") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Block)) :: (S1 ('MetaSel ('Just "result") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 (SimpleType :+: ParameterList)) :*: S1 ('MetaSel ('Just "parameters") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 ParameterList))))

data ForStatement a Source #

Constructors

ForStatement
Fields ann :: a body :: (Block a) extraChildren :: (Maybe ((:+:) Expression ((:+:) ForClause RangeClause) a))

Instances

Instances details

Functor ForStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ForStatement a -> ForStatement b # (<$) :: a -> ForStatement b -> ForStatement a #
Foldable ForStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ForStatement m -> m # foldMap :: Monoid m => (a -> m) -> ForStatement a -> m # foldMap' :: Monoid m => (a -> m) -> ForStatement a -> m # foldr :: (a -> b -> b) -> b -> ForStatement a -> b # foldr' :: (a -> b -> b) -> b -> ForStatement a -> b # foldl :: (b -> a -> b) -> b -> ForStatement a -> b # foldl' :: (b -> a -> b) -> b -> ForStatement a -> b # foldr1 :: (a -> a -> a) -> ForStatement a -> a # foldl1 :: (a -> a -> a) -> ForStatement a -> a # toList :: ForStatement a -> [a] # null :: ForStatement a -> Bool # length :: ForStatement a -> Int # elem :: Eq a => a -> ForStatement a -> Bool # maximum :: Ord a => ForStatement a -> a # minimum :: Ord a => ForStatement a -> a # sum :: Num a => ForStatement a -> a # product :: Num a => ForStatement a -> a #
Traversable ForStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ForStatement a -> f (ForStatement b) # sequenceA :: Applicative f => ForStatement (f a) -> f (ForStatement a) # mapM :: Monad m => (a -> m b) -> ForStatement a -> m (ForStatement b) # sequence :: Monad m => ForStatement (m a) -> m (ForStatement a) #
SymbolMatching ForStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ForStatement -> Node -> Bool showFailure :: Proxy ForStatement -> Node -> String
Unmarshal ForStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ForStatement a)
Eq a => Eq (ForStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ForStatement a -> ForStatement a -> Bool # (/=) :: ForStatement a -> ForStatement a -> Bool #
Ord a => Ord (ForStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ForStatement a -> ForStatement a -> Ordering # (<) :: ForStatement a -> ForStatement a -> Bool # (<=) :: ForStatement a -> ForStatement a -> Bool # (>) :: ForStatement a -> ForStatement a -> Bool # (>=) :: ForStatement a -> ForStatement a -> Bool # max :: ForStatement a -> ForStatement a -> ForStatement a # min :: ForStatement a -> ForStatement a -> ForStatement a #
Show a => Show (ForStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ForStatement a -> ShowS # show :: ForStatement a -> String # showList :: [ForStatement a] -> ShowS #
Generic (ForStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ForStatement a) :: Type -> Type # Methods from :: ForStatement a -> Rep (ForStatement a) x # to :: Rep (ForStatement a) x -> ForStatement a #
Generic1 ForStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ForStatement :: k -> Type # Methods from1 :: forall (a :: k). ForStatement a -> Rep1 ForStatement a # to1 :: forall (a :: k). Rep1 ForStatement a -> ForStatement a #
type Rep (ForStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ForStatement a) = D1 ('MetaData "ForStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ForStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "body") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Block a)) :: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe ((Expression :+: (ForClause :+: RangeClause)) a))))))
type Rep1 ForStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ForStatement = D1 ('MetaData "ForStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ForStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "body") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Block) :: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 (Expression :+: (ForClause :+: RangeClause))))))

data ForClause a Source #

Constructors

ForClause
Fields ann :: a initializer :: (Maybe (SimpleStatement a)) condition :: (Maybe (Expression a)) update :: (Maybe (SimpleStatement a))

Instances

Instances details

Functor ForClause Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ForClause a -> ForClause b # (<$) :: a -> ForClause b -> ForClause a #
Foldable ForClause Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ForClause m -> m # foldMap :: Monoid m => (a -> m) -> ForClause a -> m # foldMap' :: Monoid m => (a -> m) -> ForClause a -> m # foldr :: (a -> b -> b) -> b -> ForClause a -> b # foldr' :: (a -> b -> b) -> b -> ForClause a -> b # foldl :: (b -> a -> b) -> b -> ForClause a -> b # foldl' :: (b -> a -> b) -> b -> ForClause a -> b # foldr1 :: (a -> a -> a) -> ForClause a -> a # foldl1 :: (a -> a -> a) -> ForClause a -> a # toList :: ForClause a -> [a] # null :: ForClause a -> Bool # length :: ForClause a -> Int # elem :: Eq a => a -> ForClause a -> Bool # maximum :: Ord a => ForClause a -> a # minimum :: Ord a => ForClause a -> a # sum :: Num a => ForClause a -> a # product :: Num a => ForClause a -> a #
Traversable ForClause Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ForClause a -> f (ForClause b) # sequenceA :: Applicative f => ForClause (f a) -> f (ForClause a) # mapM :: Monad m => (a -> m b) -> ForClause a -> m (ForClause b) # sequence :: Monad m => ForClause (m a) -> m (ForClause a) #
SymbolMatching ForClause Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ForClause -> Node -> Bool showFailure :: Proxy ForClause -> Node -> String
Unmarshal ForClause Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ForClause a)
Eq a => Eq (ForClause a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ForClause a -> ForClause a -> Bool # (/=) :: ForClause a -> ForClause a -> Bool #
Ord a => Ord (ForClause a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ForClause a -> ForClause a -> Ordering # (<) :: ForClause a -> ForClause a -> Bool # (<=) :: ForClause a -> ForClause a -> Bool # (>) :: ForClause a -> ForClause a -> Bool # (>=) :: ForClause a -> ForClause a -> Bool # max :: ForClause a -> ForClause a -> ForClause a # min :: ForClause a -> ForClause a -> ForClause a #
Show a => Show (ForClause a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ForClause a -> ShowS # show :: ForClause a -> String # showList :: [ForClause a] -> ShowS #
Generic (ForClause a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ForClause a) :: Type -> Type # Methods from :: ForClause a -> Rep (ForClause a) x # to :: Rep (ForClause a) x -> ForClause a #
Generic1 ForClause Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ForClause :: k -> Type # Methods from1 :: forall (a :: k). ForClause a -> Rep1 ForClause a # to1 :: forall (a :: k). Rep1 ForClause a -> ForClause a #
type Rep (ForClause a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ForClause a) = D1 ('MetaData "ForClause" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ForClause" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: S1 ('MetaSel ('Just "initializer") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (SimpleStatement a)))) :: (S1 ('MetaSel ('Just "condition") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Expression a))) :*: S1 ('MetaSel ('Just "update") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (SimpleStatement a))))))
type Rep1 ForClause Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ForClause = D1 ('MetaData "ForClause" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ForClause" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: S1 ('MetaSel ('Just "initializer") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 SimpleStatement)) :: (S1 ('MetaSel ('Just "condition") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 Expression) :*: S1 ('MetaSel ('Just "update") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 SimpleStatement))))

data FieldDeclarationList a Source #

Constructors

FieldDeclarationList
Fields ann :: a extraChildren :: ([] (FieldDeclaration a))

Instances

Instances details

Functor FieldDeclarationList Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> FieldDeclarationList a -> FieldDeclarationList b # (<$) :: a -> FieldDeclarationList b -> FieldDeclarationList a #
Foldable FieldDeclarationList Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => FieldDeclarationList m -> m # foldMap :: Monoid m => (a -> m) -> FieldDeclarationList a -> m # foldMap' :: Monoid m => (a -> m) -> FieldDeclarationList a -> m # foldr :: (a -> b -> b) -> b -> FieldDeclarationList a -> b # foldr' :: (a -> b -> b) -> b -> FieldDeclarationList a -> b # foldl :: (b -> a -> b) -> b -> FieldDeclarationList a -> b # foldl' :: (b -> a -> b) -> b -> FieldDeclarationList a -> b # foldr1 :: (a -> a -> a) -> FieldDeclarationList a -> a # foldl1 :: (a -> a -> a) -> FieldDeclarationList a -> a # toList :: FieldDeclarationList a -> [a] # null :: FieldDeclarationList a -> Bool # length :: FieldDeclarationList a -> Int # elem :: Eq a => a -> FieldDeclarationList a -> Bool # maximum :: Ord a => FieldDeclarationList a -> a # minimum :: Ord a => FieldDeclarationList a -> a # sum :: Num a => FieldDeclarationList a -> a # product :: Num a => FieldDeclarationList a -> a #
Traversable FieldDeclarationList Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> FieldDeclarationList a -> f (FieldDeclarationList b) # sequenceA :: Applicative f => FieldDeclarationList (f a) -> f (FieldDeclarationList a) # mapM :: Monad m => (a -> m b) -> FieldDeclarationList a -> m (FieldDeclarationList b) # sequence :: Monad m => FieldDeclarationList (m a) -> m (FieldDeclarationList a) #
SymbolMatching FieldDeclarationList Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy FieldDeclarationList -> Node -> Bool showFailure :: Proxy FieldDeclarationList -> Node -> String
Unmarshal FieldDeclarationList Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (FieldDeclarationList a)
Eq a => Eq (FieldDeclarationList a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: FieldDeclarationList a -> FieldDeclarationList a -> Bool # (/=) :: FieldDeclarationList a -> FieldDeclarationList a -> Bool #
Ord a => Ord (FieldDeclarationList a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: FieldDeclarationList a -> FieldDeclarationList a -> Ordering # (<) :: FieldDeclarationList a -> FieldDeclarationList a -> Bool # (<=) :: FieldDeclarationList a -> FieldDeclarationList a -> Bool # (>) :: FieldDeclarationList a -> FieldDeclarationList a -> Bool # (>=) :: FieldDeclarationList a -> FieldDeclarationList a -> Bool # max :: FieldDeclarationList a -> FieldDeclarationList a -> FieldDeclarationList a # min :: FieldDeclarationList a -> FieldDeclarationList a -> FieldDeclarationList a #
Show a => Show (FieldDeclarationList a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> FieldDeclarationList a -> ShowS # show :: FieldDeclarationList a -> String # showList :: [FieldDeclarationList a] -> ShowS #
Generic (FieldDeclarationList a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (FieldDeclarationList a) :: Type -> Type # Methods from :: FieldDeclarationList a -> Rep (FieldDeclarationList a) x # to :: Rep (FieldDeclarationList a) x -> FieldDeclarationList a #
Generic1 FieldDeclarationList Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 FieldDeclarationList :: k -> Type # Methods from1 :: forall (a :: k). FieldDeclarationList a -> Rep1 FieldDeclarationList a # to1 :: forall (a :: k). Rep1 FieldDeclarationList a -> FieldDeclarationList a #
type Rep (FieldDeclarationList a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (FieldDeclarationList a) = D1 ('MetaData "FieldDeclarationList" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "FieldDeclarationList" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [FieldDeclaration a])))
type Rep1 FieldDeclarationList Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 FieldDeclarationList = D1 ('MetaData "FieldDeclarationList" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "FieldDeclarationList" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 FieldDeclaration)))

data FieldDeclaration a Source #

Constructors

FieldDeclaration
Fields ann :: a tag :: (Maybe ((:+:) InterpretedStringLiteral RawStringLiteral a)) name :: ([] ((:+:) AnonymousComma FieldIdentifier a)) type' :: ((:+:) Type ((:+:) QualifiedType TypeIdentifier) a)

Instances

Instances details

Functor FieldDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> FieldDeclaration a -> FieldDeclaration b # (<$) :: a -> FieldDeclaration b -> FieldDeclaration a #
Foldable FieldDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => FieldDeclaration m -> m # foldMap :: Monoid m => (a -> m) -> FieldDeclaration a -> m # foldMap' :: Monoid m => (a -> m) -> FieldDeclaration a -> m # foldr :: (a -> b -> b) -> b -> FieldDeclaration a -> b # foldr' :: (a -> b -> b) -> b -> FieldDeclaration a -> b # foldl :: (b -> a -> b) -> b -> FieldDeclaration a -> b # foldl' :: (b -> a -> b) -> b -> FieldDeclaration a -> b # foldr1 :: (a -> a -> a) -> FieldDeclaration a -> a # foldl1 :: (a -> a -> a) -> FieldDeclaration a -> a # toList :: FieldDeclaration a -> [a] # null :: FieldDeclaration a -> Bool # length :: FieldDeclaration a -> Int # elem :: Eq a => a -> FieldDeclaration a -> Bool # maximum :: Ord a => FieldDeclaration a -> a # minimum :: Ord a => FieldDeclaration a -> a # sum :: Num a => FieldDeclaration a -> a # product :: Num a => FieldDeclaration a -> a #
Traversable FieldDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> FieldDeclaration a -> f (FieldDeclaration b) # sequenceA :: Applicative f => FieldDeclaration (f a) -> f (FieldDeclaration a) # mapM :: Monad m => (a -> m b) -> FieldDeclaration a -> m (FieldDeclaration b) # sequence :: Monad m => FieldDeclaration (m a) -> m (FieldDeclaration a) #
SymbolMatching FieldDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy FieldDeclaration -> Node -> Bool showFailure :: Proxy FieldDeclaration -> Node -> String
Unmarshal FieldDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (FieldDeclaration a)
Eq a => Eq (FieldDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: FieldDeclaration a -> FieldDeclaration a -> Bool # (/=) :: FieldDeclaration a -> FieldDeclaration a -> Bool #
Ord a => Ord (FieldDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: FieldDeclaration a -> FieldDeclaration a -> Ordering # (<) :: FieldDeclaration a -> FieldDeclaration a -> Bool # (<=) :: FieldDeclaration a -> FieldDeclaration a -> Bool # (>) :: FieldDeclaration a -> FieldDeclaration a -> Bool # (>=) :: FieldDeclaration a -> FieldDeclaration a -> Bool # max :: FieldDeclaration a -> FieldDeclaration a -> FieldDeclaration a # min :: FieldDeclaration a -> FieldDeclaration a -> FieldDeclaration a #
Show a => Show (FieldDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> FieldDeclaration a -> ShowS # show :: FieldDeclaration a -> String # showList :: [FieldDeclaration a] -> ShowS #
Generic (FieldDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (FieldDeclaration a) :: Type -> Type # Methods from :: FieldDeclaration a -> Rep (FieldDeclaration a) x # to :: Rep (FieldDeclaration a) x -> FieldDeclaration a #
Generic1 FieldDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 FieldDeclaration :: k -> Type # Methods from1 :: forall (a :: k). FieldDeclaration a -> Rep1 FieldDeclaration a # to1 :: forall (a :: k). Rep1 FieldDeclaration a -> FieldDeclaration a #
type Rep (FieldDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (FieldDeclaration a) = D1 ('MetaData "FieldDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "FieldDeclaration" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: S1 ('MetaSel ('Just "tag") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe ((InterpretedStringLiteral :+: RawStringLiteral) a)))) :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(AnonymousComma :+: FieldIdentifier) a]) :*: S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ((Type :+: (QualifiedType :+: TypeIdentifier)) a)))))
type Rep1 FieldDeclaration Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 FieldDeclaration = D1 ('MetaData "FieldDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "FieldDeclaration" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: S1 ('MetaSel ('Just "tag") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 (InterpretedStringLiteral :+: RawStringLiteral))) :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 (AnonymousComma :+: FieldIdentifier)) :*: S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 (Type :+: (QualifiedType :+: TypeIdentifier))))))

data FallthroughStatement a Source #

Constructors

FallthroughStatement
Fields ann :: a text :: Text

Instances

Instances details

Functor FallthroughStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> FallthroughStatement a -> FallthroughStatement b # (<$) :: a -> FallthroughStatement b -> FallthroughStatement a #
Foldable FallthroughStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => FallthroughStatement m -> m # foldMap :: Monoid m => (a -> m) -> FallthroughStatement a -> m # foldMap' :: Monoid m => (a -> m) -> FallthroughStatement a -> m # foldr :: (a -> b -> b) -> b -> FallthroughStatement a -> b # foldr' :: (a -> b -> b) -> b -> FallthroughStatement a -> b # foldl :: (b -> a -> b) -> b -> FallthroughStatement a -> b # foldl' :: (b -> a -> b) -> b -> FallthroughStatement a -> b # foldr1 :: (a -> a -> a) -> FallthroughStatement a -> a # foldl1 :: (a -> a -> a) -> FallthroughStatement a -> a # toList :: FallthroughStatement a -> [a] # null :: FallthroughStatement a -> Bool # length :: FallthroughStatement a -> Int # elem :: Eq a => a -> FallthroughStatement a -> Bool # maximum :: Ord a => FallthroughStatement a -> a # minimum :: Ord a => FallthroughStatement a -> a # sum :: Num a => FallthroughStatement a -> a # product :: Num a => FallthroughStatement a -> a #
Traversable FallthroughStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> FallthroughStatement a -> f (FallthroughStatement b) # sequenceA :: Applicative f => FallthroughStatement (f a) -> f (FallthroughStatement a) # mapM :: Monad m => (a -> m b) -> FallthroughStatement a -> m (FallthroughStatement b) # sequence :: Monad m => FallthroughStatement (m a) -> m (FallthroughStatement a) #
SymbolMatching FallthroughStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy FallthroughStatement -> Node -> Bool showFailure :: Proxy FallthroughStatement -> Node -> String
Unmarshal FallthroughStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (FallthroughStatement a)
Eq a => Eq (FallthroughStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: FallthroughStatement a -> FallthroughStatement a -> Bool # (/=) :: FallthroughStatement a -> FallthroughStatement a -> Bool #
Ord a => Ord (FallthroughStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: FallthroughStatement a -> FallthroughStatement a -> Ordering # (<) :: FallthroughStatement a -> FallthroughStatement a -> Bool # (<=) :: FallthroughStatement a -> FallthroughStatement a -> Bool # (>) :: FallthroughStatement a -> FallthroughStatement a -> Bool # (>=) :: FallthroughStatement a -> FallthroughStatement a -> Bool # max :: FallthroughStatement a -> FallthroughStatement a -> FallthroughStatement a # min :: FallthroughStatement a -> FallthroughStatement a -> FallthroughStatement a #
Show a => Show (FallthroughStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> FallthroughStatement a -> ShowS # show :: FallthroughStatement a -> String # showList :: [FallthroughStatement a] -> ShowS #
Generic (FallthroughStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (FallthroughStatement a) :: Type -> Type # Methods from :: FallthroughStatement a -> Rep (FallthroughStatement a) x # to :: Rep (FallthroughStatement a) x -> FallthroughStatement a #
Generic1 FallthroughStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 FallthroughStatement :: k -> Type # Methods from1 :: forall (a :: k). FallthroughStatement a -> Rep1 FallthroughStatement a # to1 :: forall (a :: k). Rep1 FallthroughStatement a -> FallthroughStatement a #
type Rep (FallthroughStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (FallthroughStatement a) = D1 ('MetaData "FallthroughStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "FallthroughStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Rep1 FallthroughStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 FallthroughStatement = D1 ('MetaData "FallthroughStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "FallthroughStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

data ExpressionSwitchStatement a Source #

Constructors

ExpressionSwitchStatement
Fields ann :: a value :: (Maybe (Expression a)) initializer :: (Maybe (SimpleStatement a)) extraChildren :: ([] ((:+:) DefaultCase ExpressionCase a))

Instances

Instances details

Functor ExpressionSwitchStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ExpressionSwitchStatement a -> ExpressionSwitchStatement b # (<$) :: a -> ExpressionSwitchStatement b -> ExpressionSwitchStatement a #
Foldable ExpressionSwitchStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ExpressionSwitchStatement m -> m # foldMap :: Monoid m => (a -> m) -> ExpressionSwitchStatement a -> m # foldMap' :: Monoid m => (a -> m) -> ExpressionSwitchStatement a -> m # foldr :: (a -> b -> b) -> b -> ExpressionSwitchStatement a -> b # foldr' :: (a -> b -> b) -> b -> ExpressionSwitchStatement a -> b # foldl :: (b -> a -> b) -> b -> ExpressionSwitchStatement a -> b # foldl' :: (b -> a -> b) -> b -> ExpressionSwitchStatement a -> b # foldr1 :: (a -> a -> a) -> ExpressionSwitchStatement a -> a # foldl1 :: (a -> a -> a) -> ExpressionSwitchStatement a -> a # toList :: ExpressionSwitchStatement a -> [a] # null :: ExpressionSwitchStatement a -> Bool # length :: ExpressionSwitchStatement a -> Int # elem :: Eq a => a -> ExpressionSwitchStatement a -> Bool # maximum :: Ord a => ExpressionSwitchStatement a -> a # minimum :: Ord a => ExpressionSwitchStatement a -> a # sum :: Num a => ExpressionSwitchStatement a -> a # product :: Num a => ExpressionSwitchStatement a -> a #
Traversable ExpressionSwitchStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ExpressionSwitchStatement a -> f (ExpressionSwitchStatement b) # sequenceA :: Applicative f => ExpressionSwitchStatement (f a) -> f (ExpressionSwitchStatement a) # mapM :: Monad m => (a -> m b) -> ExpressionSwitchStatement a -> m (ExpressionSwitchStatement b) # sequence :: Monad m => ExpressionSwitchStatement (m a) -> m (ExpressionSwitchStatement a) #
SymbolMatching ExpressionSwitchStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ExpressionSwitchStatement -> Node -> Bool showFailure :: Proxy ExpressionSwitchStatement -> Node -> String
Unmarshal ExpressionSwitchStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ExpressionSwitchStatement a)
Eq a => Eq (ExpressionSwitchStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ExpressionSwitchStatement a -> ExpressionSwitchStatement a -> Bool # (/=) :: ExpressionSwitchStatement a -> ExpressionSwitchStatement a -> Bool #
Ord a => Ord (ExpressionSwitchStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ExpressionSwitchStatement a -> ExpressionSwitchStatement a -> Ordering # (<) :: ExpressionSwitchStatement a -> ExpressionSwitchStatement a -> Bool # (<=) :: ExpressionSwitchStatement a -> ExpressionSwitchStatement a -> Bool # (>) :: ExpressionSwitchStatement a -> ExpressionSwitchStatement a -> Bool # (>=) :: ExpressionSwitchStatement a -> ExpressionSwitchStatement a -> Bool # max :: ExpressionSwitchStatement a -> ExpressionSwitchStatement a -> ExpressionSwitchStatement a # min :: ExpressionSwitchStatement a -> ExpressionSwitchStatement a -> ExpressionSwitchStatement a #
Show a => Show (ExpressionSwitchStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ExpressionSwitchStatement a -> ShowS # show :: ExpressionSwitchStatement a -> String # showList :: [ExpressionSwitchStatement a] -> ShowS #
Generic (ExpressionSwitchStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ExpressionSwitchStatement a) :: Type -> Type # Methods from :: ExpressionSwitchStatement a -> Rep (ExpressionSwitchStatement a) x # to :: Rep (ExpressionSwitchStatement a) x -> ExpressionSwitchStatement a #
Generic1 ExpressionSwitchStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ExpressionSwitchStatement :: k -> Type # Methods from1 :: forall (a :: k). ExpressionSwitchStatement a -> Rep1 ExpressionSwitchStatement a # to1 :: forall (a :: k). Rep1 ExpressionSwitchStatement a -> ExpressionSwitchStatement a #
type Rep (ExpressionSwitchStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ExpressionSwitchStatement a) = D1 ('MetaData "ExpressionSwitchStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ExpressionSwitchStatement" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: S1 ('MetaSel ('Just "value") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Expression a)))) :: (S1 ('MetaSel ('Just "initializer") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (SimpleStatement a))) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(DefaultCase :+: ExpressionCase) a]))))
type Rep1 ExpressionSwitchStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ExpressionSwitchStatement = D1 ('MetaData "ExpressionSwitchStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ExpressionSwitchStatement" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: S1 ('MetaSel ('Just "value") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 Expression)) :: (S1 ('MetaSel ('Just "initializer") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 SimpleStatement) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 (DefaultCase :+: ExpressionCase)))))

data ExpressionList a Source #

Constructors

ExpressionList
Fields ann :: a extraChildren :: (NonEmpty (Expression a))

Instances

Instances details

Functor ExpressionList Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ExpressionList a -> ExpressionList b # (<$) :: a -> ExpressionList b -> ExpressionList a #
Foldable ExpressionList Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ExpressionList m -> m # foldMap :: Monoid m => (a -> m) -> ExpressionList a -> m # foldMap' :: Monoid m => (a -> m) -> ExpressionList a -> m # foldr :: (a -> b -> b) -> b -> ExpressionList a -> b # foldr' :: (a -> b -> b) -> b -> ExpressionList a -> b # foldl :: (b -> a -> b) -> b -> ExpressionList a -> b # foldl' :: (b -> a -> b) -> b -> ExpressionList a -> b # foldr1 :: (a -> a -> a) -> ExpressionList a -> a # foldl1 :: (a -> a -> a) -> ExpressionList a -> a # toList :: ExpressionList a -> [a] # null :: ExpressionList a -> Bool # length :: ExpressionList a -> Int # elem :: Eq a => a -> ExpressionList a -> Bool # maximum :: Ord a => ExpressionList a -> a # minimum :: Ord a => ExpressionList a -> a # sum :: Num a => ExpressionList a -> a # product :: Num a => ExpressionList a -> a #
Traversable ExpressionList Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ExpressionList a -> f (ExpressionList b) # sequenceA :: Applicative f => ExpressionList (f a) -> f (ExpressionList a) # mapM :: Monad m => (a -> m b) -> ExpressionList a -> m (ExpressionList b) # sequence :: Monad m => ExpressionList (m a) -> m (ExpressionList a) #
SymbolMatching ExpressionList Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ExpressionList -> Node -> Bool showFailure :: Proxy ExpressionList -> Node -> String
Unmarshal ExpressionList Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ExpressionList a)
Eq a => Eq (ExpressionList a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ExpressionList a -> ExpressionList a -> Bool # (/=) :: ExpressionList a -> ExpressionList a -> Bool #
Ord a => Ord (ExpressionList a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ExpressionList a -> ExpressionList a -> Ordering # (<) :: ExpressionList a -> ExpressionList a -> Bool # (<=) :: ExpressionList a -> ExpressionList a -> Bool # (>) :: ExpressionList a -> ExpressionList a -> Bool # (>=) :: ExpressionList a -> ExpressionList a -> Bool # max :: ExpressionList a -> ExpressionList a -> ExpressionList a # min :: ExpressionList a -> ExpressionList a -> ExpressionList a #
Show a => Show (ExpressionList a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ExpressionList a -> ShowS # show :: ExpressionList a -> String # showList :: [ExpressionList a] -> ShowS #
Generic (ExpressionList a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ExpressionList a) :: Type -> Type # Methods from :: ExpressionList a -> Rep (ExpressionList a) x # to :: Rep (ExpressionList a) x -> ExpressionList a #
Generic1 ExpressionList Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ExpressionList :: k -> Type # Methods from1 :: forall (a :: k). ExpressionList a -> Rep1 ExpressionList a # to1 :: forall (a :: k). Rep1 ExpressionList a -> ExpressionList a #
type Rep (ExpressionList a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ExpressionList a) = D1 ('MetaData "ExpressionList" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ExpressionList" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NonEmpty (Expression a)))))
type Rep1 ExpressionList Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ExpressionList = D1 ('MetaData "ExpressionList" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ExpressionList" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (NonEmpty :.: Rec1 Expression)))

data ExpressionCase a Source #

Constructors

ExpressionCase
Fields ann :: a value :: (ExpressionList a) extraChildren :: ([] (Statement a))

Instances

Instances details

Functor ExpressionCase Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ExpressionCase a -> ExpressionCase b # (<$) :: a -> ExpressionCase b -> ExpressionCase a #
Foldable ExpressionCase Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ExpressionCase m -> m # foldMap :: Monoid m => (a -> m) -> ExpressionCase a -> m # foldMap' :: Monoid m => (a -> m) -> ExpressionCase a -> m # foldr :: (a -> b -> b) -> b -> ExpressionCase a -> b # foldr' :: (a -> b -> b) -> b -> ExpressionCase a -> b # foldl :: (b -> a -> b) -> b -> ExpressionCase a -> b # foldl' :: (b -> a -> b) -> b -> ExpressionCase a -> b # foldr1 :: (a -> a -> a) -> ExpressionCase a -> a # foldl1 :: (a -> a -> a) -> ExpressionCase a -> a # toList :: ExpressionCase a -> [a] # null :: ExpressionCase a -> Bool # length :: ExpressionCase a -> Int # elem :: Eq a => a -> ExpressionCase a -> Bool # maximum :: Ord a => ExpressionCase a -> a # minimum :: Ord a => ExpressionCase a -> a # sum :: Num a => ExpressionCase a -> a # product :: Num a => ExpressionCase a -> a #
Traversable ExpressionCase Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ExpressionCase a -> f (ExpressionCase b) # sequenceA :: Applicative f => ExpressionCase (f a) -> f (ExpressionCase a) # mapM :: Monad m => (a -> m b) -> ExpressionCase a -> m (ExpressionCase b) # sequence :: Monad m => ExpressionCase (m a) -> m (ExpressionCase a) #
SymbolMatching ExpressionCase Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ExpressionCase -> Node -> Bool showFailure :: Proxy ExpressionCase -> Node -> String
Unmarshal ExpressionCase Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ExpressionCase a)
Eq a => Eq (ExpressionCase a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ExpressionCase a -> ExpressionCase a -> Bool # (/=) :: ExpressionCase a -> ExpressionCase a -> Bool #
Ord a => Ord (ExpressionCase a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ExpressionCase a -> ExpressionCase a -> Ordering # (<) :: ExpressionCase a -> ExpressionCase a -> Bool # (<=) :: ExpressionCase a -> ExpressionCase a -> Bool # (>) :: ExpressionCase a -> ExpressionCase a -> Bool # (>=) :: ExpressionCase a -> ExpressionCase a -> Bool # max :: ExpressionCase a -> ExpressionCase a -> ExpressionCase a # min :: ExpressionCase a -> ExpressionCase a -> ExpressionCase a #
Show a => Show (ExpressionCase a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ExpressionCase a -> ShowS # show :: ExpressionCase a -> String # showList :: [ExpressionCase a] -> ShowS #
Generic (ExpressionCase a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ExpressionCase a) :: Type -> Type # Methods from :: ExpressionCase a -> Rep (ExpressionCase a) x # to :: Rep (ExpressionCase a) x -> ExpressionCase a #
Generic1 ExpressionCase Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ExpressionCase :: k -> Type # Methods from1 :: forall (a :: k). ExpressionCase a -> Rep1 ExpressionCase a # to1 :: forall (a :: k). Rep1 ExpressionCase a -> ExpressionCase a #
type Rep (ExpressionCase a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ExpressionCase a) = D1 ('MetaData "ExpressionCase" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ExpressionCase" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "value") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ExpressionList a)) :: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Statement a]))))
type Rep1 ExpressionCase Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ExpressionCase = D1 ('MetaData "ExpressionCase" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ExpressionCase" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "value") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 ExpressionList) :: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 Statement))))

data EmptyStatement a Source #

Constructors

EmptyStatement
Fields ann :: a text :: Text

Instances

Instances details

Functor EmptyStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> EmptyStatement a -> EmptyStatement b # (<$) :: a -> EmptyStatement b -> EmptyStatement a #
Foldable EmptyStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => EmptyStatement m -> m # foldMap :: Monoid m => (a -> m) -> EmptyStatement a -> m # foldMap' :: Monoid m => (a -> m) -> EmptyStatement a -> m # foldr :: (a -> b -> b) -> b -> EmptyStatement a -> b # foldr' :: (a -> b -> b) -> b -> EmptyStatement a -> b # foldl :: (b -> a -> b) -> b -> EmptyStatement a -> b # foldl' :: (b -> a -> b) -> b -> EmptyStatement a -> b # foldr1 :: (a -> a -> a) -> EmptyStatement a -> a # foldl1 :: (a -> a -> a) -> EmptyStatement a -> a # toList :: EmptyStatement a -> [a] # null :: EmptyStatement a -> Bool # length :: EmptyStatement a -> Int # elem :: Eq a => a -> EmptyStatement a -> Bool # maximum :: Ord a => EmptyStatement a -> a # minimum :: Ord a => EmptyStatement a -> a # sum :: Num a => EmptyStatement a -> a # product :: Num a => EmptyStatement a -> a #
Traversable EmptyStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> EmptyStatement a -> f (EmptyStatement b) # sequenceA :: Applicative f => EmptyStatement (f a) -> f (EmptyStatement a) # mapM :: Monad m => (a -> m b) -> EmptyStatement a -> m (EmptyStatement b) # sequence :: Monad m => EmptyStatement (m a) -> m (EmptyStatement a) #
SymbolMatching EmptyStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy EmptyStatement -> Node -> Bool showFailure :: Proxy EmptyStatement -> Node -> String
Unmarshal EmptyStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (EmptyStatement a)
Eq a => Eq (EmptyStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: EmptyStatement a -> EmptyStatement a -> Bool # (/=) :: EmptyStatement a -> EmptyStatement a -> Bool #
Ord a => Ord (EmptyStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: EmptyStatement a -> EmptyStatement a -> Ordering # (<) :: EmptyStatement a -> EmptyStatement a -> Bool # (<=) :: EmptyStatement a -> EmptyStatement a -> Bool # (>) :: EmptyStatement a -> EmptyStatement a -> Bool # (>=) :: EmptyStatement a -> EmptyStatement a -> Bool # max :: EmptyStatement a -> EmptyStatement a -> EmptyStatement a # min :: EmptyStatement a -> EmptyStatement a -> EmptyStatement a #
Show a => Show (EmptyStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> EmptyStatement a -> ShowS # show :: EmptyStatement a -> String # showList :: [EmptyStatement a] -> ShowS #
Generic (EmptyStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (EmptyStatement a) :: Type -> Type # Methods from :: EmptyStatement a -> Rep (EmptyStatement a) x # to :: Rep (EmptyStatement a) x -> EmptyStatement a #
Generic1 EmptyStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 EmptyStatement :: k -> Type # Methods from1 :: forall (a :: k). EmptyStatement a -> Rep1 EmptyStatement a # to1 :: forall (a :: k). Rep1 EmptyStatement a -> EmptyStatement a #
type Rep (EmptyStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (EmptyStatement a) = D1 ('MetaData "EmptyStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "EmptyStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Rep1 EmptyStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 EmptyStatement = D1 ('MetaData "EmptyStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "EmptyStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

data Element a Source #

Constructors

Element
Fields ann :: a extraChildren :: ((:+:) Expression LiteralValue a)

Instances

Instances details

Functor Element Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> Element a -> Element b # (<$) :: a -> Element b -> Element a #
Foldable Element Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => Element m -> m # foldMap :: Monoid m => (a -> m) -> Element a -> m # foldMap' :: Monoid m => (a -> m) -> Element a -> m # foldr :: (a -> b -> b) -> b -> Element a -> b # foldr' :: (a -> b -> b) -> b -> Element a -> b # foldl :: (b -> a -> b) -> b -> Element a -> b # foldl' :: (b -> a -> b) -> b -> Element a -> b # foldr1 :: (a -> a -> a) -> Element a -> a # foldl1 :: (a -> a -> a) -> Element a -> a # toList :: Element a -> [a] # null :: Element a -> Bool # length :: Element a -> Int # elem :: Eq a => a -> Element a -> Bool # maximum :: Ord a => Element a -> a # minimum :: Ord a => Element a -> a # sum :: Num a => Element a -> a # product :: Num a => Element a -> a #
Traversable Element Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> Element a -> f (Element b) # sequenceA :: Applicative f => Element (f a) -> f (Element a) # mapM :: Monad m => (a -> m b) -> Element a -> m (Element b) # sequence :: Monad m => Element (m a) -> m (Element a) #
SymbolMatching Element Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy Element -> Node -> Bool showFailure :: Proxy Element -> Node -> String
Unmarshal Element Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (Element a)
Eq a => Eq (Element a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: Element a -> Element a -> Bool # (/=) :: Element a -> Element a -> Bool #
Ord a => Ord (Element a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: Element a -> Element a -> Ordering # (<) :: Element a -> Element a -> Bool # (<=) :: Element a -> Element a -> Bool # (>) :: Element a -> Element a -> Bool # (>=) :: Element a -> Element a -> Bool # max :: Element a -> Element a -> Element a # min :: Element a -> Element a -> Element a #
Show a => Show (Element a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> Element a -> ShowS # show :: Element a -> String # showList :: [Element a] -> ShowS #
Generic (Element a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (Element a) :: Type -> Type # Methods from :: Element a -> Rep (Element a) x # to :: Rep (Element a) x -> Element a #
Generic1 Element Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 Element :: k -> Type # Methods from1 :: forall (a :: k). Element a -> Rep1 Element a # to1 :: forall (a :: k). Rep1 Element a -> Element a #
type Rep (Element a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (Element a) = D1 ('MetaData "Element" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "Element" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ((Expression :+: LiteralValue) a))))
type Rep1 Element Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 Element = D1 ('MetaData "Element" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "Element" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 (Expression :+: LiteralValue))))

data Dot a Source #

Constructors

Dot
Fields ann :: a text :: Text

Instances

Instances details

Functor Dot Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> Dot a -> Dot b # (<$) :: a -> Dot b -> Dot a #
Foldable Dot Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => Dot m -> m # foldMap :: Monoid m => (a -> m) -> Dot a -> m # foldMap' :: Monoid m => (a -> m) -> Dot a -> m # foldr :: (a -> b -> b) -> b -> Dot a -> b # foldr' :: (a -> b -> b) -> b -> Dot a -> b # foldl :: (b -> a -> b) -> b -> Dot a -> b # foldl' :: (b -> a -> b) -> b -> Dot a -> b # foldr1 :: (a -> a -> a) -> Dot a -> a # foldl1 :: (a -> a -> a) -> Dot a -> a # toList :: Dot a -> [a] # null :: Dot a -> Bool # length :: Dot a -> Int # elem :: Eq a => a -> Dot a -> Bool # maximum :: Ord a => Dot a -> a # minimum :: Ord a => Dot a -> a # sum :: Num a => Dot a -> a # product :: Num a => Dot a -> a #
Traversable Dot Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> Dot a -> f (Dot b) # sequenceA :: Applicative f => Dot (f a) -> f (Dot a) # mapM :: Monad m => (a -> m b) -> Dot a -> m (Dot b) # sequence :: Monad m => Dot (m a) -> m (Dot a) #
SymbolMatching Dot Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy Dot -> Node -> Bool showFailure :: Proxy Dot -> Node -> String
Unmarshal Dot Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (Dot a)
Eq a => Eq (Dot a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: Dot a -> Dot a -> Bool # (/=) :: Dot a -> Dot a -> Bool #
Ord a => Ord (Dot a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: Dot a -> Dot a -> Ordering # (<) :: Dot a -> Dot a -> Bool # (<=) :: Dot a -> Dot a -> Bool # (>) :: Dot a -> Dot a -> Bool # (>=) :: Dot a -> Dot a -> Bool # max :: Dot a -> Dot a -> Dot a # min :: Dot a -> Dot a -> Dot a #
Show a => Show (Dot a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> Dot a -> ShowS # show :: Dot a -> String # showList :: [Dot a] -> ShowS #
Generic (Dot a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (Dot a) :: Type -> Type # Methods from :: Dot a -> Rep (Dot a) x # to :: Rep (Dot a) x -> Dot a #
Generic1 Dot Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 Dot :: k -> Type # Methods from1 :: forall (a :: k). Dot a -> Rep1 Dot a # to1 :: forall (a :: k). Rep1 Dot a -> Dot a #
type Rep (Dot a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (Dot a) = D1 ('MetaData "Dot" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "Dot" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))
type Rep1 Dot Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 Dot = D1 ('MetaData "Dot" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "Dot" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "text") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)))

data DeferStatement a Source #

Constructors

DeferStatement
Fields ann :: a extraChildren :: (Expression a)

Instances

Instances details

Functor DeferStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> DeferStatement a -> DeferStatement b # (<$) :: a -> DeferStatement b -> DeferStatement a #
Foldable DeferStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => DeferStatement m -> m # foldMap :: Monoid m => (a -> m) -> DeferStatement a -> m # foldMap' :: Monoid m => (a -> m) -> DeferStatement a -> m # foldr :: (a -> b -> b) -> b -> DeferStatement a -> b # foldr' :: (a -> b -> b) -> b -> DeferStatement a -> b # foldl :: (b -> a -> b) -> b -> DeferStatement a -> b # foldl' :: (b -> a -> b) -> b -> DeferStatement a -> b # foldr1 :: (a -> a -> a) -> DeferStatement a -> a # foldl1 :: (a -> a -> a) -> DeferStatement a -> a # toList :: DeferStatement a -> [a] # null :: DeferStatement a -> Bool # length :: DeferStatement a -> Int # elem :: Eq a => a -> DeferStatement a -> Bool # maximum :: Ord a => DeferStatement a -> a # minimum :: Ord a => DeferStatement a -> a # sum :: Num a => DeferStatement a -> a # product :: Num a => DeferStatement a -> a #
Traversable DeferStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> DeferStatement a -> f (DeferStatement b) # sequenceA :: Applicative f => DeferStatement (f a) -> f (DeferStatement a) # mapM :: Monad m => (a -> m b) -> DeferStatement a -> m (DeferStatement b) # sequence :: Monad m => DeferStatement (m a) -> m (DeferStatement a) #
SymbolMatching DeferStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy DeferStatement -> Node -> Bool showFailure :: Proxy DeferStatement -> Node -> String
Unmarshal DeferStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (DeferStatement a)
Eq a => Eq (DeferStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: DeferStatement a -> DeferStatement a -> Bool # (/=) :: DeferStatement a -> DeferStatement a -> Bool #
Ord a => Ord (DeferStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: DeferStatement a -> DeferStatement a -> Ordering # (<) :: DeferStatement a -> DeferStatement a -> Bool # (<=) :: DeferStatement a -> DeferStatement a -> Bool # (>) :: DeferStatement a -> DeferStatement a -> Bool # (>=) :: DeferStatement a -> DeferStatement a -> Bool # max :: DeferStatement a -> DeferStatement a -> DeferStatement a # min :: DeferStatement a -> DeferStatement a -> DeferStatement a #
Show a => Show (DeferStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> DeferStatement a -> ShowS # show :: DeferStatement a -> String # showList :: [DeferStatement a] -> ShowS #
Generic (DeferStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (DeferStatement a) :: Type -> Type # Methods from :: DeferStatement a -> Rep (DeferStatement a) x # to :: Rep (DeferStatement a) x -> DeferStatement a #
Generic1 DeferStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 DeferStatement :: k -> Type # Methods from1 :: forall (a :: k). DeferStatement a -> Rep1 DeferStatement a # to1 :: forall (a :: k). Rep1 DeferStatement a -> DeferStatement a #
type Rep (DeferStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (DeferStatement a) = D1 ('MetaData "DeferStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "DeferStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a))))
type Rep1 DeferStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 DeferStatement = D1 ('MetaData "DeferStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "DeferStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression)))

data DefaultCase a Source #

Constructors

DefaultCase
Fields ann :: a extraChildren :: ([] (Statement a))

Instances

Instances details

Functor DefaultCase Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> DefaultCase a -> DefaultCase b # (<$) :: a -> DefaultCase b -> DefaultCase a #
Foldable DefaultCase Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => DefaultCase m -> m # foldMap :: Monoid m => (a -> m) -> DefaultCase a -> m # foldMap' :: Monoid m => (a -> m) -> DefaultCase a -> m # foldr :: (a -> b -> b) -> b -> DefaultCase a -> b # foldr' :: (a -> b -> b) -> b -> DefaultCase a -> b # foldl :: (b -> a -> b) -> b -> DefaultCase a -> b # foldl' :: (b -> a -> b) -> b -> DefaultCase a -> b # foldr1 :: (a -> a -> a) -> DefaultCase a -> a # foldl1 :: (a -> a -> a) -> DefaultCase a -> a # toList :: DefaultCase a -> [a] # null :: DefaultCase a -> Bool # length :: DefaultCase a -> Int # elem :: Eq a => a -> DefaultCase a -> Bool # maximum :: Ord a => DefaultCase a -> a # minimum :: Ord a => DefaultCase a -> a # sum :: Num a => DefaultCase a -> a # product :: Num a => DefaultCase a -> a #
Traversable DefaultCase Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> DefaultCase a -> f (DefaultCase b) # sequenceA :: Applicative f => DefaultCase (f a) -> f (DefaultCase a) # mapM :: Monad m => (a -> m b) -> DefaultCase a -> m (DefaultCase b) # sequence :: Monad m => DefaultCase (m a) -> m (DefaultCase a) #
SymbolMatching DefaultCase Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy DefaultCase -> Node -> Bool showFailure :: Proxy DefaultCase -> Node -> String
Unmarshal DefaultCase Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (DefaultCase a)
Eq a => Eq (DefaultCase a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: DefaultCase a -> DefaultCase a -> Bool # (/=) :: DefaultCase a -> DefaultCase a -> Bool #
Ord a => Ord (DefaultCase a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: DefaultCase a -> DefaultCase a -> Ordering # (<) :: DefaultCase a -> DefaultCase a -> Bool # (<=) :: DefaultCase a -> DefaultCase a -> Bool # (>) :: DefaultCase a -> DefaultCase a -> Bool # (>=) :: DefaultCase a -> DefaultCase a -> Bool # max :: DefaultCase a -> DefaultCase a -> DefaultCase a # min :: DefaultCase a -> DefaultCase a -> DefaultCase a #
Show a => Show (DefaultCase a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> DefaultCase a -> ShowS # show :: DefaultCase a -> String # showList :: [DefaultCase a] -> ShowS #
Generic (DefaultCase a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (DefaultCase a) :: Type -> Type # Methods from :: DefaultCase a -> Rep (DefaultCase a) x # to :: Rep (DefaultCase a) x -> DefaultCase a #
Generic1 DefaultCase Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 DefaultCase :: k -> Type # Methods from1 :: forall (a :: k). DefaultCase a -> Rep1 DefaultCase a # to1 :: forall (a :: k). Rep1 DefaultCase a -> DefaultCase a #
type Rep (DefaultCase a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (DefaultCase a) = D1 ('MetaData "DefaultCase" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "DefaultCase" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Statement a])))
type Rep1 DefaultCase Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 DefaultCase = D1 ('MetaData "DefaultCase" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "DefaultCase" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 Statement)))

data DecStatement a Source #

Constructors

DecStatement
Fields ann :: a extraChildren :: (Expression a)

Instances

Instances details

Functor DecStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> DecStatement a -> DecStatement b # (<$) :: a -> DecStatement b -> DecStatement a #
Foldable DecStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => DecStatement m -> m # foldMap :: Monoid m => (a -> m) -> DecStatement a -> m # foldMap' :: Monoid m => (a -> m) -> DecStatement a -> m # foldr :: (a -> b -> b) -> b -> DecStatement a -> b # foldr' :: (a -> b -> b) -> b -> DecStatement a -> b # foldl :: (b -> a -> b) -> b -> DecStatement a -> b # foldl' :: (b -> a -> b) -> b -> DecStatement a -> b # foldr1 :: (a -> a -> a) -> DecStatement a -> a # foldl1 :: (a -> a -> a) -> DecStatement a -> a # toList :: DecStatement a -> [a] # null :: DecStatement a -> Bool # length :: DecStatement a -> Int # elem :: Eq a => a -> DecStatement a -> Bool # maximum :: Ord a => DecStatement a -> a # minimum :: Ord a => DecStatement a -> a # sum :: Num a => DecStatement a -> a # product :: Num a => DecStatement a -> a #
Traversable DecStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> DecStatement a -> f (DecStatement b) # sequenceA :: Applicative f => DecStatement (f a) -> f (DecStatement a) # mapM :: Monad m => (a -> m b) -> DecStatement a -> m (DecStatement b) # sequence :: Monad m => DecStatement (m a) -> m (DecStatement a) #
SymbolMatching DecStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy DecStatement -> Node -> Bool showFailure :: Proxy DecStatement -> Node -> String
Unmarshal DecStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (DecStatement a)
Eq a => Eq (DecStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: DecStatement a -> DecStatement a -> Bool # (/=) :: DecStatement a -> DecStatement a -> Bool #
Ord a => Ord (DecStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: DecStatement a -> DecStatement a -> Ordering # (<) :: DecStatement a -> DecStatement a -> Bool # (<=) :: DecStatement a -> DecStatement a -> Bool # (>) :: DecStatement a -> DecStatement a -> Bool # (>=) :: DecStatement a -> DecStatement a -> Bool # max :: DecStatement a -> DecStatement a -> DecStatement a # min :: DecStatement a -> DecStatement a -> DecStatement a #
Show a => Show (DecStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> DecStatement a -> ShowS # show :: DecStatement a -> String # showList :: [DecStatement a] -> ShowS #
Generic (DecStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (DecStatement a) :: Type -> Type # Methods from :: DecStatement a -> Rep (DecStatement a) x # to :: Rep (DecStatement a) x -> DecStatement a #
Generic1 DecStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 DecStatement :: k -> Type # Methods from1 :: forall (a :: k). DecStatement a -> Rep1 DecStatement a # to1 :: forall (a :: k). Rep1 DecStatement a -> DecStatement a #
type Rep (DecStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (DecStatement a) = D1 ('MetaData "DecStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "DecStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a))))
type Rep1 DecStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 DecStatement = D1 ('MetaData "DecStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "DecStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression)))

data ContinueStatement a Source #

Constructors

ContinueStatement
Fields ann :: a extraChildren :: (Maybe (LabelName a))

Instances

Instances details

Functor ContinueStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ContinueStatement a -> ContinueStatement b # (<$) :: a -> ContinueStatement b -> ContinueStatement a #
Foldable ContinueStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ContinueStatement m -> m # foldMap :: Monoid m => (a -> m) -> ContinueStatement a -> m # foldMap' :: Monoid m => (a -> m) -> ContinueStatement a -> m # foldr :: (a -> b -> b) -> b -> ContinueStatement a -> b # foldr' :: (a -> b -> b) -> b -> ContinueStatement a -> b # foldl :: (b -> a -> b) -> b -> ContinueStatement a -> b # foldl' :: (b -> a -> b) -> b -> ContinueStatement a -> b # foldr1 :: (a -> a -> a) -> ContinueStatement a -> a # foldl1 :: (a -> a -> a) -> ContinueStatement a -> a # toList :: ContinueStatement a -> [a] # null :: ContinueStatement a -> Bool # length :: ContinueStatement a -> Int # elem :: Eq a => a -> ContinueStatement a -> Bool # maximum :: Ord a => ContinueStatement a -> a # minimum :: Ord a => ContinueStatement a -> a # sum :: Num a => ContinueStatement a -> a # product :: Num a => ContinueStatement a -> a #
Traversable ContinueStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ContinueStatement a -> f (ContinueStatement b) # sequenceA :: Applicative f => ContinueStatement (f a) -> f (ContinueStatement a) # mapM :: Monad m => (a -> m b) -> ContinueStatement a -> m (ContinueStatement b) # sequence :: Monad m => ContinueStatement (m a) -> m (ContinueStatement a) #
SymbolMatching ContinueStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ContinueStatement -> Node -> Bool showFailure :: Proxy ContinueStatement -> Node -> String
Unmarshal ContinueStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ContinueStatement a)
Eq a => Eq (ContinueStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ContinueStatement a -> ContinueStatement a -> Bool # (/=) :: ContinueStatement a -> ContinueStatement a -> Bool #
Ord a => Ord (ContinueStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ContinueStatement a -> ContinueStatement a -> Ordering # (<) :: ContinueStatement a -> ContinueStatement a -> Bool # (<=) :: ContinueStatement a -> ContinueStatement a -> Bool # (>) :: ContinueStatement a -> ContinueStatement a -> Bool # (>=) :: ContinueStatement a -> ContinueStatement a -> Bool # max :: ContinueStatement a -> ContinueStatement a -> ContinueStatement a # min :: ContinueStatement a -> ContinueStatement a -> ContinueStatement a #
Show a => Show (ContinueStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ContinueStatement a -> ShowS # show :: ContinueStatement a -> String # showList :: [ContinueStatement a] -> ShowS #
Generic (ContinueStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ContinueStatement a) :: Type -> Type # Methods from :: ContinueStatement a -> Rep (ContinueStatement a) x # to :: Rep (ContinueStatement a) x -> ContinueStatement a #
Generic1 ContinueStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ContinueStatement :: k -> Type # Methods from1 :: forall (a :: k). ContinueStatement a -> Rep1 ContinueStatement a # to1 :: forall (a :: k). Rep1 ContinueStatement a -> ContinueStatement a #
type Rep (ContinueStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ContinueStatement a) = D1 ('MetaData "ContinueStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ContinueStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (LabelName a)))))
type Rep1 ContinueStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ContinueStatement = D1 ('MetaData "ContinueStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ContinueStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 LabelName)))

data ConstSpec a Source #

Constructors

ConstSpec
Fields ann :: a value :: (Maybe (ExpressionList a)) name :: (NonEmpty ((:+:) AnonymousComma Identifier a)) type' :: (Maybe (Type a))

Instances

Instances details

Functor ConstSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ConstSpec a -> ConstSpec b # (<$) :: a -> ConstSpec b -> ConstSpec a #
Foldable ConstSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ConstSpec m -> m # foldMap :: Monoid m => (a -> m) -> ConstSpec a -> m # foldMap' :: Monoid m => (a -> m) -> ConstSpec a -> m # foldr :: (a -> b -> b) -> b -> ConstSpec a -> b # foldr' :: (a -> b -> b) -> b -> ConstSpec a -> b # foldl :: (b -> a -> b) -> b -> ConstSpec a -> b # foldl' :: (b -> a -> b) -> b -> ConstSpec a -> b # foldr1 :: (a -> a -> a) -> ConstSpec a -> a # foldl1 :: (a -> a -> a) -> ConstSpec a -> a # toList :: ConstSpec a -> [a] # null :: ConstSpec a -> Bool # length :: ConstSpec a -> Int # elem :: Eq a => a -> ConstSpec a -> Bool # maximum :: Ord a => ConstSpec a -> a # minimum :: Ord a => ConstSpec a -> a # sum :: Num a => ConstSpec a -> a # product :: Num a => ConstSpec a -> a #
Traversable ConstSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ConstSpec a -> f (ConstSpec b) # sequenceA :: Applicative f => ConstSpec (f a) -> f (ConstSpec a) # mapM :: Monad m => (a -> m b) -> ConstSpec a -> m (ConstSpec b) # sequence :: Monad m => ConstSpec (m a) -> m (ConstSpec a) #
SymbolMatching ConstSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ConstSpec -> Node -> Bool showFailure :: Proxy ConstSpec -> Node -> String
Unmarshal ConstSpec Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ConstSpec a)
Eq a => Eq (ConstSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ConstSpec a -> ConstSpec a -> Bool # (/=) :: ConstSpec a -> ConstSpec a -> Bool #
Ord a => Ord (ConstSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ConstSpec a -> ConstSpec a -> Ordering # (<) :: ConstSpec a -> ConstSpec a -> Bool # (<=) :: ConstSpec a -> ConstSpec a -> Bool # (>) :: ConstSpec a -> ConstSpec a -> Bool # (>=) :: ConstSpec a -> ConstSpec a -> Bool # max :: ConstSpec a -> ConstSpec a -> ConstSpec a # min :: ConstSpec a -> ConstSpec a -> ConstSpec a #
Show a => Show (ConstSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ConstSpec a -> ShowS # show :: ConstSpec a -> String # showList :: [ConstSpec a] -> ShowS #
Generic (ConstSpec a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ConstSpec a) :: Type -> Type # Methods from :: ConstSpec a -> Rep (ConstSpec a) x # to :: Rep (ConstSpec a) x -> ConstSpec a #
Generic1 ConstSpec Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ConstSpec :: k -> Type # Methods from1 :: forall (a :: k). ConstSpec a -> Rep1 ConstSpec a # to1 :: forall (a :: k). Rep1 ConstSpec a -> ConstSpec a #
type Rep (ConstSpec a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ConstSpec a) = D1 ('MetaData "ConstSpec" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ConstSpec" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: S1 ('MetaSel ('Just "value") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (ExpressionList a)))) :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NonEmpty ((AnonymousComma :+: Identifier) a))) :*: S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Type a))))))
type Rep1 ConstSpec Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ConstSpec = D1 ('MetaData "ConstSpec" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ConstSpec" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: S1 ('MetaSel ('Just "value") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 ExpressionList)) :: (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (NonEmpty :.: Rec1 (AnonymousComma :+: Identifier)) :*: S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 Type))))

data ConstDeclaration a Source #

Constructors

ConstDeclaration
Fields ann :: a extraChildren :: ([] (ConstSpec a))

Instances

Instances details

Functor ConstDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ConstDeclaration a -> ConstDeclaration b # (<$) :: a -> ConstDeclaration b -> ConstDeclaration a #
Foldable ConstDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ConstDeclaration m -> m # foldMap :: Monoid m => (a -> m) -> ConstDeclaration a -> m # foldMap' :: Monoid m => (a -> m) -> ConstDeclaration a -> m # foldr :: (a -> b -> b) -> b -> ConstDeclaration a -> b # foldr' :: (a -> b -> b) -> b -> ConstDeclaration a -> b # foldl :: (b -> a -> b) -> b -> ConstDeclaration a -> b # foldl' :: (b -> a -> b) -> b -> ConstDeclaration a -> b # foldr1 :: (a -> a -> a) -> ConstDeclaration a -> a # foldl1 :: (a -> a -> a) -> ConstDeclaration a -> a # toList :: ConstDeclaration a -> [a] # null :: ConstDeclaration a -> Bool # length :: ConstDeclaration a -> Int # elem :: Eq a => a -> ConstDeclaration a -> Bool # maximum :: Ord a => ConstDeclaration a -> a # minimum :: Ord a => ConstDeclaration a -> a # sum :: Num a => ConstDeclaration a -> a # product :: Num a => ConstDeclaration a -> a #
Traversable ConstDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ConstDeclaration a -> f (ConstDeclaration b) # sequenceA :: Applicative f => ConstDeclaration (f a) -> f (ConstDeclaration a) # mapM :: Monad m => (a -> m b) -> ConstDeclaration a -> m (ConstDeclaration b) # sequence :: Monad m => ConstDeclaration (m a) -> m (ConstDeclaration a) #
SymbolMatching ConstDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ConstDeclaration -> Node -> Bool showFailure :: Proxy ConstDeclaration -> Node -> String
Unmarshal ConstDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ConstDeclaration a)
Eq a => Eq (ConstDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ConstDeclaration a -> ConstDeclaration a -> Bool # (/=) :: ConstDeclaration a -> ConstDeclaration a -> Bool #
Ord a => Ord (ConstDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ConstDeclaration a -> ConstDeclaration a -> Ordering # (<) :: ConstDeclaration a -> ConstDeclaration a -> Bool # (<=) :: ConstDeclaration a -> ConstDeclaration a -> Bool # (>) :: ConstDeclaration a -> ConstDeclaration a -> Bool # (>=) :: ConstDeclaration a -> ConstDeclaration a -> Bool # max :: ConstDeclaration a -> ConstDeclaration a -> ConstDeclaration a # min :: ConstDeclaration a -> ConstDeclaration a -> ConstDeclaration a #
Show a => Show (ConstDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ConstDeclaration a -> ShowS # show :: ConstDeclaration a -> String # showList :: [ConstDeclaration a] -> ShowS #
Generic (ConstDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ConstDeclaration a) :: Type -> Type # Methods from :: ConstDeclaration a -> Rep (ConstDeclaration a) x # to :: Rep (ConstDeclaration a) x -> ConstDeclaration a #
Generic1 ConstDeclaration Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ConstDeclaration :: k -> Type # Methods from1 :: forall (a :: k). ConstDeclaration a -> Rep1 ConstDeclaration a # to1 :: forall (a :: k). Rep1 ConstDeclaration a -> ConstDeclaration a #
type Rep (ConstDeclaration a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ConstDeclaration a) = D1 ('MetaData "ConstDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ConstDeclaration" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [ConstSpec a])))
type Rep1 ConstDeclaration Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ConstDeclaration = D1 ('MetaData "ConstDeclaration" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ConstDeclaration" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 ConstSpec)))

data CompositeLiteral a Source #

Constructors

CompositeLiteral
Fields ann :: a body :: (LiteralValue a) type' :: ((:+:) ((:+:) ArrayType ((:+:) ImplicitLengthArrayType MapType)) ((:+:) ((:+:) QualifiedType SliceType) ((:+:) StructType TypeIdentifier)) a)

Instances

Instances details

Functor CompositeLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> CompositeLiteral a -> CompositeLiteral b # (<$) :: a -> CompositeLiteral b -> CompositeLiteral a #
Foldable CompositeLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => CompositeLiteral m -> m # foldMap :: Monoid m => (a -> m) -> CompositeLiteral a -> m # foldMap' :: Monoid m => (a -> m) -> CompositeLiteral a -> m # foldr :: (a -> b -> b) -> b -> CompositeLiteral a -> b # foldr' :: (a -> b -> b) -> b -> CompositeLiteral a -> b # foldl :: (b -> a -> b) -> b -> CompositeLiteral a -> b # foldl' :: (b -> a -> b) -> b -> CompositeLiteral a -> b # foldr1 :: (a -> a -> a) -> CompositeLiteral a -> a # foldl1 :: (a -> a -> a) -> CompositeLiteral a -> a # toList :: CompositeLiteral a -> [a] # null :: CompositeLiteral a -> Bool # length :: CompositeLiteral a -> Int # elem :: Eq a => a -> CompositeLiteral a -> Bool # maximum :: Ord a => CompositeLiteral a -> a # minimum :: Ord a => CompositeLiteral a -> a # sum :: Num a => CompositeLiteral a -> a # product :: Num a => CompositeLiteral a -> a #
Traversable CompositeLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> CompositeLiteral a -> f (CompositeLiteral b) # sequenceA :: Applicative f => CompositeLiteral (f a) -> f (CompositeLiteral a) # mapM :: Monad m => (a -> m b) -> CompositeLiteral a -> m (CompositeLiteral b) # sequence :: Monad m => CompositeLiteral (m a) -> m (CompositeLiteral a) #
SymbolMatching CompositeLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy CompositeLiteral -> Node -> Bool showFailure :: Proxy CompositeLiteral -> Node -> String
Unmarshal CompositeLiteral Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (CompositeLiteral a)
Eq a => Eq (CompositeLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: CompositeLiteral a -> CompositeLiteral a -> Bool # (/=) :: CompositeLiteral a -> CompositeLiteral a -> Bool #
Ord a => Ord (CompositeLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: CompositeLiteral a -> CompositeLiteral a -> Ordering # (<) :: CompositeLiteral a -> CompositeLiteral a -> Bool # (<=) :: CompositeLiteral a -> CompositeLiteral a -> Bool # (>) :: CompositeLiteral a -> CompositeLiteral a -> Bool # (>=) :: CompositeLiteral a -> CompositeLiteral a -> Bool # max :: CompositeLiteral a -> CompositeLiteral a -> CompositeLiteral a # min :: CompositeLiteral a -> CompositeLiteral a -> CompositeLiteral a #
Show a => Show (CompositeLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> CompositeLiteral a -> ShowS # show :: CompositeLiteral a -> String # showList :: [CompositeLiteral a] -> ShowS #
Generic (CompositeLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (CompositeLiteral a) :: Type -> Type # Methods from :: CompositeLiteral a -> Rep (CompositeLiteral a) x # to :: Rep (CompositeLiteral a) x -> CompositeLiteral a #
Generic1 CompositeLiteral Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 CompositeLiteral :: k -> Type # Methods from1 :: forall (a :: k). CompositeLiteral a -> Rep1 CompositeLiteral a # to1 :: forall (a :: k). Rep1 CompositeLiteral a -> CompositeLiteral a #
type Rep (CompositeLiteral a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (CompositeLiteral a) = D1 ('MetaData "CompositeLiteral" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "CompositeLiteral" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "body") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (LiteralValue a)) :: S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (((ArrayType :+: (ImplicitLengthArrayType :+: MapType)) :+: ((QualifiedType :+: SliceType) :+: (StructType :+: TypeIdentifier))) a)))))
type Rep1 CompositeLiteral Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 CompositeLiteral = D1 ('MetaData "CompositeLiteral" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "CompositeLiteral" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "body") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 LiteralValue) :: S1 ('MetaSel ('Just "type'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 ((ArrayType :+: (ImplicitLengthArrayType :+: MapType)) :+: ((QualifiedType :+: SliceType) :+: (StructType :+: TypeIdentifier)))))))

data CommunicationCase a Source #

Constructors

CommunicationCase
Fields ann :: a communication :: ((:+:) ReceiveStatement SendStatement a) extraChildren :: ([] (Statement a))

Instances

Instances details

Functor CommunicationCase Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> CommunicationCase a -> CommunicationCase b # (<$) :: a -> CommunicationCase b -> CommunicationCase a #
Foldable CommunicationCase Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => CommunicationCase m -> m # foldMap :: Monoid m => (a -> m) -> CommunicationCase a -> m # foldMap' :: Monoid m => (a -> m) -> CommunicationCase a -> m # foldr :: (a -> b -> b) -> b -> CommunicationCase a -> b # foldr' :: (a -> b -> b) -> b -> CommunicationCase a -> b # foldl :: (b -> a -> b) -> b -> CommunicationCase a -> b # foldl' :: (b -> a -> b) -> b -> CommunicationCase a -> b # foldr1 :: (a -> a -> a) -> CommunicationCase a -> a # foldl1 :: (a -> a -> a) -> CommunicationCase a -> a # toList :: CommunicationCase a -> [a] # null :: CommunicationCase a -> Bool # length :: CommunicationCase a -> Int # elem :: Eq a => a -> CommunicationCase a -> Bool # maximum :: Ord a => CommunicationCase a -> a # minimum :: Ord a => CommunicationCase a -> a # sum :: Num a => CommunicationCase a -> a # product :: Num a => CommunicationCase a -> a #
Traversable CommunicationCase Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> CommunicationCase a -> f (CommunicationCase b) # sequenceA :: Applicative f => CommunicationCase (f a) -> f (CommunicationCase a) # mapM :: Monad m => (a -> m b) -> CommunicationCase a -> m (CommunicationCase b) # sequence :: Monad m => CommunicationCase (m a) -> m (CommunicationCase a) #
SymbolMatching CommunicationCase Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy CommunicationCase -> Node -> Bool showFailure :: Proxy CommunicationCase -> Node -> String
Unmarshal CommunicationCase Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (CommunicationCase a)
Eq a => Eq (CommunicationCase a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: CommunicationCase a -> CommunicationCase a -> Bool # (/=) :: CommunicationCase a -> CommunicationCase a -> Bool #
Ord a => Ord (CommunicationCase a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: CommunicationCase a -> CommunicationCase a -> Ordering # (<) :: CommunicationCase a -> CommunicationCase a -> Bool # (<=) :: CommunicationCase a -> CommunicationCase a -> Bool # (>) :: CommunicationCase a -> CommunicationCase a -> Bool # (>=) :: CommunicationCase a -> CommunicationCase a -> Bool # max :: CommunicationCase a -> CommunicationCase a -> CommunicationCase a # min :: CommunicationCase a -> CommunicationCase a -> CommunicationCase a #
Show a => Show (CommunicationCase a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> CommunicationCase a -> ShowS # show :: CommunicationCase a -> String # showList :: [CommunicationCase a] -> ShowS #
Generic (CommunicationCase a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (CommunicationCase a) :: Type -> Type # Methods from :: CommunicationCase a -> Rep (CommunicationCase a) x # to :: Rep (CommunicationCase a) x -> CommunicationCase a #
Generic1 CommunicationCase Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 CommunicationCase :: k -> Type # Methods from1 :: forall (a :: k). CommunicationCase a -> Rep1 CommunicationCase a # to1 :: forall (a :: k). Rep1 CommunicationCase a -> CommunicationCase a #
type Rep (CommunicationCase a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (CommunicationCase a) = D1 ('MetaData "CommunicationCase" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "CommunicationCase" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "communication") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ((ReceiveStatement :+: SendStatement) a)) :: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Statement a]))))
type Rep1 CommunicationCase Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 CommunicationCase = D1 ('MetaData "CommunicationCase" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "CommunicationCase" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "communication") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 (ReceiveStatement :+: SendStatement)) :: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 Statement))))

data ChannelType a Source #

Constructors

ChannelType
Fields ann :: a value :: (Type a)

Instances

Instances details

Functor ChannelType Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ChannelType a -> ChannelType b # (<$) :: a -> ChannelType b -> ChannelType a #
Foldable ChannelType Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ChannelType m -> m # foldMap :: Monoid m => (a -> m) -> ChannelType a -> m # foldMap' :: Monoid m => (a -> m) -> ChannelType a -> m # foldr :: (a -> b -> b) -> b -> ChannelType a -> b # foldr' :: (a -> b -> b) -> b -> ChannelType a -> b # foldl :: (b -> a -> b) -> b -> ChannelType a -> b # foldl' :: (b -> a -> b) -> b -> ChannelType a -> b # foldr1 :: (a -> a -> a) -> ChannelType a -> a # foldl1 :: (a -> a -> a) -> ChannelType a -> a # toList :: ChannelType a -> [a] # null :: ChannelType a -> Bool # length :: ChannelType a -> Int # elem :: Eq a => a -> ChannelType a -> Bool # maximum :: Ord a => ChannelType a -> a # minimum :: Ord a => ChannelType a -> a # sum :: Num a => ChannelType a -> a # product :: Num a => ChannelType a -> a #
Traversable ChannelType Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ChannelType a -> f (ChannelType b) # sequenceA :: Applicative f => ChannelType (f a) -> f (ChannelType a) # mapM :: Monad m => (a -> m b) -> ChannelType a -> m (ChannelType b) # sequence :: Monad m => ChannelType (m a) -> m (ChannelType a) #
SymbolMatching ChannelType Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ChannelType -> Node -> Bool showFailure :: Proxy ChannelType -> Node -> String
Unmarshal ChannelType Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ChannelType a)
Eq a => Eq (ChannelType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ChannelType a -> ChannelType a -> Bool # (/=) :: ChannelType a -> ChannelType a -> Bool #
Ord a => Ord (ChannelType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ChannelType a -> ChannelType a -> Ordering # (<) :: ChannelType a -> ChannelType a -> Bool # (<=) :: ChannelType a -> ChannelType a -> Bool # (>) :: ChannelType a -> ChannelType a -> Bool # (>=) :: ChannelType a -> ChannelType a -> Bool # max :: ChannelType a -> ChannelType a -> ChannelType a # min :: ChannelType a -> ChannelType a -> ChannelType a #
Show a => Show (ChannelType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ChannelType a -> ShowS # show :: ChannelType a -> String # showList :: [ChannelType a] -> ShowS #
Generic (ChannelType a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ChannelType a) :: Type -> Type # Methods from :: ChannelType a -> Rep (ChannelType a) x # to :: Rep (ChannelType a) x -> ChannelType a #
Generic1 ChannelType Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ChannelType :: k -> Type # Methods from1 :: forall (a :: k). ChannelType a -> Rep1 ChannelType a # to1 :: forall (a :: k). Rep1 ChannelType a -> ChannelType a #
type Rep (ChannelType a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ChannelType a) = D1 ('MetaData "ChannelType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ChannelType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "value") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type a))))
type Rep1 ChannelType Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ChannelType = D1 ('MetaData "ChannelType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ChannelType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "value") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Type)))

data CallExpression a Source #

Constructors

CallExpression
Fields ann :: a function :: (Expression a) arguments :: (ArgumentList a)

Instances

Instances details

Functor CallExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> CallExpression a -> CallExpression b # (<$) :: a -> CallExpression b -> CallExpression a #
Foldable CallExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => CallExpression m -> m # foldMap :: Monoid m => (a -> m) -> CallExpression a -> m # foldMap' :: Monoid m => (a -> m) -> CallExpression a -> m # foldr :: (a -> b -> b) -> b -> CallExpression a -> b # foldr' :: (a -> b -> b) -> b -> CallExpression a -> b # foldl :: (b -> a -> b) -> b -> CallExpression a -> b # foldl' :: (b -> a -> b) -> b -> CallExpression a -> b # foldr1 :: (a -> a -> a) -> CallExpression a -> a # foldl1 :: (a -> a -> a) -> CallExpression a -> a # toList :: CallExpression a -> [a] # null :: CallExpression a -> Bool # length :: CallExpression a -> Int # elem :: Eq a => a -> CallExpression a -> Bool # maximum :: Ord a => CallExpression a -> a # minimum :: Ord a => CallExpression a -> a # sum :: Num a => CallExpression a -> a # product :: Num a => CallExpression a -> a #
Traversable CallExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> CallExpression a -> f (CallExpression b) # sequenceA :: Applicative f => CallExpression (f a) -> f (CallExpression a) # mapM :: Monad m => (a -> m b) -> CallExpression a -> m (CallExpression b) # sequence :: Monad m => CallExpression (m a) -> m (CallExpression a) #
SymbolMatching CallExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy CallExpression -> Node -> Bool showFailure :: Proxy CallExpression -> Node -> String
Unmarshal CallExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (CallExpression a)
Eq a => Eq (CallExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: CallExpression a -> CallExpression a -> Bool # (/=) :: CallExpression a -> CallExpression a -> Bool #
Ord a => Ord (CallExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: CallExpression a -> CallExpression a -> Ordering # (<) :: CallExpression a -> CallExpression a -> Bool # (<=) :: CallExpression a -> CallExpression a -> Bool # (>) :: CallExpression a -> CallExpression a -> Bool # (>=) :: CallExpression a -> CallExpression a -> Bool # max :: CallExpression a -> CallExpression a -> CallExpression a # min :: CallExpression a -> CallExpression a -> CallExpression a #
Show a => Show (CallExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> CallExpression a -> ShowS # show :: CallExpression a -> String # showList :: [CallExpression a] -> ShowS #
Generic (CallExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (CallExpression a) :: Type -> Type # Methods from :: CallExpression a -> Rep (CallExpression a) x # to :: Rep (CallExpression a) x -> CallExpression a #
Generic1 CallExpression Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 CallExpression :: k -> Type # Methods from1 :: forall (a :: k). CallExpression a -> Rep1 CallExpression a # to1 :: forall (a :: k). Rep1 CallExpression a -> CallExpression a #
type Rep (CallExpression a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (CallExpression a) = D1 ('MetaData "CallExpression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "CallExpression" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "function") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a)) :: S1 ('MetaSel ('Just "arguments") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ArgumentList a)))))
type Rep1 CallExpression Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 CallExpression = D1 ('MetaData "CallExpression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "CallExpression" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "function") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression) :: S1 ('MetaSel ('Just "arguments") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 ArgumentList))))

data BreakStatement a Source #

Constructors

BreakStatement
Fields ann :: a extraChildren :: (Maybe (LabelName a))

Instances

Instances details

Functor BreakStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> BreakStatement a -> BreakStatement b # (<$) :: a -> BreakStatement b -> BreakStatement a #
Foldable BreakStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => BreakStatement m -> m # foldMap :: Monoid m => (a -> m) -> BreakStatement a -> m # foldMap' :: Monoid m => (a -> m) -> BreakStatement a -> m # foldr :: (a -> b -> b) -> b -> BreakStatement a -> b # foldr' :: (a -> b -> b) -> b -> BreakStatement a -> b # foldl :: (b -> a -> b) -> b -> BreakStatement a -> b # foldl' :: (b -> a -> b) -> b -> BreakStatement a -> b # foldr1 :: (a -> a -> a) -> BreakStatement a -> a # foldl1 :: (a -> a -> a) -> BreakStatement a -> a # toList :: BreakStatement a -> [a] # null :: BreakStatement a -> Bool # length :: BreakStatement a -> Int # elem :: Eq a => a -> BreakStatement a -> Bool # maximum :: Ord a => BreakStatement a -> a # minimum :: Ord a => BreakStatement a -> a # sum :: Num a => BreakStatement a -> a # product :: Num a => BreakStatement a -> a #
Traversable BreakStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> BreakStatement a -> f (BreakStatement b) # sequenceA :: Applicative f => BreakStatement (f a) -> f (BreakStatement a) # mapM :: Monad m => (a -> m b) -> BreakStatement a -> m (BreakStatement b) # sequence :: Monad m => BreakStatement (m a) -> m (BreakStatement a) #
SymbolMatching BreakStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy BreakStatement -> Node -> Bool showFailure :: Proxy BreakStatement -> Node -> String
Unmarshal BreakStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (BreakStatement a)
Eq a => Eq (BreakStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: BreakStatement a -> BreakStatement a -> Bool # (/=) :: BreakStatement a -> BreakStatement a -> Bool #
Ord a => Ord (BreakStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: BreakStatement a -> BreakStatement a -> Ordering # (<) :: BreakStatement a -> BreakStatement a -> Bool # (<=) :: BreakStatement a -> BreakStatement a -> Bool # (>) :: BreakStatement a -> BreakStatement a -> Bool # (>=) :: BreakStatement a -> BreakStatement a -> Bool # max :: BreakStatement a -> BreakStatement a -> BreakStatement a # min :: BreakStatement a -> BreakStatement a -> BreakStatement a #
Show a => Show (BreakStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> BreakStatement a -> ShowS # show :: BreakStatement a -> String # showList :: [BreakStatement a] -> ShowS #
Generic (BreakStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (BreakStatement a) :: Type -> Type # Methods from :: BreakStatement a -> Rep (BreakStatement a) x # to :: Rep (BreakStatement a) x -> BreakStatement a #
Generic1 BreakStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 BreakStatement :: k -> Type # Methods from1 :: forall (a :: k). BreakStatement a -> Rep1 BreakStatement a # to1 :: forall (a :: k). Rep1 BreakStatement a -> BreakStatement a #
type Rep (BreakStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (BreakStatement a) = D1 ('MetaData "BreakStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "BreakStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (LabelName a)))))
type Rep1 BreakStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 BreakStatement = D1 ('MetaData "BreakStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "BreakStatement" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Maybe :.: Rec1 LabelName)))

data Block a Source #

Constructors

Block
Fields ann :: a extraChildren :: ([] (Statement a))

Instances

Instances details

Functor Block Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> Block a -> Block b # (<$) :: a -> Block b -> Block a #
Foldable Block Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => Block m -> m # foldMap :: Monoid m => (a -> m) -> Block a -> m # foldMap' :: Monoid m => (a -> m) -> Block a -> m # foldr :: (a -> b -> b) -> b -> Block a -> b # foldr' :: (a -> b -> b) -> b -> Block a -> b # foldl :: (b -> a -> b) -> b -> Block a -> b # foldl' :: (b -> a -> b) -> b -> Block a -> b # foldr1 :: (a -> a -> a) -> Block a -> a # foldl1 :: (a -> a -> a) -> Block a -> a # toList :: Block a -> [a] # null :: Block a -> Bool # length :: Block a -> Int # elem :: Eq a => a -> Block a -> Bool # maximum :: Ord a => Block a -> a # minimum :: Ord a => Block a -> a # sum :: Num a => Block a -> a # product :: Num a => Block a -> a #
Traversable Block Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> Block a -> f (Block b) # sequenceA :: Applicative f => Block (f a) -> f (Block a) # mapM :: Monad m => (a -> m b) -> Block a -> m (Block b) # sequence :: Monad m => Block (m a) -> m (Block a) #
SymbolMatching Block Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy Block -> Node -> Bool showFailure :: Proxy Block -> Node -> String
Unmarshal Block Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (Block a)
Eq a => Eq (Block a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: Block a -> Block a -> Bool # (/=) :: Block a -> Block a -> Bool #
Ord a => Ord (Block a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: Block a -> Block a -> Ordering # (<) :: Block a -> Block a -> Bool # (<=) :: Block a -> Block a -> Bool # (>) :: Block a -> Block a -> Bool # (>=) :: Block a -> Block a -> Bool # max :: Block a -> Block a -> Block a # min :: Block a -> Block a -> Block a #
Show a => Show (Block a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> Block a -> ShowS # show :: Block a -> String # showList :: [Block a] -> ShowS #
Generic (Block a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (Block a) :: Type -> Type # Methods from :: Block a -> Rep (Block a) x # to :: Rep (Block a) x -> Block a #
Generic1 Block Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 Block :: k -> Type # Methods from1 :: forall (a :: k). Block a -> Rep1 Block a # to1 :: forall (a :: k). Rep1 Block a -> Block a #
type Rep (Block a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (Block a) = D1 ('MetaData "Block" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "Block" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Statement a])))
type Rep1 Block Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 Block = D1 ('MetaData "Block" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "Block" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 Statement)))

data BinaryExpression a Source #

Constructors

BinaryExpression

Instances

Instances details

Functor BinaryExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> BinaryExpression a -> BinaryExpression b # (<$) :: a -> BinaryExpression b -> BinaryExpression a #
Foldable BinaryExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => BinaryExpression m -> m # foldMap :: Monoid m => (a -> m) -> BinaryExpression a -> m # foldMap' :: Monoid m => (a -> m) -> BinaryExpression a -> m # foldr :: (a -> b -> b) -> b -> BinaryExpression a -> b # foldr' :: (a -> b -> b) -> b -> BinaryExpression a -> b # foldl :: (b -> a -> b) -> b -> BinaryExpression a -> b # foldl' :: (b -> a -> b) -> b -> BinaryExpression a -> b # foldr1 :: (a -> a -> a) -> BinaryExpression a -> a # foldl1 :: (a -> a -> a) -> BinaryExpression a -> a # toList :: BinaryExpression a -> [a] # null :: BinaryExpression a -> Bool # length :: BinaryExpression a -> Int # elem :: Eq a => a -> BinaryExpression a -> Bool # maximum :: Ord a => BinaryExpression a -> a # minimum :: Ord a => BinaryExpression a -> a # sum :: Num a => BinaryExpression a -> a # product :: Num a => BinaryExpression a -> a #
Traversable BinaryExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> BinaryExpression a -> f (BinaryExpression b) # sequenceA :: Applicative f => BinaryExpression (f a) -> f (BinaryExpression a) # mapM :: Monad m => (a -> m b) -> BinaryExpression a -> m (BinaryExpression b) # sequence :: Monad m => BinaryExpression (m a) -> m (BinaryExpression a) #
SymbolMatching BinaryExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy BinaryExpression -> Node -> Bool showFailure :: Proxy BinaryExpression -> Node -> String
Unmarshal BinaryExpression Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (BinaryExpression a)
Eq a => Eq (BinaryExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: BinaryExpression a -> BinaryExpression a -> Bool # (/=) :: BinaryExpression a -> BinaryExpression a -> Bool #
Ord a => Ord (BinaryExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: BinaryExpression a -> BinaryExpression a -> Ordering # (<) :: BinaryExpression a -> BinaryExpression a -> Bool # (<=) :: BinaryExpression a -> BinaryExpression a -> Bool # (>) :: BinaryExpression a -> BinaryExpression a -> Bool # (>=) :: BinaryExpression a -> BinaryExpression a -> Bool # max :: BinaryExpression a -> BinaryExpression a -> BinaryExpression a # min :: BinaryExpression a -> BinaryExpression a -> BinaryExpression a #
Show a => Show (BinaryExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> BinaryExpression a -> ShowS # show :: BinaryExpression a -> String # showList :: [BinaryExpression a] -> ShowS #
Generic (BinaryExpression a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (BinaryExpression a) :: Type -> Type # Methods from :: BinaryExpression a -> Rep (BinaryExpression a) x # to :: Rep (BinaryExpression a) x -> BinaryExpression a #
Generic1 BinaryExpression Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 BinaryExpression :: k -> Type # Methods from1 :: forall (a :: k). BinaryExpression a -> Rep1 BinaryExpression a # to1 :: forall (a :: k). Rep1 BinaryExpression a -> BinaryExpression a #
type Rep (BinaryExpression a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (BinaryExpression a) = D1 ('MetaData "BinaryExpression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "BinaryExpression" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: S1 ('MetaSel ('Just "operator") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (((((AnonymousBangEqual :+: AnonymousPercent) :+: (AnonymousAmpersand :+: AnonymousAmpersandAmpersand)) :+: ((AnonymousAmpersandCaret :+: AnonymousStar) :+: (AnonymousPlus :+: (AnonymousMinus :+: AnonymousSlash)))) :+: (((AnonymousLAngle :+: AnonymousLAngleLAngle) :+: (AnonymousLAngleEqual :+: (AnonymousEqualEqual :+: AnonymousRAngle))) :+: ((AnonymousRAngleEqual :+: AnonymousRAngleRAngle) :+: (AnonymousCaret :+: (AnonymousPipe :+: AnonymousPipePipe))))) a))) :: (S1 ('MetaSel ('Just "left") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a)) :*: S1 ('MetaSel ('Just "right") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a)))))
type Rep1 BinaryExpression Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 BinaryExpression = D1 ('MetaData "BinaryExpression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "BinaryExpression" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: S1 ('MetaSel ('Just "operator") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 ((((AnonymousBangEqual :+: AnonymousPercent) :+: (AnonymousAmpersand :+: AnonymousAmpersandAmpersand)) :+: ((AnonymousAmpersandCaret :+: AnonymousStar) :+: (AnonymousPlus :+: (AnonymousMinus :+: AnonymousSlash)))) :+: (((AnonymousLAngle :+: AnonymousLAngleLAngle) :+: (AnonymousLAngleEqual :+: (AnonymousEqualEqual :+: AnonymousRAngle))) :+: ((AnonymousRAngleEqual :+: AnonymousRAngleRAngle) :+: (AnonymousCaret :+: (AnonymousPipe :+: AnonymousPipePipe))))))) :: (S1 ('MetaSel ('Just "left") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression) :*: S1 ('MetaSel ('Just "right") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression))))

data AssignmentStatement a Source #

Constructors

AssignmentStatement

Instances

Instances details

Functor AssignmentStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> AssignmentStatement a -> AssignmentStatement b # (<$) :: a -> AssignmentStatement b -> AssignmentStatement a #
Foldable AssignmentStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => AssignmentStatement m -> m # foldMap :: Monoid m => (a -> m) -> AssignmentStatement a -> m # foldMap' :: Monoid m => (a -> m) -> AssignmentStatement a -> m # foldr :: (a -> b -> b) -> b -> AssignmentStatement a -> b # foldr' :: (a -> b -> b) -> b -> AssignmentStatement a -> b # foldl :: (b -> a -> b) -> b -> AssignmentStatement a -> b # foldl' :: (b -> a -> b) -> b -> AssignmentStatement a -> b # foldr1 :: (a -> a -> a) -> AssignmentStatement a -> a # foldl1 :: (a -> a -> a) -> AssignmentStatement a -> a # toList :: AssignmentStatement a -> [a] # null :: AssignmentStatement a -> Bool # length :: AssignmentStatement a -> Int # elem :: Eq a => a -> AssignmentStatement a -> Bool # maximum :: Ord a => AssignmentStatement a -> a # minimum :: Ord a => AssignmentStatement a -> a # sum :: Num a => AssignmentStatement a -> a # product :: Num a => AssignmentStatement a -> a #
Traversable AssignmentStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> AssignmentStatement a -> f (AssignmentStatement b) # sequenceA :: Applicative f => AssignmentStatement (f a) -> f (AssignmentStatement a) # mapM :: Monad m => (a -> m b) -> AssignmentStatement a -> m (AssignmentStatement b) # sequence :: Monad m => AssignmentStatement (m a) -> m (AssignmentStatement a) #
SymbolMatching AssignmentStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy AssignmentStatement -> Node -> Bool showFailure :: Proxy AssignmentStatement -> Node -> String
Unmarshal AssignmentStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (AssignmentStatement a)
Eq a => Eq (AssignmentStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: AssignmentStatement a -> AssignmentStatement a -> Bool # (/=) :: AssignmentStatement a -> AssignmentStatement a -> Bool #
Ord a => Ord (AssignmentStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: AssignmentStatement a -> AssignmentStatement a -> Ordering # (<) :: AssignmentStatement a -> AssignmentStatement a -> Bool # (<=) :: AssignmentStatement a -> AssignmentStatement a -> Bool # (>) :: AssignmentStatement a -> AssignmentStatement a -> Bool # (>=) :: AssignmentStatement a -> AssignmentStatement a -> Bool # max :: AssignmentStatement a -> AssignmentStatement a -> AssignmentStatement a # min :: AssignmentStatement a -> AssignmentStatement a -> AssignmentStatement a #
Show a => Show (AssignmentStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> AssignmentStatement a -> ShowS # show :: AssignmentStatement a -> String # showList :: [AssignmentStatement a] -> ShowS #
Generic (AssignmentStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (AssignmentStatement a) :: Type -> Type # Methods from :: AssignmentStatement a -> Rep (AssignmentStatement a) x # to :: Rep (AssignmentStatement a) x -> AssignmentStatement a #
Generic1 AssignmentStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 AssignmentStatement :: k -> Type # Methods from1 :: forall (a :: k). AssignmentStatement a -> Rep1 AssignmentStatement a # to1 :: forall (a :: k). Rep1 AssignmentStatement a -> AssignmentStatement a #
type Rep (AssignmentStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (AssignmentStatement a) = D1 ('MetaData "AssignmentStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "AssignmentStatement" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: S1 ('MetaSel ('Just "operator") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ((((AnonymousPercentEqual :+: (AnonymousAmpersandEqual :+: AnonymousAmpersandCaretEqual)) :+: (AnonymousStarEqual :+: (AnonymousPlusEqual :+: AnonymousMinusEqual))) :+: ((AnonymousSlashEqual :+: (AnonymousLAngleLAngleEqual :+: AnonymousEqual)) :+: (AnonymousRAngleRAngleEqual :+: (AnonymousCaretEqual :+: AnonymousPipeEqual)))) a))) :: (S1 ('MetaSel ('Just "left") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ExpressionList a)) :*: S1 ('MetaSel ('Just "right") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ExpressionList a)))))
type Rep1 AssignmentStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 AssignmentStatement = D1 ('MetaData "AssignmentStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "AssignmentStatement" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: S1 ('MetaSel ('Just "operator") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 (((AnonymousPercentEqual :+: (AnonymousAmpersandEqual :+: AnonymousAmpersandCaretEqual)) :+: (AnonymousStarEqual :+: (AnonymousPlusEqual :+: AnonymousMinusEqual))) :+: ((AnonymousSlashEqual :+: (AnonymousLAngleLAngleEqual :+: AnonymousEqual)) :+: (AnonymousRAngleRAngleEqual :+: (AnonymousCaretEqual :+: AnonymousPipeEqual)))))) :: (S1 ('MetaSel ('Just "left") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 ExpressionList) :*: S1 ('MetaSel ('Just "right") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 ExpressionList))))

data ArrayType a Source #

Constructors

ArrayType
Fields ann :: a length :: (Expression a) element :: (Type a)

Instances

Instances details

Functor ArrayType Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ArrayType a -> ArrayType b # (<$) :: a -> ArrayType b -> ArrayType a #
Foldable ArrayType Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ArrayType m -> m # foldMap :: Monoid m => (a -> m) -> ArrayType a -> m # foldMap' :: Monoid m => (a -> m) -> ArrayType a -> m # foldr :: (a -> b -> b) -> b -> ArrayType a -> b # foldr' :: (a -> b -> b) -> b -> ArrayType a -> b # foldl :: (b -> a -> b) -> b -> ArrayType a -> b # foldl' :: (b -> a -> b) -> b -> ArrayType a -> b # foldr1 :: (a -> a -> a) -> ArrayType a -> a # foldl1 :: (a -> a -> a) -> ArrayType a -> a # toList :: ArrayType a -> [a] # null :: ArrayType a -> Bool # length :: ArrayType a -> Int # elem :: Eq a => a -> ArrayType a -> Bool # maximum :: Ord a => ArrayType a -> a # minimum :: Ord a => ArrayType a -> a # sum :: Num a => ArrayType a -> a # product :: Num a => ArrayType a -> a #
Traversable ArrayType Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ArrayType a -> f (ArrayType b) # sequenceA :: Applicative f => ArrayType (f a) -> f (ArrayType a) # mapM :: Monad m => (a -> m b) -> ArrayType a -> m (ArrayType b) # sequence :: Monad m => ArrayType (m a) -> m (ArrayType a) #
SymbolMatching ArrayType Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ArrayType -> Node -> Bool showFailure :: Proxy ArrayType -> Node -> String
Unmarshal ArrayType Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ArrayType a)
Eq a => Eq (ArrayType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ArrayType a -> ArrayType a -> Bool # (/=) :: ArrayType a -> ArrayType a -> Bool #
Ord a => Ord (ArrayType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ArrayType a -> ArrayType a -> Ordering # (<) :: ArrayType a -> ArrayType a -> Bool # (<=) :: ArrayType a -> ArrayType a -> Bool # (>) :: ArrayType a -> ArrayType a -> Bool # (>=) :: ArrayType a -> ArrayType a -> Bool # max :: ArrayType a -> ArrayType a -> ArrayType a # min :: ArrayType a -> ArrayType a -> ArrayType a #
Show a => Show (ArrayType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ArrayType a -> ShowS # show :: ArrayType a -> String # showList :: [ArrayType a] -> ShowS #
Generic (ArrayType a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ArrayType a) :: Type -> Type # Methods from :: ArrayType a -> Rep (ArrayType a) x # to :: Rep (ArrayType a) x -> ArrayType a #
Generic1 ArrayType Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ArrayType :: k -> Type # Methods from1 :: forall (a :: k). ArrayType a -> Rep1 ArrayType a # to1 :: forall (a :: k). Rep1 ArrayType a -> ArrayType a #
type Rep (ArrayType a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ArrayType a) = D1 ('MetaData "ArrayType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ArrayType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :: (S1 ('MetaSel ('Just "length") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Expression a)) :: S1 ('MetaSel ('Just "element") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type a)))))
type Rep1 ArrayType Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ArrayType = D1 ('MetaData "ArrayType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ArrayType" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :: (S1 ('MetaSel ('Just "length") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Expression) :: S1 ('MetaSel ('Just "element") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Type))))

data ArgumentList a Source #

Constructors

ArgumentList
Fields ann :: a extraChildren :: ([] ((:+:) Expression ((:+:) Type VariadicArgument) a))

Instances

Instances details

Functor ArgumentList Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> ArgumentList a -> ArgumentList b # (<$) :: a -> ArgumentList b -> ArgumentList a #
Foldable ArgumentList Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => ArgumentList m -> m # foldMap :: Monoid m => (a -> m) -> ArgumentList a -> m # foldMap' :: Monoid m => (a -> m) -> ArgumentList a -> m # foldr :: (a -> b -> b) -> b -> ArgumentList a -> b # foldr' :: (a -> b -> b) -> b -> ArgumentList a -> b # foldl :: (b -> a -> b) -> b -> ArgumentList a -> b # foldl' :: (b -> a -> b) -> b -> ArgumentList a -> b # foldr1 :: (a -> a -> a) -> ArgumentList a -> a # foldl1 :: (a -> a -> a) -> ArgumentList a -> a # toList :: ArgumentList a -> [a] # null :: ArgumentList a -> Bool # length :: ArgumentList a -> Int # elem :: Eq a => a -> ArgumentList a -> Bool # maximum :: Ord a => ArgumentList a -> a # minimum :: Ord a => ArgumentList a -> a # sum :: Num a => ArgumentList a -> a # product :: Num a => ArgumentList a -> a #
Traversable ArgumentList Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> ArgumentList a -> f (ArgumentList b) # sequenceA :: Applicative f => ArgumentList (f a) -> f (ArgumentList a) # mapM :: Monad m => (a -> m b) -> ArgumentList a -> m (ArgumentList b) # sequence :: Monad m => ArgumentList (m a) -> m (ArgumentList a) #
SymbolMatching ArgumentList Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy ArgumentList -> Node -> Bool showFailure :: Proxy ArgumentList -> Node -> String
Unmarshal ArgumentList Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (ArgumentList a)
Eq a => Eq (ArgumentList a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: ArgumentList a -> ArgumentList a -> Bool # (/=) :: ArgumentList a -> ArgumentList a -> Bool #
Ord a => Ord (ArgumentList a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: ArgumentList a -> ArgumentList a -> Ordering # (<) :: ArgumentList a -> ArgumentList a -> Bool # (<=) :: ArgumentList a -> ArgumentList a -> Bool # (>) :: ArgumentList a -> ArgumentList a -> Bool # (>=) :: ArgumentList a -> ArgumentList a -> Bool # max :: ArgumentList a -> ArgumentList a -> ArgumentList a # min :: ArgumentList a -> ArgumentList a -> ArgumentList a #
Show a => Show (ArgumentList a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> ArgumentList a -> ShowS # show :: ArgumentList a -> String # showList :: [ArgumentList a] -> ShowS #
Generic (ArgumentList a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (ArgumentList a) :: Type -> Type # Methods from :: ArgumentList a -> Rep (ArgumentList a) x # to :: Rep (ArgumentList a) x -> ArgumentList a #
Generic1 ArgumentList Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 ArgumentList :: k -> Type # Methods from1 :: forall (a :: k). ArgumentList a -> Rep1 ArgumentList a # to1 :: forall (a :: k). Rep1 ArgumentList a -> ArgumentList a #
type Rep (ArgumentList a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (ArgumentList a) = D1 ('MetaData "ArgumentList" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ArgumentList" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(Expression :+: (Type :+: VariadicArgument)) a])))
type Rep1 ArgumentList Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 ArgumentList = D1 ('MetaData "ArgumentList" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'False) (C1 ('MetaCons "ArgumentList" 'PrefixI 'True) (S1 ('MetaSel ('Just "ann") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "extraChildren") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ([] :.: Rec1 (Expression :+: (Type :+: VariadicArgument)))))

newtype Type a Source #

Constructors

Type ((:+:) SimpleType ParenthesizedType a)

Instances

Instances details

Functor Type Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> Type a -> Type b # (<$) :: a -> Type b -> Type a #
Foldable Type Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => Type m -> m # foldMap :: Monoid m => (a -> m) -> Type a -> m # foldMap' :: Monoid m => (a -> m) -> Type a -> m # foldr :: (a -> b -> b) -> b -> Type a -> b # foldr' :: (a -> b -> b) -> b -> Type a -> b # foldl :: (b -> a -> b) -> b -> Type a -> b # foldl' :: (b -> a -> b) -> b -> Type a -> b # foldr1 :: (a -> a -> a) -> Type a -> a # foldl1 :: (a -> a -> a) -> Type a -> a # toList :: Type a -> [a] # null :: Type a -> Bool # length :: Type a -> Int # elem :: Eq a => a -> Type a -> Bool # maximum :: Ord a => Type a -> a # minimum :: Ord a => Type a -> a # sum :: Num a => Type a -> a # product :: Num a => Type a -> a #
Traversable Type Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> Type a -> f (Type b) # sequenceA :: Applicative f => Type (f a) -> f (Type a) # mapM :: Monad m => (a -> m b) -> Type a -> m (Type b) # sequence :: Monad m => Type (m a) -> m (Type a) #
SymbolMatching Type Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy Type -> Node -> Bool showFailure :: Proxy Type -> Node -> String
Unmarshal Type Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type0 -> Type0) -> Type0 -> Type0) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (Type a)
Eq a => Eq (Type a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: Type a -> Type a -> Bool # (/=) :: Type a -> Type a -> Bool #
Ord a => Ord (Type a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: Type a -> Type a -> Ordering # (<) :: Type a -> Type a -> Bool # (<=) :: Type a -> Type a -> Bool # (>) :: Type a -> Type a -> Bool # (>=) :: Type a -> Type a -> Bool # max :: Type a -> Type a -> Type a # min :: Type a -> Type a -> Type a #
Show a => Show (Type a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> Type a -> ShowS # show :: Type a -> String # showList :: [Type a] -> ShowS #
Generic (Type a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (Type a) :: Type -> Type # Methods from :: Type a -> Rep (Type a) x # to :: Rep (Type a) x -> Type a #
Generic1 Type Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 Type :: k -> Type # Methods from1 :: forall (a :: k). Type a -> Rep1 Type a # to1 :: forall (a :: k). Rep1 Type a -> Type a #
type Rep (Type a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (Type a) = D1 ('MetaData "Type" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'True) (C1 ('MetaCons "Type" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ((SimpleType :+: ParenthesizedType) a))))
type Rep1 Type Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 Type = D1 ('MetaData "Type" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'True) (C1 ('MetaCons "Type" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 (SimpleType :+: ParenthesizedType))))

newtype Statement a Source #

Instances

Instances details

Functor Statement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> Statement a -> Statement b # (<$) :: a -> Statement b -> Statement a #
Foldable Statement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => Statement m -> m # foldMap :: Monoid m => (a -> m) -> Statement a -> m # foldMap' :: Monoid m => (a -> m) -> Statement a -> m # foldr :: (a -> b -> b) -> b -> Statement a -> b # foldr' :: (a -> b -> b) -> b -> Statement a -> b # foldl :: (b -> a -> b) -> b -> Statement a -> b # foldl' :: (b -> a -> b) -> b -> Statement a -> b # foldr1 :: (a -> a -> a) -> Statement a -> a # foldl1 :: (a -> a -> a) -> Statement a -> a # toList :: Statement a -> [a] # null :: Statement a -> Bool # length :: Statement a -> Int # elem :: Eq a => a -> Statement a -> Bool # maximum :: Ord a => Statement a -> a # minimum :: Ord a => Statement a -> a # sum :: Num a => Statement a -> a # product :: Num a => Statement a -> a #
Traversable Statement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> Statement a -> f (Statement b) # sequenceA :: Applicative f => Statement (f a) -> f (Statement a) # mapM :: Monad m => (a -> m b) -> Statement a -> m (Statement b) # sequence :: Monad m => Statement (m a) -> m (Statement a) #
SymbolMatching Statement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy Statement -> Node -> Bool showFailure :: Proxy Statement -> Node -> String
Unmarshal Statement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (Statement a)
Eq a => Eq (Statement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: Statement a -> Statement a -> Bool # (/=) :: Statement a -> Statement a -> Bool #
Ord a => Ord (Statement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: Statement a -> Statement a -> Ordering # (<) :: Statement a -> Statement a -> Bool # (<=) :: Statement a -> Statement a -> Bool # (>) :: Statement a -> Statement a -> Bool # (>=) :: Statement a -> Statement a -> Bool # max :: Statement a -> Statement a -> Statement a # min :: Statement a -> Statement a -> Statement a #
Show a => Show (Statement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> Statement a -> ShowS # show :: Statement a -> String # showList :: [Statement a] -> ShowS #
Generic (Statement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (Statement a) :: Type -> Type # Methods from :: Statement a -> Rep (Statement a) x # to :: Rep (Statement a) x -> Statement a #
Generic1 Statement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 Statement :: k -> Type # Methods from1 :: forall (a :: k). Statement a -> Rep1 Statement a # to1 :: forall (a :: k). Rep1 Statement a -> Statement a #
type Rep (Statement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (Statement a) = D1 ('MetaData "Statement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'True) (C1 ('MetaCons "Statement" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (((((SimpleStatement :+: Block) :+: (BreakStatement :+: ConstDeclaration)) :+: ((ContinueStatement :+: DeferStatement) :+: (EmptyStatement :+: (ExpressionSwitchStatement :+: FallthroughStatement)))) :+: (((ForStatement :+: GoStatement) :+: (GotoStatement :+: (IfStatement :+: LabeledStatement))) :+: ((ReturnStatement :+: SelectStatement) :+: (TypeDeclaration :+: (TypeSwitchStatement :+: VarDeclaration))))) a))))
type Rep1 Statement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 Statement = D1 ('MetaData "Statement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'True) (C1 ('MetaCons "Statement" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 ((((SimpleStatement :+: Block) :+: (BreakStatement :+: ConstDeclaration)) :+: ((ContinueStatement :+: DeferStatement) :+: (EmptyStatement :+: (ExpressionSwitchStatement :+: FallthroughStatement)))) :+: (((ForStatement :+: GoStatement) :+: (GotoStatement :+: (IfStatement :+: LabeledStatement))) :+: ((ReturnStatement :+: SelectStatement) :+: (TypeDeclaration :+: (TypeSwitchStatement :+: VarDeclaration))))))))

newtype SimpleType a Source #

Constructors

SimpleType ((:+:) ((:+:) ((:+:) ArrayType ChannelType) ((:+:) FunctionType ((:+:) InterfaceType MapType))) ((:+:) ((:+:) PointerType QualifiedType) ((:+:) SliceType ((:+:) StructType TypeIdentifier))) a)

Instances

Instances details

Functor SimpleType Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> SimpleType a -> SimpleType b # (<$) :: a -> SimpleType b -> SimpleType a #
Foldable SimpleType Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => SimpleType m -> m # foldMap :: Monoid m => (a -> m) -> SimpleType a -> m # foldMap' :: Monoid m => (a -> m) -> SimpleType a -> m # foldr :: (a -> b -> b) -> b -> SimpleType a -> b # foldr' :: (a -> b -> b) -> b -> SimpleType a -> b # foldl :: (b -> a -> b) -> b -> SimpleType a -> b # foldl' :: (b -> a -> b) -> b -> SimpleType a -> b # foldr1 :: (a -> a -> a) -> SimpleType a -> a # foldl1 :: (a -> a -> a) -> SimpleType a -> a # toList :: SimpleType a -> [a] # null :: SimpleType a -> Bool # length :: SimpleType a -> Int # elem :: Eq a => a -> SimpleType a -> Bool # maximum :: Ord a => SimpleType a -> a # minimum :: Ord a => SimpleType a -> a # sum :: Num a => SimpleType a -> a # product :: Num a => SimpleType a -> a #
Traversable SimpleType Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> SimpleType a -> f (SimpleType b) # sequenceA :: Applicative f => SimpleType (f a) -> f (SimpleType a) # mapM :: Monad m => (a -> m b) -> SimpleType a -> m (SimpleType b) # sequence :: Monad m => SimpleType (m a) -> m (SimpleType a) #
SymbolMatching SimpleType Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy SimpleType -> Node -> Bool showFailure :: Proxy SimpleType -> Node -> String
Unmarshal SimpleType Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (SimpleType a)
Eq a => Eq (SimpleType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: SimpleType a -> SimpleType a -> Bool # (/=) :: SimpleType a -> SimpleType a -> Bool #
Ord a => Ord (SimpleType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: SimpleType a -> SimpleType a -> Ordering # (<) :: SimpleType a -> SimpleType a -> Bool # (<=) :: SimpleType a -> SimpleType a -> Bool # (>) :: SimpleType a -> SimpleType a -> Bool # (>=) :: SimpleType a -> SimpleType a -> Bool # max :: SimpleType a -> SimpleType a -> SimpleType a # min :: SimpleType a -> SimpleType a -> SimpleType a #
Show a => Show (SimpleType a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> SimpleType a -> ShowS # show :: SimpleType a -> String # showList :: [SimpleType a] -> ShowS #
Generic (SimpleType a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (SimpleType a) :: Type -> Type # Methods from :: SimpleType a -> Rep (SimpleType a) x # to :: Rep (SimpleType a) x -> SimpleType a #
Generic1 SimpleType Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 SimpleType :: k -> Type # Methods from1 :: forall (a :: k). SimpleType a -> Rep1 SimpleType a # to1 :: forall (a :: k). Rep1 SimpleType a -> SimpleType a #
type Rep (SimpleType a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (SimpleType a) = D1 ('MetaData "SimpleType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'True) (C1 ('MetaCons "SimpleType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ((((ArrayType :+: ChannelType) :+: (FunctionType :+: (InterfaceType :+: MapType))) :+: ((PointerType :+: QualifiedType) :+: (SliceType :+: (StructType :+: TypeIdentifier)))) a))))
type Rep1 SimpleType Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 SimpleType = D1 ('MetaData "SimpleType" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'True) (C1 ('MetaCons "SimpleType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 (((ArrayType :+: ChannelType) :+: (FunctionType :+: (InterfaceType :+: MapType))) :+: ((PointerType :+: QualifiedType) :+: (SliceType :+: (StructType :+: TypeIdentifier)))))))

newtype SimpleStatement a Source #

Constructors

SimpleStatement ((:+:) ((:+:) Expression ((:+:) AssignmentStatement DecStatement)) ((:+:) IncStatement ((:+:) SendStatement ShortVarDeclaration)) a)

Instances

Instances details

Functor SimpleStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> SimpleStatement a -> SimpleStatement b # (<$) :: a -> SimpleStatement b -> SimpleStatement a #
Foldable SimpleStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => SimpleStatement m -> m # foldMap :: Monoid m => (a -> m) -> SimpleStatement a -> m # foldMap' :: Monoid m => (a -> m) -> SimpleStatement a -> m # foldr :: (a -> b -> b) -> b -> SimpleStatement a -> b # foldr' :: (a -> b -> b) -> b -> SimpleStatement a -> b # foldl :: (b -> a -> b) -> b -> SimpleStatement a -> b # foldl' :: (b -> a -> b) -> b -> SimpleStatement a -> b # foldr1 :: (a -> a -> a) -> SimpleStatement a -> a # foldl1 :: (a -> a -> a) -> SimpleStatement a -> a # toList :: SimpleStatement a -> [a] # null :: SimpleStatement a -> Bool # length :: SimpleStatement a -> Int # elem :: Eq a => a -> SimpleStatement a -> Bool # maximum :: Ord a => SimpleStatement a -> a # minimum :: Ord a => SimpleStatement a -> a # sum :: Num a => SimpleStatement a -> a # product :: Num a => SimpleStatement a -> a #
Traversable SimpleStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> SimpleStatement a -> f (SimpleStatement b) # sequenceA :: Applicative f => SimpleStatement (f a) -> f (SimpleStatement a) # mapM :: Monad m => (a -> m b) -> SimpleStatement a -> m (SimpleStatement b) # sequence :: Monad m => SimpleStatement (m a) -> m (SimpleStatement a) #
SymbolMatching SimpleStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy SimpleStatement -> Node -> Bool showFailure :: Proxy SimpleStatement -> Node -> String
Unmarshal SimpleStatement Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (SimpleStatement a)
Eq a => Eq (SimpleStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: SimpleStatement a -> SimpleStatement a -> Bool # (/=) :: SimpleStatement a -> SimpleStatement a -> Bool #
Ord a => Ord (SimpleStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: SimpleStatement a -> SimpleStatement a -> Ordering # (<) :: SimpleStatement a -> SimpleStatement a -> Bool # (<=) :: SimpleStatement a -> SimpleStatement a -> Bool # (>) :: SimpleStatement a -> SimpleStatement a -> Bool # (>=) :: SimpleStatement a -> SimpleStatement a -> Bool # max :: SimpleStatement a -> SimpleStatement a -> SimpleStatement a # min :: SimpleStatement a -> SimpleStatement a -> SimpleStatement a #
Show a => Show (SimpleStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> SimpleStatement a -> ShowS # show :: SimpleStatement a -> String # showList :: [SimpleStatement a] -> ShowS #
Generic (SimpleStatement a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (SimpleStatement a) :: Type -> Type # Methods from :: SimpleStatement a -> Rep (SimpleStatement a) x # to :: Rep (SimpleStatement a) x -> SimpleStatement a #
Generic1 SimpleStatement Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 SimpleStatement :: k -> Type # Methods from1 :: forall (a :: k). SimpleStatement a -> Rep1 SimpleStatement a # to1 :: forall (a :: k). Rep1 SimpleStatement a -> SimpleStatement a #
type Rep (SimpleStatement a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (SimpleStatement a) = D1 ('MetaData "SimpleStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'True) (C1 ('MetaCons "SimpleStatement" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (((Expression :+: (AssignmentStatement :+: DecStatement)) :+: (IncStatement :+: (SendStatement :+: ShortVarDeclaration))) a))))
type Rep1 SimpleStatement Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 SimpleStatement = D1 ('MetaData "SimpleStatement" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'True) (C1 ('MetaCons "SimpleStatement" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 ((Expression :+: (AssignmentStatement :+: DecStatement)) :+: (IncStatement :+: (SendStatement :+: ShortVarDeclaration))))))

newtype Expression a Source #

Instances

Instances details

Functor Expression Source #
Instance details Defined in TreeSitter.Go.AST Methods fmap :: (a -> b) -> Expression a -> Expression b # (<$) :: a -> Expression b -> Expression a #
Foldable Expression Source #
Instance details Defined in TreeSitter.Go.AST Methods fold :: Monoid m => Expression m -> m # foldMap :: Monoid m => (a -> m) -> Expression a -> m # foldMap' :: Monoid m => (a -> m) -> Expression a -> m # foldr :: (a -> b -> b) -> b -> Expression a -> b # foldr' :: (a -> b -> b) -> b -> Expression a -> b # foldl :: (b -> a -> b) -> b -> Expression a -> b # foldl' :: (b -> a -> b) -> b -> Expression a -> b # foldr1 :: (a -> a -> a) -> Expression a -> a # foldl1 :: (a -> a -> a) -> Expression a -> a # toList :: Expression a -> [a] # null :: Expression a -> Bool # length :: Expression a -> Int # elem :: Eq a => a -> Expression a -> Bool # maximum :: Ord a => Expression a -> a # minimum :: Ord a => Expression a -> a # sum :: Num a => Expression a -> a # product :: Num a => Expression a -> a #
Traversable Expression Source #
Instance details Defined in TreeSitter.Go.AST Methods traverse :: Applicative f => (a -> f b) -> Expression a -> f (Expression b) # sequenceA :: Applicative f => Expression (f a) -> f (Expression a) # mapM :: Monad m => (a -> m b) -> Expression a -> m (Expression b) # sequence :: Monad m => Expression (m a) -> m (Expression a) #
SymbolMatching Expression Source #
Instance details Defined in TreeSitter.Go.AST Methods symbolMatch :: Proxy Expression -> Node -> Bool showFailure :: Proxy Expression -> Node -> String
Unmarshal Expression Source #
Instance details Defined in TreeSitter.Go.AST Methods unmarshalNode :: forall (sig :: (Type -> Type) -> Type -> Type) m a. (Has (Reader ByteString) sig m, Has (Reader (Ptr Cursor)) sig m, MonadFail m, MonadIO m, UnmarshalAnn a) => Node -> m (Expression a)
Eq a => Eq (Expression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods (==) :: Expression a -> Expression a -> Bool # (/=) :: Expression a -> Expression a -> Bool #
Ord a => Ord (Expression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods compare :: Expression a -> Expression a -> Ordering # (<) :: Expression a -> Expression a -> Bool # (<=) :: Expression a -> Expression a -> Bool # (>) :: Expression a -> Expression a -> Bool # (>=) :: Expression a -> Expression a -> Bool # max :: Expression a -> Expression a -> Expression a # min :: Expression a -> Expression a -> Expression a #
Show a => Show (Expression a) Source #
Instance details Defined in TreeSitter.Go.AST Methods showsPrec :: Int -> Expression a -> ShowS # show :: Expression a -> String # showList :: [Expression a] -> ShowS #
Generic (Expression a) Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep (Expression a) :: Type -> Type # Methods from :: Expression a -> Rep (Expression a) x # to :: Rep (Expression a) x -> Expression a #
Generic1 Expression Source #
Instance details Defined in TreeSitter.Go.AST Associated Types type Rep1 Expression :: k -> Type # Methods from1 :: forall (a :: k). Expression a -> Rep1 Expression a # to1 :: forall (a :: k). Rep1 Expression a -> Expression a #
type Rep (Expression a) Source #
Instance details Defined in TreeSitter.Go.AST type Rep (Expression a) = D1 ('MetaData "Expression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'True) (C1 ('MetaCons "Expression" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (((((BinaryExpression :+: CallExpression) :+: (CompositeLiteral :+: (False :+: FloatLiteral))) :+: ((FuncLiteral :+: Identifier) :+: (ImaginaryLiteral :+: (IndexExpression :+: IntLiteral)))) :+: (((InterpretedStringLiteral :+: Nil) :+: (ParenthesizedExpression :+: (RawStringLiteral :+: RuneLiteral))) :+: ((SelectorExpression :+: (SliceExpression :+: True)) :+: (TypeAssertionExpression :+: (TypeConversionExpression :+: UnaryExpression))))) a))))
type Rep1 Expression Source #
Instance details Defined in TreeSitter.Go.AST type Rep1 Expression = D1 ('MetaData "Expression" "TreeSitter.Go.AST" "tree-sitter-go-0.3.1.0-inplace" 'True) (C1 ('MetaCons "Expression" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 ((((BinaryExpression :+: CallExpression) :+: (CompositeLiteral :+: (False :+: FloatLiteral))) :+: ((FuncLiteral :+: Identifier) :+: (ImaginaryLiteral :+: (IndexExpression :+: IntLiteral)))) :+: (((InterpretedStringLiteral :+: Nil) :+: (ParenthesizedExpression :+: (RawStringLiteral :+: RuneLiteral))) :+: ((SelectorExpression :+: (SliceExpression :+: True)) :+: (TypeAssertionExpression :+: (TypeConversionExpression :+: UnaryExpression))))))))