Safe Haskell | Trustworthy |
---|---|
Language | Haskell98 |
Prelude.Extras
Synopsis
- class Eq1 f where
- (==#) :: Eq a => f a -> f a -> Bool
- (/=#) :: (Eq1 f, Eq a) => f a -> f a -> Bool
- class Eq1 f => Ord1 f where
- compare1 :: Ord a => f a -> f a -> Ordering
- (<#) :: (Ord1 f, Ord a) => f a -> f a -> Bool
- (<=#) :: (Ord1 f, Ord a) => f a -> f a -> Bool
- (>=#) :: (Ord1 f, Ord a) => f a -> f a -> Bool
- (>#) :: (Ord1 f, Ord a) => f a -> f a -> Bool
- max1 :: (Ord1 f, Ord a) => f a -> f a -> f a
- min1 :: (Ord1 f, Ord a) => f a -> f a -> f a
- class Show1 f where
- showsPrec1 :: Show a => Int -> f a -> ShowS
- showList1 :: Show a => [f a] -> ShowS
- show1 :: (Show1 f, Show a) => f a -> String
- shows1 :: (Show1 f, Show a) => f a -> ShowS
- class Read1 f where
- readsPrec1 :: Read a => Int -> ReadS (f a)
- readList1 :: Read a => ReadS [f a]
- read1 :: (Read1 f, Read a) => String -> f a
- reads1 :: (Read1 f, Read a) => ReadS (f a)
- readPrec1 :: (Read1 f, Read a) => ReadPrec (f a)
- readListPrec1 :: (Read1 f, Read a) => ReadPrec [f a]
- readList1Default :: (Read1 f, Read a) => ReadS [f a]
- readListPrec1Default :: (Read1 f, Read a) => ReadPrec [f a]
- newtype Lift1 f a = Lift1 {
- lower1 :: f a
- class Eq2 f where
- (==##) :: (Eq a, Eq b) => f a b -> f a b -> Bool
- (/=##) :: (Eq2 f, Eq a, Eq b) => f a b -> f a b -> Bool
- class Eq2 f => Ord2 f where
- compare2 :: (Ord a, Ord b) => f a b -> f a b -> Ordering
- (<##) :: (Ord2 f, Ord a, Ord b) => f a b -> f a b -> Bool
- (<=##) :: (Ord2 f, Ord a, Ord b) => f a b -> f a b -> Bool
- (>=##) :: (Ord2 f, Ord a, Ord b) => f a b -> f a b -> Bool
- (>##) :: (Ord2 f, Ord a, Ord b) => f a b -> f a b -> Bool
- max2 :: (Ord2 f, Ord a, Ord b) => f a b -> f a b -> f a b
- min2 :: (Ord2 f, Ord a, Ord b) => f a b -> f a b -> f a b
- class Show2 f where
- showsPrec2 :: (Show a, Show b) => Int -> f a b -> ShowS
- showList2 :: (Show a, Show b) => [f a b] -> ShowS
- show2 :: (Show2 f, Show a, Show b) => f a b -> String
- shows2 :: (Show2 f, Show a, Show b) => f a b -> ShowS
- class Read2 f where
- readsPrec2 :: (Read a, Read b) => Int -> ReadS (f a b)
- readList2 :: (Read a, Read b) => ReadS [f a b]
- read2 :: (Read2 f, Read a, Read b) => String -> f a b
- reads2 :: (Read2 f, Read a, Read b) => ReadS (f a b)
- readPrec2 :: (Read2 f, Read a, Read b) => ReadPrec (f a b)
- readListPrec2 :: (Read2 f, Read a, Read b) => ReadPrec [f a b]
- readList2Default :: (Read2 f, Read a, Read b) => ReadS [f a b]
- readListPrec2Default :: (Read2 f, Read a, Read b) => ReadPrec [f a b]
- newtype Lift2 f a b = Lift2 {
- lower2 :: f a b
Lifted Prelude classes for kind * -> *
Minimal complete definition
Nothing
Methods
Instances
Eq1 ZipList Source # | |
Defined in Prelude.Extras | |
Eq1 Chan Source # | |
Defined in Prelude.Extras | |
Eq1 Complex Source # | |
Defined in Prelude.Extras | |
Eq1 Identity Source # | |
Defined in Prelude.Extras | |
Eq1 First Source # | |
Defined in Prelude.Extras | |
Eq1 Last Source # | |
Defined in Prelude.Extras | |
Eq1 Down Source # | |
Defined in Prelude.Extras | |
Eq1 Dual Source # | |
Defined in Prelude.Extras | |
Eq1 Product Source # | |
Defined in Prelude.Extras | |
Eq1 Sum Source # | |
Defined in Prelude.Extras | |
Eq1 TVar Source # | |
Defined in Prelude.Extras | |
Eq1 ForeignPtr Source # | |
Defined in Prelude.Extras | |
Eq1 IORef Source # | |
Defined in Prelude.Extras | |
Eq1 MVar Source # | |
Defined in Prelude.Extras | |
Eq1 FunPtr Source # | |
Defined in Prelude.Extras | |
Eq1 Ptr Source # | |
Defined in Prelude.Extras | |
Eq1 Ratio Source # | |
Defined in Prelude.Extras | |
Eq1 StablePtr Source # | |
Defined in Prelude.Extras | |
Eq1 Maybe Source # | |
Defined in Prelude.Extras | |
Eq1 [] Source # | |
Defined in Prelude.Extras | |
Eq a => Eq1 (Either a) Source # | |
Defined in Prelude.Extras | |
Eq1 (Fixed :: Type -> Type) Source # | |
Defined in Prelude.Extras | |
Eq1 (Proxy :: Type -> Type) Source # | |
Defined in Prelude.Extras | |
Eq1 f => Eq1 (Lift1 f) Source # | |
Eq a => Eq1 ((,) a) Source # | |
Defined in Prelude.Extras | |
Eq a => Eq1 (Const a :: Type -> Type) Source # | |
Defined in Prelude.Extras | |
Eq1 f => Eq1 (Alt f) Source # | |
Defined in Prelude.Extras | |
(Eq2 f, Eq a) => Eq1 (Lift2 f a) Source # | |
(Eq a, Eq b) => Eq1 ((,,) a b) Source # | |
Defined in Prelude.Extras | |
(Eq a, Eq b, Eq c) => Eq1 ((,,,) a b c) Source # | |
Defined in Prelude.Extras | |
(Eq a, Eq b, Eq c, Eq d) => Eq1 ((,,,,) a b c d) Source # | |
Defined in Prelude.Extras | |
(Eq a, Eq b, Eq c, Eq d, Eq e) => Eq1 ((,,,,,) a b c d e) Source # | |
Defined in Prelude.Extras | |
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f) => Eq1 ((,,,,,,) a b c d e f) Source # | |
Defined in Prelude.Extras | |
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g) => Eq1 ((,,,,,,,) a b c d e f g) Source # | |
Defined in Prelude.Extras | |
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h) => Eq1 ((,,,,,,,,) a b c d e f g h) Source # | |
Defined in Prelude.Extras | |
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i) => Eq1 ((,,,,,,,,,) a b c d e f g h i) Source # | |
Defined in Prelude.Extras |
class Eq1 f => Ord1 f where Source #
Minimal complete definition
Nothing
Methods
Instances
Ord1 ZipList Source # | |
Defined in Prelude.Extras | |
Ord1 Identity Source # | |
Defined in Prelude.Extras | |
Ord1 First Source # | |
Defined in Prelude.Extras | |
Ord1 Last Source # | |
Defined in Prelude.Extras | |
Ord1 Down Source # | |
Defined in Prelude.Extras | |
Ord1 Dual Source # | |
Defined in Prelude.Extras | |
Ord1 Product Source # | |
Defined in Prelude.Extras | |
Ord1 Sum Source # | |
Defined in Prelude.Extras | |
Ord1 ForeignPtr Source # | |
Defined in Prelude.Extras | |
Ord1 FunPtr Source # | |
Defined in Prelude.Extras | |
Ord1 Ptr Source # | |
Defined in Prelude.Extras | |
Ord1 Maybe Source # | |
Defined in Prelude.Extras | |
Ord1 [] Source # | |
Defined in Prelude.Extras | |
Ord a => Ord1 (Either a) Source # | |
Defined in Prelude.Extras | |
Ord1 (Fixed :: Type -> Type) Source # | |
Defined in Prelude.Extras | |
Ord1 (Proxy :: Type -> Type) Source # | |
Defined in Prelude.Extras | |
Ord1 f => Ord1 (Lift1 f) Source # | |
Ord a => Ord1 ((,) a) Source # | |
Defined in Prelude.Extras | |
Ord a => Ord1 (Const a :: Type -> Type) Source # | |
Defined in Prelude.Extras | |
Ord1 f => Ord1 (Alt f) Source # | |
Defined in Prelude.Extras | |
(Ord2 f, Ord a) => Ord1 (Lift2 f a) Source # | |
(Ord a, Ord b) => Ord1 ((,,) a b) Source # | |
Defined in Prelude.Extras | |
(Ord a, Ord b, Ord c) => Ord1 ((,,,) a b c) Source # | |
Defined in Prelude.Extras | |
(Ord a, Ord b, Ord c, Ord d) => Ord1 ((,,,,) a b c d) Source # | |
Defined in Prelude.Extras | |
(Ord a, Ord b, Ord c, Ord d, Ord e) => Ord1 ((,,,,,) a b c d e) Source # | |
Defined in Prelude.Extras | |
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => Ord1 ((,,,,,,) a b c d e f) Source # | |
Defined in Prelude.Extras | |
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => Ord1 ((,,,,,,,) a b c d e f g) Source # | |
Defined in Prelude.Extras | |
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h) => Ord1 ((,,,,,,,,) a b c d e f g h) Source # | |
Defined in Prelude.Extras | |
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i) => Ord1 ((,,,,,,,,,) a b c d e f g h i) Source # | |
Defined in Prelude.Extras |
Minimal complete definition
Nothing
Methods
showsPrec1 :: Show a => Int -> f a -> ShowS Source #
default showsPrec1 :: Show (f a) => Int -> f a -> ShowS Source #
Instances
Show1 ZipList Source # | |
Defined in Prelude.Extras | |
Show1 Complex Source # | |
Defined in Prelude.Extras | |
Show1 Identity Source # | |
Defined in Prelude.Extras | |
Show1 First Source # | |
Defined in Prelude.Extras | |
Show1 Last Source # | |
Defined in Prelude.Extras | |
Show1 Down Source # | |
Defined in Prelude.Extras | |
Show1 Dual Source # | |
Defined in Prelude.Extras | |
Show1 Product Source # | |
Defined in Prelude.Extras | |
Show1 Sum Source # | |
Defined in Prelude.Extras | |
Show1 ForeignPtr Source # | |
Defined in Prelude.Extras | |
Show1 FunPtr Source # | |
Defined in Prelude.Extras | |
Show1 Ptr Source # | |
Defined in Prelude.Extras | |
Show1 Maybe Source # | |
Defined in Prelude.Extras | |
Show1 [] Source # | |
Defined in Prelude.Extras | |
Show a => Show1 (Either a) Source # | |
Defined in Prelude.Extras | |
Show1 (Proxy :: Type -> Type) Source # | |
Defined in Prelude.Extras | |
Show1 f => Show1 (Lift1 f) Source # | |
Defined in Prelude.Extras | |
Show a => Show1 ((,) a) Source # | |
Defined in Prelude.Extras | |
Show a => Show1 (Const a :: Type -> Type) Source # | |
Defined in Prelude.Extras | |
Show1 f => Show1 (Alt f) Source # | |
Defined in Prelude.Extras | |
(Show2 f, Show a) => Show1 (Lift2 f a) Source # | |
Defined in Prelude.Extras | |
(Show a, Show b) => Show1 ((,,) a b) Source # | |
Defined in Prelude.Extras | |
(Show a, Show b, Show c) => Show1 ((,,,) a b c) Source # | |
Defined in Prelude.Extras | |
(Show a, Show b, Show c, Show d) => Show1 ((,,,,) a b c d) Source # | |
Defined in Prelude.Extras | |
(Show a, Show b, Show c, Show d, Show e) => Show1 ((,,,,,) a b c d e) Source # | |
Defined in Prelude.Extras | |
(Show a, Show b, Show c, Show d, Show e, Show f) => Show1 ((,,,,,,) a b c d e f) Source # | |
Defined in Prelude.Extras | |
(Show a, Show b, Show c, Show d, Show e, Show f, Show g) => Show1 ((,,,,,,,) a b c d e f g) Source # | |
Defined in Prelude.Extras | |
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h) => Show1 ((,,,,,,,,) a b c d e f g h) Source # | |
Defined in Prelude.Extras | |
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i) => Show1 ((,,,,,,,,,) a b c d e f g h i) Source # | |
Defined in Prelude.Extras |
Minimal complete definition
Nothing
Methods
readsPrec1 :: Read a => Int -> ReadS (f a) Source #
default readsPrec1 :: Read (f a) => Int -> ReadS (f a) Source #
Instances
Read1 ZipList Source # | |
Defined in Prelude.Extras | |
Read1 Complex Source # | |
Defined in Prelude.Extras | |
Read1 Identity Source # | |
Defined in Prelude.Extras | |
Read1 First Source # | |
Defined in Prelude.Extras | |
Read1 Last Source # | |
Defined in Prelude.Extras | |
Read1 Down Source # | |
Defined in Prelude.Extras | |
Read1 Dual Source # | |
Defined in Prelude.Extras | |
Read1 Product Source # | |
Defined in Prelude.Extras | |
Read1 Sum Source # | |
Defined in Prelude.Extras | |
Read1 Maybe Source # | |
Defined in Prelude.Extras | |
Read1 [] Source # | |
Defined in Prelude.Extras | |
Read a => Read1 (Either a) Source # | |
Defined in Prelude.Extras | |
Read1 (Proxy :: Type -> Type) Source # | |
Defined in Prelude.Extras | |
Read1 f => Read1 (Lift1 f) Source # | |
Defined in Prelude.Extras | |
Read a => Read1 ((,) a) Source # | |
Defined in Prelude.Extras | |
Read a => Read1 (Const a :: Type -> Type) Source # | |
Defined in Prelude.Extras | |
Read1 f => Read1 (Alt f) Source # | |
Defined in Prelude.Extras | |
(Read2 f, Read a) => Read1 (Lift2 f a) Source # | |
Defined in Prelude.Extras | |
(Read a, Read b) => Read1 ((,,) a b) Source # | |
Defined in Prelude.Extras | |
(Read a, Read b, Read c) => Read1 ((,,,) a b c) Source # | |
Defined in Prelude.Extras | |
(Read a, Read b, Read c, Read d) => Read1 ((,,,,) a b c d) Source # | |
Defined in Prelude.Extras | |
(Read a, Read b, Read c, Read d, Read e) => Read1 ((,,,,,) a b c d e) Source # | |
Defined in Prelude.Extras | |
(Read a, Read b, Read c, Read d, Read e, Read f) => Read1 ((,,,,,,) a b c d e f) Source # | |
Defined in Prelude.Extras | |
(Read a, Read b, Read c, Read d, Read e, Read f, Read g) => Read1 ((,,,,,,,) a b c d e f g) Source # | |
Defined in Prelude.Extras | |
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h) => Read1 ((,,,,,,,,) a b c d e f g h) Source # | |
Defined in Prelude.Extras | |
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i) => Read1 ((,,,,,,,,,) a b c d e f g h i) Source # | |
Defined in Prelude.Extras |
readListPrec1 :: (Read1 f, Read a) => ReadPrec [f a] Source #
readList1Default :: (Read1 f, Read a) => ReadS [f a] Source #
readListPrec1Default :: (Read1 f, Read a) => ReadPrec [f a] Source #
Instances
Foldable f => Foldable (Lift1 f) Source # | |
Defined in Prelude.Extras Methods fold :: Monoid m => Lift1 f m -> m foldMap :: Monoid m => (a -> m) -> Lift1 f a -> m foldMap' :: Monoid m => (a -> m) -> Lift1 f a -> m foldr :: (a -> b -> b) -> b -> Lift1 f a -> b foldr' :: (a -> b -> b) -> b -> Lift1 f a -> b foldl :: (b -> a -> b) -> b -> Lift1 f a -> b foldl' :: (b -> a -> b) -> b -> Lift1 f a -> b foldr1 :: (a -> a -> a) -> Lift1 f a -> a foldl1 :: (a -> a -> a) -> Lift1 f a -> a elem :: Eq a => a -> Lift1 f a -> Bool maximum :: Ord a => Lift1 f a -> a minimum :: Ord a => Lift1 f a -> a | |
Traversable f => Traversable (Lift1 f) Source # | |
Functor f => Functor (Lift1 f) Source # | |
Eq1 f => Eq1 (Lift1 f) Source # | |
Ord1 f => Ord1 (Lift1 f) Source # | |
Read1 f => Read1 (Lift1 f) Source # | |
Defined in Prelude.Extras | |
Show1 f => Show1 (Lift1 f) Source # | |
Defined in Prelude.Extras | |
(Read1 f, Read a) => Read (Lift1 f a) Source # | |
Defined in Prelude.Extras | |
(Show1 f, Show a) => Show (Lift1 f a) Source # | |
(Eq1 f, Eq a) => Eq (Lift1 f a) Source # | |
(Ord1 f, Ord a) => Ord (Lift1 f a) Source # | |
Defined in Prelude.Extras |
Lifted Prelude classes for kind * -> * -> *
Minimal complete definition
Nothing
Instances
Eq2 Either Source # | |
Defined in Prelude.Extras | |
Eq2 (,) Source # | |
Defined in Prelude.Extras | |
Eq2 (Const :: Type -> Type -> Type) Source # | |
Defined in Prelude.Extras | |
Eq2 f => Eq2 (Lift2 f) Source # | |
Eq a => Eq2 ((,,) a) Source # | |
Defined in Prelude.Extras | |
(Eq a, Eq b) => Eq2 ((,,,) a b) Source # | |
Defined in Prelude.Extras | |
(Eq a, Eq b, Eq c) => Eq2 ((,,,,) a b c) Source # | |
Defined in Prelude.Extras | |
(Eq a, Eq b, Eq c, Eq d) => Eq2 ((,,,,,) a b c d) Source # | |
Defined in Prelude.Extras | |
(Eq a, Eq b, Eq c, Eq d, Eq e) => Eq2 ((,,,,,,) a b c d e) Source # | |
Defined in Prelude.Extras | |
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f) => Eq2 ((,,,,,,,) a b c d e f) Source # | |
Defined in Prelude.Extras | |
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g) => Eq2 ((,,,,,,,,) a b c d e f g) Source # | |
Defined in Prelude.Extras | |
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h) => Eq2 ((,,,,,,,,,) a b c d e f g h) Source # | |
Defined in Prelude.Extras |
class Eq2 f => Ord2 f where Source #
Minimal complete definition
Nothing
Instances
Ord2 Either Source # | |
Defined in Prelude.Extras | |
Ord2 (,) Source # | |
Defined in Prelude.Extras | |
Ord2 (Const :: Type -> Type -> Type) Source # | |
Defined in Prelude.Extras | |
Ord2 f => Ord2 (Lift2 f) Source # | |
Ord a => Ord2 ((,,) a) Source # | |
Defined in Prelude.Extras | |
(Ord a, Ord b) => Ord2 ((,,,) a b) Source # | |
Defined in Prelude.Extras | |
(Ord a, Ord b, Ord c) => Ord2 ((,,,,) a b c) Source # | |
Defined in Prelude.Extras | |
(Ord a, Ord b, Ord c, Ord d) => Ord2 ((,,,,,) a b c d) Source # | |
Defined in Prelude.Extras | |
(Ord a, Ord b, Ord c, Ord d, Ord e) => Ord2 ((,,,,,,) a b c d e) Source # | |
Defined in Prelude.Extras | |
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => Ord2 ((,,,,,,,) a b c d e f) Source # | |
Defined in Prelude.Extras | |
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => Ord2 ((,,,,,,,,) a b c d e f g) Source # | |
Defined in Prelude.Extras | |
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h) => Ord2 ((,,,,,,,,,) a b c d e f g h) Source # | |
Defined in Prelude.Extras |
Minimal complete definition
Nothing
Methods
showsPrec2 :: (Show a, Show b) => Int -> f a b -> ShowS Source #
default showsPrec2 :: Show (f a b) => Int -> f a b -> ShowS Source #
Instances
Show2 Either Source # | |
Defined in Prelude.Extras | |
Show2 (,) Source # | |
Defined in Prelude.Extras | |
Show2 (Const :: Type -> Type -> Type) Source # | |
Defined in Prelude.Extras | |
Show2 f => Show2 (Lift2 f) Source # | |
Defined in Prelude.Extras | |
Show a => Show2 ((,,) a) Source # | |
Defined in Prelude.Extras | |
(Show a, Show b) => Show2 ((,,,) a b) Source # | |
Defined in Prelude.Extras | |
(Show a, Show b, Show c) => Show2 ((,,,,) a b c) Source # | |
Defined in Prelude.Extras | |
(Show a, Show b, Show c, Show d) => Show2 ((,,,,,) a b c d) Source # | |
Defined in Prelude.Extras | |
(Show a, Show b, Show c, Show d, Show e) => Show2 ((,,,,,,) a b c d e) Source # | |
Defined in Prelude.Extras | |
(Show a, Show b, Show c, Show d, Show e, Show f) => Show2 ((,,,,,,,) a b c d e f) Source # | |
Defined in Prelude.Extras | |
(Show a, Show b, Show c, Show d, Show e, Show f, Show g) => Show2 ((,,,,,,,,) a b c d e f g) Source # | |
Defined in Prelude.Extras | |
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h) => Show2 ((,,,,,,,,,) a b c d e f g h) Source # | |
Defined in Prelude.Extras |
Minimal complete definition
Nothing
Methods
readsPrec2 :: (Read a, Read b) => Int -> ReadS (f a b) Source #
default readsPrec2 :: Read (f a b) => Int -> ReadS (f a b) Source #
Instances
Read2 Either Source # | |
Defined in Prelude.Extras | |
Read2 (,) Source # | |
Defined in Prelude.Extras | |
Read2 (Const :: Type -> Type -> Type) Source # | |
Defined in Prelude.Extras | |
Read2 f => Read2 (Lift2 f) Source # | |
Defined in Prelude.Extras | |
Read a => Read2 ((,,) a) Source # | |
Defined in Prelude.Extras | |
(Read a, Read b) => Read2 ((,,,) a b) Source # | |
Defined in Prelude.Extras | |
(Read a, Read b, Read c) => Read2 ((,,,,) a b c) Source # | |
Defined in Prelude.Extras | |
(Read a, Read b, Read c, Read d) => Read2 ((,,,,,) a b c d) Source # | |
Defined in Prelude.Extras | |
(Read a, Read b, Read c, Read d, Read e) => Read2 ((,,,,,,) a b c d e) Source # | |
Defined in Prelude.Extras | |
(Read a, Read b, Read c, Read d, Read e, Read f) => Read2 ((,,,,,,,) a b c d e f) Source # | |
Defined in Prelude.Extras | |
(Read a, Read b, Read c, Read d, Read e, Read f, Read g) => Read2 ((,,,,,,,,) a b c d e f g) Source # | |
Defined in Prelude.Extras | |
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h) => Read2 ((,,,,,,,,,) a b c d e f g h) Source # | |
Defined in Prelude.Extras |
readListPrec2 :: (Read2 f, Read a, Read b) => ReadPrec [f a b] Source #
readList2Default :: (Read2 f, Read a, Read b) => ReadS [f a b] Source #
readListPrec2Default :: (Read2 f, Read a, Read b) => ReadPrec [f a b] Source #
Instances
Eq2 f => Eq2 (Lift2 f) Source # | |
Ord2 f => Ord2 (Lift2 f) Source # | |
Read2 f => Read2 (Lift2 f) Source # | |
Defined in Prelude.Extras | |
Show2 f => Show2 (Lift2 f) Source # | |
Defined in Prelude.Extras | |
Foldable (f a) => Foldable (Lift2 f a) Source # | |
Defined in Prelude.Extras Methods fold :: Monoid m => Lift2 f a m -> m foldMap :: Monoid m => (a0 -> m) -> Lift2 f a a0 -> m foldMap' :: Monoid m => (a0 -> m) -> Lift2 f a a0 -> m foldr :: (a0 -> b -> b) -> b -> Lift2 f a a0 -> b foldr' :: (a0 -> b -> b) -> b -> Lift2 f a a0 -> b foldl :: (b -> a0 -> b) -> b -> Lift2 f a a0 -> b foldl' :: (b -> a0 -> b) -> b -> Lift2 f a a0 -> b foldr1 :: (a0 -> a0 -> a0) -> Lift2 f a a0 -> a0 foldl1 :: (a0 -> a0 -> a0) -> Lift2 f a a0 -> a0 toList :: Lift2 f a a0 -> [a0] elem :: Eq a0 => a0 -> Lift2 f a a0 -> Bool maximum :: Ord a0 => Lift2 f a a0 -> a0 minimum :: Ord a0 => Lift2 f a a0 -> a0 | |
Traversable (f a) => Traversable (Lift2 f a) Source # | |
Defined in Prelude.Extras | |
Functor (f a) => Functor (Lift2 f a) Source # | |
(Eq2 f, Eq a) => Eq1 (Lift2 f a) Source # | |
(Ord2 f, Ord a) => Ord1 (Lift2 f a) Source # | |
(Read2 f, Read a) => Read1 (Lift2 f a) Source # | |
Defined in Prelude.Extras | |
(Show2 f, Show a) => Show1 (Lift2 f a) Source # | |
Defined in Prelude.Extras | |
(Read2 f, Read a, Read b) => Read (Lift2 f a b) Source # | |
Defined in Prelude.Extras | |
(Show2 f, Show a, Show b) => Show (Lift2 f a b) Source # | |
(Eq2 f, Eq a, Eq b) => Eq (Lift2 f a b) Source # | |
(Ord2 f, Ord a, Ord b) => Ord (Lift2 f a b) Source # | |