Hoogle Search

Within LTS Haskell 24.58 (ghc-9.10.3)

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

  1. (***) :: (a -> a') -> (b -> b') -> (a, b) -> (a', b')

    extra Extra

    Given two functions, apply one to the first component and one to the second. A specialised version of ***. 

    (succ *** reverse) (1,"test") == (2,"tset")

  2. (***) :: (a :- b) -> (c :- d) -> (a, c) :- (b, d)

    constraints Data.Constraint

    due to the hack for the kind of (,) in the current version of GHC we can't actually make instances for (,) :: Constraint -> Constraint -> Constraint, but (,) is a bifunctor on the category of constraints. This lets us map over both sides.

  3. (***) :: Arrow a => a b c -> a b' c' -> a (b, b') (c, c')

    rio RIO.Prelude

    Split the input between the two argument arrows and combine their output. Note that this is in general not a functor. The default definition may be overridden with a more efficient version if desired.

  4. (**=) :: (MonadState s m, Floating a) => ASetter' s a -> a -> m ()

    diagrams-lib Diagrams.Prelude

    Raise the target(s) of a numerically valued Lens, Setter or Traversal to an arbitrary power 

    >>> execState (do _1 **= c; _2 **= d) (a,b)
(a**c,b**d)

    (**=) ::  (MonadState s m, Floating a) => Setter' s a    -> a -> m ()
(**=) ::  (MonadState s m, Floating a) => Iso' s a       -> a -> m ()
(**=) ::  (MonadState s m, Floating a) => Lens' s a      -> a -> m ()
(**=) ::  (MonadState s m, Floating a) => Traversal' s a -> a -> m ()

  5. (**~) :: Floating a => ASetter s t a a -> a -> s -> t

    diagrams-lib Diagrams.Prelude

    Raise the target(s) of a floating-point valued Lens, Setter or Traversal to an arbitrary power. 

    >>> (a,b) & _1 **~ c
(a**c,b)

    >>> (a,b) & both **~ c
(a**c,b**c)

    >>> _2 **~ 10 $ (3,2)
(3,1024.0)

    (**~) :: Floating a => Setter' s a    -> a -> s -> s
(**~) :: Floating a => Iso' s a       -> a -> s -> s
(**~) :: Floating a => Lens' s a      -> a -> s -> s
(**~) :: Floating a => Traversal' s a -> a -> s -> s

  6. data ((a :: b -> Exp c) *** (d :: b' -> Exp c')) (e :: (b, b')) (f :: (c, c'))

    first-class-families Fcf

    Specialization of Bimap for pairs.

  7. data ((a :: b -> Exp c) *** (d :: b' -> Exp c')) (e :: (b, b')) (f :: (c, c'))

    first-class-families Fcf.Data.Common

    Specialization of Bimap for pairs.

  8. (**##) :: Double# -> Double# -> Double#

    ghc-internal GHC.Internal.Base

    Exponentiation.

  9. (***) :: Arrow a => a b c -> a b' c' -> a (b, b') (c, c')

    ghc-internal GHC.Internal.Control.Arrow

    Split the input between the two argument arrows and combine their output. Note that this is in general not a functor. The default definition may be overridden with a more efficient version if desired.

  10. (**##) :: Double# -> Double# -> Double#

    ghc-internal GHC.Internal.Exts

    Exponentiation.

Page 6 of many | Previous | Next