Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. InverseScopeLookup :: Phase

    Agda Agda.Benchmarking

    Pretty printing names.

  2. inverseScopeLookupModule :: ModuleName -> ScopeInfo -> [QName]

    Agda Agda.Syntax.Scope.Base

    Find the concrete names that map (uniquely) to a given abstract module name. Sort by length, shortest first.

  3. inverseScopeLookupModule' :: AllowAmbiguousNames -> ModuleName -> ScopeInfo -> [QName]

    Agda Agda.Syntax.Scope.Base

    No documentation available.

  4. inverseScopeLookupName :: QName -> ScopeInfo -> [QName]

    Agda Agda.Syntax.Scope.Base

    Find the concrete names that map (uniquely) to a given abstract qualified name. Sort by number of modules in the qualified name, unqualified names first.

  5. inverseScopeLookupName' :: AllowAmbiguousNames -> QName -> ScopeInfo -> [QName]

    Agda Agda.Syntax.Scope.Base

    No documentation available.

  6. inverseScopeLookupName'' :: AllowAmbiguousNames -> QName -> ScopeInfo -> Maybe NameMapEntry

    Agda Agda.Syntax.Scope.Base

    A version of inverseScopeLookupName that also delivers the KindOfName. Used in highlighting.

  7. scopeLookup :: InScope a => QName -> ScopeInfo -> [a]

    Agda Agda.Syntax.Scope.Base

    Look up a name in the scope

  8. scopeLookup' :: InScope a => QName -> ScopeInfo -> [(a, Access)]

    Agda Agda.Syntax.Scope.Base

    No documentation available.

  9. insertLookupWithKey :: (Ord k, Ord (Tag v), HasTag v) => (k -> v -> v -> v) -> k -> v -> BiMap k v -> (Maybe v, BiMap k v)

    Agda Agda.Utils.BiMap

    Inserts a binding into the map. If a binding for the key already exists, then the value obtained by applying the function to the key, the new value and the old value is inserted, and the old value is returned. Precondition: See insertLookupWithKeyPrecondition.

  10. insertLookupWithKeyPrecondition :: (Ord k, Eq v, Eq (Tag v), HasTag v) => (k -> v -> v -> v) -> k -> v -> BiMap k v -> Bool

    Agda Agda.Utils.BiMap

    The precondition for insertLookupWithKey f k v m is that, if the value v' is inserted into m, and tag v' is defined, then no key other than k may map to a value v'' for which tag v'' = tag v'.

Page 166 of many | Previous | Next