Language.Haskell.Names.Open

Documentation

class Typeable a => Resolvable a where

A type that implements Resolvable provides a way to perform a shallow scope-aware traversal.

Methods

rtraverse :: (Applicative f, ?alg :: Alg f) => a -> Scope -> f a

Instances

(Typeable * a, GTraversable Resolvable a) => Resolvable a

Resolvable SrcSpan

Resolvable SrcSpanInfo

(Resolvable l, SrcInfo l, Data l) => Resolvable [Stmt l]

(Resolvable l, SrcInfo l, Data l) => Resolvable (Op l)

(Resolvable l, SrcInfo l, Data l) => Resolvable (Decl l)

(Resolvable l, SrcInfo l, Data l) => Resolvable (DeclHead l)

(Resolvable l, SrcInfo l, Data l) => Resolvable (InstRule l)

(Resolvable l, SrcInfo l, Data l) => Resolvable (Binds l)

(Resolvable l, SrcInfo l, Data l) => Resolvable (Match l)

(Resolvable l, SrcInfo l, Data l) => Resolvable (ConDecl l)

(Resolvable l, SrcInfo l, Data l) => Resolvable (FieldDecl l)

(Resolvable l, SrcInfo l, Data l) => Resolvable (ClassDecl l)

(Resolvable l, SrcInfo l, Data l) => Resolvable (InstDecl l)

(Resolvable l, SrcInfo l, Data l) => Resolvable (GuardedRhs l)

(Resolvable l, SrcInfo l, Data l) => Resolvable (Type l)

(Resolvable l, SrcInfo l, Data l) => Resolvable (Context l)

(Resolvable l, SrcInfo l, Data l) => Resolvable (Exp l)

(Resolvable l, SrcInfo l, Data l) => Resolvable (Pat l)

(Resolvable l, SrcInfo l, Data l) => Resolvable (PatField l)

(Resolvable l, SrcInfo l, Data l) => Resolvable (QualStmt l)

(Resolvable l, SrcInfo l, Data l) => Resolvable (Alt l)

Typeable * a => Resolvable (Scoped a)

newtype Alg w

The algebra for rtraverse. It's newtype-wrapped because an implicit parameter cannot be polymorphic.

Constructors

Alg

Fields

runAlg :: forall d. Resolvable d => d -> Scope -> w d

rmap :: Resolvable a => (forall b. Resolvable b => Scope -> b -> b) -> Scope -> a -> a

Analogous to gmap, but for Resolvable

rfoldMap :: (Monoid r, Resolvable a) => (forall b. Resolvable b => Scope -> b -> r) -> Scope -> a -> r

Analogous to gmap, but for Resolvable

data Scope

Contains information about the node's enclosing scope. Can be accessed through the lenses: gTable, lTable, nameCtx, wcNames.

data NameContext

Describes how we should treat names in the current context

Constructors

BindingT

BindingV

ReferenceT

ReferenceV

ReferenceUV

Reference a method in an instance declaration Unqualified names also match qualified names in scope https://www.haskell.org/pipermail/haskell-prime/2008-April/002569.html

ReferenceUT

Reference an associated type in an instance declaration Unqualified names also match qualified names in scope https://www.haskell.org/pipermail/haskell-prime/2008-April/002569.html

Other

initialScope :: Table -> Scope

Create an initial scope

gTable :: Lens Scope Table

lTable :: Lens Scope Table

nameCtx :: Lens Scope NameContext

type WcNames = [WcField]

Information about the names being introduced by a record wildcard

During resolving traversal, we always (lazily) construct this list when we process PRec or RecConstr, even if it doesn't contain a wildcard.

Then, if the pattern or construction actually contains a wildcard, we use the computed value.

data WcField

Information about a field in the wildcard

Constructors

WcField

Fields

wcFieldName :: Name

the field's simple name

wcFieldModuleName :: ModuleName

the field's original name

wcExistsGlobalValue :: Bool

whether there is a global value in scope with the same name as the field but different from the field selector

wcNames :: Lens Scope WcNames