CurryInfo: base-3.3.0 / Data.Either.partitionEithers

 
partitionEithers :: [Either a b] -> ([a],[b])
partitionEithers = foldr (either left right) ([],[])
 where
  left  a (l, r) = (a:l, r)
  right a (l, r) = (l, a:r)

 no demanded arguments

 deterministic operation

 
Partitions a list of `Either` into two lists.
All the `Left` elements are extracted, in order, to the first
component of the output.  Similarly the `Right` elements are extracted
to the second component of the output.

 ()

 referentially transparent operation

 no fixity defined

 {() |-> {foldr}}

 partitionEithers

 no precedence defined

 {foldr}

 [Prelude.Either a b] -> ([a], [b])

 operation might suspend on free variables

 yes

 reducible on all ground data terms