Hoogle Search

Within LTS Haskell 24.37 (ghc-9.10.3)

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

  1. data Pos

    megaparsec Text.Megaparsec.Pos

    Pos is the type for positive integers. This is used to represent line number, column number, and similar things like indentation level. Semigroup instance can be used to safely and efficiently add Poses together.

  2. data PosState s

    megaparsec Text.Megaparsec.State

    A special kind of state that is used to calculate line/column positions on demand.

  3. PosState :: s -> Int -> SourcePos -> Pos -> String -> PosState s

    megaparsec Text.Megaparsec.State

    No documentation available.

  4. module Safe.Partial

    ConstraintKind synonym for marking partial functions

  5. type Partial = HasCallStack

    safe Safe.Partial

    A constraint synonym which denotes that the function is partial, and will (on GHC 8.* and up) produce a stack trace on failure. You may mark your own non-total functions as Partial, if necessary, and this will ensure that they produce useful stack traces.

  6. type Partial = HasCallStack

    extra Control.Exception.Extra

    A constraint which documents that a function is partial, and on GHC 8.0 and above produces a stack trace on failure. For example: 

    myHead :: Partial => [a] -> a
myHead [] = error "bad"
myHead (x:xs) = x
    When using Partial with GHC 7.8 or below you need to enable the language feature ConstraintKinds, e.g. {-# LANGUAGE ConstraintKinds #-} at the top of the file.

  7. type Partial = HasCallStack

    extra Extra

    A constraint which documents that a function is partial, and on GHC 8.0 and above produces a stack trace on failure. For example: 

    myHead :: Partial => [a] -> a
myHead [] = error "bad"
myHead (x:xs) = x
    When using Partial with GHC 7.8 or below you need to enable the language feature ConstraintKinds, e.g. {-# LANGUAGE ConstraintKinds #-} at the top of the file.

  8. module Data.Functor.Plus

    No documentation available.

  9. class Alt f => Plus (f :: Type -> Type)

    semigroupoids Data.Functor.Plus

    Laws: 

    zero <!> m = m
m <!> zero = m
    If extended to an Alternative then zero should equal empty.

  10. newtype Product a

    base-compat Data.Monoid.Compat

    Monoid under multiplication. 

    Product x <> Product y == Product (x * y)

    Examples

    >>> Product 3 <> Product 4 <> mempty
Product {getProduct = 12}

    >>> mconcat [ Product n | n <- [2 .. 10]]
Product {getProduct = 3628800}

Page 73 of many | Previous | Next