partitionEithers, -- :: [Either a b] -> ([a],[b])
) where
-import Data.Tuple ()
+#include "Typeable.h"
#ifdef __GLASGOW_HASKELL__
import GHC.Base
+import GHC.Show
+import GHC.Read
+#endif
+import Data.Typeable
+
+#ifdef __GLASGOW_HASKELL__
{-
-- just for testing
import Test.QuickCheck
used to hold an error value and the 'Right' constructor is used to
hold a correct value (mnemonic: \"right\" also means \"correct\").
-}
-data Either a b = Left a | Right b deriving (Eq, Ord )
+data Either a b = Left a | Right b deriving (Eq, Ord, Read, Show)
-- | Case analysis for the 'Either' type.
-- If the value is @'Left' a@, apply the first function to @a@;
either _ g (Right y) = g y
#endif /* __GLASGOW_HASKELL__ */
+INSTANCE_TYPEABLE2(Either,eitherTc,"Either")
+
-- | Extracts from a list of 'Either' all the 'Left' elements
-- All the 'Left' elements are extracted in order.
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)
+ left a ~(l, r) = (a:l, r)
+ right a ~(l, r) = (l, a:r)
{-
{--------------------------------------------------------------------