Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

  1. type Paths = [[Value]]

    registry Data.Registry.Internal.Statistics

    List of distinct paths from the root of the value graph to a leaf

  2. ProvidedValue :: Dynamic -> ValueDescription -> Value

    registry Data.Registry.Internal.Types

    No documentation available.

  3. class PathToTypeReps (path :: [Type])

    registry Data.Registry.Registry

    Typeclass for extracting type representations out of a list of types

  4. Prefix :: CompletionFunc m -> [(String, CompletionFunc m)] -> CompleterStyle (m :: Type -> Type)

    repline System.Console.Repline

    Conditional tab completion based on prefix.

  5. class Predicate (p :: k)

    rerefined Rerefined

    Types which define refinements on other types.

  6. module Rerefined.Predicate

    Base definitions for refinement predicates.

  7. class Predicate (p :: k)

    rerefined Rerefined.Predicate

    Types which define refinements on other types.

  8. type PredicateNameBOp (op :: Symbol) (prec :: Natural) (d :: Natural) (l :: k) (r :: k1) = ShowParen d > prec PredicateName prec + 1 l ++ op ++ PredicateName prec + 1 r

    rerefined Rerefined.Predicate.Common.Binary

    Render a binary combinator predicate with an infix operator. The operator must include the left and right spaces.

  9. Pos :: Sign

    rerefined Rerefined.Predicate.Relational

    No documentation available.

  10. Pos :: Sign

    rerefined Rerefined.Predicate.Relational.Value

    No documentation available.

Page 987 of many | Previous | Next