Safe Haskell	None
Language	Haskell2010

Blanks

Description

You'll get most of what you want by just importing this module unqualified. See Scope for the basic wrapper and LocScope for a wrapper with annotations you can use for source locations and the like. See the test suite for examples.

Documentation

module Blanks.Tracked

module Blanks.Sub

module Blanks.Split

module Blanks.Scope

module Blanks.Name

module Blanks.LocScope

module Blanks.Located

module Blanks.Conversion

data BinderScope n e Source #

Constructors

BinderScope
Fields binderScopeArity :: !Int binderScopeInfo :: !n binderScopeBody :: e

Instances

Instances details

Functor (BinderScope n) Source #
Instance details Defined in Blanks.Core Methods fmap :: (a -> b) -> BinderScope n a -> BinderScope n b # (<$) :: a -> BinderScope n b -> BinderScope n a #
Foldable (BinderScope n) Source #
Instance details Defined in Blanks.Core Methods fold :: Monoid m => BinderScope n m -> m # foldMap :: Monoid m => (a -> m) -> BinderScope n a -> m # foldMap' :: Monoid m => (a -> m) -> BinderScope n a -> m # foldr :: (a -> b -> b) -> b -> BinderScope n a -> b # foldr' :: (a -> b -> b) -> b -> BinderScope n a -> b # foldl :: (b -> a -> b) -> b -> BinderScope n a -> b # foldl' :: (b -> a -> b) -> b -> BinderScope n a -> b # foldr1 :: (a -> a -> a) -> BinderScope n a -> a # foldl1 :: (a -> a -> a) -> BinderScope n a -> a # toList :: BinderScope n a -> [a] # null :: BinderScope n a -> Bool # length :: BinderScope n a -> Int # elem :: Eq a => a -> BinderScope n a -> Bool # maximum :: Ord a => BinderScope n a -> a # minimum :: Ord a => BinderScope n a -> a # sum :: Num a => BinderScope n a -> a # product :: Num a => BinderScope n a -> a #
Traversable (BinderScope n) Source #
Instance details Defined in Blanks.Core Methods traverse :: Applicative f => (a -> f b) -> BinderScope n a -> f (BinderScope n b) # sequenceA :: Applicative f => BinderScope n (f a) -> f (BinderScope n a) # mapM :: Monad m => (a -> m b) -> BinderScope n a -> m (BinderScope n b) # sequence :: Monad m => BinderScope n (m a) -> m (BinderScope n a) #
(Eq n, Eq e) => Eq (BinderScope n e) Source #
Instance details Defined in Blanks.Core Methods (==) :: BinderScope n e -> BinderScope n e -> Bool # (/=) :: BinderScope n e -> BinderScope n e -> Bool #
(Show n, Show e) => Show (BinderScope n e) Source #
Instance details Defined in Blanks.Core Methods showsPrec :: Int -> BinderScope n e -> ShowS # show :: BinderScope n e -> String # showList :: [BinderScope n e] -> ShowS #
Generic (BinderScope n e) Source #
Instance details Defined in Blanks.Core Associated Types type Rep (BinderScope n e) :: Type -> Type # Methods from :: BinderScope n e -> Rep (BinderScope n e) x # to :: Rep (BinderScope n e) x -> BinderScope n e #
(NFData n, NFData e) => NFData (BinderScope n e) Source #
Instance details Defined in Blanks.Core Methods rnf :: BinderScope n e -> () #
type Rep (BinderScope n e) Source #
Instance details Defined in Blanks.Core type Rep (BinderScope n e) = D1 ('MetaData "BinderScope" "Blanks.Core" "blanks-0.5.0-inplace" 'False) (C1 ('MetaCons "BinderScope" 'PrefixI 'True) (S1 ('MetaSel ('Just "binderScopeArity") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Int) :: (S1 ('MetaSel ('Just "binderScopeInfo") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 n) :: S1 ('MetaSel ('Just "binderScopeBody") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 e))))