Safe Haskell | None |
---|---|
Language | Haskell2010 |
Documentation
module GHC.Toolchain.Monad
module GHC.Toolchain.Lens
error :: HasCallStack => [Char] -> a #
errorWithoutStackTrace :: [Char] -> a #
undefined :: HasCallStack => a #
ioError :: HasCallStack => IOError -> IO a #
(!!) :: HasCallStack => [a] -> Int -> a #
cycle :: HasCallStack => [a] -> [a] #
head :: HasCallStack => [a] -> a #
init :: HasCallStack => [a] -> [a] #
last :: HasCallStack => [a] -> a #
tail :: HasCallStack => [a] -> [a] #
(^^) :: (Fractional a, Integral b) => a -> b -> a #
fromIntegral :: (Integral a, Num b) => a -> b #
realToFrac :: (Real a, Fractional b) => a -> b #
showString :: String -> ShowS #
getContents :: IO String #
class Functor f => Applicative (f :: Type -> Type) where #
Instances
Applicative Complex Source # | Since: base-4.9.0.0 |
Applicative First Source # | Since: base-4.9.0.0 |
Applicative Last Source # | Since: base-4.9.0.0 |
Applicative Max Source # | Since: base-4.9.0.0 |
Applicative Min Source # | Since: base-4.9.0.0 |
Applicative Seq # | |
Applicative Tree # | |
Applicative NonEmpty # | |
Applicative Par1 # | |
Applicative Q # | |
Applicative P # | |
Applicative ReadP # | |
Applicative ReadPrec # | |
Defined in GHC.Internal.Text.ParserCombinators.ReadPrec | |
Applicative IO # | |
Applicative M Source # | |
Applicative Maybe # | |
Applicative Solo # | |
Applicative [] # | |
Monad m => Applicative (WrappedMonad m) Source # | Since: base-2.1 |
Defined in Control.Applicative pure :: a -> WrappedMonad m a # (<*>) :: WrappedMonad m (a -> b) -> WrappedMonad m a -> WrappedMonad m b # liftA2 :: (a -> b -> c) -> WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m c # (*>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b # (<*) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m a # | |
Applicative (Either e) # | |
Applicative (U1 :: Type -> Type) # | |
Applicative (IParser t) Source # | |
Applicative f => Applicative (Lift f) Source # | A combination is |
(Functor m, Monad m) => Applicative (MaybeT m) Source # | |
Monoid a => Applicative ((,) a) # | |
Arrow a => Applicative (WrappedArrow a b) Source # | Since: base-2.1 |
Defined in Control.Applicative pure :: a0 -> WrappedArrow a b a0 # (<*>) :: WrappedArrow a b (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 # liftA2 :: (a0 -> b0 -> c) -> WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b c # (*>) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b b0 # (<*) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 # | |
(Applicative f, Monad f) => Applicative (WhenMissing f x) # | |
Defined in Data.IntMap.Internal pure :: a -> WhenMissing f x a # (<*>) :: WhenMissing f x (a -> b) -> WhenMissing f x a -> WhenMissing f x b # liftA2 :: (a -> b -> c) -> WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x c # (*>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b # (<*) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x a # | |
(Generic1 f, Applicative (Rep1 f)) => Applicative (Generically1 f) # | |
Defined in GHC.Internal.Generics pure :: a -> Generically1 f a # (<*>) :: Generically1 f (a -> b) -> Generically1 f a -> Generically1 f b # liftA2 :: (a -> b -> c) -> Generically1 f a -> Generically1 f b -> Generically1 f c # (*>) :: Generically1 f a -> Generically1 f b -> Generically1 f b # (<*) :: Generically1 f a -> Generically1 f b -> Generically1 f a # | |
Applicative f => Applicative (Rec1 f) # | |
Applicative f => Applicative (Backwards f) Source # | Apply |
Defined in Control.Applicative.Backwards | |
(Monoid w, Functor m, Monad m) => Applicative (AccumT w m) Source # | |
Defined in Control.Monad.Trans.Accum | |
(Functor m, Monad m) => Applicative (ExceptT e m) Source # | |
Defined in Control.Monad.Trans.Except | |
Applicative m => Applicative (IdentityT m) Source # | |
Defined in Control.Monad.Trans.Identity | |
Applicative m => Applicative (ReaderT r m) Source # | |
Defined in Control.Monad.Trans.Reader | |
(Functor m, Monad m) => Applicative (SelectT r m) Source # | |
Defined in Control.Monad.Trans.Select | |
(Functor m, Monad m) => Applicative (StateT s m) Source # | |
Defined in Control.Monad.Trans.State.Lazy | |
(Functor m, Monad m) => Applicative (StateT s m) Source # | |
Defined in Control.Monad.Trans.State.Strict | |
(Functor m, Monad m) => Applicative (WriterT w m) Source # | |
Defined in Control.Monad.Trans.Writer.CPS | |
(Monoid w, Applicative m) => Applicative (WriterT w m) Source # | |
Defined in Control.Monad.Trans.Writer.Lazy | |
(Monoid w, Applicative m) => Applicative (WriterT w m) Source # | |
Defined in Control.Monad.Trans.Writer.Strict | |
Monoid a => Applicative (Constant a :: Type -> Type) Source # | |
Defined in Data.Functor.Constant | |
Applicative f => Applicative (Reverse f) Source # | Derived instance. |
(Monoid a, Monoid b) => Applicative ((,,) a b) # | |
(Applicative f, Applicative g) => Applicative (Product f g) Source # | Since: base-4.9.0.0 |
Defined in Data.Functor.Product | |
(Monad f, Applicative f) => Applicative (WhenMatched f x y) # | |
Defined in Data.IntMap.Internal pure :: a -> WhenMatched f x y a # (<*>) :: WhenMatched f x y (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b # liftA2 :: (a -> b -> c) -> WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y c # (*>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b # (<*) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y a # | |
(Applicative f, Monad f) => Applicative (WhenMissing f k x) # | |
Defined in Data.Map.Internal pure :: a -> WhenMissing f k x a # (<*>) :: WhenMissing f k x (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b # liftA2 :: (a -> b -> c) -> WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x c # (*>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b # (<*) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x a # | |
(Applicative f, Applicative g) => Applicative (f :*: g) # | |
Monoid c => Applicative (K1 i c :: Type -> Type) # | |
Applicative (ContT r m) Source # | |
(Monoid a, Monoid b, Monoid c) => Applicative ((,,,) a b c) # | |
Defined in GHC.Internal.Base | |
Applicative ((->) r) # | |
(Applicative f, Applicative g) => Applicative (Compose f g) Source # | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose | |
(Monad f, Applicative f) => Applicative (WhenMatched f k x y) # | |
Defined in Data.Map.Internal pure :: a -> WhenMatched f k x y a # (<*>) :: WhenMatched f k x y (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b # liftA2 :: (a -> b -> c) -> WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y c # (*>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b # (<*) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y a # | |
(Applicative f, Applicative g) => Applicative (f :.: g) # | |
Applicative f => Applicative (M1 i c f) # | |
(Functor m, Monad m) => Applicative (RWST r w s m) Source # | |
Defined in Control.Monad.Trans.RWS.CPS | |
(Monoid w, Functor m, Monad m) => Applicative (RWST r w s m) Source # | |
Defined in Control.Monad.Trans.RWS.Lazy | |
(Monoid w, Functor m, Monad m) => Applicative (RWST r w s m) Source # | |
Defined in Control.Monad.Trans.RWS.Strict |
class Functor (f :: Type -> Type) where #
Instances
class Applicative m => Monad (m :: Type -> Type) where #
Instances
class Semigroup a => Monoid a where #
Instances
Monoid ByteArray Source # | Since: base-4.17.0.0 |
Monoid ByteString # | |
Monoid ByteString # | |
Monoid ShortByteString # | |
Monoid IntSet # | |
Monoid Unit # | |
Monoid Ordering # | |
Monoid OsString # | |
Monoid PosixString # | |
Defined in System.OsString.Internal.Types mempty :: PosixString # mappend :: PosixString -> PosixString -> PosixString # mconcat :: [PosixString] -> PosixString # | |
Monoid WindowsString # | |
Defined in System.OsString.Internal.Types mempty :: WindowsString # mappend :: WindowsString -> WindowsString -> WindowsString # mconcat :: [WindowsString] -> WindowsString # | |
Monoid Doc # | |
Monoid Builder Source # | |
Monoid StrictTextBuilder Source # | |
Defined in Data.Text.Internal.StrictBuilder | |
Monoid CalendarDiffDays # | |
Monoid CalendarDiffTime # | |
Monoid () # | |
Monoid (Comparison a) Source # |
mempty :: Comparison a mempty = Comparison _ _ -> EQ |
Defined in Data.Functor.Contravariant mempty :: Comparison a # mappend :: Comparison a -> Comparison a -> Comparison a # mconcat :: [Comparison a] -> Comparison a # | |
Monoid (Equivalence a) Source # |
mempty :: Equivalence a mempty = Equivalence _ _ -> True |
Defined in Data.Functor.Contravariant mempty :: Equivalence a # mappend :: Equivalence a -> Equivalence a -> Equivalence a # mconcat :: [Equivalence a] -> Equivalence a # | |
Monoid (Predicate a) Source # |
mempty :: Predicate a mempty = _ -> True |
(Ord a, Bounded a) => Monoid (Max a) Source # | Since: base-4.9.0.0 |
(Ord a, Bounded a) => Monoid (Min a) Source # | Since: base-4.9.0.0 |
Monoid m => Monoid (WrappedMonoid m) Source # | Since: base-4.9.0.0 |
Defined in Data.Semigroup mempty :: WrappedMonoid m # mappend :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # mconcat :: [WrappedMonoid m] -> WrappedMonoid m # | |
Monoid (IntMap a) # | |
Monoid (Seq a) # | |
Monoid (MergeSet a) # | |
Ord a => Monoid (Set a) # | |
(Generic a, Monoid (Rep a ())) => Monoid (Generically a) # | |
Defined in GHC.Internal.Generics mempty :: Generically a # mappend :: Generically a -> Generically a -> Generically a # mconcat :: [Generically a] -> Generically a # | |
Monoid p => Monoid (Par1 p) # | |
Monoid a => Monoid (Q a) # | |
Monoid a => Monoid (IO a) # | |
Monoid (Doc a) # | |
Semigroup a => Monoid (Maybe a) # | |
Monoid a => Monoid (Solo a) # | |
Monoid [a] # | |
Monoid a => Monoid (Op a b) Source # |
mempty :: Op a b mempty = Op _ -> mempty |
Ord k => Monoid (Map k v) # | |
Monoid (U1 p) # | |
(Monoid a, Monoid b) => Monoid (a, b) # | |
Monoid b => Monoid (a -> b) # | |
Monoid (f p) => Monoid (Rec1 f p) # | |
Monoid a => Monoid (Constant a b) Source # | |
(Monoid a, Monoid b, Monoid c) => Monoid (a, b, c) # | |
(Monoid (f a), Monoid (g a)) => Monoid (Product f g a) Source # | Since: base-4.16.0.0 |
(Monoid (f p), Monoid (g p)) => Monoid ((f :*: g) p) # | |
Monoid c => Monoid (K1 i c p) # | |
(Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d) # | |
Monoid (f (g a)) => Monoid (Compose f g a) Source # | Since: base-4.16.0.0 |
Monoid (f (g p)) => Monoid ((f :.: g) p) # | |
Monoid (f p) => Monoid (M1 i c f p) # | |
(Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) => Monoid (a, b, c, d, e) # | |
Instances
Semigroup ByteArray Source # | Since: base-4.17.0.0 |
Semigroup ByteString # | |
Semigroup ByteString # | |
Semigroup ShortByteString # | |
Semigroup IntSet # | |
Semigroup Unit # | |
Semigroup Void # | |
Semigroup Ordering # | |
Semigroup OsString # | |
Semigroup PosixString # | |
Defined in System.OsString.Internal.Types (<>) :: PosixString -> PosixString -> PosixString # sconcat :: NonEmpty PosixString -> PosixString # stimes :: Integral b => b -> PosixString -> PosixString # | |
Semigroup WindowsString # | |
Defined in System.OsString.Internal.Types (<>) :: WindowsString -> WindowsString -> WindowsString # sconcat :: NonEmpty WindowsString -> WindowsString # stimes :: Integral b => b -> WindowsString -> WindowsString # | |
Semigroup Doc # | |
Semigroup Builder Source # | |
Semigroup StrictTextBuilder Source # | Concatenation of |
Defined in Data.Text.Internal.StrictBuilder (<>) :: StrictTextBuilder -> StrictTextBuilder -> StrictTextBuilder # sconcat :: NonEmpty StrictTextBuilder -> StrictTextBuilder # stimes :: Integral b => b -> StrictTextBuilder -> StrictTextBuilder # | |
Semigroup CalendarDiffDays # | |
Semigroup CalendarDiffTime # | |
Semigroup () # | |
Semigroup (FromMaybe b) Source # | |
Semigroup a => Semigroup (JoinWith a) Source # | |
Semigroup (NonEmptyDList a) Source # | |
Semigroup (Comparison a) Source # |
(<>) :: Comparison a -> Comparison a -> Comparison a Comparison cmp <> Comparison cmp' = Comparison a a' -> cmp a a' <> cmp a a' |
Defined in Data.Functor.Contravariant (<>) :: Comparison a -> Comparison a -> Comparison a # sconcat :: NonEmpty (Comparison a) -> Comparison a # stimes :: Integral b => b -> Comparison a -> Comparison a # | |
Semigroup (Equivalence a) Source # |
(<>) :: Equivalence a -> Equivalence a -> Equivalence a Equivalence equiv <> Equivalence equiv' = Equivalence a b -> equiv a b && equiv' a b |
Defined in Data.Functor.Contravariant (<>) :: Equivalence a -> Equivalence a -> Equivalence a # sconcat :: NonEmpty (Equivalence a) -> Equivalence a # stimes :: Integral b => b -> Equivalence a -> Equivalence a # | |
Semigroup (Predicate a) Source # |
(<>) :: Predicate a -> Predicate a -> Predicate a Predicate pred <> Predicate pred' = Predicate a -> pred a && pred' a |
Semigroup (First a) Source # | Since: base-4.9.0.0 |
Semigroup (Last a) Source # | Since: base-4.9.0.0 |
Ord a => Semigroup (Max a) Source # | Since: base-4.9.0.0 |
Ord a => Semigroup (Min a) Source # | Since: base-4.9.0.0 |
Monoid m => Semigroup (WrappedMonoid m) Source # | Since: base-4.9.0.0 |
Defined in Data.Semigroup (<>) :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # sconcat :: NonEmpty (WrappedMonoid m) -> WrappedMonoid m # stimes :: Integral b => b -> WrappedMonoid m -> WrappedMonoid m # | |
Semigroup (IntMap a) # | |
Semigroup (Seq a) # | |
Ord a => Semigroup (Intersection a) # | |
Semigroup (MergeSet a) # | |
Ord a => Semigroup (Set a) # | |
Semigroup (NonEmpty a) # | |
(Generic a, Semigroup (Rep a ())) => Semigroup (Generically a) # | |
Defined in GHC.Internal.Generics (<>) :: Generically a -> Generically a -> Generically a # sconcat :: NonEmpty (Generically a) -> Generically a # stimes :: Integral b => b -> Generically a -> Generically a # | |
Semigroup p => Semigroup (Par1 p) # | |
Semigroup a => Semigroup (Q a) # | |
Semigroup a => Semigroup (IO a) # | |
Semigroup (Doc a) # | |
Semigroup a => Semigroup (Maybe a) # | |
Semigroup a => Semigroup (Solo a) # | |
Semigroup [a] # | |
Semigroup a => Semigroup (Op a b) Source # |
(<>) :: Op a b -> Op a b -> Op a b Op f <> Op g = Op a -> f a <> g a |
Ord k => Semigroup (Map k v) # | |
Semigroup (Either a b) # | |
Semigroup (U1 p) # | |
Semigroup (V1 p) # | |
(Semigroup a, Semigroup b) => Semigroup (a, b) # | |
Semigroup b => Semigroup (a -> b) # | |
Semigroup (f p) => Semigroup (Rec1 f p) # | |
Semigroup a => Semigroup (Constant a b) Source # | |
(Semigroup a, Semigroup b, Semigroup c) => Semigroup (a, b, c) # | |
(Semigroup (f a), Semigroup (g a)) => Semigroup (Product f g a) Source # | Since: base-4.16.0.0 |
(Semigroup (f p), Semigroup (g p)) => Semigroup ((f :*: g) p) # | |
Semigroup c => Semigroup (K1 i c p) # | |
(Semigroup a, Semigroup b, Semigroup c, Semigroup d) => Semigroup (a, b, c, d) # | |
Semigroup (f (g a)) => Semigroup (Compose f g a) Source # | Since: base-4.16.0.0 |
Semigroup (f (g p)) => Semigroup ((f :.: g) p) # | |
Semigroup (f p) => Semigroup (M1 i c f p) # | |
(Semigroup a, Semigroup b, Semigroup c, Semigroup d, Semigroup e) => Semigroup (a, b, c, d, e) # | |
class Monad m => MonadFail (m :: Type -> Type) where #
Instances
Instances
class Foldable (t :: Type -> Type) where #
foldMap :: Monoid m => (a -> m) -> t a -> m #
foldr :: (a -> b -> b) -> b -> t a -> b #
foldl :: (b -> a -> b) -> b -> t a -> b #
foldl' :: (b -> a -> b) -> b -> t a -> b #
foldr1 :: (a -> a -> a) -> t a -> a #
foldl1 :: (a -> a -> a) -> t a -> a #
elem :: Eq a => a -> t a -> Bool #
maximum :: Ord a => t a -> a #
Instances
Foldable Complex Source # | Since: base-4.9.0.0 |
Defined in Data.Complex fold :: Monoid m => Complex m -> m # foldMap :: Monoid m => (a -> m) -> Complex a -> m # foldMap' :: Monoid m => (a -> m) -> Complex a -> m # foldr :: (a -> b -> b) -> b -> Complex a -> b # foldr' :: (a -> b -> b) -> b -> Complex a -> b # foldl :: (b -> a -> b) -> b -> Complex a -> b # foldl' :: (b -> a -> b) -> b -> Complex a -> b # foldr1 :: (a -> a -> a) -> Complex a -> a # foldl1 :: (a -> a -> a) -> Complex a -> a # elem :: Eq a => a -> Complex a -> Bool # maximum :: Ord a => Complex a -> a # minimum :: Ord a => Complex a -> a # | |
Foldable First Source # | Since: base-4.9.0.0 |
Defined in Data.Semigroup fold :: Monoid m => First m -> m # foldMap :: Monoid m => (a -> m) -> First a -> m # foldMap' :: Monoid m => (a -> m) -> First a -> m # foldr :: (a -> b -> b) -> b -> First a -> b # foldr' :: (a -> b -> b) -> b -> First a -> b # foldl :: (b -> a -> b) -> b -> First a -> b # foldl' :: (b -> a -> b) -> b -> First a -> b # foldr1 :: (a -> a -> a) -> First a -> a # foldl1 :: (a -> a -> a) -> First a -> a # elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # minimum :: Ord a => First a -> a # | |
Foldable Last Source # | Since: base-4.9.0.0 |
Defined in Data.Semigroup fold :: Monoid m => Last m -> m # foldMap :: Monoid m => (a -> m) -> Last a -> m # foldMap' :: Monoid m => (a -> m) -> Last a -> m # foldr :: (a -> b -> b) -> b -> Last a -> b # foldr' :: (a -> b -> b) -> b -> Last a -> b # foldl :: (b -> a -> b) -> b -> Last a -> b # foldl' :: (b -> a -> b) -> b -> Last a -> b # foldr1 :: (a -> a -> a) -> Last a -> a # foldl1 :: (a -> a -> a) -> Last a -> a # elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # | |
Foldable Max Source # | Since: base-4.9.0.0 |
Defined in Data.Semigroup fold :: Monoid m => Max m -> m # foldMap :: Monoid m => (a -> m) -> Max a -> m # foldMap' :: Monoid m => (a -> m) -> Max a -> m # foldr :: (a -> b -> b) -> b -> Max a -> b # foldr' :: (a -> b -> b) -> b -> Max a -> b # foldl :: (b -> a -> b) -> b -> Max a -> b # foldl' :: (b -> a -> b) -> b -> Max a -> b # foldr1 :: (a -> a -> a) -> Max a -> a # foldl1 :: (a -> a -> a) -> Max a -> a # elem :: Eq a => a -> Max a -> Bool # maximum :: Ord a => Max a -> a # | |
Foldable Min Source # | Since: base-4.9.0.0 |
Defined in Data.Semigroup fold :: Monoid m => Min m -> m # foldMap :: Monoid m => (a -> m) -> Min a -> m # foldMap' :: Monoid m => (a -> m) -> Min a -> m # foldr :: (a -> b -> b) -> b -> Min a -> b # foldr' :: (a -> b -> b) -> b -> Min a -> b # foldl :: (b -> a -> b) -> b -> Min a -> b # foldl' :: (b -> a -> b) -> b -> Min a -> b # foldr1 :: (a -> a -> a) -> Min a -> a # foldl1 :: (a -> a -> a) -> Min a -> a # elem :: Eq a => a -> Min a -> Bool # maximum :: Ord a => Min a -> a # | |
Foldable IntMap # | |
Defined in Data.IntMap.Internal fold :: Monoid m => IntMap m -> m # foldMap :: Monoid m => (a -> m) -> IntMap a -> m # foldMap' :: Monoid m => (a -> m) -> IntMap a -> m # foldr :: (a -> b -> b) -> b -> IntMap a -> b # foldr' :: (a -> b -> b) -> b -> IntMap a -> b # foldl :: (b -> a -> b) -> b -> IntMap a -> b # foldl' :: (b -> a -> b) -> b -> IntMap a -> b # foldr1 :: (a -> a -> a) -> IntMap a -> a # foldl1 :: (a -> a -> a) -> IntMap a -> a # elem :: Eq a => a -> IntMap a -> Bool # maximum :: Ord a => IntMap a -> a # minimum :: Ord a => IntMap a -> a # | |
Foldable Digit # | |
Defined in Data.Sequence.Internal fold :: Monoid m => Digit m -> m # foldMap :: Monoid m => (a -> m) -> Digit a -> m # foldMap' :: Monoid m => (a -> m) -> Digit a -> m # foldr :: (a -> b -> b) -> b -> Digit a -> b # foldr' :: (a -> b -> b) -> b -> Digit a -> b # foldl :: (b -> a -> b) -> b -> Digit a -> b # foldl' :: (b -> a -> b) -> b -> Digit a -> b # foldr1 :: (a -> a -> a) -> Digit a -> a # foldl1 :: (a -> a -> a) -> Digit a -> a # elem :: Eq a => a -> Digit a -> Bool # maximum :: Ord a => Digit a -> a # minimum :: Ord a => Digit a -> a # | |
Foldable Elem # | |
Defined in Data.Sequence.Internal fold :: Monoid m => Elem m -> m # foldMap :: Monoid m => (a -> m) -> Elem a -> m # foldMap' :: Monoid m => (a -> m) -> Elem a -> m # foldr :: (a -> b -> b) -> b -> Elem a -> b # foldr' :: (a -> b -> b) -> b -> Elem a -> b # foldl :: (b -> a -> b) -> b -> Elem a -> b # foldl' :: (b -> a -> b) -> b -> Elem a -> b # foldr1 :: (a -> a -> a) -> Elem a -> a # foldl1 :: (a -> a -> a) -> Elem a -> a # elem :: Eq a => a -> Elem a -> Bool # maximum :: Ord a => Elem a -> a # | |
Foldable FingerTree # | |
Defined in Data.Sequence.Internal fold :: Monoid m => FingerTree m -> m # foldMap :: Monoid m => (a -> m) -> FingerTree a -> m # foldMap' :: Monoid m => (a -> m) -> FingerTree a -> m # foldr :: (a -> b -> b) -> b -> FingerTree a -> b # foldr' :: (a -> b -> b) -> b -> FingerTree a -> b # foldl :: (b -> a -> b) -> b -> FingerTree a -> b # foldl' :: (b -> a -> b) -> b -> FingerTree a -> b # foldr1 :: (a -> a -> a) -> FingerTree a -> a # foldl1 :: (a -> a -> a) -> FingerTree a -> a # toList :: FingerTree a -> [a] # null :: FingerTree a -> Bool # length :: FingerTree a -> Int # elem :: Eq a => a -> FingerTree a -> Bool # maximum :: Ord a => FingerTree a -> a # minimum :: Ord a => FingerTree a -> a # | |
Foldable Node # | |
Defined in Data.Sequence.Internal fold :: Monoid m => Node m -> m # foldMap :: Monoid m => (a -> m) -> Node a -> m # foldMap' :: Monoid m => (a -> m) -> Node a -> m # foldr :: (a -> b -> b) -> b -> Node a -> b # foldr' :: (a -> b -> b) -> b -> Node a -> b # foldl :: (b -> a -> b) -> b -> Node a -> b # foldl' :: (b -> a -> b) -> b -> Node a -> b # foldr1 :: (a -> a -> a) -> Node a -> a # foldl1 :: (a -> a -> a) -> Node a -> a # elem :: Eq a => a -> Node a -> Bool # maximum :: Ord a => Node a -> a # | |
Foldable Seq # | |
Defined in Data.Sequence.Internal fold :: Monoid m => Seq m -> m # foldMap :: Monoid m => (a -> m) -> Seq a -> m # foldMap' :: Monoid m => (a -> m) -> Seq a -> m # foldr :: (a -> b -> b) -> b -> Seq a -> b # foldr' :: (a -> b -> b) -> b -> Seq a -> b # foldl :: (b -> a -> b) -> b -> Seq a -> b # foldl' :: (b -> a -> b) -> b -> Seq a -> b # foldr1 :: (a -> a -> a) -> Seq a -> a # foldl1 :: (a -> a -> a) -> Seq a -> a # elem :: Eq a => a -> Seq a -> Bool # maximum :: Ord a => Seq a -> a # | |
Foldable ViewL # | |
Defined in Data.Sequence.Internal fold :: Monoid m => ViewL m -> m # foldMap :: Monoid m => (a -> m) -> ViewL a -> m # foldMap' :: Monoid m => (a -> m) -> ViewL a -> m # foldr :: (a -> b -> b) -> b -> ViewL a -> b # foldr' :: (a -> b -> b) -> b -> ViewL a -> b # foldl :: (b -> a -> b) -> b -> ViewL a -> b # foldl' :: (b -> a -> b) -> b -> ViewL a -> b # foldr1 :: (a -> a -> a) -> ViewL a -> a # foldl1 :: (a -> a -> a) -> ViewL a -> a # elem :: Eq a => a -> ViewL a -> Bool # maximum :: Ord a => ViewL a -> a # minimum :: Ord a => ViewL a -> a # | |
Foldable ViewR # | |
Defined in Data.Sequence.Internal fold :: Monoid m => ViewR m -> m # foldMap :: Monoid m => (a -> m) -> ViewR a -> m # foldMap' :: Monoid m => (a -> m) -> ViewR a -> m # foldr :: (a -> b -> b) -> b -> ViewR a -> b # foldr' :: (a -> b -> b) -> b -> ViewR a -> b # foldl :: (b -> a -> b) -> b -> ViewR a -> b # foldl' :: (b -> a -> b) -> b -> ViewR a -> b # foldr1 :: (a -> a -> a) -> ViewR a -> a # foldl1 :: (a -> a -> a) -> ViewR a -> a # elem :: Eq a => a -> ViewR a -> Bool # maximum :: Ord a => ViewR a -> a # minimum :: Ord a => ViewR a -> a # | |
Foldable Set # | |
Defined in Data.Set.Internal fold :: Monoid m => Set m -> m # foldMap :: Monoid m => (a -> m) -> Set a -> m # foldMap' :: Monoid m => (a -> m) -> Set a -> m # foldr :: (a -> b -> b) -> b -> Set a -> b # foldr' :: (a -> b -> b) -> b -> Set a -> b # foldl :: (b -> a -> b) -> b -> Set a -> b # foldl' :: (b -> a -> b) -> b -> Set a -> b # foldr1 :: (a -> a -> a) -> Set a -> a # foldl1 :: (a -> a -> a) -> Set a -> a # elem :: Eq a => a -> Set a -> Bool # maximum :: Ord a => Set a -> a # | |
Foldable Tree # | |
Defined in Data.Tree fold :: Monoid m => Tree m -> m # foldMap :: Monoid m => (a -> m) -> Tree a -> m # foldMap' :: Monoid m => (a -> m) -> Tree a -> m # foldr :: (a -> b -> b) -> b -> Tree a -> b # foldr' :: (a -> b -> b) -> b -> Tree a -> b # foldl :: (b -> a -> b) -> b -> Tree a -> b # foldl' :: (b -> a -> b) -> b -> Tree a -> b # foldr1 :: (a -> a -> a) -> Tree a -> a # foldl1 :: (a -> a -> a) -> Tree a -> a # elem :: Eq a => a -> Tree a -> Bool # maximum :: Ord a => Tree a -> a # | |
Foldable NonEmpty # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => NonEmpty m -> m # foldMap :: Monoid m => (a -> m) -> NonEmpty a -> m # foldMap' :: Monoid m => (a -> m) -> NonEmpty a -> m # foldr :: (a -> b -> b) -> b -> NonEmpty a -> b # foldr' :: (a -> b -> b) -> b -> NonEmpty a -> b # foldl :: (b -> a -> b) -> b -> NonEmpty a -> b # foldl' :: (b -> a -> b) -> b -> NonEmpty a -> b # foldr1 :: (a -> a -> a) -> NonEmpty a -> a # foldl1 :: (a -> a -> a) -> NonEmpty a -> a # elem :: Eq a => a -> NonEmpty a -> Bool # maximum :: Ord a => NonEmpty a -> a # minimum :: Ord a => NonEmpty a -> a # | |
Foldable First # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => First m -> m # foldMap :: Monoid m => (a -> m) -> First a -> m # foldMap' :: Monoid m => (a -> m) -> First a -> m # foldr :: (a -> b -> b) -> b -> First a -> b # foldr' :: (a -> b -> b) -> b -> First a -> b # foldl :: (b -> a -> b) -> b -> First a -> b # foldl' :: (b -> a -> b) -> b -> First a -> b # foldr1 :: (a -> a -> a) -> First a -> a # foldl1 :: (a -> a -> a) -> First a -> a # elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # minimum :: Ord a => First a -> a # | |
Foldable Last # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => Last m -> m # foldMap :: Monoid m => (a -> m) -> Last a -> m # foldMap' :: Monoid m => (a -> m) -> Last a -> m # foldr :: (a -> b -> b) -> b -> Last a -> b # foldr' :: (a -> b -> b) -> b -> Last a -> b # foldl :: (b -> a -> b) -> b -> Last a -> b # foldl' :: (b -> a -> b) -> b -> Last a -> b # foldr1 :: (a -> a -> a) -> Last a -> a # foldl1 :: (a -> a -> a) -> Last a -> a # elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # | |
Foldable Down # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => Down m -> m # foldMap :: Monoid m => (a -> m) -> Down a -> m # foldMap' :: Monoid m => (a -> m) -> Down a -> m # foldr :: (a -> b -> b) -> b -> Down a -> b # foldr' :: (a -> b -> b) -> b -> Down a -> b # foldl :: (b -> a -> b) -> b -> Down a -> b # foldl' :: (b -> a -> b) -> b -> Down a -> b # foldr1 :: (a -> a -> a) -> Down a -> a # foldl1 :: (a -> a -> a) -> Down a -> a # elem :: Eq a => a -> Down a -> Bool # maximum :: Ord a => Down a -> a # | |
Foldable Dual # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => Dual m -> m # foldMap :: Monoid m => (a -> m) -> Dual a -> m # foldMap' :: Monoid m => (a -> m) -> Dual a -> m # foldr :: (a -> b -> b) -> b -> Dual a -> b # foldr' :: (a -> b -> b) -> b -> Dual a -> b # foldl :: (b -> a -> b) -> b -> Dual a -> b # foldl' :: (b -> a -> b) -> b -> Dual a -> b # foldr1 :: (a -> a -> a) -> Dual a -> a # foldl1 :: (a -> a -> a) -> Dual a -> a # elem :: Eq a => a -> Dual a -> Bool # maximum :: Ord a => Dual a -> a # | |
Foldable Product # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => Product m -> m # foldMap :: Monoid m => (a -> m) -> Product a -> m # foldMap' :: Monoid m => (a -> m) -> Product a -> m # foldr :: (a -> b -> b) -> b -> Product a -> b # foldr' :: (a -> b -> b) -> b -> Product a -> b # foldl :: (b -> a -> b) -> b -> Product a -> b # foldl' :: (b -> a -> b) -> b -> Product a -> b # foldr1 :: (a -> a -> a) -> Product a -> a # foldl1 :: (a -> a -> a) -> Product a -> a # elem :: Eq a => a -> Product a -> Bool # maximum :: Ord a => Product a -> a # minimum :: Ord a => Product a -> a # | |
Foldable Sum # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => Sum m -> m # foldMap :: Monoid m => (a -> m) -> Sum a -> m # foldMap' :: Monoid m => (a -> m) -> Sum a -> m # foldr :: (a -> b -> b) -> b -> Sum a -> b # foldr' :: (a -> b -> b) -> b -> Sum a -> b # foldl :: (b -> a -> b) -> b -> Sum a -> b # foldl' :: (b -> a -> b) -> b -> Sum a -> b # foldr1 :: (a -> a -> a) -> Sum a -> a # foldl1 :: (a -> a -> a) -> Sum a -> a # elem :: Eq a => a -> Sum a -> Bool # maximum :: Ord a => Sum a -> a # | |
Foldable Par1 # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => Par1 m -> m # foldMap :: Monoid m => (a -> m) -> Par1 a -> m # foldMap' :: Monoid m => (a -> m) -> Par1 a -> m # foldr :: (a -> b -> b) -> b -> Par1 a -> b # foldr' :: (a -> b -> b) -> b -> Par1 a -> b # foldl :: (b -> a -> b) -> b -> Par1 a -> b # foldl' :: (b -> a -> b) -> b -> Par1 a -> b # foldr1 :: (a -> a -> a) -> Par1 a -> a # foldl1 :: (a -> a -> a) -> Par1 a -> a # elem :: Eq a => a -> Par1 a -> Bool # maximum :: Ord a => Par1 a -> a # | |
Foldable TyVarBndr # | |
Defined in GHC.Internal.TH.Syntax fold :: Monoid m => TyVarBndr m -> m # foldMap :: Monoid m => (a -> m) -> TyVarBndr a -> m # foldMap' :: Monoid m => (a -> m) -> TyVarBndr a -> m # foldr :: (a -> b -> b) -> b -> TyVarBndr a -> b # foldr' :: (a -> b -> b) -> b -> TyVarBndr a -> b # foldl :: (b -> a -> b) -> b -> TyVarBndr a -> b # foldl' :: (b -> a -> b) -> b -> TyVarBndr a -> b # foldr1 :: (a -> a -> a) -> TyVarBndr a -> a # foldl1 :: (a -> a -> a) -> TyVarBndr a -> a # toList :: TyVarBndr a -> [a] # length :: TyVarBndr a -> Int # elem :: Eq a => a -> TyVarBndr a -> Bool # maximum :: Ord a => TyVarBndr a -> a # minimum :: Ord a => TyVarBndr a -> a # | |
Foldable Maybe # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldMap' :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # | |
Foldable Solo # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => Solo m -> m # foldMap :: Monoid m => (a -> m) -> Solo a -> m # foldMap' :: Monoid m => (a -> m) -> Solo a -> m # foldr :: (a -> b -> b) -> b -> Solo a -> b # foldr' :: (a -> b -> b) -> b -> Solo a -> b # foldl :: (b -> a -> b) -> b -> Solo a -> b # foldl' :: (b -> a -> b) -> b -> Solo a -> b # foldr1 :: (a -> a -> a) -> Solo a -> a # foldl1 :: (a -> a -> a) -> Solo a -> a # elem :: Eq a => a -> Solo a -> Bool # maximum :: Ord a => Solo a -> a # | |
Foldable [] # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => [m] -> m # foldMap :: Monoid m => (a -> m) -> [a] -> m # foldMap' :: Monoid m => (a -> m) -> [a] -> m # foldr :: (a -> b -> b) -> b -> [a] -> b # foldr' :: (a -> b -> b) -> b -> [a] -> b # foldl :: (b -> a -> b) -> b -> [a] -> b # foldl' :: (b -> a -> b) -> b -> [a] -> b # foldr1 :: (a -> a -> a) -> [a] -> a # foldl1 :: (a -> a -> a) -> [a] -> a # elem :: Eq a => a -> [a] -> Bool # maximum :: Ord a => [a] -> a # | |
Foldable (Arg a) Source # | Since: base-4.9.0.0 |
Defined in Data.Semigroup fold :: Monoid m => Arg a m -> m # foldMap :: Monoid m => (a0 -> m) -> Arg a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Arg a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Arg a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Arg a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Arg a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Arg a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 # elem :: Eq a0 => a0 -> Arg a a0 -> Bool # maximum :: Ord a0 => Arg a a0 -> a0 # minimum :: Ord a0 => Arg a a0 -> a0 # | |
Foldable (Map k) # | |
Defined in Data.Map.Internal fold :: Monoid m => Map k m -> m # foldMap :: Monoid m => (a -> m) -> Map k a -> m # foldMap' :: Monoid m => (a -> m) -> Map k a -> m # foldr :: (a -> b -> b) -> b -> Map k a -> b # foldr' :: (a -> b -> b) -> b -> Map k a -> b # foldl :: (b -> a -> b) -> b -> Map k a -> b # foldl' :: (b -> a -> b) -> b -> Map k a -> b # foldr1 :: (a -> a -> a) -> Map k a -> a # foldl1 :: (a -> a -> a) -> Map k a -> a # elem :: Eq a => a -> Map k a -> Bool # maximum :: Ord a => Map k a -> a # minimum :: Ord a => Map k a -> a # | |
Foldable (Array i) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => Array i m -> m # foldMap :: Monoid m => (a -> m) -> Array i a -> m # foldMap' :: Monoid m => (a -> m) -> Array i a -> m # foldr :: (a -> b -> b) -> b -> Array i a -> b # foldr' :: (a -> b -> b) -> b -> Array i a -> b # foldl :: (b -> a -> b) -> b -> Array i a -> b # foldl' :: (b -> a -> b) -> b -> Array i a -> b # foldr1 :: (a -> a -> a) -> Array i a -> a # foldl1 :: (a -> a -> a) -> Array i a -> a # elem :: Eq a => a -> Array i a -> Bool # maximum :: Ord a => Array i a -> a # minimum :: Ord a => Array i a -> a # | |
Foldable (Either a) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => Either a m -> m # foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # toList :: Either a a0 -> [a0] # length :: Either a a0 -> Int # elem :: Eq a0 => a0 -> Either a a0 -> Bool # maximum :: Ord a0 => Either a a0 -> a0 # minimum :: Ord a0 => Either a a0 -> a0 # | |
Foldable (Proxy :: Type -> Type) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => Proxy m -> m # foldMap :: Monoid m => (a -> m) -> Proxy a -> m # foldMap' :: Monoid m => (a -> m) -> Proxy a -> m # foldr :: (a -> b -> b) -> b -> Proxy a -> b # foldr' :: (a -> b -> b) -> b -> Proxy a -> b # foldl :: (b -> a -> b) -> b -> Proxy a -> b # foldl' :: (b -> a -> b) -> b -> Proxy a -> b # foldr1 :: (a -> a -> a) -> Proxy a -> a # foldl1 :: (a -> a -> a) -> Proxy a -> a # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # | |
Foldable (U1 :: Type -> Type) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => U1 m -> m # foldMap :: Monoid m => (a -> m) -> U1 a -> m # foldMap' :: Monoid m => (a -> m) -> U1 a -> m # foldr :: (a -> b -> b) -> b -> U1 a -> b # foldr' :: (a -> b -> b) -> b -> U1 a -> b # foldl :: (b -> a -> b) -> b -> U1 a -> b # foldl' :: (b -> a -> b) -> b -> U1 a -> b # foldr1 :: (a -> a -> a) -> U1 a -> a # foldl1 :: (a -> a -> a) -> U1 a -> a # elem :: Eq a => a -> U1 a -> Bool # maximum :: Ord a => U1 a -> a # | |
Foldable (UAddr :: Type -> Type) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => UAddr m -> m # foldMap :: Monoid m => (a -> m) -> UAddr a -> m # foldMap' :: Monoid m => (a -> m) -> UAddr a -> m # foldr :: (a -> b -> b) -> b -> UAddr a -> b # foldr' :: (a -> b -> b) -> b -> UAddr a -> b # foldl :: (b -> a -> b) -> b -> UAddr a -> b # foldl' :: (b -> a -> b) -> b -> UAddr a -> b # foldr1 :: (a -> a -> a) -> UAddr a -> a # foldl1 :: (a -> a -> a) -> UAddr a -> a # elem :: Eq a => a -> UAddr a -> Bool # maximum :: Ord a => UAddr a -> a # minimum :: Ord a => UAddr a -> a # | |
Foldable (UChar :: Type -> Type) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => UChar m -> m # foldMap :: Monoid m => (a -> m) -> UChar a -> m # foldMap' :: Monoid m => (a -> m) -> UChar a -> m # foldr :: (a -> b -> b) -> b -> UChar a -> b # foldr' :: (a -> b -> b) -> b -> UChar a -> b # foldl :: (b -> a -> b) -> b -> UChar a -> b # foldl' :: (b -> a -> b) -> b -> UChar a -> b # foldr1 :: (a -> a -> a) -> UChar a -> a # foldl1 :: (a -> a -> a) -> UChar a -> a # elem :: Eq a => a -> UChar a -> Bool # maximum :: Ord a => UChar a -> a # minimum :: Ord a => UChar a -> a # | |
Foldable (UDouble :: Type -> Type) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => UDouble m -> m # foldMap :: Monoid m => (a -> m) -> UDouble a -> m # foldMap' :: Monoid m => (a -> m) -> UDouble a -> m # foldr :: (a -> b -> b) -> b -> UDouble a -> b # foldr' :: (a -> b -> b) -> b -> UDouble a -> b # foldl :: (b -> a -> b) -> b -> UDouble a -> b # foldl' :: (b -> a -> b) -> b -> UDouble a -> b # foldr1 :: (a -> a -> a) -> UDouble a -> a # foldl1 :: (a -> a -> a) -> UDouble a -> a # elem :: Eq a => a -> UDouble a -> Bool # maximum :: Ord a => UDouble a -> a # minimum :: Ord a => UDouble a -> a # | |
Foldable (UFloat :: Type -> Type) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => UFloat m -> m # foldMap :: Monoid m => (a -> m) -> UFloat a -> m # foldMap' :: Monoid m => (a -> m) -> UFloat a -> m # foldr :: (a -> b -> b) -> b -> UFloat a -> b # foldr' :: (a -> b -> b) -> b -> UFloat a -> b # foldl :: (b -> a -> b) -> b -> UFloat a -> b # foldl' :: (b -> a -> b) -> b -> UFloat a -> b # foldr1 :: (a -> a -> a) -> UFloat a -> a # foldl1 :: (a -> a -> a) -> UFloat a -> a # elem :: Eq a => a -> UFloat a -> Bool # maximum :: Ord a => UFloat a -> a # minimum :: Ord a => UFloat a -> a # | |
Foldable (UInt :: Type -> Type) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => UInt m -> m # foldMap :: Monoid m => (a -> m) -> UInt a -> m # foldMap' :: Monoid m => (a -> m) -> UInt a -> m # foldr :: (a -> b -> b) -> b -> UInt a -> b # foldr' :: (a -> b -> b) -> b -> UInt a -> b # foldl :: (b -> a -> b) -> b -> UInt a -> b # foldl' :: (b -> a -> b) -> b -> UInt a -> b # foldr1 :: (a -> a -> a) -> UInt a -> a # foldl1 :: (a -> a -> a) -> UInt a -> a # elem :: Eq a => a -> UInt a -> Bool # maximum :: Ord a => UInt a -> a # | |
Foldable (UWord :: Type -> Type) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => UWord m -> m # foldMap :: Monoid m => (a -> m) -> UWord a -> m # foldMap' :: Monoid m => (a -> m) -> UWord a -> m # foldr :: (a -> b -> b) -> b -> UWord a -> b # foldr' :: (a -> b -> b) -> b -> UWord a -> b # foldl :: (b -> a -> b) -> b -> UWord a -> b # foldl' :: (b -> a -> b) -> b -> UWord a -> b # foldr1 :: (a -> a -> a) -> UWord a -> a # foldl1 :: (a -> a -> a) -> UWord a -> a # elem :: Eq a => a -> UWord a -> Bool # maximum :: Ord a => UWord a -> a # minimum :: Ord a => UWord a -> a # | |
Foldable (V1 :: Type -> Type) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => V1 m -> m # foldMap :: Monoid m => (a -> m) -> V1 a -> m # foldMap' :: Monoid m => (a -> m) -> V1 a -> m # foldr :: (a -> b -> b) -> b -> V1 a -> b # foldr' :: (a -> b -> b) -> b -> V1 a -> b # foldl :: (b -> a -> b) -> b -> V1 a -> b # foldl' :: (b -> a -> b) -> b -> V1 a -> b # foldr1 :: (a -> a -> a) -> V1 a -> a # foldl1 :: (a -> a -> a) -> V1 a -> a # elem :: Eq a => a -> V1 a -> Bool # maximum :: Ord a => V1 a -> a # | |
Foldable f => Foldable (Lift f) Source # | |
Defined in Control.Applicative.Lift fold :: Monoid m => Lift f m -> m # foldMap :: Monoid m => (a -> m) -> Lift f a -> m # foldMap' :: Monoid m => (a -> m) -> Lift f a -> m # foldr :: (a -> b -> b) -> b -> Lift f a -> b # foldr' :: (a -> b -> b) -> b -> Lift f a -> b # foldl :: (b -> a -> b) -> b -> Lift f a -> b # foldl' :: (b -> a -> b) -> b -> Lift f a -> b # foldr1 :: (a -> a -> a) -> Lift f a -> a # foldl1 :: (a -> a -> a) -> Lift f a -> a # elem :: Eq a => a -> Lift f a -> Bool # maximum :: Ord a => Lift f a -> a # minimum :: Ord a => Lift f a -> a # | |
Foldable f => Foldable (MaybeT f) Source # | |
Defined in Control.Monad.Trans.Maybe fold :: Monoid m => MaybeT f m -> m # foldMap :: Monoid m => (a -> m) -> MaybeT f a -> m # foldMap' :: Monoid m => (a -> m) -> MaybeT f a -> m # foldr :: (a -> b -> b) -> b -> MaybeT f a -> b # foldr' :: (a -> b -> b) -> b -> MaybeT f a -> b # foldl :: (b -> a -> b) -> b -> MaybeT f a -> b # foldl' :: (b -> a -> b) -> b -> MaybeT f a -> b # foldr1 :: (a -> a -> a) -> MaybeT f a -> a # foldl1 :: (a -> a -> a) -> MaybeT f a -> a # elem :: Eq a => a -> MaybeT f a -> Bool # maximum :: Ord a => MaybeT f a -> a # minimum :: Ord a => MaybeT f a -> a # | |
Foldable ((,) a) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => (a, m) -> m # foldMap :: Monoid m => (a0 -> m) -> (a, a0) -> m # foldMap' :: Monoid m => (a0 -> m) -> (a, a0) -> m # foldr :: (a0 -> b -> b) -> b -> (a, a0) -> b # foldr' :: (a0 -> b -> b) -> b -> (a, a0) -> b # foldl :: (b -> a0 -> b) -> b -> (a, a0) -> b # foldl' :: (b -> a0 -> b) -> b -> (a, a0) -> b # foldr1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 # foldl1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 # elem :: Eq a0 => a0 -> (a, a0) -> Bool # maximum :: Ord a0 => (a, a0) -> a0 # minimum :: Ord a0 => (a, a0) -> a0 # | |
Foldable f => Foldable (Ap f) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => Ap f m -> m # foldMap :: Monoid m => (a -> m) -> Ap f a -> m # foldMap' :: Monoid m => (a -> m) -> Ap f a -> m # foldr :: (a -> b -> b) -> b -> Ap f a -> b # foldr' :: (a -> b -> b) -> b -> Ap f a -> b # foldl :: (b -> a -> b) -> b -> Ap f a -> b # foldl' :: (b -> a -> b) -> b -> Ap f a -> b # foldr1 :: (a -> a -> a) -> Ap f a -> a # foldl1 :: (a -> a -> a) -> Ap f a -> a # elem :: Eq a => a -> Ap f a -> Bool # maximum :: Ord a => Ap f a -> a # | |
Foldable f => Foldable (Alt f) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => Alt f m -> m # foldMap :: Monoid m => (a -> m) -> Alt f a -> m # foldMap' :: Monoid m => (a -> m) -> Alt f a -> m # foldr :: (a -> b -> b) -> b -> Alt f a -> b # foldr' :: (a -> b -> b) -> b -> Alt f a -> b # foldl :: (b -> a -> b) -> b -> Alt f a -> b # foldl' :: (b -> a -> b) -> b -> Alt f a -> b # foldr1 :: (a -> a -> a) -> Alt f a -> a # foldl1 :: (a -> a -> a) -> Alt f a -> a # elem :: Eq a => a -> Alt f a -> Bool # maximum :: Ord a => Alt f a -> a # minimum :: Ord a => Alt f a -> a # | |
Foldable f => Foldable (Rec1 f) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => Rec1 f m -> m # foldMap :: Monoid m => (a -> m) -> Rec1 f a -> m # foldMap' :: Monoid m => (a -> m) -> Rec1 f a -> m # foldr :: (a -> b -> b) -> b -> Rec1 f a -> b # foldr' :: (a -> b -> b) -> b -> Rec1 f a -> b # foldl :: (b -> a -> b) -> b -> Rec1 f a -> b # foldl' :: (b -> a -> b) -> b -> Rec1 f a -> b # foldr1 :: (a -> a -> a) -> Rec1 f a -> a # foldl1 :: (a -> a -> a) -> Rec1 f a -> a # elem :: Eq a => a -> Rec1 f a -> Bool # maximum :: Ord a => Rec1 f a -> a # minimum :: Ord a => Rec1 f a -> a # | |
Foldable f => Foldable (Backwards f) Source # | Derived instance. |
Defined in Control.Applicative.Backwards fold :: Monoid m => Backwards f m -> m # foldMap :: Monoid m => (a -> m) -> Backwards f a -> m # foldMap' :: Monoid m => (a -> m) -> Backwards f a -> m # foldr :: (a -> b -> b) -> b -> Backwards f a -> b # foldr' :: (a -> b -> b) -> b -> Backwards f a -> b # foldl :: (b -> a -> b) -> b -> Backwards f a -> b # foldl' :: (b -> a -> b) -> b -> Backwards f a -> b # foldr1 :: (a -> a -> a) -> Backwards f a -> a # foldl1 :: (a -> a -> a) -> Backwards f a -> a # toList :: Backwards f a -> [a] # null :: Backwards f a -> Bool # length :: Backwards f a -> Int # elem :: Eq a => a -> Backwards f a -> Bool # maximum :: Ord a => Backwards f a -> a # minimum :: Ord a => Backwards f a -> a # | |
Foldable f => Foldable (ExceptT e f) Source # | |
Defined in Control.Monad.Trans.Except fold :: Monoid m => ExceptT e f m -> m # foldMap :: Monoid m => (a -> m) -> ExceptT e f a -> m # foldMap' :: Monoid m => (a -> m) -> ExceptT e f a -> m # foldr :: (a -> b -> b) -> b -> ExceptT e f a -> b # foldr' :: (a -> b -> b) -> b -> ExceptT e f a -> b # foldl :: (b -> a -> b) -> b -> ExceptT e f a -> b # foldl' :: (b -> a -> b) -> b -> ExceptT e f a -> b # foldr1 :: (a -> a -> a) -> ExceptT e f a -> a # foldl1 :: (a -> a -> a) -> ExceptT e f a -> a # toList :: ExceptT e f a -> [a] # null :: ExceptT e f a -> Bool # length :: ExceptT e f a -> Int # elem :: Eq a => a -> ExceptT e f a -> Bool # maximum :: Ord a => ExceptT e f a -> a # minimum :: Ord a => ExceptT e f a -> a # | |
Foldable f => Foldable (IdentityT f) Source # | |
Defined in Control.Monad.Trans.Identity fold :: Monoid m => IdentityT f m -> m # foldMap :: Monoid m => (a -> m) -> IdentityT f a -> m # foldMap' :: Monoid m => (a -> m) -> IdentityT f a -> m # foldr :: (a -> b -> b) -> b -> IdentityT f a -> b # foldr' :: (a -> b -> b) -> b -> IdentityT f a -> b # foldl :: (b -> a -> b) -> b -> IdentityT f a -> b # foldl' :: (b -> a -> b) -> b -> IdentityT f a -> b # foldr1 :: (a -> a -> a) -> IdentityT f a -> a # foldl1 :: (a -> a -> a) -> IdentityT f a -> a # toList :: IdentityT f a -> [a] # null :: IdentityT f a -> Bool # length :: IdentityT f a -> Int # elem :: Eq a => a -> IdentityT f a -> Bool # maximum :: Ord a => IdentityT f a -> a # minimum :: Ord a => IdentityT f a -> a # | |
Foldable f => Foldable (WriterT w f) Source # | |
Defined in Control.Monad.Trans.Writer.Lazy fold :: Monoid m => WriterT w f m -> m # foldMap :: Monoid m => (a -> m) -> WriterT w f a -> m # foldMap' :: Monoid m => (a -> m) -> WriterT w f a -> m # foldr :: (a -> b -> b) -> b -> WriterT w f a -> b # foldr' :: (a -> b -> b) -> b -> WriterT w f a -> b # foldl :: (b -> a -> b) -> b -> WriterT w f a -> b # foldl' :: (b -> a -> b) -> b -> WriterT w f a -> b # foldr1 :: (a -> a -> a) -> WriterT w f a -> a # foldl1 :: (a -> a -> a) -> WriterT w f a -> a # toList :: WriterT w f a -> [a] # null :: WriterT w f a -> Bool # length :: WriterT w f a -> Int # elem :: Eq a => a -> WriterT w f a -> Bool # maximum :: Ord a => WriterT w f a -> a # minimum :: Ord a => WriterT w f a -> a # | |
Foldable f => Foldable (WriterT w f) Source # | |
Defined in Control.Monad.Trans.Writer.Strict fold :: Monoid m => WriterT w f m -> m # foldMap :: Monoid m => (a -> m) -> WriterT w f a -> m # foldMap' :: Monoid m => (a -> m) -> WriterT w f a -> m # foldr :: (a -> b -> b) -> b -> WriterT w f a -> b # foldr' :: (a -> b -> b) -> b -> WriterT w f a -> b # foldl :: (b -> a -> b) -> b -> WriterT w f a -> b # foldl' :: (b -> a -> b) -> b -> WriterT w f a -> b # foldr1 :: (a -> a -> a) -> WriterT w f a -> a # foldl1 :: (a -> a -> a) -> WriterT w f a -> a # toList :: WriterT w f a -> [a] # null :: WriterT w f a -> Bool # length :: WriterT w f a -> Int # elem :: Eq a => a -> WriterT w f a -> Bool # maximum :: Ord a => WriterT w f a -> a # minimum :: Ord a => WriterT w f a -> a # | |
Foldable (Constant a :: Type -> Type) Source # | |
Defined in Data.Functor.Constant fold :: Monoid m => Constant a m -> m # foldMap :: Monoid m => (a0 -> m) -> Constant a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Constant a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Constant a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Constant a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Constant a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Constant a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Constant a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Constant a a0 -> a0 # toList :: Constant a a0 -> [a0] # null :: Constant a a0 -> Bool # length :: Constant a a0 -> Int # elem :: Eq a0 => a0 -> Constant a a0 -> Bool # maximum :: Ord a0 => Constant a a0 -> a0 # minimum :: Ord a0 => Constant a a0 -> a0 # | |
Foldable f => Foldable (Reverse f) Source # | Fold from right to left. |
Defined in Data.Functor.Reverse fold :: Monoid m => Reverse f m -> m # foldMap :: Monoid m => (a -> m) -> Reverse f a -> m # foldMap' :: Monoid m => (a -> m) -> Reverse f a -> m # foldr :: (a -> b -> b) -> b -> Reverse f a -> b # foldr' :: (a -> b -> b) -> b -> Reverse f a -> b # foldl :: (b -> a -> b) -> b -> Reverse f a -> b # foldl' :: (b -> a -> b) -> b -> Reverse f a -> b # foldr1 :: (a -> a -> a) -> Reverse f a -> a # foldl1 :: (a -> a -> a) -> Reverse f a -> a # toList :: Reverse f a -> [a] # length :: Reverse f a -> Int # elem :: Eq a => a -> Reverse f a -> Bool # maximum :: Ord a => Reverse f a -> a # minimum :: Ord a => Reverse f a -> a # | |
(Foldable f, Foldable g) => Foldable (Product f g) Source # | Since: base-4.9.0.0 |
Defined in Data.Functor.Product fold :: Monoid m => Product f g m -> m # foldMap :: Monoid m => (a -> m) -> Product f g a -> m # foldMap' :: Monoid m => (a -> m) -> Product f g a -> m # foldr :: (a -> b -> b) -> b -> Product f g a -> b # foldr' :: (a -> b -> b) -> b -> Product f g a -> b # foldl :: (b -> a -> b) -> b -> Product f g a -> b # foldl' :: (b -> a -> b) -> b -> Product f g a -> b # foldr1 :: (a -> a -> a) -> Product f g a -> a # foldl1 :: (a -> a -> a) -> Product f g a -> a # toList :: Product f g a -> [a] # null :: Product f g a -> Bool # length :: Product f g a -> Int # elem :: Eq a => a -> Product f g a -> Bool # maximum :: Ord a => Product f g a -> a # minimum :: Ord a => Product f g a -> a # | |
(Foldable f, Foldable g) => Foldable (Sum f g) Source # | Since: base-4.9.0.0 |
Defined in Data.Functor.Sum fold :: Monoid m => Sum f g m -> m # foldMap :: Monoid m => (a -> m) -> Sum f g a -> m # foldMap' :: Monoid m => (a -> m) -> Sum f g a -> m # foldr :: (a -> b -> b) -> b -> Sum f g a -> b # foldr' :: (a -> b -> b) -> b -> Sum f g a -> b # foldl :: (b -> a -> b) -> b -> Sum f g a -> b # foldl' :: (b -> a -> b) -> b -> Sum f g a -> b # foldr1 :: (a -> a -> a) -> Sum f g a -> a # foldl1 :: (a -> a -> a) -> Sum f g a -> a # elem :: Eq a => a -> Sum f g a -> Bool # maximum :: Ord a => Sum f g a -> a # minimum :: Ord a => Sum f g a -> a # | |
(Foldable f, Foldable g) => Foldable (f :*: g) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => (f :*: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :*: g) a -> m # foldMap' :: Monoid m => (a -> m) -> (f :*: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :*: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :*: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :*: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :*: g) a -> b # foldr1 :: (a -> a -> a) -> (f :*: g) a -> a # foldl1 :: (a -> a -> a) -> (f :*: g) a -> a # toList :: (f :*: g) a -> [a] # length :: (f :*: g) a -> Int # elem :: Eq a => a -> (f :*: g) a -> Bool # maximum :: Ord a => (f :*: g) a -> a # minimum :: Ord a => (f :*: g) a -> a # | |
(Foldable f, Foldable g) => Foldable (f :+: g) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => (f :+: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :+: g) a -> m # foldMap' :: Monoid m => (a -> m) -> (f :+: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :+: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :+: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :+: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :+: g) a -> b # foldr1 :: (a -> a -> a) -> (f :+: g) a -> a # foldl1 :: (a -> a -> a) -> (f :+: g) a -> a # toList :: (f :+: g) a -> [a] # length :: (f :+: g) a -> Int # elem :: Eq a => a -> (f :+: g) a -> Bool # maximum :: Ord a => (f :+: g) a -> a # minimum :: Ord a => (f :+: g) a -> a # | |
Foldable (K1 i c :: Type -> Type) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => K1 i c m -> m # foldMap :: Monoid m => (a -> m) -> K1 i c a -> m # foldMap' :: Monoid m => (a -> m) -> K1 i c a -> m # foldr :: (a -> b -> b) -> b -> K1 i c a -> b # foldr' :: (a -> b -> b) -> b -> K1 i c a -> b # foldl :: (b -> a -> b) -> b -> K1 i c a -> b # foldl' :: (b -> a -> b) -> b -> K1 i c a -> b # foldr1 :: (a -> a -> a) -> K1 i c a -> a # foldl1 :: (a -> a -> a) -> K1 i c a -> a # elem :: Eq a => a -> K1 i c a -> Bool # maximum :: Ord a => K1 i c a -> a # minimum :: Ord a => K1 i c a -> a # | |
(Foldable f, Foldable g) => Foldable (Compose f g) Source # | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose fold :: Monoid m => Compose f g m -> m # foldMap :: Monoid m => (a -> m) -> Compose f g a -> m # foldMap' :: Monoid m => (a -> m) -> Compose f g a -> m # foldr :: (a -> b -> b) -> b -> Compose f g a -> b # foldr' :: (a -> b -> b) -> b -> Compose f g a -> b # foldl :: (b -> a -> b) -> b -> Compose f g a -> b # foldl' :: (b -> a -> b) -> b -> Compose f g a -> b # foldr1 :: (a -> a -> a) -> Compose f g a -> a # foldl1 :: (a -> a -> a) -> Compose f g a -> a # toList :: Compose f g a -> [a] # null :: Compose f g a -> Bool # length :: Compose f g a -> Int # elem :: Eq a => a -> Compose f g a -> Bool # maximum :: Ord a => Compose f g a -> a # minimum :: Ord a => Compose f g a -> a # | |
(Foldable f, Foldable g) => Foldable (f :.: g) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => (f :.: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :.: g) a -> m # foldMap' :: Monoid m => (a -> m) -> (f :.: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :.: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :.: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :.: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :.: g) a -> b # foldr1 :: (a -> a -> a) -> (f :.: g) a -> a # foldl1 :: (a -> a -> a) -> (f :.: g) a -> a # toList :: (f :.: g) a -> [a] # length :: (f :.: g) a -> Int # elem :: Eq a => a -> (f :.: g) a -> Bool # maximum :: Ord a => (f :.: g) a -> a # minimum :: Ord a => (f :.: g) a -> a # | |
Foldable f => Foldable (M1 i c f) # | |
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => M1 i c f m -> m # foldMap :: Monoid m => (a -> m) -> M1 i c f a -> m # foldMap' :: Monoid m => (a -> m) -> M1 i c f a -> m # foldr :: (a -> b -> b) -> b -> M1 i c f a -> b # foldr' :: (a -> b -> b) -> b -> M1 i c f a -> b # foldl :: (b -> a -> b) -> b -> M1 i c f a -> b # foldl' :: (b -> a -> b) -> b -> M1 i c f a -> b # foldr1 :: (a -> a -> a) -> M1 i c f a -> a # foldl1 :: (a -> a -> a) -> M1 i c f a -> a # elem :: Eq a => a -> M1 i c f a -> Bool # maximum :: Ord a => M1 i c f a -> a # minimum :: Ord a => M1 i c f a -> a # |
class (Functor t, Foldable t) => Traversable (t :: Type -> Type) where #
traverse :: Applicative f => (a -> f b) -> t a -> f (t b) #
sequenceA :: Applicative f => t (f a) -> f (t a) #
Instances
Traversable Complex Source # | Since: base-4.9.0.0 |
Traversable First Source # | Since: base-4.9.0.0 |
Traversable Last Source # | Since: base-4.9.0.0 |
Traversable Max Source # | Since: base-4.9.0.0 |
Traversable Min Source # | Since: base-4.9.0.0 |
Traversable IntMap # | |
Defined in Data.IntMap.Internal | |
Traversable Digit # | |
Defined in Data.Sequence.Internal | |
Traversable Elem # | |
Defined in Data.Sequence.Internal | |
Traversable FingerTree # | |
Defined in Data.Sequence.Internal | |
Traversable Node # | |
Defined in Data.Sequence.Internal | |
Traversable Seq # | |
Defined in Data.Sequence.Internal | |
Traversable ViewL # | |
Defined in Data.Sequence.Internal | |
Traversable ViewR # | |
Defined in Data.Sequence.Internal | |
Traversable Tree # | |
Traversable NonEmpty # | |
Traversable Identity # | |
Traversable First # | |
Traversable Last # | |
Traversable Down # | |
Traversable Dual # | |
Traversable Product # | |
Traversable Sum # | |
Traversable Par1 # | |
Traversable TyVarBndr # | |
Defined in GHC.Internal.TH.Syntax | |
Traversable Maybe # | |
Traversable Solo # | |
Traversable [] # | |
Defined in GHC.Internal.Data.Traversable | |
Traversable (Arg a) Source # | Since: base-4.9.0.0 |
Traversable (Map k) # | |
Defined in Data.Map.Internal | |
Ix i => Traversable (Array i) # | |
Traversable (Either a) # | |
Defined in GHC.Internal.Data.Traversable | |
Traversable (Proxy :: Type -> Type) # | |
Traversable (U1 :: Type -> Type) # | |
Traversable (UAddr :: Type -> Type) # | |
Traversable (UChar :: Type -> Type) # | |
Traversable (UDouble :: Type -> Type) # | |
Traversable (UFloat :: Type -> Type) # | |
Traversable (UInt :: Type -> Type) # | |
Traversable (UWord :: Type -> Type) # | |
Traversable (V1 :: Type -> Type) # | |
Traversable f => Traversable (Lift f) Source # | |
Traversable f => Traversable (MaybeT f) Source # | |
Defined in Control.Monad.Trans.Maybe | |
Traversable ((,) a) # | |
Defined in GHC.Internal.Data.Traversable | |
Traversable (Const m :: Type -> Type) # | |
Traversable f => Traversable (Ap f) # | |
Traversable f => Traversable (Alt f) # | |
Traversable f => Traversable (Rec1 f) # | |
Traversable f => Traversable (Backwards f) Source # | Derived instance. |
Defined in Control.Applicative.Backwards | |
Traversable f => Traversable (ExceptT e f) Source # | |
Defined in Control.Monad.Trans.Except | |
Traversable f => Traversable (IdentityT f) Source # | |
Defined in Control.Monad.Trans.Identity | |
Traversable f => Traversable (WriterT w f) Source # | |
Defined in Control.Monad.Trans.Writer.Lazy | |
Traversable f => Traversable (WriterT w f) Source # | |
Defined in Control.Monad.Trans.Writer.Strict | |
Traversable (Constant a :: Type -> Type) Source # | |
Defined in Data.Functor.Constant | |
Traversable f => Traversable (Reverse f) Source # | Traverse from right to left. |
Defined in Data.Functor.Reverse | |
(Traversable f, Traversable g) => Traversable (Product f g) Source # | Since: base-4.9.0.0 |
Defined in Data.Functor.Product | |
(Traversable f, Traversable g) => Traversable (Sum f g) Source # | Since: base-4.9.0.0 |
(Traversable f, Traversable g) => Traversable (f :*: g) # | |
Defined in GHC.Internal.Data.Traversable | |
(Traversable f, Traversable g) => Traversable (f :+: g) # | |
Defined in GHC.Internal.Data.Traversable | |
Traversable (K1 i c :: Type -> Type) # | |
(Traversable f, Traversable g) => Traversable (Compose f g) Source # | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose | |
(Traversable f, Traversable g) => Traversable (f :.: g) # | |
Defined in GHC.Internal.Data.Traversable | |
Traversable f => Traversable (M1 i c f) # | |
Defined in GHC.Internal.Data.Traversable |
Instances
Bounded Associativity # | |
Defined in GHC.Internal.Generics | |
Bounded DecidedStrictness # | |
Defined in GHC.Internal.Generics | |
Bounded SourceStrictness # | |
Defined in GHC.Internal.Generics | |
Bounded SourceUnpackedness # | |
Defined in GHC.Internal.Generics | |
Bounded Int16 # | |
Bounded Int32 # | |
Bounded Int64 # | |
Bounded Int8 # | |
Bounded Extension # | |
Defined in GHC.Internal.LanguageExtensions | |
Bounded CBlkCnt # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded CBlkSize # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded CClockId # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded CDev # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded CFsBlkCnt # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded CFsFilCnt # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded CGid # | |
Bounded CId # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded CIno # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded CKey # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded CMode # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded CNfds # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded CNlink # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded COff # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded CPid # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded CRLim # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded CSocklen # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded CSsize # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded CTcflag # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded CUid # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded Fd # | |
Defined in GHC.Internal.System.Posix.Types | |
Bounded GeneralCategory # | |
Defined in GHC.Internal.Unicode | |
Bounded Word16 # | |
Bounded Word32 # | |
Bounded Word64 # | |
Bounded Word8 # | |
Bounded Ordering # | |
Bounded I8 Source # | |
Bounded FPFormat Source # | |
Bounded () # | |
Defined in GHC.Internal.Enum | |
Bounded Bool # | |
Bounded Char # | |
Bounded Int # | |
Bounded Levity # | |
Bounded VecCount # | |
Bounded VecElem # | |
Bounded Word # | |
Bounded a => Bounded (First a) Source # | Since: base-4.9.0.0 |
Bounded a => Bounded (Last a) Source # | Since: base-4.9.0.0 |
Bounded a => Bounded (Max a) Source # | Since: base-4.9.0.0 |
Bounded a => Bounded (Min a) Source # | Since: base-4.9.0.0 |
Bounded m => Bounded (WrappedMonoid m) Source # | Since: base-4.9.0.0 |
Defined in Data.Semigroup minBound :: WrappedMonoid m # maxBound :: WrappedMonoid m # | |
Bounded a => Bounded (Solo a) # | |
(Bounded a, Bounded b) => Bounded (a, b) # | |
Defined in GHC.Internal.Enum | |
(Bounded a, Bounded b, Bounded c) => Bounded (a, b, c) # | |
Defined in GHC.Internal.Enum | |
(Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (a, b, c, d) # | |
Defined in GHC.Internal.Enum | |
Bounded (f (g a)) => Bounded (Compose f g a) Source # | Since: base-4.19.0.0 |
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (a, b, c, d, e) # | |
Defined in GHC.Internal.Enum | |
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f) => Bounded (a, b, c, d, e, f) # | |
Defined in GHC.Internal.Enum | |
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g) => Bounded (a, b, c, d, e, f, g) # | |
Defined in GHC.Internal.Enum | |
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h) => Bounded (a, b, c, d, e, f, g, h) # | |
Defined in GHC.Internal.Enum | |
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i) => Bounded (a, b, c, d, e, f, g, h, i) # | |
Defined in GHC.Internal.Enum | |
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j) => Bounded (a, b, c, d, e, f, g, h, i, j) # | |
Defined in GHC.Internal.Enum | |
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k) => Bounded (a, b, c, d, e, f, g, h, i, j, k) # | |
Defined in GHC.Internal.Enum | |
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l) # | |
Defined in GHC.Internal.Enum | |
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m) # | |
Defined in GHC.Internal.Enum | |
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # | |
Defined in GHC.Internal.Enum | |
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n, Bounded o) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # | |
Defined in GHC.Internal.Enum |
Instances
Enum Associativity # | |
Defined in GHC.Internal.Generics succ :: Associativity -> Associativity # pred :: Associativity -> Associativity # toEnum :: Int -> Associativity # fromEnum :: Associativity -> Int # enumFrom :: Associativity -> [Associativity] # enumFromThen :: Associativity -> Associativity -> [Associativity] # enumFromTo :: Associativity -> Associativity -> [Associativity] # enumFromThenTo :: Associativity -> Associativity -> Associativity -> [Associativity] # | |
Enum DecidedStrictness # | |
Defined in GHC.Internal.Generics succ :: DecidedStrictness -> DecidedStrictness # pred :: DecidedStrictness -> DecidedStrictness # toEnum :: Int -> DecidedStrictness # fromEnum :: DecidedStrictness -> Int # enumFrom :: DecidedStrictness -> [DecidedStrictness] # enumFromThen :: DecidedStrictness -> DecidedStrictness -> [DecidedStrictness] # enumFromTo :: DecidedStrictness -> DecidedStrictness -> [DecidedStrictness] # enumFromThenTo :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness -> [DecidedStrictness] # | |
Enum SourceStrictness # | |
Defined in GHC.Internal.Generics succ :: SourceStrictness -> SourceStrictness # pred :: SourceStrictness -> SourceStrictness # toEnum :: Int -> SourceStrictness # fromEnum :: SourceStrictness -> Int # enumFrom :: SourceStrictness -> [SourceStrictness] # enumFromThen :: SourceStrictness -> SourceStrictness -> [SourceStrictness] # enumFromTo :: SourceStrictness -> SourceStrictness -> [SourceStrictness] # enumFromThenTo :: SourceStrictness -> SourceStrictness -> SourceStrictness -> [SourceStrictness] # | |
Enum SourceUnpackedness # | |
Defined in GHC.Internal.Generics succ :: SourceUnpackedness -> SourceUnpackedness # pred :: SourceUnpackedness -> SourceUnpackedness # toEnum :: Int -> SourceUnpackedness # fromEnum :: SourceUnpackedness -> Int # enumFrom :: SourceUnpackedness -> [SourceUnpackedness] # enumFromThen :: SourceUnpackedness -> SourceUnpackedness -> [SourceUnpackedness] # enumFromTo :: SourceUnpackedness -> SourceUnpackedness -> [SourceUnpackedness] # enumFromThenTo :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness -> [SourceUnpackedness] # | |
Enum Int16 # | |
Enum Int32 # | |
Enum Int64 # | |
Enum Int8 # | |
Enum Extension # | |
Defined in GHC.Internal.LanguageExtensions succ :: Extension -> Extension # pred :: Extension -> Extension # fromEnum :: Extension -> Int # enumFrom :: Extension -> [Extension] # enumFromThen :: Extension -> Extension -> [Extension] # enumFromTo :: Extension -> Extension -> [Extension] # enumFromThenTo :: Extension -> Extension -> Extension -> [Extension] # | |
Enum CBlkCnt # | |
Defined in GHC.Internal.System.Posix.Types enumFrom :: CBlkCnt -> [CBlkCnt] # enumFromThen :: CBlkCnt -> CBlkCnt -> [CBlkCnt] # enumFromTo :: CBlkCnt -> CBlkCnt -> [CBlkCnt] # enumFromThenTo :: CBlkCnt -> CBlkCnt -> CBlkCnt -> [CBlkCnt] # | |
Enum CBlkSize # | |
Defined in GHC.Internal.System.Posix.Types succ :: CBlkSize -> CBlkSize # pred :: CBlkSize -> CBlkSize # enumFrom :: CBlkSize -> [CBlkSize] # enumFromThen :: CBlkSize -> CBlkSize -> [CBlkSize] # enumFromTo :: CBlkSize -> CBlkSize -> [CBlkSize] # enumFromThenTo :: CBlkSize -> CBlkSize -> CBlkSize -> [CBlkSize] # | |
Enum CCc # | |
Defined in GHC.Internal.System.Posix.Types | |
Enum CClockId # | |
Defined in GHC.Internal.System.Posix.Types succ :: CClockId -> CClockId # pred :: CClockId -> CClockId # enumFrom :: CClockId -> [CClockId] # enumFromThen :: CClockId -> CClockId -> [CClockId] # enumFromTo :: CClockId -> CClockId -> [CClockId] # enumFromThenTo :: CClockId -> CClockId -> CClockId -> [CClockId] # | |
Enum CDev # | |
Defined in GHC.Internal.System.Posix.Types | |
Enum CFsBlkCnt # | |
Defined in GHC.Internal.System.Posix.Types succ :: CFsBlkCnt -> CFsBlkCnt # pred :: CFsBlkCnt -> CFsBlkCnt # fromEnum :: CFsBlkCnt -> Int # enumFrom :: CFsBlkCnt -> [CFsBlkCnt] # enumFromThen :: CFsBlkCnt -> CFsBlkCnt -> [CFsBlkCnt] # enumFromTo :: CFsBlkCnt -> CFsBlkCnt -> [CFsBlkCnt] # enumFromThenTo :: CFsBlkCnt -> CFsBlkCnt -> CFsBlkCnt -> [CFsBlkCnt] # | |
Enum CFsFilCnt # | |
Defined in GHC.Internal.System.Posix.Types succ :: CFsFilCnt -> CFsFilCnt # pred :: CFsFilCnt -> CFsFilCnt # fromEnum :: CFsFilCnt -> Int # enumFrom :: CFsFilCnt -> [CFsFilCnt] # enumFromThen :: CFsFilCnt -> CFsFilCnt -> [CFsFilCnt] # enumFromTo :: CFsFilCnt -> CFsFilCnt -> [CFsFilCnt] # enumFromThenTo :: CFsFilCnt -> CFsFilCnt -> CFsFilCnt -> [CFsFilCnt] # | |
Enum CGid # | |
Enum CId # | |
Defined in GHC.Internal.System.Posix.Types | |
Enum CIno # | |
Defined in GHC.Internal.System.Posix.Types | |
Enum CKey # | |
Defined in GHC.Internal.System.Posix.Types | |
Enum CMode # | |
Defined in GHC.Internal.System.Posix.Types | |
Enum CNfds # | |
Defined in GHC.Internal.System.Posix.Types | |
Enum CNlink # | |
Defined in GHC.Internal.System.Posix.Types | |
Enum COff # | |
Defined in GHC.Internal.System.Posix.Types | |
Enum CPid # | |
Defined in GHC.Internal.System.Posix.Types | |
Enum CRLim # | |
Defined in GHC.Internal.System.Posix.Types | |
Enum CSocklen # | |
Defined in GHC.Internal.System.Posix.Types succ :: CSocklen -> CSocklen # pred :: CSocklen -> CSocklen # enumFrom :: CSocklen -> [CSocklen] # enumFromThen :: CSocklen -> CSocklen -> [CSocklen] # enumFromTo :: CSocklen -> CSocklen -> [CSocklen] # enumFromThenTo :: CSocklen -> CSocklen -> CSocklen -> [CSocklen] # | |
Enum CSpeed # | |
Defined in GHC.Internal.System.Posix.Types | |
Enum CSsize # | |
Defined in GHC.Internal.System.Posix.Types | |
Enum CTcflag # | |
Defined in GHC.Internal.System.Posix.Types enumFrom :: CTcflag -> [CTcflag] # enumFromThen :: CTcflag -> CTcflag -> [CTcflag] # enumFromTo :: CTcflag -> CTcflag -> [CTcflag] # enumFromThenTo :: CTcflag -> CTcflag -> CTcflag -> [CTcflag] # | |
Enum CUid # | |
Defined in GHC.Internal.System.Posix.Types | |
Enum Fd # | |
Defined in GHC.Internal.System.Posix.Types | |
Enum GeneralCategory # | |
Defined in GHC.Internal.Unicode succ :: GeneralCategory -> GeneralCategory # pred :: GeneralCategory -> GeneralCategory # toEnum :: Int -> GeneralCategory # fromEnum :: GeneralCategory -> Int # enumFrom :: GeneralCategory -> [GeneralCategory] # enumFromThen :: GeneralCategory -> GeneralCategory -> [GeneralCategory] # enumFromTo :: GeneralCategory -> GeneralCategory -> [GeneralCategory] # enumFromThenTo :: GeneralCategory -> GeneralCategory -> GeneralCategory -> [GeneralCategory] # | |
Enum Word16 # | |
Defined in GHC.Internal.Word | |
Enum Word32 # | |
Defined in GHC.Internal.Word | |
Enum Word64 # | |
Defined in GHC.Internal.Word | |
Enum Word8 # | |
Enum Ordering # | |
Enum I8 Source # | |
Enum FPFormat Source # | |
Defined in Data.Text.Lazy.Builder.RealFloat | |
Enum Day # | |
Defined in Data.Time.Calendar.Days | |
Enum Month # | |
Defined in Data.Time.Calendar.Month | |
Enum DayOfWeek # | |
Defined in Data.Time.Calendar.Week succ :: DayOfWeek -> DayOfWeek # pred :: DayOfWeek -> DayOfWeek # fromEnum :: DayOfWeek -> Int # enumFrom :: DayOfWeek -> [DayOfWeek] # enumFromThen :: DayOfWeek -> DayOfWeek -> [DayOfWeek] # enumFromTo :: DayOfWeek -> DayOfWeek -> [DayOfWeek] # enumFromThenTo :: DayOfWeek -> DayOfWeek -> DayOfWeek -> [DayOfWeek] # | |
Enum DiffTime # | |
Defined in Data.Time.Clock.Internal.DiffTime succ :: DiffTime -> DiffTime # pred :: DiffTime -> DiffTime # enumFrom :: DiffTime -> [DiffTime] # enumFromThen :: DiffTime -> DiffTime -> [DiffTime] # enumFromTo :: DiffTime -> DiffTime -> [DiffTime] # enumFromThenTo :: DiffTime -> DiffTime -> DiffTime -> [DiffTime] # | |
Enum NominalDiffTime # | |
Defined in Data.Time.Clock.Internal.NominalDiffTime succ :: NominalDiffTime -> NominalDiffTime # pred :: NominalDiffTime -> NominalDiffTime # toEnum :: Int -> NominalDiffTime # fromEnum :: NominalDiffTime -> Int # enumFrom :: NominalDiffTime -> [NominalDiffTime] # enumFromThen :: NominalDiffTime -> NominalDiffTime -> [NominalDiffTime] # enumFromTo :: NominalDiffTime -> NominalDiffTime -> [NominalDiffTime] # enumFromThenTo :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime -> [NominalDiffTime] # | |
Enum Integer # | |
Enum Natural # | |
Enum () # | |
Defined in GHC.Internal.Enum | |
Enum Bool # | |
Enum Char # | |
Enum Int # | |
Enum Levity # | |
Defined in GHC.Internal.Enum | |
Enum VecCount # | |
Enum VecElem # | |
Enum Word # | |
Enum a => Enum (First a) Source # | Since: base-4.9.0.0 |
Enum a => Enum (Last a) Source # | Since: base-4.9.0.0 |
Defined in Data.Semigroup | |
Enum a => Enum (Max a) Source # | Since: base-4.9.0.0 |
Enum a => Enum (Min a) Source # | Since: base-4.9.0.0 |
Enum a => Enum (WrappedMonoid a) Source # | Since: base-4.9.0.0 |
Defined in Data.Semigroup succ :: WrappedMonoid a -> WrappedMonoid a # pred :: WrappedMonoid a -> WrappedMonoid a # toEnum :: Int -> WrappedMonoid a # fromEnum :: WrappedMonoid a -> Int # enumFrom :: WrappedMonoid a -> [WrappedMonoid a] # enumFromThen :: WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] # enumFromTo :: WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] # enumFromThenTo :: WrappedMonoid a -> WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] # | |
Integral a => Enum (Ratio a) # | |
Enum a => Enum (Solo a) # | |
Defined in GHC.Internal.Enum | |
Enum (Fixed a) Source # | Recall that, for numeric types,
and likewise
In other words,
and similarly
This is worth bearing in mind when defining [1..10] :: [Pico] evaluates to However, this is not true. On the contrary, similarly to the above
implementations of [1.000000000000, 1.00000000001, 1.00000000002, ..., 10.000000000000] and contains Since: base-2.1 |
Enum (f (g a)) => Enum (Compose f g a) Source # | Since: base-4.19.0.0 |
Defined in Data.Functor.Compose succ :: Compose f g a -> Compose f g a # pred :: Compose f g a -> Compose f g a # toEnum :: Int -> Compose f g a # fromEnum :: Compose f g a -> Int # enumFrom :: Compose f g a -> [Compose f g a] # enumFromThen :: Compose f g a -> Compose f g a -> [Compose f g a] # enumFromTo :: Compose f g a -> Compose f g a -> [Compose f g a] # enumFromThenTo :: Compose f g a -> Compose f g a -> Compose f g a -> [Compose f g a] # |
class Fractional a => Floating a where #
Instances
Floating Double # | |
Floating Float # | |
RealFloat a => Floating (Complex a) Source # | Since: base-2.1 |
Defined in Data.Complex exp :: Complex a -> Complex a # log :: Complex a -> Complex a # sqrt :: Complex a -> Complex a # (**) :: Complex a -> Complex a -> Complex a # logBase :: Complex a -> Complex a -> Complex a # sin :: Complex a -> Complex a # cos :: Complex a -> Complex a # tan :: Complex a -> Complex a # asin :: Complex a -> Complex a # acos :: Complex a -> Complex a # atan :: Complex a -> Complex a # sinh :: Complex a -> Complex a # cosh :: Complex a -> Complex a # tanh :: Complex a -> Complex a # asinh :: Complex a -> Complex a # acosh :: Complex a -> Complex a # atanh :: Complex a -> Complex a # log1p :: Complex a -> Complex a # expm1 :: Complex a -> Complex a # | |
Floating a => Floating (Op a b) Source # | |
Floating (f (g a)) => Floating (Compose f g a) Source # | Since: base-4.20.0.0 |
Defined in Data.Functor.Compose exp :: Compose f g a -> Compose f g a # log :: Compose f g a -> Compose f g a # sqrt :: Compose f g a -> Compose f g a # (**) :: Compose f g a -> Compose f g a -> Compose f g a # logBase :: Compose f g a -> Compose f g a -> Compose f g a # sin :: Compose f g a -> Compose f g a # cos :: Compose f g a -> Compose f g a # tan :: Compose f g a -> Compose f g a # asin :: Compose f g a -> Compose f g a # acos :: Compose f g a -> Compose f g a # atan :: Compose f g a -> Compose f g a # sinh :: Compose f g a -> Compose f g a # cosh :: Compose f g a -> Compose f g a # tanh :: Compose f g a -> Compose f g a # asinh :: Compose f g a -> Compose f g a # acosh :: Compose f g a -> Compose f g a # atanh :: Compose f g a -> Compose f g a # log1p :: Compose f g a -> Compose f g a # expm1 :: Compose f g a -> Compose f g a # |
class (RealFrac a, Floating a) => RealFloat a where #
floatRadix, floatDigits, floatRange, decodeFloat, encodeFloat, isNaN, isInfinite, isDenormalized, isNegativeZero, isIEEE
floatRadix :: a -> Integer #
floatDigits :: a -> Int #
floatRange :: a -> (Int, Int) #
decodeFloat :: a -> (Integer, Int) #
encodeFloat :: Integer -> Int -> a #
significand :: a -> a #
scaleFloat :: Int -> a -> a #
isInfinite :: a -> Bool #
isDenormalized :: a -> Bool #
isNegativeZero :: a -> Bool #
Instances
RealFloat Double # | |
Defined in GHC.Internal.Float floatRadix :: Double -> Integer # floatDigits :: Double -> Int # floatRange :: Double -> (Int, Int) # decodeFloat :: Double -> (Integer, Int) # encodeFloat :: Integer -> Int -> Double # significand :: Double -> Double # scaleFloat :: Int -> Double -> Double # isInfinite :: Double -> Bool # isDenormalized :: Double -> Bool # isNegativeZero :: Double -> Bool # | |
RealFloat Float # | |
Defined in GHC.Internal.Float floatRadix :: Float -> Integer # floatDigits :: Float -> Int # floatRange :: Float -> (Int, Int) # decodeFloat :: Float -> (Integer, Int) # encodeFloat :: Integer -> Int -> Float # significand :: Float -> Float # scaleFloat :: Int -> Float -> Float # isInfinite :: Float -> Bool # isDenormalized :: Float -> Bool # isNegativeZero :: Float -> Bool # | |
RealFloat (f (g a)) => RealFloat (Compose f g a) Source # | Since: base-4.20.0.0 |
Defined in Data.Functor.Compose floatRadix :: Compose f g a -> Integer # floatDigits :: Compose f g a -> Int # floatRange :: Compose f g a -> (Int, Int) # decodeFloat :: Compose f g a -> (Integer, Int) # encodeFloat :: Integer -> Int -> Compose f g a # exponent :: Compose f g a -> Int # significand :: Compose f g a -> Compose f g a # scaleFloat :: Int -> Compose f g a -> Compose f g a # isNaN :: Compose f g a -> Bool # isInfinite :: Compose f g a -> Bool # isDenormalized :: Compose f g a -> Bool # isNegativeZero :: Compose f g a -> Bool # |
type IOError = IOException #
fromInteger :: Integer -> a #
Instances
Num Int16 # | |
Num Int32 # | |
Num Int64 # | |
Num Int8 # | |
Num CBlkCnt # | |
Num CBlkSize # | |
Num CCc # | |
Num CClockId # | |
Num CDev # | |
Num CFsBlkCnt # | |
Defined in GHC.Internal.System.Posix.Types | |
Num CFsFilCnt # | |
Defined in GHC.Internal.System.Posix.Types | |
Num CGid # | |
Num CId # | |
Num CIno # | |
Num CKey # | |
Num CMode # | |
Num CNfds # | |
Num CNlink # | |
Num COff # | |
Num CPid # | |
Num CRLim # | |
Num CSocklen # | |
Num CSpeed # | |
Num CSsize # | |
Num CTcflag # | |
Num CUid # | |
Num Fd # | |
Num Word16 # | |
Num Word32 # | |
Num Word64 # | |
Num Word8 # | |
Num I8 Source # | |
Num Size Source # | |
Num DiffTime # | |
Num NominalDiffTime # | |
Defined in Data.Time.Clock.Internal.NominalDiffTime (+) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime # (-) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime # (*) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime # negate :: NominalDiffTime -> NominalDiffTime # abs :: NominalDiffTime -> NominalDiffTime # signum :: NominalDiffTime -> NominalDiffTime # fromInteger :: Integer -> NominalDiffTime # | |
Num Integer # | |
Num Natural # | |
Num Int # | |
Num Word # | |
RealFloat a => Num (Complex a) Source # | Since: base-2.1 |
Num a => Num (Max a) Source # | Since: base-4.9.0.0 |
Num a => Num (Min a) Source # | Since: base-4.9.0.0 |
Integral a => Num (Ratio a) # | |
HasResolution a => Num (Fixed a) Source # | Multiplication is not associative or distributive:
Since: base-2.1 |
Num a => Num (Op a b) Source # | |
Num (f (g a)) => Num (Compose f g a) Source # | Since: base-4.19.0.0 |
Defined in Data.Functor.Compose (+) :: Compose f g a -> Compose f g a -> Compose f g a # (-) :: Compose f g a -> Compose f g a -> Compose f g a # (*) :: Compose f g a -> Compose f g a -> Compose f g a # negate :: Compose f g a -> Compose f g a # abs :: Compose f g a -> Compose f g a # signum :: Compose f g a -> Compose f g a # fromInteger :: Integer -> Compose f g a # |
Instances
Read ByteString # | |
Read ByteString # | |
Read ShortByteString # | |
Read IntSet # | |
Read Void # | |
Read Associativity # | |
Defined in GHC.Internal.Generics readsPrec :: Int -> ReadS Associativity # readList :: ReadS [Associativity] # | |
Read DecidedStrictness # | |
Defined in GHC.Internal.Generics | |
Read Fixity # | |
Read SourceStrictness # | |
Defined in GHC.Internal.Generics | |
Read SourceUnpackedness # | |
Defined in GHC.Internal.Generics | |
Read ExitCode # | |
Read BufferMode # | |
Defined in GHC.Internal.IO.Handle.Types readsPrec :: Int -> ReadS BufferMode # readList :: ReadS [BufferMode] # readPrec :: ReadPrec BufferMode # readListPrec :: ReadPrec [BufferMode] # | |
Read Newline # | |
Read NewlineMode # | |
Defined in GHC.Internal.IO.Handle.Types readsPrec :: Int -> ReadS NewlineMode # readList :: ReadS [NewlineMode] # readPrec :: ReadPrec NewlineMode # readListPrec :: ReadPrec [NewlineMode] # | |
Read Int16 # | |
Read Int32 # | |
Read Int64 # | |
Read Int8 # | |
Read CBlkCnt # | |
Read CBlkSize # | |
Read CCc # | |
Read CClockId # | |
Read CDev # | |
Read CFsBlkCnt # | |
Read CFsFilCnt # | |
Read CGid # | |
Read CId # | |
Read CIno # | |
Read CKey # | |
Read CMode # | |
Read CNfds # | |
Read CNlink # | |
Read COff # | |
Read CPid # | |
Read CRLim # | |
Read CSocklen # | |
Read CSpeed # | |
Read CSsize # | |
Read CTcflag # | |
Read CUid # | |
Read Fd # | |
Read Lexeme # | |
Read GeneralCategory # | |
Defined in GHC.Internal.Read | |
Read Word16 # | |
Read Word32 # | |
Read Word64 # | |
Read Word8 # | |
Read Arch Source # | |
Read ArchOS Source # | |
Read ArmABI Source # | |
Read ArmISA Source # | |
Read ArmISAExt Source # | |
Read OS Source # | |
Read PPC_64ABI Source # | |
Read Ordering # | |
Read Program Source # | |
Read Endianness Source # | |
Defined in GHC.Toolchain.Target readsPrec :: Int -> ReadS Endianness # readList :: ReadS [Endianness] # readPrec :: ReadPrec Endianness # readListPrec :: ReadPrec [Endianness] # | |
Read Target Source # | |
Read WordSize Source # | |
Read Ar Source # | |
Read Cc Source # | |
Read CmmCpp Source # | |
Read Cpp Source # | |
Read HsCpp Source # | |
Read JsCpp Source # | |
Read Cxx Source # | |
Read CcLink Source # | |
Read MergeObjs Source # | |
Read Nm Source # | |
Read Ranlib Source # | |
Read Readelf Source # | |
Read CommunicationHandle Source # | |
Read I8 Source # | |
Read FPFormat Source # | |
Read Month # | |
Read DayOfWeek # | |
Read DiffTime # | |
Read NominalDiffTime # | |
Read Integer # | |
Read Natural # | |
Read () # | |
Read Bool # | |
Read Char # | |
Read Double # | |
Read Float # | |
Read Int # | |
Read Word # | |
Read a => Read (Complex a) Source # | Since: base-2.1 |
Read a => Read (First a) Source # | Since: base-4.9.0.0 |
Read a => Read (Last a) Source # | Since: base-4.9.0.0 |
Read a => Read (Max a) Source # | Since: base-4.9.0.0 |
Read a => Read (Min a) Source # | Since: base-4.9.0.0 |
Read m => Read (WrappedMonoid m) Source # | Since: base-4.9.0.0 |
Defined in Data.Semigroup readsPrec :: Int -> ReadS (WrappedMonoid m) # readList :: ReadS [WrappedMonoid m] # readPrec :: ReadPrec (WrappedMonoid m) # readListPrec :: ReadPrec [WrappedMonoid m] # | |
Read e => Read (IntMap e) # | |
Read a => Read (Seq a) # | |
Read a => Read (ViewL a) # | |
Read a => Read (ViewR a) # | |
(Read a, Ord a) => Read (Set a) # | |
Read a => Read (Tree a) # | |
Read a => Read (NonEmpty a) # | |
Read p => Read (Par1 p) # | |
(Integral a, Read a) => Read (Ratio a) # | |
Read a => Read (Maybe a) # | |
Read a => Read (Solo a) # | |
Read a => Read [a] # | |
HasResolution a => Read (Fixed a) Source # | Since: base-4.3.0.0 |
(Read a, Read b) => Read (Arg a b) Source # | Since: base-4.9.0.0 |
(Ord k, Read k, Read e) => Read (Map k e) # | |
(Ix a, Read a, Read b) => Read (Array a b) # | |
(Read a, Read b) => Read (Either a b) # | |
Read (U1 p) # | |
Read (V1 p) # | |
(Read1 f, Read a) => Read (Lift f a) Source # | |
(Read1 m, Read a) => Read (MaybeT m a) Source # | |
(Read a, Read b) => Read (a, b) # | |
Read (f p) => Read (Rec1 f p) # | |
(Read1 f, Read a) => Read (Backwards f a) Source # | |
(Read e, Read1 m, Read a) => Read (ExceptT e m a) Source # | |
(Read1 f, Read a) => Read (IdentityT f a) Source # | |
(Read w, Read1 m, Read a) => Read (WriterT w m a) Source # | |
(Read w, Read1 m, Read a) => Read (WriterT w m a) Source # | |
Read a => Read (Constant a b) Source # | |
(Read1 f, Read a) => Read (Reverse f a) Source # | |
(Read a, Read b, Read c) => Read (a, b, c) # | |
(Read (f a), Read (g a)) => Read (Product f g a) Source # | Since: base-4.18.0.0 |
(Read (f a), Read (g a)) => Read (Sum f g a) Source # | Since: base-4.18.0.0 |
(Read (f p), Read (g p)) => Read ((f :*: g) p) # | |
(Read (f p), Read (g p)) => Read ((f :+: g) p) # | |
Read c => Read (K1 i c p) # | |
(Read a, Read b, Read c, Read d) => Read (a, b, c, d) # | |
Read (f (g a)) => Read (Compose f g a) Source # | Since: base-4.18.0.0 |
Read (f (g p)) => Read ((f :.: g) p) # | |
Read (f p) => Read (M1 i c f p) # | |
(Read a, Read b, Read c, Read d, Read e) => Read (a, b, c, d, e) # | |
(Read a, Read b, Read c, Read d, Read e, Read f) => Read (a, b, c, d, e, f) # | |
(Read a, Read b, Read c, Read d, Read e, Read f, Read g) => Read (a, b, c, d, e, f, g) # | |
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h) => Read (a, b, c, d, e, f, g, h) # | |
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i) => Read (a, b, c, d, e, f, g, h, i) # | |
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j) => Read (a, b, c, d, e, f, g, h, i, j) # | |
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k) => Read (a, b, c, d, e, f, g, h, i, j, k) # | |
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l) => Read (a, b, c, d, e, f, g, h, i, j, k, l) # | |
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m) # | |
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # | |
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n, Read o) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # | |
Defined in GHC.Internal.Read |
class Num a => Fractional a where #
fromRational, (recip | (/))
Instances
Fractional DiffTime # | |
Defined in Data.Time.Clock.Internal.DiffTime | |
Fractional NominalDiffTime # | |
Defined in Data.Time.Clock.Internal.NominalDiffTime | |
RealFloat a => Fractional (Complex a) Source # | Since: base-2.1 |
Integral a => Fractional (Ratio a) # | |
HasResolution a => Fractional (Fixed a) Source # | Since: base-2.1 |
Fractional a => Fractional (Op a b) Source # | |
Fractional (f (g a)) => Fractional (Compose f g a) Source # | Since: base-4.20.0.0 |
class (Real a, Enum a) => Integral a where #
Instances
Integral Int16 # | |
Integral Int32 # | |
Integral Int64 # | |
Integral Int8 # | |
Integral CBlkCnt # | |
Defined in GHC.Internal.System.Posix.Types | |
Integral CBlkSize # | |
Defined in GHC.Internal.System.Posix.Types | |
Integral CClockId # | |
Defined in GHC.Internal.System.Posix.Types | |
Integral CDev # | |
Integral CFsBlkCnt # | |
Defined in GHC.Internal.System.Posix.Types | |
Integral CFsFilCnt # | |
Defined in GHC.Internal.System.Posix.Types | |
Integral CGid # | |
Integral CId # | |
Integral CIno # | |
Integral CKey # | |
Integral CMode # | |
Integral CNfds # | |
Integral CNlink # | |
Defined in GHC.Internal.System.Posix.Types | |
Integral COff # | |
Integral CPid # | |
Integral CRLim # | |
Integral CSocklen # | |
Defined in GHC.Internal.System.Posix.Types | |
Integral CSsize # | |
Defined in GHC.Internal.System.Posix.Types | |
Integral CTcflag # | |
Defined in GHC.Internal.System.Posix.Types | |
Integral CUid # | |
Integral Fd # | |
Integral Word16 # | |
Integral Word32 # | |
Integral Word64 # | |
Integral Word8 # | |
Integral I8 Source # | |
Integral Integer # | |
Defined in GHC.Internal.Real | |
Integral Natural # | |
Defined in GHC.Internal.Real | |
Integral Int # | |
Integral Word # | |
Integral (f (g a)) => Integral (Compose f g a) Source # | Since: base-4.19.0.0 |
Defined in Data.Functor.Compose quot :: Compose f g a -> Compose f g a -> Compose f g a # rem :: Compose f g a -> Compose f g a -> Compose f g a # div :: Compose f g a -> Compose f g a -> Compose f g a # mod :: Compose f g a -> Compose f g a -> Compose f g a # quotRem :: Compose f g a -> Compose f g a -> (Compose f g a, Compose f g a) # divMod :: Compose f g a -> Compose f g a -> (Compose f g a, Compose f g a) # |
class (Num a, Ord a) => Real a where #
toRational :: a -> Rational #
Instances
Real Int16 # | |
Defined in GHC.Internal.Int toRational :: Int16 -> Rational # | |
Real Int32 # | |
Defined in GHC.Internal.Int toRational :: Int32 -> Rational # | |
Real Int64 # | |
Defined in GHC.Internal.Int toRational :: Int64 -> Rational # | |
Real Int8 # | |
Defined in GHC.Internal.Int toRational :: Int8 -> Rational # | |
Real CBlkCnt # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CBlkCnt -> Rational # | |
Real CBlkSize # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CBlkSize -> Rational # | |
Real CCc # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CCc -> Rational # | |
Real CClockId # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CClockId -> Rational # | |
Real CDev # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CDev -> Rational # | |
Real CFsBlkCnt # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CFsBlkCnt -> Rational # | |
Real CFsFilCnt # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CFsFilCnt -> Rational # | |
Real CGid # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CGid -> Rational # | |
Real CId # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CId -> Rational # | |
Real CIno # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CIno -> Rational # | |
Real CKey # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CKey -> Rational # | |
Real CMode # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CMode -> Rational # | |
Real CNfds # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CNfds -> Rational # | |
Real CNlink # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CNlink -> Rational # | |
Real COff # | |
Defined in GHC.Internal.System.Posix.Types toRational :: COff -> Rational # | |
Real CPid # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CPid -> Rational # | |
Real CRLim # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CRLim -> Rational # | |
Real CSocklen # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CSocklen -> Rational # | |
Real CSpeed # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CSpeed -> Rational # | |
Real CSsize # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CSsize -> Rational # | |
Real CTcflag # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CTcflag -> Rational # | |
Real CUid # | |
Defined in GHC.Internal.System.Posix.Types toRational :: CUid -> Rational # | |
Real Fd # | |
Defined in GHC.Internal.System.Posix.Types toRational :: Fd -> Rational # | |
Real Word16 # | |
Defined in GHC.Internal.Word toRational :: Word16 -> Rational # | |
Real Word32 # | |
Defined in GHC.Internal.Word toRational :: Word32 -> Rational # | |
Real Word64 # | |
Defined in GHC.Internal.Word toRational :: Word64 -> Rational # | |
Real Word8 # | |
Defined in GHC.Internal.Word toRational :: Word8 -> Rational # | |
Real I8 Source # | |
Defined in Data.Text.Foreign toRational :: I8 -> Rational # | |
Real DiffTime # | |
Defined in Data.Time.Clock.Internal.DiffTime toRational :: DiffTime -> Rational # | |
Real NominalDiffTime # | |
Defined in Data.Time.Clock.Internal.NominalDiffTime toRational :: NominalDiffTime -> Rational # | |
Real Integer # | |
Defined in GHC.Internal.Real toRational :: Integer -> Rational # | |
Real Natural # | |
Defined in GHC.Internal.Real toRational :: Natural -> Rational # | |
Real Int # | |
Defined in GHC.Internal.Real toRational :: Int -> Rational # | |
Real Word # | |
Defined in GHC.Internal.Real toRational :: Word -> Rational # | |
Integral a => Real (Ratio a) # | |
Defined in GHC.Internal.Real toRational :: Ratio a -> Rational # | |
HasResolution a => Real (Fixed a) Source # | Since: base-2.1 |
Defined in Data.Fixed toRational :: Fixed a -> Rational # | |
Real (f (g a)) => Real (Compose f g a) Source # | Since: base-4.19.0.0 |
Defined in Data.Functor.Compose toRational :: Compose f g a -> Rational # |
class (Real a, Fractional a) => RealFrac a where #
properFraction :: Integral b => a -> (b, a) #
truncate :: Integral b => a -> b #
round :: Integral b => a -> b #
Instances
Show ByteArray Source # | Since: base-4.17.0.0 |
Show Timeout Source # | Since: base-4.0 |
Show ByteString # | |
Show SizeOverflowException # | |
Show ByteString # | |
Show ShortByteString # | |
Show IntSet # | |
Show Void # | |
Show NestedAtomically # | |
Defined in GHC.Internal.Control.Exception.Base showsPrec :: Int -> NestedAtomically -> ShowS # show :: NestedAtomically -> String # showList :: [NestedAtomically] -> ShowS # | |
Show NoMatchingContinuationPrompt # | |
Defined in GHC.Internal.Control.Exception.Base showsPrec :: Int -> NoMatchingContinuationPrompt -> ShowS # show :: NoMatchingContinuationPrompt -> String # showList :: [NoMatchingContinuationPrompt] -> ShowS # | |
Show NoMethodError # | |
Defined in GHC.Internal.Control.Exception.Base showsPrec :: Int -> NoMethodError -> ShowS # show :: NoMethodError -> String # showList :: [NoMethodError] -> ShowS # | |
Show NonTermination # | |
Defined in GHC.Internal.Control.Exception.Base showsPrec :: Int -> NonTermination -> ShowS # show :: NonTermination -> String # showList :: [NonTermination] -> ShowS # | |
Show PatternMatchFail # | |
Defined in GHC.Internal.Control.Exception.Base showsPrec :: Int -> PatternMatchFail -> ShowS # show :: PatternMatchFail -> String # showList :: [PatternMatchFail] -> ShowS # | |
Show RecConError # | |
Defined in GHC.Internal.Control.Exception.Base showsPrec :: Int -> RecConError -> ShowS # show :: RecConError -> String # showList :: [RecConError] -> ShowS # | |
Show RecSelError # | |
Defined in GHC.Internal.Control.Exception.Base showsPrec :: Int -> RecSelError -> ShowS # show :: RecSelError -> String # showList :: [RecSelError] -> ShowS # | |
Show RecUpdError # | |
Defined in GHC.Internal.Control.Exception.Base showsPrec :: Int -> RecUpdError -> ShowS # show :: RecUpdError -> String # showList :: [RecUpdError] -> ShowS # | |
Show TypeError # | |
Show ArithException # | |
Defined in GHC.Internal.Exception.Type showsPrec :: Int -> ArithException -> ShowS # show :: ArithException -> String # showList :: [ArithException] -> ShowS # | |
Show SomeException # | |
Defined in GHC.Internal.Exception.Type showsPrec :: Int -> SomeException -> ShowS # show :: SomeException -> String # showList :: [SomeException] -> ShowS # | |
Show WhileHandling # | |
Defined in GHC.Internal.Exception.Type showsPrec :: Int -> WhileHandling -> ShowS # show :: WhileHandling -> String # showList :: [WhileHandling] -> ShowS # | |
Show ForeignSrcLang # | |
Show Associativity # | |
Defined in GHC.Internal.Generics showsPrec :: Int -> Associativity -> ShowS # show :: Associativity -> String # showList :: [Associativity] -> ShowS # | |
Show DecidedStrictness # | |
Defined in GHC.Internal.Generics showsPrec :: Int -> DecidedStrictness -> ShowS # show :: DecidedStrictness -> String # showList :: [DecidedStrictness] -> ShowS # | |
Show Fixity # | |
Show SourceStrictness # | |
Defined in GHC.Internal.Generics showsPrec :: Int -> SourceStrictness -> ShowS # show :: SourceStrictness -> String # showList :: [SourceStrictness] -> ShowS # | |
Show SourceUnpackedness # | |
Defined in GHC.Internal.Generics showsPrec :: Int -> SourceUnpackedness -> ShowS # show :: SourceUnpackedness -> String # showList :: [SourceUnpackedness] -> ShowS # | |
Show MaskingState # | |
Defined in GHC.Internal.IO showsPrec :: Int -> MaskingState -> ShowS # show :: MaskingState -> String # showList :: [MaskingState] -> ShowS # | |
Show AllocationLimitExceeded # | |
Defined in GHC.Internal.IO.Exception showsPrec :: Int -> AllocationLimitExceeded -> ShowS # show :: AllocationLimitExceeded -> String # showList :: [AllocationLimitExceeded] -> ShowS # | |
Show ArrayException # | |
Defined in GHC.Internal.IO.Exception showsPrec :: Int -> ArrayException -> ShowS # show :: ArrayException -> String # showList :: [ArrayException] -> ShowS # | |
Show AssertionFailed # | |
Defined in GHC.Internal.IO.Exception showsPrec :: Int -> AssertionFailed -> ShowS # show :: AssertionFailed -> String # showList :: [AssertionFailed] -> ShowS # | |
Show AsyncException # | |
Defined in GHC.Internal.IO.Exception showsPrec :: Int -> AsyncException -> ShowS # show :: AsyncException -> String # showList :: [AsyncException] -> ShowS # | |
Show BlockedIndefinitelyOnMVar # | |
Defined in GHC.Internal.IO.Exception showsPrec :: Int -> BlockedIndefinitelyOnMVar -> ShowS # show :: BlockedIndefinitelyOnMVar -> String # showList :: [BlockedIndefinitelyOnMVar] -> ShowS # | |
Show BlockedIndefinitelyOnSTM # | |
Defined in GHC.Internal.IO.Exception showsPrec :: Int -> BlockedIndefinitelyOnSTM -> ShowS # show :: BlockedIndefinitelyOnSTM -> String # showList :: [BlockedIndefinitelyOnSTM] -> ShowS # | |
Show CompactionFailed # | |
Defined in GHC.Internal.IO.Exception showsPrec :: Int -> CompactionFailed -> ShowS # show :: CompactionFailed -> String # showList :: [CompactionFailed] -> ShowS # | |
Show Deadlock # | |
Show ExitCode # | |
Show FixIOException # | |
Defined in GHC.Internal.IO.Exception showsPrec :: Int -> FixIOException -> ShowS # show :: FixIOException -> String # showList :: [FixIOException] -> ShowS # | |
Show IOErrorType # | |
Defined in GHC.Internal.IO.Exception showsPrec :: Int -> IOErrorType -> ShowS # show :: IOErrorType -> String # showList :: [IOErrorType] -> ShowS # | |
Show IOException # | |
Defined in GHC.Internal.IO.Exception showsPrec :: Int -> IOException -> ShowS # show :: IOException -> String # showList :: [IOException] -> ShowS # | |
Show SomeAsyncException # | |
Defined in GHC.Internal.IO.Exception showsPrec :: Int -> SomeAsyncException -> ShowS # show :: SomeAsyncException -> String # showList :: [SomeAsyncException] -> ShowS # | |
Show BufferMode # | |
Defined in GHC.Internal.IO.Handle.Types showsPrec :: Int -> BufferMode -> ShowS # show :: BufferMode -> String # showList :: [BufferMode] -> ShowS # | |
Show Handle # | |
Show HandleType # | |
Defined in GHC.Internal.IO.Handle.Types showsPrec :: Int -> HandleType -> ShowS # show :: HandleType -> String # showList :: [HandleType] -> ShowS # | |
Show Newline # | |
Show NewlineMode # | |
Defined in GHC.Internal.IO.Handle.Types showsPrec :: Int -> NewlineMode -> ShowS # show :: NewlineMode -> String # showList :: [NewlineMode] -> ShowS # | |
Show Int16 # | |
Show Int32 # | |
Show Int64 # | |
Show Int8 # | |
Show Extension # | |
Show FractionalExponentBase # | |
Defined in GHC.Internal.Real showsPrec :: Int -> FractionalExponentBase -> ShowS # show :: FractionalExponentBase -> String # showList :: [FractionalExponentBase] -> ShowS # | |
Show CallStack # | |
Show SrcLoc # | |
Show CBlkCnt # | |
Show CBlkSize # | |
Show CCc # | |
Show CClockId # | |
Show CDev # | |
Show CFsBlkCnt # | |
Show CFsFilCnt # | |
Show CGid # | |
Show CId # | |
Show CIno # | |
Show CKey # | |
Show CMode # | |
Show CNfds # | |
Show CNlink # | |
Show COff # | |
Show CPid # | |
Show CRLim # | |
Show CSocklen # | |
Show CSpeed # | |
Show CSsize # | |
Show CTcflag # | |
Show CTimer # | |
Show CUid # | |
Show Fd # | |
Show AnnLookup # | |
Show AnnTarget # | |
Show Bang # | |
Show BndrVis # | |
Show Body # | |
Show Bytes # | |
Show Callconv # | |
Show Clause # | |
Show Con # | |
Show Dec # | |
Show DecidedStrictness # | |
Show DerivClause # | |
Show DerivStrategy # | |
Show DocLoc # | |
Show Exp # | |
Show FamilyResultSig # | |
Show Fixity # | |
Show FixityDirection # | |
Show Foreign # | |
Show FunDep # | |
Show Guard # | |
Show Info # | |
Show InjectivityAnn # | |
Show Inline # | |
Show Lit # | |
Show Loc # | |
Show Match # | |
Show ModName # | |
Show Module # | |
Show ModuleInfo # | |
Show Name # | |
Show NameFlavour # | |
Show NameSpace # | |
Show NamespaceSpecifier # | |
Show OccName # | |
Show Overlap # | |
Show Pat # | |
Show PatSynArgs # | |
Show PatSynDir # | |
Show Phases # | |
Show PkgName # | |
Show Pragma # | |
Show Range # | |
Show Role # | |
Show RuleBndr # | |
Show RuleMatch # | |
Show Safety # | |
Show SourceStrictness # | |
Show SourceUnpackedness # | |
Show Specificity # | |
Show Stmt # | |
Show TyLit # | |
Show TySynEqn # | |
Show Type # | |
Show TypeFamilyHead # | |
Show Lexeme # | |
Show Number # | |
Show GeneralCategory # | |
Defined in GHC.Internal.Unicode showsPrec :: Int -> GeneralCategory -> ShowS # show :: GeneralCategory -> String # showList :: [GeneralCategory] -> ShowS # | |
Show Word16 # | |
Show Word32 # | |
Show Word64 # | |
Show Word8 # | |
Show Arch Source # | |
Show ArchOS Source # | |
Show ArmABI Source # | |
Show ArmISA Source # | |
Show ArmISAExt Source # | |
Show OS Source # | |
Show PPC_64ABI Source # | |
Show KindRep # | |
Show Module # | |
Show Ordering # | |
Show TrName # | |
Show TyCon # | |
Show TypeLitSort # | |
Defined in GHC.Internal.Show showsPrec :: Int -> TypeLitSort -> ShowS # show :: TypeLitSort -> String # showList :: [TypeLitSort] -> ShowS # | |
Show Program Source # | |
Show Endianness Source # | |
Defined in GHC.Toolchain.Target showsPrec :: Int -> Endianness -> ShowS # show :: Endianness -> String # showList :: [Endianness] -> ShowS # | |
Show Target Source # | Handwritten Show instance to have have better diffs against the toolchain targets generated by configure |
Show WordSize Source # | |
Show Ar Source # | |
Show Cc Source # | |
Show CmmCpp Source # | |
Show Cpp Source # | |
Show HsCpp Source # | |
Show JsCpp Source # | |
Show Cxx Source # | |
Show CcLink Source # | |
Show MergeObjs Source # | |
Show Nm Source # | |
Show Ranlib Source # | |
Show Readelf Source # | |
Show OsChar # | |
Show OsString # | |
Show PosixChar # | |
Show PosixString # | |
Defined in System.OsString.Internal.Types showsPrec :: Int -> PosixString -> ShowS # show :: PosixString -> String # showList :: [PosixString] -> ShowS # | |
Show WindowsChar # | |
Defined in System.OsString.Internal.Types showsPrec :: Int -> WindowsChar -> ShowS # show :: WindowsChar -> String # showList :: [WindowsChar] -> ShowS # | |
Show WindowsString # | |
Defined in System.OsString.Internal.Types showsPrec :: Int -> WindowsString -> ShowS # show :: WindowsString -> String # showList :: [WindowsString] -> ShowS # | |
Show Mode # | |
Show Style # | |
Show TextDetails # | |
Show Doc # | |
Show CmdSpec Source # | |
Show CreateProcess Source # | |
Defined in System.Process.Common showsPrec :: Int -> CreateProcess -> ShowS # show :: CreateProcess -> String # showList :: [CreateProcess] -> ShowS # | |
Show StdStream Source # | |
Show CommunicationHandle Source # | |
Defined in System.Process.CommunicationHandle.Internal showsPrec :: Int -> CommunicationHandle -> ShowS # show :: CommunicationHandle -> String # showList :: [CommunicationHandle] -> ShowS # | |
Show Decoding Source # | |
Show UnicodeException Source # | |
Defined in Data.Text.Encoding.Error showsPrec :: Int -> UnicodeException -> ShowS # show :: UnicodeException -> String # showList :: [UnicodeException] -> ShowS # | |
Show I8 Source # | |
Show Builder Source # | |
Show PartialUtf8CodePoint Source # | |
Show Utf8State Source # | |
Show DecoderState Source # | |
Defined in Data.Text.Internal.Encoding.Utf8 showsPrec :: Int -> DecoderState -> ShowS # show :: DecoderState -> String # showList :: [DecoderState] -> ShowS # | |
Show Size Source # | |
Show FPFormat Source # | |
Show Iter Source # | |
Show Month # | |
Show DayOfWeek # | |
Show DiffTime # | |
Show NominalDiffTime # | |
Show SystemTime # | |
Show LocalTime # | |
Show TimeOfDay # | |
Show TimeZone # | |
Show ZonedTime # | |
Show Integer # | |
Show Natural # | |
Show () # | |
Show Bool # | |
Show Char # | |
Show Int # | |
Show Levity # | |
Show RuntimeRep # | |
Defined in GHC.Internal.Show showsPrec :: Int -> RuntimeRep -> ShowS # show :: RuntimeRep -> String # showList :: [RuntimeRep] -> ShowS # | |
Show VecCount # | |
Show VecElem # | |
Show Word # | |
Show a => Show (Complex a) Source # | Since: base-2.1 |
Show a => Show (First a) Source # | Since: base-4.9.0.0 |
Show a => Show (Last a) Source # | Since: base-4.9.0.0 |
Show a => Show (Max a) Source # | Since: base-4.9.0.0 |
Show a => Show (Min a) Source # | Since: base-4.9.0.0 |
Show m => Show (WrappedMonoid m) Source # | Since: base-4.9.0.0 |
Defined in Data.Semigroup showsPrec :: Int -> WrappedMonoid m -> ShowS # show :: WrappedMonoid m -> String # showList :: [WrappedMonoid m] -> ShowS # | |
Show a => Show (IntMap a) # | |
Show a => Show (Seq a) # | |
Show a => Show (ViewL a) # | |
Show a => Show (ViewR a) # | |
Show a => Show (Intersection a) # | |
Show a => Show (Set a) # | |
Show a => Show (Tree a) # | |
Show a => Show (NonEmpty a) # | |
Show a => Show (ExceptionWithContext a) # | |
Defined in GHC.Internal.Exception.Type showsPrec :: Int -> ExceptionWithContext a -> ShowS # show :: ExceptionWithContext a -> String # showList :: [ExceptionWithContext a] -> ShowS # | |
Show e => Show (NoBacktrace e) # | |
Show p => Show (Par1 p) # | |
Show a => Show (Ratio a) # | |
Show flag => Show (TyVarBndr flag) # | |
Show a => Show (AnnotDetails a) # | |
Show (Doc a) # | |
Show a => Show (Span a) # | |
Show a => Show (Maybe a) # | |
Show a => Show (Solo a) # | |
Show a => Show [a] # | |
HasResolution a => Show (Fixed a) Source # | Since: base-2.1 |
(Show a, Show b) => Show (Arg a b) Source # | Since: base-4.9.0.0 |
(Show k, Show a) => Show (Map k a) # | |
(Show a, Show b) => Show (Either a b) # | |
Show (U1 p) # | |
Show (UAddr p) # | |
Show (V1 p) # | |
(Show1 f, Show a) => Show (Lift f a) Source # | |
(Show1 m, Show a) => Show (MaybeT m a) Source # | |
(Show a, Show b) => Show (a, b) # | |
Show (f p) => Show (Rec1 f p) # | |
Show (URec Char p) # | |
Show (URec Double p) # | |
Show (URec Float p) # | |
Show (URec Int p) # | |
Show (URec Word p) # | |
(Show1 f, Show a) => Show (Backwards f a) Source # | |
(Show e, Show1 m, Show a) => Show (ExceptT e m a) Source # | |
(Show1 f, Show a) => Show (IdentityT f a) Source # | |
(Show w, Show1 m, Show a) => Show (WriterT w m a) Source # | |
(Show w, Show1 m, Show a) => Show (WriterT w m a) Source # | |
Show a => Show (Constant a b) Source # | |
(Show1 f, Show a) => Show (Reverse f a) Source # | |
(Show a, Show b, Show c) => Show (a, b, c) # | |
(Show (f a), Show (g a)) => Show (Product f g a) Source # | Since: base-4.18.0.0 |
(Show (f a), Show (g a)) => Show (Sum f g a) Source # | Since: base-4.18.0.0 |
(Show (f p), Show (g p)) => Show ((f :*: g) p) # | |
(Show (f p), Show (g p)) => Show ((f :+: g) p) # | |
Show c => Show (K1 i c p) # | |
(Show a, Show b, Show c, Show d) => Show (a, b, c, d) # | |
Show (f (g a)) => Show (Compose f g a) Source # | Since: base-4.18.0.0 |
Show (f (g p)) => Show ((f :.: g) p) # | |
Show (f p) => Show (M1 i c f p) # | |
(Show a, Show b, Show c, Show d, Show e) => Show (a, b, c, d, e) # | |
(Show a, Show b, Show c, Show d, Show e, Show f) => Show (a, b, c, d, e, f) # | |
(Show a, Show b, Show c, Show d, Show e, Show f, Show g) => Show (a, b, c, d, e, f, g) # | |
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h) => Show (a, b, c, d, e, f, g, h) # | |
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i) => Show (a, b, c, d, e, f, g, h, i) # | |
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j) => Show (a, b, c, d, e, f, g, h, i, j) # | |
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k) => Show (a, b, c, d, e, f, g, h, i, j, k) # | |
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l) => Show (a, b, c, d, e, f, g, h, i, j, k, l) # | |
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m) # | |
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # | |
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n, Show o) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # | |
Instances
Eq ByteArray Source # | Since: base-4.17.0.0 |
Eq Timeout Source # | |
Eq ByteString # | |
Eq ByteString # | |
Eq ShortByteString # | |
Eq IntSet # | |
Eq BigNat # | |
Eq Void # | |
Eq ArithException # | |
Defined in GHC.Internal.Exception.Type (==) :: ArithException -> ArithException -> Bool # (/=) :: ArithException -> ArithException -> Bool # | |
Eq ForeignSrcLang # | |
Eq Associativity # | |
Defined in GHC.Internal.Generics (==) :: Associativity -> Associativity -> Bool # (/=) :: Associativity -> Associativity -> Bool # | |
Eq DecidedStrictness # | |
Defined in GHC.Internal.Generics (==) :: DecidedStrictness -> DecidedStrictness -> Bool # (/=) :: DecidedStrictness -> DecidedStrictness -> Bool # | |
Eq Fixity # | |
Eq SourceStrictness # | |
Defined in GHC.Internal.Generics (==) :: SourceStrictness -> SourceStrictness -> Bool # (/=) :: SourceStrictness -> SourceStrictness -> Bool # | |
Eq SourceUnpackedness # | |
Defined in GHC.Internal.Generics (==) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (/=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # | |
Eq MaskingState # | |
Defined in GHC.Internal.IO (==) :: MaskingState -> MaskingState -> Bool # (/=) :: MaskingState -> MaskingState -> Bool # | |
Eq ArrayException # | |
Defined in GHC.Internal.IO.Exception (==) :: ArrayException -> ArrayException -> Bool # (/=) :: ArrayException -> ArrayException -> Bool # | |
Eq AsyncException # | |
Defined in GHC.Internal.IO.Exception (==) :: AsyncException -> AsyncException -> Bool # (/=) :: AsyncException -> AsyncException -> Bool # | |
Eq ExitCode # | |
Eq IOErrorType # | |
Defined in GHC.Internal.IO.Exception (==) :: IOErrorType -> IOErrorType -> Bool # (/=) :: IOErrorType -> IOErrorType -> Bool # | |
Eq IOException # | |
Defined in GHC.Internal.IO.Exception (==) :: IOException -> IOException -> Bool # (/=) :: IOException -> IOException -> Bool # | |
Eq BufferMode # | |
Defined in GHC.Internal.IO.Handle.Types (==) :: BufferMode -> BufferMode -> Bool # (/=) :: BufferMode -> BufferMode -> Bool # | |
Eq Handle # | |
Eq Newline # | |
Eq NewlineMode # | |
Defined in GHC.Internal.IO.Handle.Types (==) :: NewlineMode -> NewlineMode -> Bool # (/=) :: NewlineMode -> NewlineMode -> Bool # | |
Eq Int16 # | |
Eq Int32 # | |
Eq Int64 # | |
Eq Int8 # | |
Eq Extension # | |
Eq SrcLoc # | |
Eq CBlkCnt # | |
Eq CBlkSize # | |
Eq CCc # | |
Eq CClockId # | |
Eq CDev # | |
Eq CFsBlkCnt # | |
Eq CFsFilCnt # | |
Eq CGid # | |
Eq CId # | |
Eq CIno # | |
Eq CKey # | |
Eq CMode # | |
Eq CNfds # | |
Eq CNlink # | |
Eq COff # | |
Eq CPid # | |
Eq CRLim # | |
Eq CSocklen # | |
Eq CSpeed # | |
Eq CSsize # | |
Eq CTcflag # | |
Eq CTimer # | |
Eq CUid # | |
Eq Fd # | |
Eq AnnLookup # | |
Eq AnnTarget # | |
Eq Bang # | |
Eq BndrVis # | |
Eq Body # | |
Eq Bytes # | |
Eq Callconv # | |
Eq Clause # | |
Eq Con # | |
Eq Dec # | |
Eq DecidedStrictness # | |
Eq DerivClause # | |
Eq DerivStrategy # | |
Eq DocLoc # | |
Eq Exp # | |
Eq FamilyResultSig # | |
Eq Fixity # | |
Eq FixityDirection # | |
Eq Foreign # | |
Eq FunDep # | |
Eq Guard # | |
Eq Info # | |
Eq InjectivityAnn # | |
Eq Inline # | |
Eq Lit # | |
Eq Loc # | |
Eq Match # | |
Eq ModName # | |
Eq Module # | |
Eq ModuleInfo # | |
Eq Name # | |
Eq NameFlavour # | |
Eq NameSpace # | |
Eq NamespaceSpecifier # | |
Eq OccName # | |
Eq Overlap # | |
Eq Pat # | |
Eq PatSynArgs # | |
Eq PatSynDir # | |
Eq Phases # | |
Eq PkgName # | |
Eq Pragma # | |
Eq Range # | |
Eq Role # | |
Eq RuleBndr # | |
Eq RuleMatch # | |
Eq Safety # | |
Eq SourceStrictness # | |
Eq SourceUnpackedness # | |
Eq Specificity # | |
Eq Stmt # | |
Eq TyLit # | |
Eq TySynEqn # | |
Eq Type # | |
Eq TypeFamilyHead # | |
Eq Lexeme # | |
Eq Number # | |
Eq GeneralCategory # | |
Defined in GHC.Internal.Unicode (==) :: GeneralCategory -> GeneralCategory -> Bool # (/=) :: GeneralCategory -> GeneralCategory -> Bool # | |
Eq Word16 # | |
Eq Word32 # | |
Eq Word64 # | |
Eq Word8 # | |
Eq Arch Source # | |
Eq ArchOS Source # | |
Eq ArmABI Source # | |
Eq ArmISA Source # | |
Eq ArmISAExt Source # | |
Eq OS Source # | |
Eq PPC_64ABI Source # | |
Eq Module # | |
Eq Ordering # | |
Eq TrName # | |
Eq TyCon # | |
Eq Program Source # | |
Eq Endianness Source # | |
Defined in GHC.Toolchain.Target (==) :: Endianness -> Endianness -> Bool # (/=) :: Endianness -> Endianness -> Bool # | |
Eq Target Source # | |
Eq WordSize Source # | |
Eq Ar Source # | |
Eq Cc Source # | |
Eq CmmCpp Source # | |
Eq Cpp Source # | |
Eq HsCpp Source # | |
Eq JsCpp Source # | |
Eq Cxx Source # | |
Eq CcLink Source # | |
Eq MergeObjs Source # | |
Eq Nm Source # | |
Eq Ranlib Source # | |
Eq OsChar # | |
Eq OsString # | |
Eq PosixChar # | |
Eq PosixString # | |
Defined in System.OsString.Internal.Types (==) :: PosixString -> PosixString -> Bool # (/=) :: PosixString -> PosixString -> Bool # | |
Eq WindowsChar # | |
Defined in System.OsString.Internal.Types (==) :: WindowsChar -> WindowsChar -> Bool # (/=) :: WindowsChar -> WindowsChar -> Bool # | |
Eq WindowsString # | |
Defined in System.OsString.Internal.Types (==) :: WindowsString -> WindowsString -> Bool # (/=) :: WindowsString -> WindowsString -> Bool # | |
Eq Mode # | |
Eq Style # | |
Eq TextDetails # | |
Eq Doc # | |
Eq CmdSpec Source # | |
Eq CreateProcess Source # | |
Defined in System.Process.Common (==) :: CreateProcess -> CreateProcess -> Bool # (/=) :: CreateProcess -> CreateProcess -> Bool # | |
Eq StdStream Source # | |
Eq CommunicationHandle Source # | |
Defined in System.Process.CommunicationHandle.Internal (==) :: CommunicationHandle -> CommunicationHandle -> Bool # (/=) :: CommunicationHandle -> CommunicationHandle -> Bool # | |
Eq UnicodeException Source # | |
Defined in Data.Text.Encoding.Error (==) :: UnicodeException -> UnicodeException -> Bool # (/=) :: UnicodeException -> UnicodeException -> Bool # | |
Eq I8 Source # | |
Eq Builder Source # | |
Eq PartialUtf8CodePoint Source # | |
Eq Utf8State Source # | |
Eq DecoderState Source # | |
Defined in Data.Text.Internal.Encoding.Utf8 (==) :: DecoderState -> DecoderState -> Bool # (/=) :: DecoderState -> DecoderState -> Bool # | |
Eq Size Source # | |
Eq CalendarDiffDays # | |
Eq Day # | |
Eq Month # | |
Eq DayOfWeek # | |
Eq DiffTime # | |
Eq NominalDiffTime # | |
Eq SystemTime # | |
Eq UTCTime # | |
Eq UniversalTime # | |
Eq CalendarDiffTime # | |
Eq LocalTime # | |
Eq TimeOfDay # | |
Eq TimeZone # | |
Eq Integer # | |
Eq Natural # | |
Eq () # | |
Eq Bool # | |
Eq Char # | |
Eq Double # | |
Eq Float # | |
Eq Int # | |
Eq Word # | |
Eq (Chan a) Source # | Since: base-4.4.0.0 |
Eq (MutableByteArray s) Source # | Since: base-4.17.0.0 |
Defined in Data.Array.Byte (==) :: MutableByteArray s -> MutableByteArray s -> Bool # (/=) :: MutableByteArray s -> MutableByteArray s -> Bool # | |
Eq a => Eq (Complex a) Source # | Since: base-2.1 |
Eq a => Eq (First a) Source # | Since: base-4.9.0.0 |
Eq a => Eq (Last a) Source # | Since: base-4.9.0.0 |
Eq a => Eq (Max a) Source # | Since: base-4.9.0.0 |
Eq a => Eq (Min a) Source # | Since: base-4.9.0.0 |
Eq m => Eq (WrappedMonoid m) Source # | Since: base-4.9.0.0 |
Defined in Data.Semigroup (==) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (/=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # | |
Eq a => Eq (IntMap a) # | |
Eq a => Eq (Seq a) # | |
Eq a => Eq (ViewL a) # | |
Eq a => Eq (ViewR a) # | |
Eq a => Eq (Intersection a) # | |
Eq a => Eq (Set a) # | |
Eq a => Eq (Tree a) # | |
Eq a => Eq (NonEmpty a) # | |
Eq p => Eq (Par1 p) # | |
Eq a => Eq (Ratio a) # | |
Eq flag => Eq (TyVarBndr flag) # | |
Eq a => Eq (AnnotDetails a) # | |
Eq (Doc a) # | |
Eq a => Eq (Span a) # | |
Eq a => Eq (Stream a) Source # | |
Eq a => Eq (Maybe a) # | |
Eq a => Eq (Solo a) # | |
Eq a => Eq [a] # | |
Eq (Fixed a) Source # | Since: base-2.1 |
Eq a => Eq (Arg a b) Source # | Note that
Since: base-4.9.0.0 |
(Eq k, Eq a) => Eq (Map k a) # | |
(Eq a, Eq b) => Eq (Either a b) # | |
Eq (U1 p) # | |
Eq (V1 p) # | |
(Eq1 f, Eq a) => Eq (Lift f a) Source # | |
(Eq1 m, Eq a) => Eq (MaybeT m a) Source # | |
(Eq a, Eq b) => Eq (a, b) # | |
(Generic1 f, Eq (Rep1 f a)) => Eq (Generically1 f a) # | |
Defined in GHC.Internal.Generics (==) :: Generically1 f a -> Generically1 f a -> Bool # (/=) :: Generically1 f a -> Generically1 f a -> Bool # | |
Eq (f p) => Eq (Rec1 f p) # | |
Eq (URec (Ptr ()) p) # | |
Eq (URec Char p) # | |
Eq (URec Double p) # | |
Eq (URec Float p) # | |
Eq (URec Int p) # | |
Eq (URec Word p) # | |
(Eq1 f, Eq a) => Eq (Backwards f a) Source # | |
(Eq e, Eq1 m, Eq a) => Eq (ExceptT e m a) Source # | |
(Eq1 f, Eq a) => Eq (IdentityT f a) Source # | |
(Eq w, Eq1 m, Eq a) => Eq (WriterT w m a) Source # | |
(Eq w, Eq1 m, Eq a) => Eq (WriterT w m a) Source # | |
Eq a => Eq (Constant a b) Source # | |
(Eq1 f, Eq a) => Eq (Reverse f a) Source # | |
(Eq a, Eq b, Eq c) => Eq (a, b, c) # | |
(Eq (f a), Eq (g a)) => Eq (Product f g a) Source # | Since: base-4.18.0.0 |
(Eq (f a), Eq (g a)) => Eq (Sum f g a) Source # | Since: base-4.18.0.0 |
(Eq (f p), Eq (g p)) => Eq ((f :*: g) p) # | |
(Eq (f p), Eq (g p)) => Eq ((f :+: g) p) # | |
Eq c => Eq (K1 i c p) # | |
(Eq a, Eq b, Eq c, Eq d) => Eq (a, b, c, d) # | |
Eq (f (g a)) => Eq (Compose f g a) Source # | Since: base-4.18.0.0 |
Eq (f (g p)) => Eq ((f :.: g) p) # | |
Eq (f p) => Eq (M1 i c f p) # | |
(Eq a, Eq b, Eq c, Eq d, Eq e) => Eq (a, b, c, d, e) # | |
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f) => Eq (a, b, c, d, e, f) # | |
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g) => Eq (a, b, c, d, e, f, g) # | |
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h) => Eq (a, b, c, d, e, f, g, h) # | |
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i) => Eq (a, b, c, d, e, f, g, h, i) # | |
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j) => Eq (a, b, c, d, e, f, g, h, i, j) # | |
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k) => Eq (a, b, c, d, e, f, g, h, i, j, k) # | |
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l) => Eq (a, b, c, d, e, f, g, h, i, j, k, l) # | |
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m) # | |
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # | |
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n, Eq o) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # | |
Instances
Ord ByteArray Source # | Non-lexicographic ordering. This compares the lengths of the byte arrays first and uses a lexicographic ordering if the lengths are equal. Subject to change between major versions. Since: base-4.17.0.0 |
Defined in Data.Array.Byte | |
Ord ByteString # | |
Defined in Data.ByteString.Internal.Type | |
Ord ByteString # | |
Defined in Data.ByteString.Lazy.Internal | |
Ord ShortByteString # | |
Defined in Data.ByteString.Short.Internal compare :: ShortByteString -> ShortByteString -> Ordering # (<) :: ShortByteString -> ShortByteString -> Bool # (<=) :: ShortByteString -> ShortByteString -> Bool # (>) :: ShortByteString -> ShortByteString -> Bool # (>=) :: ShortByteString -> ShortByteString -> Bool # max :: ShortByteString -> ShortByteString -> ShortByteString # min :: ShortByteString -> ShortByteString -> ShortByteString # | |
Ord IntSet # | |
Ord BigNat # | |
Ord Void # | |
Ord ArithException # | |
Defined in GHC.Internal.Exception.Type compare :: ArithException -> ArithException -> Ordering # (<) :: ArithException -> ArithException -> Bool # (<=) :: ArithException -> ArithException -> Bool # (>) :: ArithException -> ArithException -> Bool # (>=) :: ArithException -> ArithException -> Bool # max :: ArithException -> ArithException -> ArithException # min :: ArithException -> ArithException -> ArithException # | |
Ord Associativity # | |
Defined in GHC.Internal.Generics compare :: Associativity -> Associativity -> Ordering # (<) :: Associativity -> Associativity -> Bool # (<=) :: Associativity -> Associativity -> Bool # (>) :: Associativity -> Associativity -> Bool # (>=) :: Associativity -> Associativity -> Bool # max :: Associativity -> Associativity -> Associativity # min :: Associativity -> Associativity -> Associativity # | |
Ord DecidedStrictness # | |
Defined in GHC.Internal.Generics compare :: DecidedStrictness -> DecidedStrictness -> Ordering # (<) :: DecidedStrictness -> DecidedStrictness -> Bool # (<=) :: DecidedStrictness -> DecidedStrictness -> Bool # (>) :: DecidedStrictness -> DecidedStrictness -> Bool # (>=) :: DecidedStrictness -> DecidedStrictness -> Bool # max :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness # min :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness # | |
Ord Fixity # | |
Ord SourceStrictness # | |
Defined in GHC.Internal.Generics compare :: SourceStrictness -> SourceStrictness -> Ordering # (<) :: SourceStrictness -> SourceStrictness -> Bool # (<=) :: SourceStrictness -> SourceStrictness -> Bool # (>) :: SourceStrictness -> SourceStrictness -> Bool # (>=) :: SourceStrictness -> SourceStrictness -> Bool # max :: SourceStrictness -> SourceStrictness -> SourceStrictness # min :: SourceStrictness -> SourceStrictness -> SourceStrictness # | |
Ord SourceUnpackedness # | |
Defined in GHC.Internal.Generics compare :: SourceUnpackedness -> SourceUnpackedness -> Ordering # (<) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (<=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # max :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness # min :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness # | |
Ord ArrayException # | |
Defined in GHC.Internal.IO.Exception compare :: ArrayException -> ArrayException -> Ordering # (<) :: ArrayException -> ArrayException -> Bool # (<=) :: ArrayException -> ArrayException -> Bool # (>) :: ArrayException -> ArrayException -> Bool # (>=) :: ArrayException -> ArrayException -> Bool # max :: ArrayException -> ArrayException -> ArrayException # min :: ArrayException -> ArrayException -> ArrayException # | |
Ord AsyncException # | |
Defined in GHC.Internal.IO.Exception compare :: AsyncException -> AsyncException -> Ordering # (<) :: AsyncException -> AsyncException -> Bool # (<=) :: AsyncException -> AsyncException -> Bool # (>) :: AsyncException -> AsyncException -> Bool # (>=) :: AsyncException -> AsyncException -> Bool # max :: AsyncException -> AsyncException -> AsyncException # min :: AsyncException -> AsyncException -> AsyncException # | |
Ord ExitCode # | |
Defined in GHC.Internal.IO.Exception | |
Ord BufferMode # | |
Defined in GHC.Internal.IO.Handle.Types compare :: BufferMode -> BufferMode -> Ordering # (<) :: BufferMode -> BufferMode -> Bool # (<=) :: BufferMode -> BufferMode -> Bool # (>) :: BufferMode -> BufferMode -> Bool # (>=) :: BufferMode -> BufferMode -> Bool # max :: BufferMode -> BufferMode -> BufferMode # min :: BufferMode -> BufferMode -> BufferMode # | |
Ord Newline # | |
Defined in GHC.Internal.IO.Handle.Types | |
Ord NewlineMode # | |
Defined in GHC.Internal.IO.Handle.Types compare :: NewlineMode -> NewlineMode -> Ordering # (<) :: NewlineMode -> NewlineMode -> Bool # (<=) :: NewlineMode -> NewlineMode -> Bool # (>) :: NewlineMode -> NewlineMode -> Bool # (>=) :: NewlineMode -> NewlineMode -> Bool # max :: NewlineMode -> NewlineMode -> NewlineMode # min :: NewlineMode -> NewlineMode -> NewlineMode # | |
Ord Int16 # | |
Ord Int32 # | |
Ord Int64 # | |
Ord Int8 # | |
Ord Extension # | |
Defined in GHC.Internal.LanguageExtensions | |
Ord CBlkCnt # | |
Defined in GHC.Internal.System.Posix.Types | |
Ord CBlkSize # | |
Defined in GHC.Internal.System.Posix.Types | |
Ord CCc # | |
Ord CClockId # | |
Defined in GHC.Internal.System.Posix.Types | |
Ord CDev # | |
Ord CFsBlkCnt # | |
Defined in GHC.Internal.System.Posix.Types | |
Ord CFsFilCnt # | |
Defined in GHC.Internal.System.Posix.Types | |
Ord CGid # | |
Ord CId # | |
Ord CIno # | |
Ord CKey # | |
Ord CMode # | |
Ord CNfds # | |
Ord CNlink # | |
Ord COff # | |
Ord CPid # | |
Ord CRLim # | |
Ord CSocklen # | |
Defined in GHC.Internal.System.Posix.Types | |
Ord CSpeed # | |
Ord CSsize # | |
Ord CTcflag # | |
Defined in GHC.Internal.System.Posix.Types | |
Ord CTimer # | |
Ord CUid # | |
Ord Fd # | |
Ord AnnLookup # | |
Defined in GHC.Internal.TH.Syntax | |
Ord AnnTarget # | |
Defined in GHC.Internal.TH.Syntax | |
Ord Bang # | |
Ord BndrVis # | |
Ord Body # | |
Ord Bytes # | |
Ord Callconv # | |
Defined in GHC.Internal.TH.Syntax | |
Ord Clause # | |
Ord Con # | |
Ord Dec # | |
Ord DecidedStrictness # | |
Defined in GHC.Internal.TH.Syntax compare :: DecidedStrictness -> DecidedStrictness -> Ordering # (<) :: DecidedStrictness -> DecidedStrictness -> Bool # (<=) :: DecidedStrictness -> DecidedStrictness -> Bool # (>) :: DecidedStrictness -> DecidedStrictness -> Bool # (>=) :: DecidedStrictness -> DecidedStrictness -> Bool # max :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness # min :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness # | |
Ord DerivClause # | |
Defined in GHC.Internal.TH.Syntax | |
Ord DerivStrategy # | |
Defined in GHC.Internal.TH.Syntax compare :: DerivStrategy -> DerivStrategy -> Ordering # (<) :: DerivStrategy -> DerivStrategy -> Bool # (<=) :: DerivStrategy -> DerivStrategy -> Bool # (>) :: DerivStrategy -> DerivStrategy -> Bool # (>=) :: DerivStrategy -> DerivStrategy -> Bool # | |
Ord DocLoc # | |
Ord Exp # | |
Ord FamilyResultSig # | |
Defined in GHC.Internal.TH.Syntax compare :: FamilyResultSig -> FamilyResultSig -> Ordering # (<) :: FamilyResultSig -> FamilyResultSig -> Bool # (<=) :: FamilyResultSig -> FamilyResultSig -> Bool # (>) :: FamilyResultSig -> FamilyResultSig -> Bool # (>=) :: FamilyResultSig -> FamilyResultSig -> Bool # max :: FamilyResultSig -> FamilyResultSig -> FamilyResultSig # min :: FamilyResultSig -> FamilyResultSig -> FamilyResultSig # | |
Ord Fixity # | |
Ord FixityDirection # | |
Defined in GHC.Internal.TH.Syntax compare :: FixityDirection -> FixityDirection -> Ordering # (<) :: FixityDirection -> FixityDirection -> Bool # (<=) :: FixityDirection -> FixityDirection -> Bool # (>) :: FixityDirection -> FixityDirection -> Bool # (>=) :: FixityDirection -> FixityDirection -> Bool # max :: FixityDirection -> FixityDirection -> FixityDirection # min :: FixityDirection -> FixityDirection -> FixityDirection # | |
Ord Foreign # | |
Ord FunDep # | |
Ord Guard # | |
Ord Info # | |
Ord InjectivityAnn # | |
Defined in GHC.Internal.TH.Syntax compare :: InjectivityAnn -> InjectivityAnn -> Ordering # (<) :: InjectivityAnn -> InjectivityAnn -> Bool # (<=) :: InjectivityAnn -> InjectivityAnn -> Bool # (>) :: InjectivityAnn -> InjectivityAnn -> Bool # (>=) :: InjectivityAnn -> InjectivityAnn -> Bool # | |
Ord Inline # | |
Ord Lit # | |
Ord Loc # | |
Ord Match # | |
Ord ModName # | |
Ord Module # | |
Ord ModuleInfo # | |
Ord Name # | |
Ord NameFlavour # | |
Defined in GHC.Internal.TH.Syntax | |
Ord NameSpace # | |
Defined in GHC.Internal.TH.Syntax | |
Ord NamespaceSpecifier # | |
Defined in GHC.Internal.TH.Syntax compare :: NamespaceSpecifier -> NamespaceSpecifier -> Ordering # (<) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool # (<=) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool # (>) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool # (>=) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool # max :: NamespaceSpecifier -> NamespaceSpecifier -> NamespaceSpecifier # min :: NamespaceSpecifier -> NamespaceSpecifier -> NamespaceSpecifier # | |
Ord OccName # | |
Ord Overlap # | |
Ord Pat # | |
Ord PatSynArgs # | |
Ord PatSynDir # | |
Defined in GHC.Internal.TH.Syntax | |
Ord Phases # | |
Ord PkgName # | |
Ord Pragma # | |
Ord Range # | |
Ord Role # | |
Ord RuleBndr # | |
Defined in GHC.Internal.TH.Syntax | |
Ord RuleMatch # | |
Defined in GHC.Internal.TH.Syntax | |
Ord Safety # | |
Ord SourceStrictness # | |
Defined in GHC.Internal.TH.Syntax compare :: SourceStrictness -> SourceStrictness -> Ordering # (<) :: SourceStrictness -> SourceStrictness -> Bool # (<=) :: SourceStrictness -> SourceStrictness -> Bool # (>) :: SourceStrictness -> SourceStrictness -> Bool # (>=) :: SourceStrictness -> SourceStrictness -> Bool # max :: SourceStrictness -> SourceStrictness -> SourceStrictness # min :: SourceStrictness -> SourceStrictness -> SourceStrictness # | |
Ord SourceUnpackedness # | |
Defined in GHC.Internal.TH.Syntax compare :: SourceUnpackedness -> SourceUnpackedness -> Ordering # (<) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (<=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # max :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness # min :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness # | |
Ord Specificity # | |
Defined in GHC.Internal.TH.Syntax | |
Ord Stmt # | |
Ord TyLit # | |
Ord TySynEqn # | |
Defined in GHC.Internal.TH.Syntax | |
Ord Type # | |
Ord TypeFamilyHead # | |
Defined in GHC.Internal.TH.Syntax compare :: TypeFamilyHead -> TypeFamilyHead -> Ordering # (<) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (<=) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (>) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (>=) :: TypeFamilyHead -> TypeFamilyHead -> Bool # | |
Ord GeneralCategory # | |
Defined in GHC.Internal.Unicode compare :: GeneralCategory -> GeneralCategory -> Ordering # (<) :: GeneralCategory -> GeneralCategory -> Bool # (<=) :: GeneralCategory -> GeneralCategory -> Bool # (>) :: GeneralCategory -> GeneralCategory -> Bool # (>=) :: GeneralCategory -> GeneralCategory -> Bool # max :: GeneralCategory -> GeneralCategory -> GeneralCategory # min :: GeneralCategory -> GeneralCategory -> GeneralCategory # | |
Ord Word16 # | |
Ord Word32 # | |
Ord Word64 # | |
Ord Word8 # | |
Ord Arch Source # | |
Ord ArchOS Source # | |
Ord ArmABI Source # | |
Ord ArmISA Source # | |
Ord ArmISAExt Source # | |
Defined in GHC.Platform.ArchOS | |
Ord OS Source # | |
Ord PPC_64ABI Source # | |
Defined in GHC.Platform.ArchOS | |
Ord Ordering # | |
Defined in GHC.Classes | |
Ord TyCon # | |
Ord Program Source # | |
Ord Endianness Source # | |
Defined in GHC.Toolchain.Target compare :: Endianness -> Endianness -> Ordering # (<) :: Endianness -> Endianness -> Bool # (<=) :: Endianness -> Endianness -> Bool # (>) :: Endianness -> Endianness -> Bool # (>=) :: Endianness -> Endianness -> Bool # max :: Endianness -> Endianness -> Endianness # min :: Endianness -> Endianness -> Endianness # | |
Ord Target Source # | |
Ord WordSize Source # | |
Defined in GHC.Toolchain.Target | |
Ord Ar Source # | |
Ord Cc Source # | |
Ord CmmCpp Source # | |
Ord Cpp Source # | |
Ord HsCpp Source # | |
Ord JsCpp Source # | |
Ord Cxx Source # | |
Ord CcLink Source # | |
Ord MergeObjs Source # | |
Defined in GHC.Toolchain.Tools.MergeObjs | |
Ord Nm Source # | |
Ord Ranlib Source # | |
Ord OsChar # | |
Ord OsString # | |
Defined in System.OsString.Internal.Types | |
Ord PosixChar # | |
Defined in System.OsString.Internal.Types | |
Ord PosixString # | |
Defined in System.OsString.Internal.Types compare :: PosixString -> PosixString -> Ordering # (<) :: PosixString -> PosixString -> Bool # (<=) :: PosixString -> PosixString -> Bool # (>) :: PosixString -> PosixString -> Bool # (>=) :: PosixString -> PosixString -> Bool # max :: PosixString -> PosixString -> PosixString # min :: PosixString -> PosixString -> PosixString # | |
Ord WindowsChar # | |
Defined in System.OsString.Internal.Types compare :: WindowsChar -> WindowsChar -> Ordering # (<) :: WindowsChar -> WindowsChar -> Bool # (<=) :: WindowsChar -> WindowsChar -> Bool # (>) :: WindowsChar -> WindowsChar -> Bool # (>=) :: WindowsChar -> WindowsChar -> Bool # max :: WindowsChar -> WindowsChar -> WindowsChar # min :: WindowsChar -> WindowsChar -> WindowsChar # | |
Ord WindowsString # | |
Defined in System.OsString.Internal.Types compare :: WindowsString -> WindowsString -> Ordering # (<) :: WindowsString -> WindowsString -> Bool # (<=) :: WindowsString -> WindowsString -> Bool # (>) :: WindowsString -> WindowsString -> Bool # (>=) :: WindowsString -> WindowsString -> Bool # max :: WindowsString -> WindowsString -> WindowsString # min :: WindowsString -> WindowsString -> WindowsString # | |
Ord CommunicationHandle Source # | |
Defined in System.Process.CommunicationHandle.Internal compare :: CommunicationHandle -> CommunicationHandle -> Ordering # (<) :: CommunicationHandle -> CommunicationHandle -> Bool # (<=) :: CommunicationHandle -> CommunicationHandle -> Bool # (>) :: CommunicationHandle -> CommunicationHandle -> Bool # (>=) :: CommunicationHandle -> CommunicationHandle -> Bool # max :: CommunicationHandle -> CommunicationHandle -> CommunicationHandle # min :: CommunicationHandle -> CommunicationHandle -> CommunicationHandle # | |
Ord I8 Source # | |
Ord Builder Source # | |
Ord Day # | |
Ord Month # | |
Ord DayOfWeek # | |
Defined in Data.Time.Calendar.Week | |
Ord DiffTime # | |
Defined in Data.Time.Clock.Internal.DiffTime | |
Ord NominalDiffTime # | |
Defined in Data.Time.Clock.Internal.NominalDiffTime compare :: NominalDiffTime -> NominalDiffTime -> Ordering # (<) :: NominalDiffTime -> NominalDiffTime -> Bool # (<=) :: NominalDiffTime -> NominalDiffTime -> Bool # (>) :: NominalDiffTime -> NominalDiffTime -> Bool # (>=) :: NominalDiffTime -> NominalDiffTime -> Bool # max :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime # min :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime # | |
Ord SystemTime # | |
Defined in Data.Time.Clock.Internal.SystemTime | |
Ord UTCTime # | |
Defined in Data.Time.Clock.Internal.UTCTime | |
Ord UniversalTime # | |
Defined in Data.Time.Clock.Internal.UniversalTime compare :: UniversalTime -> UniversalTime -> Ordering # (<) :: UniversalTime -> UniversalTime -> Bool # (<=) :: UniversalTime -> UniversalTime -> Bool # (>) :: UniversalTime -> UniversalTime -> Bool # (>=) :: UniversalTime -> UniversalTime -> Bool # | |
Ord LocalTime # | |
Defined in Data.Time.LocalTime.Internal.LocalTime | |
Ord TimeOfDay # | |
Defined in Data.Time.LocalTime.Internal.TimeOfDay | |
Ord TimeZone # | |
Defined in Data.Time.LocalTime.Internal.TimeZone | |
Ord Integer # | |
Ord Natural # | |
Ord () # | |
Ord Bool # | |
Ord Char # | |
Ord Double # | |
Ord Float # | |
Ord Int # | |
Ord Word # | |
Ord a => Ord (First a) Source # | Since: base-4.9.0.0 |
Ord a => Ord (Last a) Source # | Since: base-4.9.0.0 |
Ord a => Ord (Max a) Source # | Since: base-4.9.0.0 |
Ord a => Ord (Min a) Source # | Since: base-4.9.0.0 |
Ord m => Ord (WrappedMonoid m) Source # | Since: base-4.9.0.0 |
Defined in Data.Semigroup compare :: WrappedMonoid m -> WrappedMonoid m -> Ordering # (<) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (<=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (>) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (>=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # max :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # min :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # | |
Ord a => Ord (IntMap a) # | |
Defined in Data.IntMap.Internal | |
Ord a => Ord (Seq a) # | |
Ord a => Ord (ViewL a) # | |
Ord a => Ord (ViewR a) # | |
Ord a => Ord (Intersection a) # | |
Defined in Data.Set.Internal compare :: Intersection a -> Intersection a -> Ordering # (<) :: Intersection a -> Intersection a -> Bool # (<=) :: Intersection a -> Intersection a -> Bool # (>) :: Intersection a -> Intersection a -> Bool # (>=) :: Intersection a -> Intersection a -> Bool # | |
Ord a => Ord (Set a) # | |
Ord a => Ord (Tree a) # | |
Ord a => Ord (NonEmpty a) # | |
Ord p => Ord (Par1 p) # | |
Integral a => Ord (Ratio a) # | |
Ord flag => Ord (TyVarBndr flag) # | |
Defined in GHC.Internal.TH.Syntax compare :: TyVarBndr flag -> TyVarBndr flag -> Ordering # (<) :: TyVarBndr flag -> TyVarBndr flag -> Bool # (<=) :: TyVarBndr flag -> TyVarBndr flag -> Bool # (>) :: TyVarBndr flag -> TyVarBndr flag -> Bool # (>=) :: TyVarBndr flag -> TyVarBndr flag -> Bool # | |
Ord a => Ord (Stream a) Source # | |
Defined in Data.Text.Internal.Fusion.Types | |
Ord a => Ord (Maybe a) # | |
Ord a => Ord (Solo a) # | |
Ord a => Ord [a] # | |
Ord (Fixed a) Source # | Since: base-2.1 |
Ord a => Ord (Arg a b) Source # | Note that Since: base-4.9.0.0 |
(Ord k, Ord v) => Ord (Map k v) # | |
(Ord a, Ord b) => Ord (Either a b) # | |
Ord (U1 p) # | |
Ord (V1 p) # | |
(Ord1 f, Ord a) => Ord (Lift f a) Source # | |
Defined in Control.Applicative.Lift | |
(Ord1 m, Ord a) => Ord (MaybeT m a) Source # | |
(Ord a, Ord b) => Ord (a, b) # | |
(Generic1 f, Ord (Rep1 f a)) => Ord (Generically1 f a) # | |
Defined in GHC.Internal.Generics compare :: Generically1 f a -> Generically1 f a -> Ordering # (<) :: Generically1 f a -> Generically1 f a -> Bool # (<=) :: Generically1 f a -> Generically1 f a -> Bool # (>) :: Generically1 f a -> Generically1 f a -> Bool # (>=) :: Generically1 f a -> Generically1 f a -> Bool # max :: Generically1 f a -> Generically1 f a -> Generically1 f a # min :: Generically1 f a -> Generically1 f a -> Generically1 f a # | |
Ord (f p) => Ord (Rec1 f p) # | |
Defined in GHC.Internal.Generics | |
Ord (URec (Ptr ()) p) # | |
Defined in GHC.Internal.Generics compare :: URec (Ptr ()) p -> URec (Ptr ()) p -> Ordering # (<) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (<=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (>) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (>=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # max :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p # min :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p # | |
Ord (URec Char p) # | |
Defined in GHC.Internal.Generics | |
Ord (URec Double p) # | |
Defined in GHC.Internal.Generics compare :: URec Double p -> URec Double p -> Ordering # (<) :: URec Double p -> URec Double p -> Bool # (<=) :: URec Double p -> URec Double p -> Bool # (>) :: URec Double p -> URec Double p -> Bool # (>=) :: URec Double p -> URec Double p -> Bool # | |
Ord (URec Float p) # | |
Defined in GHC.Internal.Generics | |
Ord (URec Int p) # | |
Ord (URec Word p) # | |
Defined in GHC.Internal.Generics | |
(Ord1 f, Ord a) => Ord (Backwards f a) Source # | |
Defined in Control.Applicative.Backwards compare :: Backwards f a -> Backwards f a -> Ordering # (<) :: Backwards f a -> Backwards f a -> Bool # (<=) :: Backwards f a -> Backwards f a -> Bool # (>) :: Backwards f a -> Backwards f a -> Bool # (>=) :: Backwards f a -> Backwards f a -> Bool # | |
(Ord e, Ord1 m, Ord a) => Ord (ExceptT e m a) Source # | |
Defined in Control.Monad.Trans.Except compare :: ExceptT e m a -> ExceptT e m a -> Ordering # (<) :: ExceptT e m a -> ExceptT e m a -> Bool # (<=) :: ExceptT e m a -> ExceptT e m a -> Bool # (>) :: ExceptT e m a -> ExceptT e m a -> Bool # (>=) :: ExceptT e m a -> ExceptT e m a -> Bool # | |
(Ord1 f, Ord a) => Ord (IdentityT f a) Source # | |
Defined in Control.Monad.Trans.Identity compare :: IdentityT f a -> IdentityT f a -> Ordering # (<) :: IdentityT f a -> IdentityT f a -> Bool # (<=) :: IdentityT f a -> IdentityT f a -> Bool # (>) :: IdentityT f a -> IdentityT f a -> Bool # (>=) :: IdentityT f a -> IdentityT f a -> Bool # | |
(Ord w, Ord1 m, Ord a) => Ord (WriterT w m a) Source # | |
Defined in Control.Monad.Trans.Writer.Lazy compare :: WriterT w m a -> WriterT w m a -> Ordering # (<) :: WriterT w m a -> WriterT w m a -> Bool # (<=) :: WriterT w m a -> WriterT w m a -> Bool # (>) :: WriterT w m a -> WriterT w m a -> Bool # (>=) :: WriterT w m a -> WriterT w m a -> Bool # | |
(Ord w, Ord1 m, Ord a) => Ord (WriterT w m a) Source # | |
Defined in Control.Monad.Trans.Writer.Strict compare :: WriterT w m a -> WriterT w m a -> Ordering # (<) :: WriterT w m a -> WriterT w m a -> Bool # (<=) :: WriterT w m a -> WriterT w m a -> Bool # (>) :: WriterT w m a -> WriterT w m a -> Bool # (>=) :: WriterT w m a -> WriterT w m a -> Bool # | |
Ord a => Ord (Constant a b) Source # | |
Defined in Data.Functor.Constant | |
(Ord1 f, Ord a) => Ord (Reverse f a) Source # | |
Defined in Data.Functor.Reverse | |
(Ord a, Ord b, Ord c) => Ord (a, b, c) # | |
Defined in GHC.Classes | |
(Ord (f a), Ord (g a)) => Ord (Product f g a) Source # | Since: base-4.18.0.0 |
Defined in Data.Functor.Product compare :: Product f g a -> Product f g a -> Ordering # (<) :: Product f g a -> Product f g a -> Bool # (<=) :: Product f g a -> Product f g a -> Bool # (>) :: Product f g a -> Product f g a -> Bool # (>=) :: Product f g a -> Product f g a -> Bool # | |
(Ord (f a), Ord (g a)) => Ord (Sum f g a) Source # | Since: base-4.18.0.0 |
Defined in Data.Functor.Sum | |
(Ord (f p), Ord (g p)) => Ord ((f :*: g) p) # | |
Defined in GHC.Internal.Generics | |
(Ord (f p), Ord (g p)) => Ord ((f :+: g) p) # | |
Defined in GHC.Internal.Generics | |
Ord c => Ord (K1 i c p) # | |
Defined in GHC.Internal.Generics | |
(Ord a, Ord b, Ord c, Ord d) => Ord (a, b, c, d) # | |
Defined in GHC.Classes | |
Ord (f (g a)) => Ord (Compose f g a) Source # | Since: base-4.18.0.0 |
Defined in Data.Functor.Compose compare :: Compose f g a -> Compose f g a -> Ordering # (<) :: Compose f g a -> Compose f g a -> Bool # (<=) :: Compose f g a -> Compose f g a -> Bool # (>) :: Compose f g a -> Compose f g a -> Bool # (>=) :: Compose f g a -> Compose f g a -> Bool # | |
Ord (f (g p)) => Ord ((f :.: g) p) # | |
Defined in GHC.Internal.Generics | |
Ord (f p) => Ord (M1 i c f p) # | |
(Ord a, Ord b, Ord c, Ord d, Ord e) => Ord (a, b, c, d, e) # | |
Defined in GHC.Classes compare :: (a, b, c, d, e) -> (a, b, c, d, e) -> Ordering # (<) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # (<=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # (>) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # (>=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # max :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) # min :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) # | |
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => Ord (a, b, c, d, e, f) # | |
Defined in GHC.Classes compare :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Ordering # (<) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # (<=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # (>) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # (>=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # max :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) # min :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) # | |
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => Ord (a, b, c, d, e, f, g) # | |
Defined in GHC.Classes compare :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Ordering # (<) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # (<=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # (>) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # (>=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # max :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) # min :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) # | |
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h) => Ord (a, b, c, d, e, f, g, h) # | |
Defined in GHC.Classes compare :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Ordering # (<) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # (<=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # (>) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # (>=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # max :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) # min :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) # | |
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i) => Ord (a, b, c, d, e, f, g, h, i) # | |
Defined in GHC.Classes compare :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # max :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) # min :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) # | |
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j) => Ord (a, b, c, d, e, f, g, h, i, j) # | |
Defined in GHC.Classes compare :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) # min :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) # | |
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k) => Ord (a, b, c, d, e, f, g, h, i, j, k) # | |
Defined in GHC.Classes compare :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) # min :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) # | |
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l) => Ord (a, b, c, d, e, f, g, h, i, j, k, l) # | |
Defined in GHC.Classes compare :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) # min :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) # | |
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m) # | |
Defined in GHC.Classes compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) # min :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) # | |
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m, Ord n) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # | |
Defined in GHC.Classes compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # min :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # | |
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m, Ord n, Ord o) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # | |
Defined in GHC.Classes compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # min :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # |
Instances
Alternative IO # | |
Applicative IO # | |
Functor IO # | |
Monad IO # | |
MonadPlus IO # | |
MonadFail IO # | |
Defined in GHC.Internal.Control.Monad.Fail | |
MonadIO IO # | |
Defined in GHC.Internal.Control.Monad.IO.Class | |
Quasi IO # | |
Defined in GHC.Internal.TH.Syntax qReport :: Bool -> String -> IO () qRecover :: IO a -> IO a -> IO a qLookupName :: Bool -> String -> IO (Maybe Name) qReifyFixity :: Name -> IO (Maybe Fixity) qReifyType :: Name -> IO Type qReifyInstances :: Name -> [Type] -> IO [Dec] qReifyRoles :: Name -> IO [Role] qReifyAnnotations :: Data a => AnnLookup -> IO [a] qReifyModule :: Module -> IO ModuleInfo qReifyConStrictness :: Name -> IO [DecidedStrictness] qGetPackageRoot :: IO FilePath qAddDependentFile :: FilePath -> IO () qAddTempFile :: String -> IO FilePath qAddTopDecls :: [Dec] -> IO () qAddForeignFilePath :: ForeignSrcLang -> String -> IO () qAddModFinalizer :: Q () -> IO () qAddCorePlugin :: String -> IO () qGetQ :: Typeable a => IO (Maybe a) qPutQ :: Typeable a => a -> IO () qIsExtEnabled :: Extension -> IO Bool qExtsEnabled :: IO [Extension] | |
Quote IO # | |
Defined in GHC.Internal.TH.Syntax | |
a ~ () => HPrintfType (IO a) Source # | Since: base-4.7.0.0 |
Defined in Text.Printf | |
a ~ () => PrintfType (IO a) Source # | Since: base-4.7.0.0 |
Defined in Text.Printf | |
Monoid a => Monoid (IO a) # | |
Semigroup a => Semigroup (IO a) # | |
Instances
NFData Ordering # | |
Defined in Control.DeepSeq | |
Monoid Ordering # | |
Semigroup Ordering # | |
Bounded Ordering # | |
Enum Ordering # | |
Generic Ordering # | |
Defined in GHC.Internal.Generics | |
Read Ordering # | |
Show Ordering # | |
Eq Ordering # | |
Ord Ordering # | |
Defined in GHC.Classes | |
type Rep Ordering # | |
Instances
PrintfArg Integer Source # | Since: base-2.1 |
Defined in Text.Printf formatArg :: Integer -> FieldFormatter Source # parseFormat :: Integer -> ModifierParser Source # | |
NFData Integer # | |
Defined in Control.DeepSeq | |
Enum Integer # | |
Num Integer # | |
Read Integer # | |
Integral Integer # | |
Defined in GHC.Internal.Real | |
Real Integer # | |
Defined in GHC.Internal.Real toRational :: Integer -> Rational # | |
Show Integer # | |
Eq Integer # | |
Ord Integer # | |
Instances
Eq1 Maybe Source # | Since: base-4.9.0.0 | ||||
Ord1 Maybe Source # | Since: base-4.9.0.0 | ||||
Defined in Data.Functor.Classes | |||||
Read1 Maybe Source # | Since: base-4.9.0.0 | ||||
Defined in Data.Functor.Classes liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Maybe a) Source # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Maybe a] Source # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Maybe a) Source # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Maybe a] Source # | |||||
Show1 Maybe Source # | Since: base-4.9.0.0 | ||||
NFData1 Maybe # | |||||
Defined in Control.DeepSeq | |||||
Alternative Maybe # | |||||
Applicative Maybe # | |||||
Functor Maybe # | |||||
Monad Maybe # | |||||
MonadPlus Maybe # | |||||
MonadFail Maybe # | |||||
Defined in GHC.Internal.Control.Monad.Fail | |||||
Foldable Maybe # | |||||
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldMap' :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # | |||||
Traversable Maybe # | |||||
Generic1 Maybe # | |||||
Defined in GHC.Internal.Generics
| |||||
NFData a => NFData (Maybe a) # | |||||
Defined in Control.DeepSeq | |||||
Semigroup a => Monoid (Maybe a) # | |||||
Semigroup a => Semigroup (Maybe a) # | |||||
Generic (Maybe a) # | |||||
Defined in GHC.Internal.Generics
| |||||
SingKind a => SingKind (Maybe a) # | |||||
Defined in GHC.Internal.Generics
| |||||
Read a => Read (Maybe a) # | |||||
Show a => Show (Maybe a) # | |||||
Eq a => Eq (Maybe a) # | |||||
Ord a => Ord (Maybe a) # | |||||
SingI ('Nothing :: Maybe a) # | |||||
Defined in GHC.Internal.Generics | |||||
SingI a2 => SingI ('Just a2 :: Maybe a1) # | |||||
Defined in GHC.Internal.Generics | |||||
type Rep1 Maybe # | |||||
Defined in GHC.Internal.Generics | |||||
type DemoteRep (Maybe a) # | |||||
Defined in GHC.Internal.Generics | |||||
type Rep (Maybe a) # | |||||
Defined in GHC.Internal.Generics | |||||
data Sing (b :: Maybe a) # | |||||
Instances
NFData Bool # | |||||
Defined in Control.DeepSeq | |||||
Bounded Bool # | |||||
Enum Bool # | |||||
Generic Bool # | |||||
Defined in GHC.Internal.Generics | |||||
SingKind Bool # | |||||
Defined in GHC.Internal.Generics
| |||||
Read Bool # | |||||
Show Bool # | |||||
Eq Bool # | |||||
Ord Bool # | |||||
SingI 'False # | |||||
Defined in GHC.Internal.Generics | |||||
SingI 'True # | |||||
Defined in GHC.Internal.Generics | |||||
type DemoteRep Bool # | |||||
Defined in GHC.Internal.Generics | |||||
type Rep Bool # | |||||
data Sing (a :: Bool) # | |||||
Instances
IsChar Char Source # | Since: base-2.1 | ||||
PrintfArg Char Source # | Since: base-2.1 | ||||
Defined in Text.Printf formatArg :: Char -> FieldFormatter Source # parseFormat :: Char -> ModifierParser Source # | |||||
NFData Char # | |||||
Defined in Control.DeepSeq | |||||
Bounded Char # | |||||
Enum Char # | |||||
Read Char # | |||||
Show Char # | |||||
Eq Char # | |||||
Ord Char # | |||||
Generic1 (URec Char :: k -> Type) # | |||||
Defined in GHC.Internal.Generics
| |||||
Eq1 (UChar :: Type -> Type) Source # | Since: base-4.21.0.0 | ||||
Ord1 (UChar :: Type -> Type) Source # | Since: base-4.21.0.0 | ||||
Defined in Data.Functor.Classes | |||||
Show1 (UChar :: Type -> Type) Source # | Since: base-4.21.0.0 | ||||
Foldable (UChar :: Type -> Type) # | |||||
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => UChar m -> m # foldMap :: Monoid m => (a -> m) -> UChar a -> m # foldMap' :: Monoid m => (a -> m) -> UChar a -> m # foldr :: (a -> b -> b) -> b -> UChar a -> b # foldr' :: (a -> b -> b) -> b -> UChar a -> b # foldl :: (b -> a -> b) -> b -> UChar a -> b # foldl' :: (b -> a -> b) -> b -> UChar a -> b # foldr1 :: (a -> a -> a) -> UChar a -> a # foldl1 :: (a -> a -> a) -> UChar a -> a # elem :: Eq a => a -> UChar a -> Bool # maximum :: Ord a => UChar a -> a # minimum :: Ord a => UChar a -> a # | |||||
Traversable (UChar :: Type -> Type) # | |||||
Functor (URec Char :: Type -> Type) # | |||||
Generic (URec Char p) # | |||||
Defined in GHC.Internal.Generics
| |||||
Show (URec Char p) # | |||||
Eq (URec Char p) # | |||||
Ord (URec Char p) # | |||||
Defined in GHC.Internal.Generics | |||||
data URec Char (p :: k) # | |||||
type Rep1 (URec Char :: k -> Type) # | |||||
Defined in GHC.Internal.Generics | |||||
type Rep (URec Char p) # | |||||
Defined in GHC.Internal.Generics |
Instances
PrintfArg Double Source # | Since: base-2.1 | ||||
Defined in Text.Printf formatArg :: Double -> FieldFormatter Source # parseFormat :: Double -> ModifierParser Source # | |||||
NFData Double # | |||||
Defined in Control.DeepSeq | |||||
Floating Double # | |||||
RealFloat Double # | |||||
Defined in GHC.Internal.Float floatRadix :: Double -> Integer # floatDigits :: Double -> Int # floatRange :: Double -> (Int, Int) # decodeFloat :: Double -> (Integer, Int) # encodeFloat :: Integer -> Int -> Double # significand :: Double -> Double # scaleFloat :: Int -> Double -> Double # isInfinite :: Double -> Bool # isDenormalized :: Double -> Bool # isNegativeZero :: Double -> Bool # | |||||
Read Double # | |||||
Eq Double # | |||||
Ord Double # | |||||
Generic1 (URec Double :: k -> Type) # | |||||
Defined in GHC.Internal.Generics
| |||||
Eq1 (UDouble :: Type -> Type) Source # | Since: base-4.21.0.0 | ||||
Ord1 (UDouble :: Type -> Type) Source # | Since: base-4.21.0.0 | ||||
Defined in Data.Functor.Classes | |||||
Show1 (UDouble :: Type -> Type) Source # | Since: base-4.21.0.0 | ||||
Foldable (UDouble :: Type -> Type) # | |||||
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => UDouble m -> m # foldMap :: Monoid m => (a -> m) -> UDouble a -> m # foldMap' :: Monoid m => (a -> m) -> UDouble a -> m # foldr :: (a -> b -> b) -> b -> UDouble a -> b # foldr' :: (a -> b -> b) -> b -> UDouble a -> b # foldl :: (b -> a -> b) -> b -> UDouble a -> b # foldl' :: (b -> a -> b) -> b -> UDouble a -> b # foldr1 :: (a -> a -> a) -> UDouble a -> a # foldl1 :: (a -> a -> a) -> UDouble a -> a # elem :: Eq a => a -> UDouble a -> Bool # maximum :: Ord a => UDouble a -> a # minimum :: Ord a => UDouble a -> a # | |||||
Traversable (UDouble :: Type -> Type) # | |||||
Functor (URec Double :: Type -> Type) # | |||||
Generic (URec Double p) # | |||||
Defined in GHC.Internal.Generics
| |||||
Show (URec Double p) # | |||||
Eq (URec Double p) # | |||||
Ord (URec Double p) # | |||||
Defined in GHC.Internal.Generics compare :: URec Double p -> URec Double p -> Ordering # (<) :: URec Double p -> URec Double p -> Bool # (<=) :: URec Double p -> URec Double p -> Bool # (>) :: URec Double p -> URec Double p -> Bool # (>=) :: URec Double p -> URec Double p -> Bool # | |||||
data URec Double (p :: k) # | |||||
type Rep1 (URec Double :: k -> Type) # | |||||
Defined in GHC.Internal.Generics | |||||
type Rep (URec Double p) # | |||||
Defined in GHC.Internal.Generics |
Instances
PrintfArg Float Source # | Since: base-2.1 | ||||
Defined in Text.Printf formatArg :: Float -> FieldFormatter Source # parseFormat :: Float -> ModifierParser Source # | |||||
NFData Float # | |||||
Defined in Control.DeepSeq | |||||
Floating Float # | |||||
RealFloat Float # | |||||
Defined in GHC.Internal.Float floatRadix :: Float -> Integer # floatDigits :: Float -> Int # floatRange :: Float -> (Int, Int) # decodeFloat :: Float -> (Integer, Int) # encodeFloat :: Integer -> Int -> Float # significand :: Float -> Float # scaleFloat :: Int -> Float -> Float # isInfinite :: Float -> Bool # isDenormalized :: Float -> Bool # isNegativeZero :: Float -> Bool # | |||||
Read Float # | |||||
Eq Float # | |||||
Ord Float # | |||||
Generic1 (URec Float :: k -> Type) # | |||||
Defined in GHC.Internal.Generics
| |||||
Eq1 (UFloat :: Type -> Type) Source # | Since: base-4.21.0.0 | ||||
Ord1 (UFloat :: Type -> Type) Source # | Since: base-4.21.0.0 | ||||
Defined in Data.Functor.Classes | |||||
Show1 (UFloat :: Type -> Type) Source # | Since: base-4.21.0.0 | ||||
Foldable (UFloat :: Type -> Type) # | |||||
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => UFloat m -> m # foldMap :: Monoid m => (a -> m) -> UFloat a -> m # foldMap' :: Monoid m => (a -> m) -> UFloat a -> m # foldr :: (a -> b -> b) -> b -> UFloat a -> b # foldr' :: (a -> b -> b) -> b -> UFloat a -> b # foldl :: (b -> a -> b) -> b -> UFloat a -> b # foldl' :: (b -> a -> b) -> b -> UFloat a -> b # foldr1 :: (a -> a -> a) -> UFloat a -> a # foldl1 :: (a -> a -> a) -> UFloat a -> a # elem :: Eq a => a -> UFloat a -> Bool # maximum :: Ord a => UFloat a -> a # minimum :: Ord a => UFloat a -> a # | |||||
Traversable (UFloat :: Type -> Type) # | |||||
Functor (URec Float :: Type -> Type) # | |||||
Generic (URec Float p) # | |||||
Defined in GHC.Internal.Generics
| |||||
Show (URec Float p) # | |||||
Eq (URec Float p) # | |||||
Ord (URec Float p) # | |||||
Defined in GHC.Internal.Generics | |||||
data URec Float (p :: k) # | |||||
type Rep1 (URec Float :: k -> Type) # | |||||
Defined in GHC.Internal.Generics | |||||
type Rep (URec Float p) # | |||||
Defined in GHC.Internal.Generics |
Instances
PrintfArg Int Source # | Since: base-2.1 | ||||
Defined in Text.Printf formatArg :: Int -> FieldFormatter Source # parseFormat :: Int -> ModifierParser Source # | |||||
NFData Int # | |||||
Defined in Control.DeepSeq | |||||
Bounded Int # | |||||
Enum Int # | |||||
Num Int # | |||||
Read Int # | |||||
Integral Int # | |||||
Real Int # | |||||
Defined in GHC.Internal.Real toRational :: Int -> Rational # | |||||
Show Int # | |||||
Eq Int # | |||||
Ord Int # | |||||
Generic1 (URec Int :: k -> Type) # | |||||
Defined in GHC.Internal.Generics
| |||||
Eq1 (UInt :: Type -> Type) Source # | Since: base-4.21.0.0 | ||||
Ord1 (UInt :: Type -> Type) Source # | Since: base-4.21.0.0 | ||||
Defined in Data.Functor.Classes | |||||
Show1 (UInt :: Type -> Type) Source # | Since: base-4.21.0.0 | ||||
Foldable (UInt :: Type -> Type) # | |||||
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => UInt m -> m # foldMap :: Monoid m => (a -> m) -> UInt a -> m # foldMap' :: Monoid m => (a -> m) -> UInt a -> m # foldr :: (a -> b -> b) -> b -> UInt a -> b # foldr' :: (a -> b -> b) -> b -> UInt a -> b # foldl :: (b -> a -> b) -> b -> UInt a -> b # foldl' :: (b -> a -> b) -> b -> UInt a -> b # foldr1 :: (a -> a -> a) -> UInt a -> a # foldl1 :: (a -> a -> a) -> UInt a -> a # elem :: Eq a => a -> UInt a -> Bool # maximum :: Ord a => UInt a -> a # | |||||
Traversable (UInt :: Type -> Type) # | |||||
Functor (URec Int :: Type -> Type) # | |||||
Generic (URec Int p) # | |||||
Defined in GHC.Internal.Generics
| |||||
Show (URec Int p) # | |||||
Eq (URec Int p) # | |||||
Ord (URec Int p) # | |||||
data URec Int (p :: k) # | |||||
type Rep1 (URec Int :: k -> Type) # | |||||
Defined in GHC.Internal.Generics | |||||
type Rep (URec Int p) # | |||||
Defined in GHC.Internal.Generics |
Instances
PrintfArg Word Source # | Since: base-2.1 | ||||
Defined in Text.Printf formatArg :: Word -> FieldFormatter Source # parseFormat :: Word -> ModifierParser Source # | |||||
NFData Word # | |||||
Defined in Control.DeepSeq | |||||
Bounded Word # | |||||
Enum Word # | |||||
Num Word # | |||||
Read Word # | |||||
Integral Word # | |||||
Real Word # | |||||
Defined in GHC.Internal.Real toRational :: Word -> Rational # | |||||
Show Word # | |||||
Eq Word # | |||||
Ord Word # | |||||
Generic1 (URec Word :: k -> Type) # | |||||
Defined in GHC.Internal.Generics
| |||||
Eq1 (UWord :: Type -> Type) Source # | Since: base-4.21.0.0 | ||||
Ord1 (UWord :: Type -> Type) Source # | Since: base-4.21.0.0 | ||||
Defined in Data.Functor.Classes | |||||
Show1 (UWord :: Type -> Type) Source # | Since: base-4.21.0.0 | ||||
Foldable (UWord :: Type -> Type) # | |||||
Defined in GHC.Internal.Data.Foldable fold :: Monoid m => UWord m -> m # foldMap :: Monoid m => (a -> m) -> UWord a -> m # foldMap' :: Monoid m => (a -> m) -> UWord a -> m # foldr :: (a -> b -> b) -> b -> UWord a -> b # foldr' :: (a -> b -> b) -> b -> UWord a -> b # foldl :: (b -> a -> b) -> b -> UWord a -> b # foldl' :: (b -> a -> b) -> b -> UWord a -> b # foldr1 :: (a -> a -> a) -> UWord a -> a # foldl1 :: (a -> a -> a) -> UWord a -> a # elem :: Eq a => a -> UWord a -> Bool # maximum :: Ord a => UWord a -> a # minimum :: Ord a => UWord a -> a # | |||||
Traversable (UWord :: Type -> Type) # | |||||
Functor (URec Word :: Type -> Type) # | |||||
Generic (URec Word p) # | |||||
Defined in GHC.Internal.Generics
| |||||
Show (URec Word p) # | |||||
Eq (URec Word p) # | |||||
Ord (URec Word p) # | |||||
Defined in GHC.Internal.Generics | |||||
data URec Word (p :: k) # | |||||
type Rep1 (URec Word :: k -> Type) # | |||||
Defined in GHC.Internal.Generics | |||||
type Rep (URec Word p) # | |||||
Defined in GHC.Internal.Generics |
(<|>) :: Alternative f => f a -> f a -> f a #