Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
Documentation
newtype Token (symName :: Symbol) (symVal :: Nat) a Source #
An AST node representing a token, indexed by its name and numeric value.
For convenience, token types are typically used via type synonyms, e.g.:
type AnonymousPlus = Token "+" 123
Instances
Generic1 (Token symName symVal :: Type -> Type) Source # | |
Functor (Token symName symVal) Source # | |
Foldable (Token symName symVal) Source # | |
Defined in TreeSitter.Token fold :: Monoid m => Token symName symVal m -> m # foldMap :: Monoid m => (a -> m) -> Token symName symVal a -> m # foldMap' :: Monoid m => (a -> m) -> Token symName symVal a -> m # foldr :: (a -> b -> b) -> b -> Token symName symVal a -> b # foldr' :: (a -> b -> b) -> b -> Token symName symVal a -> b # foldl :: (b -> a -> b) -> b -> Token symName symVal a -> b # foldl' :: (b -> a -> b) -> b -> Token symName symVal a -> b # foldr1 :: (a -> a -> a) -> Token symName symVal a -> a # foldl1 :: (a -> a -> a) -> Token symName symVal a -> a # toList :: Token symName symVal a -> [a] # null :: Token symName symVal a -> Bool # length :: Token symName symVal a -> Int # elem :: Eq a => a -> Token symName symVal a -> Bool # maximum :: Ord a => Token symName symVal a -> a # minimum :: Ord a => Token symName symVal a -> a # | |
Traversable (Token symName symVal) Source # | |
Defined in TreeSitter.Token traverse :: Applicative f => (a -> f b) -> Token symName symVal a -> f (Token symName symVal b) # sequenceA :: Applicative f => Token symName symVal (f a) -> f (Token symName symVal a) # mapM :: Monad m => (a -> m b) -> Token symName symVal a -> m (Token symName symVal b) # sequence :: Monad m => Token symName symVal (m a) -> m (Token symName symVal a) # | |
(KnownNat n, KnownSymbol sym) => SymbolMatching (Token sym n) Source # | |
Defined in TreeSitter.Unmarshal | |
Unmarshal (Token sym n) Source # | |
Defined in TreeSitter.Unmarshal 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 (Token sym n a) Source # | |
Eq a => Eq (Token symName symVal a) Source # | |
Ord a => Ord (Token symName symVal a) Source # | |
Defined in TreeSitter.Token compare :: Token symName symVal a -> Token symName symVal a -> Ordering # (<) :: Token symName symVal a -> Token symName symVal a -> Bool # (<=) :: Token symName symVal a -> Token symName symVal a -> Bool # (>) :: Token symName symVal a -> Token symName symVal a -> Bool # (>=) :: Token symName symVal a -> Token symName symVal a -> Bool # max :: Token symName symVal a -> Token symName symVal a -> Token symName symVal a # min :: Token symName symVal a -> Token symName symVal a -> Token symName symVal a # | |
Show a => Show (Token symName symVal a) Source # | |
Generic (Token symName symVal a) Source # | |
type Rep1 (Token symName symVal :: Type -> Type) Source # | |
Defined in TreeSitter.Token | |
type Rep (Token symName symVal a) Source # | |
Defined in TreeSitter.Token |