Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

  1. (-.) :: (a -> b) -> (b -> c) -> a -> c

    composition-prelude Control.Composition

    Backwards function composition. This is a specialization of <&>, but it has a different fixity.

  2. (:..>) :: forall (ts :: Stack) (b :: Type -> Type) c (t :: (Type -> Type) -> Type -> Type) . RunStackT ts b c -> (t (StackT ts b) c -> StackT ts b c) -> RunStackT (ts ':.|> t) b c

    deriving-trans Control.Monad.Trans.Compose.Stack

    run the next monad transformer on a stack

  3. (:.|>) :: Stack -> ((Type -> Type) -> Type -> Type) -> Stack

    deriving-trans Control.Monad.Trans.Compose.Stack

    add a monad transformer to a stack

  4. (=.=) :: (Hashable n, Floating n, RealFrac n) => P2 (Expr s n) -> P2 (Expr s n) -> Constrained s b n m ()

    diagrams-contrib Diagrams.TwoD.Layout.Constrained

    Constrain two points to be equal.

  5. (-.) :: Join n -> MFPathData P n -> MFPathData J n

    diagrams-contrib Diagrams.TwoD.Path.Metafont.Combinators

    See .- above.

  6. (:..) :: p -> !Trans p -> Interval p

    diff-loc DiffLoc.Interval

    No documentation available.

  7. (~*.) :: (C c, Fractional prob, Ord prob, Random prob, Ord a) => (Int, Int) -> (a -> c a) -> Transition prob a

    probability Numeric.Probability.Simulation

    returns the whole trace for a single simulation

  8. (~.) :: (C c, Fractional prob, Ord prob, Random prob, Ord a) => Int -> (a -> c a) -> Transition prob a

    probability Numeric.Probability.Simulation

    returns the final randomized transition

  9. (~..) :: (C c, Fractional prob, Ord prob, Random prob, Ord a) => (Int, Int) -> (a -> c a) -> RExpand prob a

    probability Numeric.Probability.Simulation

    returns the whole trace for a k-fold simulation

  10. (<.>) :: Pi a b -> Pi b c -> Pi a c

    relational-record Database.Relational.Documentation

    Compose projection path.

Page 163 of many | Previous | Next