Hoogle Search
Within LTS Haskell 24.40 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
data
Pure1 (c :: a -> b) (d :: a) (e :: b)first-class-families Fcf.Combinators No documentation available.
data
Pure2 (d :: a -> b -> c) (e :: a) (f :: b) (g :: c)first-class-families Fcf.Combinators No documentation available.
data
Pure3 (e :: a -> b -> c -> d) (f :: a) (g :: b) (h :: c) (i :: d)first-class-families Fcf.Combinators No documentation available.
data
Pure4 (f :: a -> b -> c -> d -> e) (g :: a) (h :: b) (i :: c) (j :: d) (k :: e)first-class-families Fcf.Combinators No documentation available.
data
Pure5 (g :: a -> b -> c -> d -> e -> f) (h :: a) (i :: b) (j :: c) (k :: d) (l :: e) (m :: f)first-class-families Fcf.Combinators No documentation available.
-
first-class-families Fcf.Combinators No documentation available.
-
first-class-families Fcf.Combinators No documentation available.
-
first-class-families Fcf.Combinators No documentation available.
-
first-class-families Fcf.Combinators No documentation available.
data
Partition (b :: a -> Exp Bool) (c :: [a]) (d :: ([a], [a]))first-class-families Fcf.Data.List Split a list into one where all elements satisfy a predicate, and a second where no elements satisfy it.
Example
>>> :kind! Eval (Partition ((>=) 35) [20, 30, 40, 50]) Eval (Partition ((>=) 35) [20, 30, 40, 50]) :: ([Natural], [Natural]) = '([20, 30], [40, 50])