Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

Exact lookup

1. ($:) :: ToBuilder b => (Builder -> b) -> Builder -> b

   caster	System.Log.Caster

   Infix version of fix.

2. (<:>) :: (ToBuilder a, ToBuilder b) => a -> b -> Builder

   caster	System.Log.Caster

   Concat ToBuilder strings as Builder Builder.

3. ($:) :: ToBuilder b => (Builder -> b) -> Builder -> b

   caster	System.Log.Caster.Core

   Infix version of fix.

4. (<:>) :: (ToBuilder a, ToBuilder b) => a -> b -> Builder

   caster	System.Log.Caster.Core

   Concat ToBuilder strings as Builder Builder.

5. ($:) :: ToBuilder b => (Builder -> b) -> Builder -> b

   caster	System.Log.Caster.Monad

   Infix version of fix.

6. (<:>) :: (ToBuilder a, ToBuilder b) => a -> b -> Builder

   caster	System.Log.Caster.Monad

   Concat ToBuilder strings as Builder Builder.

7. (-:-) :: Expr -> Expr -> Expr

   code-conjure	Conjure.Engine

   The list constructor lifted over the Expr type. Works for the element types Int, Char and Bool.

   > zero -:- one -:- unit two
   [0,1,2] :: [Int]
   

   > zero -:- one -:- two -:- nil
   [0,1,2] :: [Int]
   

   > bee -:- unit cee
   "bc" :: [Char]
   

8. (-:-) :: Expr -> Expr -> Expr

   code-conjure	Conjure.Expr

   The list constructor lifted over the Expr type. Works for the element types Int, Char and Bool.

   > zero -:- one -:- unit two
   [0,1,2] :: [Int]
   

   > zero -:- one -:- two -:- nil
   [0,1,2] :: [Int]
   

   > bee -:- unit cee
   "bc" :: [Char]
   

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

   composition	Data.Composition

   Compose two functions. f .: g is similar to f . g except that g will be fed two arguments instead of one before handing its result to f. This function is defined as

   (f .: g) x y = f (g x y)
   

   Example usage:

   concatMap :: (a -> [b]) -> [a] -> [b]
   concatMap = concat .: map
   

   Notice how two arguments (the function and the list) will be given to map before the result is passed to concat. This is equivalent to:

   concatMap f xs = concat (map f xs)
   

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

    composition	Data.Composition

    One compact pattern for composition operators is to "count the dots after the first one", which begins with the common .:, and proceeds by first appending another . and then replacing it with :

Page 94 of many | Previous | Next