Hoogle Search

Within LTS Haskell 24.42 (ghc-9.10.3)

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

Exact lookup

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

   one-liner	Generics.OneLiner.Internal

   No documentation available.

2. (&!:*) :: forall (tag :: Symbol) m t b . (Sayable tag b, Sayable tag m, Foldable t) => ([Doc SayableAnn] -> Doc SayableAnn) -> b -> t m -> Saying tag

   sayable	Text.Sayable

   A helper operator that applies the first argument (which converts an array of 'Prettyprinter.Doc ann' elements to a single 'PrettyPrinter.Doc ann' element) to the second argument, which is a Foldable collection of Sayable items. This is essentially a combination of the &! and &:* operators. Unlike the other operators defined in this package, this is a trinary operator rather than a binary operator. Because function application (whitespace) is the highest precedence, the last argument will typically need a preceeding $ to prevent applying the second argument to the third argument before applying this operator.

   >>> sez @"info" $ t'"three:" &- (PP.align . PP.vsep &!:* (t'" or")) [1, 2, 3::Int]
   "three: 1 or\n       2 or\n       3"
   

3. (&:*) :: forall (tag :: Symbol) m e t . (Sayable tag m, Sayable tag e, Foldable t) => m -> t e -> Saying tag

   sayable	Text.Sayable

   A helper operator that generates a sayable from a list of sayable items, separated by the first sayable argument (instead of the ", " that use used by the &* operator).

   >>> sez @"info" $ t'"three:" &- t'".." &:* [1, 2, 3::Int]
   "three: 1..2..3"
   

4. (..:) :: (d -> e) -> (a -> b -> c -> d) -> a -> b -> c -> e

   speculate	Test.Speculate.Utils

   No documentation available.

5. (.:) :: (c -> d) -> (a -> b -> c) -> a -> b -> d

   speculate	Test.Speculate.Utils

   No documentation available.

6. ($/:) :: forall f sig yv0 yv1 (arrow :: Type -> Type -> Type) rate amp0 amp1 . (Applicative f, Transform sig yv0, Transform sig yv1, Applicable arrow rate) => f (Single arrow amp0 amp1 yv0 yv1) -> f (T rate amp0 (sig yv0)) -> f (T rate amp1 (sig yv1))

   synthesizer-dimensional	Synthesizer.Dimensional.Arrow

   No documentation available.

7. ($/:) :: (Applicative f, Transform sig yv0, Transform sig yv1) => f (Single s amp0 amp1 yv0 yv1) -> f (T (Phantom s) amp0 (sig yv0)) -> f (T (Phantom s) amp1 (sig yv1))

   synthesizer-dimensional	Synthesizer.Dimensional.Causal.Process

   No documentation available.

8. ($:) :: Applicative f => f (a -> b) -> f a -> f b

   synthesizer-dimensional	Synthesizer.Dimensional.Process

   This corresponds to <*>

9. ($::) :: (Applicative f, Traversable t) => f (t a -> b) -> t (f a) -> f b

   synthesizer-dimensional	Synthesizer.Dimensional.Process

   Instead of mixMulti $:: map f xs the caller should write mixMulti $: mapM f xs in order to save the user from learning another infix operator.

10. (.:) :: (Applicative f, Arrow arrow) => f (arrow b c) -> f (arrow a b) -> f (arrow a c)

    synthesizer-dimensional	Synthesizer.Dimensional.Process

    No documentation available.

Page 88 of many | Previous | Next