Hoogle Search

Within LTS Haskell 24.20 (ghc-9.10.3)

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

  1. (.*) :: a -> ix -> Term a ix

    comfort-glpk Numeric.GLPK

    No documentation available.

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

    composition Data.Composition

    Equivalent to .: The pattern of appending asterisks is straightforward to extend to similar functions: (compose2 = .*, compose3 = .**, etc). However, .: has been commonly adopted amongst Haskellers, and the need for compose3 and beyond is rare in practice.

  3. (.**) :: (d -> e) -> (a -> b -> c -> d) -> a -> b -> c -> e

    composition Data.Composition

    No documentation available.

  4. (.***) :: (d -> e) -> (a1 -> a2 -> b -> c -> d) -> a1 -> a2 -> b -> c -> e

    composition Data.Composition

    No documentation available.

  5. (.****) :: (d -> e) -> (a1 -> a2 -> a3 -> b -> c -> d) -> a1 -> a2 -> a3 -> b -> c -> e

    composition Data.Composition

    No documentation available.

  6. (.*****) :: (d -> e) -> (a1 -> a2 -> a3 -> a4 -> b -> c -> d) -> a1 -> a2 -> a3 -> a4 -> b -> c -> e

    composition Data.Composition

    No documentation available.

  7. (.******) :: (d -> e) -> (a1 -> a2 -> a3 -> a4 -> a5 -> b -> c -> d) -> a1 -> a2 -> a3 -> a4 -> a5 -> b -> c -> e

    composition Data.Composition

    No documentation available.

  8. (.*******) :: (d -> e) -> (a1 -> a2 -> a3 -> a4 -> a5 -> a6 -> b -> c -> d) -> a1 -> a2 -> a3 -> a4 -> a5 -> a6 -> b -> c -> e

    composition Data.Composition

    No documentation available.

  9. (.********) :: (d -> e) -> (a1 -> a2 -> a3 -> a4 -> a5 -> a6 -> a7 -> b -> c -> d) -> a1 -> a2 -> a3 -> a4 -> a5 -> a6 -> a7 -> b -> c -> e

    composition Data.Composition

    No documentation available.

  10. (.:) :: (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)
    

Page 56 of many | Previous | Next