LambdaHack-0.11.0.1: A game engine library for tactical squad ASCII roguelike dungeon crawlers

Safe Haskell | None
Language | Haskell2010

Game.LambdaHack.Core.Prelude

Contents

- Orphan instances

Description

Custom Prelude, compatible across many GHC versions.

Synopsis

- data Int
- data Integer
- data Double
- data Float
- data Maybe a
  - = Nothing
  - | Just a
- class Show a where
  - showsPrec :: Int -> a -> ShowS
  - show :: a -> String
  - showList :: [a] -> ShowS
- class Bounded a where
  - minBound :: a
  - maxBound :: a
- class Enum a where
  - succ :: a -> a
  - pred :: a -> a
  - toEnum :: Int -> a
  - fromEnum :: a -> Int
  - enumFrom :: a -> [a]
  - enumFromThen :: a -> a -> [a]
  - enumFromTo :: a -> a -> [a]
  - enumFromThenTo :: a -> a -> a -> [a]
- class (Real a, Fractional a) => RealFrac a where
  - properFraction :: Integral b => a -> (b, a)
  - truncate :: Integral b => a -> b
  - round :: Integral b => a -> b
  - ceiling :: Integral b => a -> b
  - floor :: Integral b => a -> b
- class (Real a, Enum a) => Integral a where
  - quot :: a -> a -> a
  - rem :: a -> a -> a
  - div :: a -> a -> a
  - mod :: a -> a -> a
  - quotRem :: a -> a -> (a, a)
  - divMod :: a -> a -> (a, a)
  - toInteger :: a -> Integer
- class Read a where
  - readsPrec :: Int -> ReadS a
  - readList :: ReadS [a]
- data Bool
  - = False
  - | True
- data IO a
- class Eq a where
  - (==) :: a -> a -> Bool
  - (/=) :: a -> a -> Bool
- class Eq a => Ord a where
  - compare :: a -> a -> Ordering
  - (<) :: a -> a -> Bool
  - (<=) :: a -> a -> Bool
  - (>) :: a -> a -> Bool
  - (>=) :: a -> a -> Bool
  - max :: a -> a -> a
  - min :: a -> a -> a
- type String = [Char]
- data Char
- data Word
- data Ordering
  - = LT
  - | EQ
  - | GT
- class a ~# b => (a :: k) ~ (b :: k)
- realToFrac :: (Real a, Fractional b) => a -> b
- class (Num a, Ord a) => Real a where
  - toRational :: a -> Rational
- class Num a => Fractional a where
  - (/) :: a -> a -> a
  - recip :: a -> a
  - fromRational :: Rational -> a
- type Rational = Ratio Integer
- ($) :: (a -> b) -> a -> b
- otherwise :: Bool
- (++) :: [a] -> [a] -> [a]
- 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
  - foldr1 :: (a -> a -> a) -> t a -> a
  - elem :: Eq a => a -> t a -> Bool
  - maximum :: Ord a => t a -> a
  - minimum :: Ord a => t a -> a
  - product :: Num a => t a -> a
- map :: (a -> b) -> [a] -> [b]
- class Applicative m => Monad (m :: Type -> Type) where
  - (>>=) :: m a -> (a -> m b) -> m b
  - (>>) :: m a -> m b -> m b
  - return :: a -> m a
- class Functor (f :: Type -> Type) where
  - fmap :: (a -> b) -> f a -> f b
  - (<$) :: a -> f b -> f a
- class Functor f => Applicative (f :: Type -> Type) where
  - pure :: a -> f a
  - (<*>) :: f (a -> b) -> f a -> f b
  - liftA2 :: (a -> b -> c) -> f a -> f b -> f c
  - (*>) :: f a -> f b -> f b
  - (<*) :: f a -> f b -> f a
- class Semigroup a => Monoid a where
  - mempty :: a
  - mappend :: a -> a -> a
  - mconcat :: [a] -> a
- class Semigroup a where
  - (<>) :: a -> a -> a
- all :: Foldable t => (a -> Bool) -> t a -> Bool
- error :: HasCallStack => [Char] -> 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)
  - mapM :: Monad m => (a -> m b) -> t a -> m (t b)
  - sequence :: Monad m => t (m a) -> m (t a)
- cycle :: HasCallStack => [a] -> [a]
- const :: a -> b -> a
- seq :: a -> b -> b
- concat :: Foldable t => t [a] -> [a]
- filter :: (a -> Bool) -> [a] -> [a]
- zip :: [a] -> [b] -> [(a, b)]
- print :: Show a => a -> IO ()
- class Num a where
  - (+) :: a -> a -> a
  - (-) :: a -> a -> a
  - (*) :: a -> a -> a
  - negate :: a -> a
  - abs :: a -> a
  - signum :: a -> a
  - fromInteger :: Integer -> a
- class Monad m => MonadFail (m :: Type -> Type) where
  - fail :: String -> m a
- class Fractional a => Floating a where
  - pi :: a
  - exp :: a -> a
  - log :: a -> a
  - sqrt :: a -> a
  - (**) :: a -> a -> a
  - logBase :: a -> a -> a
  - sin :: a -> a
  - cos :: a -> a
  - tan :: a -> a
  - asin :: a -> a
  - acos :: a -> a
  - atan :: a -> a
  - sinh :: a -> a
  - cosh :: a -> a
  - tanh :: a -> a
  - asinh :: a -> a
  - acosh :: a -> a
  - atanh :: a -> a
- class (RealFrac a, Floating a) => RealFloat a where
  - floatRadix :: a -> Integer
  - floatDigits :: a -> Int
  - floatRange :: a -> (Int, Int)
  - decodeFloat :: a -> (Integer, Int)
  - encodeFloat :: Integer -> Int -> a
  - exponent :: a -> Int
  - significand :: a -> a
  - scaleFloat :: Int -> a -> a
  - isNaN :: a -> Bool
  - isInfinite :: a -> Bool
  - isDenormalized :: a -> Bool
  - isNegativeZero :: a -> Bool
  - isIEEE :: a -> Bool
  - atan2 :: a -> a -> a
- data Either a b
  - = Left a
  - | Right b
- (^) :: (Num a, Integral b) => a -> b -> a
- (&&) :: Bool -> Bool -> Bool
- (||) :: Bool -> Bool -> Bool
- not :: Bool -> Bool
- fst :: (a, b) -> a
- snd :: (a, b) -> b
- curry :: ((a, b) -> c) -> a -> b -> c
- uncurry :: (a -> b -> c) -> (a, b) -> c
- errorWithoutStackTrace :: [Char] -> a
- undefined :: HasCallStack => a
- (=<<) :: Monad m => (a -> m b) -> m a -> m b
- id :: a -> a
- (.) :: (b -> c) -> (a -> b) -> a -> c
- flip :: (a -> b -> c) -> b -> a -> c
- ($!) :: (a -> b) -> a -> b
- until :: (a -> Bool) -> (a -> a) -> a -> a
- asTypeOf :: a -> a -> a
- subtract :: Num a => a -> a -> a
- maybe :: b -> (a -> b) -> Maybe a -> b
- head :: HasCallStack => [a] -> a
- tail :: HasCallStack => [a] -> [a]
- last :: HasCallStack => [a] -> a
- init :: HasCallStack => [a] -> [a]
- scanl :: (b -> a -> b) -> b -> [a] -> [b]
- scanl1 :: (a -> a -> a) -> [a] -> [a]
- scanr :: (a -> b -> b) -> b -> [a] -> [b]
- scanr1 :: (a -> a -> a) -> [a] -> [a]
- iterate :: (a -> a) -> a -> [a]
- repeat :: a -> [a]
- replicate :: Int -> a -> [a]
- takeWhile :: (a -> Bool) -> [a] -> [a]
- dropWhile :: (a -> Bool) -> [a] -> [a]
- take :: Int -> [a] -> [a]
- drop :: Int -> [a] -> [a]
- splitAt :: Int -> [a] -> ([a], [a])
- span :: (a -> Bool) -> [a] -> ([a], [a])
- break :: (a -> Bool) -> [a] -> ([a], [a])
- reverse :: [a] -> [a]
- and :: Foldable t => t Bool -> Bool
- or :: Foldable t => t Bool -> Bool
- any :: Foldable t => (a -> Bool) -> t a -> Bool
- notElem :: (Foldable t, Eq a) => a -> t a -> Bool
- lookup :: Eq a => a -> [(a, b)] -> Maybe b
- concatMap :: Foldable t => (a -> [b]) -> t a -> [b]
- (!!) :: HasCallStack => [a] -> Int -> a
- zip3 :: [a] -> [b] -> [c] -> [(a, b, c)]
- zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]
- zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]
- unzip :: [(a, b)] -> ([a], [b])
- unzip3 :: [(a, b, c)] -> ([a], [b], [c])
- type ShowS = String -> String
- shows :: Show a => a -> ShowS
- showChar :: Char -> ShowS
- showString :: String -> ShowS
- showParen :: Bool -> ShowS -> ShowS
- even :: Integral a => a -> Bool
- odd :: Integral a => a -> Bool
- (^^) :: (Fractional a, Integral b) => a -> b -> a
- gcd :: Integral a => a -> a -> a
- lcm :: Integral a => a -> a -> a
- (<$>) :: Functor f => (a -> b) -> f a -> f b
- type ReadS a = String -> [(a, String)]
- lex :: ReadS String
- readParen :: Bool -> ReadS a -> ReadS a
- either :: (a -> c) -> (b -> c) -> Either a b -> c
- reads :: Read a => ReadS a
- read :: Read a => String -> a
- sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()
- lines :: String -> [String]
- unlines :: [String] -> String
- words :: String -> [String]
- unwords :: [String] -> String
- type IOError = IOException
- userError :: String -> IOError
- type FilePath = String
- ioError :: IOError -> IO a
- putChar :: Char -> IO ()
- putStr :: String -> IO ()
- putStrLn :: String -> IO ()
- getChar :: IO Char
- getLine :: IO String
- getContents :: IO String
- interact :: (String -> String) -> IO ()
- writeFile :: FilePath -> String -> IO ()
- readLn :: Read a => IO a
- readIO :: Read a => String -> IO a
- void :: Functor f => f a -> f ()
- join :: Monad m => m (m a) -> m a
- class Applicative m => Monad (m :: Type -> Type) where
  - (>>=) :: m a -> (a -> m b) -> m b
  - (>>) :: m a -> m b -> m b
  - return :: a -> m a
- class Functor (f :: Type -> Type) where
  - fmap :: (a -> b) -> f a -> f b
  - (<$) :: a -> f b -> f a
- class Monad m => MonadFail (m :: Type -> Type) where
  - fail :: String -> m a
- guard :: Alternative f => Bool -> f ()
- class (Alternative m, Monad m) => MonadPlus (m :: Type -> Type) where
  - mzero :: m a
  - mplus :: m a -> m a -> m a
- (=<<) :: Monad m => (a -> m b) -> m a -> m b
- when :: Applicative f => Bool -> f () -> f ()
- sequence :: (Traversable t, Monad m) => t (m a) -> m (t a)
- mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)
- liftM :: Monad m => (a1 -> r) -> m a1 -> m r
- liftM2 :: Monad m => (a1 -> a2 -> r) -> m a1 -> m a2 -> m r
- liftM3 :: Monad m => (a1 -> a2 -> a3 -> r) -> m a1 -> m a2 -> m a3 -> m r
- liftM4 :: Monad m => (a1 -> a2 -> a3 -> a4 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m r
- liftM5 :: Monad m => (a1 -> a2 -> a3 -> a4 -> a5 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r
- ap :: Monad m => m (a -> b) -> m a -> m b
- sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()
- msum :: (Foldable t, MonadPlus m) => t (m a) -> m a
- forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m (t b)
- filterM :: Applicative m => (a -> m Bool) -> [a] -> m [a]
- (>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c
- (<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c
- forever :: Applicative f => f a -> f b
- mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c])
- zipWithM :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m [c]
- zipWithM_ :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m ()
- foldM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b
- foldM_ :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m ()
- replicateM :: Applicative m => Int -> m a -> m [a]
- replicateM_ :: Applicative m => Int -> m a -> m ()
- unless :: Applicative f => Bool -> f () -> f ()
- (<$!>) :: Monad m => (a -> b) -> m a -> m b
- mfilter :: MonadPlus m => (a -> Bool) -> m a -> m a
- sort :: Ord a => [a] -> [a]
- delete :: Eq a => a -> [a] -> [a]
- data List a
- (++) :: [a] -> [a] -> [a]
- foldr :: Foldable t => (a -> b -> b) -> b -> t a -> b
- foldl' :: Foldable t => (b -> a -> b) -> b -> t a -> b
- product :: (Foldable t, Num a) => t a -> a
- foldr1 :: Foldable t => (a -> a -> a) -> t a -> a
- maximum :: (Foldable t, Ord a) => t a -> a
- minimum :: (Foldable t, Ord a) => t a -> a
- elem :: (Foldable t, Eq a) => a -> t a -> Bool
- map :: (a -> b) -> [a] -> [b]
- (!?) :: [a] -> Int -> Maybe a
- all :: Foldable t => (a -> Bool) -> t a -> Bool
- unfoldr :: (b -> Maybe (a, b)) -> b -> [a]
- sortOn :: Ord b => (a -> b) -> [a] -> [a]
- transpose :: [[a]] -> [[a]]
- sortBy :: (a -> a -> Ordering) -> [a] -> [a]
- cycle :: HasCallStack => [a] -> [a]
- concat :: Foldable t => t [a] -> [a]
- filter :: (a -> Bool) -> [a] -> [a]
- zip :: [a] -> [b] -> [(a, b)]
- head :: HasCallStack => [a] -> a
- uncons :: [a] -> Maybe (a, [a])
- unsnoc :: [a] -> Maybe ([a], a)
- tail :: HasCallStack => [a] -> [a]
- last :: HasCallStack => [a] -> a
- init :: HasCallStack => [a] -> [a]
- foldl1' :: HasCallStack => (a -> a -> a) -> [a] -> a
- scanl :: (b -> a -> b) -> b -> [a] -> [b]
- scanl1 :: (a -> a -> a) -> [a] -> [a]
- scanl' :: (b -> a -> b) -> b -> [a] -> [b]
- scanr :: (a -> b -> b) -> b -> [a] -> [b]
- scanr1 :: (a -> a -> a) -> [a] -> [a]
- iterate :: (a -> a) -> a -> [a]
- iterate' :: (a -> a) -> a -> [a]
- repeat :: a -> [a]
- replicate :: Int -> a -> [a]
- takeWhile :: (a -> Bool) -> [a] -> [a]
- dropWhile :: (a -> Bool) -> [a] -> [a]
- take :: Int -> [a] -> [a]
- drop :: Int -> [a] -> [a]
- splitAt :: Int -> [a] -> ([a], [a])
- span :: (a -> Bool) -> [a] -> ([a], [a])
- break :: (a -> Bool) -> [a] -> ([a], [a])
- reverse :: [a] -> [a]
- and :: Foldable t => t Bool -> Bool
- or :: Foldable t => t Bool -> Bool
- any :: Foldable t => (a -> Bool) -> t a -> Bool
- notElem :: (Foldable t, Eq a) => a -> t a -> Bool
- lookup :: Eq a => a -> [(a, b)] -> Maybe b
- concatMap :: Foldable t => (a -> [b]) -> t a -> [b]
- (!!) :: HasCallStack => [a] -> Int -> a
- zip3 :: [a] -> [b] -> [c] -> [(a, b, c)]
- zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]
- zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]
- unzip :: [(a, b)] -> ([a], [b])
- unzip3 :: [(a, b, c)] -> ([a], [b], [c])
- maximumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a
- minimumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a
- find :: Foldable t => (a -> Bool) -> t a -> Maybe a
- dropWhileEnd :: (a -> Bool) -> [a] -> [a]
- stripPrefix :: Eq a => [a] -> [a] -> Maybe [a]
- elemIndex :: Eq a => a -> [a] -> Maybe Int
- elemIndices :: Eq a => a -> [a] -> [Int]
- findIndex :: (a -> Bool) -> [a] -> Maybe Int
- findIndices :: (a -> Bool) -> [a] -> [Int]
- isPrefixOf :: Eq a => [a] -> [a] -> Bool
- isSuffixOf :: Eq a => [a] -> [a] -> Bool
- isInfixOf :: Eq a => [a] -> [a] -> Bool
- nub :: Eq a => [a] -> [a]
- nubBy :: (a -> a -> Bool) -> [a] -> [a]
- deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a]
- (\\) :: Eq a => [a] -> [a] -> [a]
- union :: Eq a => [a] -> [a] -> [a]
- unionBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
- intersect :: Eq a => [a] -> [a] -> [a]
- intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
- intersperse :: a -> [a] -> [a]
- intercalate :: [a] -> [[a]] -> [a]
- partition :: (a -> Bool) -> [a] -> ([a], [a])
- insert :: Ord a => a -> [a] -> [a]
- insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a]
- genericLength :: Num i => [a] -> i
- genericTake :: Integral i => i -> [a] -> [a]
- genericDrop :: Integral i => i -> [a] -> [a]
- genericSplitAt :: Integral i => i -> [a] -> ([a], [a])
- genericIndex :: Integral i => [a] -> i -> a
- genericReplicate :: Integral i => i -> a -> [a]
- zip4 :: [a] -> [b] -> [c] -> [d] -> [(a, b, c, d)]
- zip5 :: [a] -> [b] -> [c] -> [d] -> [e] -> [(a, b, c, d, e)]
- zip6 :: [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [(a, b, c, d, e, f)]
- zip7 :: [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [(a, b, c, d, e, f, g)]
- zipWith4 :: (a -> b -> c -> d -> e) -> [a] -> [b] -> [c] -> [d] -> [e]
- zipWith5 :: (a -> b -> c -> d -> e -> f) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f]
- zipWith6 :: (a -> b -> c -> d -> e -> f -> g) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g]
- zipWith7 :: (a -> b -> c -> d -> e -> f -> g -> h) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [h]
- unzip4 :: [(a, b, c, d)] -> ([a], [b], [c], [d])
- unzip5 :: [(a, b, c, d, e)] -> ([a], [b], [c], [d], [e])
- unzip6 :: [(a, b, c, d, e, f)] -> ([a], [b], [c], [d], [e], [f])
- unzip7 :: [(a, b, c, d, e, f, g)] -> ([a], [b], [c], [d], [e], [f], [g])
- deleteFirstsBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
- group :: Eq a => [a] -> [[a]]
- groupBy :: (a -> a -> Bool) -> [a] -> [[a]]
- inits :: [a] -> [[a]]
- tails :: [a] -> [[a]]
- subsequences :: [a] -> [[a]]
- permutations :: [a] -> [[a]]
- singleton :: a -> [a]
- lines :: String -> [String]
- unlines :: [String] -> String
- words :: String -> [String]
- unwords :: [String] -> String
- mapAccumL :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)
- mapAccumR :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)
- isSubsequenceOf :: Eq a => [a] -> [a] -> Bool
- inits1 :: [a] -> [NonEmpty a]
- tails1 :: [a] -> [NonEmpty a]
- compareLength :: [a] -> Int -> Ordering
- module Data.Maybe
- class Semigroup a where
  - (<>) :: a -> a -> a
- assert :: Bool -> a -> a
- blame :: Show v => Bool -> v -> Bool
- showFailure :: Show v => String -> v -> String
- swith :: String -> v -> (String, v)
- allB :: Show v => (v -> Bool) -> [v] -> Bool
- data Text
- (<+>) :: Text -> Text -> Text
- tshow :: Show a => a -> Text
- divUp :: Integral a => a -> a -> a
- sum :: Num a => [a] -> a
- (<$$>) :: (Functor f, Functor g) => (a -> b) -> f (g a) -> f (g b)
- partitionM :: Applicative m => (a -> m Bool) -> [a] -> m ([a], [a])
- length :: [a] -> Int
- null :: [a] -> Bool
- comparing :: Ord a => (b -> a) -> b -> b -> Ordering
- into :: forall target source. From source target => source -> target
- fromIntegralWrap :: (Integral a, Num b) => a -> b
- toIntegralCrash :: (Integral a, Integral b, Bits a, Bits b) => a -> b
- intToDouble :: Int -> Double
- int64ToDouble :: Int64 -> Double
- mapM_ :: (Foldable t, Monad m) => (a -> m ()) -> t a -> m ()
- forM_ :: (Foldable t, Monad m) => t a -> (a -> m ()) -> m ()
- vectorUnboxedUnsafeIndex :: Unbox a => Vector a -> Int -> a
- unsafeShiftL :: Bits a => a -> Int -> a
- unsafeShiftR :: Bits a => a -> Int -> a
- (***) :: Arrow a => a b c -> a b' c' -> a (b, b') (c, c')
- (&&&) :: Arrow a => a b c -> a b c' -> a b (c, c')
- first :: Arrow a => a b c -> a (b, d) (c, d)
- second :: Arrow a => a b c -> a (d, b) (d, c)

# Documentation

data Int Source #

A fixed-precision integer type with at least the range `[-2^29 .. 2^29-1]`. The exact range for a given implementation can be determined by using `minBound` and `maxBound` from the `Bounded` class.

#### Instances

Instances details

Arbitrary Int |
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen Int Source # shrink :: Int -> [Int] Source #
CoArbitrary Int |
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Int -> Gen b -> Gen b Source #
Function Int |
Instance details Defined in Test.QuickCheck.Function Methods function :: (Int -> b) -> Int :-> b Source #
PrintfArg Int | Since: base-2.1
Instance details Defined in Text.Printf Methods formatArg :: Int -> FieldFormatter Source # parseFormat :: Int -> ModifierParser Source #
Binary Int |
Instance details Defined in Data.Binary.Class Methods put :: Int -> Put Source # get :: Get Int Source # putList :: [Int] -> Put Source #
NFData Int |
Instance details Defined in Control.DeepSeq Methods rnf :: Int -> () Source #
Bits Int | Since: base-2.1

Instance details

Defined in GHC.Internal.Bits

Methods

(.&.) :: Int -> Int -> Int Source #

(.|.) :: Int -> Int -> Int Source #

xor :: Int -> Int -> Int Source #

complement :: Int -> Int Source #

shift :: Int -> Int -> Int Source #

rotate :: Int -> Int -> Int Source #

zeroBits :: Int Source #

bit :: Int -> Int Source #

setBit :: Int -> Int -> Int Source #

clearBit :: Int -> Int -> Int Source #

complementBit :: Int -> Int -> Int Source #

testBit :: Int -> Int -> Bool Source #

bitSizeMaybe :: Int -> Maybe Int Source #

bitSize :: Int -> Int Source #

isSigned :: Int -> Bool Source #

shiftL :: Int -> Int -> Int Source #

unsafeShiftL :: Int -> Int -> Int Source #

shiftR :: Int -> Int -> Int Source #

unsafeShiftR :: Int -> Int -> Int Source #

rotateL :: Int -> Int -> Int Source #

rotateR :: Int -> Int -> Int Source #

popCount :: Int -> Int Source #

FiniteBits Int | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Bits Methods finiteBitSize :: Int -> Int Source # countLeadingZeros :: Int -> Int Source # countTrailingZeros :: Int -> Int Source #
Bounded Int | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: Int Source # maxBound :: Int Source #
Enum Int | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods succ :: Int -> Int Source # pred :: Int -> Int Source # toEnum :: Int -> Int Source # fromEnum :: Int -> Int Source # enumFrom :: Int -> [Int] Source # enumFromThen :: Int -> Int -> [Int] Source # enumFromTo :: Int -> Int -> [Int] Source # enumFromThenTo :: Int -> Int -> Int -> [Int] Source #
Storable Int | Since: base-2.1

Instance details

Defined in GHC.Internal.Foreign.Storable

Methods

sizeOf :: Int -> Int Source #

alignment :: Int -> Int Source #

peekElemOff :: Ptr Int -> Int -> IO Int Source #

pokeElemOff :: Ptr Int -> Int -> Int -> IO () Source #

peekByteOff :: Ptr b -> Int -> IO Int Source #

pokeByteOff :: Ptr b -> Int -> Int -> IO () Source #

peek :: Ptr Int -> IO Int Source #

poke :: Ptr Int -> Int -> IO () Source #

Ix Int | Since: base-2.1
Instance details Defined in GHC.Internal.Ix Methods range :: (Int, Int) -> [Int] Source # index :: (Int, Int) -> Int -> Int Source # unsafeIndex :: (Int, Int) -> Int -> Int Source # inRange :: (Int, Int) -> Int -> Bool Source # rangeSize :: (Int, Int) -> Int Source # unsafeRangeSize :: (Int, Int) -> Int Source #
Num Int | Since: base-2.1
Instance details Defined in GHC.Internal.Num Methods (+) :: Int -> Int -> Int Source # (-) :: Int -> Int -> Int Source # (*) :: Int -> Int -> Int Source # negate :: Int -> Int Source # abs :: Int -> Int Source # signum :: Int -> Int Source # fromInteger :: Integer -> Int Source #
Read Int | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Int Source # readList :: ReadS [Int] Source # readPrec :: ReadPrec Int Source # readListPrec :: ReadPrec [Int] Source #
Integral Int | Since: base-2.0.1
Instance details Defined in GHC.Internal.Real Methods quot :: Int -> Int -> Int Source # rem :: Int -> Int -> Int Source # div :: Int -> Int -> Int Source # mod :: Int -> Int -> Int Source # quotRem :: Int -> Int -> (Int, Int) Source # divMod :: Int -> Int -> (Int, Int) Source # toInteger :: Int -> Integer Source #
Real Int | Since: base-2.0.1
Instance details Defined in GHC.Internal.Real Methods toRational :: Int -> Rational Source #
Show Int | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Int -> ShowS Source # show :: Int -> String Source # showList :: [Int] -> ShowS Source #
Eq Int |
Instance details Defined in GHC.Classes Methods (==) :: Int -> Int -> Bool Source # (/=) :: Int -> Int -> Bool Source #
Ord Int |
Instance details Defined in GHC.Classes Methods compare :: Int -> Int -> Ordering Source # (<) :: Int -> Int -> Bool Source # (<=) :: Int -> Int -> Bool Source # (>) :: Int -> Int -> Bool Source # (>=) :: Int -> Int -> Bool Source # max :: Int -> Int -> Int Source # min :: Int -> Int -> Int Source #
Hashable Int |
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Int -> Int Source # hash :: Int -> Int Source #
Pretty Int |
Instance details Defined in Prettyprinter.Internal Methods pretty :: Int -> Doc ann # prettyList :: [Int] -> Doc ann #
Prim Int |

Instance details

Defined in Data.Primitive.Types

Methods

sizeOfType# :: Proxy Int -> Int# Source #

sizeOf# :: Int -> Int# Source #

alignmentOfType# :: Proxy Int -> Int# Source #

alignment# :: Int -> Int# Source #

indexByteArray# :: ByteArray# -> Int# -> Int Source #

readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Int #) Source #

writeByteArray# :: MutableByteArray# s -> Int# -> Int -> State# s -> State# s Source #

setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Int -> State# s -> State# s Source #

indexOffAddr# :: Addr# -> Int# -> Int Source #

readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Int #) Source #

writeOffAddr# :: Addr# -> Int# -> Int -> State# s -> State# s Source #

setOffAddr# :: Addr# -> Int# -> Int# -> Int -> State# s -> State# s Source #

Random Int |
Instance details Defined in System.Random Methods randomR :: RandomGen g => (Int, Int) -> g -> (Int, g) random :: RandomGen g => g -> (Int, g) randomRs :: RandomGen g => (Int, Int) -> g -> [Int] randoms :: RandomGen g => g -> [Int]
Uniform Int |
Instance details Defined in System.Random.Internal Methods uniformM :: StatefulGen g m => g -> m Int
UniformRange Int |
Instance details Defined in System.Random.Internal Methods uniformRM :: StatefulGen g m => (Int, Int) -> g -> m Int
ByteSource Int |
Instance details Defined in Data.UUID.Types.Internal.Builder Methods (/-/) :: ByteSink Int g -> Int -> g
Unbox Int |
Instance details Defined in Data.Vector.Unboxed.Base
FoldableWithIndex Int Vector |
Instance details Defined in Data.Functor.WithIndex.Instances Methods ifoldMap :: Monoid m => (Int -> a -> m) -> Vector a -> m ifoldMap' :: Monoid m => (Int -> a -> m) -> Vector a -> m ifoldr :: (Int -> a -> b -> b) -> b -> Vector a -> b ifoldl :: (Int -> b -> a -> b) -> b -> Vector a -> b ifoldr' :: (Int -> a -> b -> b) -> b -> Vector a -> b ifoldl' :: (Int -> b -> a -> b) -> b -> Vector a -> b
FunctorWithIndex Int Vector |
Instance details Defined in Data.Functor.WithIndex.Instances Methods imap :: (Int -> a -> b) -> Vector a -> Vector b
TraversableWithIndex Int Vector |
Instance details Defined in Data.Functor.WithIndex.Instances Methods itraverse :: Applicative f => (Int -> a -> f b) -> Vector a -> f (Vector b)
Lift Int |
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Quote m => Int -> m Exp Source # liftTyped :: forall (m :: Type -> Type). Quote m => Int -> Code m Int Source #
Vector Vector Int |

Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: Mutable Vector s Int -> ST s (Vector Int)

basicUnsafeThaw :: Vector Int -> ST s (Mutable Vector s Int)

basicLength :: Vector Int -> Int

basicUnsafeSlice :: Int -> Int -> Vector Int -> Vector Int

basicUnsafeIndexM :: Vector Int -> Int -> Box Int

basicUnsafeCopy :: Mutable Vector s Int -> Vector Int -> ST s ()

elemseq :: Vector Int -> Int -> b -> b

MVector MVector Int |

Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Int -> Int

basicUnsafeSlice :: Int -> Int -> MVector s Int -> MVector s Int

basicOverlaps :: MVector s Int -> MVector s Int -> Bool

basicUnsafeNew :: Int -> ST s (MVector s Int)

basicInitialize :: MVector s Int -> ST s ()

basicUnsafeReplicate :: Int -> Int -> ST s (MVector s Int)

basicUnsafeRead :: MVector s Int -> Int -> ST s Int

basicUnsafeWrite :: MVector s Int -> Int -> Int -> ST s ()

basicClear :: MVector s Int -> ST s ()

basicSet :: MVector s Int -> Int -> ST s ()

basicUnsafeCopy :: MVector s Int -> MVector s Int -> ST s ()

basicUnsafeMove :: MVector s Int -> MVector s Int -> ST s ()

basicUnsafeGrow :: MVector s Int -> Int -> ST s (MVector s Int)

From Int16 Int | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Int16 -> Int Source #
From Int8 Int | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Int8 -> Int Source #
From Word16 Int | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Word16 -> Int Source #
From Word8 Int | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Word8 -> Int Source #
From Int Int64 | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Int -> Int64 Source #
From Int Integer | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Int -> Integer Source #
TryFrom Int32 Int | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Int32 -> Either (TryFromException Int32 Int) Int Source #
TryFrom Int64 Int | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Int64 -> Either (TryFromException Int64 Int) Int Source #
TryFrom Word32 Int | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Word32 -> Either (TryFromException Word32 Int) Int Source #
TryFrom Word64 Int | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Word64 -> Either (TryFromException Word64 Int) Int Source #
TryFrom Integer Int | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Integer -> Either (TryFromException Integer Int) Int Source #
TryFrom Natural Int | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Natural -> Either (TryFromException Natural Int) Int Source #
TryFrom Double Int | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Double -> Either (TryFromException Double Int) Int Source #
TryFrom Float Int | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Float -> Either (TryFromException Float Int) Int Source #
TryFrom Int Int16 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Int -> Either (TryFromException Int Int16) Int16 Source #
TryFrom Int Int32 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Int -> Either (TryFromException Int Int32) Int32 Source #
TryFrom Int Int8 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Int -> Either (TryFromException Int Int8) Int8 Source #
TryFrom Int Word16 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Int -> Either (TryFromException Int Word16) Word16 Source #
TryFrom Int Word32 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Int -> Either (TryFromException Int Word32) Word32 Source #
TryFrom Int Word64 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Int -> Either (TryFromException Int Word64) Word64 Source #
TryFrom Int Word8 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Int -> Either (TryFromException Int Word8) Word8 Source #
TryFrom Int Natural | Uses `fromIntegral` when the input is not negative.
Instance details Defined in Witch.Instances Methods tryFrom :: Int -> Either (TryFromException Int Natural) Natural Source #
TryFrom Int Double | Uses `fromIntegral` when the input is between -9,007,199,254,740,991 and 9,007,199,254,740,991 inclusive.
Instance details Defined in Witch.Instances Methods tryFrom :: Int -> Either (TryFromException Int Double) Double Source #
TryFrom Int Float | Uses `fromIntegral` when the input is between -16,777,215 and 16,777,215 inclusive.
Instance details Defined in Witch.Instances Methods tryFrom :: Int -> Either (TryFromException Int Float) Float Source #
TryFrom Int Word | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Int -> Either (TryFromException Int Word) Word Source #
TryFrom Word Int | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Word -> Either (TryFromException Word Int) Int Source #
Reifies Z Int |
Instance details Defined in Data.Reflection Methods reflect :: proxy Z -> Int
From IntSet [Int] | Uses `toAscList`.
Instance details Defined in Witch.Instances Methods from :: IntSet -> [Int] Source #
Reifies n Int => Reifies (D n :: Type) Int |
Instance details Defined in Data.Reflection Methods reflect :: proxy (D n) -> Int
Reifies n Int => Reifies (PD n :: Type) Int |
Instance details Defined in Data.Reflection Methods reflect :: proxy (PD n) -> Int
Reifies n Int => Reifies (SD n :: Type) Int |
Instance details Defined in Data.Reflection Methods reflect :: proxy (SD n) -> Int
Generic1 (URec Int :: k -> Type) |

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep1 (URec Int :: k -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep1 (URec Int :: k -> Type) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UInt" 'PrefixI 'True) (S1 ('MetaSel ('Just "uInt#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UInt :: k -> Type)))

Methods

from1 :: forall (a :: k). URec Int a -> Rep1 (URec Int :: k -> Type) a Source #

to1 :: forall (a :: k). Rep1 (URec Int :: k -> Type) a -> URec Int a Source #

FoldableWithIndex Int (V n) |
Instance details Defined in Linear.V Methods ifoldMap :: Monoid m => (Int -> a -> m) -> V n a -> m ifoldMap' :: Monoid m => (Int -> a -> m) -> V n a -> m ifoldr :: (Int -> a -> b -> b) -> b -> V n a -> b ifoldl :: (Int -> b -> a -> b) -> b -> V n a -> b ifoldr' :: (Int -> a -> b -> b) -> b -> V n a -> b ifoldl' :: (Int -> b -> a -> b) -> b -> V n a -> b
FunctorWithIndex Int (V n) |
Instance details Defined in Linear.V Methods imap :: (Int -> a -> b) -> V n a -> V n b
TraversableWithIndex Int (V n) |
Instance details Defined in Linear.V Methods itraverse :: Applicative f => (Int -> a -> f b) -> V n a -> f (V n b)
Eq1 (UInt :: Type -> Type) |
Instance details Defined in Data.Orphans Methods liftEq :: (a -> b -> Bool) -> UInt a -> UInt b -> Bool Source #
Ord1 (UInt :: Type -> Type) |
Instance details Defined in Data.Orphans Methods liftCompare :: (a -> b -> Ordering) -> UInt a -> UInt b -> Ordering Source #
Show1 (UInt :: Type -> Type) |
Instance details Defined in Data.Orphans Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> UInt a -> ShowS Source # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [UInt a] -> ShowS Source #
Foldable (UInt :: Type -> Type) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => UInt m -> m Source #

foldMap :: Monoid m => (a -> m) -> UInt a -> m Source #

foldMap' :: Monoid m => (a -> m) -> UInt a -> m Source #

foldr :: (a -> b -> b) -> b -> UInt a -> b Source #

foldr' :: (a -> b -> b) -> b -> UInt a -> b Source #

foldl :: (b -> a -> b) -> b -> UInt a -> b Source #

foldl' :: (b -> a -> b) -> b -> UInt a -> b Source #

foldr1 :: (a -> a -> a) -> UInt a -> a Source #

foldl1 :: (a -> a -> a) -> UInt a -> a Source #

toList :: UInt a -> [a] Source #

null :: UInt a -> Bool Source #

length :: UInt a -> Int Source #

elem :: Eq a => a -> UInt a -> Bool Source #

maximum :: Ord a => UInt a -> a Source #

minimum :: Ord a => UInt a -> a Source #

sum :: Num a => UInt a -> a Source #

product :: Num a => UInt a -> a Source #

Traversable (UInt :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> UInt a -> f (UInt b) Source # sequenceA :: Applicative f => UInt (f a) -> f (UInt a) Source # mapM :: Monad m => (a -> m b) -> UInt a -> m (UInt b) Source # sequence :: Monad m => UInt (m a) -> m (UInt a) Source #
From [Int] IntSet | Uses `fromList`.
Instance details Defined in Witch.Instances Methods from :: [Int] -> IntSet Source #
From (IntMap v) [(Int, v)] | Uses `toAscList`.
Instance details Defined in Witch.Instances Methods from :: IntMap v -> [(Int, v)] Source #
From [(Int, v)] (IntMap v) | Uses `fromList`. If there are duplicate keys, later values will overwrite earlier ones.
Instance details Defined in Witch.Instances Methods from :: [(Int, v)] -> IntMap v Source #
Functor (URec Int :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> URec Int a -> URec Int b Source # (<$) :: a -> URec Int b -> URec Int a Source #
Generic (URec Int p) |

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep (URec Int p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep (URec Int p) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UInt" 'PrefixI 'True) (S1 ('MetaSel ('Just "uInt#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UInt :: Type -> Type)))

Methods

from :: URec Int p -> Rep (URec Int p) x Source #

to :: Rep (URec Int p) x -> URec Int p Source #

Show (URec Int p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> URec Int p -> ShowS Source # show :: URec Int p -> String Source # showList :: [URec Int p] -> ShowS Source #
Eq (URec Int p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: URec Int p -> URec Int p -> Bool Source # (/=) :: URec Int p -> URec Int p -> Bool Source #
Ord (URec Int p) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: URec Int p -> URec Int p -> Ordering Source #

(<) :: URec Int p -> URec Int p -> Bool Source #

(<=) :: URec Int p -> URec Int p -> Bool Source #

(>) :: URec Int p -> URec Int p -> Bool Source #

(>=) :: URec Int p -> URec Int p -> Bool Source #

max :: URec Int p -> URec Int p -> URec Int p Source #

min :: URec Int p -> URec Int p -> URec Int p Source #

type Signed Int |
Instance details Defined in Data.Bytes.Signed type Signed Int = Int
type Unsigned Int |
Instance details Defined in Data.Bytes.Signed type Unsigned Int = Word
newtype Vector Int |
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Int = V_Int (Vector Int)
data URec Int (p :: k) | Used for marking occurrences of `Int#` Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

data URec Int (p :: k) = UInt {

- uInt# :: Int#

}

type ByteSink Int g |
Instance details Defined in Data.UUID.Types.Internal.Builder type ByteSink Int g = Takes4Bytes g
newtype MVector s Int |
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Int = MV_Int (MVector s Int)
type Rep1 (URec Int :: k -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep1 (URec Int :: k -> Type) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UInt" 'PrefixI 'True) (S1 ('MetaSel ('Just "uInt#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UInt :: k -> Type)))
type Rep (URec Int p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep (URec Int p) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UInt" 'PrefixI 'True) (S1 ('MetaSel ('Just "uInt#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UInt :: Type -> Type)))

data Integer Source #

Arbitrary precision integers. In contrast with fixed-size integral types such as `Int`, the `Integer` type represents the entire infinite range of integers.

Integers are stored in a kind of sign-magnitude form, hence do not expect two's complement form when using bit operations.

If the value is small (i.e., fits into an `Int`), the `IS` constructor is used. Otherwise `IP` and `IN` constructors are used to store a `BigNat` representing the positive or the negative value magnitude, respectively.

Invariant: `IP` and `IN` are used iff the value does not fit in `IS`.

#### Instances

Instances details

Arbitrary Integer |
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen Integer Source # shrink :: Integer -> [Integer] Source #
CoArbitrary Integer |
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Integer -> Gen b -> Gen b Source #
Function Integer |
Instance details Defined in Test.QuickCheck.Function Methods function :: (Integer -> b) -> Integer :-> b Source #
PrintfArg Integer | Since: base-2.1
Instance details Defined in Text.Printf Methods formatArg :: Integer -> FieldFormatter Source # parseFormat :: Integer -> ModifierParser Source #
Binary Integer |
Instance details Defined in Data.Binary.Class Methods put :: Integer -> Put Source # get :: Get Integer Source # putList :: [Integer] -> Put Source #
NFData Integer |
Instance details Defined in Control.DeepSeq Methods rnf :: Integer -> () Source #
Bits Integer | Since: base-2.1

Instance details

Defined in GHC.Internal.Bits

Methods

(.&.) :: Integer -> Integer -> Integer Source #

(.|.) :: Integer -> Integer -> Integer Source #

xor :: Integer -> Integer -> Integer Source #

complement :: Integer -> Integer Source #

shift :: Integer -> Int -> Integer Source #

rotate :: Integer -> Int -> Integer Source #

zeroBits :: Integer Source #

bit :: Int -> Integer Source #

setBit :: Integer -> Int -> Integer Source #

clearBit :: Integer -> Int -> Integer Source #

complementBit :: Integer -> Int -> Integer Source #

testBit :: Integer -> Int -> Bool Source #

bitSizeMaybe :: Integer -> Maybe Int Source #

bitSize :: Integer -> Int Source #

isSigned :: Integer -> Bool Source #

shiftL :: Integer -> Int -> Integer Source #

unsafeShiftL :: Integer -> Int -> Integer Source #

shiftR :: Integer -> Int -> Integer Source #

unsafeShiftR :: Integer -> Int -> Integer Source #

rotateL :: Integer -> Int -> Integer Source #

rotateR :: Integer -> Int -> Integer Source #

popCount :: Integer -> Int Source #

Enum Integer | Since: base-2.1

Instance details

Defined in GHC.Internal.Enum

Methods

succ :: Integer -> Integer Source #

pred :: Integer -> Integer Source #

toEnum :: Int -> Integer Source #

fromEnum :: Integer -> Int Source #

enumFrom :: Integer -> [Integer] Source #

enumFromThen :: Integer -> Integer -> [Integer] Source #

enumFromTo :: Integer -> Integer -> [Integer] Source #

enumFromThenTo :: Integer -> Integer -> Integer -> [Integer] Source #

Ix Integer | Since: base-2.1
Instance details Defined in GHC.Internal.Ix Methods range :: (Integer, Integer) -> [Integer] Source # index :: (Integer, Integer) -> Integer -> Int Source # unsafeIndex :: (Integer, Integer) -> Integer -> Int Source # inRange :: (Integer, Integer) -> Integer -> Bool Source # rangeSize :: (Integer, Integer) -> Int Source # unsafeRangeSize :: (Integer, Integer) -> Int Source #
Num Integer | Since: base-2.1
Instance details Defined in GHC.Internal.Num Methods (+) :: Integer -> Integer -> Integer Source # (-) :: Integer -> Integer -> Integer Source # (*) :: Integer -> Integer -> Integer Source # negate :: Integer -> Integer Source # abs :: Integer -> Integer Source # signum :: Integer -> Integer Source # fromInteger :: Integer -> Integer Source #
Read Integer | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Integer Source # readList :: ReadS [Integer] Source # readPrec :: ReadPrec Integer Source # readListPrec :: ReadPrec [Integer] Source #
Integral Integer | Since: base-2.0.1
Instance details Defined in GHC.Internal.Real Methods quot :: Integer -> Integer -> Integer Source # rem :: Integer -> Integer -> Integer Source # div :: Integer -> Integer -> Integer Source # mod :: Integer -> Integer -> Integer Source # quotRem :: Integer -> Integer -> (Integer, Integer) Source # divMod :: Integer -> Integer -> (Integer, Integer) Source # toInteger :: Integer -> Integer Source #
Real Integer | Since: base-2.0.1
Instance details Defined in GHC.Internal.Real Methods toRational :: Integer -> Rational Source #
Show Integer | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Integer -> ShowS Source # show :: Integer -> String Source # showList :: [Integer] -> ShowS Source #
Eq Integer |
Instance details Defined in GHC.Num.Integer Methods (==) :: Integer -> Integer -> Bool Source # (/=) :: Integer -> Integer -> Bool Source #
Ord Integer |
Instance details Defined in GHC.Num.Integer Methods compare :: Integer -> Integer -> Ordering Source # (<) :: Integer -> Integer -> Bool Source # (<=) :: Integer -> Integer -> Bool Source # (>) :: Integer -> Integer -> Bool Source # (>=) :: Integer -> Integer -> Bool Source # max :: Integer -> Integer -> Integer Source # min :: Integer -> Integer -> Integer Source #
Hashable Integer |
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Integer -> Int Source # hash :: Integer -> Int Source #
Pretty Integer |
Instance details Defined in Prettyprinter.Internal Methods pretty :: Integer -> Doc ann # prettyList :: [Integer] -> Doc ann #
Random Integer |
Instance details Defined in System.Random Methods randomR :: RandomGen g => (Integer, Integer) -> g -> (Integer, g) random :: RandomGen g => g -> (Integer, g) randomRs :: RandomGen g => (Integer, Integer) -> g -> [Integer] randoms :: RandomGen g => g -> [Integer]
UniformRange Integer |
Instance details Defined in System.Random.Internal Methods uniformRM :: StatefulGen g m => (Integer, Integer) -> g -> m Integer
DayPeriod Year |
Instance details Defined in Data.Time.Calendar.Gregorian Methods periodFirstDay :: Year -> Day Source # periodLastDay :: Year -> Day Source # dayPeriod :: Day -> Year Source #
Lift Integer |
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Quote m => Integer -> m Exp Source # liftTyped :: forall (m :: Type -> Type). Quote m => Integer -> Code m Integer Source #
From Int16 Integer | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Int16 -> Integer Source #
From Int32 Integer | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Int32 -> Integer Source #
From Int64 Integer | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Int64 -> Integer Source #
From Int8 Integer | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Int8 -> Integer Source #
From Rational UniversalTime | Uses `ModJulianDate`.
Instance details Defined in Witch.Instances Methods from :: Rational -> UniversalTime Source #
From Rational TimeOfDay | Uses `dayFractionToTimeOfDay`.
Instance details Defined in Witch.Instances Methods from :: Rational -> TimeOfDay Source #
From Rational Double | Uses `fromRational`. This necessarily loses some precision.
Instance details Defined in Witch.Instances Methods from :: Rational -> Double Source #
From Rational Float | Uses `fromRational`. This necessarily loses some precision.
Instance details Defined in Witch.Instances Methods from :: Rational -> Float Source #
From Word16 Integer | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Word16 -> Integer Source #
From Word32 Integer | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Word32 -> Integer Source #
From Word64 Integer | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Word64 -> Integer Source #
From Word8 Integer | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Word8 -> Integer Source #
From Day Integer | Uses `toModifiedJulianDay`.
Instance details Defined in Witch.Instances Methods from :: Day -> Integer Source #
From UniversalTime Rational | Uses `getModJulianDate`.
Instance details Defined in Witch.Instances Methods from :: UniversalTime -> Rational Source #
From TimeOfDay Rational | Uses `timeOfDayToDayFraction`.
Instance details Defined in Witch.Instances Methods from :: TimeOfDay -> Rational Source #
From Integer Day | Uses `ModifiedJulianDay`.
Instance details Defined in Witch.Instances Methods from :: Integer -> Day Source #
From Natural Integer | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Natural -> Integer Source #
From Int Integer | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Int -> Integer Source #
From Word Integer | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Word -> Integer Source #
TryFrom Integer Int16 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Integer -> Either (TryFromException Integer Int16) Int16 Source #
TryFrom Integer Int32 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Integer -> Either (TryFromException Integer Int32) Int32 Source #
TryFrom Integer Int64 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Integer -> Either (TryFromException Integer Int64) Int64 Source #
TryFrom Integer Int8 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Integer -> Either (TryFromException Integer Int8) Int8 Source #
TryFrom Integer Word16 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Integer -> Either (TryFromException Integer Word16) Word16 Source #
TryFrom Integer Word32 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Integer -> Either (TryFromException Integer Word32) Word32 Source #
TryFrom Integer Word64 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Integer -> Either (TryFromException Integer Word64) Word64 Source #
TryFrom Integer Word8 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Integer -> Either (TryFromException Integer Word8) Word8 Source #
TryFrom Integer Natural | Uses `fromInteger` when the input is not negative.
Instance details Defined in Witch.Instances Methods tryFrom :: Integer -> Either (TryFromException Integer Natural) Natural Source #
TryFrom Integer Double | Uses `fromIntegral` when the input is between -9,007,199,254,740,991 and 9,007,199,254,740,991 inclusive.
Instance details Defined in Witch.Instances Methods tryFrom :: Integer -> Either (TryFromException Integer Double) Double Source #
TryFrom Integer Float | Uses `fromIntegral` when the input is between -16,777,215 and 16,777,215 inclusive.
Instance details Defined in Witch.Instances Methods tryFrom :: Integer -> Either (TryFromException Integer Float) Float Source #
TryFrom Integer Int | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Integer -> Either (TryFromException Integer Int) Int Source #
TryFrom Integer Word | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Integer -> Either (TryFromException Integer Word) Word Source #
TryFrom Double Rational | Uses `floatToDigits` when the input is not NaN or infinity.
Instance details Defined in Witch.Instances Methods tryFrom :: Double -> Either (TryFromException Double Rational) Rational Source #
TryFrom Double Integer | Converts via `Rational` when the input is between -9,007,199,254,740,991 and 9,007,199,254,740,991 inclusive.
Instance details Defined in Witch.Instances Methods tryFrom :: Double -> Either (TryFromException Double Integer) Integer Source #
TryFrom Float Rational | Uses `floatToDigits` when the input is not NaN or infinity.
Instance details Defined in Witch.Instances Methods tryFrom :: Float -> Either (TryFromException Float Rational) Rational Source #
TryFrom Float Integer | Converts via `Rational` when the input is between -16,777,215 and 16,777,215 inclusive.
Instance details Defined in Witch.Instances Methods tryFrom :: Float -> Either (TryFromException Float Integer) Integer Source #
KnownNat n => Reifies (n :: Nat) Integer |
Instance details Defined in Data.Reflection Methods reflect :: proxy n -> Integer
HasResolution a => From Integer (Fixed a) | Uses `fromInteger`. This means `from @Integer @Centi 2` is `02.00` rather than `0.02`.
Instance details Defined in Witch.Instances Methods from :: Integer -> Fixed a Source #
HasResolution a => TryFrom Rational (Fixed a) | Uses `fromRational` as long as there isn't a loss of precision.
Instance details Defined in Witch.Instances Methods tryFrom :: Rational -> Either (TryFromException Rational (Fixed a)) (Fixed a) Source #
HasResolution a => From (Fixed a) Rational | Uses `toRational`.
Instance details Defined in Witch.Instances Methods from :: Fixed a -> Rational Source #
HasResolution a => TryFrom (Fixed a) Integer | Converts via `Rational` when there is no fractional part. This means `tryFrom @Centi @Integer 2.00` is `Right 2` and `tryFrom @Centi @Integer 0.02` will fail.
Instance details Defined in Witch.Instances Methods tryFrom :: Fixed a -> Either (TryFromException (Fixed a) Integer) Integer Source #
type Signed Integer |
Instance details Defined in Data.Bytes.Signed type Signed Integer = Integer
type Unsigned Integer |
Instance details Defined in Data.Bytes.Signed type Unsigned Integer = Integer

data Double Source #

Double-precision floating point numbers. It is desirable that this type be at least equal in range and precision to the IEEE double-precision type.

#### Instances

Instances details

Arbitrary Double |
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen Double Source # shrink :: Double -> [Double] Source #
CoArbitrary Double |
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Double -> Gen b -> Gen b Source #
Function Double |
Instance details Defined in Test.QuickCheck.Function Methods function :: (Double -> b) -> Double :-> b Source #
PrintfArg Double | Since: base-2.1
Instance details Defined in Text.Printf Methods formatArg :: Double -> FieldFormatter Source # parseFormat :: Double -> ModifierParser Source #
Binary Double | Uses non-IEEE754 encoding. Does not round-trip NaN.
Instance details Defined in Data.Binary.Class Methods put :: Double -> Put Source # get :: Get Double Source # putList :: [Double] -> Put Source #
NFData Double |
Instance details Defined in Control.DeepSeq Methods rnf :: Double -> () Source #

Enum Double

`fromEnum` just truncates its argument, beware of all sorts of overflows.

List generators have extremely peculiar behavior, mandated by Haskell Report 2010:

    >>> [0..1.5]
    [0.0,1.0,2.0]

Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

succ :: Double -> Double Source #

pred :: Double -> Double Source #

toEnum :: Int -> Double Source #

fromEnum :: Double -> Int Source #

enumFrom :: Double -> [Double] Source #

enumFromThen :: Double -> Double -> [Double] Source #

enumFromTo :: Double -> Double -> [Double] Source #

enumFromThenTo :: Double -> Double -> Double -> [Double] Source #

Floating Double | Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

pi :: Double Source #

exp :: Double -> Double Source #

log :: Double -> Double Source #

sqrt :: Double -> Double Source #

(**) :: Double -> Double -> Double Source #

logBase :: Double -> Double -> Double Source #

sin :: Double -> Double Source #

cos :: Double -> Double Source #

tan :: Double -> Double Source #

asin :: Double -> Double Source #

acos :: Double -> Double Source #

atan :: Double -> Double Source #

sinh :: Double -> Double Source #

cosh :: Double -> Double Source #

tanh :: Double -> Double Source #

asinh :: Double -> Double Source #

acosh :: Double -> Double Source #

atanh :: Double -> Double Source #

log1p :: Double -> Double Source #

expm1 :: Double -> Double Source #

log1pexp :: Double -> Double Source #

log1mexp :: Double -> Double Source #

RealFloat Double | Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

floatRadix :: Double -> Integer Source #

floatDigits :: Double -> Int Source #

floatRange :: Double -> (Int, Int) Source #

decodeFloat :: Double -> (Integer, Int) Source #

encodeFloat :: Integer -> Int -> Double Source #

exponent :: Double -> Int Source #

significand :: Double -> Double Source #

scaleFloat :: Int -> Double -> Double Source #

isNaN :: Double -> Bool Source #

isInfinite :: Double -> Bool Source #

isDenormalized :: Double -> Bool Source #

isNegativeZero :: Double -> Bool Source #

isIEEE :: Double -> Bool Source #

atan2 :: Double -> Double -> Double Source #

Storable Double | Since: base-2.1

Instance details

Defined in GHC.Internal.Foreign.Storable

Methods

sizeOf :: Double -> Int Source #

alignment :: Double -> Int Source #

peekElemOff :: Ptr Double -> Int -> IO Double Source #

pokeElemOff :: Ptr Double -> Int -> Double -> IO () Source #

peekByteOff :: Ptr b -> Int -> IO Double Source #

pokeByteOff :: Ptr b -> Int -> Double -> IO () Source #

peek :: Ptr Double -> IO Double Source #

poke :: Ptr Double -> Double -> IO () Source #

Num Double

This instance implements IEEE 754 standard with all its usual pitfalls about NaN, infinities and negative zero. Neither addition nor multiplication are associative or distributive:

    >>> (0.1 + 0.1) + 0.4 == 0.1 + (0.1 + 0.4)
    False
    >>> (0.1 + 0.2) * 0.3 == 0.1 * 0.3 + 0.2 * 0.3
    False
    >>> (0.1 * 0.1) * 0.3 == 0.1 * (0.1 * 0.3)
    False

Since: base-2.1

Instance details Defined in GHC.Internal.Float Methods (+) :: Double -> Double -> Double Source # (-) :: Double -> Double -> Double Source # (*) :: Double -> Double -> Double Source # negate :: Double -> Double Source # abs :: Double -> Double Source # signum :: Double -> Double Source # fromInteger :: Integer -> Double Source #
Read Double | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Double Source # readList :: ReadS [Double] Source # readPrec :: ReadPrec Double Source # readListPrec :: ReadPrec [Double] Source #

Fractional Double

This instance implements IEEE 754 standard with all its usual pitfalls about NaN, infinities and negative zero.

    >>> 0 == (-0 :: Double)
    True
    >>> recip 0 == recip (-0 :: Double)
    False
    >>> map (/ 0) [-1, 0, 1]
    [-Infinity,NaN,Infinity]
    >>> map (* 0) $ map (/ 0) [-1, 0, 1]
    [NaN,NaN,NaN]

Since: base-2.1

Instance details Defined in GHC.Internal.Float Methods (/) :: Double -> Double -> Double Source # recip :: Double -> Double Source # fromRational :: Rational -> Double Source #

Real Double

Beware that `toRational` generates garbage for non-finite arguments:

    >>> toRational (1/0)
    179769313 (and 300 more digits...) % 1
    >>> toRational (0/0)
    269653970 (and 300 more digits...) % 1

Since: base-2.1

Instance details Defined in GHC.Internal.Float Methods toRational :: Double -> Rational Source #

RealFrac Double

Beware that results for non-finite arguments are garbage:

    >>> [ f x | f <- [round, floor, ceiling], x <- [-1/0, 0/0, 1/0] ] :: [Int]
    [0,0,0,0,0,0,0,0,0]
    >>> map properFraction [-1/0, 0/0, 1/0] :: [(Int, Double)]
    [(0,0.0),(0,0.0),(0,0.0)]

and get even more non-sensical if you ask for `Integer` instead of `Int`.

Since: base-2.1

Instance details Defined in GHC.Internal.Float Methods properFraction :: Integral b => Double -> (b, Double) Source # truncate :: Integral b => Double -> b Source # round :: Integral b => Double -> b Source # ceiling :: Integral b => Double -> b Source # floor :: Integral b => Double -> b Source #
Show Double | Since: base-2.1
Instance details Defined in GHC.Internal.Float Methods showsPrec :: Int -> Double -> ShowS Source # show :: Double -> String Source # showList :: [Double] -> ShowS Source #

Eq Double

Note that due to the presence of `NaN`, `Double`'s `Eq` instance does not satisfy reflexivity.

    >>> 0/0 == (0/0 :: Double)
    False

Also note that `Double`'s `Eq` instance does not satisfy substitutivity:

    >>> 0 == (-0 :: Double)
    True
    >>> recip 0 == recip (-0 :: Double)
    False

Instance details Defined in GHC.Classes Methods (==) :: Double -> Double -> Bool Source # (/=) :: Double -> Double -> Bool Source #

Ord Double

IEEE 754 `Double`-precision type includes not only numbers, but also positive and negative infinities and a special element called `NaN` (which can be quiet or signal).

IEEE 754-2008, section 5.11 requires that if at least one of arguments of `<=`, `<`, `>`, `>=` is `NaN` then the result of the comparison is `False`, and `instance` `Ord` `Double` complies with this requirement. This violates the reflexivity: both `NaN` `<=` `NaN` and `NaN` `>=` `NaN` are `False`.

IEEE 754-2008, section 5.10 defines `totalOrder` predicate. Unfortunately, `compare` on `Double`s violates the IEEE standard and does not define a total order. More specifically, both `compare` `NaN` `x` and `compare` `x` `NaN` always return `GT`.

Thus, users must be extremely cautious when using `instance` `Ord` `Double`. For instance, one should avoid ordered containers with keys represented by `Double`, because data loss and corruption may happen. An IEEE-compliant `compare` is available in `fp-ieee` package as `TotallyOrdered` newtype.

Moving further, the behaviour of `min` and `max` with regards to `NaN` is also non-compliant. IEEE 754-2008, section 5.3.1 defines that quiet `NaN` should be treated as a missing data by `minNum` and `maxNum` functions, for example, `minNum(NaN, 1) = minNum(1, NaN) = 1`. Some languages such as Java deviate from the standard implementing `minNum(NaN, 1) = minNum(1, NaN) = NaN`. However, `min` / `max` in `base` are even worse: `min` `NaN` 1 is 1, but `min` 1 `NaN` is `NaN`.

IEEE 754-2008 compliant `min` / `max` can be found in `ieee754` package under `minNum` / `maxNum` names. Implementations compliant with `minimumNumber` / `maximumNumber` from a newer IEEE 754-2019, section 9.6 are available from `fp-ieee` package.

Instance details Defined in GHC.Classes Methods compare :: Double -> Double -> Ordering Source # (<) :: Double -> Double -> Bool Source # (<=) :: Double -> Double -> Bool Source # (>) :: Double -> Double -> Bool Source # (>=) :: Double -> Double -> Bool Source # max :: Double -> Double -> Double Source # min :: Double -> Double -> Double Source #
Hashable Double | Note: prior to `hashable-1.3.0.0`, `hash 0.0 /= hash (-0.0)` The `hash` of NaN is not well defined. Since: hashable-1.3.0.0
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Double -> Int Source # hash :: Double -> Int Source #
Pretty Double |
Instance details Defined in Prettyprinter.Internal Methods pretty :: Double -> Doc ann # prettyList :: [Double] -> Doc ann #
Prim Double |

Instance details

Defined in Data.Primitive.Types

Methods

sizeOfType# :: Proxy Double -> Int# Source #

sizeOf# :: Double -> Int# Source #

alignmentOfType# :: Proxy Double -> Int# Source #

alignment# :: Double -> Int# Source #

indexByteArray# :: ByteArray# -> Int# -> Double Source #

readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Double #) Source #

writeByteArray# :: MutableByteArray# s -> Int# -> Double -> State# s -> State# s Source #

setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Double -> State# s -> State# s Source #

indexOffAddr# :: Addr# -> Int# -> Double Source #

readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Double #) Source #

writeOffAddr# :: Addr# -> Int# -> Double -> State# s -> State# s Source #

setOffAddr# :: Addr# -> Int# -> Int# -> Double -> State# s -> State# s Source #

Random Double |
Instance details Defined in System.Random Methods randomR :: RandomGen g => (Double, Double) -> g -> (Double, g) random :: RandomGen g => g -> (Double, g) randomRs :: RandomGen g => (Double, Double) -> g -> [Double] randoms :: RandomGen g => g -> [Double]
UniformRange Double |
Instance details Defined in System.Random.Internal Methods uniformRM :: StatefulGen g m => (Double, Double) -> g -> m Double
Unbox Double |
Instance details Defined in Data.Vector.Unboxed.Base
Lift Double |
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Quote m => Double -> m Exp Source # liftTyped :: forall (m :: Type -> Type). Quote m => Double -> Code m Double Source #
Vector Vector Double |

Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: Mutable Vector s Double -> ST s (Vector Double)

basicUnsafeThaw :: Vector Double -> ST s (Mutable Vector s Double)

basicLength :: Vector Double -> Int

basicUnsafeSlice :: Int -> Int -> Vector Double -> Vector Double

basicUnsafeIndexM :: Vector Double -> Int -> Box Double

basicUnsafeCopy :: Mutable Vector s Double -> Vector Double -> ST s ()

elemseq :: Vector Double -> Double -> b -> b

MVector MVector Double |

Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Double -> Int

basicUnsafeSlice :: Int -> Int -> MVector s Double -> MVector s Double

basicOverlaps :: MVector s Double -> MVector s Double -> Bool

basicUnsafeNew :: Int -> ST s (MVector s Double)

basicInitialize :: MVector s Double -> ST s ()

basicUnsafeReplicate :: Int -> Double -> ST s (MVector s Double)

basicUnsafeRead :: MVector s Double -> Int -> ST s Double

basicUnsafeWrite :: MVector s Double -> Int -> Double -> ST s ()

basicClear :: MVector s Double -> ST s ()

basicSet :: MVector s Double -> Double -> ST s ()

basicUnsafeCopy :: MVector s Double -> MVector s Double -> ST s ()

basicUnsafeMove :: MVector s Double -> MVector s Double -> ST s ()

basicUnsafeGrow :: MVector s Double -> Int -> ST s (MVector s Double)

From Int16 Double | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Int16 -> Double Source #
From Int32 Double | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Int32 -> Double Source #
From Int8 Double | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Int8 -> Double Source #
From Rational Double | Uses `fromRational`. This necessarily loses some precision.
Instance details Defined in Witch.Instances Methods from :: Rational -> Double Source #
From Word16 Double | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Word16 -> Double Source #
From Word32 Double | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Word32 -> Double Source #
From Word8 Double | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Word8 -> Double Source #
From Double Float | Uses `double2Float`. This necessarily loses some precision.
Instance details Defined in Witch.Instances Methods from :: Double -> Float Source #
From Float Double | Uses `float2Double`.
Instance details Defined in Witch.Instances Methods from :: Float -> Double Source #
TryFrom Int64 Double | Uses `fromIntegral` when the input is between -9,007,199,254,740,991 and 9,007,199,254,740,991 inclusive.
Instance details Defined in Witch.Instances Methods tryFrom :: Int64 -> Either (TryFromException Int64 Double) Double Source #
TryFrom Word64 Double | Uses `fromIntegral` when the input is less than or equal to 9,007,199,254,740,991.
Instance details Defined in Witch.Instances Methods tryFrom :: Word64 -> Either (TryFromException Word64 Double) Double Source #
TryFrom Integer Double | Uses `fromIntegral` when the input is between -9,007,199,254,740,991 and 9,007,199,254,740,991 inclusive.
Instance details Defined in Witch.Instances Methods tryFrom :: Integer -> Either (TryFromException Integer Double) Double Source #
TryFrom Natural Double | Uses `fromIntegral` when the input is less than or equal to 9,007,199,254,740,991.
Instance details Defined in Witch.Instances Methods tryFrom :: Natural -> Either (TryFromException Natural Double) Double Source #
TryFrom Double Int16 | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Double -> Either (TryFromException Double Int16) Int16 Source #
TryFrom Double Int32 | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Double -> Either (TryFromException Double Int32) Int32 Source #
TryFrom Double Int64 | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Double -> Either (TryFromException Double Int64) Int64 Source #
TryFrom Double Int8 | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Double -> Either (TryFromException Double Int8) Int8 Source #
TryFrom Double Rational | Uses `floatToDigits` when the input is not NaN or infinity.
Instance details Defined in Witch.Instances Methods tryFrom :: Double -> Either (TryFromException Double Rational) Rational Source #
TryFrom Double Word16 | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Double -> Either (TryFromException Double Word16) Word16 Source #
TryFrom Double Word32 | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Double -> Either (TryFromException Double Word32) Word32 Source #
TryFrom Double Word64 | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Double -> Either (TryFromException Double Word64) Word64 Source #
TryFrom Double Word8 | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Double -> Either (TryFromException Double Word8) Word8 Source #
TryFrom Double Integer | Converts via `Rational` when the input is between -9,007,199,254,740,991 and 9,007,199,254,740,991 inclusive.
Instance details Defined in Witch.Instances Methods tryFrom :: Double -> Either (TryFromException Double Integer) Integer Source #
TryFrom Double Natural | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Double -> Either (TryFromException Double Natural) Natural Source #
TryFrom Double Int | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Double -> Either (TryFromException Double Int) Int Source #
TryFrom Double Word | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Double -> Either (TryFromException Double Word) Word Source #
TryFrom Int Double | Uses `fromIntegral` when the input is between -9,007,199,254,740,991 and 9,007,199,254,740,991 inclusive.
Instance details Defined in Witch.Instances Methods tryFrom :: Int -> Either (TryFromException Int Double) Double Source #
TryFrom Word Double | Uses `fromIntegral` when the input is less than or equal to 9,007,199,254,740,991.
Instance details Defined in Witch.Instances Methods tryFrom :: Word -> Either (TryFromException Word Double) Double Source #
Generic1 (URec Double :: k -> Type) |

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep1 (URec Double :: k -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep1 (URec Double :: k -> Type) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UDouble" 'PrefixI 'True) (S1 ('MetaSel ('Just "uDouble#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UDouble :: k -> Type)))

Methods

from1 :: forall (a :: k). URec Double a -> Rep1 (URec Double :: k -> Type) a Source #

to1 :: forall (a :: k). Rep1 (URec Double :: k -> Type) a -> URec Double a Source #

Eq1 (UDouble :: Type -> Type) |
Instance details Defined in Data.Orphans Methods liftEq :: (a -> b -> Bool) -> UDouble a -> UDouble b -> Bool Source #
Ord1 (UDouble :: Type -> Type) |
Instance details Defined in Data.Orphans Methods liftCompare :: (a -> b -> Ordering) -> UDouble a -> UDouble b -> Ordering Source #
Show1 (UDouble :: Type -> Type) |
Instance details Defined in Data.Orphans Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> UDouble a -> ShowS Source # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [UDouble a] -> ShowS Source #
Foldable (UDouble :: Type -> Type) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => UDouble m -> m Source #

foldMap :: Monoid m => (a -> m) -> UDouble a -> m Source #

foldMap' :: Monoid m => (a -> m) -> UDouble a -> m Source #

foldr :: (a -> b -> b) -> b -> UDouble a -> b Source #

foldr' :: (a -> b -> b) -> b -> UDouble a -> b Source #

foldl :: (b -> a -> b) -> b -> UDouble a -> b Source #

foldl' :: (b -> a -> b) -> b -> UDouble a -> b Source #

foldr1 :: (a -> a -> a) -> UDouble a -> a Source #

foldl1 :: (a -> a -> a) -> UDouble a -> a Source #

toList :: UDouble a -> [a] Source #

null :: UDouble a -> Bool Source #

length :: UDouble a -> Int Source #

elem :: Eq a => a -> UDouble a -> Bool Source #

maximum :: Ord a => UDouble a -> a Source #

minimum :: Ord a => UDouble a -> a Source #

sum :: Num a => UDouble a -> a Source #

product :: Num a => UDouble a -> a Source #

Traversable (UDouble :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> UDouble a -> f (UDouble b) Source # sequenceA :: Applicative f => UDouble (f a) -> f (UDouble a) Source # mapM :: Monad m => (a -> m b) -> UDouble a -> m (UDouble b) Source # sequence :: Monad m => UDouble (m a) -> m (UDouble a) Source #
Functor (URec Double :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> URec Double a -> URec Double b Source # (<$) :: a -> URec Double b -> URec Double a Source #
Generic (URec Double p) |

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep (URec Double p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep (URec Double p) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UDouble" 'PrefixI 'True) (S1 ('MetaSel ('Just "uDouble#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UDouble :: Type -> Type)))

Methods

from :: URec Double p -> Rep (URec Double p) x Source #

to :: Rep (URec Double p) x -> URec Double p Source #

Show (URec Double p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> URec Double p -> ShowS Source # show :: URec Double p -> String Source # showList :: [URec Double p] -> ShowS Source #
Eq (URec Double p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: URec Double p -> URec Double p -> Bool Source # (/=) :: URec Double p -> URec Double p -> Bool Source #
Ord (URec Double p) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: URec Double p -> URec Double p -> Ordering Source #

(<) :: URec Double p -> URec Double p -> Bool Source #

(<=) :: URec Double p -> URec Double p -> Bool Source #

(>) :: URec Double p -> URec Double p -> Bool Source #

(>=) :: URec Double p -> URec Double p -> Bool Source #

max :: URec Double p -> URec Double p -> URec Double p Source #

min :: URec Double p -> URec Double p -> URec Double p Source #

newtype Vector Double |
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Double = V_Double (Vector Double)
data URec Double (p :: k) | Used for marking occurrences of `Double#` Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

data URec Double (p :: k) = UDouble {

- uDouble# :: Double#

}

newtype MVector s Double |
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Double = MV_Double (MVector s Double)
type Rep1 (URec Double :: k -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep1 (URec Double :: k -> Type) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UDouble" 'PrefixI 'True) (S1 ('MetaSel ('Just "uDouble#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UDouble :: k -> Type)))
type Rep (URec Double p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep (URec Double p) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UDouble" 'PrefixI 'True) (S1 ('MetaSel ('Just "uDouble#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UDouble :: Type -> Type)))

data Float Source #

Single-precision floating point numbers. It is desirable that this type be at least equal in range and precision to the IEEE single-precision type.

#### Instances

Instances details

Arbitrary Float |
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen Float Source # shrink :: Float -> [Float] Source #
CoArbitrary Float |
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Float -> Gen b -> Gen b Source #
Function Float |
Instance details Defined in Test.QuickCheck.Function Methods function :: (Float -> b) -> Float :-> b Source #
PrintfArg Float | Since: base-2.1
Instance details Defined in Text.Printf Methods formatArg :: Float -> FieldFormatter Source # parseFormat :: Float -> ModifierParser Source #
Binary Float | Uses non-IEEE754 encoding. Does not round-trip NaN.
Instance details Defined in Data.Binary.Class Methods put :: Float -> Put Source # get :: Get Float Source # putList :: [Float] -> Put Source #
NFData Float |
Instance details Defined in Control.DeepSeq Methods rnf :: Float -> () Source #

Enum Float

`fromEnum` just truncates its argument, beware of all sorts of overflows.

List generators have extremely peculiar behavior, mandated by Haskell Report 2010:

    >>> [0..1.5 :: Float]
    [0.0,1.0,2.0]

Since: base-2.1

Instance details Defined in GHC.Internal.Float Methods succ :: Float -> Float Source # pred :: Float -> Float Source # toEnum :: Int -> Float Source # fromEnum :: Float -> Int Source # enumFrom :: Float -> [Float] Source # enumFromThen :: Float -> Float -> [Float] Source # enumFromTo :: Float -> Float -> [Float] Source # enumFromThenTo :: Float -> Float -> Float -> [Float] Source #
Floating Float | Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

pi :: Float Source #

exp :: Float -> Float Source #

log :: Float -> Float Source #

sqrt :: Float -> Float Source #

(**) :: Float -> Float -> Float Source #

logBase :: Float -> Float -> Float Source #

sin :: Float -> Float Source #

cos :: Float -> Float Source #

tan :: Float -> Float Source #

asin :: Float -> Float Source #

acos :: Float -> Float Source #

atan :: Float -> Float Source #

sinh :: Float -> Float Source #

cosh :: Float -> Float Source #

tanh :: Float -> Float Source #

asinh :: Float -> Float Source #

acosh :: Float -> Float Source #

atanh :: Float -> Float Source #

log1p :: Float -> Float Source #

expm1 :: Float -> Float Source #

log1pexp :: Float -> Float Source #

log1mexp :: Float -> Float Source #

RealFloat Float | Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

floatRadix :: Float -> Integer Source #

floatDigits :: Float -> Int Source #

floatRange :: Float -> (Int, Int) Source #

decodeFloat :: Float -> (Integer, Int) Source #

encodeFloat :: Integer -> Int -> Float Source #

exponent :: Float -> Int Source #

significand :: Float -> Float Source #

scaleFloat :: Int -> Float -> Float Source #

isNaN :: Float -> Bool Source #

isInfinite :: Float -> Bool Source #

isDenormalized :: Float -> Bool Source #

isNegativeZero :: Float -> Bool Source #

isIEEE :: Float -> Bool Source #

atan2 :: Float -> Float -> Float Source #

Storable Float | Since: base-2.1

Instance details

Defined in GHC.Internal.Foreign.Storable

Methods

sizeOf :: Float -> Int Source #

alignment :: Float -> Int Source #

peekElemOff :: Ptr Float -> Int -> IO Float Source #

pokeElemOff :: Ptr Float -> Int -> Float -> IO () Source #

peekByteOff :: Ptr b -> Int -> IO Float Source #

pokeByteOff :: Ptr b -> Int -> Float -> IO () Source #

peek :: Ptr Float -> IO Float Source #

poke :: Ptr Float -> Float -> IO () Source #

Num Float

This instance implements IEEE 754 standard with all its usual pitfalls about NaN, infinities and negative zero. Neither addition nor multiplication are associative or distributive:

    >>> (0.1 + 0.1 :: Float) + 0.5 == 0.1 + (0.1 + 0.5)
    False
    >>> (0.1 + 0.2 :: Float) * 0.9 == 0.1 * 0.9 + 0.2 * 0.9
    False
    >>> (0.1 * 0.1 :: Float) * 0.9 == 0.1 * (0.1 * 0.9)
    False

Since: base-2.1

Instance details Defined in GHC.Internal.Float Methods (+) :: Float -> Float -> Float Source # (-) :: Float -> Float -> Float Source # (*) :: Float -> Float -> Float Source # negate :: Float -> Float Source # abs :: Float -> Float Source # signum :: Float -> Float Source # fromInteger :: Integer -> Float Source #
Read Float | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Float Source # readList :: ReadS [Float] Source # readPrec :: ReadPrec Float Source # readListPrec :: ReadPrec [Float] Source #

Fractional Float

This instance implements IEEE 754 standard with all its usual pitfalls about NaN, infinities and negative zero.

    >>> 0 == (-0 :: Float)
    True
    >>> recip 0 == recip (-0 :: Float)
    False
    >>> map (/ 0) [-1, 0, 1 :: Float]
    [-Infinity,NaN,Infinity]
    >>> map (* 0) $ map (/ 0) [-1, 0, 1 :: Float]
    [NaN,NaN,NaN]

Since: base-2.1

Instance details Defined in GHC.Internal.Float Methods (/) :: Float -> Float -> Float Source # recip :: Float -> Float Source # fromRational :: Rational -> Float Source #

Real Float

Beware that `toRational` generates garbage for non-finite arguments:

    >>> toRational (1/0 :: Float)
    340282366920938463463374607431768211456 % 1
    >>> toRational (0/0 :: Float)
    510423550381407695195061911147652317184 % 1

Since: base-2.1

Instance details Defined in GHC.Internal.Float Methods toRational :: Float -> Rational Source #

RealFrac Float

Beware that results for non-finite arguments are garbage:

    >>> [ f x | f <- [round, floor, ceiling], x <- [-1/0, 0/0, 1/0 :: Float] ] :: [Int]
    [0,0,0,0,0,0,0,0,0]
    >>> map properFraction [-1/0, 0/0, 1/0] :: [(Int, Float)]
    [(0,0.0),(0,0.0),(0,0.0)]

and get even more non-sensical if you ask for `Integer` instead of `Int`.

Since: base-2.1

Instance details Defined in GHC.Internal.Float Methods properFraction :: Integral b => Float -> (b, Float) Source # truncate :: Integral b => Float -> b Source # round :: Integral b => Float -> b Source # ceiling :: Integral b => Float -> b Source # floor :: Integral b => Float -> b Source #
Show Float | Since: base-2.1
Instance details Defined in GHC.Internal.Float Methods showsPrec :: Int -> Float -> ShowS Source # show :: Float -> String Source # showList :: [Float] -> ShowS Source #

Eq Float

Note that due to the presence of `NaN`, `Float`'s `Eq` instance does not satisfy reflexivity.

    >>> 0/0 == (0/0 :: Float)
    False

Also note that `Float`'s `Eq` instance does not satisfy extensionality:

    >>> 0 == (-0 :: Float)
    True
    >>> recip 0 == recip (-0 :: Float)
    False

Instance details Defined in GHC.Classes Methods (==) :: Float -> Float -> Bool Source # (/=) :: Float -> Float -> Bool Source #
Ord Float | See `instance` `Ord` `Double` for discussion of deviations from IEEE 754 standard.
Instance details Defined in GHC.Classes Methods compare :: Float -> Float -> Ordering Source # (<) :: Float -> Float -> Bool Source # (<=) :: Float -> Float -> Bool Source # (>) :: Float -> Float -> Bool Source # (>=) :: Float -> Float -> Bool Source # max :: Float -> Float -> Float Source # min :: Float -> Float -> Float Source #
Hashable Float | Note: prior to `hashable-1.3.0.0`, `hash 0.0 /= hash (-0.0)` The `hash` of NaN is not well defined. Since: hashable-1.3.0.0
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Float -> Int Source # hash :: Float -> Int Source #
Pretty Float |
Instance details Defined in Prettyprinter.Internal Methods pretty :: Float -> Doc ann # prettyList :: [Float] -> Doc ann #
Prim Float |

Instance details

Defined in Data.Primitive.Types

Methods

sizeOfType# :: Proxy Float -> Int# Source #

sizeOf# :: Float -> Int# Source #

alignmentOfType# :: Proxy Float -> Int# Source #

alignment# :: Float -> Int# Source #

indexByteArray# :: ByteArray# -> Int# -> Float Source #

readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Float #) Source #

writeByteArray# :: MutableByteArray# s -> Int# -> Float -> State# s -> State# s Source #

setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Float -> State# s -> State# s Source #

indexOffAddr# :: Addr# -> Int# -> Float Source #

readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Float #) Source #

writeOffAddr# :: Addr# -> Int# -> Float -> State# s -> State# s Source #

setOffAddr# :: Addr# -> Int# -> Int# -> Float -> State# s -> State# s Source #

Random Float |
Instance details Defined in System.Random Methods randomR :: RandomGen g => (Float, Float) -> g -> (Float, g) random :: RandomGen g => g -> (Float, g) randomRs :: RandomGen g => (Float, Float) -> g -> [Float] randoms :: RandomGen g => g -> [Float]
UniformRange Float |
Instance details Defined in System.Random.Internal Methods uniformRM :: StatefulGen g m => (Float, Float) -> g -> m Float
Unbox Float |
Instance details Defined in Data.Vector.Unboxed.Base
Lift Float |
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Quote m => Float -> m Exp Source # liftTyped :: forall (m :: Type -> Type). Quote m => Float -> Code m Float Source #
Vector Vector Float |

Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: Mutable Vector s Float -> ST s (Vector Float)

basicUnsafeThaw :: Vector Float -> ST s (Mutable Vector s Float)

basicLength :: Vector Float -> Int

basicUnsafeSlice :: Int -> Int -> Vector Float -> Vector Float

basicUnsafeIndexM :: Vector Float -> Int -> Box Float

basicUnsafeCopy :: Mutable Vector s Float -> Vector Float -> ST s ()

elemseq :: Vector Float -> Float -> b -> b

MVector MVector Float |

Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Float -> Int

basicUnsafeSlice :: Int -> Int -> MVector s Float -> MVector s Float

basicOverlaps :: MVector s Float -> MVector s Float -> Bool

basicUnsafeNew :: Int -> ST s (MVector s Float)

basicInitialize :: MVector s Float -> ST s ()

basicUnsafeReplicate :: Int -> Float -> ST s (MVector s Float)

basicUnsafeRead :: MVector s Float -> Int -> ST s Float

basicUnsafeWrite :: MVector s Float -> Int -> Float -> ST s ()

basicClear :: MVector s Float -> ST s ()

basicSet :: MVector s Float -> Float -> ST s ()

basicUnsafeCopy :: MVector s Float -> MVector s Float -> ST s ()

basicUnsafeMove :: MVector s Float -> MVector s Float -> ST s ()

basicUnsafeGrow :: MVector s Float -> Int -> ST s (MVector s Float)

From Int16 Float | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Int16 -> Float Source #
From Int8 Float | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Int8 -> Float Source #
From Rational Float | Uses `fromRational`. This necessarily loses some precision.
Instance details Defined in Witch.Instances Methods from :: Rational -> Float Source #
From Word16 Float | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Word16 -> Float Source #
From Word8 Float | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Word8 -> Float Source #
From Double Float | Uses `double2Float`. This necessarily loses some precision.
Instance details Defined in Witch.Instances Methods from :: Double -> Float Source #
From Float Double | Uses `float2Double`.
Instance details Defined in Witch.Instances Methods from :: Float -> Double Source #
TryFrom Int32 Float | Uses `fromIntegral` when the input is between -16,777,215 and 16,777,215 inclusive.
Instance details Defined in Witch.Instances Methods tryFrom :: Int32 -> Either (TryFromException Int32 Float) Float Source #
TryFrom Int64 Float | Uses `fromIntegral` when the input is between -16,777,215 and 16,777,215 inclusive.
Instance details Defined in Witch.Instances Methods tryFrom :: Int64 -> Either (TryFromException Int64 Float) Float Source #
TryFrom Word32 Float | Uses `fromIntegral` when the input is less than or equal to 16,777,215.
Instance details Defined in Witch.Instances Methods tryFrom :: Word32 -> Either (TryFromException Word32 Float) Float Source #
TryFrom Word64 Float | Uses `fromIntegral` when the input is less than or equal to 16,777,215.
Instance details Defined in Witch.Instances Methods tryFrom :: Word64 -> Either (TryFromException Word64 Float) Float Source #
TryFrom Integer Float | Uses `fromIntegral` when the input is between -16,777,215 and 16,777,215 inclusive.
Instance details Defined in Witch.Instances Methods tryFrom :: Integer -> Either (TryFromException Integer Float) Float Source #
TryFrom Natural Float | Uses `fromIntegral` when the input is less than or equal to 16,777,215.
Instance details Defined in Witch.Instances Methods tryFrom :: Natural -> Either (TryFromException Natural Float) Float Source #
TryFrom Float Int16 | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Float -> Either (TryFromException Float Int16) Int16 Source #
TryFrom Float Int32 | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Float -> Either (TryFromException Float Int32) Int32 Source #
TryFrom Float Int64 | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Float -> Either (TryFromException Float Int64) Int64 Source #
TryFrom Float Int8 | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Float -> Either (TryFromException Float Int8) Int8 Source #
TryFrom Float Rational | Uses `floatToDigits` when the input is not NaN or infinity.
Instance details Defined in Witch.Instances Methods tryFrom :: Float -> Either (TryFromException Float Rational) Rational Source #
TryFrom Float Word16 | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Float -> Either (TryFromException Float Word16) Word16 Source #
TryFrom Float Word32 | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Float -> Either (TryFromException Float Word32) Word32 Source #
TryFrom Float Word64 | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Float -> Either (TryFromException Float Word64) Word64 Source #
TryFrom Float Word8 | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Float -> Either (TryFromException Float Word8) Word8 Source #
TryFrom Float Integer | Converts via `Rational` when the input is between -16,777,215 and 16,777,215 inclusive.
Instance details Defined in Witch.Instances Methods tryFrom :: Float -> Either (TryFromException Float Integer) Integer Source #
TryFrom Float Natural | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Float -> Either (TryFromException Float Natural) Natural Source #
TryFrom Float Int | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Float -> Either (TryFromException Float Int) Int Source #
TryFrom Float Word | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Float -> Either (TryFromException Float Word) Word Source #
TryFrom Int Float | Uses `fromIntegral` when the input is between -16,777,215 and 16,777,215 inclusive.
Instance details Defined in Witch.Instances Methods tryFrom :: Int -> Either (TryFromException Int Float) Float Source #
TryFrom Word Float | Uses `fromIntegral` when the input is less than or equal to 16,777,215.
Instance details Defined in Witch.Instances Methods tryFrom :: Word -> Either (TryFromException Word Float) Float Source #
Generic1 (URec Float :: k -> Type) |

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep1 (URec Float :: k -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep1 (URec Float :: k -> Type) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UFloat" 'PrefixI 'True) (S1 ('MetaSel ('Just "uFloat#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UFloat :: k -> Type)))

Methods

from1 :: forall (a :: k). URec Float a -> Rep1 (URec Float :: k -> Type) a Source #

to1 :: forall (a :: k). Rep1 (URec Float :: k -> Type) a -> URec Float a Source #

Eq1 (UFloat :: Type -> Type) |
Instance details Defined in Data.Orphans Methods liftEq :: (a -> b -> Bool) -> UFloat a -> UFloat b -> Bool Source #
Ord1 (UFloat :: Type -> Type) |
Instance details Defined in Data.Orphans Methods liftCompare :: (a -> b -> Ordering) -> UFloat a -> UFloat b -> Ordering Source #
Show1 (UFloat :: Type -> Type) |
Instance details Defined in Data.Orphans Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> UFloat a -> ShowS Source # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [UFloat a] -> ShowS Source #
Foldable (UFloat :: Type -> Type) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => UFloat m -> m Source #

foldMap :: Monoid m => (a -> m) -> UFloat a -> m Source #

foldMap' :: Monoid m => (a -> m) -> UFloat a -> m Source #

foldr :: (a -> b -> b) -> b -> UFloat a -> b Source #

foldr' :: (a -> b -> b) -> b -> UFloat a -> b Source #

foldl :: (b -> a -> b) -> b -> UFloat a -> b Source #

foldl' :: (b -> a -> b) -> b -> UFloat a -> b Source #

foldr1 :: (a -> a -> a) -> UFloat a -> a Source #

foldl1 :: (a -> a -> a) -> UFloat a -> a Source #

toList :: UFloat a -> [a] Source #

null :: UFloat a -> Bool Source #

length :: UFloat a -> Int Source #

elem :: Eq a => a -> UFloat a -> Bool Source #

maximum :: Ord a => UFloat a -> a Source #

minimum :: Ord a => UFloat a -> a Source #

sum :: Num a => UFloat a -> a Source #

product :: Num a => UFloat a -> a Source #

Traversable (UFloat :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> UFloat a -> f (UFloat b) Source # sequenceA :: Applicative f => UFloat (f a) -> f (UFloat a) Source # mapM :: Monad m => (a -> m b) -> UFloat a -> m (UFloat b) Source # sequence :: Monad m => UFloat (m a) -> m (UFloat a) Source #
Functor (URec Float :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> URec Float a -> URec Float b Source # (<$) :: a -> URec Float b -> URec Float a Source #
Generic (URec Float p) |

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep (URec Float p) |
Instance details Defined in GHC.Internal.Generics type Rep (URec Float p) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UFloat" 'PrefixI 'True) (S1 ('MetaSel ('Just "uFloat#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UFloat :: Type -> Type)))

Methods

from :: URec Float p -> Rep (URec Float p) x Source #

to :: Rep (URec Float p) x -> URec Float p Source #

Show (URec Float p) |
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> URec Float p -> ShowS Source # show :: URec Float p -> String Source # showList :: [URec Float p] -> ShowS Source #
Eq (URec Float p) |
Instance details Defined in GHC.Internal.Generics Methods (==) :: URec Float p -> URec Float p -> Bool Source # (/=) :: URec Float p -> URec Float p -> Bool Source #
Ord (URec Float p) |

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: URec Float p -> URec Float p -> Ordering Source #

(<) :: URec Float p -> URec Float p -> Bool Source #

(<=) :: URec Float p -> URec Float p -> Bool Source #

(>) :: URec Float p -> URec Float p -> Bool Source #

(>=) :: URec Float p -> URec Float p -> Bool Source #

max :: URec Float p -> URec Float p -> URec Float p Source #

min :: URec Float p -> URec Float p -> URec Float p Source #

newtype Vector Float |
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Float = V_Float (Vector Float)
data URec Float (p :: k) | Used for marking occurrences of `Float#` Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

data URec Float (p :: k) = UFloat {

- uFloat# :: Float#

}

newtype MVector s Float |
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Float = MV_Float (MVector s Float)
type Rep1 (URec Float :: k -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep1 (URec Float :: k -> Type) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UFloat" 'PrefixI 'True) (S1 ('MetaSel ('Just "uFloat#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UFloat :: k -> Type)))
type Rep (URec Float p) |
Instance details Defined in GHC.Internal.Generics type Rep (URec Float p) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UFloat" 'PrefixI 'True) (S1 ('MetaSel ('Just "uFloat#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UFloat :: Type -> Type)))

data Maybe a Source #

The `Maybe` type encapsulates an optional value. A value of type ``Maybe` a` either contains a value of type `a` (represented as ``Just` a`), or it is empty (represented as `Nothing`). Using `Maybe` is a good way to deal with errors or exceptional cases without resorting to drastic measures such as `error`.

The `Maybe` type is also a monad. It is a simple kind of error monad, where all errors are represented by `Nothing`. A richer error monad can be built using the `Either` type.

Constructors

Nothing |
Just a |

#### Instances

Instances details

Arbitrary1 Maybe |
Instance details Defined in Test.QuickCheck.Arbitrary Methods liftArbitrary :: Gen a -> Gen (Maybe a) Source # liftShrink :: (a -> [a]) -> Maybe a -> [Maybe a] Source #
MonadZip Maybe | Since: base-4.8.0.0
Instance details Defined in Control.Monad.Zip Methods mzip :: Maybe a -> Maybe b -> Maybe (a, b) Source # mzipWith :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c Source # munzip :: Maybe (a, b) -> (Maybe a, Maybe b) Source #
Eq1 Maybe | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftEq :: (a -> b -> Bool) -> Maybe a -> Maybe b -> Bool Source #
Ord1 Maybe | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftCompare :: (a -> b -> Ordering) -> Maybe a -> Maybe b -> Ordering Source #
Read1 Maybe | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods 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 | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Maybe a -> ShowS Source # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Maybe a] -> ShowS Source #
NFData1 Maybe | Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> Maybe a -> () Source #
Alternative Maybe | Picks the leftmost `Just` value, or, alternatively, `Nothing`. Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods empty :: Maybe a Source # (<|>) :: Maybe a -> Maybe a -> Maybe a Source # some :: Maybe a -> Maybe [a] Source # many :: Maybe a -> Maybe [a] Source #
Applicative Maybe | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods pure :: a -> Maybe a Source # (<*>) :: Maybe (a -> b) -> Maybe a -> Maybe b Source # liftA2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c Source # (*>) :: Maybe a -> Maybe b -> Maybe b Source # (<*) :: Maybe a -> Maybe b -> Maybe a Source #
Functor Maybe | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods fmap :: (a -> b) -> Maybe a -> Maybe b Source # (<$) :: a -> Maybe b -> Maybe a Source #
Monad Maybe | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods (>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b Source # (>>) :: Maybe a -> Maybe b -> Maybe b Source # return :: a -> Maybe a Source #
MonadPlus Maybe | Picks the leftmost `Just` value, or, alternatively, `Nothing`. Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods mzero :: Maybe a Source # mplus :: Maybe a -> Maybe a -> Maybe a Source #
MonadFail Maybe | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Control.Monad.Fail Methods fail :: String -> Maybe a Source #
Foldable Maybe | Since: base-2.1

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => Maybe m -> m Source #

foldMap :: Monoid m => (a -> m) -> Maybe a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Maybe a -> m Source #

foldr :: (a -> b -> b) -> b -> Maybe a -> b Source #

foldr' :: (a -> b -> b) -> b -> Maybe a -> b Source #

foldl :: (b -> a -> b) -> b -> Maybe a -> b Source #

foldl' :: (b -> a -> b) -> b -> Maybe a -> b Source #

foldr1 :: (a -> a -> a) -> Maybe a -> a Source #

foldl1 :: (a -> a -> a) -> Maybe a -> a Source #

toList :: Maybe a -> [a] Source #

null :: Maybe a -> Bool Source #

length :: Maybe a -> Int Source #

elem :: Eq a => a -> Maybe a -> Bool Source #

maximum :: Ord a => Maybe a -> a Source #

minimum :: Ord a => Maybe a -> a Source #

sum :: Num a => Maybe a -> a Source #

product :: Num a => Maybe a -> a Source #

Traversable Maybe | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Maybe a -> f (Maybe b) Source # sequenceA :: Applicative f => Maybe (f a) -> f (Maybe a) Source # mapM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b) Source # sequence :: Monad m => Maybe (m a) -> m (Maybe a) Source #
Hashable1 Maybe |
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> Maybe a -> Int Source #
FoldableWithKey Maybe |
Instance details Defined in Data.Key Methods toKeyedList :: Maybe a -> [(Key Maybe, a)] Source # foldMapWithKey :: Monoid m => (Key Maybe -> a -> m) -> Maybe a -> m Source # foldrWithKey :: (Key Maybe -> a -> b -> b) -> b -> Maybe a -> b Source # foldlWithKey :: (b -> Key Maybe -> a -> b) -> b -> Maybe a -> b Source #
Indexable Maybe |
Instance details Defined in Data.Key Methods index :: Maybe a -> Key Maybe -> a Source #
Keyed Maybe |
Instance details Defined in Data.Key Methods mapWithKey :: (Key Maybe -> a -> b) -> Maybe a -> Maybe b Source #
Lookup Maybe |
Instance details Defined in Data.Key Methods lookup :: Key Maybe -> Maybe a -> Maybe a Source #
TraversableWithKey Maybe |
Instance details Defined in Data.Key Methods traverseWithKey :: Applicative f => (Key Maybe -> a -> f b) -> Maybe a -> f (Maybe b) Source # mapWithKeyM :: Monad m => (Key Maybe -> a -> m b) -> Maybe a -> m (Maybe b) Source #
Zip Maybe |
Instance details Defined in Data.Key Methods zipWith :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c Source # zip :: Maybe a -> Maybe b -> Maybe (a, b) Source # zap :: Maybe (a -> b) -> Maybe a -> Maybe b Source #
ZipWithKey Maybe |
Instance details Defined in Data.Key Methods zipWithKey :: (Key Maybe -> a -> b -> c) -> Maybe a -> Maybe b -> Maybe c Source # zapWithKey :: Maybe (Key Maybe -> a -> b) -> Maybe a -> Maybe b Source #
Affine Maybe |

Instance details

Defined in Linear.Affine

Associated Types

type Diff Maybe |
Instance details Defined in Linear.Affine type Diff Maybe = Maybe

Methods

(.-.) :: Num a => Maybe a -> Maybe a -> Diff Maybe a

(.+^) :: Num a => Maybe a -> Diff Maybe a -> Maybe a

(.-^) :: Num a => Maybe a -> Diff Maybe a -> Maybe a

Generic1 Maybe |

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep1 Maybe | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Generics type Rep1 Maybe = D1 ('MetaData "Maybe" "GHC.Internal.Maybe" "ghc-internal" 'False) (C1 ('MetaCons "Nothing" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Just" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1))

Methods

from1 :: Maybe a -> Rep1 Maybe a Source #

to1 :: Rep1 Maybe a -> Maybe a Source #

Lift a => Lift (Maybe a :: Type) |
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Quote m => Maybe a -> m Exp Source # liftTyped :: forall (m :: Type -> Type). Quote m => Maybe a -> Code m (Maybe a) Source #
Arbitrary a => Arbitrary (Maybe a) |
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen (Maybe a) Source # shrink :: Maybe a -> [Maybe a] Source #
CoArbitrary a => CoArbitrary (Maybe a) |
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Maybe a -> Gen b -> Gen b Source #
Function a => Function (Maybe a) |
Instance details Defined in Test.QuickCheck.Function Methods function :: (Maybe a -> b) -> Maybe a :-> b Source #
Testable prop => Testable (Maybe prop) |
Instance details Defined in Test.QuickCheck.Property Methods property :: Maybe prop -> Property Source # propertyForAllShrinkShow :: Gen a -> (a -> [a]) -> (a -> [String]) -> (a -> Maybe prop) -> Property Source #
Binary a => Binary (Maybe a) |
Instance details Defined in Data.Binary.Class Methods put :: Maybe a -> Put Source # get :: Get (Maybe a) Source # putList :: [Maybe a] -> Put Source #
NFData a => NFData (Maybe a) |
Instance details Defined in Control.DeepSeq Methods rnf :: Maybe a -> () Source #
Semigroup a => Monoid (Maybe a) | Lift a semigroup into `Maybe` forming a `Monoid` according to http://en.wikipedia.org/wiki/Monoid: "Any semigroup `S` may be turned into a monoid simply by adjoining an element `e` not in `S` and defining `e*e = e` and `e*s = s = s*e` for all `s ∈ S`." Since 4.11.0: constraint on inner `a` value generalised from `Monoid` to `Semigroup`. Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods mempty :: Maybe a Source # mappend :: Maybe a -> Maybe a -> Maybe a Source # mconcat :: [Maybe a] -> Maybe a Source #
Semigroup a => Semigroup (Maybe a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: Maybe a -> Maybe a -> Maybe a Source # sconcat :: NonEmpty (Maybe a) -> Maybe a Source # stimes :: Integral b => b -> Maybe a -> Maybe a Source #
Generic (Maybe a) |

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep (Maybe a) | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Generics type Rep (Maybe a) = D1 ('MetaData "Maybe" "GHC.Internal.Maybe" "ghc-internal" 'False) (C1 ('MetaCons "Nothing" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Just" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))

Methods

from :: Maybe a -> Rep (Maybe a) x Source #

to :: Rep (Maybe a) x -> Maybe a Source #

SingKind a => SingKind (Maybe a) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Associated Types

type DemoteRep (Maybe a) |
Instance details Defined in GHC.Internal.Generics type DemoteRep (Maybe a) = Maybe (DemoteRep a)

Methods

fromSing :: forall (a0 :: Maybe a). Sing a0 -> DemoteRep (Maybe a)

Read a => Read (Maybe a) | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (Maybe a) Source # readList :: ReadS [Maybe a] Source # readPrec :: ReadPrec (Maybe a) Source # readListPrec :: ReadPrec [Maybe a] Source #
Show a => Show (Maybe a) | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Maybe a -> ShowS Source # show :: Maybe a -> String Source # showList :: [Maybe a] -> ShowS Source #
Eq a => Eq (Maybe a) | Since: base-2.1
Instance details Defined in GHC.Internal.Maybe Methods (==) :: Maybe a -> Maybe a -> Bool Source # (/=) :: Maybe a -> Maybe a -> Bool Source #
Ord a => Ord (Maybe a) | Since: base-2.1
Instance details Defined in GHC.Internal.Maybe Methods compare :: Maybe a -> Maybe a -> Ordering Source # (<) :: Maybe a -> Maybe a -> Bool Source # (<=) :: Maybe a -> Maybe a -> Bool Source # (>) :: Maybe a -> Maybe a -> Bool Source # (>=) :: Maybe a -> Maybe a -> Bool Source # max :: Maybe a -> Maybe a -> Maybe a Source # min :: Maybe a -> Maybe a -> Maybe a Source #
Hashable a => Hashable (Maybe a) |
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Maybe a -> Int Source # hash :: Maybe a -> Int Source #
At (Maybe a) |
Instance details Defined in Control.Lens.At Methods at :: Index (Maybe a) -> Lens' (Maybe a) (Maybe (IxValue (Maybe a)))
Ixed (Maybe a) |
Instance details Defined in Control.Lens.At Methods ix :: Index (Maybe a) -> Traversal' (Maybe a) (IxValue (Maybe a))
Pretty a => Pretty (Maybe a) |
Instance details Defined in Prettyprinter.Internal Methods pretty :: Maybe a -> Doc ann # prettyList :: [Maybe a] -> Doc ann #
SingI ('Nothing :: Maybe a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods sing :: Sing ('Nothing :: Maybe a)
SingI a2 => SingI ('Just a2 :: Maybe a1) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods sing :: Sing ('Just a2)
type Key Maybe |
Instance details Defined in Data.Key type Key Maybe = ()
type Diff Maybe |
Instance details Defined in Linear.Affine type Diff Maybe = Maybe
type Rep1 Maybe | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Generics type Rep1 Maybe = D1 ('MetaData "Maybe" "GHC.Internal.Maybe" "ghc-internal" 'False) (C1 ('MetaCons "Nothing" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Just" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1))
type DemoteRep (Maybe a) |
Instance details Defined in GHC.Internal.Generics type DemoteRep (Maybe a) = Maybe (DemoteRep a)
type Rep (Maybe a) | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Generics type Rep (Maybe a) = D1 ('MetaData "Maybe" "GHC.Internal.Maybe" "ghc-internal" 'False) (C1 ('MetaCons "Nothing" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Just" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))
data Sing (b :: Maybe a) |

Instance details

Defined in GHC.Internal.Generics

data Sing (b :: Maybe a) where

- SNothing :: forall {a}. Sing ('Nothing :: Maybe a)
- SJust :: forall {a} (a1 :: a). Sing a1 -> Sing ('Just a1)

type Index (Maybe a) |
Instance details Defined in Control.Lens.At type Index (Maybe a) = ()
type IxValue (Maybe a) |
Instance details Defined in Control.Lens.At type IxValue (Maybe a) = a

class Show a where Source #

Conversion of values to readable `String`s.

Derived instances of `Show` have the following properties, which are compatible with derived instances of `Read`:

- The result of `show` is a syntactically correct Haskell expression containing only constants, given the fixity declarations in force at the point where the type is declared. It contains only the constructor names defined in the data type, parentheses, and spaces. When labelled constructor fields are used, braces, commas, field names, and equal signs are also used.
- If the constructor is defined to be an infix operator, then `showsPrec` will produce infix applications of the constructor.
- the representation will be enclosed in parentheses if the precedence of the top-level constructor in `x` is less than `d` (associativity is ignored). Thus, if `d` is `0` then the result is never surrounded in parentheses; if `d` is `11` it is always surrounded in parentheses, unless it is an atomic expression.
- If the constructor is defined using record syntax, then `show` will produce the record-syntax form, with the fields given in the same order as the original declaration.

For example, given the declarations

    infixr 5 :^:
    data Tree a =  Leaf a  |  Tree a :^: Tree a

the derived instance of `Show` is equivalent to

    instance (Show a) => Show (Tree a) where

           showsPrec d (Leaf m) = showParen (d > app_prec) $
                showString "Leaf " . showsPrec (app_prec+1) m
             where app_prec = 10

           showsPrec d (u :^: v) = showParen (d > up_prec) $
                showsPrec (up_prec+1) u .
                showString " :^: "      .
                showsPrec (up_prec+1) v
             where up_prec = 5

Note that right-associativity of `:^:` is ignored. For example,

- ``show` (Leaf 1 :^: Leaf 2 :^: Leaf 3)` produces the string `"Leaf 1 :^: (Leaf 2 :^: Leaf 3)"`.

Minimal complete definition

showsPrec | show

Methods

showsPrec Source #

Arguments

:: Int | the operator precedence of the enclosing context (a number from `0` to `11`). Function application has precedence `10`.
-> a | the value to be converted to a `String`
-> ShowS |

Convert a value to a readable `String`.

`showsPrec` should satisfy the law

    showsPrec d x r ++ s  ==  showsPrec d x (r ++ s)

Derived instances of `Read` and `Show` satisfy the following:

- `(x,"")` is an element of `(`readsPrec` d (`showsPrec` d x ""))`.

That is, `readsPrec` parses the string produced by `showsPrec`, and delivers the value that `showsPrec` started with.

show :: a -> String Source #

A specialised variant of `showsPrec`, using precedence context zero, and returning an ordinary `String`.

showList :: [a] -> ShowS Source #

The method `showList` is provided to allow the programmer to give a specialised way of showing lists of values. For example, this is used by the predefined `Show` instance of the `Char` type, where values of type `String` should be shown in double quotes, rather than between square brackets.

#### Instances

Instances details

Show CmdAtomic Source # |
Instance details Defined in Game.LambdaHack.Atomic.CmdAtomic Methods showsPrec :: Int -> CmdAtomic -> ShowS Source # show :: CmdAtomic -> String Source # showList :: [CmdAtomic] -> ShowS Source #
Show HearMsg Source # |
Instance details Defined in Game.LambdaHack.Atomic.CmdAtomic Methods showsPrec :: Int -> HearMsg -> ShowS Source # show :: HearMsg -> String Source # showList :: [HearMsg] -> ShowS Source #
Show SfxAtomic Source # |
Instance details Defined in Game.LambdaHack.Atomic.CmdAtomic Methods showsPrec :: Int -> SfxAtomic -> ShowS Source # show :: SfxAtomic -> String Source # showList :: [SfxAtomic] -> ShowS Source #
Show SfxMsg Source # |
Instance details Defined in Game.LambdaHack.Atomic.CmdAtomic Methods showsPrec :: Int -> SfxMsg -> ShowS Source # show :: SfxMsg -> String Source # showList :: [SfxMsg] -> ShowS Source #
Show UpdAtomic Source # |
Instance details Defined in Game.LambdaHack.Atomic.CmdAtomic Methods showsPrec :: Int -> UpdAtomic -> ShowS Source # show :: UpdAtomic -> String Source # showList :: [UpdAtomic] -> ShowS Source #
Show AtomicFail Source # |
Instance details Defined in Game.LambdaHack.Atomic.MonadStateWrite Methods showsPrec :: Int -> AtomicFail -> ShowS Source # show :: AtomicFail -> String Source # showList :: [AtomicFail] -> ShowS Source #
Show PosAtomic Source # |
Instance details Defined in Game.LambdaHack.Atomic.PosAtomicRead Methods showsPrec :: Int -> PosAtomic -> ShowS Source # show :: PosAtomic -> String Source # showList :: [PosAtomic] -> ShowS Source #
Show AndPath Source # |
Instance details Defined in Game.LambdaHack.Client.Bfs Methods showsPrec :: Int -> AndPath -> ShowS Source # show :: AndPath -> String Source # showList :: [AndPath] -> ShowS Source #
Show BfsDistance Source # |
Instance details Defined in Game.LambdaHack.Client.Bfs Methods showsPrec :: Int -> BfsDistance -> ShowS Source # show :: BfsDistance -> String Source # showList :: [BfsDistance] -> ShowS Source #
Show FleeViaStairsOrEscape Source # |
Instance details Defined in Game.LambdaHack.Client.BfsM Methods showsPrec :: Int -> FleeViaStairsOrEscape -> ShowS Source # show :: FleeViaStairsOrEscape -> String Source # showList :: [FleeViaStairsOrEscape] -> ShowS Source #
Show ReqAI Source # |
Instance details Defined in Game.LambdaHack.Client.Request Methods showsPrec :: Int -> ReqAI -> ShowS Source # show :: ReqAI -> String Source # showList :: [ReqAI] -> ShowS Source #
Show ReqUI Source # |
Instance details Defined in Game.LambdaHack.Client.Request Methods showsPrec :: Int -> ReqUI -> ShowS Source # show :: ReqUI -> String Source # showList :: [ReqUI] -> ShowS Source #
Show RequestTimed Source # |
Instance details Defined in Game.LambdaHack.Client.Request Methods showsPrec :: Int -> RequestTimed -> ShowS Source # show :: RequestTimed -> String Source # showList :: [RequestTimed] -> ShowS Source #
Show Response Source # |
Instance details Defined in Game.LambdaHack.Client.Response Methods showsPrec :: Int -> Response -> ShowS Source # show :: Response -> String Source # showList :: [Response] -> ShowS Source #
Show BfsAndPath Source # |
Instance details Defined in Game.LambdaHack.Client.State Methods showsPrec :: Int -> BfsAndPath -> ShowS Source # show :: BfsAndPath -> String Source # showList :: [BfsAndPath] -> ShowS Source #
Show TGoal Source # |
Instance details Defined in Game.LambdaHack.Client.State Methods showsPrec :: Int -> TGoal -> ShowS Source # show :: TGoal -> String Source # showList :: [TGoal] -> ShowS Source #
Show Target Source # |
Instance details Defined in Game.LambdaHack.Client.State Methods showsPrec :: Int -> Target -> ShowS Source # show :: Target -> String Source # showList :: [Target] -> ShowS Source #
Show TgtAndPath Source # |
Instance details Defined in Game.LambdaHack.Client.State Methods showsPrec :: Int -> TgtAndPath -> ShowS Source # show :: TgtAndPath -> String Source # showList :: [TgtAndPath] -> ShowS Source #
Show ActorUI Source # |
Instance details Defined in Game.LambdaHack.Client.UI.ActorUI Methods showsPrec :: Int -> ActorUI -> ShowS Source # show :: ActorUI -> String Source # showList :: [ActorUI] -> ShowS Source #
Show Animation Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Animation Methods showsPrec :: Int -> Animation -> ShowS Source # show :: Animation -> String Source # showList :: [Animation] -> ShowS Source #
Show DetailLevel Source # |
Instance details Defined in Game.LambdaHack.Client.UI.EffectDescription Methods showsPrec :: Int -> DetailLevel -> ShowS Source # show :: DetailLevel -> String Source # showList :: [DetailLevel] -> ShowS Source #
Show SingleFrame Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Frame Methods showsPrec :: Int -> SingleFrame -> ShowS Source # show :: SingleFrame -> String Source # showList :: [SingleFrame] -> ShowS Source #
Show FailError Source # |
Instance details Defined in Game.LambdaHack.Client.UI.HandleHelperM Methods showsPrec :: Int -> FailError -> ShowS Source # show :: FailError -> String Source # showList :: [FailError] -> ShowS Source #
Show AimModeCmd Source # |
Instance details Defined in Game.LambdaHack.Client.UI.HumanCmd Methods showsPrec :: Int -> AimModeCmd -> ShowS Source # show :: AimModeCmd -> String Source # showList :: [AimModeCmd] -> ShowS Source #
Show CmdArea Source # |
Instance details Defined in Game.LambdaHack.Client.UI.HumanCmd Methods showsPrec :: Int -> CmdArea -> ShowS Source # show :: CmdArea -> String Source # showList :: [CmdArea] -> ShowS Source #
Show CmdCategory Source # |
Instance details Defined in Game.LambdaHack.Client.UI.HumanCmd Methods showsPrec :: Int -> CmdCategory -> ShowS Source # show :: CmdCategory -> String Source # showList :: [CmdCategory] -> ShowS Source #
Show HumanCmd Source # |
Instance details Defined in Game.LambdaHack.Client.UI.HumanCmd Methods showsPrec :: Int -> HumanCmd -> ShowS Source # show :: HumanCmd -> String Source # showList :: [HumanCmd] -> ShowS Source #
Show TriggerItem Source # |
Instance details Defined in Game.LambdaHack.Client.UI.HumanCmd Methods showsPrec :: Int -> TriggerItem -> ShowS Source # show :: TriggerItem -> String Source # showList :: [TriggerItem] -> ShowS Source #
Show ItemDialogState Source # |
Instance details Defined in Game.LambdaHack.Client.UI.InventoryM Methods showsPrec :: Int -> ItemDialogState -> ShowS Source # show :: ItemDialogState -> String Source # showList :: [ItemDialogState] -> ShowS Source #
Show ResultItemDialogMode Source # |
Instance details Defined in Game.LambdaHack.Client.UI.InventoryM Methods showsPrec :: Int -> ResultItemDialogMode -> ShowS Source # show :: ResultItemDialogMode -> String Source # showList :: [ResultItemDialogMode] -> ShowS Source #
Show KM Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Key Methods showsPrec :: Int -> KM -> ShowS Source # show :: KM -> String Source # showList :: [KM] -> ShowS Source #
Show Modifier Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Key Methods showsPrec :: Int -> Modifier -> ShowS Source # show :: Modifier -> String Source # showList :: [Modifier] -> ShowS Source #
Show History Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods showsPrec :: Int -> History -> ShowS Source # show :: History -> String Source # showList :: [History] -> ShowS Source #
Show Msg Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods showsPrec :: Int -> Msg -> ShowS Source # show :: Msg -> String Source # showList :: [Msg] -> ShowS Source #
Show MsgClass Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods showsPrec :: Int -> MsgClass -> ShowS Source # show :: MsgClass -> String Source # showList :: [MsgClass] -> ShowS Source #
Show MsgClassDistinct Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods showsPrec :: Int -> MsgClassDistinct -> ShowS Source # show :: MsgClassDistinct -> String Source # showList :: [MsgClassDistinct] -> ShowS Source #
Show MsgClassIgnore Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods showsPrec :: Int -> MsgClassIgnore -> ShowS Source # show :: MsgClassIgnore -> String Source # showList :: [MsgClassIgnore] -> ShowS Source #
Show MsgClassSave Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods showsPrec :: Int -> MsgClassSave -> ShowS Source # show :: MsgClassSave -> String Source # showList :: [MsgClassSave] -> ShowS Source #
Show MsgClassShow Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods showsPrec :: Int -> MsgClassShow -> ShowS Source # show :: MsgClassShow -> String Source # showList :: [MsgClassShow] -> ShowS Source #
Show MsgClassShowAndSave Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods showsPrec :: Int -> MsgClassShowAndSave -> ShowS Source # show :: MsgClassShowAndSave -> String Source # showList :: [MsgClassShowAndSave] -> ShowS Source #
Show RepMsgNK Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods showsPrec :: Int -> RepMsgNK -> ShowS Source # show :: RepMsgNK -> String Source # showList :: [RepMsgNK] -> ShowS Source #
Show Report Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods showsPrec :: Int -> Report -> ShowS Source # show :: Report -> String Source # showList :: [Report] -> ShowS Source #
Show AttrLine Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Overlay Methods showsPrec :: Int -> AttrLine -> ShowS Source # show :: AttrLine -> String Source # showList :: [AttrLine] -> ShowS Source #
Show DisplayFont Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Overlay Methods showsPrec :: Int -> DisplayFont -> ShowS Source # show :: DisplayFont -> String Source # showList :: [DisplayFont] -> ShowS Source #
Show FontSetup Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Overlay Methods showsPrec :: Int -> FontSetup -> ShowS Source # show :: FontSetup -> String Source # showList :: [FontSetup] -> ShowS Source #
Show PointSquare Source # |
Instance details Defined in Game.LambdaHack.Client.UI.PointUI Methods showsPrec :: Int -> PointSquare -> ShowS Source # show :: PointSquare -> String Source # showList :: [PointSquare] -> ShowS Source #
Show PointUI Source # |
Instance details Defined in Game.LambdaHack.Client.UI.PointUI Methods showsPrec :: Int -> PointUI -> ShowS Source # show :: PointUI -> String Source # showList :: [PointUI] -> ShowS Source #
Show AimMode Source # |
Instance details Defined in Game.LambdaHack.Client.UI.SessionUI Methods showsPrec :: Int -> AimMode -> ShowS Source # show :: AimMode -> String Source # showList :: [AimMode] -> ShowS Source #
Show ItemRoles Source # |
Instance details Defined in Game.LambdaHack.Client.UI.SessionUI Methods showsPrec :: Int -> ItemRoles -> ShowS Source # show :: ItemRoles -> String Source # showList :: [ItemRoles] -> ShowS Source #
Show KeyMacro Source # |
Instance details Defined in Game.LambdaHack.Client.UI.SessionUI Methods showsPrec :: Int -> KeyMacro -> ShowS Source # show :: KeyMacro -> String Source # showList :: [KeyMacro] -> ShowS Source #
Show KeyMacroFrame Source # |
Instance details Defined in Game.LambdaHack.Client.UI.SessionUI Methods showsPrec :: Int -> KeyMacroFrame -> ShowS Source # show :: KeyMacroFrame -> String Source # showList :: [KeyMacroFrame] -> ShowS Source #
Show RunParams Source # |
Instance details Defined in Game.LambdaHack.Client.UI.SessionUI Methods showsPrec :: Int -> RunParams -> ShowS Source # show :: RunParams -> String Source # showList :: [RunParams] -> ShowS Source #
Show ButtonWidth Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Slideshow Methods showsPrec :: Int -> ButtonWidth -> ShowS Source # show :: ButtonWidth -> String Source # showList :: [ButtonWidth] -> ShowS Source #
Show MenuSlot Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Slideshow Methods showsPrec :: Int -> MenuSlot -> ShowS Source # show :: MenuSlot -> String Source # showList :: [MenuSlot] -> ShowS Source #
Show Slideshow Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Slideshow Methods showsPrec :: Int -> Slideshow -> ShowS Source # show :: Slideshow -> String Source # showList :: [Slideshow] -> ShowS Source #
Show UIOptions Source # |
Instance details Defined in Game.LambdaHack.Client.UI.UIOptions Methods showsPrec :: Int -> UIOptions -> ShowS Source # show :: UIOptions -> String Source # showList :: [UIOptions] -> ShowS Source #
Show Actor Source # |
Instance details Defined in Game.LambdaHack.Common.Actor Methods showsPrec :: Int -> Actor -> ShowS Source # show :: Actor -> String Source # showList :: [Actor] -> ShowS Source #
Show ResDelta Source # |
Instance details Defined in Game.LambdaHack.Common.Actor Methods showsPrec :: Int -> ResDelta -> ShowS Source # show :: ResDelta -> String Source # showList :: [ResDelta] -> ShowS Source #
Show Watchfulness Source # |
Instance details Defined in Game.LambdaHack.Common.Actor Methods showsPrec :: Int -> Watchfulness -> ShowS Source # show :: Watchfulness -> String Source # showList :: [Watchfulness] -> ShowS Source #
Show Analytics Source # |
Instance details Defined in Game.LambdaHack.Common.Analytics Methods showsPrec :: Int -> Analytics -> ShowS Source # show :: Analytics -> String Source # showList :: [Analytics] -> ShowS Source #
Show KillHow Source # |
Instance details Defined in Game.LambdaHack.Common.Analytics Methods showsPrec :: Int -> KillHow -> ShowS Source # show :: KillHow -> String Source # showList :: [KillHow] -> ShowS Source #
Show Area Source # |
Instance details Defined in Game.LambdaHack.Common.Area Methods showsPrec :: Int -> Area -> ShowS Source # show :: Area -> String Source # showList :: [Area] -> ShowS Source #
Show ClientOptions Source # |
Instance details Defined in Game.LambdaHack.Common.ClientOptions Methods showsPrec :: Int -> ClientOptions -> ShowS Source # show :: ClientOptions -> String Source # showList :: [ClientOptions] -> ShowS Source #
Show FullscreenMode Source # |
Instance details Defined in Game.LambdaHack.Common.ClientOptions Methods showsPrec :: Int -> FullscreenMode -> ShowS Source # show :: FullscreenMode -> String Source # showList :: [FullscreenMode] -> ShowS Source #
Show Challenge Source # |
Instance details Defined in Game.LambdaHack.Common.Faction Methods showsPrec :: Int -> Challenge -> ShowS Source # show :: Challenge -> String Source # showList :: [Challenge] -> ShowS Source #
Show Diplomacy Source # |
Instance details Defined in Game.LambdaHack.Common.Faction Methods showsPrec :: Int -> Diplomacy -> ShowS Source # show :: Diplomacy -> String Source # showList :: [Diplomacy] -> ShowS Source #
Show Faction Source # |
Instance details Defined in Game.LambdaHack.Common.Faction Methods showsPrec :: Int -> Faction -> ShowS Source # show :: Faction -> String Source # showList :: [Faction] -> ShowS Source #
Show Status Source # |
Instance details Defined in Game.LambdaHack.Common.Faction Methods showsPrec :: Int -> Status -> ShowS Source # show :: Status -> String Source # showList :: [Status] -> ShowS Source #
Show ScoreTable Source # |
Instance details Defined in Game.LambdaHack.Common.HighScore Methods showsPrec :: Int -> ScoreTable -> ShowS Source # show :: ScoreTable -> String Source # showList :: [ScoreTable] -> ShowS Source #
Show Benefit Source # |
Instance details Defined in Game.LambdaHack.Common.Item Methods showsPrec :: Int -> Benefit -> ShowS Source # show :: Benefit -> String Source # showList :: [Benefit] -> ShowS Source #
Show Item Source # |
Instance details Defined in Game.LambdaHack.Common.Item Methods showsPrec :: Int -> Item -> ShowS Source # show :: Item -> String Source # showList :: [Item] -> ShowS Source #
Show ItemDisco Source # |
Instance details Defined in Game.LambdaHack.Common.Item Methods showsPrec :: Int -> ItemDisco -> ShowS Source # show :: ItemDisco -> String Source # showList :: [ItemDisco] -> ShowS Source #
Show ItemFull Source # |
Instance details Defined in Game.LambdaHack.Common.Item Methods showsPrec :: Int -> ItemFull -> ShowS Source # show :: ItemFull -> String Source # showList :: [ItemFull] -> ShowS Source #
Show ItemIdentity Source # |
Instance details Defined in Game.LambdaHack.Common.Item Methods showsPrec :: Int -> ItemIdentity -> ShowS Source # show :: ItemIdentity -> String Source # showList :: [ItemIdentity] -> ShowS Source #
Show ItemKindIx Source # |
Instance details Defined in Game.LambdaHack.Common.Item Methods showsPrec :: Int -> ItemKindIx -> ShowS Source # show :: ItemKindIx -> String Source # showList :: [ItemKindIx] -> ShowS Source #
Show ItemTimer Source # |
Instance details Defined in Game.LambdaHack.Common.Item Methods showsPrec :: Int -> ItemTimer -> ShowS Source # show :: ItemTimer -> String Source # showList :: [ItemTimer] -> ShowS Source #
Show TileAction Source # |
Instance details Defined in Game.LambdaHack.Common.Item Methods showsPrec :: Int -> TileAction -> ShowS Source # show :: TileAction -> String Source # showList :: [TileAction] -> ShowS Source #
Show AspectRecord Source # |
Instance details Defined in Game.LambdaHack.Common.ItemAspect Methods showsPrec :: Int -> AspectRecord -> ShowS Source # show :: AspectRecord -> String Source # showList :: [AspectRecord] -> ShowS Source #
Show KindMean Source # |
Instance details Defined in Game.LambdaHack.Common.ItemAspect Methods showsPrec :: Int -> KindMean -> ShowS Source # show :: KindMean -> String Source # showList :: [KindMean] -> ShowS Source #
Show COps Source # |
Instance details Defined in Game.LambdaHack.Common.Kind Methods showsPrec :: Int -> COps -> ShowS Source # show :: COps -> String Source # showList :: [COps] -> ShowS Source #
Show Level Source # |
Instance details Defined in Game.LambdaHack.Common.Level Methods showsPrec :: Int -> Level -> ShowS Source # show :: Level -> String Source # showList :: [Level] -> ShowS Source #
Show FontDefinition Source # |
Instance details Defined in Game.LambdaHack.Common.Misc Methods showsPrec :: Int -> FontDefinition -> ShowS Source # show :: FontDefinition -> String Source # showList :: [FontDefinition] -> ShowS Source #
Show FontSet Source # |
Instance details Defined in Game.LambdaHack.Common.Misc Methods showsPrec :: Int -> FontSet -> ShowS Source # show :: FontSet -> String Source # showList :: [FontSet] -> ShowS Source #
Show HintingMode Source # |
Instance details Defined in Game.LambdaHack.Common.Misc Methods showsPrec :: Int -> HintingMode -> ShowS Source # show :: HintingMode -> String Source # showList :: [HintingMode] -> ShowS Source #
Show PerSmelled Source # |
Instance details Defined in Game.LambdaHack.Common.Perception Methods showsPrec :: Int -> PerSmelled -> ShowS Source # show :: PerSmelled -> String Source # showList :: [PerSmelled] -> ShowS Source #
Show PerVisible Source # |
Instance details Defined in Game.LambdaHack.Common.Perception Methods showsPrec :: Int -> PerVisible -> ShowS Source # show :: PerVisible -> String Source # showList :: [PerVisible] -> ShowS Source #
Show Perception Source # |
Instance details Defined in Game.LambdaHack.Common.Perception Methods showsPrec :: Int -> Perception -> ShowS Source # show :: Perception -> String Source # showList :: [Perception] -> ShowS Source #
Show Point Source # |
Instance details Defined in Game.LambdaHack.Common.Point Methods showsPrec :: Int -> Point -> ShowS Source # show :: Point -> String Source # showList :: [Point] -> ShowS Source #
Show ReqFailure Source # |
Instance details Defined in Game.LambdaHack.Common.ReqFailure Methods showsPrec :: Int -> ReqFailure -> ShowS Source # show :: ReqFailure -> String Source # showList :: [ReqFailure] -> ShowS Source #
Show State Source # |
Instance details Defined in Game.LambdaHack.Common.State Methods showsPrec :: Int -> State -> ShowS Source # show :: State -> String Source # showList :: [State] -> ShowS Source #
Show Speed Source # |
Instance details Defined in Game.LambdaHack.Common.Time Methods showsPrec :: Int -> Speed -> ShowS Source # show :: Speed -> String Source # showList :: [Speed] -> ShowS Source #
Show Time Source # |
Instance details Defined in Game.LambdaHack.Common.Time Methods showsPrec :: Int -> Time -> ShowS Source # show :: Time -> String Source # showList :: [Time] -> ShowS Source #
Show ActorId Source # |
Instance details Defined in Game.LambdaHack.Common.Types Methods showsPrec :: Int -> ActorId -> ShowS Source # show :: ActorId -> String Source # showList :: [ActorId] -> ShowS Source #
Show Container Source # |
Instance details Defined in Game.LambdaHack.Common.Types Methods showsPrec :: Int -> Container -> ShowS Source # show :: Container -> String Source # showList :: [Container] -> ShowS Source #
Show FactionId Source # |
Instance details Defined in Game.LambdaHack.Common.Types Methods showsPrec :: Int -> FactionId -> ShowS Source # show :: FactionId -> String Source # showList :: [FactionId] -> ShowS Source #
Show ItemId Source # |
Instance details Defined in Game.LambdaHack.Common.Types Methods showsPrec :: Int -> ItemId -> ShowS Source # show :: ItemId -> String Source # showList :: [ItemId] -> ShowS Source #
Show LevelId Source # |
Instance details Defined in Game.LambdaHack.Common.Types Methods showsPrec :: Int -> LevelId -> ShowS Source # show :: LevelId -> String Source # showList :: [LevelId] -> ShowS Source #
Show Vector Source # |
Instance details Defined in Game.LambdaHack.Common.Vector Methods showsPrec :: Int -> Vector -> ShowS Source # show :: Vector -> String Source # showList :: [Vector] -> ShowS Source #
Show CaveKind Source # |
Instance details Defined in Game.LambdaHack.Content.CaveKind Methods showsPrec :: Int -> CaveKind -> ShowS Source # show :: CaveKind -> String Source # showList :: [CaveKind] -> ShowS Source #
Show InitSleep Source # |
Instance details Defined in Game.LambdaHack.Content.CaveKind Methods showsPrec :: Int -> InitSleep -> ShowS Source # show :: InitSleep -> String Source # showList :: [InitSleep] -> ShowS Source #
Show FactionKind Source # |
Instance details Defined in Game.LambdaHack.Content.FactionKind Methods showsPrec :: Int -> FactionKind -> ShowS Source # show :: FactionKind -> String Source # showList :: [FactionKind] -> ShowS Source #
Show HiIndeterminant Source # |
Instance details Defined in Game.LambdaHack.Content.FactionKind Methods showsPrec :: Int -> HiIndeterminant -> ShowS Source # show :: HiIndeterminant -> String Source # showList :: [HiIndeterminant] -> ShowS Source #
Show Outcome Source # |
Instance details Defined in Game.LambdaHack.Content.FactionKind Methods showsPrec :: Int -> Outcome -> ShowS Source # show :: Outcome -> String Source # showList :: [Outcome] -> ShowS Source #
Show TeamContinuity Source # |
Instance details Defined in Game.LambdaHack.Content.FactionKind Methods showsPrec :: Int -> TeamContinuity -> ShowS Source # show :: TeamContinuity -> String Source # showList :: [TeamContinuity] -> ShowS Source #
Show Aspect Source # |
Instance details Defined in Game.LambdaHack.Content.ItemKind Methods showsPrec :: Int -> Aspect -> ShowS Source # show :: Aspect -> String Source # showList :: [Aspect] -> ShowS Source #
Show Condition Source # |
Instance details Defined in Game.LambdaHack.Content.ItemKind Methods showsPrec :: Int -> Condition -> ShowS Source # show :: Condition -> String Source # showList :: [Condition] -> ShowS Source #
Show DetectKind Source # |
Instance details Defined in Game.LambdaHack.Content.ItemKind Methods showsPrec :: Int -> DetectKind -> ShowS Source # show :: DetectKind -> String Source # showList :: [DetectKind] -> ShowS Source #
Show Effect Source # |
Instance details Defined in Game.LambdaHack.Content.ItemKind Methods showsPrec :: Int -> Effect -> ShowS Source # show :: Effect -> String Source # showList :: [Effect] -> ShowS Source #
Show ItemKind Source # |
Instance details Defined in Game.LambdaHack.Content.ItemKind Methods showsPrec :: Int -> ItemKind -> ShowS Source # show :: ItemKind -> String Source # showList :: [ItemKind] -> ShowS Source #
Show ThrowMod Source # |
Instance details Defined in Game.LambdaHack.Content.ItemKind Methods showsPrec :: Int -> ThrowMod -> ShowS Source # show :: ThrowMod -> String Source # showList :: [ThrowMod] -> ShowS Source #
Show TimerDice Source # |
Instance details Defined in Game.LambdaHack.Content.ItemKind Methods showsPrec :: Int -> TimerDice -> ShowS Source # show :: TimerDice -> String Source # showList :: [TimerDice] -> ShowS Source #
Show ModeKind Source # |
Instance details Defined in Game.LambdaHack.Content.ModeKind Methods showsPrec :: Int -> ModeKind -> ShowS Source # show :: ModeKind -> String Source # showList :: [ModeKind] -> ShowS Source #
Show Cover Source # |
Instance details Defined in Game.LambdaHack.Content.PlaceKind Methods showsPrec :: Int -> Cover -> ShowS Source # show :: Cover -> String Source # showList :: [Cover] -> ShowS Source #
Show Fence Source # |
Instance details Defined in Game.LambdaHack.Content.PlaceKind Methods showsPrec :: Int -> Fence -> ShowS Source # show :: Fence -> String Source # showList :: [Fence] -> ShowS Source #
Show PlaceEntry Source # |
Instance details Defined in Game.LambdaHack.Content.PlaceKind Methods showsPrec :: Int -> PlaceEntry -> ShowS Source # show :: PlaceEntry -> String Source # showList :: [PlaceEntry] -> ShowS Source #
Show PlaceKind Source # |
Instance details Defined in Game.LambdaHack.Content.PlaceKind Methods showsPrec :: Int -> PlaceKind -> ShowS Source # show :: PlaceKind -> String Source # showList :: [PlaceKind] -> ShowS Source #
Show Feature Source # |
Instance details Defined in Game.LambdaHack.Content.TileKind Methods showsPrec :: Int -> Feature -> ShowS Source # show :: Feature -> String Source # showList :: [Feature] -> ShowS Source #
Show ProjectileTriggers Source # |
Instance details Defined in Game.LambdaHack.Content.TileKind Methods showsPrec :: Int -> ProjectileTriggers -> ShowS Source # show :: ProjectileTriggers -> String Source # showList :: [ProjectileTriggers] -> ShowS Source #
Show TileKind Source # |
Instance details Defined in Game.LambdaHack.Content.TileKind Methods showsPrec :: Int -> TileKind -> ShowS Source # show :: TileKind -> String Source # showList :: [TileKind] -> ShowS Source #
Show AbsDepth Source # |
Instance details Defined in Game.LambdaHack.Core.Dice Methods showsPrec :: Int -> AbsDepth -> ShowS Source # show :: AbsDepth -> String Source # showList :: [AbsDepth] -> ShowS Source #
Show Dice Source # |
Instance details Defined in Game.LambdaHack.Core.Dice Methods showsPrec :: Int -> Dice -> ShowS Source # show :: Dice -> String Source # showList :: [Dice] -> ShowS Source #
Show DiceXY Source # |
Instance details Defined in Game.LambdaHack.Core.Dice Methods showsPrec :: Int -> DiceXY -> ShowS Source # show :: DiceXY -> String Source # showList :: [DiceXY] -> ShowS Source #
Show ActivationFlag Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods showsPrec :: Int -> ActivationFlag -> ShowS Source # show :: ActivationFlag -> String Source # showList :: [ActivationFlag] -> ShowS Source #
Show Doctrine Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods showsPrec :: Int -> Doctrine -> ShowS Source # show :: Doctrine -> String Source # showList :: [Doctrine] -> ShowS Source #
Show EqpSlot Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods showsPrec :: Int -> EqpSlot -> ShowS Source # show :: EqpSlot -> String Source # showList :: [EqpSlot] -> ShowS Source #
Show Flag Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods showsPrec :: Int -> Flag -> ShowS Source # show :: Flag -> String Source # showList :: [Flag] -> ShowS Source #
Show Flags Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods showsPrec :: Int -> Flags -> ShowS Source # show :: Flags -> String Source # showList :: [Flags] -> ShowS Source #
Show Skill Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods showsPrec :: Int -> Skill -> ShowS Source # show :: Skill -> String Source # showList :: [Skill] -> ShowS Source #
Show Skills Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods showsPrec :: Int -> Skills -> ShowS Source # show :: Skills -> String Source # showList :: [Skills] -> ShowS Source #
Show Attr Source # |
Instance details Defined in Game.LambdaHack.Definition.Color Methods showsPrec :: Int -> Attr -> ShowS Source # show :: Attr -> String Source # showList :: [Attr] -> ShowS Source #
Show AttrChar Source # |
Instance details Defined in Game.LambdaHack.Definition.Color Methods showsPrec :: Int -> AttrChar -> ShowS Source # show :: AttrChar -> String Source # showList :: [AttrChar] -> ShowS Source #
Show AttrCharW32 Source # |
Instance details Defined in Game.LambdaHack.Definition.Color Methods showsPrec :: Int -> AttrCharW32 -> ShowS Source # show :: AttrCharW32 -> String Source # showList :: [AttrCharW32] -> ShowS Source #
Show Color Source # |
Instance details Defined in Game.LambdaHack.Definition.Color Methods showsPrec :: Int -> Color -> ShowS Source # show :: Color -> String Source # showList :: [Color] -> ShowS Source #
Show Highlight Source # |
Instance details Defined in Game.LambdaHack.Definition.Color Methods showsPrec :: Int -> Highlight -> ShowS Source # show :: Highlight -> String Source # showList :: [Highlight] -> ShowS Source #
Show CStore Source # |
Instance details Defined in Game.LambdaHack.Definition.Defs Methods showsPrec :: Int -> CStore -> ShowS Source # show :: CStore -> String Source # showList :: [CStore] -> ShowS Source #
Show Direction Source # |
Instance details Defined in Game.LambdaHack.Definition.Defs Methods showsPrec :: Int -> Direction -> ShowS Source # show :: Direction -> String Source # showList :: [Direction] -> ShowS Source #
Show ItemDialogMode Source # |
Instance details Defined in Game.LambdaHack.Definition.Defs Methods showsPrec :: Int -> ItemDialogMode -> ShowS Source # show :: ItemDialogMode -> String Source # showList :: [ItemDialogMode] -> ShowS Source #
Show SLore Source # |
Instance details Defined in Game.LambdaHack.Definition.Defs Methods showsPrec :: Int -> SLore -> ShowS Source # show :: SLore -> String Source # showList :: [SLore] -> ShowS Source #
Show FancyName Source # |
Instance details Defined in Game.LambdaHack.Definition.Flavour Methods showsPrec :: Int -> FancyName -> ShowS Source # show :: FancyName -> String Source # showList :: [FancyName] -> ShowS Source #
Show Flavour Source # |
Instance details Defined in Game.LambdaHack.Definition.Flavour Methods showsPrec :: Int -> Flavour -> ShowS Source # show :: Flavour -> String Source # showList :: [Flavour] -> ShowS Source #
Show DebugAid Source # |
Instance details Defined in Game.LambdaHack.Server.DebugM Methods showsPrec :: Int -> DebugAid -> ShowS Source # show :: DebugAid -> String Source # showList :: [DebugAid] -> ShowS Source #
Show SpecialArea Source # |
Instance details Defined in Game.LambdaHack.Server.DungeonGen.AreaRnd Methods showsPrec :: Int -> SpecialArea -> ShowS Source # show :: SpecialArea -> String Source # showList :: [SpecialArea] -> ShowS Source #
Show Cave Source # |
Instance details Defined in Game.LambdaHack.Server.DungeonGen.Cave Methods showsPrec :: Int -> Cave -> ShowS Source # show :: Cave -> String Source # showList :: [Cave] -> ShowS Source #
Show Place Source # |
Instance details Defined in Game.LambdaHack.Server.DungeonGen.Place Methods showsPrec :: Int -> Place -> ShowS Source # show :: Place -> String Source # showList :: [Place] -> ShowS Source #
Show CacheBeforeLucid Source # |
Instance details Defined in Game.LambdaHack.Server.Fov Methods showsPrec :: Int -> CacheBeforeLucid -> ShowS Source # show :: CacheBeforeLucid -> String Source # showList :: [CacheBeforeLucid] -> ShowS Source #
Show FovClear Source # |
Instance details Defined in Game.LambdaHack.Server.Fov Methods showsPrec :: Int -> FovClear -> ShowS Source # show :: FovClear -> String Source # showList :: [FovClear] -> ShowS Source #
Show FovLit Source # |
Instance details Defined in Game.LambdaHack.Server.Fov Methods showsPrec :: Int -> FovLit -> ShowS Source # show :: FovLit -> String Source # showList :: [FovLit] -> ShowS Source #
Show FovLucid Source # |
Instance details Defined in Game.LambdaHack.Server.Fov Methods showsPrec :: Int -> FovLucid -> ShowS Source # show :: FovLucid -> String Source # showList :: [FovLucid] -> ShowS Source #
Show FovShine Source # |
Instance details Defined in Game.LambdaHack.Server.Fov Methods showsPrec :: Int -> FovShine -> ShowS Source # show :: FovShine -> String Source # showList :: [FovShine] -> ShowS Source #
Show PerReachable Source # |
Instance details Defined in Game.LambdaHack.Server.Fov Methods showsPrec :: Int -> PerReachable -> ShowS Source # show :: PerReachable -> String Source # showList :: [PerReachable] -> ShowS Source #
Show PerceptionCache Source # |
Instance details Defined in Game.LambdaHack.Server.Fov Methods showsPrec :: Int -> PerceptionCache -> ShowS Source # show :: PerceptionCache -> String Source # showList :: [PerceptionCache] -> ShowS Source #
Show Bump Source # |
Instance details Defined in Game.LambdaHack.Server.FovDigital Methods showsPrec :: Int -> Bump -> ShowS Source # show :: Bump -> String Source # showList :: [Bump] -> ShowS Source #
Show CHull Source # |
Instance details Defined in Game.LambdaHack.Server.FovDigital Methods showsPrec :: Int -> CHull -> ShowS Source # show :: CHull -> String Source # showList :: [CHull] -> ShowS Source #
Show ConvexHull Source # |
Instance details Defined in Game.LambdaHack.Server.FovDigital Methods showsPrec :: Int -> ConvexHull -> ShowS Source # show :: ConvexHull -> String Source # showList :: [ConvexHull] -> ShowS Source #
Show Line Source # |
Instance details Defined in Game.LambdaHack.Server.FovDigital Methods showsPrec :: Int -> Line -> ShowS Source # show :: Line -> String Source # showList :: [Line] -> ShowS Source #
Show DiscoveryKindRev Source # |
Instance details Defined in Game.LambdaHack.Server.ItemRev Methods showsPrec :: Int -> DiscoveryKindRev -> ShowS Source # show :: DiscoveryKindRev -> String Source # showList :: [DiscoveryKindRev] -> ShowS Source #
Show FlavourMap Source # |
Instance details Defined in Game.LambdaHack.Server.ItemRev Methods showsPrec :: Int -> FlavourMap -> ShowS Source # show :: FlavourMap -> String Source # showList :: [FlavourMap] -> ShowS Source #
Show ItemKnown Source # |
Instance details Defined in Game.LambdaHack.Server.ItemRev Methods showsPrec :: Int -> ItemKnown -> ShowS Source # show :: ItemKnown -> String Source # showList :: [ItemKnown] -> ShowS Source #
Show RNGs Source # |
Instance details Defined in Game.LambdaHack.Server.ServerOptions Methods showsPrec :: Int -> RNGs -> ShowS Source # show :: RNGs -> String Source # showList :: [RNGs] -> ShowS Source #
Show ServerOptions Source # |
Instance details Defined in Game.LambdaHack.Server.ServerOptions Methods showsPrec :: Int -> ServerOptions -> ShowS Source # show :: ServerOptions -> String Source # showList :: [ServerOptions] -> ShowS Source #
Show StateServer Source # |
Instance details Defined in Game.LambdaHack.Server.State Methods showsPrec :: Int -> StateServer -> ShowS Source # show :: StateServer -> String Source # showList :: [StateServer] -> ShowS Source #
Show ASCIIString |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> ASCIIString -> ShowS Source # show :: ASCIIString -> String Source # showList :: [ASCIIString] -> ShowS Source #
Show PrintableString |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> PrintableString -> ShowS Source # show :: PrintableString -> String Source # showList :: [PrintableString] -> ShowS Source #
Show UnicodeString |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> UnicodeString -> ShowS Source # show :: UnicodeString -> String Source # showList :: [UnicodeString] -> ShowS Source #
Show A |
Instance details Defined in Test.QuickCheck.Poly Methods showsPrec :: Int -> A -> ShowS Source # show :: A -> String Source # showList :: [A] -> ShowS Source #
Show B |
Instance details Defined in Test.QuickCheck.Poly Methods showsPrec :: Int -> B -> ShowS Source # show :: B -> String Source # showList :: [B] -> ShowS Source #
Show C |
Instance details Defined in Test.QuickCheck.Poly Methods showsPrec :: Int -> C -> ShowS Source # show :: C -> String Source # showList :: [C] -> ShowS Source #
Show OrdA |
Instance details Defined in Test.QuickCheck.Poly Methods showsPrec :: Int -> OrdA -> ShowS Source # show :: OrdA -> String Source # showList :: [OrdA] -> ShowS Source #
Show OrdB |
Instance details Defined in Test.QuickCheck.Poly Methods showsPrec :: Int -> OrdB -> ShowS Source # show :: OrdB -> String Source # showList :: [OrdB] -> ShowS Source #
Show OrdC |
Instance details Defined in Test.QuickCheck.Poly Methods showsPrec :: Int -> OrdC -> ShowS Source # show :: OrdC -> String Source # showList :: [OrdC] -> ShowS Source #
Show Witness |
Instance details Defined in Test.QuickCheck.Property Methods showsPrec :: Int -> Witness -> ShowS Source # show :: Witness -> String Source # showList :: [Witness] -> ShowS Source #
Show QCGen |
Instance details Defined in Test.QuickCheck.Random Methods showsPrec :: Int -> QCGen -> ShowS Source # show :: QCGen -> String Source # showList :: [QCGen] -> ShowS Source #
Show Confidence |
Instance details Defined in Test.QuickCheck.State Methods showsPrec :: Int -> Confidence -> ShowS Source # show :: Confidence -> String Source # showList :: [Confidence] -> ShowS Source #
Show Args |
Instance details Defined in Test.QuickCheck.Test Methods showsPrec :: Int -> Args -> ShowS Source # show :: Args -> String Source # showList :: [Args] -> ShowS Source #
Show Result |
Instance details Defined in Test.QuickCheck.Test Methods showsPrec :: Int -> Result -> ShowS Source # show :: Result -> String Source # showList :: [Result] -> ShowS Source #
Show Cell |
Instance details Defined in Test.QuickCheck.Text Methods showsPrec :: Int -> Cell -> ShowS Source # show :: Cell -> String Source # showList :: [Cell] -> ShowS Source #
Show Str |
Instance details Defined in Test.QuickCheck.Text Methods showsPrec :: Int -> Str -> ShowS Source # show :: Str -> String Source # showList :: [Str] -> ShowS Source #
Show AesonException |
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> AesonException -> ShowS Source # show :: AesonException -> String Source # showList :: [AesonException] -> ShowS Source #
Show DotNetTime |
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> DotNetTime -> ShowS Source # show :: DotNetTime -> String Source # showList :: [DotNetTime] -> ShowS Source #
Show JSONPathElement |
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> JSONPathElement -> ShowS Source # show :: JSONPathElement -> String Source # showList :: [JSONPathElement] -> ShowS Source #
Show Options |
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> Options -> ShowS Source # show :: Options -> String Source # showList :: [Options] -> ShowS Source #
Show SumEncoding |
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> SumEncoding -> ShowS Source # show :: SumEncoding -> String Source # showList :: [SumEncoding] -> ShowS Source #
Show Value |
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> Value -> ShowS Source # show :: Value -> String Source # showList :: [Value] -> ShowS Source #
Show BlinkSpeed |
Instance details Defined in System.Console.ANSI.Types Methods showsPrec :: Int -> BlinkSpeed -> ShowS Source # show :: BlinkSpeed -> String Source # showList :: [BlinkSpeed] -> ShowS Source #
Show Color |
Instance details Defined in System.Console.ANSI.Types Methods showsPrec :: Int -> Color -> ShowS Source # show :: Color -> String Source # showList :: [Color] -> ShowS Source #
Show ColorIntensity |
Instance details Defined in System.Console.ANSI.Types Methods showsPrec :: Int -> ColorIntensity -> ShowS Source # show :: ColorIntensity -> String Source # showList :: [ColorIntensity] -> ShowS Source #
Show ConsoleIntensity |
Instance details Defined in System.Console.ANSI.Types Methods showsPrec :: Int -> ConsoleIntensity -> ShowS Source # show :: ConsoleIntensity -> String Source # showList :: [ConsoleIntensity] -> ShowS Source #
Show ConsoleLayer |
Instance details Defined in System.Console.ANSI.Types Methods showsPrec :: Int -> ConsoleLayer -> ShowS Source # show :: ConsoleLayer -> String Source # showList :: [ConsoleLayer] -> ShowS Source #
Show SGR |
Instance details Defined in System.Console.ANSI.Types Methods showsPrec :: Int -> SGR -> ShowS Source # show :: SGR -> String Source # showList :: [SGR] -> ShowS Source #
Show Underlining |
Instance details Defined in System.Console.ANSI.Types Methods showsPrec :: Int -> Underlining -> ShowS Source # show :: Underlining -> String Source # showList :: [Underlining] -> ShowS Source #
Show AsyncCancelled |
Instance details Defined in Control.Concurrent.Async.Internal Methods showsPrec :: Int -> AsyncCancelled -> ShowS Source # show :: AsyncCancelled -> String Source # showList :: [AsyncCancelled] -> ShowS Source #
Show ExceptionInLinkedThread |
Instance details Defined in Control.Concurrent.Async.Internal Methods showsPrec :: Int -> ExceptionInLinkedThread -> ShowS Source # show :: ExceptionInLinkedThread -> String Source # showList :: [ExceptionInLinkedThread] -> ShowS Source #
Show ByteArray | Since: base-4.17.0.0
Instance details Defined in Data.Array.Byte Methods showsPrec :: Int -> ByteArray -> ShowS Source # show :: ByteArray -> String Source # showList :: [ByteArray] -> ShowS Source #
Show Timeout | Since: base-4.0
Instance details Defined in System.Timeout Methods showsPrec :: Int -> Timeout -> ShowS Source # show :: Timeout -> String Source # showList :: [Timeout] -> ShowS Source #
Show Builder | Since: bytestring-0.11.1.0
Instance details Defined in Data.ByteString.Builder Methods showsPrec :: Int -> Builder -> ShowS Source # show :: Builder -> String Source # showList :: [Builder] -> ShowS Source #
Show FormatMode |
Instance details Defined in Data.ByteString.Builder.RealFloat Methods showsPrec :: Int -> FormatMode -> ShowS Source # show :: FormatMode -> String Source # showList :: [FormatMode] -> ShowS Source #
Show ByteString |
Instance details Defined in Data.ByteString.Internal.Type Methods showsPrec :: Int -> ByteString -> ShowS Source # show :: ByteString -> String Source # showList :: [ByteString] -> ShowS Source #
Show SizeOverflowException |
Instance details Defined in Data.ByteString.Internal.Type Methods showsPrec :: Int -> SizeOverflowException -> ShowS Source # show :: SizeOverflowException -> String Source # showList :: [SizeOverflowException] -> ShowS Source #
Show ByteString |
Instance details Defined in Data.ByteString.Lazy.Internal Methods showsPrec :: Int -> ByteString -> ShowS Source # show :: ByteString -> String Source # showList :: [ByteString] -> ShowS Source #
Show ShortByteString |
Instance details Defined in Data.ByteString.Short.Internal Methods showsPrec :: Int -> ShortByteString -> ShowS Source # show :: ShortByteString -> String Source # showList :: [ShortByteString] -> ShowS Source #
Show IntSet |
Instance details Defined in Data.IntSet.Internal Methods showsPrec :: Int -> IntSet -> ShowS Source # show :: IntSet -> String Source # showList :: [IntSet] -> ShowS Source #
Show BitQueue |
Instance details Defined in Utils.Containers.Internal.BitQueue Methods showsPrec :: Int -> BitQueue -> ShowS Source # show :: BitQueue -> String Source # showList :: [BitQueue] -> ShowS Source #
Show BitQueueB |
Instance details Defined in Utils.Containers.Internal.BitQueue Methods showsPrec :: Int -> BitQueueB -> ShowS Source # show :: BitQueueB -> String Source # showList :: [BitQueueB] -> ShowS Source #
Show ForeignSrcLang |
Instance details Defined in GHC.ForeignSrcLang.Type Methods showsPrec :: Int -> ForeignSrcLang -> ShowS Source # show :: ForeignSrcLang -> String Source # showList :: [ForeignSrcLang] -> ShowS Source #
Show Extension |
Instance details Defined in GHC.LanguageExtensions.Type Methods showsPrec :: Int -> Extension -> ShowS Source # show :: Extension -> String Source # showList :: [Extension] -> ShowS Source #
Show Void | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Void -> ShowS Source # show :: Void -> String Source # showList :: [Void] -> ShowS Source #
Show ByteOrder | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.ByteOrder Methods showsPrec :: Int -> ByteOrder -> ShowS Source # show :: ByteOrder -> String Source # showList :: [ByteOrder] -> ShowS Source #
Show BlockReason | Since: base-4.3.0.0
Instance details Defined in GHC.Internal.Conc.Sync Methods showsPrec :: Int -> BlockReason -> ShowS Source # show :: BlockReason -> String Source # showList :: [BlockReason] -> ShowS Source #
Show ThreadId | Since: base-4.2.0.0
Instance details Defined in GHC.Internal.Conc.Sync Methods showsPrec :: Int -> ThreadId -> ShowS Source # show :: ThreadId -> String Source # showList :: [ThreadId] -> ShowS Source #
Show ThreadStatus | Since: base-4.3.0.0
Instance details Defined in GHC.Internal.Conc.Sync Methods showsPrec :: Int -> ThreadStatus -> ShowS Source # show :: ThreadStatus -> String Source # showList :: [ThreadStatus] -> ShowS Source #
Show NestedAtomically | Since: base-4.0
Instance details Defined in GHC.Internal.Control.Exception.Base Methods showsPrec :: Int -> NestedAtomically -> ShowS Source # show :: NestedAtomically -> String Source # showList :: [NestedAtomically] -> ShowS Source #
Show NoMatchingContinuationPrompt | Since: base-4.18
Instance details Defined in GHC.Internal.Control.Exception.Base Methods showsPrec :: Int -> NoMatchingContinuationPrompt -> ShowS Source # show :: NoMatchingContinuationPrompt -> String Source # showList :: [NoMatchingContinuationPrompt] -> ShowS Source #
Show NoMethodError | Since: base-4.0
Instance details Defined in GHC.Internal.Control.Exception.Base Methods showsPrec :: Int -> NoMethodError -> ShowS Source # show :: NoMethodError -> String Source # showList :: [NoMethodError] -> ShowS Source #
Show NonTermination | Since: base-4.0
Instance details Defined in GHC.Internal.Control.Exception.Base Methods showsPrec :: Int -> NonTermination -> ShowS Source # show :: NonTermination -> String Source # showList :: [NonTermination] -> ShowS Source #
Show PatternMatchFail | Since: base-4.0
Instance details Defined in GHC.Internal.Control.Exception.Base Methods showsPrec :: Int -> PatternMatchFail -> ShowS Source # show :: PatternMatchFail -> String Source # showList :: [PatternMatchFail] -> ShowS Source #
Show RecConError | Since: base-4.0
Instance details Defined in GHC.Internal.Control.Exception.Base Methods showsPrec :: Int -> RecConError -> ShowS Source # show :: RecConError -> String Source # showList :: [RecConError] -> ShowS Source #
Show RecSelError | Since: base-4.0
Instance details Defined in GHC.Internal.Control.Exception.Base Methods showsPrec :: Int -> RecSelError -> ShowS Source # show :: RecSelError -> String Source # showList :: [RecSelError] -> ShowS Source #
Show RecUpdError | Since: base-4.0
Instance details Defined in GHC.Internal.Control.Exception.Base Methods showsPrec :: Int -> RecUpdError -> ShowS Source # show :: RecUpdError -> String Source # showList :: [RecUpdError] -> ShowS Source #
Show TypeError | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Control.Exception.Base Methods showsPrec :: Int -> TypeError -> ShowS Source # show :: TypeError -> String Source # showList :: [TypeError] -> ShowS Source #
Show All | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods showsPrec :: Int -> All -> ShowS Source # show :: All -> String Source # showList :: [All] -> ShowS Source #
Show Any | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods showsPrec :: Int -> Any -> ShowS Source # show :: Any -> String Source # showList :: [Any] -> ShowS Source #
Show SomeTypeRep | Since: base-4.10.0.0
Instance details Defined in GHC.Internal.Data.Typeable.Internal Methods showsPrec :: Int -> SomeTypeRep -> ShowS Source # show :: SomeTypeRep -> String Source # showList :: [SomeTypeRep] -> ShowS Source #
Show Version | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Version Methods showsPrec :: Int -> Version -> ShowS Source # show :: Version -> String Source # showList :: [Version] -> ShowS Source #
Show ErrorCall | Since: base-4.0.0.0
Instance details Defined in GHC.Internal.Exception Methods showsPrec :: Int -> ErrorCall -> ShowS Source # show :: ErrorCall -> String Source # showList :: [ErrorCall] -> ShowS Source #
Show ArithException | Since: base-4.0.0.0
Instance details Defined in GHC.Internal.Exception.Type Methods showsPrec :: Int -> ArithException -> ShowS Source # show :: ArithException -> String Source # showList :: [ArithException] -> ShowS Source #
Show SomeException | Since: ghc-internal-3.0
Instance details Defined in GHC.Internal.Exception.Type Methods showsPrec :: Int -> SomeException -> ShowS Source # show :: SomeException -> String Source # showList :: [SomeException] -> ShowS Source #
Show CBool |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CBool -> ShowS Source # show :: CBool -> String Source # showList :: [CBool] -> ShowS Source #
Show CChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CChar -> ShowS Source # show :: CChar -> String Source # showList :: [CChar] -> ShowS Source #
Show CClock |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CClock -> ShowS Source # show :: CClock -> String Source # showList :: [CClock] -> ShowS Source #
Show CDouble |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CDouble -> ShowS Source # show :: CDouble -> String Source # showList :: [CDouble] -> ShowS Source #
Show CFloat |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CFloat -> ShowS Source # show :: CFloat -> String Source # showList :: [CFloat] -> ShowS Source #
Show CInt |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CInt -> ShowS Source # show :: CInt -> String Source # showList :: [CInt] -> ShowS Source #
Show CIntMax |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CIntMax -> ShowS Source # show :: CIntMax -> String Source # showList :: [CIntMax] -> ShowS Source #
Show CIntPtr |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CIntPtr -> ShowS Source # show :: CIntPtr -> String Source # showList :: [CIntPtr] -> ShowS Source #
Show CLLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CLLong -> ShowS Source # show :: CLLong -> String Source # showList :: [CLLong] -> ShowS Source #
Show CLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CLong -> ShowS Source # show :: CLong -> String Source # showList :: [CLong] -> ShowS Source #
Show CPtrdiff |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CPtrdiff -> ShowS Source # show :: CPtrdiff -> String Source # showList :: [CPtrdiff] -> ShowS Source #
Show CSChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CSChar -> ShowS Source # show :: CSChar -> String Source # showList :: [CSChar] -> ShowS Source #
Show CSUSeconds |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CSUSeconds -> ShowS Source # show :: CSUSeconds -> String Source # showList :: [CSUSeconds] -> ShowS Source #
Show CShort |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CShort -> ShowS Source # show :: CShort -> String Source # showList :: [CShort] -> ShowS Source #
Show CSigAtomic |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CSigAtomic -> ShowS Source # show :: CSigAtomic -> String Source # showList :: [CSigAtomic] -> ShowS Source #
Show CSize |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CSize -> ShowS Source # show :: CSize -> String Source # showList :: [CSize] -> ShowS Source #
Show CTime |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CTime -> ShowS Source # show :: CTime -> String Source # showList :: [CTime] -> ShowS Source #
Show CUChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CUChar -> ShowS Source # show :: CUChar -> String Source # showList :: [CUChar] -> ShowS Source #
Show CUInt |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CUInt -> ShowS Source # show :: CUInt -> String Source # showList :: [CUInt] -> ShowS Source #
Show CUIntMax |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CUIntMax -> ShowS Source # show :: CUIntMax -> String Source # showList :: [CUIntMax] -> ShowS Source #
Show CUIntPtr |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CUIntPtr -> ShowS Source # show :: CUIntPtr -> String Source # showList :: [CUIntPtr] -> ShowS Source #
Show CULLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CULLong -> ShowS Source # show :: CULLong -> String Source # showList :: [CULLong] -> ShowS Source #
Show CULong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CULong -> ShowS Source # show :: CULong -> String Source # showList :: [CULong] -> ShowS Source #
Show CUSeconds |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CUSeconds -> ShowS Source # show :: CUSeconds -> String Source # showList :: [CUSeconds] -> ShowS Source #
Show CUShort |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CUShort -> ShowS Source # show :: CUShort -> String Source # showList :: [CUShort] -> ShowS Source #
Show CWchar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods showsPrec :: Int -> CWchar -> ShowS Source # show :: CWchar -> String Source # showList :: [CWchar] -> ShowS Source #
Show Associativity | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> Associativity -> ShowS Source # show :: Associativity -> String Source # showList :: [Associativity] -> ShowS Source #
Show DecidedStrictness | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> DecidedStrictness -> ShowS Source # show :: DecidedStrictness -> String Source # showList :: [DecidedStrictness] -> ShowS Source #
Show Fixity | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> Fixity -> ShowS Source # show :: Fixity -> String Source # showList :: [Fixity] -> ShowS Source #
Show SourceStrictness | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> SourceStrictness -> ShowS Source # show :: SourceStrictness -> String Source # showList :: [SourceStrictness] -> ShowS Source #
Show SourceUnpackedness | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> SourceUnpackedness -> ShowS Source # show :: SourceUnpackedness -> String Source # showList :: [SourceUnpackedness] -> ShowS Source #
Show MaskingState | Since: base-4.3.0.0
Instance details Defined in GHC.Internal.IO Methods showsPrec :: Int -> MaskingState -> ShowS Source # show :: MaskingState -> String Source # showList :: [MaskingState] -> ShowS Source #
Show CodingProgress | Since: base-4.4.0.0
Instance details Defined in GHC.Internal.IO.Encoding.Types Methods showsPrec :: Int -> CodingProgress -> ShowS Source # show :: CodingProgress -> String Source # showList :: [CodingProgress] -> ShowS Source #
Show TextEncoding | Since: base-4.3.0.0
Instance details Defined in GHC.Internal.IO.Encoding.Types Methods showsPrec :: Int -> TextEncoding -> ShowS Source # show :: TextEncoding -> String Source # showList :: [TextEncoding] -> ShowS Source #
Show AllocationLimitExceeded | Since: base-4.7.1.0
Instance details Defined in GHC.Internal.IO.Exception Methods showsPrec :: Int -> AllocationLimitExceeded -> ShowS Source # show :: AllocationLimitExceeded -> String Source # showList :: [AllocationLimitExceeded] -> ShowS Source #
Show ArrayException | Since: base-4.1.0.0
Instance details Defined in GHC.Internal.IO.Exception Methods showsPrec :: Int -> ArrayException -> ShowS Source # show :: ArrayException -> String Source # showList :: [ArrayException] -> ShowS Source #
Show AssertionFailed | Since: base-4.1.0.0
Instance details Defined in GHC.Internal.IO.Exception Methods showsPrec :: Int -> AssertionFailed -> ShowS Source # show :: AssertionFailed -> String Source # showList :: [AssertionFailed] -> ShowS Source #
Show AsyncException | Since: base-4.1.0.0
Instance details Defined in GHC.Internal.IO.Exception Methods showsPrec :: Int -> AsyncException -> ShowS Source # show :: AsyncException -> String Source # showList :: [AsyncException] -> ShowS Source #
Show BlockedIndefinitelyOnMVar | Since: base-4.1.0.0
Instance details Defined in GHC.Internal.IO.Exception Methods showsPrec :: Int -> BlockedIndefinitelyOnMVar -> ShowS Source # show :: BlockedIndefinitelyOnMVar -> String Source # showList :: [BlockedIndefinitelyOnMVar] -> ShowS Source #
Show BlockedIndefinitelyOnSTM | Since: base-4.1.0.0
Instance details Defined in GHC.Internal.IO.Exception Methods showsPrec :: Int -> BlockedIndefinitelyOnSTM -> ShowS Source # show :: BlockedIndefinitelyOnSTM -> String Source # showList :: [BlockedIndefinitelyOnSTM] -> ShowS Source #
Show CompactionFailed | Since: base-4.10.0.0
Instance details Defined in GHC.Internal.IO.Exception Methods showsPrec :: Int -> CompactionFailed -> ShowS Source # show :: CompactionFailed -> String Source # showList :: [CompactionFailed] -> ShowS Source #
Show Deadlock | Since: base-4.1.0.0
Instance details Defined in GHC.Internal.IO.Exception Methods showsPrec :: Int -> Deadlock -> ShowS Source # show :: Deadlock -> String Source # showList :: [Deadlock] -> ShowS Source #
Show ExitCode |
Instance details Defined in GHC.Internal.IO.Exception Methods showsPrec :: Int -> ExitCode -> ShowS Source # show :: ExitCode -> String Source # showList :: [ExitCode] -> ShowS Source #
Show FixIOException | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.IO.Exception Methods showsPrec :: Int -> FixIOException -> ShowS Source # show :: FixIOException -> String Source # showList :: [FixIOException] -> ShowS Source #
Show IOErrorType | Since: base-4.1.0.0
Instance details Defined in GHC.Internal.IO.Exception Methods showsPrec :: Int -> IOErrorType -> ShowS Source # show :: IOErrorType -> String Source # showList :: [IOErrorType] -> ShowS Source #
Show IOException | Since: base-4.1.0.0
Instance details Defined in GHC.Internal.IO.Exception Methods showsPrec :: Int -> IOException -> ShowS Source # show :: IOException -> String Source # showList :: [IOException] -> ShowS Source #
Show SomeAsyncException | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.IO.Exception Methods showsPrec :: Int -> SomeAsyncException -> ShowS Source # show :: SomeAsyncException -> String Source # showList :: [SomeAsyncException] -> ShowS Source #
Show HandlePosn | Since: base-4.1.0.0
Instance details Defined in GHC.Internal.IO.Handle Methods showsPrec :: Int -> HandlePosn -> ShowS Source # show :: HandlePosn -> String Source # showList :: [HandlePosn] -> ShowS Source #
Show BufferMode | Since: base-4.2.0.0
Instance details Defined in GHC.Internal.IO.Handle.Types Methods showsPrec :: Int -> BufferMode -> ShowS Source # show :: BufferMode -> String Source # showList :: [BufferMode] -> ShowS Source #
Show Handle | Since: base-4.1.0.0
Instance details Defined in GHC.Internal.IO.Handle.Types Methods showsPrec :: Int -> Handle -> ShowS Source # show :: Handle -> String Source # showList :: [Handle] -> ShowS Source #
Show HandleType | Since: base-4.1.0.0
Instance details Defined in GHC.Internal.IO.Handle.Types Methods showsPrec :: Int -> HandleType -> ShowS Source # show :: HandleType -> String Source # showList :: [HandleType] -> ShowS Source #
Show Newline | Since: base-4.3.0.0
Instance details Defined in GHC.Internal.IO.Handle.Types Methods showsPrec :: Int -> Newline -> ShowS Source # show :: Newline -> String Source # showList :: [Newline] -> ShowS Source #
Show NewlineMode | Since: base-4.3.0.0
Instance details Defined in GHC.Internal.IO.Handle.Types Methods showsPrec :: Int -> NewlineMode -> ShowS Source # show :: NewlineMode -> String Source # showList :: [NewlineMode] -> ShowS Source #
Show IOMode | Since: base-4.2.0.0
Instance details Defined in GHC.Internal.IO.IOMode Methods showsPrec :: Int -> IOMode -> ShowS Source # show :: IOMode -> String Source # showList :: [IOMode] -> ShowS Source #
Show Int16 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods showsPrec :: Int -> Int16 -> ShowS Source # show :: Int16 -> String Source # showList :: [Int16] -> ShowS Source #
Show Int32 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods showsPrec :: Int -> Int32 -> ShowS Source # show :: Int32 -> String Source # showList :: [Int32] -> ShowS Source #
Show Int64 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods showsPrec :: Int -> Int64 -> ShowS Source # show :: Int64 -> String Source # showList :: [Int64] -> ShowS Source #
Show Int8 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods showsPrec :: Int -> Int8 -> ShowS Source # show :: Int8 -> String Source # showList :: [Int8] -> ShowS Source #
Show CCFlags | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.RTS.Flags Methods showsPrec :: Int -> CCFlags -> ShowS Source # show :: CCFlags -> String Source # showList :: [CCFlags] -> ShowS Source #
Show ConcFlags | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.RTS.Flags Methods showsPrec :: Int -> ConcFlags -> ShowS Source # show :: ConcFlags -> String Source # showList :: [ConcFlags] -> ShowS Source #
Show DebugFlags | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.RTS.Flags Methods showsPrec :: Int -> DebugFlags -> ShowS Source # show :: DebugFlags -> String Source # showList :: [DebugFlags] -> ShowS Source #
Show DoCostCentres | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.RTS.Flags Methods showsPrec :: Int -> DoCostCentres -> ShowS Source # show :: DoCostCentres -> String Source # showList :: [DoCostCentres] -> ShowS Source #
Show DoHeapProfile | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.RTS.Flags Methods showsPrec :: Int -> DoHeapProfile -> ShowS Source # show :: DoHeapProfile -> String Source # showList :: [DoHeapProfile] -> ShowS Source #
Show DoTrace | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.RTS.Flags Methods showsPrec :: Int -> DoTrace -> ShowS Source # show :: DoTrace -> String Source # showList :: [DoTrace] -> ShowS Source #
Show GCFlags | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.RTS.Flags Methods showsPrec :: Int -> GCFlags -> ShowS Source # show :: GCFlags -> String Source # showList :: [GCFlags] -> ShowS Source #
Show GiveGCStats | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.RTS.Flags Methods showsPrec :: Int -> GiveGCStats -> ShowS Source # show :: GiveGCStats -> String Source # showList :: [GiveGCStats] -> ShowS Source #
Show HpcFlags | Since: base-4.20.0.0
Instance details Defined in GHC.Internal.RTS.Flags Methods showsPrec :: Int -> HpcFlags -> ShowS Source # show :: HpcFlags -> String Source # showList :: [HpcFlags] -> ShowS Source #
Show IoSubSystem |
Instance details Defined in GHC.Internal.RTS.Flags Methods showsPrec :: Int -> IoSubSystem -> ShowS Source # show :: IoSubSystem -> String Source # showList :: [IoSubSystem] -> ShowS Source #
Show MiscFlags | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.RTS.Flags Methods showsPrec :: Int -> MiscFlags -> ShowS Source # show :: MiscFlags -> String Source # showList :: [MiscFlags] -> ShowS Source #
Show ParFlags | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.RTS.Flags Methods showsPrec :: Int -> ParFlags -> ShowS Source # show :: ParFlags -> String Source # showList :: [ParFlags] -> ShowS Source #
Show ProfFlags | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.RTS.Flags Methods showsPrec :: Int -> ProfFlags -> ShowS Source # show :: ProfFlags -> String Source # showList :: [ProfFlags] -> ShowS Source #
Show RTSFlags | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.RTS.Flags Methods showsPrec :: Int -> RTSFlags -> ShowS Source # show :: RTSFlags -> String Source # showList :: [RTSFlags] -> ShowS Source #
Show TickyFlags | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.RTS.Flags Methods showsPrec :: Int -> TickyFlags -> ShowS Source # show :: TickyFlags -> String Source # showList :: [TickyFlags] -> ShowS Source #
Show TraceFlags | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.RTS.Flags Methods showsPrec :: Int -> TraceFlags -> ShowS Source # show :: TraceFlags -> String Source # showList :: [TraceFlags] -> ShowS Source #
Show FractionalExponentBase |
Instance details Defined in GHC.Internal.Real Methods showsPrec :: Int -> FractionalExponentBase -> ShowS Source # show :: FractionalExponentBase -> String Source # showList :: [FractionalExponentBase] -> ShowS Source #
Show CallStack | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> CallStack -> ShowS Source # show :: CallStack -> String Source # showList :: [CallStack] -> ShowS Source #
Show SrcLoc | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> SrcLoc -> ShowS Source # show :: SrcLoc -> String Source # showList :: [SrcLoc] -> ShowS Source #
Show GCDetails | Since: base-4.10.0.0
Instance details Defined in GHC.Internal.Stats Methods showsPrec :: Int -> GCDetails -> ShowS Source # show :: GCDetails -> String Source # showList :: [GCDetails] -> ShowS Source #
Show RTSStats | Since: base-4.10.0.0
Instance details Defined in GHC.Internal.Stats Methods showsPrec :: Int -> RTSStats -> ShowS Source # show :: RTSStats -> String Source # showList :: [RTSStats] -> ShowS Source #
Show Lexeme | Since: base-2.1
Instance details Defined in GHC.Internal.Text.Read.Lex Methods showsPrec :: Int -> Lexeme -> ShowS Source # show :: Lexeme -> String Source # showList :: [Lexeme] -> ShowS Source #
Show Number | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Text.Read.Lex Methods showsPrec :: Int -> Number -> ShowS Source # show :: Number -> String Source # showList :: [Number] -> ShowS Source #
Show SomeNat | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.TypeNats Methods showsPrec :: Int -> SomeNat -> ShowS Source # show :: SomeNat -> String Source # showList :: [SomeNat] -> ShowS Source #
Show GeneralCategory | Since: base-2.1
Instance details Defined in GHC.Internal.Unicode Methods showsPrec :: Int -> GeneralCategory -> ShowS Source # show :: GeneralCategory -> String Source # showList :: [GeneralCategory] -> ShowS Source #
Show Word16 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods showsPrec :: Int -> Word16 -> ShowS Source # show :: Word16 -> String Source # showList :: [Word16] -> ShowS Source #
Show Word32 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods showsPrec :: Int -> Word32 -> ShowS Source # show :: Word32 -> String Source # showList :: [Word32] -> ShowS Source #
Show Word64 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods showsPrec :: Int -> Word64 -> ShowS Source # show :: Word64 -> String Source # showList :: [Word64] -> ShowS Source #
Show Word8 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods showsPrec :: Int -> Word8 -> ShowS Source # show :: Word8 -> String Source # showList :: [Word8] -> ShowS Source #
Show KindRep |
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> KindRep -> ShowS Source # show :: KindRep -> String Source # showList :: [KindRep] -> ShowS Source #
Show Module | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Module -> ShowS Source # show :: Module -> String Source # showList :: [Module] -> ShowS Source #
Show Ordering | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Ordering -> ShowS Source # show :: Ordering -> String Source # showList :: [Ordering] -> ShowS Source #
Show TrName | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> TrName -> ShowS Source # show :: TrName -> String Source # showList :: [TrName] -> ShowS Source #
Show TyCon | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> TyCon -> ShowS Source # show :: TyCon -> String Source # showList :: [TyCon] -> ShowS Source #
Show TypeLitSort | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> TypeLitSort -> ShowS Source # show :: TypeLitSort -> String Source # showList :: [TypeLitSort] -> ShowS Source #
Show IniFile |
Instance details Defined in Data.Ini.Reader.Internals Methods showsPrec :: Int -> IniFile -> ShowS Source # show :: IniFile -> String Source # showList :: [IniFile] -> ShowS Source #
Show IniReaderError |
Instance details Defined in Data.Ini.Reader.Internals Methods showsPrec :: Int -> IniReaderError -> ShowS Source # show :: IniReaderError -> String Source # showList :: [IniReaderError] -> ShowS Source #
Show LinePass |
Instance details Defined in Linear.Plucker Methods showsPrec :: Int -> LinePass -> ShowS Source # show :: LinePass -> String Source # showList :: [LinePass] -> ShowS Source #
Show Part |
Instance details Defined in NLP.Miniutter.English Methods showsPrec :: Int -> Part -> ShowS Source # show :: Part -> String Source # showList :: [Part] -> ShowS Source #
Show Person |
Instance details Defined in NLP.Miniutter.English Methods showsPrec :: Int -> Person -> ShowS Source # show :: Person -> String Source # showList :: [Person] -> ShowS Source #
Show Polarity |
Instance details Defined in NLP.Miniutter.English Methods showsPrec :: Int -> Polarity -> ShowS Source # show :: Polarity -> String Source # showList :: [Polarity] -> ShowS Source #
Show URI |
Instance details Defined in Network.URI Methods showsPrec :: Int -> URI -> ShowS Source # show :: URI -> String Source # showList :: [URI] -> ShowS Source #
Show URIAuth |
Instance details Defined in Network.URI Methods showsPrec :: Int -> URIAuth -> ShowS Source # show :: URIAuth -> String Source # showList :: [URIAuth] -> ShowS Source #
Show Richness |
Instance details Defined in Options.Applicative.BashCompletion Methods showsPrec :: Int -> Richness -> ShowS Source # show :: Richness -> String Source # showList :: [Richness] -> ShowS Source #
Show Parenthetic |
Instance details Defined in Options.Applicative.Help.Core Methods showsPrec :: Int -> Parenthetic -> ShowS Source # show :: Parenthetic -> String Source # showList :: [Parenthetic] -> ShowS Source #
Show ParserHelp |
Instance details Defined in Options.Applicative.Help.Types Methods showsPrec :: Int -> ParserHelp -> ShowS Source # show :: ParserHelp -> String Source # showList :: [ParserHelp] -> ShowS Source #
Show AltNodeType |
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> AltNodeType -> ShowS Source # show :: AltNodeType -> String Source # showList :: [AltNodeType] -> ShowS Source #
Show ArgPolicy |
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> ArgPolicy -> ShowS Source # show :: ArgPolicy -> String Source # showList :: [ArgPolicy] -> ShowS Source #
Show ArgumentReachability |
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> ArgumentReachability -> ShowS Source # show :: ArgumentReachability -> String Source # showList :: [ArgumentReachability] -> ShowS Source #
Show Backtracking |
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> Backtracking -> ShowS Source # show :: Backtracking -> String Source # showList :: [Backtracking] -> ShowS Source #
Show CompletionResult |
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> CompletionResult -> ShowS Source # show :: CompletionResult -> String Source # showList :: [CompletionResult] -> ShowS Source #
Show IsCmdStart |
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> IsCmdStart -> ShowS Source # show :: IsCmdStart -> String Source # showList :: [IsCmdStart] -> ShowS Source #
Show OptName |
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> OptName -> ShowS Source # show :: OptName -> String Source # showList :: [OptName] -> ShowS Source #
Show OptProperties |
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> OptProperties -> ShowS Source # show :: OptProperties -> String Source # showList :: [OptProperties] -> ShowS Source #
Show OptVisibility |
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> OptVisibility -> ShowS Source # show :: OptVisibility -> String Source # showList :: [OptVisibility] -> ShowS Source #
Show ParserPrefs |
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> ParserPrefs -> ShowS Source # show :: ParserPrefs -> String Source # showList :: [ParserPrefs] -> ShowS Source #
Show OsChar |
Instance details Defined in System.OsString.Internal.Types Methods showsPrec :: Int -> OsChar -> ShowS Source # show :: OsChar -> String Source # showList :: [OsChar] -> ShowS Source #
Show OsString | On windows, decodes as UCS-2. On unix prints the raw bytes without decoding.
Instance details Defined in System.OsString.Internal.Types Methods showsPrec :: Int -> OsString -> ShowS Source # show :: OsString -> String Source # showList :: [OsString] -> ShowS Source #
Show PosixChar |
Instance details Defined in System.OsString.Internal.Types Methods showsPrec :: Int -> PosixChar -> ShowS Source # show :: PosixChar -> String Source # showList :: [PosixChar] -> ShowS Source #
Show PosixString | Prints the raw bytes without decoding.
Instance details Defined in System.OsString.Internal.Types Methods showsPrec :: Int -> PosixString -> ShowS Source # show :: PosixString -> String Source # showList :: [PosixString] -> ShowS Source #
Show WindowsChar |
Instance details Defined in System.OsString.Internal.Types Methods showsPrec :: Int -> WindowsChar -> ShowS Source # show :: WindowsChar -> String Source # showList :: [WindowsChar] -> ShowS Source #
Show WindowsString | Decodes as UCS-2.
Instance details Defined in System.OsString.Internal.Types Methods showsPrec :: Int -> WindowsString -> ShowS Source # show :: WindowsString -> String Source # showList :: [WindowsString] -> ShowS Source #
Show Mode |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> Mode -> ShowS Source # show :: Mode -> String Source # showList :: [Mode] -> ShowS Source #
Show Style |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> Style -> ShowS Source # show :: Style -> String Source # showList :: [Style] -> ShowS Source #
Show TextDetails |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> TextDetails -> ShowS Source # show :: TextDetails -> String Source # showList :: [TextDetails] -> ShowS Source #
Show Doc |
Instance details Defined in Text.PrettyPrint.HughesPJ Methods showsPrec :: Int -> Doc -> ShowS Source # show :: Doc -> String Source # showList :: [Doc] -> ShowS Source #
Show FusionDepth |
Instance details Defined in Prettyprinter.Internal Methods showsPrec :: Int -> FusionDepth -> ShowS Source # show :: FusionDepth -> String Source # showList :: [FusionDepth] -> ShowS Source #
Show LayoutOptions |
Instance details Defined in Prettyprinter.Internal Methods showsPrec :: Int -> LayoutOptions -> ShowS Source # show :: LayoutOptions -> String Source # showList :: [LayoutOptions] -> ShowS Source #
Show PageWidth |
Instance details Defined in Prettyprinter.Internal Methods showsPrec :: Int -> PageWidth -> ShowS Source # show :: PageWidth -> String Source # showList :: [PageWidth] -> ShowS Source #
Show StdGen |
Instance details Defined in System.Random.Internal Methods showsPrec :: Int -> StdGen -> ShowS Source # show :: StdGen -> String Source # showList :: [StdGen] -> ShowS Source #
Show Scientific |
Instance details Defined in Data.Scientific Methods showsPrec :: Int -> Scientific -> ShowS Source # show :: Scientific -> String Source # showList :: [Scientific] -> ShowS Source #
Show AudioDeviceStatus |
Instance details Defined in SDL.Audio Methods showsPrec :: Int -> AudioDeviceStatus -> ShowS Source # show :: AudioDeviceStatus -> String Source # showList :: [AudioDeviceStatus] -> ShowS Source #
Show AudioDeviceUsage |
Instance details Defined in SDL.Audio Methods showsPrec :: Int -> AudioDeviceUsage -> ShowS Source # show :: AudioDeviceUsage -> String Source # showList :: [AudioDeviceUsage] -> ShowS Source #
Show AudioDriver |
Instance details Defined in SDL.Audio Methods showsPrec :: Int -> AudioDriver -> ShowS Source # show :: AudioDriver -> String Source # showList :: [AudioDriver] -> ShowS Source #
Show Channels |
Instance details Defined in SDL.Audio Methods showsPrec :: Int -> Channels -> ShowS Source # show :: Channels -> String Source # showList :: [Channels] -> ShowS Source #
Show LockState |
Instance details Defined in SDL.Audio Methods showsPrec :: Int -> LockState -> ShowS Source # show :: LockState -> String Source # showList :: [LockState] -> ShowS Source #
Show PlaybackState |
Instance details Defined in SDL.Audio Methods showsPrec :: Int -> PlaybackState -> ShowS Source # show :: PlaybackState -> String Source # showList :: [PlaybackState] -> ShowS Source #
Show AudioDeviceEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> AudioDeviceEventData -> ShowS Source # show :: AudioDeviceEventData -> String Source # showList :: [AudioDeviceEventData] -> ShowS Source #
Show ControllerAxisEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> ControllerAxisEventData -> ShowS Source # show :: ControllerAxisEventData -> String Source # showList :: [ControllerAxisEventData] -> ShowS Source #
Show ControllerButtonEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> ControllerButtonEventData -> ShowS Source # show :: ControllerButtonEventData -> String Source # showList :: [ControllerButtonEventData] -> ShowS Source #
Show ControllerDeviceEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> ControllerDeviceEventData -> ShowS Source # show :: ControllerDeviceEventData -> String Source # showList :: [ControllerDeviceEventData] -> ShowS Source #
Show DollarGestureEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> DollarGestureEventData -> ShowS Source # show :: DollarGestureEventData -> String Source # showList :: [DollarGestureEventData] -> ShowS Source #
Show DropEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> DropEventData -> ShowS Source # show :: DropEventData -> String Source # showList :: [DropEventData] -> ShowS Source #
Show Event |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> Event -> ShowS Source # show :: Event -> String Source # showList :: [Event] -> ShowS Source #
Show EventPayload |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> EventPayload -> ShowS Source # show :: EventPayload -> String Source # showList :: [EventPayload] -> ShowS Source #
Show EventPushResult |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> EventPushResult -> ShowS Source # show :: EventPushResult -> String Source # showList :: [EventPushResult] -> ShowS Source #
Show InputMotion |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> InputMotion -> ShowS Source # show :: InputMotion -> String Source # showList :: [InputMotion] -> ShowS Source #
Show JoyAxisEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> JoyAxisEventData -> ShowS Source # show :: JoyAxisEventData -> String Source # showList :: [JoyAxisEventData] -> ShowS Source #
Show JoyBallEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> JoyBallEventData -> ShowS Source # show :: JoyBallEventData -> String Source # showList :: [JoyBallEventData] -> ShowS Source #
Show JoyButtonEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> JoyButtonEventData -> ShowS Source # show :: JoyButtonEventData -> String Source # showList :: [JoyButtonEventData] -> ShowS Source #
Show JoyDeviceEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> JoyDeviceEventData -> ShowS Source # show :: JoyDeviceEventData -> String Source # showList :: [JoyDeviceEventData] -> ShowS Source #
Show JoyHatEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> JoyHatEventData -> ShowS Source # show :: JoyHatEventData -> String Source # showList :: [JoyHatEventData] -> ShowS Source #
Show KeyboardEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> KeyboardEventData -> ShowS Source # show :: KeyboardEventData -> String Source # showList :: [KeyboardEventData] -> ShowS Source #
Show MouseButtonEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> MouseButtonEventData -> ShowS Source # show :: MouseButtonEventData -> String Source # showList :: [MouseButtonEventData] -> ShowS Source #
Show MouseMotionEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> MouseMotionEventData -> ShowS Source # show :: MouseMotionEventData -> String Source # showList :: [MouseMotionEventData] -> ShowS Source #
Show MouseWheelEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> MouseWheelEventData -> ShowS Source # show :: MouseWheelEventData -> String Source # showList :: [MouseWheelEventData] -> ShowS Source #
Show MultiGestureEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> MultiGestureEventData -> ShowS Source # show :: MultiGestureEventData -> String Source # showList :: [MultiGestureEventData] -> ShowS Source #
Show RegisteredEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> RegisteredEventData -> ShowS Source # show :: RegisteredEventData -> String Source # showList :: [RegisteredEventData] -> ShowS Source #
Show SysWMEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> SysWMEventData -> ShowS Source # show :: SysWMEventData -> String Source # showList :: [SysWMEventData] -> ShowS Source #
Show TextEditingEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> TextEditingEventData -> ShowS Source # show :: TextEditingEventData -> String Source # showList :: [TextEditingEventData] -> ShowS Source #
Show TextInputEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> TextInputEventData -> ShowS Source # show :: TextInputEventData -> String Source # showList :: [TextInputEventData] -> ShowS Source #
Show TouchFingerEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> TouchFingerEventData -> ShowS Source # show :: TouchFingerEventData -> String Source # showList :: [TouchFingerEventData] -> ShowS Source #
Show TouchFingerMotionEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> TouchFingerMotionEventData -> ShowS Source # show :: TouchFingerMotionEventData -> String Source # showList :: [TouchFingerMotionEventData] -> ShowS Source #
Show UnknownEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> UnknownEventData -> ShowS Source # show :: UnknownEventData -> String Source # showList :: [UnknownEventData] -> ShowS Source #
Show UserEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> UserEventData -> ShowS Source # show :: UserEventData -> String Source # showList :: [UserEventData] -> ShowS Source #
Show WindowClosedEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> WindowClosedEventData -> ShowS Source # show :: WindowClosedEventData -> String Source # showList :: [WindowClosedEventData] -> ShowS Source #
Show WindowExposedEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> WindowExposedEventData -> ShowS Source # show :: WindowExposedEventData -> String Source # showList :: [WindowExposedEventData] -> ShowS Source #
Show WindowGainedKeyboardFocusEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> WindowGainedKeyboardFocusEventData -> ShowS Source # show :: WindowGainedKeyboardFocusEventData -> String Source # showList :: [WindowGainedKeyboardFocusEventData] -> ShowS Source #
Show WindowGainedMouseFocusEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> WindowGainedMouseFocusEventData -> ShowS Source # show :: WindowGainedMouseFocusEventData -> String Source # showList :: [WindowGainedMouseFocusEventData] -> ShowS Source #
Show WindowHiddenEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> WindowHiddenEventData -> ShowS Source # show :: WindowHiddenEventData -> String Source # showList :: [WindowHiddenEventData] -> ShowS Source #
Show WindowLostKeyboardFocusEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> WindowLostKeyboardFocusEventData -> ShowS Source # show :: WindowLostKeyboardFocusEventData -> String Source # showList :: [WindowLostKeyboardFocusEventData] -> ShowS Source #
Show WindowLostMouseFocusEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> WindowLostMouseFocusEventData -> ShowS Source # show :: WindowLostMouseFocusEventData -> String Source # showList :: [WindowLostMouseFocusEventData] -> ShowS Source #
Show WindowMaximizedEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> WindowMaximizedEventData -> ShowS Source # show :: WindowMaximizedEventData -> String Source # showList :: [WindowMaximizedEventData] -> ShowS Source #
Show WindowMinimizedEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> WindowMinimizedEventData -> ShowS Source # show :: WindowMinimizedEventData -> String Source # showList :: [WindowMinimizedEventData] -> ShowS Source #
Show WindowMovedEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> WindowMovedEventData -> ShowS Source # show :: WindowMovedEventData -> String Source # showList :: [WindowMovedEventData] -> ShowS Source #
Show WindowResizedEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> WindowResizedEventData -> ShowS Source # show :: WindowResizedEventData -> String Source # showList :: [WindowResizedEventData] -> ShowS Source #
Show WindowRestoredEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> WindowRestoredEventData -> ShowS Source # show :: WindowRestoredEventData -> String Source # showList :: [WindowRestoredEventData] -> ShowS Source #
Show WindowShownEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> WindowShownEventData -> ShowS Source # show :: WindowShownEventData -> String Source # showList :: [WindowShownEventData] -> ShowS Source #
Show WindowSizeChangedEventData |
Instance details Defined in SDL.Event Methods showsPrec :: Int -> WindowSizeChangedEventData -> ShowS Source # show :: WindowSizeChangedEventData -> String Source # showList :: [WindowSizeChangedEventData] -> ShowS Source #
Show SDLException |
Instance details Defined in SDL.Exception Methods showsPrec :: Int -> SDLException -> ShowS Source # show :: SDLException -> String Source # showList :: [SDLException] -> ShowS Source #
Show AccelerometerJoystickOptions |
Instance details Defined in SDL.Hint Methods showsPrec :: Int -> AccelerometerJoystickOptions -> ShowS Source # show :: AccelerometerJoystickOptions -> String Source # showList :: [AccelerometerJoystickOptions] -> ShowS Source #
Show FramebufferAccelerationOptions |
Instance details Defined in SDL.Hint Methods showsPrec :: Int -> FramebufferAccelerationOptions -> ShowS Source # show :: FramebufferAccelerationOptions -> String Source # showList :: [FramebufferAccelerationOptions] -> ShowS Source #
Show HintPriority |
Instance details Defined in SDL.Hint Methods showsPrec :: Int -> HintPriority -> ShowS Source # show :: HintPriority -> String Source # showList :: [HintPriority] -> ShowS Source #
Show MacCTRLClickOptions |
Instance details Defined in SDL.Hint Methods showsPrec :: Int -> MacCTRLClickOptions -> ShowS Source # show :: MacCTRLClickOptions -> String Source # showList :: [MacCTRLClickOptions] -> ShowS Source #
Show MouseModeWarpOptions |
Instance details Defined in SDL.Hint Methods showsPrec :: Int -> MouseModeWarpOptions -> ShowS Source # show :: MouseModeWarpOptions -> String Source # showList :: [MouseModeWarpOptions] -> ShowS Source #
Show RenderDrivers |
Instance details Defined in SDL.Hint Methods showsPrec :: Int -> RenderDrivers -> ShowS Source # show :: RenderDrivers -> String Source # showList :: [RenderDrivers] -> ShowS Source #
Show RenderOpenGLShaderOptions |
Instance details Defined in SDL.Hint Methods showsPrec :: Int -> RenderOpenGLShaderOptions -> ShowS Source # show :: RenderOpenGLShaderOptions -> String Source # showList :: [RenderOpenGLShaderOptions] -> ShowS Source #
Show RenderScaleQuality |
Instance details Defined in SDL.Hint Methods showsPrec :: Int -> RenderScaleQuality -> ShowS Source # show :: RenderScaleQuality -> String Source # showList :: [RenderScaleQuality] -> ShowS Source #
Show RenderVSyncOptions |
Instance details Defined in SDL.Hint Methods showsPrec :: Int -> RenderVSyncOptions -> ShowS Source # show :: RenderVSyncOptions -> String Source # showList :: [RenderVSyncOptions] -> ShowS Source #
Show VideoWinD3DCompilerOptions |
Instance details Defined in SDL.Hint Methods showsPrec :: Int -> VideoWinD3DCompilerOptions -> ShowS Source # show :: VideoWinD3DCompilerOptions -> String Source # showList :: [VideoWinD3DCompilerOptions] -> ShowS Source #
Show InitFlag |
Instance details Defined in SDL.Init Methods showsPrec :: Int -> InitFlag -> ShowS Source # show :: InitFlag -> String Source # showList :: [InitFlag] -> ShowS Source #
Show ControllerAxis |
Instance details Defined in SDL.Input.GameController Methods showsPrec :: Int -> ControllerAxis -> ShowS Source # show :: ControllerAxis -> String Source # showList :: [ControllerAxis] -> ShowS Source #
Show ControllerButton |
Instance details Defined in SDL.Input.GameController Methods showsPrec :: Int -> ControllerButton -> ShowS Source # show :: ControllerButton -> String Source # showList :: [ControllerButton] -> ShowS Source #
Show ControllerButtonState |
Instance details Defined in SDL.Input.GameController Methods showsPrec :: Int -> ControllerButtonState -> ShowS Source # show :: ControllerButtonState -> String Source # showList :: [ControllerButtonState] -> ShowS Source #
Show ControllerDevice |
Instance details Defined in SDL.Input.GameController Methods showsPrec :: Int -> ControllerDevice -> ShowS Source # show :: ControllerDevice -> String Source # showList :: [ControllerDevice] -> ShowS Source #
Show ControllerDeviceConnection |
Instance details Defined in SDL.Input.GameController Methods showsPrec :: Int -> ControllerDeviceConnection -> ShowS Source # show :: ControllerDeviceConnection -> String Source # showList :: [ControllerDeviceConnection] -> ShowS Source #
Show JoyButtonState |
Instance details Defined in SDL.Input.Joystick Methods showsPrec :: Int -> JoyButtonState -> ShowS Source # show :: JoyButtonState -> String Source # showList :: [JoyButtonState] -> ShowS Source #
Show JoyDeviceConnection |
Instance details Defined in SDL.Input.Joystick Methods showsPrec :: Int -> JoyDeviceConnection -> ShowS Source # show :: JoyDeviceConnection -> String Source # showList :: [JoyDeviceConnection] -> ShowS Source #
Show JoyHatPosition |
Instance details Defined in SDL.Input.Joystick Methods showsPrec :: Int -> JoyHatPosition -> ShowS Source # show :: JoyHatPosition -> String Source # showList :: [JoyHatPosition] -> ShowS Source #
Show JoystickDevice |
Instance details Defined in SDL.Input.Joystick Methods showsPrec :: Int -> JoystickDevice -> ShowS Source # show :: JoystickDevice -> String Source # showList :: [JoystickDevice] -> ShowS Source #
Show KeyModifier |
Instance details Defined in SDL.Input.Keyboard Methods showsPrec :: Int -> KeyModifier -> ShowS Source # show :: KeyModifier -> String Source # showList :: [KeyModifier] -> ShowS Source #
Show Keysym |
Instance details Defined in SDL.Input.Keyboard Methods showsPrec :: Int -> Keysym -> ShowS Source # show :: Keysym -> String Source # showList :: [Keysym] -> ShowS Source #
Show Keycode |
Instance details Defined in SDL.Input.Keyboard.Codes Methods showsPrec :: Int -> Keycode -> ShowS Source # show :: Keycode -> String Source # showList :: [Keycode] -> ShowS Source #
Show Scancode |
Instance details Defined in SDL.Input.Keyboard.Codes Methods showsPrec :: Int -> Scancode -> ShowS Source # show :: Scancode -> String Source # showList :: [Scancode] -> ShowS Source #
Show LocationMode |
Instance details Defined in SDL.Input.Mouse Methods showsPrec :: Int -> LocationMode -> ShowS Source # show :: LocationMode -> String Source # showList :: [LocationMode] -> ShowS Source #
Show ModalLocation |
Instance details Defined in SDL.Input.Mouse Methods showsPrec :: Int -> ModalLocation -> ShowS Source # show :: ModalLocation -> String Source # showList :: [ModalLocation] -> ShowS Source #
Show MouseButton |
Instance details Defined in SDL.Input.Mouse Methods showsPrec :: Int -> MouseButton -> ShowS Source # show :: MouseButton -> String Source # showList :: [MouseButton] -> ShowS Source #
Show MouseDevice |
Instance details Defined in SDL.Input.Mouse Methods showsPrec :: Int -> MouseDevice -> ShowS Source # show :: MouseDevice -> String Source # showList :: [MouseDevice] -> ShowS Source #
Show MouseScrollDirection |
Instance details Defined in SDL.Input.Mouse Methods showsPrec :: Int -> MouseScrollDirection -> ShowS Source # show :: MouseScrollDirection -> String Source # showList :: [MouseScrollDirection] -> ShowS Source #
Show WarpMouseOrigin |
Instance details Defined in SDL.Input.Mouse Methods showsPrec :: Int -> WarpMouseOrigin -> ShowS Source # show :: WarpMouseOrigin -> String Source # showList :: [WarpMouseOrigin] -> ShowS Source #
Show GameController |
Instance details Defined in SDL.Internal.Types Methods showsPrec :: Int -> GameController -> ShowS Source # show :: GameController -> String Source # showList :: [GameController] -> ShowS Source #
Show Joystick |
Instance details Defined in SDL.Internal.Types Methods showsPrec :: Int -> Joystick -> ShowS Source # show :: Joystick -> String Source # showList :: [Joystick] -> ShowS Source #
Show Renderer |
Instance details Defined in SDL.Internal.Types Methods showsPrec :: Int -> Renderer -> ShowS Source # show :: Renderer -> String Source # showList :: [Renderer] -> ShowS Source #
Show Window |
Instance details Defined in SDL.Internal.Types Methods showsPrec :: Int -> Window -> ShowS Source # show :: Window -> String Source # showList :: [Window] -> ShowS Source #
Show BatteryState |
Instance details Defined in SDL.Power Methods showsPrec :: Int -> BatteryState -> ShowS Source # show :: BatteryState -> String Source # showList :: [BatteryState] -> ShowS Source #
Show Charge |
Instance details Defined in SDL.Power Methods showsPrec :: Int -> Charge -> ShowS Source # show :: Charge -> String Source # showList :: [Charge] -> ShowS Source #
Show PowerState |
Instance details Defined in SDL.Power Methods showsPrec :: Int -> PowerState -> ShowS Source # show :: PowerState -> String Source # showList :: [PowerState] -> ShowS Source #
Show SDLError |
Instance details Defined in SDL.Raw.Error Methods showsPrec :: Int -> SDLError -> ShowS Source # show :: SDLError -> String Source # showList :: [SDLError] -> ShowS Source #
Show Atomic |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> Atomic -> ShowS Source # show :: Atomic -> String Source # showList :: [Atomic] -> ShowS Source #
Show AudioCVT |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> AudioCVT -> ShowS Source # show :: AudioCVT -> String Source # showList :: [AudioCVT] -> ShowS Source #
Show AudioSpec |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> AudioSpec -> ShowS Source # show :: AudioSpec -> String Source # showList :: [AudioSpec] -> ShowS Source #
Show Color |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> Color -> ShowS Source # show :: Color -> String Source # showList :: [Color] -> ShowS Source #
Show DisplayMode |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> DisplayMode -> ShowS Source # show :: DisplayMode -> String Source # showList :: [DisplayMode] -> ShowS Source #
Show Event |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> Event -> ShowS Source # show :: Event -> String Source # showList :: [Event] -> ShowS Source #
Show FPoint |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> FPoint -> ShowS Source # show :: FPoint -> String Source # showList :: [FPoint] -> ShowS Source #
Show FRect |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> FRect -> ShowS Source # show :: FRect -> String Source # showList :: [FRect] -> ShowS Source #
Show Finger |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> Finger -> ShowS Source # show :: Finger -> String Source # showList :: [Finger] -> ShowS Source #
Show GameControllerButtonBind |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> GameControllerButtonBind -> ShowS Source # show :: GameControllerButtonBind -> String Source # showList :: [GameControllerButtonBind] -> ShowS Source #
Show HapticDirection |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> HapticDirection -> ShowS Source # show :: HapticDirection -> String Source # showList :: [HapticDirection] -> ShowS Source #
Show HapticEffect |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> HapticEffect -> ShowS Source # show :: HapticEffect -> String Source # showList :: [HapticEffect] -> ShowS Source #
Show JoystickGUID |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> JoystickGUID -> ShowS Source # show :: JoystickGUID -> String Source # showList :: [JoystickGUID] -> ShowS Source #
Show Keysym |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> Keysym -> ShowS Source # show :: Keysym -> String Source # showList :: [Keysym] -> ShowS Source #
Show MessageBoxButtonData |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> MessageBoxButtonData -> ShowS Source # show :: MessageBoxButtonData -> String Source # showList :: [MessageBoxButtonData] -> ShowS Source #
Show MessageBoxColor |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> MessageBoxColor -> ShowS Source # show :: MessageBoxColor -> String Source # showList :: [MessageBoxColor] -> ShowS Source #
Show MessageBoxColorScheme |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> MessageBoxColorScheme -> ShowS Source # show :: MessageBoxColorScheme -> String Source # showList :: [MessageBoxColorScheme] -> ShowS Source #
Show MessageBoxData |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> MessageBoxData -> ShowS Source # show :: MessageBoxData -> String Source # showList :: [MessageBoxData] -> ShowS Source #
Show Palette |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> Palette -> ShowS Source # show :: Palette -> String Source # showList :: [Palette] -> ShowS Source #
Show PixelFormat |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> PixelFormat -> ShowS Source # show :: PixelFormat -> String Source # showList :: [PixelFormat] -> ShowS Source #
Show Point |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> Point -> ShowS Source # show :: Point -> String Source # showList :: [Point] -> ShowS Source #
Show RWops |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> RWops -> ShowS Source # show :: RWops -> String Source # showList :: [RWops] -> ShowS Source #
Show Rect |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> Rect -> ShowS Source # show :: Rect -> String Source # showList :: [Rect] -> ShowS Source #
Show RendererInfo |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> RendererInfo -> ShowS Source # show :: RendererInfo -> String Source # showList :: [RendererInfo] -> ShowS Source #
Show Surface |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> Surface -> ShowS Source # show :: Surface -> String Source # showList :: [Surface] -> ShowS Source #
Show Version |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> Version -> ShowS Source # show :: Version -> String Source # showList :: [Version] -> ShowS Source #
Show Vertex |
Instance details Defined in SDL.Raw.Types Methods showsPrec :: Int -> Vertex -> ShowS Source # show :: Vertex -> String Source # showList :: [Vertex] -> ShowS Source #
Show RetriggerTimer |
Instance details Defined in SDL.Time Methods showsPrec :: Int -> RetriggerTimer -> ShowS Source # show :: RetriggerTimer -> String Source # showList :: [RetriggerTimer] -> ShowS Source #
Show Display |
Instance details Defined in SDL.Video Methods showsPrec :: Int -> Display -> ShowS Source # show :: Display -> String Source # showList :: [Display] -> ShowS Source #
Show DisplayMode |
Instance details Defined in SDL.Video Methods showsPrec :: Int -> DisplayMode -> ShowS Source # show :: DisplayMode -> String Source # showList :: [DisplayMode] -> ShowS Source #
Show MessageKind |
Instance details Defined in SDL.Video Methods showsPrec :: Int -> MessageKind -> ShowS Source # show :: MessageKind -> String Source # showList :: [MessageKind] -> ShowS Source #
Show VideoDriver |
Instance details Defined in SDL.Video Methods showsPrec :: Int -> VideoDriver -> ShowS Source # show :: VideoDriver -> String Source # showList :: [VideoDriver] -> ShowS Source #
Show WindowConfig |
Instance details Defined in SDL.Video Methods showsPrec :: Int -> WindowConfig -> ShowS Source # show :: WindowConfig -> String Source # showList :: [WindowConfig] -> ShowS Source #
Show WindowGraphicsContext |
Instance details Defined in SDL.Video Methods showsPrec :: Int -> WindowGraphicsContext -> ShowS Source # show :: WindowGraphicsContext -> String Source # showList :: [WindowGraphicsContext] -> ShowS Source #
Show WindowMode |
Instance details Defined in SDL.Video Methods showsPrec :: Int -> WindowMode -> ShowS Source # show :: WindowMode -> String Source # showList :: [WindowMode] -> ShowS Source #
Show WindowPosition |
Instance details Defined in SDL.Video Methods showsPrec :: Int -> WindowPosition -> ShowS Source # show :: WindowPosition -> String Source # showList :: [WindowPosition] -> ShowS Source #
Show Mode |
Instance details Defined in SDL.Video.OpenGL Methods showsPrec :: Int -> Mode -> ShowS Source # show :: Mode -> String Source # showList :: [Mode] -> ShowS Source #
Show OpenGLConfig |
Instance details Defined in SDL.Video.OpenGL Methods showsPrec :: Int -> OpenGLConfig -> ShowS Source # show :: OpenGLConfig -> String Source # showList :: [OpenGLConfig] -> ShowS Source #
Show Profile |
Instance details Defined in SDL.Video.OpenGL Methods showsPrec :: Int -> Profile -> ShowS Source # show :: Profile -> String Source # showList :: [Profile] -> ShowS Source #
Show SwapInterval |
Instance details Defined in SDL.Video.OpenGL Methods showsPrec :: Int -> SwapInterval -> ShowS Source # show :: SwapInterval -> String Source # showList :: [SwapInterval] -> ShowS Source #
Show BlendMode |
Instance details Defined in SDL.Video.Renderer Methods showsPrec :: Int -> BlendMode -> ShowS Source # show :: BlendMode -> String Source # showList :: [BlendMode] -> ShowS Source #
Show PixelFormat |
Instance details Defined in SDL.Video.Renderer Methods showsPrec :: Int -> PixelFormat -> ShowS Source # show :: PixelFormat -> String Source # showList :: [PixelFormat] -> ShowS Source #
Show RendererConfig |
Instance details Defined in SDL.Video.Renderer Methods showsPrec :: Int -> RendererConfig -> ShowS Source # show :: RendererConfig -> String Source # showList :: [RendererConfig] -> ShowS Source #
Show RendererInfo |
Instance details Defined in SDL.Video.Renderer Methods showsPrec :: Int -> RendererInfo -> ShowS Source # show :: RendererInfo -> String Source # showList :: [RendererInfo] -> ShowS Source #
Show RendererType |
Instance details Defined in SDL.Video.Renderer Methods showsPrec :: Int -> RendererType -> ShowS Source # show :: RendererType -> String Source # showList :: [RendererType] -> ShowS Source #
Show TextureAccess |
Instance details Defined in SDL.Video.Renderer Methods showsPrec :: Int -> TextureAccess -> ShowS Source # show :: TextureAccess -> String Source # showList :: [TextureAccess] -> ShowS Source #
Show TextureInfo |
Instance details Defined in SDL.Video.Renderer Methods showsPrec :: Int -> TextureInfo -> ShowS Source # show :: TextureInfo -> String Source # showList :: [TextureInfo] -> ShowS Source #
Show Font |
Instance details Defined in SDL.Font Methods showsPrec :: Int -> Font -> ShowS Source # show :: Font -> String Source # showList :: [Font] -> ShowS Source #
Show Hinting |
Instance details Defined in SDL.Font Methods showsPrec :: Int -> Hinting -> ShowS Source # show :: Hinting -> String Source # showList :: [Hinting] -> ShowS Source #
Show Style |
Instance details Defined in SDL.Font Methods showsPrec :: Int -> Style -> ShowS Source # show :: Style -> String Source # showList :: [Style] -> ShowS Source #
Show SMGen |
Instance details Defined in System.Random.SplitMix Methods showsPrec :: Int -> SMGen -> ShowS Source # show :: SMGen -> String Source # showList :: [SMGen] -> ShowS Source #
Show SMGen |
Instance details Defined in System.Random.SplitMix32 Methods showsPrec :: Int -> SMGen -> ShowS Source # show :: SMGen -> String Source # showList :: [SMGen] -> ShowS Source #
Show ForallVisFlag |
Instance details Defined in Language.Haskell.TH.Ppr Methods showsPrec :: Int -> ForallVisFlag -> ShowS Source # show :: ForallVisFlag -> String Source # showList :: [ForallVisFlag] -> ShowS Source #
Show Doc |
Instance details Defined in Language.Haskell.TH.PprLib Methods showsPrec :: Int -> Doc -> ShowS Source # show :: Doc -> String Source # showList :: [Doc] -> ShowS Source #
Show AnnLookup |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> AnnLookup -> ShowS Source # show :: AnnLookup -> String Source # showList :: [AnnLookup] -> ShowS Source #
Show AnnTarget |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> AnnTarget -> ShowS Source # show :: AnnTarget -> String Source # showList :: [AnnTarget] -> ShowS Source #
Show Bang |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Bang -> ShowS Source # show :: Bang -> String Source # showList :: [Bang] -> ShowS Source #
Show BndrVis |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> BndrVis -> ShowS Source # show :: BndrVis -> String Source # showList :: [BndrVis] -> ShowS Source #
Show Body |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Body -> ShowS Source # show :: Body -> String Source # showList :: [Body] -> ShowS Source #
Show Bytes |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Bytes -> ShowS Source # show :: Bytes -> String Source # showList :: [Bytes] -> ShowS Source #
Show Callconv |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Callconv -> ShowS Source # show :: Callconv -> String Source # showList :: [Callconv] -> ShowS Source #
Show Clause |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Clause -> ShowS Source # show :: Clause -> String Source # showList :: [Clause] -> ShowS Source #
Show Con |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Con -> ShowS Source # show :: Con -> String Source # showList :: [Con] -> ShowS Source #
Show Dec |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Dec -> ShowS Source # show :: Dec -> String Source # showList :: [Dec] -> ShowS Source #
Show DecidedStrictness |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> DecidedStrictness -> ShowS Source # show :: DecidedStrictness -> String Source # showList :: [DecidedStrictness] -> ShowS Source #
Show DerivClause |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> DerivClause -> ShowS Source # show :: DerivClause -> String Source # showList :: [DerivClause] -> ShowS Source #
Show DerivStrategy |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> DerivStrategy -> ShowS Source # show :: DerivStrategy -> String Source # showList :: [DerivStrategy] -> ShowS Source #
Show DocLoc |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> DocLoc -> ShowS Source # show :: DocLoc -> String Source # showList :: [DocLoc] -> ShowS Source #
Show Exp |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Exp -> ShowS Source # show :: Exp -> String Source # showList :: [Exp] -> ShowS Source #
Show FamilyResultSig |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> FamilyResultSig -> ShowS Source # show :: FamilyResultSig -> String Source # showList :: [FamilyResultSig] -> ShowS Source #
Show Fixity |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Fixity -> ShowS Source # show :: Fixity -> String Source # showList :: [Fixity] -> ShowS Source #
Show FixityDirection |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> FixityDirection -> ShowS Source # show :: FixityDirection -> String Source # showList :: [FixityDirection] -> ShowS Source #
Show Foreign |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Foreign -> ShowS Source # show :: Foreign -> String Source # showList :: [Foreign] -> ShowS Source #
Show FunDep |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> FunDep -> ShowS Source # show :: FunDep -> String Source # showList :: [FunDep] -> ShowS Source #
Show Guard |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Guard -> ShowS Source # show :: Guard -> String Source # showList :: [Guard] -> ShowS Source #
Show Info |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Info -> ShowS Source # show :: Info -> String Source # showList :: [Info] -> ShowS Source #
Show InjectivityAnn |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> InjectivityAnn -> ShowS Source # show :: InjectivityAnn -> String Source # showList :: [InjectivityAnn] -> ShowS Source #
Show Inline |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Inline -> ShowS Source # show :: Inline -> String Source # showList :: [Inline] -> ShowS Source #
Show Lit |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Lit -> ShowS Source # show :: Lit -> String Source # showList :: [Lit] -> ShowS Source #
Show Loc |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Loc -> ShowS Source # show :: Loc -> String Source # showList :: [Loc] -> ShowS Source #
Show Match |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Match -> ShowS Source # show :: Match -> String Source # showList :: [Match] -> ShowS Source #
Show ModName |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> ModName -> ShowS Source # show :: ModName -> String Source # showList :: [ModName] -> ShowS Source #
Show Module |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Module -> ShowS Source # show :: Module -> String Source # showList :: [Module] -> ShowS Source #
Show ModuleInfo |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> ModuleInfo -> ShowS Source # show :: ModuleInfo -> String Source # showList :: [ModuleInfo] -> ShowS Source #
Show Name |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Name -> ShowS Source # show :: Name -> String Source # showList :: [Name] -> ShowS Source #
Show NameFlavour |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> NameFlavour -> ShowS Source # show :: NameFlavour -> String Source # showList :: [NameFlavour] -> ShowS Source #
Show NameSpace |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> NameSpace -> ShowS Source # show :: NameSpace -> String Source # showList :: [NameSpace] -> ShowS Source #
Show NamespaceSpecifier |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> NamespaceSpecifier -> ShowS Source # show :: NamespaceSpecifier -> String Source # showList :: [NamespaceSpecifier] -> ShowS Source #
Show OccName |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> OccName -> ShowS Source # show :: OccName -> String Source # showList :: [OccName] -> ShowS Source #
Show Overlap |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Overlap -> ShowS Source # show :: Overlap -> String Source # showList :: [Overlap] -> ShowS Source #
Show Pat |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Pat -> ShowS Source # show :: Pat -> String Source # showList :: [Pat] -> ShowS Source #
Show PatSynArgs |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> PatSynArgs -> ShowS Source # show :: PatSynArgs -> String Source # showList :: [PatSynArgs] -> ShowS Source #
Show PatSynDir |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> PatSynDir -> ShowS Source # show :: PatSynDir -> String Source # showList :: [PatSynDir] -> ShowS Source #
Show Phases |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Phases -> ShowS Source # show :: Phases -> String Source # showList :: [Phases] -> ShowS Source #
Show PkgName |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> PkgName -> ShowS Source # show :: PkgName -> String Source # showList :: [PkgName] -> ShowS Source #
Show Pragma |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Pragma -> ShowS Source # show :: Pragma -> String Source # showList :: [Pragma] -> ShowS Source #
Show Range |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Range -> ShowS Source # show :: Range -> String Source # showList :: [Range] -> ShowS Source #
Show Role |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Role -> ShowS Source # show :: Role -> String Source # showList :: [Role] -> ShowS Source #
Show RuleBndr |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> RuleBndr -> ShowS Source # show :: RuleBndr -> String Source # showList :: [RuleBndr] -> ShowS Source #
Show RuleMatch |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> RuleMatch -> ShowS Source # show :: RuleMatch -> String Source # showList :: [RuleMatch] -> ShowS Source #
Show Safety |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Safety -> ShowS Source # show :: Safety -> String Source # showList :: [Safety] -> ShowS Source #
Show SourceStrictness |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> SourceStrictness -> ShowS Source # show :: SourceStrictness -> String Source # showList :: [SourceStrictness] -> ShowS Source #
Show SourceUnpackedness |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> SourceUnpackedness -> ShowS Source # show :: SourceUnpackedness -> String Source # showList :: [SourceUnpackedness] -> ShowS Source #
Show Specificity |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Specificity -> ShowS Source # show :: Specificity -> String Source # showList :: [Specificity] -> ShowS Source #
Show Stmt |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Stmt -> ShowS Source # show :: Stmt -> String Source # showList :: [Stmt] -> ShowS Source #
Show TyLit |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> TyLit -> ShowS Source # show :: TyLit -> String Source # showList :: [TyLit] -> ShowS Source #
Show TySynEqn |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> TySynEqn -> ShowS Source # show :: TySynEqn -> String Source # showList :: [TySynEqn] -> ShowS Source #
Show Type |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Type -> ShowS Source # show :: Type -> String Source # showList :: [Type] -> ShowS Source #
Show TypeFamilyHead |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> TypeFamilyHead -> ShowS Source # show :: TypeFamilyHead -> String Source # showList :: [TypeFamilyHead] -> ShowS Source #
Show Decoding |
Instance details Defined in Data.Text.Encoding Methods showsPrec :: Int -> Decoding -> ShowS Source # show :: Decoding -> String Source # showList :: [Decoding] -> ShowS Source #
Show UnicodeException |
Instance details Defined in Data.Text.Encoding.Error Methods showsPrec :: Int -> UnicodeException -> ShowS Source # show :: UnicodeException -> String Source # showList :: [UnicodeException] -> ShowS Source #
Show I8 |
Instance details Defined in Data.Text.Foreign Methods showsPrec :: Int -> I8 -> ShowS Source # show :: I8 -> String Source # showList :: [I8] -> ShowS Source #
Show Text |
Instance details Defined in Data.Text.Show Methods showsPrec :: Int -> Text -> ShowS Source # show :: Text -> String Source # showList :: [Text] -> ShowS Source #
Show Builder |
Instance details Defined in Data.Text.Internal.Builder Methods showsPrec :: Int -> Builder -> ShowS Source # show :: Builder -> String Source # showList :: [Builder] -> ShowS Source #
Show PartialUtf8CodePoint |
Instance details Defined in Data.Text.Internal.Encoding Methods showsPrec :: Int -> PartialUtf8CodePoint -> ShowS Source # show :: PartialUtf8CodePoint -> String Source # showList :: [PartialUtf8CodePoint] -> ShowS Source #
Show Utf8State |
Instance details Defined in Data.Text.Internal.Encoding Methods showsPrec :: Int -> Utf8State -> ShowS Source # show :: Utf8State -> String Source # showList :: [Utf8State] -> ShowS Source #
Show DecoderState |
Instance details Defined in Data.Text.Internal.Encoding.Utf8 Methods showsPrec :: Int -> DecoderState -> ShowS Source # show :: DecoderState -> String Source # showList :: [DecoderState] -> ShowS Source #
Show Size |
Instance details Defined in Data.Text.Internal.Fusion.Size Methods showsPrec :: Int -> Size -> ShowS Source # show :: Size -> String Source # showList :: [Size] -> ShowS Source #
Show Text |
Instance details Defined in Data.Text.Lazy Methods showsPrec :: Int -> Text -> ShowS Source # show :: Text -> String Source # showList :: [Text] -> ShowS Source #
Show FPFormat |
Instance details Defined in Data.Text.Lazy.Builder.RealFloat Methods showsPrec :: Int -> FPFormat -> ShowS Source # show :: FPFormat -> String Source # showList :: [FPFormat] -> ShowS Source #
Show Iter |
Instance details Defined in Data.Text.Unsafe Methods showsPrec :: Int -> Iter -> ShowS Source # show :: Iter -> String Source # showList :: [Iter] -> ShowS Source #
Show ShortText |
Instance details Defined in Data.Text.Short.Internal Methods showsPrec :: Int -> ShortText -> ShowS Source # show :: ShortText -> String Source # showList :: [ShortText] -> ShowS Source #
Show ConstructorInfo |
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> ConstructorInfo -> ShowS Source # show :: ConstructorInfo -> String Source # showList :: [ConstructorInfo] -> ShowS Source #
Show ConstructorVariant |
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> ConstructorVariant -> ShowS Source # show :: ConstructorVariant -> String Source # showList :: [ConstructorVariant] -> ShowS Source #
Show DatatypeInfo |
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> DatatypeInfo -> ShowS Source # show :: DatatypeInfo -> String Source # showList :: [DatatypeInfo] -> ShowS Source #
Show DatatypeVariant |
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> DatatypeVariant -> ShowS Source # show :: DatatypeVariant -> String Source # showList :: [DatatypeVariant] -> ShowS Source #
Show FieldStrictness |
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> FieldStrictness -> ShowS Source # show :: FieldStrictness -> String Source # showList :: [FieldStrictness] -> ShowS Source #
Show Strictness |
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> Strictness -> ShowS Source # show :: Strictness -> String Source # showList :: [Strictness] -> ShowS Source #
Show Unpackedness |
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> Unpackedness -> ShowS Source # show :: Unpackedness -> String Source # showList :: [Unpackedness] -> ShowS Source #
Show CalendarDiffDays |
Instance details Defined in Data.Time.Calendar.CalendarDiffDays Methods showsPrec :: Int -> CalendarDiffDays -> ShowS Source # show :: CalendarDiffDays -> String Source # showList :: [CalendarDiffDays] -> ShowS Source #
Show Day |
Instance details Defined in Data.Time.Calendar.Gregorian Methods showsPrec :: Int -> Day -> ShowS Source # show :: Day -> String Source # showList :: [Day] -> ShowS Source #
Show Month | Show as `yyyy-mm`.
Instance details Defined in Data.Time.Calendar.Month Methods showsPrec :: Int -> Month -> ShowS Source # show :: Month -> String Source # showList :: [Month] -> ShowS Source #
Show Quarter | Show as `yyyy-Qn`.
Instance details Defined in Data.Time.Calendar.Quarter Methods showsPrec :: Int -> Quarter -> ShowS Source # show :: Quarter -> String Source # showList :: [Quarter] -> ShowS Source #
Show QuarterOfYear |
Instance details Defined in Data.Time.Calendar.Quarter Methods showsPrec :: Int -> QuarterOfYear -> ShowS Source # show :: QuarterOfYear -> String Source # showList :: [QuarterOfYear] -> ShowS Source #
Show AbsoluteTime |
Instance details Defined in Data.Time.Clock.TAI Methods showsPrec :: Int -> AbsoluteTime -> ShowS Source # show :: AbsoluteTime -> String Source # showList :: [AbsoluteTime] -> ShowS Source #
Show DiffTime |
Instance details Defined in Data.Time.Clock.Internal.DiffTime Methods showsPrec :: Int -> DiffTime -> ShowS Source # show :: DiffTime -> String Source # showList :: [DiffTime] -> ShowS Source #
Show NominalDiffTime |
Instance details Defined in Data.Time.Clock.Internal.NominalDiffTime Methods showsPrec :: Int -> NominalDiffTime -> ShowS Source # show :: NominalDiffTime -> String Source # showList :: [NominalDiffTime] -> ShowS Source #
Show UTCTime |
Instance details Defined in Data.Time.LocalTime.Internal.ZonedTime Methods showsPrec :: Int -> UTCTime -> ShowS Source # show :: UTCTime -> String Source # showList :: [UTCTime] -> ShowS Source #
Show UniversalTime |
Instance details Defined in Data.Time.LocalTime.Internal.LocalTime Methods showsPrec :: Int -> UniversalTime -> ShowS Source # show :: UniversalTime -> String Source # showList :: [UniversalTime] -> ShowS Source #
Show CalendarDiffTime |
Instance details Defined in Data.Time.LocalTime.Internal.CalendarDiffTime Methods showsPrec :: Int -> CalendarDiffTime -> ShowS Source # show :: CalendarDiffTime -> String Source # showList :: [CalendarDiffTime] -> ShowS Source #
Show LocalTime |
Instance details Defined in Data.Time.LocalTime.Internal.LocalTime Methods showsPrec :: Int -> LocalTime -> ShowS Source # show :: LocalTime -> String Source # showList :: [LocalTime] -> ShowS Source #
Show TimeOfDay |
Instance details Defined in Data.Time.LocalTime.Internal.TimeOfDay Methods showsPrec :: Int -> TimeOfDay -> ShowS Source # show :: TimeOfDay -> String Source # showList :: [TimeOfDay] -> ShowS Source #
Show TimeZone | This only shows the time zone name, or offset if the name is empty.
Instance details Defined in Data.Time.LocalTime.Internal.TimeZone Methods showsPrec :: Int -> TimeZone -> ShowS Source # show :: TimeZone -> String Source # showList :: [TimeZone] -> ShowS Source #
Show ZonedTime | For the time zone, this only shows the name, or offset if the name is empty.
Instance details Defined in Data.Time.LocalTime.Internal.ZonedTime Methods showsPrec :: Int -> ZonedTime -> ShowS Source # show :: ZonedTime -> String Source # showList :: [ZonedTime] -> ShowS Source #
Show SubHashPath |
Instance details Defined in Data.HashMap.Internal.Debug Methods showsPrec :: Int -> SubHashPath -> ShowS Source # show :: SubHashPath -> String Source # showList :: [SubHashPath] -> ShowS Source #
Show UUID |
Instance details Defined in Data.UUID.Types.Internal Methods showsPrec :: Int -> UUID -> ShowS Source # show :: UUID -> String Source # showList :: [UUID] -> ShowS Source #
Show UnpackedUUID |
Instance details Defined in Data.UUID.Types.Internal Methods showsPrec :: Int -> UnpackedUUID -> ShowS Source # show :: UnpackedUUID -> String Source # showList :: [UnpackedUUID] -> ShowS Source #
Show Size |
Instance details Defined in Data.Vector.Fusion.Bundle.Size Methods showsPrec :: Int -> Size -> ShowS Source # show :: Size -> String Source # showList :: [Size] -> ShowS Source #
Show CompressParams |
Instance details Defined in Codec.Compression.Zlib.Internal Methods showsPrec :: Int -> CompressParams -> ShowS Source # show :: CompressParams -> String Source # showList :: [CompressParams] -> ShowS Source #
Show DecompressError |
Instance details Defined in Codec.Compression.Zlib.Internal Methods showsPrec :: Int -> DecompressError -> ShowS Source # show :: DecompressError -> String Source # showList :: [DecompressError] -> ShowS Source #
Show DecompressParams |
Instance details Defined in Codec.Compression.Zlib.Internal Methods showsPrec :: Int -> DecompressParams -> ShowS Source # show :: DecompressParams -> String Source # showList :: [DecompressParams] -> ShowS Source #
Show CompressionLevel |
Instance details Defined in Codec.Compression.Zlib.Stream Methods showsPrec :: Int -> CompressionLevel -> ShowS Source # show :: CompressionLevel -> String Source # showList :: [CompressionLevel] -> ShowS Source #
Show CompressionStrategy |
Instance details Defined in Codec.Compression.Zlib.Stream Methods showsPrec :: Int -> CompressionStrategy -> ShowS Source # show :: CompressionStrategy -> String Source # showList :: [CompressionStrategy] -> ShowS Source #
Show DictionaryHash |
Instance details Defined in Codec.Compression.Zlib.Stream Methods showsPrec :: Int -> DictionaryHash -> ShowS Source # show :: DictionaryHash -> String Source # showList :: [DictionaryHash] -> ShowS Source #
Show Format |
Instance details Defined in Codec.Compression.Zlib.Stream Methods showsPrec :: Int -> Format -> ShowS Source # show :: Format -> String Source # showList :: [Format] -> ShowS Source #
Show MemoryLevel |
Instance details Defined in Codec.Compression.Zlib.Stream Methods showsPrec :: Int -> MemoryLevel -> ShowS Source # show :: MemoryLevel -> String Source # showList :: [MemoryLevel] -> ShowS Source #
Show Method |
Instance details Defined in Codec.Compression.Zlib.Stream Methods showsPrec :: Int -> Method -> ShowS Source # show :: Method -> String Source # showList :: [Method] -> ShowS Source #
Show WindowBits |
Instance details Defined in Codec.Compression.Zlib.Stream Methods showsPrec :: Int -> WindowBits -> ShowS Source # show :: WindowBits -> String Source # showList :: [WindowBits] -> ShowS Source #
Show Integer | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Integer -> ShowS Source # show :: Integer -> String Source # showList :: [Integer] -> ShowS Source #
Show Natural | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Natural -> ShowS Source # show :: Natural -> String Source # showList :: [Natural] -> ShowS Source #
Show () | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> () -> ShowS Source # show :: () -> String Source # showList :: [()] -> ShowS Source #
Show Bool | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Bool -> ShowS Source # show :: Bool -> String Source # showList :: [Bool] -> ShowS Source #
Show Char | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Char -> ShowS Source # show :: Char -> String Source # showList :: [Char] -> ShowS Source #
Show Double | Since: base-2.1
Instance details Defined in GHC.Internal.Float Methods showsPrec :: Int -> Double -> ShowS Source # show :: Double -> String Source # showList :: [Double] -> ShowS Source #
Show Float | Since: base-2.1
Instance details Defined in GHC.Internal.Float Methods showsPrec :: Int -> Float -> ShowS Source # show :: Float -> String Source # showList :: [Float] -> ShowS Source #
Show Int | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Int -> ShowS Source # show :: Int -> String Source # showList :: [Int] -> ShowS Source #
Show Levity | Since: base-4.15.0.0
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Levity -> ShowS Source # show :: Levity -> String Source # showList :: [Levity] -> ShowS Source #
Show RuntimeRep | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> RuntimeRep -> ShowS Source # show :: RuntimeRep -> String Source # showList :: [RuntimeRep] -> ShowS Source #
Show VecCount | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> VecCount -> ShowS Source # show :: VecCount -> String Source # showList :: [VecCount] -> ShowS Source #
Show VecElem | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> VecElem -> ShowS Source # show :: VecElem -> String Source # showList :: [VecElem] -> ShowS Source #
Show Word | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Word -> ShowS Source # show :: Word -> String Source # showList :: [Word] -> ShowS Source #
Show a => Show (Strategy a) Source # |
Instance details Defined in Game.LambdaHack.Client.AI.Strategy Methods showsPrec :: Int -> Strategy a -> ShowS Source # show :: Strategy a -> String Source # showList :: [Strategy a] -> ShowS Source #
Show (Array c) Source # |
Instance details Defined in Game.LambdaHack.Common.PointArray Methods showsPrec :: Int -> Array c -> ShowS Source # show :: Array c -> String Source # showList :: [Array c] -> ShowS Source #
Show a => Show (RingBuffer a) Source # |
Instance details Defined in Game.LambdaHack.Common.RingBuffer Methods showsPrec :: Int -> RingBuffer a -> ShowS Source # show :: RingBuffer a -> String Source # showList :: [RingBuffer a] -> ShowS Source #
Show a => Show (Delta a) Source # |
Instance details Defined in Game.LambdaHack.Common.Time Methods showsPrec :: Int -> Delta a -> ShowS Source # show :: Delta a -> String Source # showList :: [Delta a] -> ShowS Source #
Show a => Show (Frequency a) Source # |
Instance details Defined in Game.LambdaHack.Core.Frequency Methods showsPrec :: Int -> Frequency a -> ShowS Source # show :: Frequency a -> String Source # showList :: [Frequency a] -> ShowS Source #
Show (ContentId c) Source # |
Instance details Defined in Game.LambdaHack.Definition.DefsInternal Methods showsPrec :: Int -> ContentId c -> ShowS Source # show :: ContentId c -> String Source # showList :: [ContentId c] -> ShowS Source #
Show (GroupName c) Source # |
Instance details Defined in Game.LambdaHack.Definition.DefsInternal Methods showsPrec :: Int -> GroupName c -> ShowS Source # show :: GroupName c -> String Source # showList :: [GroupName c] -> ShowS Source #
Show a => Show (FovValid a) Source # |
Instance details Defined in Game.LambdaHack.Server.Fov Methods showsPrec :: Int -> FovValid a -> ShowS Source # show :: FovValid a -> String Source # showList :: [FovValid a] -> ShowS Source #
Show (Blind a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> Blind a -> ShowS Source # show :: Blind a -> String Source # showList :: [Blind a] -> ShowS Source #
Show a => Show (Fixed a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> Fixed a -> ShowS Source # show :: Fixed a -> String Source # showList :: [Fixed a] -> ShowS Source #
Show a => Show (InfiniteList a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> InfiniteList a -> ShowS Source # show :: InfiniteList a -> String Source # showList :: [InfiniteList a] -> ShowS Source #
Show a => Show (Large a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> Large a -> ShowS Source # show :: Large a -> String Source # showList :: [Large a] -> ShowS Source #
Show a => Show (Negative a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> Negative a -> ShowS Source # show :: Negative a -> String Source # showList :: [Negative a] -> ShowS Source #
Show a => Show (NonEmptyList a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> NonEmptyList a -> ShowS Source # show :: NonEmptyList a -> String Source # showList :: [NonEmptyList a] -> ShowS Source #
Show a => Show (NonNegative a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> NonNegative a -> ShowS Source # show :: NonNegative a -> String Source # showList :: [NonNegative a] -> ShowS Source #
Show a => Show (NonPositive a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> NonPositive a -> ShowS Source # show :: NonPositive a -> String Source # showList :: [NonPositive a] -> ShowS Source #
Show a => Show (NonZero a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> NonZero a -> ShowS Source # show :: NonZero a -> String Source # showList :: [NonZero a] -> ShowS Source #
Show a => Show (OrderedList a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> OrderedList a -> ShowS Source # show :: OrderedList a -> String Source # showList :: [OrderedList a] -> ShowS Source #
Show a => Show (Positive a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> Positive a -> ShowS Source # show :: Positive a -> String Source # showList :: [Positive a] -> ShowS Source #
Show a => Show (Shrink2 a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> Shrink2 a -> ShowS Source # show :: Shrink2 a -> String Source # showList :: [Shrink2 a] -> ShowS Source #
Show a => Show (Small a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> Small a -> ShowS Source # show :: Small a -> String Source # showList :: [Small a] -> ShowS Source #
Show a => Show (Smart a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> Smart a -> ShowS Source # show :: Smart a -> String Source # showList :: [Smart a] -> ShowS Source #
Show a => Show (SortedList a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> SortedList a -> ShowS Source # show :: SortedList a -> String Source # showList :: [SortedList a] -> ShowS Source #
Show v => Show (KeyMap v) |
Instance details Defined in Data.Aeson.KeyMap Methods showsPrec :: Int -> KeyMap v -> ShowS Source # show :: KeyMap v -> String Source # showList :: [KeyMap v] -> ShowS Source #
Show a => Show (IResult a) |
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> IResult a -> ShowS Source # show :: IResult a -> String Source # showList :: [IResult a] -> ShowS Source #
Show a => Show (Result a) |
Instance details Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> Result a -> ShowS Source # show :: Result a -> String Source # showList :: [Result a] -> ShowS Source #
Show a => Show (Complex a) | Since: base-2.1
Instance details Defined in Data.Complex Methods showsPrec :: Int -> Complex a -> ShowS Source # show :: Complex a -> String Source # showList :: [Complex a] -> ShowS Source #
Show a => Show (First a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> First a -> ShowS Source # show :: First a -> String Source # showList :: [First a] -> ShowS Source #
Show a => Show (Last a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Last a -> ShowS Source # show :: Last a -> String Source # showList :: [Last a] -> ShowS Source #
Show a => Show (Max a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Max a -> ShowS Source # show :: Max a -> String Source # showList :: [Max a] -> ShowS Source #
Show a => Show (Min a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Min a -> ShowS Source # show :: Min a -> String Source # showList :: [Min a] -> ShowS Source #
Show m => Show (WrappedMonoid m) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> WrappedMonoid m -> ShowS Source # show :: WrappedMonoid m -> String Source # showList :: [WrappedMonoid m] -> ShowS Source #
Show a => Show (Decoder a) |
Instance details Defined in Data.Binary.Get.Internal Methods showsPrec :: Int -> Decoder a -> ShowS Source # show :: Decoder a -> String Source # showList :: [Decoder a] -> ShowS Source #
Show n => Show (VarInt n) |
Instance details Defined in Data.Bytes.VarInt Methods showsPrec :: Int -> VarInt n -> ShowS Source # show :: VarInt n -> String Source # showList :: [VarInt n] -> ShowS Source #
(Fractional a, Show a, Eq a) => Show (AlphaColour a) |
Instance details Defined in Data.Colour Methods showsPrec :: Int -> AlphaColour a -> ShowS Source # show :: AlphaColour a -> String Source # showList :: [AlphaColour a] -> ShowS Source #
(Fractional a, Show a) => Show (Colour a) |
Instance details Defined in Data.Colour Methods showsPrec :: Int -> Colour a -> ShowS Source # show :: Colour a -> String Source # showList :: [Colour a] -> ShowS Source #
Show vertex => Show (SCC vertex) | Since: containers-0.5.9
Instance details Defined in Data.Graph Methods showsPrec :: Int -> SCC vertex -> ShowS Source # show :: SCC vertex -> String Source # showList :: [SCC vertex] -> ShowS Source #
Show a => Show (IntMap a) |
Instance details Defined in Data.IntMap.Internal Methods showsPrec :: Int -> IntMap a -> ShowS Source # show :: IntMap a -> String Source # showList :: [IntMap a] -> ShowS Source #
Show a => Show (Seq a) |
Instance details Defined in Data.Sequence.Internal Methods showsPrec :: Int -> Seq a -> ShowS Source # show :: Seq a -> String Source # showList :: [Seq a] -> ShowS Source #
Show a => Show (ViewL a) |
Instance details Defined in Data.Sequence.Internal Methods showsPrec :: Int -> ViewL a -> ShowS Source # show :: ViewL a -> String Source # showList :: [ViewL a] -> ShowS Source #
Show a => Show (ViewR a) |
Instance details Defined in Data.Sequence.Internal Methods showsPrec :: Int -> ViewR a -> ShowS Source # show :: ViewR a -> String Source # showList :: [ViewR a] -> ShowS Source #
Show a => Show (Intersection a) |
Instance details Defined in Data.Set.Internal Methods showsPrec :: Int -> Intersection a -> ShowS Source # show :: Intersection a -> String Source # showList :: [Intersection a] -> ShowS Source #
Show a => Show (Set a) |
Instance details Defined in Data.Set.Internal Methods showsPrec :: Int -> Set a -> ShowS Source # show :: Set a -> String Source # showList :: [Set a] -> ShowS Source #
Show a => Show (Tree a) |
Instance details Defined in Data.Tree Methods showsPrec :: Int -> Tree a -> ShowS Source # show :: Tree a -> String Source # showList :: [Tree a] -> ShowS Source #
Show1 f => Show (Fix f) |
Instance details Defined in Data.Fix Methods showsPrec :: Int -> Fix f -> ShowS Source # show :: Fix f -> String Source # showList :: [Fix f] -> ShowS Source #
(Functor f, Show1 f) => Show (Mu f) |
Instance details Defined in Data.Fix Methods showsPrec :: Int -> Mu f -> ShowS Source # show :: Mu f -> String Source # showList :: [Mu f] -> ShowS Source #
(Functor f, Show1 f) => Show (Nu f) |
Instance details Defined in Data.Fix Methods showsPrec :: Int -> Nu f -> ShowS Source # show :: Nu f -> String Source # showList :: [Nu f] -> ShowS Source #
Show a => Show (DNonEmpty a) |
Instance details Defined in Data.DList.DNonEmpty.Internal Methods showsPrec :: Int -> DNonEmpty a -> ShowS Source # show :: DNonEmpty a -> String Source # showList :: [DNonEmpty a] -> ShowS Source #
Show a => Show (DList a) |
Instance details Defined in Data.DList.Internal Methods showsPrec :: Int -> DList a -> ShowS Source # show :: DList a -> String Source # showList :: [DList a] -> ShowS Source #
(Enum k, Show k) => Show (EnumSet k) |
Instance details Defined in Data.EnumSet Methods showsPrec :: Int -> EnumSet k -> ShowS Source # show :: EnumSet k -> String Source # showList :: [EnumSet k] -> ShowS Source #
Show a => Show (NonEmpty a) | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> NonEmpty a -> ShowS Source # show :: NonEmpty a -> String Source # showList :: [NonEmpty a] -> ShowS Source #
Show a => Show (Identity a) | This instance would be equivalent to the derived instances of the `Identity` newtype if the `runIdentity` field were removed Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Functor.Identity Methods showsPrec :: Int -> Identity a -> ShowS Source # show :: Identity a -> String Source # showList :: [Identity a] -> ShowS Source #
Show a => Show (First a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Monoid Methods showsPrec :: Int -> First a -> ShowS Source # show :: First a -> String Source # showList :: [First a] -> ShowS Source #
Show a => Show (Last a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Monoid Methods showsPrec :: Int -> Last a -> ShowS Source # show :: Last a -> String Source # showList :: [Last a] -> ShowS Source #
Show a => Show (Down a) | This instance would be equivalent to the derived instances of the `Down` newtype if the `getDown` field were removed Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Data.Ord Methods showsPrec :: Int -> Down a -> ShowS Source # show :: Down a -> String Source # showList :: [Down a] -> ShowS Source #
Show a => Show (Dual a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods showsPrec :: Int -> Dual a -> ShowS Source # show :: Dual a -> String Source # showList :: [Dual a] -> ShowS Source #
Show a => Show (Product a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods showsPrec :: Int -> Product a -> ShowS Source # show :: Product a -> String Source # showList :: [Product a] -> ShowS Source #
Show a => Show (Sum a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods showsPrec :: Int -> Sum a -> ShowS Source # show :: Sum a -> String Source # showList :: [Sum a] -> ShowS Source #
Show a => Show (ExceptionWithContext a) |
Instance details Defined in GHC.Internal.Exception.Type Methods showsPrec :: Int -> ExceptionWithContext a -> ShowS Source # show :: ExceptionWithContext a -> String Source # showList :: [ExceptionWithContext a] -> ShowS Source #
Show e => Show (NoBacktrace e) |
Instance details Defined in GHC.Internal.Exception.Type Methods showsPrec :: Int -> NoBacktrace e -> ShowS Source # show :: NoBacktrace e -> String Source # showList :: [NoBacktrace e] -> ShowS Source #
Show (ForeignPtr a) | Since: base-2.1
Instance details Defined in GHC.Internal.ForeignPtr Methods showsPrec :: Int -> ForeignPtr a -> ShowS Source # show :: ForeignPtr a -> String Source # showList :: [ForeignPtr a] -> ShowS Source #
Show a => Show (ZipList a) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Functor.ZipList Methods showsPrec :: Int -> ZipList a -> ShowS Source # show :: ZipList a -> String Source # showList :: [ZipList a] -> ShowS Source #
Show p => Show (Par1 p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> Par1 p -> ShowS Source # show :: Par1 p -> String Source # showList :: [Par1 p] -> ShowS Source #
Show (FunPtr a) | Since: base-2.1
Instance details Defined in GHC.Internal.Ptr Methods showsPrec :: Int -> FunPtr a -> ShowS Source # show :: FunPtr a -> String Source # showList :: [FunPtr a] -> ShowS Source #
Show (Ptr a) | Since: base-2.1
Instance details Defined in GHC.Internal.Ptr Methods showsPrec :: Int -> Ptr a -> ShowS Source # show :: Ptr a -> String Source # showList :: [Ptr a] -> ShowS Source #
Show a => Show (Ratio a) | Since: base-2.0.1
Instance details Defined in GHC.Internal.Real Methods showsPrec :: Int -> Ratio a -> ShowS Source # show :: Ratio a -> String Source # showList :: [Ratio a] -> ShowS Source #
Show (SNat n) | Since: base-4.18.0.0
Instance details Defined in GHC.Internal.TypeNats Methods showsPrec :: Int -> SNat n -> ShowS Source # show :: SNat n -> String Source # showList :: [SNat n] -> ShowS Source #
Show a => Show (Hashed a) |
Instance details Defined in Data.Hashable.Class Methods showsPrec :: Int -> Hashed a -> ShowS Source # show :: Hashed a -> String Source # showList :: [Hashed a] -> ShowS Source #
Show a => Show (Plucker a) |
Instance details Defined in Linear.Plucker Methods showsPrec :: Int -> Plucker a -> ShowS Source # show :: Plucker a -> String Source # showList :: [Plucker a] -> ShowS Source #
Show a => Show (Quaternion a) |
Instance details Defined in Linear.Quaternion Methods showsPrec :: Int -> Quaternion a -> ShowS Source # show :: Quaternion a -> String Source # showList :: [Quaternion a] -> ShowS Source #
Show (V0 a) |
Instance details Defined in Linear.V0 Methods showsPrec :: Int -> V0 a -> ShowS Source # show :: V0 a -> String Source # showList :: [V0 a] -> ShowS Source #
Show a => Show (V1 a) |
Instance details Defined in Linear.V1 Methods showsPrec :: Int -> V1 a -> ShowS Source # show :: V1 a -> String Source # showList :: [V1 a] -> ShowS Source #
Show a => Show (V2 a) |
Instance details Defined in Linear.V2 Methods showsPrec :: Int -> V2 a -> ShowS Source # show :: V2 a -> String Source # showList :: [V2 a] -> ShowS Source #
Show a => Show (V3 a) |
Instance details Defined in Linear.V3 Methods showsPrec :: Int -> V3 a -> ShowS Source # show :: V3 a -> String Source # showList :: [V3 a] -> ShowS Source #
Show a => Show (V4 a) |
Instance details Defined in Linear.V4 Methods showsPrec :: Int -> V4 a -> ShowS Source # show :: V4 a -> String Source # showList :: [V4 a] -> ShowS Source #
Show a => Show (Chunk a) |
Instance details Defined in Options.Applicative.Help.Chunk Methods showsPrec :: Int -> Chunk a -> ShowS Source # show :: Chunk a -> String Source # showList :: [Chunk a] -> ShowS Source #
Show a => Show (OptTree a) |
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> OptTree a -> ShowS Source # show :: OptTree a -> String Source # showList :: [OptTree a] -> ShowS Source #
Show (Option a) |
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> Option a -> ShowS Source # show :: Option a -> String Source # showList :: [Option a] -> ShowS Source #
Show h => Show (ParserFailure h) |
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> ParserFailure h -> ShowS Source # show :: ParserFailure h -> String Source # showList :: [ParserFailure h] -> ShowS Source #
Show a => Show (ParserResult a) |
Instance details Defined in Options.Applicative.Types Methods showsPrec :: Int -> ParserResult a -> ShowS Source # show :: ParserResult a -> String Source # showList :: [ParserResult a] -> ShowS Source #
Show a => Show (AnnotDetails a) |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> AnnotDetails a -> ShowS Source # show :: AnnotDetails a -> String Source # showList :: [AnnotDetails a] -> ShowS Source #
Show (Doc a) |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> Doc a -> ShowS Source # show :: Doc a -> String Source # showList :: [Doc a] -> ShowS Source #
Show a => Show (Span a) |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> Span a -> ShowS Source # show :: Span a -> String Source # showList :: [Span a] -> ShowS Source #
Show a => Show (PreProc a) |
Instance details Defined in Text.Show.Pretty Methods showsPrec :: Int -> PreProc a -> ShowS Source # show :: PreProc a -> String Source # showList :: [PreProc a] -> ShowS Source #
Show (Doc ann) |
Instance details Defined in Prettyprinter.Internal Methods showsPrec :: Int -> Doc ann -> ShowS Source # show :: Doc ann -> String Source # showList :: [Doc ann] -> ShowS Source #
Show ann => Show (SimpleDocStream ann) |
Instance details Defined in Prettyprinter.Internal Methods showsPrec :: Int -> SimpleDocStream ann -> ShowS Source # show :: SimpleDocStream ann -> String Source # showList :: [SimpleDocStream ann] -> ShowS Source #
Show a => Show (Array a) |
Instance details Defined in Data.Primitive.Array Methods showsPrec :: Int -> Array a -> ShowS Source # show :: Array a -> String Source # showList :: [Array a] -> ShowS Source #
(Show a, Prim a) => Show (PrimArray a) | Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.PrimArray Methods showsPrec :: Int -> PrimArray a -> ShowS Source # show :: PrimArray a -> String Source # showList :: [PrimArray a] -> ShowS Source #
Show a => Show (SmallArray a) |
Instance details Defined in Data.Primitive.SmallArray Methods showsPrec :: Int -> SmallArray a -> ShowS Source # show :: SmallArray a -> String Source # showList :: [SmallArray a] -> ShowS Source #
Show g => Show (StateGen g) |
Instance details Defined in System.Random.Internal Methods showsPrec :: Int -> StateGen g -> ShowS Source # show :: StateGen g -> String Source # showList :: [StateGen g] -> ShowS Source #
Show g => Show (AtomicGen g) |
Instance details Defined in System.Random.Stateful Methods showsPrec :: Int -> AtomicGen g -> ShowS Source # show :: AtomicGen g -> String Source # showList :: [AtomicGen g] -> ShowS Source #
Show g => Show (IOGen g) |
Instance details Defined in System.Random.Stateful Methods showsPrec :: Int -> IOGen g -> ShowS Source # show :: IOGen g -> String Source # showList :: [IOGen g] -> ShowS Source #
Show g => Show (STGen g) |
Instance details Defined in System.Random.Stateful Methods showsPrec :: Int -> STGen g -> ShowS Source # show :: STGen g -> String Source # showList :: [STGen g] -> ShowS Source #
Show g => Show (TGen g) |
Instance details Defined in System.Random.Stateful Methods showsPrec :: Int -> TGen g -> ShowS Source # show :: TGen g -> String Source # showList :: [TGen g] -> ShowS Source #
Show (AudioFormat sampleType) |
Instance details Defined in SDL.Audio Methods showsPrec :: Int -> AudioFormat sampleType -> ShowS Source # show :: AudioFormat sampleType -> String Source # showList :: [AudioFormat sampleType] -> ShowS Source #
Show a => Show (Changeable a) |
Instance details Defined in SDL.Audio Methods showsPrec :: Int -> Changeable a -> ShowS Source # show :: Changeable a -> String Source # showList :: [Changeable a] -> ShowS Source #
Show a => Show (V2 a) |
Instance details Defined in SDL.Internal.Vect Methods showsPrec :: Int -> V2 a -> ShowS Source # show :: V2 a -> String Source # showList :: [V2 a] -> ShowS Source #
Show a => Show (V3 a) |
Instance details Defined in SDL.Internal.Vect Methods showsPrec :: Int -> V3 a -> ShowS Source # show :: V3 a -> String Source # showList :: [V3 a] -> ShowS Source #
Show a => Show (V4 a) |
Instance details Defined in SDL.Internal.Vect Methods showsPrec :: Int -> V4 a -> ShowS Source # show :: V4 a -> String Source # showList :: [V4 a] -> ShowS Source #
Show a => Show (Rectangle a) |
Instance details Defined in SDL.Video.Renderer Methods showsPrec :: Int -> Rectangle a -> ShowS Source # show :: Rectangle a -> String Source # showList :: [Rectangle a] -> ShowS Source #
Show a => Show (Maybe a) |
Instance details Defined in Data.Strict.Maybe Methods showsPrec :: Int -> Maybe a -> ShowS Source # show :: Maybe a -> String Source # showList :: [Maybe a] -> ShowS Source #
Show flag => Show (TyVarBndr flag) |
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> TyVarBndr flag -> ShowS Source # show :: TyVarBndr flag -> String Source # showList :: [TyVarBndr flag] -> ShowS Source #
Show a => Show (Array a) |
Instance details Defined in Data.HashMap.Internal.Array Methods showsPrec :: Int -> Array a -> ShowS Source # show :: Array a -> String Source # showList :: [Array a] -> ShowS Source #
Show k => Show (Error k) |
Instance details Defined in Data.HashMap.Internal.Debug Methods showsPrec :: Int -> Error k -> ShowS Source # show :: Error k -> String Source # showList :: [Error k] -> ShowS Source #
Show k => Show (Validity k) |
Instance details Defined in Data.HashMap.Internal.Debug Methods showsPrec :: Int -> Validity k -> ShowS Source # show :: Validity k -> String Source # showList :: [Validity k] -> ShowS Source #
Show a => Show (HashSet a) |
Instance details Defined in Data.HashSet.Internal Methods showsPrec :: Int -> HashSet a -> ShowS Source # show :: HashSet a -> String Source # showList :: [HashSet a] -> ShowS Source #
Show a => Show (Vector a) |
Instance details Defined in Data.Vector Methods showsPrec :: Int -> Vector a -> ShowS Source # show :: Vector a -> String Source # showList :: [Vector a] -> ShowS Source #
(Show a, Prim a) => Show (Vector a) |
Instance details Defined in Data.Vector.Primitive Methods showsPrec :: Int -> Vector a -> ShowS Source # show :: Vector a -> String Source # showList :: [Vector a] -> ShowS Source #
(Show a, Storable a) => Show (Vector a) |
Instance details Defined in Data.Vector.Storable Methods showsPrec :: Int -> Vector a -> ShowS Source # show :: Vector a -> String Source # showList :: [Vector a] -> ShowS Source #
Show a => Show (Vector a) |
Instance details Defined in Data.Vector.Strict Methods showsPrec :: Int -> Vector a -> ShowS Source # show :: Vector a -> String Source # showList :: [Vector a] -> ShowS Source #
(Show a, Unbox a) => Show (Vector a) |
Instance details Defined in Data.Vector.Unboxed Methods showsPrec :: Int -> Vector a -> ShowS Source # show :: Vector a -> String Source # showList :: [Vector a] -> ShowS Source #
Show a => Show (Maybe a) | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Maybe a -> ShowS Source # show :: Maybe a -> String Source # showList :: [Maybe a] -> ShowS Source #
Show a => Show (Solo a) | Since: base-4.15
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Solo a -> ShowS Source # show :: Solo a -> String Source # showList :: [Solo a] -> ShowS Source #
Show a => Show [a] | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> [a] -> ShowS Source # show :: [a] -> String Source # showList :: [[a]] -> ShowS Source #
(Show a, Show b) => Show (a :-> b) |
Instance details Defined in Test.QuickCheck.Function Methods showsPrec :: Int -> (a :-> b) -> ShowS Source # show :: (a :-> b) -> String Source # showList :: [a :-> b] -> ShowS Source #
(Show a, Show b) => Show (Fun a b) |
Instance details Defined in Test.QuickCheck.Function Methods showsPrec :: Int -> Fun a b -> ShowS Source # show :: Fun a b -> String Source # showList :: [Fun a b] -> ShowS Source #
Show a => Show (Shrinking s a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods showsPrec :: Int -> Shrinking s a -> ShowS Source # show :: Shrinking s a -> String Source # showList :: [Shrinking s a] -> ShowS Source #
HasResolution a => Show (Fixed a) | Since: base-2.1
Instance details Defined in Data.Fixed Methods showsPrec :: Int -> Fixed a -> ShowS Source # show :: Fixed a -> String Source # showList :: [Fixed a] -> ShowS Source #
(Show a, Show b) => Show (Arg a b) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Arg a b -> ShowS Source # show :: Arg a b -> String Source # showList :: [Arg a b] -> ShowS Source #
(Show k, Show a) => Show (Map k a) |
Instance details Defined in Data.Map.Internal Methods showsPrec :: Int -> Map k a -> ShowS Source # show :: Map k a -> String Source # showList :: [Map k a] -> ShowS Source #
(Enum k, Show k, Show a) => Show (EnumMap k a) |
Instance details Defined in Data.EnumMap.Base Methods showsPrec :: Int -> EnumMap k a -> ShowS Source # show :: EnumMap k a -> String Source # showList :: [EnumMap k a] -> ShowS Source #
(Show1 f, Show a) => Show (Cofree f a) |
Instance details Defined in Control.Comonad.Cofree Methods showsPrec :: Int -> Cofree f a -> ShowS Source # show :: Cofree f a -> String Source # showList :: [Cofree f a] -> ShowS Source #
(Show1 f, Show a) => Show (Free f a) |
Instance details Defined in Control.Monad.Free Methods showsPrec :: Int -> Free f a -> ShowS Source # show :: Free f a -> String Source # showList :: [Free f a] -> ShowS Source #
(Show a, Show b) => Show (Either a b) | Since: base-3.0
Instance details Defined in GHC.Internal.Data.Either Methods showsPrec :: Int -> Either a b -> ShowS Source # show :: Either a b -> String Source # showList :: [Either a b] -> ShowS Source #
Show (TypeRep a) |
Instance details Defined in GHC.Internal.Data.Typeable.Internal Methods showsPrec :: Int -> TypeRep a -> ShowS Source # show :: TypeRep a -> String Source # showList :: [TypeRep a] -> ShowS Source #
Show (U1 p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> U1 p -> ShowS Source # show :: U1 p -> String Source # showList :: [U1 p] -> ShowS Source #
Show (UAddr p) |
Instance details Defined in Data.Orphans Methods showsPrec :: Int -> UAddr p -> ShowS Source # show :: UAddr p -> String Source # showList :: [UAddr p] -> ShowS Source #
Show (V1 p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> V1 p -> ShowS Source # show :: V1 p -> String Source # showList :: [V1 p] -> ShowS Source #
Show (ST s a) | Since: base-2.1
Instance details Defined in GHC.Internal.ST Methods showsPrec :: Int -> ST s a -> ShowS Source # show :: ST s a -> String Source # showList :: [ST s a] -> ShowS Source #
Show (f a) => Show (Yoneda f a) |
Instance details Defined in Data.Functor.Yoneda Methods showsPrec :: Int -> Yoneda f a -> ShowS Source # show :: Yoneda f a -> String Source # showList :: [Yoneda f a] -> ShowS Source #
Show (f a) => Show (Point f a) |
Instance details Defined in Linear.Affine Methods showsPrec :: Int -> Point f a -> ShowS Source # show :: Point f a -> String Source # showList :: [Point f a] -> ShowS Source #
Show (f a) => Show (Point f a) |
Instance details Defined in SDL.Internal.Vect Methods showsPrec :: Int -> Point f a -> ShowS Source # show :: Point f a -> String Source # showList :: [Point f a] -> ShowS Source #
(Show a, Show b) => Show (Either a b) |
Instance details Defined in Data.Strict.Either Methods showsPrec :: Int -> Either a b -> ShowS Source # show :: Either a b -> String Source # showList :: [Either a b] -> ShowS Source #
(Show a, Show b) => Show (These a b) |
Instance details Defined in Data.Strict.These Methods showsPrec :: Int -> These a b -> ShowS Source # show :: These a b -> String Source # showList :: [These a b] -> ShowS Source #
(Show a, Show b) => Show (Pair a b) |
Instance details Defined in Data.Strict.Tuple Methods showsPrec :: Int -> Pair a b -> ShowS Source # show :: Pair a b -> String Source # showList :: [Pair a b] -> ShowS Source #
(Show a, Show b) => Show (These a b) |
Instance details Defined in Data.These Methods showsPrec :: Int -> These a b -> ShowS Source # show :: These a b -> String Source # showList :: [These a b] -> ShowS Source #
(Show1 f, Show a) => Show (Lift f a) |
Instance details Defined in Control.Applicative.Lift Methods showsPrec :: Int -> Lift f a -> ShowS Source # show :: Lift f a -> String Source # showList :: [Lift f a] -> ShowS Source #
(Show1 m, Show a) => Show (MaybeT m a) |
Instance details Defined in Control.Monad.Trans.Maybe Methods showsPrec :: Int -> MaybeT m a -> ShowS Source # show :: MaybeT m a -> String Source # showList :: [MaybeT m a] -> ShowS Source #
(Show k, Show v) => Show (HashMap k v) |
Instance details Defined in Data.HashMap.Internal Methods showsPrec :: Int -> HashMap k v -> ShowS Source # show :: HashMap k v -> String Source # showList :: [HashMap k v] -> ShowS Source #
(Show source, Typeable source, Typeable target) => Show (TryFromException source target) |
Instance details Defined in Witch.TryFromException Methods showsPrec :: Int -> TryFromException source target -> ShowS Source # show :: TryFromException source target -> String Source # showList :: [TryFromException source target] -> ShowS Source #
(Show a, Show b) => Show (a, b) | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> (a, b) -> ShowS Source # show :: (a, b) -> String Source # showList :: [(a, b)] -> ShowS Source #
Show (p (Fix p a) a) => Show (Fix p a) |
Instance details Defined in Data.Bifunctor.Fix Methods showsPrec :: Int -> Fix p a -> ShowS Source # show :: Fix p a -> String Source # showList :: [Fix p a] -> ShowS Source #
Show (p a a) => Show (Join p a) |
Instance details Defined in Data.Bifunctor.Join Methods showsPrec :: Int -> Join p a -> ShowS Source # show :: Join p a -> String Source # showList :: [Join p a] -> ShowS Source #
(Show a, Show (f b)) => Show (CofreeF f a b) |
Instance details Defined in Control.Comonad.Trans.Cofree Methods showsPrec :: Int -> CofreeF f a b -> ShowS Source # show :: CofreeF f a b -> String Source # showList :: [CofreeF f a b] -> ShowS Source #
Show (w (CofreeF f a (CofreeT f w a))) => Show (CofreeT f w a) |
Instance details Defined in Control.Comonad.Trans.Cofree Methods showsPrec :: Int -> CofreeT f w a -> ShowS Source # show :: CofreeT f w a -> String Source # showList :: [CofreeT f w a] -> ShowS Source #
(Show a, Show (f b)) => Show (FreeF f a b) |
Instance details Defined in Control.Monad.Trans.Free Methods showsPrec :: Int -> FreeF f a b -> ShowS Source # show :: FreeF f a b -> String Source # showList :: [FreeF f a b] -> ShowS Source #
(Show1 f, Show1 m, Show a) => Show (FreeT f m a) |
Instance details Defined in Control.Monad.Trans.Free Methods showsPrec :: Int -> FreeT f m a -> ShowS Source # show :: FreeT f m a -> String Source # showList :: [FreeT f m a] -> ShowS Source #
Show a => Show (Const a b) | This instance would be equivalent to the derived instances of the `Const` newtype if the `getConst` field were removed Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Functor.Const Methods showsPrec :: Int -> Const a b -> ShowS Source # show :: Const a b -> String Source # showList :: [Const a b] -> ShowS Source #
Show (f a) => Show (Ap f a) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods showsPrec :: Int -> Ap f a -> ShowS Source # show :: Ap f a -> String Source # showList :: [Ap f a] -> ShowS Source #
Show (f a) => Show (Alt f a) | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods showsPrec :: Int -> Alt f a -> ShowS Source # show :: Alt f a -> String Source # showList :: [Alt f a] -> ShowS Source #
Show (OrderingI a b) |
Instance details Defined in GHC.Internal.Data.Type.Ord Methods showsPrec :: Int -> OrderingI a b -> ShowS Source # show :: OrderingI a b -> String Source # showList :: [OrderingI a b] -> ShowS Source #
Show (f p) => Show (Rec1 f p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> Rec1 f p -> ShowS Source # show :: Rec1 f p -> String Source # showList :: [Rec1 f p] -> ShowS Source #
Show (URec Char p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> URec Char p -> ShowS Source # show :: URec Char p -> String Source # showList :: [URec Char p] -> ShowS Source #
Show (URec Double p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> URec Double p -> ShowS Source # show :: URec Double p -> String Source # showList :: [URec Double p] -> ShowS Source #
Show (URec Float p) |
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> URec Float p -> ShowS Source # show :: URec Float p -> String Source # showList :: [URec Float p] -> ShowS Source #
Show (URec Int p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> URec Int p -> ShowS Source # show :: URec Int p -> String Source # showList :: [URec Int p] -> ShowS Source #
Show (URec Word p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> URec Word p -> ShowS Source # show :: URec Word p -> String Source # showList :: [URec Word p] -> ShowS Source #
Show a => Show (V n a) |
Instance details Defined in Linear.V Methods showsPrec :: Int -> V n a -> ShowS Source # show :: V n a -> String Source # showList :: [V n a] -> ShowS Source #
Show b => Show (Tagged s b) |
Instance details Defined in Data.Tagged Methods showsPrec :: Int -> Tagged s b -> ShowS Source # show :: Tagged s b -> String Source # showList :: [Tagged s b] -> ShowS Source #
(Show (f a), Show (g a), Show a) => Show (These1 f g a) |
Instance details Defined in Data.Functor.These Methods showsPrec :: Int -> These1 f g a -> ShowS Source # show :: These1 f g a -> String Source # showList :: [These1 f g a] -> ShowS Source #
(Show1 f, Show a) => Show (Backwards f a) |
Instance details Defined in Control.Applicative.Backwards Methods showsPrec :: Int -> Backwards f a -> ShowS Source # show :: Backwards f a -> String Source # showList :: [Backwards f a] -> ShowS Source #
(Show e, Show1 m, Show a) => Show (ExceptT e m a) |
Instance details Defined in Control.Monad.Trans.Except Methods showsPrec :: Int -> ExceptT e m a -> ShowS Source # show :: ExceptT e m a -> String Source # showList :: [ExceptT e m a] -> ShowS Source #
(Show1 f, Show a) => Show (IdentityT f a) |
Instance details Defined in Control.Monad.Trans.Identity Methods showsPrec :: Int -> IdentityT f a -> ShowS Source # show :: IdentityT f a -> String Source # showList :: [IdentityT f a] -> ShowS Source #
(Show w, Show1 m, Show a) => Show (WriterT w m a) |
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods showsPrec :: Int -> WriterT w m a -> ShowS Source # show :: WriterT w m a -> String Source # showList :: [WriterT w m a] -> ShowS Source #
(Show w, Show1 m, Show a) => Show (WriterT w m a) |
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods showsPrec :: Int -> WriterT w m a -> ShowS Source # show :: WriterT w m a -> String Source # showList :: [WriterT w m a] -> ShowS Source #
Show a => Show (Constant a b) |
Instance details Defined in Data.Functor.Constant Methods showsPrec :: Int -> Constant a b -> ShowS Source # show :: Constant a b -> String Source # showList :: [Constant a b] -> ShowS Source #
(Show1 f, Show a) => Show (Reverse f a) |
Instance details Defined in Data.Functor.Reverse Methods showsPrec :: Int -> Reverse f a -> ShowS Source # show :: Reverse f a -> String Source # showList :: [Reverse f a] -> ShowS Source #
(Show a, Show b, Show c) => Show (a, b, c) | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> (a, b, c) -> ShowS Source # show :: (a, b, c) -> String Source # showList :: [(a, b, c)] -> ShowS Source #
(Show (f a), Show (g a)) => Show (Product f g a) | Since: base-4.18.0.0
Instance details Defined in Data.Functor.Product Methods showsPrec :: Int -> Product f g a -> ShowS Source # show :: Product f g a -> String Source # showList :: [Product f g a] -> ShowS Source #
(Show (f a), Show (g a)) => Show (Sum f g a) | Since: base-4.18.0.0
Instance details Defined in Data.Functor.Sum Methods showsPrec :: Int -> Sum f g a -> ShowS Source # show :: Sum f g a -> String Source # showList :: [Sum f g a] -> ShowS Source #
(Show (f p), Show (g p)) => Show ((f :*: g) p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> (f :*: g) p -> ShowS Source # show :: (f :*: g) p -> String Source # showList :: [(f :*: g) p] -> ShowS Source #
(Show (f p), Show (g p)) => Show ((f :+: g) p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> (f :+: g) p -> ShowS Source # show :: (f :+: g) p -> String Source # showList :: [(f :+: g) p] -> ShowS Source #
Show c => Show (K1 i c p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> K1 i c p -> ShowS Source # show :: K1 i c p -> String Source # showList :: [K1 i c p] -> ShowS Source #
(Show a, Show b, Show c, Show d) => Show (a, b, c, d) | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> (a, b, c, d) -> ShowS Source # show :: (a, b, c, d) -> String Source # showList :: [(a, b, c, d)] -> ShowS Source #
Show (f (g a)) => Show (Compose f g a) | Since: base-4.18.0.0
Instance details Defined in Data.Functor.Compose Methods showsPrec :: Int -> Compose f g a -> ShowS Source # show :: Compose f g a -> String Source # showList :: [Compose f g a] -> ShowS Source #
Show (f a) => Show (Clown f a b) |
Instance details Defined in Data.Bifunctor.Clown Methods showsPrec :: Int -> Clown f a b -> ShowS Source # show :: Clown f a b -> String Source # showList :: [Clown f a b] -> ShowS Source #
Show (p b a) => Show (Flip p a b) |
Instance details Defined in Data.Bifunctor.Flip Methods showsPrec :: Int -> Flip p a b -> ShowS Source # show :: Flip p a b -> String Source # showList :: [Flip p a b] -> ShowS Source #
Show (g b) => Show (Joker g a b) |
Instance details Defined in Data.Bifunctor.Joker Methods showsPrec :: Int -> Joker g a b -> ShowS Source # show :: Joker g a b -> String Source # showList :: [Joker g a b] -> ShowS Source #
Show (p a b) => Show (WrappedBifunctor p a b) |
Instance details Defined in Data.Bifunctor.Wrapped Methods showsPrec :: Int -> WrappedBifunctor p a b -> ShowS Source # show :: WrappedBifunctor p a b -> String Source # showList :: [WrappedBifunctor p a b] -> ShowS Source #
Show (f (g p)) => Show ((f :.: g) p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> (f :.: g) p -> ShowS Source # show :: (f :.: g) p -> String Source # showList :: [(f :.: g) p] -> ShowS Source #
Show (f p) => Show (M1 i c f p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> M1 i c f p -> ShowS Source # show :: M1 i c f p -> String Source # showList :: [M1 i c f p] -> ShowS Source #
(Show a, Show b, Show c, Show d, Show e) => Show (a, b, c, d, e) | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> (a, b, c, d, e) -> ShowS Source # show :: (a, b, c, d, e) -> String Source # showList :: [(a, b, c, d, e)] -> ShowS Source #
(Show (f a b), Show (g a b)) => Show (Product f g a b) |
Instance details Defined in Data.Bifunctor.Product Methods showsPrec :: Int -> Product f g a b -> ShowS Source # show :: Product f g a b -> String Source # showList :: [Product f g a b] -> ShowS Source #
(Show (p a b), Show (q a b)) => Show (Sum p q a b) |
Instance details Defined in Data.Bifunctor.Sum Methods showsPrec :: Int -> Sum p q a b -> ShowS Source # show :: Sum p q a b -> String Source # showList :: [Sum p q a b] -> ShowS Source #
(Show a, Show b, Show c, Show d, Show e, Show f) => Show (a, b, c, d, e, f) | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> (a, b, c, d, e, f) -> ShowS Source # show :: (a, b, c, d, e, f) -> String Source # showList :: [(a, b, c, d, e, f)] -> ShowS Source #
Show (f (p a b)) => Show (Tannen f p a b) |
Instance details Defined in Data.Bifunctor.Tannen Methods showsPrec :: Int -> Tannen f p a b -> ShowS Source # show :: Tannen f p a b -> String Source # showList :: [Tannen f p a b] -> ShowS Source #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g) => Show (a, b, c, d, e, f, g) | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g) -> ShowS Source # show :: (a, b, c, d, e, f, g) -> String Source # showList :: [(a, b, c, d, e, f, g)] -> ShowS Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h) -> ShowS Source # show :: (a, b, c, d, e, f, g, h) -> String Source # showList :: [(a, b, c, d, e, f, g, h)] -> ShowS Source #
Show (p (f a) (g b)) => Show (Biff p f g a b) |
Instance details Defined in Data.Bifunctor.Biff Methods showsPrec :: Int -> Biff p f g a b -> ShowS Source # show :: Biff p f g a b -> String Source # showList :: [Biff p f g a b] -> ShowS Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i) -> ShowS Source # show :: (a, b, c, d, e, f, g, h, i) -> String Source # showList :: [(a, b, c, d, e, f, g, h, i)] -> ShowS Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j) -> ShowS Source # show :: (a, b, c, d, e, f, g, h, i, j) -> String Source # showList :: [(a, b, c, d, e, f, g, h, i, j)] -> ShowS Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k) -> ShowS Source # show :: (a, b, c, d, e, f, g, h, i, j, k) -> String Source # showList :: [(a, b, c, d, e, f, g, h, i, j, k)] -> ShowS Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l) -> ShowS Source # show :: (a, b, c, d, e, f, g, h, i, j, k, l) -> String Source # showList :: [(a, b, c, d, e, f, g, h, i, j, k, l)] -> ShowS Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> ShowS Source # show :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> String Source # showList :: [(a, b, c, d, e, f, g, h, i, j, k, l, m)] -> ShowS Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> ShowS Source # show :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> String Source # showList :: [(a, b, c, d, e, f, g, h, i, j, k, l, m, n)] -> ShowS Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> ShowS Source # show :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> String Source # showList :: [(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)] -> ShowS Source #

class Bounded a where Source #

The `Bounded` class is used to name the upper and lower limits of a type. `Ord` is not a superclass of `Bounded` since types that are not totally ordered may also have upper and lower bounds.

The `Bounded` class may be derived for any enumeration type; `minBound` is the first constructor listed in the `data` declaration and `maxBound` is the last. `Bounded` may also be derived for single-constructor datatypes whose constituent types are in `Bounded`.

Methods

minBound :: a Source #

maxBound :: a Source #

#### Instances

Instances details

Bounded DetailLevel Source # |
Instance details Defined in Game.LambdaHack.Client.UI.EffectDescription Methods minBound :: DetailLevel Source # maxBound :: DetailLevel Source #
Bounded MsgClassDistinct Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods minBound :: MsgClassDistinct Source # maxBound :: MsgClassDistinct Source #
Bounded MsgClassIgnore Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods minBound :: MsgClassIgnore Source # maxBound :: MsgClassIgnore Source #
Bounded MsgClassSave Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods minBound :: MsgClassSave Source # maxBound :: MsgClassSave Source #
Bounded MsgClassShow Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods minBound :: MsgClassShow Source # maxBound :: MsgClassShow Source #
Bounded MsgClassShowAndSave Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods minBound :: MsgClassShowAndSave Source # maxBound :: MsgClassShowAndSave Source #
Bounded Outcome Source # |
Instance details Defined in Game.LambdaHack.Content.FactionKind Methods minBound :: Outcome Source # maxBound :: Outcome Source #
Bounded Doctrine Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods minBound :: Doctrine Source # maxBound :: Doctrine Source #
Bounded EqpSlot Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods minBound :: EqpSlot Source # maxBound :: EqpSlot Source #
Bounded Flag Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods minBound :: Flag Source # maxBound :: Flag Source #
Bounded Skill Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods minBound :: Skill Source # maxBound :: Skill Source #
Bounded Highlight Source # |
Instance details Defined in Game.LambdaHack.Definition.Color Methods minBound :: Highlight Source # maxBound :: Highlight Source #
Bounded CStore Source # |
Instance details Defined in Game.LambdaHack.Definition.Defs Methods minBound :: CStore Source # maxBound :: CStore Source #
Bounded SLore Source # |
Instance details Defined in Game.LambdaHack.Definition.Defs Methods minBound :: SLore Source # maxBound :: SLore Source #
Bounded FancyName Source # |
Instance details Defined in Game.LambdaHack.Definition.Flavour Methods minBound :: FancyName Source # maxBound :: FancyName Source #
Bounded BlinkSpeed |
Instance details Defined in System.Console.ANSI.Types Methods minBound :: BlinkSpeed Source # maxBound :: BlinkSpeed Source #
Bounded Color |
Instance details Defined in System.Console.ANSI.Types Methods minBound :: Color Source # maxBound :: Color Source #
Bounded ColorIntensity |
Instance details Defined in System.Console.ANSI.Types Methods minBound :: ColorIntensity Source # maxBound :: ColorIntensity Source #
Bounded ConsoleIntensity |
Instance details Defined in System.Console.ANSI.Types Methods minBound :: ConsoleIntensity Source # maxBound :: ConsoleIntensity Source #
Bounded ConsoleLayer |
Instance details Defined in System.Console.ANSI.Types Methods minBound :: ConsoleLayer Source # maxBound :: ConsoleLayer Source #
Bounded Underlining |
Instance details Defined in System.Console.ANSI.Types Methods minBound :: Underlining Source # maxBound :: Underlining Source #
Bounded Extension |
Instance details Defined in GHC.LanguageExtensions.Type Methods minBound :: Extension Source # maxBound :: Extension Source #
Bounded ByteOrder | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.ByteOrder Methods minBound :: ByteOrder Source # maxBound :: ByteOrder Source #
Bounded All | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods minBound :: All Source # maxBound :: All Source #
Bounded Any | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods minBound :: Any Source # maxBound :: Any Source #
Bounded CBool |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CBool Source # maxBound :: CBool Source #
Bounded CChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CChar Source # maxBound :: CChar Source #
Bounded CInt |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CInt Source # maxBound :: CInt Source #
Bounded CIntMax |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CIntMax Source # maxBound :: CIntMax Source #
Bounded CIntPtr |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CIntPtr Source # maxBound :: CIntPtr Source #
Bounded CLLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CLLong Source # maxBound :: CLLong Source #
Bounded CLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CLong Source # maxBound :: CLong Source #
Bounded CPtrdiff |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CPtrdiff Source # maxBound :: CPtrdiff Source #
Bounded CSChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CSChar Source # maxBound :: CSChar Source #
Bounded CShort |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CShort Source # maxBound :: CShort Source #
Bounded CSigAtomic |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CSigAtomic Source # maxBound :: CSigAtomic Source #
Bounded CSize |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CSize Source # maxBound :: CSize Source #
Bounded CUChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CUChar Source # maxBound :: CUChar Source #
Bounded CUInt |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CUInt Source # maxBound :: CUInt Source #
Bounded CUIntMax |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CUIntMax Source # maxBound :: CUIntMax Source #
Bounded CUIntPtr |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CUIntPtr Source # maxBound :: CUIntPtr Source #
Bounded CULLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CULLong Source # maxBound :: CULLong Source #
Bounded CULong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CULong Source # maxBound :: CULong Source #
Bounded CUShort |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CUShort Source # maxBound :: CUShort Source #
Bounded CWchar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods minBound :: CWchar Source # maxBound :: CWchar Source #
Bounded Associativity | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods minBound :: Associativity Source # maxBound :: Associativity Source #
Bounded DecidedStrictness | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods minBound :: DecidedStrictness Source # maxBound :: DecidedStrictness Source #
Bounded SourceStrictness | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods minBound :: SourceStrictness Source # maxBound :: SourceStrictness Source #
Bounded SourceUnpackedness | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods minBound :: SourceUnpackedness Source # maxBound :: SourceUnpackedness Source #
Bounded Int16 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods minBound :: Int16 Source # maxBound :: Int16 Source #
Bounded Int32 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods minBound :: Int32 Source # maxBound :: Int32 Source #
Bounded Int64 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods minBound :: Int64 Source # maxBound :: Int64 Source #
Bounded Int8 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods minBound :: Int8 Source # maxBound :: Int8 Source #
Bounded GeneralCategory | Since: base-2.1
Instance details Defined in GHC.Internal.Unicode Methods minBound :: GeneralCategory Source # maxBound :: GeneralCategory Source #
Bounded Word16 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods minBound :: Word16 Source # maxBound :: Word16 Source #
Bounded Word32 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods minBound :: Word32 Source # maxBound :: Word32 Source #
Bounded Word64 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods minBound :: Word64 Source # maxBound :: Word64 Source #
Bounded Word8 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods minBound :: Word8 Source # maxBound :: Word8 Source #
Bounded Ordering | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: Ordering Source # maxBound :: Ordering Source #
Bounded AudioDeviceStatus |
Instance details Defined in SDL.Audio Methods minBound :: AudioDeviceStatus Source # maxBound :: AudioDeviceStatus Source #
Bounded AudioDeviceUsage |
Instance details Defined in SDL.Audio Methods minBound :: AudioDeviceUsage Source # maxBound :: AudioDeviceUsage Source #
Bounded Channels |
Instance details Defined in SDL.Audio Methods minBound :: Channels Source # maxBound :: Channels Source #
Bounded LockState |
Instance details Defined in SDL.Audio Methods minBound :: LockState Source # maxBound :: LockState Source #
Bounded PlaybackState |
Instance details Defined in SDL.Audio Methods minBound :: PlaybackState Source # maxBound :: PlaybackState Source #
Bounded InputMotion |
Instance details Defined in SDL.Event Methods minBound :: InputMotion Source # maxBound :: InputMotion Source #
Bounded AccelerometerJoystickOptions |
Instance details Defined in SDL.Hint Methods minBound :: AccelerometerJoystickOptions Source # maxBound :: AccelerometerJoystickOptions Source #
Bounded FramebufferAccelerationOptions |
Instance details Defined in SDL.Hint Methods minBound :: FramebufferAccelerationOptions Source # maxBound :: FramebufferAccelerationOptions Source #
Bounded HintPriority |
Instance details Defined in SDL.Hint Methods minBound :: HintPriority Source # maxBound :: HintPriority Source #
Bounded MacCTRLClickOptions |
Instance details Defined in SDL.Hint Methods minBound :: MacCTRLClickOptions Source # maxBound :: MacCTRLClickOptions Source #
Bounded MouseModeWarpOptions |
Instance details Defined in SDL.Hint Methods minBound :: MouseModeWarpOptions Source # maxBound :: MouseModeWarpOptions Source #
Bounded RenderDrivers |
Instance details Defined in SDL.Hint Methods minBound :: RenderDrivers Source # maxBound :: RenderDrivers Source #
Bounded RenderOpenGLShaderOptions |
Instance details Defined in SDL.Hint Methods minBound :: RenderOpenGLShaderOptions Source # maxBound :: RenderOpenGLShaderOptions Source #
Bounded RenderScaleQuality |
Instance details Defined in SDL.Hint Methods minBound :: RenderScaleQuality Source # maxBound :: RenderScaleQuality Source #
Bounded RenderVSyncOptions |
Instance details Defined in SDL.Hint Methods minBound :: RenderVSyncOptions Source # maxBound :: RenderVSyncOptions Source #
Bounded VideoWinD3DCompilerOptions |
Instance details Defined in SDL.Hint Methods minBound :: VideoWinD3DCompilerOptions Source # maxBound :: VideoWinD3DCompilerOptions Source #
Bounded InitFlag |
Instance details Defined in SDL.Init Methods minBound :: InitFlag Source # maxBound :: InitFlag Source #
Bounded Keycode |
Instance details Defined in SDL.Input.Keyboard.Codes Methods minBound :: Keycode Source # maxBound :: Keycode Source #
Bounded Scancode |
Instance details Defined in SDL.Input.Keyboard.Codes Methods minBound :: Scancode Source # maxBound :: Scancode Source #
Bounded LocationMode |
Instance details Defined in SDL.Input.Mouse Methods minBound :: LocationMode Source # maxBound :: LocationMode Source #
Bounded MouseScrollDirection |
Instance details Defined in SDL.Input.Mouse Methods minBound :: MouseScrollDirection Source # maxBound :: MouseScrollDirection Source #
Bounded BatteryState |
Instance details Defined in SDL.Power Methods minBound :: BatteryState Source # maxBound :: BatteryState Source #
Bounded MessageKind |
Instance details Defined in SDL.Video Methods minBound :: MessageKind Source # maxBound :: MessageKind Source #
Bounded WindowMode |
Instance details Defined in SDL.Video Methods minBound :: WindowMode Source # maxBound :: WindowMode Source #
Bounded Mode |
Instance details Defined in SDL.Video.OpenGL Methods minBound :: Mode Source # maxBound :: Mode Source #
Bounded SwapInterval |
Instance details Defined in SDL.Video.OpenGL Methods minBound :: SwapInterval Source # maxBound :: SwapInterval Source #
Bounded BlendMode |
Instance details Defined in SDL.Video.Renderer Methods minBound :: BlendMode Source # maxBound :: BlendMode Source #
Bounded RendererType |
Instance details Defined in SDL.Video.Renderer Methods minBound :: RendererType Source # maxBound :: RendererType Source #
Bounded TextureAccess |
Instance details Defined in SDL.Video.Renderer Methods minBound :: TextureAccess Source # maxBound :: TextureAccess Source #
Bounded Hinting |
Instance details Defined in SDL.Font Methods minBound :: Hinting Source # maxBound :: Hinting Source #
Bounded Style |
Instance details Defined in SDL.Font Methods minBound :: Style Source # maxBound :: Style Source #
Bounded I8 |
Instance details Defined in Data.Text.Foreign Methods minBound :: I8 Source # maxBound :: I8 Source #
Bounded FPFormat |
Instance details Defined in Data.Text.Lazy.Builder.RealFloat Methods minBound :: FPFormat Source # maxBound :: FPFormat Source #
Bounded QuarterOfYear |
Instance details Defined in Data.Time.Calendar.Quarter Methods minBound :: QuarterOfYear Source # maxBound :: QuarterOfYear Source #
Bounded CompressionStrategy |
Instance details Defined in Codec.Compression.Zlib.Stream Methods minBound :: CompressionStrategy Source # maxBound :: CompressionStrategy Source #
Bounded Format |
Instance details Defined in Codec.Compression.Zlib.Stream Methods minBound :: Format Source # maxBound :: Format Source #
Bounded Method |
Instance details Defined in Codec.Compression.Zlib.Stream Methods minBound :: Method Source # maxBound :: Method Source #
Bounded () | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: () Source # maxBound :: () Source #
Bounded Bool | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: Bool Source # maxBound :: Bool Source #
Bounded Char | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: Char Source # maxBound :: Char Source #
Bounded Int | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: Int Source # maxBound :: Int Source #
Bounded Levity | Since: base-4.16.0.0
Instance details Defined in GHC.Internal.Enum Methods minBound :: Levity Source # maxBound :: Levity Source #
Bounded VecCount | Since: base-4.10.0.0
Instance details Defined in GHC.Internal.Enum Methods minBound :: VecCount Source # maxBound :: VecCount Source #
Bounded VecElem | Since: base-4.10.0.0
Instance details Defined in GHC.Internal.Enum Methods minBound :: VecElem Source # maxBound :: VecElem Source #
Bounded Word | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: Word Source # maxBound :: Word Source #
Bounded a => Bounded (First a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: First a Source # maxBound :: First a Source #
Bounded a => Bounded (Last a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: Last a Source # maxBound :: Last a Source #
Bounded a => Bounded (Max a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: Max a Source # maxBound :: Max a Source #
Bounded a => Bounded (Min a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: Min a Source # maxBound :: Min a Source #
Bounded m => Bounded (WrappedMonoid m) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: WrappedMonoid m Source # maxBound :: WrappedMonoid m Source #
Bounded n => Bounded (VarInt n) |
Instance details Defined in Data.Bytes.VarInt Methods minBound :: VarInt n Source # maxBound :: VarInt n Source #
Bounded a => Bounded (Identity a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Functor.Identity Methods minBound :: Identity a Source # maxBound :: Identity a Source #
Bounded a => Bounded (Down a) | Swaps ``minBound`` and ``maxBound`` of the underlying type. Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Data.Ord Methods minBound :: Down a Source # maxBound :: Down a Source #
Bounded a => Bounded (Dual a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods minBound :: Dual a Source # maxBound :: Dual a Source #
Bounded a => Bounded (Product a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods minBound :: Product a Source # maxBound :: Product a Source #
Bounded a => Bounded (Sum a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods minBound :: Sum a Source # maxBound :: Sum a Source #
Bounded (V0 a) |
Instance details Defined in Linear.V0 Methods minBound :: V0 a Source # maxBound :: V0 a Source #
Bounded a => Bounded (V1 a) |
Instance details Defined in Linear.V1 Methods minBound :: V1 a Source # maxBound :: V1 a Source #
Bounded a => Bounded (V2 a) |
Instance details Defined in Linear.V2 Methods minBound :: V2 a Source # maxBound :: V2 a Source #
Bounded a => Bounded (V3 a) |
Instance details Defined in Linear.V3 Methods minBound :: V3 a Source # maxBound :: V3 a Source #
Bounded a => Bounded (V4 a) |
Instance details Defined in Linear.V4 Methods minBound :: V4 a Source # maxBound :: V4 a Source #
Bounded a => Bounded (V2 a) |
Instance details Defined in SDL.Internal.Vect Methods minBound :: V2 a Source # maxBound :: V2 a Source #
Bounded a => Bounded (V3 a) |
Instance details Defined in SDL.Internal.Vect Methods minBound :: V3 a Source # maxBound :: V3 a Source #
Bounded a => Bounded (V4 a) |
Instance details Defined in SDL.Internal.Vect Methods minBound :: V4 a Source # maxBound :: V4 a Source #
Bounded a => Bounded (Solo a) |
Instance details Defined in GHC.Internal.Enum Methods minBound :: Solo a Source # maxBound :: Solo a Source #
(Bounded a, Bounded b) => Bounded (Pair a b) |
Instance details Defined in Data.Strict.Tuple Methods minBound :: Pair a b Source # maxBound :: Pair a b Source #
(Bounded a, Bounded b) => Bounded (a, b) | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: (a, b) Source # maxBound :: (a, b) Source #
Bounded a => Bounded (Const a b) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Functor.Const Methods minBound :: Const a b Source # maxBound :: Const a b Source #
(Applicative f, Bounded a) => Bounded (Ap f a) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods minBound :: Ap f a Source # maxBound :: Ap f a Source #
(Bounded a, Dim n) => Bounded (V n a) |
Instance details Defined in Linear.V Methods minBound :: V n a Source # maxBound :: V n a Source #
Bounded b => Bounded (Tagged s b) |
Instance details Defined in Data.Tagged Methods minBound :: Tagged s b Source # maxBound :: Tagged s b Source #
(Bounded a, Bounded b, Bounded c) => Bounded (a, b, c) | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: (a, b, c) Source # maxBound :: (a, b, c) Source #
(Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (a, b, c, d) | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: (a, b, c, d) Source # maxBound :: (a, b, c, d) Source #
Bounded (f (g a)) => Bounded (Compose f g a) | Since: base-4.19.0.0
Instance details Defined in Data.Functor.Compose Methods minBound :: Compose f g a Source # maxBound :: Compose f g a Source #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (a, b, c, d, e) | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: (a, b, c, d, e) Source # maxBound :: (a, b, c, d, e) Source #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f) => Bounded (a, b, c, d, e, f) | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: (a, b, c, d, e, f) Source # maxBound :: (a, b, c, d, e, f) Source #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g) => Bounded (a, b, c, d, e, f, g) | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: (a, b, c, d, e, f, g) Source # maxBound :: (a, b, c, d, e, f, g) Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: (a, b, c, d, e, f, g, h) Source # maxBound :: (a, b, c, d, e, f, g, h) Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i) Source # maxBound :: (a, b, c, d, e, f, g, h, i) Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i, j) Source # maxBound :: (a, b, c, d, e, f, g, h, i, j) Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k) Source # maxBound :: (a, b, c, d, e, f, g, h, i, j, k) Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k, l) Source # maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l) Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m) Source # maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m) Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) Source # maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) Source # maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) Source #

class Enum a where Source #

Class `Enum` defines operations on sequentially ordered types.

The `enumFrom`... methods are used in Haskell's translation of arithmetic sequences.

Instances of `Enum` may be derived for any enumeration type (types whose constructors have no fields). The nullary constructors are assumed to be numbered left-to-right by `fromEnum` from `0` through `n-1`. See Chapter 10 of the Haskell Report for more details.

For any type that is an instance of class `Bounded` as well as `Enum`, the following should hold:

- The calls ``succ` `maxBound`` and ``pred` `minBound`` should result in a runtime error.
- `fromEnum` and `toEnum` should give a runtime error if the result value is not representable in the result type. For example, ``toEnum` 7 :: `Bool`` is an error.
- `enumFrom` and `enumFromThen` should be defined with an implicit bound, thus:

       enumFrom     x   = enumFromTo     x maxBound
       enumFromThen x y = enumFromThenTo x y bound
         where
           bound | fromEnum y >= fromEnum x = maxBound
                 | otherwise                = minBound

Minimal complete definition

toEnum, fromEnum

Methods

succ :: a -> a Source #

Successor of a value. For numeric types, `succ` adds 1.

pred :: a -> a Source #

Predecessor of a value. For numeric types, `pred` subtracts 1.

toEnum :: Int -> a Source #

Convert from an `Int`.

fromEnum :: a -> Int Source #

Convert to an `Int`. It is implementation-dependent what `fromEnum` returns when applied to a value that is too large to fit in an `Int`.

enumFrom :: a -> [a] Source #

Used in Haskell's translation of `[n..]` with `[n..] = enumFrom n`, a possible implementation being `enumFrom n = n : enumFrom (succ n)`.

#### Examples

Expand

-     enumFrom 4 :: [Integer] = [4,5,6,7,...]

-     enumFrom 6 :: [Int] = [6,7,8,9,...,maxBound :: Int]

enumFromThen :: a -> a -> [a] Source #

Used in Haskell's translation of `[n,n'..]` with `[n,n'..] = enumFromThen n n'`, a possible implementation being `enumFromThen n n' = n : n' : worker (f x) (f x n')`, `worker s v = v : worker s (s v)`, `x = fromEnum n' - fromEnum n` and

      f n y
        | n > 0 = f (n - 1) (succ y)
        | n < 0 = f (n + 1) (pred y)
        | otherwise = y

#### Examples

Expand

-     enumFromThen 4 6 :: [Integer] = [4,6,8,10...]

-     enumFromThen 6 2 :: [Int] = [6,2,-2,-6,...,minBound :: Int]

enumFromTo :: a -> a -> [a] Source #

Used in Haskell's translation of `[n..m]` with `[n..m] = enumFromTo n m`, a possible implementation being

      enumFromTo n m
         | n <= m = n : enumFromTo (succ n) m
         | otherwise = []

#### Examples

Expand

-     enumFromTo 6 10 :: [Int] = [6,7,8,9,10]

-     enumFromTo 42 1 :: [Integer] = []

enumFromThenTo :: a -> a -> a -> [a] Source #

Used in Haskell's translation of `[n,n'..m]` with `[n,n'..m] = enumFromThenTo n n' m`, a possible implementation being `enumFromThenTo n n' m = worker (f x) (c x) n m`, `x = fromEnum n' - fromEnum n`, `c x = bool (>=) ((x 0)`

      f n y
         | n > 0 = f (n - 1) (succ y)
         | n < 0 = f (n + 1) (pred y)
         | otherwise = y

and

      worker s c v m
         | c v m = v : worker s c (s v) m
         | otherwise = []

#### Examples

Expand

-     enumFromThenTo 4 2 -6 :: [Integer] = [4,2,0,-2,-4,-6]

-     enumFromThenTo 6 8 2 :: [Int] = []

#### Instances

Instances details

Enum DetailLevel Source # |

Instance details

Defined in Game.LambdaHack.Client.UI.EffectDescription

Methods

succ :: DetailLevel -> DetailLevel Source #

pred :: DetailLevel -> DetailLevel Source #

toEnum :: Int -> DetailLevel Source #

fromEnum :: DetailLevel -> Int Source #

enumFrom :: DetailLevel -> [DetailLevel] Source #

enumFromThen :: DetailLevel -> DetailLevel -> [DetailLevel] Source #

enumFromTo :: DetailLevel -> DetailLevel -> [DetailLevel] Source #

enumFromThenTo :: DetailLevel -> DetailLevel -> DetailLevel -> [DetailLevel] Source #

Enum MsgClassDistinct Source # |

Instance details

Defined in Game.LambdaHack.Client.UI.Msg

Methods

succ :: MsgClassDistinct -> MsgClassDistinct Source #

pred :: MsgClassDistinct -> MsgClassDistinct Source #

toEnum :: Int -> MsgClassDistinct Source #

fromEnum :: MsgClassDistinct -> Int Source #

enumFrom :: MsgClassDistinct -> [MsgClassDistinct] Source #

enumFromThen :: MsgClassDistinct -> MsgClassDistinct -> [MsgClassDistinct] Source #

enumFromTo :: MsgClassDistinct -> MsgClassDistinct -> [MsgClassDistinct] Source #

enumFromThenTo :: MsgClassDistinct -> MsgClassDistinct -> MsgClassDistinct -> [MsgClassDistinct] Source #

Enum MsgClassIgnore Source # |

Instance details

Defined in Game.LambdaHack.Client.UI.Msg

Methods

succ :: MsgClassIgnore -> MsgClassIgnore Source #

pred :: MsgClassIgnore -> MsgClassIgnore Source #

toEnum :: Int -> MsgClassIgnore Source #

fromEnum :: MsgClassIgnore -> Int Source #

enumFrom :: MsgClassIgnore -> [MsgClassIgnore] Source #

enumFromThen :: MsgClassIgnore -> MsgClassIgnore -> [MsgClassIgnore] Source #

enumFromTo :: MsgClassIgnore -> MsgClassIgnore -> [MsgClassIgnore] Source #

enumFromThenTo :: MsgClassIgnore -> MsgClassIgnore -> MsgClassIgnore -> [MsgClassIgnore] Source #

Enum MsgClassSave Source # |

Instance details

Defined in Game.LambdaHack.Client.UI.Msg

Methods

succ :: MsgClassSave -> MsgClassSave Source #

pred :: MsgClassSave -> MsgClassSave Source #

toEnum :: Int -> MsgClassSave Source #

fromEnum :: MsgClassSave -> Int Source #

enumFrom :: MsgClassSave -> [MsgClassSave] Source #

enumFromThen :: MsgClassSave -> MsgClassSave -> [MsgClassSave] Source #

enumFromTo :: MsgClassSave -> MsgClassSave -> [MsgClassSave] Source #

enumFromThenTo :: MsgClassSave -> MsgClassSave -> MsgClassSave -> [MsgClassSave] Source #

Enum MsgClassShow Source # |

Instance details

Defined in Game.LambdaHack.Client.UI.Msg

Methods

succ :: MsgClassShow -> MsgClassShow Source #

pred :: MsgClassShow -> MsgClassShow Source #

toEnum :: Int -> MsgClassShow Source #

fromEnum :: MsgClassShow -> Int Source #

enumFrom :: MsgClassShow -> [MsgClassShow] Source #

enumFromThen :: MsgClassShow -> MsgClassShow -> [MsgClassShow] Source #

enumFromTo :: MsgClassShow -> MsgClassShow -> [MsgClassShow] Source #

enumFromThenTo :: MsgClassShow -> MsgClassShow -> MsgClassShow -> [MsgClassShow] Source #

Enum MsgClassShowAndSave Source # |

Instance details

Defined in Game.LambdaHack.Client.UI.Msg

Methods

succ :: MsgClassShowAndSave -> MsgClassShowAndSave Source #

pred :: MsgClassShowAndSave -> MsgClassShowAndSave Source #

toEnum :: Int -> MsgClassShowAndSave Source #

fromEnum :: MsgClassShowAndSave -> Int Source #

enumFrom :: MsgClassShowAndSave -> [MsgClassShowAndSave] Source #

enumFromThen :: MsgClassShowAndSave -> MsgClassShowAndSave -> [MsgClassShowAndSave] Source #

enumFromTo :: MsgClassShowAndSave -> MsgClassShowAndSave -> [MsgClassShowAndSave] Source #

enumFromThenTo :: MsgClassShowAndSave -> MsgClassShowAndSave -> MsgClassShowAndSave -> [MsgClassShowAndSave] Source #

Enum DisplayFont Source # |

Instance details

Defined in Game.LambdaHack.Client.UI.Overlay

Methods

succ :: DisplayFont -> DisplayFont Source #

pred :: DisplayFont -> DisplayFont Source #

toEnum :: Int -> DisplayFont Source #

fromEnum :: DisplayFont -> Int Source #

enumFrom :: DisplayFont -> [DisplayFont] Source #

enumFromThen :: DisplayFont -> DisplayFont -> [DisplayFont] Source #

enumFromTo :: DisplayFont -> DisplayFont -> [DisplayFont] Source #

enumFromThenTo :: DisplayFont -> DisplayFont -> DisplayFont -> [DisplayFont] Source #

Enum MenuSlot Source # |

Instance details

Defined in Game.LambdaHack.Client.UI.Slideshow

Methods

succ :: MenuSlot -> MenuSlot Source #

pred :: MenuSlot -> MenuSlot Source #

toEnum :: Int -> MenuSlot Source #

fromEnum :: MenuSlot -> Int Source #

enumFrom :: MenuSlot -> [MenuSlot] Source #

enumFromThen :: MenuSlot -> MenuSlot -> [MenuSlot] Source #

enumFromTo :: MenuSlot -> MenuSlot -> [MenuSlot] Source #

enumFromThenTo :: MenuSlot -> MenuSlot -> MenuSlot -> [MenuSlot] Source #

Enum KillHow Source # |

Instance details

Defined in Game.LambdaHack.Common.Analytics

Methods

succ :: KillHow -> KillHow Source #

pred :: KillHow -> KillHow Source #

toEnum :: Int -> KillHow Source #

fromEnum :: KillHow -> Int Source #

enumFrom :: KillHow -> [KillHow] Source #

enumFromThen :: KillHow -> KillHow -> [KillHow] Source #

enumFromTo :: KillHow -> KillHow -> [KillHow] Source #

enumFromThenTo :: KillHow -> KillHow -> KillHow -> [KillHow] Source #

Enum Diplomacy Source # |

Instance details

Defined in Game.LambdaHack.Common.Faction

Methods

succ :: Diplomacy -> Diplomacy Source #

pred :: Diplomacy -> Diplomacy Source #

toEnum :: Int -> Diplomacy Source #

fromEnum :: Diplomacy -> Int Source #

enumFrom :: Diplomacy -> [Diplomacy] Source #

enumFromThen :: Diplomacy -> Diplomacy -> [Diplomacy] Source #

enumFromTo :: Diplomacy -> Diplomacy -> [Diplomacy] Source #

enumFromThenTo :: Diplomacy -> Diplomacy -> Diplomacy -> [Diplomacy] Source #

Enum ItemKindIx Source # |

Instance details

Defined in Game.LambdaHack.Common.Item

Methods

succ :: ItemKindIx -> ItemKindIx Source #

pred :: ItemKindIx -> ItemKindIx Source #

toEnum :: Int -> ItemKindIx Source #

fromEnum :: ItemKindIx -> Int Source #

enumFrom :: ItemKindIx -> [ItemKindIx] Source #

enumFromThen :: ItemKindIx -> ItemKindIx -> [ItemKindIx] Source #

enumFromTo :: ItemKindIx -> ItemKindIx -> [ItemKindIx] Source #

enumFromThenTo :: ItemKindIx -> ItemKindIx -> ItemKindIx -> [ItemKindIx] Source #

Enum Point Source # |
Instance details Defined in Game.LambdaHack.Common.Point Methods succ :: Point -> Point Source # pred :: Point -> Point Source # toEnum :: Int -> Point Source # fromEnum :: Point -> Int Source # enumFrom :: Point -> [Point] Source # enumFromThen :: Point -> Point -> [Point] Source # enumFromTo :: Point -> Point -> [Point] Source # enumFromThenTo :: Point -> Point -> Point -> [Point] Source #
Enum ActorId Source # |

Instance details

Defined in Game.LambdaHack.Common.Types

Methods

succ :: ActorId -> ActorId Source #

pred :: ActorId -> ActorId Source #

toEnum :: Int -> ActorId Source #

fromEnum :: ActorId -> Int Source #

enumFrom :: ActorId -> [ActorId] Source #

enumFromThen :: ActorId -> ActorId -> [ActorId] Source #

enumFromTo :: ActorId -> ActorId -> [ActorId] Source #

enumFromThenTo :: ActorId -> ActorId -> ActorId -> [ActorId] Source #

Enum FactionId Source # |

Instance details

Defined in Game.LambdaHack.Common.Types

Methods

succ :: FactionId -> FactionId Source #

pred :: FactionId -> FactionId Source #

toEnum :: Int -> FactionId Source #

fromEnum :: FactionId -> Int Source #

enumFrom :: FactionId -> [FactionId] Source #

enumFromThen :: FactionId -> FactionId -> [FactionId] Source #

enumFromTo :: FactionId -> FactionId -> [FactionId] Source #

enumFromThenTo :: FactionId -> FactionId -> FactionId -> [FactionId] Source #

Enum ItemId Source # |

Instance details

Defined in Game.LambdaHack.Common.Types

Methods

succ :: ItemId -> ItemId Source #

pred :: ItemId -> ItemId Source #

toEnum :: Int -> ItemId Source #

fromEnum :: ItemId -> Int Source #

enumFrom :: ItemId -> [ItemId] Source #

enumFromThen :: ItemId -> ItemId -> [ItemId] Source #

enumFromTo :: ItemId -> ItemId -> [ItemId] Source #

enumFromThenTo :: ItemId -> ItemId -> ItemId -> [ItemId] Source #

Enum LevelId Source # |

Instance details

Defined in Game.LambdaHack.Common.Types

Methods

succ :: LevelId -> LevelId Source #

pred :: LevelId -> LevelId Source #

toEnum :: Int -> LevelId Source #

fromEnum :: LevelId -> Int Source #

enumFrom :: LevelId -> [LevelId] Source #

enumFromThen :: LevelId -> LevelId -> [LevelId] Source #

enumFromTo :: LevelId -> LevelId -> [LevelId] Source #

enumFromThenTo :: LevelId -> LevelId -> LevelId -> [LevelId] Source #

Enum Vector Source # |

Instance details

Defined in Game.LambdaHack.Common.Vector

Methods

succ :: Vector -> Vector Source #

pred :: Vector -> Vector Source #

toEnum :: Int -> Vector Source #

fromEnum :: Vector -> Int Source #

enumFrom :: Vector -> [Vector] Source #

enumFromThen :: Vector -> Vector -> [Vector] Source #

enumFromTo :: Vector -> Vector -> [Vector] Source #

enumFromThenTo :: Vector -> Vector -> Vector -> [Vector] Source #

Enum Outcome Source # |

Instance details

Defined in Game.LambdaHack.Content.FactionKind

Methods

succ :: Outcome -> Outcome Source #

pred :: Outcome -> Outcome Source #

toEnum :: Int -> Outcome Source #

fromEnum :: Outcome -> Int Source #

enumFrom :: Outcome -> [Outcome] Source #

enumFromThen :: Outcome -> Outcome -> [Outcome] Source #

enumFromTo :: Outcome -> Outcome -> [Outcome] Source #

enumFromThenTo :: Outcome -> Outcome -> Outcome -> [Outcome] Source #

Enum TeamContinuity Source # |

Instance details

Defined in Game.LambdaHack.Content.FactionKind

Methods

succ :: TeamContinuity -> TeamContinuity Source #

pred :: TeamContinuity -> TeamContinuity Source #

toEnum :: Int -> TeamContinuity Source #

fromEnum :: TeamContinuity -> Int Source #

enumFrom :: TeamContinuity -> [TeamContinuity] Source #

enumFromThen :: TeamContinuity -> TeamContinuity -> [TeamContinuity] Source #

enumFromTo :: TeamContinuity -> TeamContinuity -> [TeamContinuity] Source #

enumFromThenTo :: TeamContinuity -> TeamContinuity -> TeamContinuity -> [TeamContinuity] Source #

Enum Doctrine Source # |

Instance details

Defined in Game.LambdaHack.Definition.Ability

Methods

succ :: Doctrine -> Doctrine Source #

pred :: Doctrine -> Doctrine Source #

toEnum :: Int -> Doctrine Source #

fromEnum :: Doctrine -> Int Source #

enumFrom :: Doctrine -> [Doctrine] Source #

enumFromThen :: Doctrine -> Doctrine -> [Doctrine] Source #

enumFromTo :: Doctrine -> Doctrine -> [Doctrine] Source #

enumFromThenTo :: Doctrine -> Doctrine -> Doctrine -> [Doctrine] Source #

Enum EqpSlot Source # |

Instance details

Defined in Game.LambdaHack.Definition.Ability

Methods

succ :: EqpSlot -> EqpSlot Source #

pred :: EqpSlot -> EqpSlot Source #

toEnum :: Int -> EqpSlot Source #

fromEnum :: EqpSlot -> Int Source #

enumFrom :: EqpSlot -> [EqpSlot] Source #

enumFromThen :: EqpSlot -> EqpSlot -> [EqpSlot] Source #

enumFromTo :: EqpSlot -> EqpSlot -> [EqpSlot] Source #

enumFromThenTo :: EqpSlot -> EqpSlot -> EqpSlot -> [EqpSlot] Source #

Enum Flag Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods succ :: Flag -> Flag Source # pred :: Flag -> Flag Source # toEnum :: Int -> Flag Source # fromEnum :: Flag -> Int Source # enumFrom :: Flag -> [Flag] Source # enumFromThen :: Flag -> Flag -> [Flag] Source # enumFromTo :: Flag -> Flag -> [Flag] Source # enumFromThenTo :: Flag -> Flag -> Flag -> [Flag] Source #
Enum Skill Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods succ :: Skill -> Skill Source # pred :: Skill -> Skill Source # toEnum :: Int -> Skill Source # fromEnum :: Skill -> Int Source # enumFrom :: Skill -> [Skill] Source # enumFromThen :: Skill -> Skill -> [Skill] Source # enumFromTo :: Skill -> Skill -> [Skill] Source # enumFromThenTo :: Skill -> Skill -> Skill -> [Skill] Source #
Enum AttrCharW32 Source # |

Instance details

Defined in Game.LambdaHack.Definition.Color

Methods

succ :: AttrCharW32 -> AttrCharW32 Source #

pred :: AttrCharW32 -> AttrCharW32 Source #

toEnum :: Int -> AttrCharW32 Source #

fromEnum :: AttrCharW32 -> Int Source #

enumFrom :: AttrCharW32 -> [AttrCharW32] Source #

enumFromThen :: AttrCharW32 -> AttrCharW32 -> [AttrCharW32] Source #

enumFromTo :: AttrCharW32 -> AttrCharW32 -> [AttrCharW32] Source #

enumFromThenTo :: AttrCharW32 -> AttrCharW32 -> AttrCharW32 -> [AttrCharW32] Source #

Enum Color Source # |
Instance details Defined in Game.LambdaHack.Definition.Color Methods succ :: Color -> Color Source # pred :: Color -> Color Source # toEnum :: Int -> Color Source # fromEnum :: Color -> Int Source # enumFrom :: Color -> [Color] Source # enumFromThen :: Color -> Color -> [Color] Source # enumFromTo :: Color -> Color -> [Color] Source # enumFromThenTo :: Color -> Color -> Color -> [Color] Source #
Enum Highlight Source # |

Instance details

Defined in Game.LambdaHack.Definition.Color

Methods

succ :: Highlight -> Highlight Source #

pred :: Highlight -> Highlight Source #

toEnum :: Int -> Highlight Source #

fromEnum :: Highlight -> Int Source #

enumFrom :: Highlight -> [Highlight] Source #

enumFromThen :: Highlight -> Highlight -> [Highlight] Source #

enumFromTo :: Highlight -> Highlight -> [Highlight] Source #

enumFromThenTo :: Highlight -> Highlight -> Highlight -> [Highlight] Source #

Enum CStore Source # |

Instance details

Defined in Game.LambdaHack.Definition.Defs

Methods

succ :: CStore -> CStore Source #

pred :: CStore -> CStore Source #

toEnum :: Int -> CStore Source #

fromEnum :: CStore -> Int Source #

enumFrom :: CStore -> [CStore] Source #

enumFromThen :: CStore -> CStore -> [CStore] Source #

enumFromTo :: CStore -> CStore -> [CStore] Source #

enumFromThenTo :: CStore -> CStore -> CStore -> [CStore] Source #

Enum SLore Source # |
Instance details Defined in Game.LambdaHack.Definition.Defs Methods succ :: SLore -> SLore Source # pred :: SLore -> SLore Source # toEnum :: Int -> SLore Source # fromEnum :: SLore -> Int Source # enumFrom :: SLore -> [SLore] Source # enumFromThen :: SLore -> SLore -> [SLore] Source # enumFromTo :: SLore -> SLore -> [SLore] Source # enumFromThenTo :: SLore -> SLore -> SLore -> [SLore] Source #
Enum FancyName Source # |

Instance details

Defined in Game.LambdaHack.Definition.Flavour

Methods

succ :: FancyName -> FancyName Source #

pred :: FancyName -> FancyName Source #

toEnum :: Int -> FancyName Source #

fromEnum :: FancyName -> Int Source #

enumFrom :: FancyName -> [FancyName] Source #

enumFromThen :: FancyName -> FancyName -> [FancyName] Source #

enumFromTo :: FancyName -> FancyName -> [FancyName] Source #

enumFromThenTo :: FancyName -> FancyName -> FancyName -> [FancyName] Source #

Enum Flavour Source # |

Instance details

Defined in Game.LambdaHack.Definition.Flavour

Methods

succ :: Flavour -> Flavour Source #

pred :: Flavour -> Flavour Source #

toEnum :: Int -> Flavour Source #

fromEnum :: Flavour -> Int Source #

enumFrom :: Flavour -> [Flavour] Source #

enumFromThen :: Flavour -> Flavour -> [Flavour] Source #

enumFromTo :: Flavour -> Flavour -> [Flavour] Source #

enumFromThenTo :: Flavour -> Flavour -> Flavour -> [Flavour] Source #

Enum BlinkSpeed |

Instance details

Defined in System.Console.ANSI.Types

Methods

succ :: BlinkSpeed -> BlinkSpeed Source #

pred :: BlinkSpeed -> BlinkSpeed Source #

toEnum :: Int -> BlinkSpeed Source #

fromEnum :: BlinkSpeed -> Int Source #

enumFrom :: BlinkSpeed -> [BlinkSpeed] Source #

enumFromThen :: BlinkSpeed -> BlinkSpeed -> [BlinkSpeed] Source #

enumFromTo :: BlinkSpeed -> BlinkSpeed -> [BlinkSpeed] Source #

enumFromThenTo :: BlinkSpeed -> BlinkSpeed -> BlinkSpeed -> [BlinkSpeed] Source #

Enum Color |
Instance details Defined in System.Console.ANSI.Types Methods succ :: Color -> Color Source # pred :: Color -> Color Source # toEnum :: Int -> Color Source # fromEnum :: Color -> Int Source # enumFrom :: Color -> [Color] Source # enumFromThen :: Color -> Color -> [Color] Source # enumFromTo :: Color -> Color -> [Color] Source # enumFromThenTo :: Color -> Color -> Color -> [Color] Source #
Enum ColorIntensity |

Instance details

Defined in System.Console.ANSI.Types

Methods

succ :: ColorIntensity -> ColorIntensity Source #

pred :: ColorIntensity -> ColorIntensity Source #

toEnum :: Int -> ColorIntensity Source #

fromEnum :: ColorIntensity -> Int Source #

enumFrom :: ColorIntensity -> [ColorIntensity] Source #

enumFromThen :: ColorIntensity -> ColorIntensity -> [ColorIntensity] Source #

enumFromTo :: ColorIntensity -> ColorIntensity -> [ColorIntensity] Source #

enumFromThenTo :: ColorIntensity -> ColorIntensity -> ColorIntensity -> [ColorIntensity] Source #

Enum ConsoleIntensity |

Instance details

Defined in System.Console.ANSI.Types

Methods

succ :: ConsoleIntensity -> ConsoleIntensity Source #

pred :: ConsoleIntensity -> ConsoleIntensity Source #

toEnum :: Int -> ConsoleIntensity Source #

fromEnum :: ConsoleIntensity -> Int Source #

enumFrom :: ConsoleIntensity -> [ConsoleIntensity] Source #

enumFromThen :: ConsoleIntensity -> ConsoleIntensity -> [ConsoleIntensity] Source #

enumFromTo :: ConsoleIntensity -> ConsoleIntensity -> [ConsoleIntensity] Source #

enumFromThenTo :: ConsoleIntensity -> ConsoleIntensity -> ConsoleIntensity -> [ConsoleIntensity] Source #

Enum ConsoleLayer |

Instance details

Defined in System.Console.ANSI.Types

Methods

succ :: ConsoleLayer -> ConsoleLayer Source #

pred :: ConsoleLayer -> ConsoleLayer Source #

toEnum :: Int -> ConsoleLayer Source #

fromEnum :: ConsoleLayer -> Int Source #

enumFrom :: ConsoleLayer -> [ConsoleLayer] Source #

enumFromThen :: ConsoleLayer -> ConsoleLayer -> [ConsoleLayer] Source #

enumFromTo :: ConsoleLayer -> ConsoleLayer -> [ConsoleLayer] Source #

enumFromThenTo :: ConsoleLayer -> ConsoleLayer -> ConsoleLayer -> [ConsoleLayer] Source #

Enum Underlining |

Instance details

Defined in System.Console.ANSI.Types

Methods

succ :: Underlining -> Underlining Source #

pred :: Underlining -> Underlining Source #

toEnum :: Int -> Underlining Source #

fromEnum :: Underlining -> Int Source #

enumFrom :: Underlining -> [Underlining] Source #

enumFromThen :: Underlining -> Underlining -> [Underlining] Source #

enumFromTo :: Underlining -> Underlining -> [Underlining] Source #

enumFromThenTo :: Underlining -> Underlining -> Underlining -> [Underlining] Source #

Enum Extension |

Instance details

Defined in GHC.LanguageExtensions.Type

Methods

succ :: Extension -> Extension Source #

pred :: Extension -> Extension Source #

toEnum :: Int -> Extension Source #

fromEnum :: Extension -> Int Source #

enumFrom :: Extension -> [Extension] Source #

enumFromThen :: Extension -> Extension -> [Extension] Source #

enumFromTo :: Extension -> Extension -> [Extension] Source #

enumFromThenTo :: Extension -> Extension -> Extension -> [Extension] Source #

Enum ByteOrder | Since: base-4.11.0.0

Instance details

Defined in GHC.Internal.ByteOrder

Methods

succ :: ByteOrder -> ByteOrder Source #

pred :: ByteOrder -> ByteOrder Source #

toEnum :: Int -> ByteOrder Source #

fromEnum :: ByteOrder -> Int Source #

enumFrom :: ByteOrder -> [ByteOrder] Source #

enumFromThen :: ByteOrder -> ByteOrder -> [ByteOrder] Source #

enumFromTo :: ByteOrder -> ByteOrder -> [ByteOrder] Source #

enumFromThenTo :: ByteOrder -> ByteOrder -> ByteOrder -> [ByteOrder] Source #

Enum CBool |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods succ :: CBool -> CBool Source # pred :: CBool -> CBool Source # toEnum :: Int -> CBool Source # fromEnum :: CBool -> Int Source # enumFrom :: CBool -> [CBool] Source # enumFromThen :: CBool -> CBool -> [CBool] Source # enumFromTo :: CBool -> CBool -> [CBool] Source # enumFromThenTo :: CBool -> CBool -> CBool -> [CBool] Source #
Enum CChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods succ :: CChar -> CChar Source # pred :: CChar -> CChar Source # toEnum :: Int -> CChar Source # fromEnum :: CChar -> Int Source # enumFrom :: CChar -> [CChar] Source # enumFromThen :: CChar -> CChar -> [CChar] Source # enumFromTo :: CChar -> CChar -> [CChar] Source # enumFromThenTo :: CChar -> CChar -> CChar -> [CChar] Source #
Enum CClock |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CClock -> CClock Source #

pred :: CClock -> CClock Source #

toEnum :: Int -> CClock Source #

fromEnum :: CClock -> Int Source #

enumFrom :: CClock -> [CClock] Source #

enumFromThen :: CClock -> CClock -> [CClock] Source #

enumFromTo :: CClock -> CClock -> [CClock] Source #

enumFromThenTo :: CClock -> CClock -> CClock -> [CClock] Source #

Enum CDouble |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CDouble -> CDouble Source #

pred :: CDouble -> CDouble Source #

toEnum :: Int -> CDouble Source #

fromEnum :: CDouble -> Int Source #

enumFrom :: CDouble -> [CDouble] Source #

enumFromThen :: CDouble -> CDouble -> [CDouble] Source #

enumFromTo :: CDouble -> CDouble -> [CDouble] Source #

enumFromThenTo :: CDouble -> CDouble -> CDouble -> [CDouble] Source #

Enum CFloat |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CFloat -> CFloat Source #

pred :: CFloat -> CFloat Source #

toEnum :: Int -> CFloat Source #

fromEnum :: CFloat -> Int Source #

enumFrom :: CFloat -> [CFloat] Source #

enumFromThen :: CFloat -> CFloat -> [CFloat] Source #

enumFromTo :: CFloat -> CFloat -> [CFloat] Source #

enumFromThenTo :: CFloat -> CFloat -> CFloat -> [CFloat] Source #

Enum CInt |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods succ :: CInt -> CInt Source # pred :: CInt -> CInt Source # toEnum :: Int -> CInt Source # fromEnum :: CInt -> Int Source # enumFrom :: CInt -> [CInt] Source # enumFromThen :: CInt -> CInt -> [CInt] Source # enumFromTo :: CInt -> CInt -> [CInt] Source # enumFromThenTo :: CInt -> CInt -> CInt -> [CInt] Source #
Enum CIntMax |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CIntMax -> CIntMax Source #

pred :: CIntMax -> CIntMax Source #

toEnum :: Int -> CIntMax Source #

fromEnum :: CIntMax -> Int Source #

enumFrom :: CIntMax -> [CIntMax] Source #

enumFromThen :: CIntMax -> CIntMax -> [CIntMax] Source #

enumFromTo :: CIntMax -> CIntMax -> [CIntMax] Source #

enumFromThenTo :: CIntMax -> CIntMax -> CIntMax -> [CIntMax] Source #

Enum CIntPtr |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CIntPtr -> CIntPtr Source #

pred :: CIntPtr -> CIntPtr Source #

toEnum :: Int -> CIntPtr Source #

fromEnum :: CIntPtr -> Int Source #

enumFrom :: CIntPtr -> [CIntPtr] Source #

enumFromThen :: CIntPtr -> CIntPtr -> [CIntPtr] Source #

enumFromTo :: CIntPtr -> CIntPtr -> [CIntPtr] Source #

enumFromThenTo :: CIntPtr -> CIntPtr -> CIntPtr -> [CIntPtr] Source #

Enum CLLong |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CLLong -> CLLong Source #

pred :: CLLong -> CLLong Source #

toEnum :: Int -> CLLong Source #

fromEnum :: CLLong -> Int Source #

enumFrom :: CLLong -> [CLLong] Source #

enumFromThen :: CLLong -> CLLong -> [CLLong] Source #

enumFromTo :: CLLong -> CLLong -> [CLLong] Source #

enumFromThenTo :: CLLong -> CLLong -> CLLong -> [CLLong] Source #

Enum CLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods succ :: CLong -> CLong Source # pred :: CLong -> CLong Source # toEnum :: Int -> CLong Source # fromEnum :: CLong -> Int Source # enumFrom :: CLong -> [CLong] Source # enumFromThen :: CLong -> CLong -> [CLong] Source # enumFromTo :: CLong -> CLong -> [CLong] Source # enumFromThenTo :: CLong -> CLong -> CLong -> [CLong] Source #
Enum CPtrdiff |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CPtrdiff -> CPtrdiff Source #

pred :: CPtrdiff -> CPtrdiff Source #

toEnum :: Int -> CPtrdiff Source #

fromEnum :: CPtrdiff -> Int Source #

enumFrom :: CPtrdiff -> [CPtrdiff] Source #

enumFromThen :: CPtrdiff -> CPtrdiff -> [CPtrdiff] Source #

enumFromTo :: CPtrdiff -> CPtrdiff -> [CPtrdiff] Source #

enumFromThenTo :: CPtrdiff -> CPtrdiff -> CPtrdiff -> [CPtrdiff] Source #

Enum CSChar |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CSChar -> CSChar Source #

pred :: CSChar -> CSChar Source #

toEnum :: Int -> CSChar Source #

fromEnum :: CSChar -> Int Source #

enumFrom :: CSChar -> [CSChar] Source #

enumFromThen :: CSChar -> CSChar -> [CSChar] Source #

enumFromTo :: CSChar -> CSChar -> [CSChar] Source #

enumFromThenTo :: CSChar -> CSChar -> CSChar -> [CSChar] Source #

Enum CSUSeconds |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CSUSeconds -> CSUSeconds Source #

pred :: CSUSeconds -> CSUSeconds Source #

toEnum :: Int -> CSUSeconds Source #

fromEnum :: CSUSeconds -> Int Source #

enumFrom :: CSUSeconds -> [CSUSeconds] Source #

enumFromThen :: CSUSeconds -> CSUSeconds -> [CSUSeconds] Source #

enumFromTo :: CSUSeconds -> CSUSeconds -> [CSUSeconds] Source #

enumFromThenTo :: CSUSeconds -> CSUSeconds -> CSUSeconds -> [CSUSeconds] Source #

Enum CShort |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CShort -> CShort Source #

pred :: CShort -> CShort Source #

toEnum :: Int -> CShort Source #

fromEnum :: CShort -> Int Source #

enumFrom :: CShort -> [CShort] Source #

enumFromThen :: CShort -> CShort -> [CShort] Source #

enumFromTo :: CShort -> CShort -> [CShort] Source #

enumFromThenTo :: CShort -> CShort -> CShort -> [CShort] Source #

Enum CSigAtomic |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CSigAtomic -> CSigAtomic Source #

pred :: CSigAtomic -> CSigAtomic Source #

toEnum :: Int -> CSigAtomic Source #

fromEnum :: CSigAtomic -> Int Source #

enumFrom :: CSigAtomic -> [CSigAtomic] Source #

enumFromThen :: CSigAtomic -> CSigAtomic -> [CSigAtomic] Source #

enumFromTo :: CSigAtomic -> CSigAtomic -> [CSigAtomic] Source #

enumFromThenTo :: CSigAtomic -> CSigAtomic -> CSigAtomic -> [CSigAtomic] Source #

Enum CSize |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods succ :: CSize -> CSize Source # pred :: CSize -> CSize Source # toEnum :: Int -> CSize Source # fromEnum :: CSize -> Int Source # enumFrom :: CSize -> [CSize] Source # enumFromThen :: CSize -> CSize -> [CSize] Source # enumFromTo :: CSize -> CSize -> [CSize] Source # enumFromThenTo :: CSize -> CSize -> CSize -> [CSize] Source #
Enum CTime |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods succ :: CTime -> CTime Source # pred :: CTime -> CTime Source # toEnum :: Int -> CTime Source # fromEnum :: CTime -> Int Source # enumFrom :: CTime -> [CTime] Source # enumFromThen :: CTime -> CTime -> [CTime] Source # enumFromTo :: CTime -> CTime -> [CTime] Source # enumFromThenTo :: CTime -> CTime -> CTime -> [CTime] Source #
Enum CUChar |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CUChar -> CUChar Source #

pred :: CUChar -> CUChar Source #

toEnum :: Int -> CUChar Source #

fromEnum :: CUChar -> Int Source #

enumFrom :: CUChar -> [CUChar] Source #

enumFromThen :: CUChar -> CUChar -> [CUChar] Source #

enumFromTo :: CUChar -> CUChar -> [CUChar] Source #

enumFromThenTo :: CUChar -> CUChar -> CUChar -> [CUChar] Source #

Enum CUInt |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods succ :: CUInt -> CUInt Source # pred :: CUInt -> CUInt Source # toEnum :: Int -> CUInt Source # fromEnum :: CUInt -> Int Source # enumFrom :: CUInt -> [CUInt] Source # enumFromThen :: CUInt -> CUInt -> [CUInt] Source # enumFromTo :: CUInt -> CUInt -> [CUInt] Source # enumFromThenTo :: CUInt -> CUInt -> CUInt -> [CUInt] Source #
Enum CUIntMax |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CUIntMax -> CUIntMax Source #

pred :: CUIntMax -> CUIntMax Source #

toEnum :: Int -> CUIntMax Source #

fromEnum :: CUIntMax -> Int Source #

enumFrom :: CUIntMax -> [CUIntMax] Source #

enumFromThen :: CUIntMax -> CUIntMax -> [CUIntMax] Source #

enumFromTo :: CUIntMax -> CUIntMax -> [CUIntMax] Source #

enumFromThenTo :: CUIntMax -> CUIntMax -> CUIntMax -> [CUIntMax] Source #

Enum CUIntPtr |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CUIntPtr -> CUIntPtr Source #

pred :: CUIntPtr -> CUIntPtr Source #

toEnum :: Int -> CUIntPtr Source #

fromEnum :: CUIntPtr -> Int Source #

enumFrom :: CUIntPtr -> [CUIntPtr] Source #

enumFromThen :: CUIntPtr -> CUIntPtr -> [CUIntPtr] Source #

enumFromTo :: CUIntPtr -> CUIntPtr -> [CUIntPtr] Source #

enumFromThenTo :: CUIntPtr -> CUIntPtr -> CUIntPtr -> [CUIntPtr] Source #

Enum CULLong |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CULLong -> CULLong Source #

pred :: CULLong -> CULLong Source #

toEnum :: Int -> CULLong Source #

fromEnum :: CULLong -> Int Source #

enumFrom :: CULLong -> [CULLong] Source #

enumFromThen :: CULLong -> CULLong -> [CULLong] Source #

enumFromTo :: CULLong -> CULLong -> [CULLong] Source #

enumFromThenTo :: CULLong -> CULLong -> CULLong -> [CULLong] Source #

Enum CULong |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CULong -> CULong Source #

pred :: CULong -> CULong Source #

toEnum :: Int -> CULong Source #

fromEnum :: CULong -> Int Source #

enumFrom :: CULong -> [CULong] Source #

enumFromThen :: CULong -> CULong -> [CULong] Source #

enumFromTo :: CULong -> CULong -> [CULong] Source #

enumFromThenTo :: CULong -> CULong -> CULong -> [CULong] Source #

Enum CUSeconds |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CUSeconds -> CUSeconds Source #

pred :: CUSeconds -> CUSeconds Source #

toEnum :: Int -> CUSeconds Source #

fromEnum :: CUSeconds -> Int Source #

enumFrom :: CUSeconds -> [CUSeconds] Source #

enumFromThen :: CUSeconds -> CUSeconds -> [CUSeconds] Source #

enumFromTo :: CUSeconds -> CUSeconds -> [CUSeconds] Source #

enumFromThenTo :: CUSeconds -> CUSeconds -> CUSeconds -> [CUSeconds] Source #

Enum CUShort |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CUShort -> CUShort Source #

pred :: CUShort -> CUShort Source #

toEnum :: Int -> CUShort Source #

fromEnum :: CUShort -> Int Source #

enumFrom :: CUShort -> [CUShort] Source #

enumFromThen :: CUShort -> CUShort -> [CUShort] Source #

enumFromTo :: CUShort -> CUShort -> [CUShort] Source #

enumFromThenTo :: CUShort -> CUShort -> CUShort -> [CUShort] Source #

Enum CWchar |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

succ :: CWchar -> CWchar Source #

pred :: CWchar -> CWchar Source #

toEnum :: Int -> CWchar Source #

fromEnum :: CWchar -> Int Source #

enumFrom :: CWchar -> [CWchar] Source #

enumFromThen :: CWchar -> CWchar -> [CWchar] Source #

enumFromTo :: CWchar -> CWchar -> [CWchar] Source #

enumFromThenTo :: CWchar -> CWchar -> CWchar -> [CWchar] Source #

Enum Associativity | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

succ :: Associativity -> Associativity Source #

pred :: Associativity -> Associativity Source #

toEnum :: Int -> Associativity Source #

fromEnum :: Associativity -> Int Source #

enumFrom :: Associativity -> [Associativity] Source #

enumFromThen :: Associativity -> Associativity -> [Associativity] Source #

enumFromTo :: Associativity -> Associativity -> [Associativity] Source #

enumFromThenTo :: Associativity -> Associativity -> Associativity -> [Associativity] Source #

Enum DecidedStrictness | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

succ :: DecidedStrictness -> DecidedStrictness Source #

pred :: DecidedStrictness -> DecidedStrictness Source #

toEnum :: Int -> DecidedStrictness Source #

fromEnum :: DecidedStrictness -> Int Source #

enumFrom :: DecidedStrictness -> [DecidedStrictness] Source #

enumFromThen :: DecidedStrictness -> DecidedStrictness -> [DecidedStrictness] Source #

enumFromTo :: DecidedStrictness -> DecidedStrictness -> [DecidedStrictness] Source #

enumFromThenTo :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness -> [DecidedStrictness] Source #

Enum SourceStrictness | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

succ :: SourceStrictness -> SourceStrictness Source #

pred :: SourceStrictness -> SourceStrictness Source #

toEnum :: Int -> SourceStrictness Source #

fromEnum :: SourceStrictness -> Int Source #

enumFrom :: SourceStrictness -> [SourceStrictness] Source #

enumFromThen :: SourceStrictness -> SourceStrictness -> [SourceStrictness] Source #

enumFromTo :: SourceStrictness -> SourceStrictness -> [SourceStrictness] Source #

enumFromThenTo :: SourceStrictness -> SourceStrictness -> SourceStrictness -> [SourceStrictness] Source #

Enum SourceUnpackedness | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

succ :: SourceUnpackedness -> SourceUnpackedness Source #

pred :: SourceUnpackedness -> SourceUnpackedness Source #

toEnum :: Int -> SourceUnpackedness Source #

fromEnum :: SourceUnpackedness -> Int Source #

enumFrom :: SourceUnpackedness -> [SourceUnpackedness] Source #

enumFromThen :: SourceUnpackedness -> SourceUnpackedness -> [SourceUnpackedness] Source #

enumFromTo :: SourceUnpackedness -> SourceUnpackedness -> [SourceUnpackedness] Source #

enumFromThenTo :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness -> [SourceUnpackedness] Source #

Enum IOMode | Since: base-4.2.0.0

Instance details

Defined in GHC.Internal.IO.IOMode

Methods

succ :: IOMode -> IOMode Source #

pred :: IOMode -> IOMode Source #

toEnum :: Int -> IOMode Source #

fromEnum :: IOMode -> Int Source #

enumFrom :: IOMode -> [IOMode] Source #

enumFromThen :: IOMode -> IOMode -> [IOMode] Source #

enumFromTo :: IOMode -> IOMode -> [IOMode] Source #

enumFromThenTo :: IOMode -> IOMode -> IOMode -> [IOMode] Source #

Enum Int16 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods succ :: Int16 -> Int16 Source # pred :: Int16 -> Int16 Source # toEnum :: Int -> Int16 Source # fromEnum :: Int16 -> Int Source # enumFrom :: Int16 -> [Int16] Source # enumFromThen :: Int16 -> Int16 -> [Int16] Source # enumFromTo :: Int16 -> Int16 -> [Int16] Source # enumFromThenTo :: Int16 -> Int16 -> Int16 -> [Int16] Source #
Enum Int32 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods succ :: Int32 -> Int32 Source # pred :: Int32 -> Int32 Source # toEnum :: Int -> Int32 Source # fromEnum :: Int32 -> Int Source # enumFrom :: Int32 -> [Int32] Source # enumFromThen :: Int32 -> Int32 -> [Int32] Source # enumFromTo :: Int32 -> Int32 -> [Int32] Source # enumFromThenTo :: Int32 -> Int32 -> Int32 -> [Int32] Source #
Enum Int64 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods succ :: Int64 -> Int64 Source # pred :: Int64 -> Int64 Source # toEnum :: Int -> Int64 Source # fromEnum :: Int64 -> Int Source # enumFrom :: Int64 -> [Int64] Source # enumFromThen :: Int64 -> Int64 -> [Int64] Source # enumFromTo :: Int64 -> Int64 -> [Int64] Source # enumFromThenTo :: Int64 -> Int64 -> Int64 -> [Int64] Source #
Enum Int8 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods succ :: Int8 -> Int8 Source # pred :: Int8 -> Int8 Source # toEnum :: Int -> Int8 Source # fromEnum :: Int8 -> Int Source # enumFrom :: Int8 -> [Int8] Source # enumFromThen :: Int8 -> Int8 -> [Int8] Source # enumFromTo :: Int8 -> Int8 -> [Int8] Source # enumFromThenTo :: Int8 -> Int8 -> Int8 -> [Int8] Source #
Enum DoCostCentres | Since: base-4.8.0.0

Instance details

Defined in GHC.Internal.RTS.Flags

Methods

succ :: DoCostCentres -> DoCostCentres Source #

pred :: DoCostCentres -> DoCostCentres Source #

toEnum :: Int -> DoCostCentres Source #

fromEnum :: DoCostCentres -> Int Source #

enumFrom :: DoCostCentres -> [DoCostCentres] Source #

enumFromThen :: DoCostCentres -> DoCostCentres -> [DoCostCentres] Source #

enumFromTo :: DoCostCentres -> DoCostCentres -> [DoCostCentres] Source #

enumFromThenTo :: DoCostCentres -> DoCostCentres -> DoCostCentres -> [DoCostCentres] Source #

Enum DoHeapProfile | Since: base-4.8.0.0

Instance details

Defined in GHC.Internal.RTS.Flags

Methods

succ :: DoHeapProfile -> DoHeapProfile Source #

pred :: DoHeapProfile -> DoHeapProfile Source #

toEnum :: Int -> DoHeapProfile Source #

fromEnum :: DoHeapProfile -> Int Source #

enumFrom :: DoHeapProfile -> [DoHeapProfile] Source #

enumFromThen :: DoHeapProfile -> DoHeapProfile -> [DoHeapProfile] Source #

enumFromTo :: DoHeapProfile -> DoHeapProfile -> [DoHeapProfile] Source #

enumFromThenTo :: DoHeapProfile -> DoHeapProfile -> DoHeapProfile -> [DoHeapProfile] Source #

Enum DoTrace | Since: base-4.8.0.0

Instance details

Defined in GHC.Internal.RTS.Flags

Methods

succ :: DoTrace -> DoTrace Source #

pred :: DoTrace -> DoTrace Source #

toEnum :: Int -> DoTrace Source #

fromEnum :: DoTrace -> Int Source #

enumFrom :: DoTrace -> [DoTrace] Source #

enumFromThen :: DoTrace -> DoTrace -> [DoTrace] Source #

enumFromTo :: DoTrace -> DoTrace -> [DoTrace] Source #

enumFromThenTo :: DoTrace -> DoTrace -> DoTrace -> [DoTrace] Source #

Enum GiveGCStats | Since: base-4.8.0.0

Instance details

Defined in GHC.Internal.RTS.Flags

Methods

succ :: GiveGCStats -> GiveGCStats Source #

pred :: GiveGCStats -> GiveGCStats Source #

toEnum :: Int -> GiveGCStats Source #

fromEnum :: GiveGCStats -> Int Source #

enumFrom :: GiveGCStats -> [GiveGCStats] Source #

enumFromThen :: GiveGCStats -> GiveGCStats -> [GiveGCStats] Source #

enumFromTo :: GiveGCStats -> GiveGCStats -> [GiveGCStats] Source #

enumFromThenTo :: GiveGCStats -> GiveGCStats -> GiveGCStats -> [GiveGCStats] Source #

Enum IoSubSystem | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.RTS.Flags

Methods

succ :: IoSubSystem -> IoSubSystem Source #

pred :: IoSubSystem -> IoSubSystem Source #

toEnum :: Int -> IoSubSystem Source #

fromEnum :: IoSubSystem -> Int Source #

enumFrom :: IoSubSystem -> [IoSubSystem] Source #

enumFromThen :: IoSubSystem -> IoSubSystem -> [IoSubSystem] Source #

enumFromTo :: IoSubSystem -> IoSubSystem -> [IoSubSystem] Source #

enumFromThenTo :: IoSubSystem -> IoSubSystem -> IoSubSystem -> [IoSubSystem] Source #

Enum GeneralCategory | Since: base-2.1

Instance details

Defined in GHC.Internal.Unicode

Methods

succ :: GeneralCategory -> GeneralCategory Source #

pred :: GeneralCategory -> GeneralCategory Source #

toEnum :: Int -> GeneralCategory Source #

fromEnum :: GeneralCategory -> Int Source #

enumFrom :: GeneralCategory -> [GeneralCategory] Source #

enumFromThen :: GeneralCategory -> GeneralCategory -> [GeneralCategory] Source #

enumFromTo :: GeneralCategory -> GeneralCategory -> [GeneralCategory] Source #

enumFromThenTo :: GeneralCategory -> GeneralCategory -> GeneralCategory -> [GeneralCategory] Source #

Enum Word16 | Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Methods

succ :: Word16 -> Word16 Source #

pred :: Word16 -> Word16 Source #

toEnum :: Int -> Word16 Source #

fromEnum :: Word16 -> Int Source #

enumFrom :: Word16 -> [Word16] Source #

enumFromThen :: Word16 -> Word16 -> [Word16] Source #

enumFromTo :: Word16 -> Word16 -> [Word16] Source #

enumFromThenTo :: Word16 -> Word16 -> Word16 -> [Word16] Source #

Enum Word32 | Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Methods

succ :: Word32 -> Word32 Source #

pred :: Word32 -> Word32 Source #

toEnum :: Int -> Word32 Source #

fromEnum :: Word32 -> Int Source #

enumFrom :: Word32 -> [Word32] Source #

enumFromThen :: Word32 -> Word32 -> [Word32] Source #

enumFromTo :: Word32 -> Word32 -> [Word32] Source #

enumFromThenTo :: Word32 -> Word32 -> Word32 -> [Word32] Source #

Enum Word64 | Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Methods

succ :: Word64 -> Word64 Source #

pred :: Word64 -> Word64 Source #

toEnum :: Int -> Word64 Source #

fromEnum :: Word64 -> Int Source #

enumFrom :: Word64 -> [Word64] Source #

enumFromThen :: Word64 -> Word64 -> [Word64] Source #

enumFromTo :: Word64 -> Word64 -> [Word64] Source #

enumFromThenTo :: Word64 -> Word64 -> Word64 -> [Word64] Source #

Enum Word8 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods succ :: Word8 -> Word8 Source # pred :: Word8 -> Word8 Source # toEnum :: Int -> Word8 Source # fromEnum :: Word8 -> Int Source # enumFrom :: Word8 -> [Word8] Source # enumFromThen :: Word8 -> Word8 -> [Word8] Source # enumFromTo :: Word8 -> Word8 -> [Word8] Source # enumFromThenTo :: Word8 -> Word8 -> Word8 -> [Word8] Source #
Enum Ordering | Since: base-2.1

Instance details

Defined in GHC.Internal.Enum

Methods

succ :: Ordering -> Ordering Source #

pred :: Ordering -> Ordering Source #

toEnum :: Int -> Ordering Source #

fromEnum :: Ordering -> Int Source #

enumFrom :: Ordering -> [Ordering] Source #

enumFromThen :: Ordering -> Ordering -> [Ordering] Source #

enumFromTo :: Ordering -> Ordering -> [Ordering] Source #

enumFromThenTo :: Ordering -> Ordering -> Ordering -> [Ordering] Source #

Enum AudioDeviceStatus |

Instance details

Defined in SDL.Audio

Methods

succ :: AudioDeviceStatus -> AudioDeviceStatus Source #

pred :: AudioDeviceStatus -> AudioDeviceStatus Source #

toEnum :: Int -> AudioDeviceStatus Source #

fromEnum :: AudioDeviceStatus -> Int Source #

enumFrom :: AudioDeviceStatus -> [AudioDeviceStatus] Source #

enumFromThen :: AudioDeviceStatus -> AudioDeviceStatus -> [AudioDeviceStatus] Source #

enumFromTo :: AudioDeviceStatus -> AudioDeviceStatus -> [AudioDeviceStatus] Source #

enumFromThenTo :: AudioDeviceStatus -> AudioDeviceStatus -> AudioDeviceStatus -> [AudioDeviceStatus] Source #

Enum AudioDeviceUsage |

Instance details

Defined in SDL.Audio

Methods

succ :: AudioDeviceUsage -> AudioDeviceUsage Source #

pred :: AudioDeviceUsage -> AudioDeviceUsage Source #

toEnum :: Int -> AudioDeviceUsage Source #

fromEnum :: AudioDeviceUsage -> Int Source #

enumFrom :: AudioDeviceUsage -> [AudioDeviceUsage] Source #

enumFromThen :: AudioDeviceUsage -> AudioDeviceUsage -> [AudioDeviceUsage] Source #

enumFromTo :: AudioDeviceUsage -> AudioDeviceUsage -> [AudioDeviceUsage] Source #

enumFromThenTo :: AudioDeviceUsage -> AudioDeviceUsage -> AudioDeviceUsage -> [AudioDeviceUsage] Source #

Enum Channels |

Instance details

Defined in SDL.Audio

Methods

succ :: Channels -> Channels Source #

pred :: Channels -> Channels Source #

toEnum :: Int -> Channels Source #

fromEnum :: Channels -> Int Source #

enumFrom :: Channels -> [Channels] Source #

enumFromThen :: Channels -> Channels -> [Channels] Source #

enumFromTo :: Channels -> Channels -> [Channels] Source #

enumFromThenTo :: Channels -> Channels -> Channels -> [Channels] Source #

Enum LockState |

Instance details

Defined in SDL.Audio

Methods

succ :: LockState -> LockState Source #

pred :: LockState -> LockState Source #

toEnum :: Int -> LockState Source #

fromEnum :: LockState -> Int Source #

enumFrom :: LockState -> [LockState] Source #

enumFromThen :: LockState -> LockState -> [LockState] Source #

enumFromTo :: LockState -> LockState -> [LockState] Source #

enumFromThenTo :: LockState -> LockState -> LockState -> [LockState] Source #

Enum PlaybackState |

Instance details

Defined in SDL.Audio

Methods

succ :: PlaybackState -> PlaybackState Source #

pred :: PlaybackState -> PlaybackState Source #

toEnum :: Int -> PlaybackState Source #

fromEnum :: PlaybackState -> Int Source #

enumFrom :: PlaybackState -> [PlaybackState] Source #

enumFromThen :: PlaybackState -> PlaybackState -> [PlaybackState] Source #

enumFromTo :: PlaybackState -> PlaybackState -> [PlaybackState] Source #

enumFromThenTo :: PlaybackState -> PlaybackState -> PlaybackState -> [PlaybackState] Source #

Enum InputMotion |

Instance details

Defined in SDL.Event

Methods

succ :: InputMotion -> InputMotion Source #

pred :: InputMotion -> InputMotion Source #

toEnum :: Int -> InputMotion Source #

fromEnum :: InputMotion -> Int Source #

enumFrom :: InputMotion -> [InputMotion] Source #

enumFromThen :: InputMotion -> InputMotion -> [InputMotion] Source #

enumFromTo :: InputMotion -> InputMotion -> [InputMotion] Source #

enumFromThenTo :: InputMotion -> InputMotion -> InputMotion -> [InputMotion] Source #

Enum AccelerometerJoystickOptions |

Instance details

Defined in SDL.Hint

Methods

succ :: AccelerometerJoystickOptions -> AccelerometerJoystickOptions Source #

pred :: AccelerometerJoystickOptions -> AccelerometerJoystickOptions Source #

toEnum :: Int -> AccelerometerJoystickOptions Source #

fromEnum :: AccelerometerJoystickOptions -> Int Source #

enumFrom :: AccelerometerJoystickOptions -> [AccelerometerJoystickOptions] Source #

enumFromThen :: AccelerometerJoystickOptions -> AccelerometerJoystickOptions -> [AccelerometerJoystickOptions] Source #

enumFromTo :: AccelerometerJoystickOptions -> AccelerometerJoystickOptions -> [AccelerometerJoystickOptions] Source #

enumFromThenTo :: AccelerometerJoystickOptions -> AccelerometerJoystickOptions -> AccelerometerJoystickOptions -> [AccelerometerJoystickOptions] Source #

Enum FramebufferAccelerationOptions |

Instance details

Defined in SDL.Hint

Methods

succ :: FramebufferAccelerationOptions -> FramebufferAccelerationOptions Source #

pred :: FramebufferAccelerationOptions -> FramebufferAccelerationOptions Source #

toEnum :: Int -> FramebufferAccelerationOptions Source #

fromEnum :: FramebufferAccelerationOptions -> Int Source #

enumFrom :: FramebufferAccelerationOptions -> [FramebufferAccelerationOptions] Source #

enumFromThen :: FramebufferAccelerationOptions -> FramebufferAccelerationOptions -> [FramebufferAccelerationOptions] Source #

enumFromTo :: FramebufferAccelerationOptions -> FramebufferAccelerationOptions -> [FramebufferAccelerationOptions] Source #

enumFromThenTo :: FramebufferAccelerationOptions -> FramebufferAccelerationOptions -> FramebufferAccelerationOptions -> [FramebufferAccelerationOptions] Source #

Enum HintPriority |

Instance details

Defined in SDL.Hint

Methods

succ :: HintPriority -> HintPriority Source #

pred :: HintPriority -> HintPriority Source #

toEnum :: Int -> HintPriority Source #

fromEnum :: HintPriority -> Int Source #

enumFrom :: HintPriority -> [HintPriority] Source #

enumFromThen :: HintPriority -> HintPriority -> [HintPriority] Source #

enumFromTo :: HintPriority -> HintPriority -> [HintPriority] Source #

enumFromThenTo :: HintPriority -> HintPriority -> HintPriority -> [HintPriority] Source #

Enum MacCTRLClickOptions |

Instance details

Defined in SDL.Hint

Methods

succ :: MacCTRLClickOptions -> MacCTRLClickOptions Source #

pred :: MacCTRLClickOptions -> MacCTRLClickOptions Source #

toEnum :: Int -> MacCTRLClickOptions Source #

fromEnum :: MacCTRLClickOptions -> Int Source #

enumFrom :: MacCTRLClickOptions -> [MacCTRLClickOptions] Source #

enumFromThen :: MacCTRLClickOptions -> MacCTRLClickOptions -> [MacCTRLClickOptions] Source #

enumFromTo :: MacCTRLClickOptions -> MacCTRLClickOptions -> [MacCTRLClickOptions] Source #

enumFromThenTo :: MacCTRLClickOptions -> MacCTRLClickOptions -> MacCTRLClickOptions -> [MacCTRLClickOptions] Source #

Enum MouseModeWarpOptions |

Instance details

Defined in SDL.Hint

Methods

succ :: MouseModeWarpOptions -> MouseModeWarpOptions Source #

pred :: MouseModeWarpOptions -> MouseModeWarpOptions Source #

toEnum :: Int -> MouseModeWarpOptions Source #

fromEnum :: MouseModeWarpOptions -> Int Source #

enumFrom :: MouseModeWarpOptions -> [MouseModeWarpOptions] Source #

enumFromThen :: MouseModeWarpOptions -> MouseModeWarpOptions -> [MouseModeWarpOptions] Source #

enumFromTo :: MouseModeWarpOptions -> MouseModeWarpOptions -> [MouseModeWarpOptions] Source #

enumFromThenTo :: MouseModeWarpOptions -> MouseModeWarpOptions -> MouseModeWarpOptions -> [MouseModeWarpOptions] Source #

Enum RenderDrivers |

Instance details

Defined in SDL.Hint

Methods

succ :: RenderDrivers -> RenderDrivers Source #

pred :: RenderDrivers -> RenderDrivers Source #

toEnum :: Int -> RenderDrivers Source #

fromEnum :: RenderDrivers -> Int Source #

enumFrom :: RenderDrivers -> [RenderDrivers] Source #

enumFromThen :: RenderDrivers -> RenderDrivers -> [RenderDrivers] Source #

enumFromTo :: RenderDrivers -> RenderDrivers -> [RenderDrivers] Source #

enumFromThenTo :: RenderDrivers -> RenderDrivers -> RenderDrivers -> [RenderDrivers] Source #

Enum RenderOpenGLShaderOptions |

Instance details

Defined in SDL.Hint

Methods

succ :: RenderOpenGLShaderOptions -> RenderOpenGLShaderOptions Source #

pred :: RenderOpenGLShaderOptions -> RenderOpenGLShaderOptions Source #

toEnum :: Int -> RenderOpenGLShaderOptions Source #

fromEnum :: RenderOpenGLShaderOptions -> Int Source #

enumFrom :: RenderOpenGLShaderOptions -> [RenderOpenGLShaderOptions] Source #

enumFromThen :: RenderOpenGLShaderOptions -> RenderOpenGLShaderOptions -> [RenderOpenGLShaderOptions] Source #

enumFromTo :: RenderOpenGLShaderOptions -> RenderOpenGLShaderOptions -> [RenderOpenGLShaderOptions] Source #

enumFromThenTo :: RenderOpenGLShaderOptions -> RenderOpenGLShaderOptions -> RenderOpenGLShaderOptions -> [RenderOpenGLShaderOptions] Source #

Enum RenderScaleQuality |

Instance details

Defined in SDL.Hint

Methods

succ :: RenderScaleQuality -> RenderScaleQuality Source #

pred :: RenderScaleQuality -> RenderScaleQuality Source #

toEnum :: Int -> RenderScaleQuality Source #

fromEnum :: RenderScaleQuality -> Int Source #

enumFrom :: RenderScaleQuality -> [RenderScaleQuality] Source #

enumFromThen :: RenderScaleQuality -> RenderScaleQuality -> [RenderScaleQuality] Source #

enumFromTo :: RenderScaleQuality -> RenderScaleQuality -> [RenderScaleQuality] Source #

enumFromThenTo :: RenderScaleQuality -> RenderScaleQuality -> RenderScaleQuality -> [RenderScaleQuality] Source #

Enum RenderVSyncOptions |

Instance details

Defined in SDL.Hint

Methods

succ :: RenderVSyncOptions -> RenderVSyncOptions Source #

pred :: RenderVSyncOptions -> RenderVSyncOptions Source #

toEnum :: Int -> RenderVSyncOptions Source #

fromEnum :: RenderVSyncOptions -> Int Source #

enumFrom :: RenderVSyncOptions -> [RenderVSyncOptions] Source #

enumFromThen :: RenderVSyncOptions -> RenderVSyncOptions -> [RenderVSyncOptions] Source #

enumFromTo :: RenderVSyncOptions -> RenderVSyncOptions -> [RenderVSyncOptions] Source #

enumFromThenTo :: RenderVSyncOptions -> RenderVSyncOptions -> RenderVSyncOptions -> [RenderVSyncOptions] Source #

Enum VideoWinD3DCompilerOptions |

Instance details

Defined in SDL.Hint

Methods

succ :: VideoWinD3DCompilerOptions -> VideoWinD3DCompilerOptions Source #

pred :: VideoWinD3DCompilerOptions -> VideoWinD3DCompilerOptions Source #

toEnum :: Int -> VideoWinD3DCompilerOptions Source #

fromEnum :: VideoWinD3DCompilerOptions -> Int Source #

enumFrom :: VideoWinD3DCompilerOptions -> [VideoWinD3DCompilerOptions] Source #

enumFromThen :: VideoWinD3DCompilerOptions -> VideoWinD3DCompilerOptions -> [VideoWinD3DCompilerOptions] Source #

enumFromTo :: VideoWinD3DCompilerOptions -> VideoWinD3DCompilerOptions -> [VideoWinD3DCompilerOptions] Source #

enumFromThenTo :: VideoWinD3DCompilerOptions -> VideoWinD3DCompilerOptions -> VideoWinD3DCompilerOptions -> [VideoWinD3DCompilerOptions] Source #

Enum InitFlag |

Instance details

Defined in SDL.Init

Methods

succ :: InitFlag -> InitFlag Source #

pred :: InitFlag -> InitFlag Source #

toEnum :: Int -> InitFlag Source #

fromEnum :: InitFlag -> Int Source #

enumFrom :: InitFlag -> [InitFlag] Source #

enumFromThen :: InitFlag -> InitFlag -> [InitFlag] Source #

enumFromTo :: InitFlag -> InitFlag -> [InitFlag] Source #

enumFromThenTo :: InitFlag -> InitFlag -> InitFlag -> [InitFlag] Source #

Enum LocationMode |

Instance details

Defined in SDL.Input.Mouse

Methods

succ :: LocationMode -> LocationMode Source #

pred :: LocationMode -> LocationMode Source #

toEnum :: Int -> LocationMode Source #

fromEnum :: LocationMode -> Int Source #

enumFrom :: LocationMode -> [LocationMode] Source #

enumFromThen :: LocationMode -> LocationMode -> [LocationMode] Source #

enumFromTo :: LocationMode -> LocationMode -> [LocationMode] Source #

enumFromThenTo :: LocationMode -> LocationMode -> LocationMode -> [LocationMode] Source #

Enum MouseScrollDirection |

Instance details

Defined in SDL.Input.Mouse

Methods

succ :: MouseScrollDirection -> MouseScrollDirection Source #

pred :: MouseScrollDirection -> MouseScrollDirection Source #

toEnum :: Int -> MouseScrollDirection Source #

fromEnum :: MouseScrollDirection -> Int Source #

enumFrom :: MouseScrollDirection -> [MouseScrollDirection] Source #

enumFromThen :: MouseScrollDirection -> MouseScrollDirection -> [MouseScrollDirection] Source #

enumFromTo :: MouseScrollDirection -> MouseScrollDirection -> [MouseScrollDirection] Source #

enumFromThenTo :: MouseScrollDirection -> MouseScrollDirection -> MouseScrollDirection -> [MouseScrollDirection] Source #

Enum BatteryState |

Instance details

Defined in SDL.Power

Methods

succ :: BatteryState -> BatteryState Source #

pred :: BatteryState -> BatteryState Source #

toEnum :: Int -> BatteryState Source #

fromEnum :: BatteryState -> Int Source #

enumFrom :: BatteryState -> [BatteryState] Source #

enumFromThen :: BatteryState -> BatteryState -> [BatteryState] Source #

enumFromTo :: BatteryState -> BatteryState -> [BatteryState] Source #

enumFromThenTo :: BatteryState -> BatteryState -> BatteryState -> [BatteryState] Source #

Enum MessageKind |

Instance details

Defined in SDL.Video

Methods

succ :: MessageKind -> MessageKind Source #

pred :: MessageKind -> MessageKind Source #

toEnum :: Int -> MessageKind Source #

fromEnum :: MessageKind -> Int Source #

enumFrom :: MessageKind -> [MessageKind] Source #

enumFromThen :: MessageKind -> MessageKind -> [MessageKind] Source #

enumFromTo :: MessageKind -> MessageKind -> [MessageKind] Source #

enumFromThenTo :: MessageKind -> MessageKind -> MessageKind -> [MessageKind] Source #

Enum WindowMode |

Instance details

Defined in SDL.Video

Methods

succ :: WindowMode -> WindowMode Source #

pred :: WindowMode -> WindowMode Source #

toEnum :: Int -> WindowMode Source #

fromEnum :: WindowMode -> Int Source #

enumFrom :: WindowMode -> [WindowMode] Source #

enumFromThen :: WindowMode -> WindowMode -> [WindowMode] Source #

enumFromTo :: WindowMode -> WindowMode -> [WindowMode] Source #

enumFromThenTo :: WindowMode -> WindowMode -> WindowMode -> [WindowMode] Source #

Enum Mode |
Instance details Defined in SDL.Video.OpenGL Methods succ :: Mode -> Mode Source # pred :: Mode -> Mode Source # toEnum :: Int -> Mode Source # fromEnum :: Mode -> Int Source # enumFrom :: Mode -> [Mode] Source # enumFromThen :: Mode -> Mode -> [Mode] Source # enumFromTo :: Mode -> Mode -> [Mode] Source # enumFromThenTo :: Mode -> Mode -> Mode -> [Mode] Source #
Enum SwapInterval |

Instance details

Defined in SDL.Video.OpenGL

Methods

succ :: SwapInterval -> SwapInterval Source #

pred :: SwapInterval -> SwapInterval Source #

toEnum :: Int -> SwapInterval Source #

fromEnum :: SwapInterval -> Int Source #

enumFrom :: SwapInterval -> [SwapInterval] Source #

enumFromThen :: SwapInterval -> SwapInterval -> [SwapInterval] Source #

enumFromTo :: SwapInterval -> SwapInterval -> [SwapInterval] Source #

enumFromThenTo :: SwapInterval -> SwapInterval -> SwapInterval -> [SwapInterval] Source #

Enum BlendMode |

Instance details

Defined in SDL.Video.Renderer

Methods

succ :: BlendMode -> BlendMode Source #

pred :: BlendMode -> BlendMode Source #

toEnum :: Int -> BlendMode Source #

fromEnum :: BlendMode -> Int Source #

enumFrom :: BlendMode -> [BlendMode] Source #

enumFromThen :: BlendMode -> BlendMode -> [BlendMode] Source #

enumFromTo :: BlendMode -> BlendMode -> [BlendMode] Source #

enumFromThenTo :: BlendMode -> BlendMode -> BlendMode -> [BlendMode] Source #

Enum RendererType |

Instance details

Defined in SDL.Video.Renderer

Methods

succ :: RendererType -> RendererType Source #

pred :: RendererType -> RendererType Source #

toEnum :: Int -> RendererType Source #

fromEnum :: RendererType -> Int Source #

enumFrom :: RendererType -> [RendererType] Source #

enumFromThen :: RendererType -> RendererType -> [RendererType] Source #

enumFromTo :: RendererType -> RendererType -> [RendererType] Source #

enumFromThenTo :: RendererType -> RendererType -> RendererType -> [RendererType] Source #

Enum TextureAccess |

Instance details

Defined in SDL.Video.Renderer

Methods

succ :: TextureAccess -> TextureAccess Source #

pred :: TextureAccess -> TextureAccess Source #

toEnum :: Int -> TextureAccess Source #

fromEnum :: TextureAccess -> Int Source #

enumFrom :: TextureAccess -> [TextureAccess] Source #

enumFromThen :: TextureAccess -> TextureAccess -> [TextureAccess] Source #

enumFromTo :: TextureAccess -> TextureAccess -> [TextureAccess] Source #

enumFromThenTo :: TextureAccess -> TextureAccess -> TextureAccess -> [TextureAccess] Source #

Enum Hinting |

Instance details

Defined in SDL.Font

Methods

succ :: Hinting -> Hinting Source #

pred :: Hinting -> Hinting Source #

toEnum :: Int -> Hinting Source #

fromEnum :: Hinting -> Int Source #

enumFrom :: Hinting -> [Hinting] Source #

enumFromThen :: Hinting -> Hinting -> [Hinting] Source #

enumFromTo :: Hinting -> Hinting -> [Hinting] Source #

enumFromThenTo :: Hinting -> Hinting -> Hinting -> [Hinting] Source #

Enum Style |
Instance details Defined in SDL.Font Methods succ :: Style -> Style Source # pred :: Style -> Style Source # toEnum :: Int -> Style Source # fromEnum :: Style -> Int Source # enumFrom :: Style -> [Style] Source # enumFromThen :: Style -> Style -> [Style] Source # enumFromTo :: Style -> Style -> [Style] Source # enumFromThenTo :: Style -> Style -> Style -> [Style] Source #
Enum I8 |
Instance details Defined in Data.Text.Foreign Methods succ :: I8 -> I8 Source # pred :: I8 -> I8 Source # toEnum :: Int -> I8 Source # fromEnum :: I8 -> Int Source # enumFrom :: I8 -> [I8] Source # enumFromThen :: I8 -> I8 -> [I8] Source # enumFromTo :: I8 -> I8 -> [I8] Source # enumFromThenTo :: I8 -> I8 -> I8 -> [I8] Source #
Enum FPFormat |

Instance details

Defined in Data.Text.Lazy.Builder.RealFloat

Methods

succ :: FPFormat -> FPFormat Source #

pred :: FPFormat -> FPFormat Source #

toEnum :: Int -> FPFormat Source #

fromEnum :: FPFormat -> Int Source #

enumFrom :: FPFormat -> [FPFormat] Source #

enumFromThen :: FPFormat -> FPFormat -> [FPFormat] Source #

enumFromTo :: FPFormat -> FPFormat -> [FPFormat] Source #

enumFromThenTo :: FPFormat -> FPFormat -> FPFormat -> [FPFormat] Source #

Enum Day |
Instance details Defined in Data.Time.Calendar.Days Methods succ :: Day -> Day Source # pred :: Day -> Day Source # toEnum :: Int -> Day Source # fromEnum :: Day -> Int Source # enumFrom :: Day -> [Day] Source # enumFromThen :: Day -> Day -> [Day] Source # enumFromTo :: Day -> Day -> [Day] Source # enumFromThenTo :: Day -> Day -> Day -> [Day] Source #
Enum Month |
Instance details Defined in Data.Time.Calendar.Month Methods succ :: Month -> Month Source # pred :: Month -> Month Source # toEnum :: Int -> Month Source # fromEnum :: Month -> Int Source # enumFrom :: Month -> [Month] Source # enumFromThen :: Month -> Month -> [Month] Source # enumFromTo :: Month -> Month -> [Month] Source # enumFromThenTo :: Month -> Month -> Month -> [Month] Source #
Enum Quarter |

Instance details

Defined in Data.Time.Calendar.Quarter

Methods

succ :: Quarter -> Quarter Source #

pred :: Quarter -> Quarter Source #

toEnum :: Int -> Quarter Source #

fromEnum :: Quarter -> Int Source #

enumFrom :: Quarter -> [Quarter] Source #

enumFromThen :: Quarter -> Quarter -> [Quarter] Source #

enumFromTo :: Quarter -> Quarter -> [Quarter] Source #

enumFromThenTo :: Quarter -> Quarter -> Quarter -> [Quarter] Source #

Enum QuarterOfYear | maps Q1..Q4 to 1..4

Instance details

Defined in Data.Time.Calendar.Quarter

Methods

succ :: QuarterOfYear -> QuarterOfYear Source #

pred :: QuarterOfYear -> QuarterOfYear Source #

toEnum :: Int -> QuarterOfYear Source #

fromEnum :: QuarterOfYear -> Int Source #

enumFrom :: QuarterOfYear -> [QuarterOfYear] Source #

enumFromThen :: QuarterOfYear -> QuarterOfYear -> [QuarterOfYear] Source #

enumFromTo :: QuarterOfYear -> QuarterOfYear -> [QuarterOfYear] Source #

enumFromThenTo :: QuarterOfYear -> QuarterOfYear -> QuarterOfYear -> [QuarterOfYear] Source #

Enum DiffTime |

Instance details

Defined in Data.Time.Clock.Internal.DiffTime

Methods

succ :: DiffTime -> DiffTime Source #

pred :: DiffTime -> DiffTime Source #

toEnum :: Int -> DiffTime Source #

fromEnum :: DiffTime -> Int Source #

enumFrom :: DiffTime -> [DiffTime] Source #

enumFromThen :: DiffTime -> DiffTime -> [DiffTime] Source #

enumFromTo :: DiffTime -> DiffTime -> [DiffTime] Source #

enumFromThenTo :: DiffTime -> DiffTime -> DiffTime -> [DiffTime] Source #

Enum NominalDiffTime |

Instance details

Defined in Data.Time.Clock.Internal.NominalDiffTime

Methods

succ :: NominalDiffTime -> NominalDiffTime Source #

pred :: NominalDiffTime -> NominalDiffTime Source #

toEnum :: Int -> NominalDiffTime Source #

fromEnum :: NominalDiffTime -> Int Source #

enumFrom :: NominalDiffTime -> [NominalDiffTime] Source #

enumFromThen :: NominalDiffTime -> NominalDiffTime -> [NominalDiffTime] Source #

enumFromTo :: NominalDiffTime -> NominalDiffTime -> [NominalDiffTime] Source #

enumFromThenTo :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime -> [NominalDiffTime] Source #

Enum CompressionStrategy |

Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

succ :: CompressionStrategy -> CompressionStrategy Source #

pred :: CompressionStrategy -> CompressionStrategy Source #

toEnum :: Int -> CompressionStrategy Source #

fromEnum :: CompressionStrategy -> Int Source #

enumFrom :: CompressionStrategy -> [CompressionStrategy] Source #

enumFromThen :: CompressionStrategy -> CompressionStrategy -> [CompressionStrategy] Source #

enumFromTo :: CompressionStrategy -> CompressionStrategy -> [CompressionStrategy] Source #

enumFromThenTo :: CompressionStrategy -> CompressionStrategy -> CompressionStrategy -> [CompressionStrategy] Source #

Enum Format |

Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

succ :: Format -> Format Source #

pred :: Format -> Format Source #

toEnum :: Int -> Format Source #

fromEnum :: Format -> Int Source #

enumFrom :: Format -> [Format] Source #

enumFromThen :: Format -> Format -> [Format] Source #

enumFromTo :: Format -> Format -> [Format] Source #

enumFromThenTo :: Format -> Format -> Format -> [Format] Source #

Enum Method |

Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

succ :: Method -> Method Source #

pred :: Method -> Method Source #

toEnum :: Int -> Method Source #

fromEnum :: Method -> Int Source #

enumFrom :: Method -> [Method] Source #

enumFromThen :: Method -> Method -> [Method] Source #

enumFromTo :: Method -> Method -> [Method] Source #

enumFromThenTo :: Method -> Method -> Method -> [Method] Source #

Enum Integer | Since: base-2.1

Instance details

Defined in GHC.Internal.Enum

Methods

succ :: Integer -> Integer Source #

pred :: Integer -> Integer Source #

toEnum :: Int -> Integer Source #

fromEnum :: Integer -> Int Source #

enumFrom :: Integer -> [Integer] Source #

enumFromThen :: Integer -> Integer -> [Integer] Source #

enumFromTo :: Integer -> Integer -> [Integer] Source #

enumFromThenTo :: Integer -> Integer -> Integer -> [Integer] Source #

Enum Natural | Since: base-4.8.0.0

Instance details

Defined in GHC.Internal.Enum

Methods

succ :: Natural -> Natural Source #

pred :: Natural -> Natural Source #

toEnum :: Int -> Natural Source #

fromEnum :: Natural -> Int Source #

enumFrom :: Natural -> [Natural] Source #

enumFromThen :: Natural -> Natural -> [Natural] Source #

enumFromTo :: Natural -> Natural -> [Natural] Source #

enumFromThenTo :: Natural -> Natural -> Natural -> [Natural] Source #

Enum () | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods succ :: () -> () Source # pred :: () -> () Source # toEnum :: Int -> () Source # fromEnum :: () -> Int Source # enumFrom :: () -> [()] Source # enumFromThen :: () -> () -> [()] Source # enumFromTo :: () -> () -> [()] Source # enumFromThenTo :: () -> () -> () -> [()] Source #
Enum Bool | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods succ :: Bool -> Bool Source # pred :: Bool -> Bool Source # toEnum :: Int -> Bool Source # fromEnum :: Bool -> Int Source # enumFrom :: Bool -> [Bool] Source # enumFromThen :: Bool -> Bool -> [Bool] Source # enumFromTo :: Bool -> Bool -> [Bool] Source # enumFromThenTo :: Bool -> Bool -> Bool -> [Bool] Source #
Enum Char | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods succ :: Char -> Char Source # pred :: Char -> Char Source # toEnum :: Int -> Char Source # fromEnum :: Char -> Int Source # enumFrom :: Char -> [Char] Source # enumFromThen :: Char -> Char -> [Char] Source # enumFromTo :: Char -> Char -> [Char] Source # enumFromThenTo :: Char -> Char -> Char -> [Char] Source #

Enum Double

`fromEnum` just truncates its argument, beware of all sorts of overflows.

List generators have extremely peculiar behavior, mandated by Haskell Report 2010:

    >>> [0..1.5]
    [0.0,1.0,2.0]

Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

succ :: Double -> Double Source #

pred :: Double -> Double Source #

toEnum :: Int -> Double Source #

fromEnum :: Double -> Int Source #

enumFrom :: Double -> [Double] Source #

enumFromThen :: Double -> Double -> [Double] Source #

enumFromTo :: Double -> Double -> [Double] Source #

enumFromThenTo :: Double -> Double -> Double -> [Double] Source #

Enum Float

`fromEnum` just truncates its argument, beware of all sorts of overflows.

List generators have extremely peculiar behavior, mandated by Haskell Report 2010:

    >>> [0..1.5 :: Float]
    [0.0,1.0,2.0]

Since: base-2.1

Instance details Defined in GHC.Internal.Float Methods succ :: Float -> Float Source # pred :: Float -> Float Source # toEnum :: Int -> Float Source # fromEnum :: Float -> Int Source # enumFrom :: Float -> [Float] Source # enumFromThen :: Float -> Float -> [Float] Source # enumFromTo :: Float -> Float -> [Float] Source # enumFromThenTo :: Float -> Float -> Float -> [Float] Source #
Enum Int | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods succ :: Int -> Int Source # pred :: Int -> Int Source # toEnum :: Int -> Int Source # fromEnum :: Int -> Int Source # enumFrom :: Int -> [Int] Source # enumFromThen :: Int -> Int -> [Int] Source # enumFromTo :: Int -> Int -> [Int] Source # enumFromThenTo :: Int -> Int -> Int -> [Int] Source #
Enum Levity | Since: base-4.16.0.0

Instance details

Defined in GHC.Internal.Enum

Methods

succ :: Levity -> Levity Source #

pred :: Levity -> Levity Source #

toEnum :: Int -> Levity Source #

fromEnum :: Levity -> Int Source #

enumFrom :: Levity -> [Levity] Source #

enumFromThen :: Levity -> Levity -> [Levity] Source #

enumFromTo :: Levity -> Levity -> [Levity] Source #

enumFromThenTo :: Levity -> Levity -> Levity -> [Levity] Source #

Enum VecCount | Since: base-4.10.0.0

Instance details

Defined in GHC.Internal.Enum

Methods

succ :: VecCount -> VecCount Source #

pred :: VecCount -> VecCount Source #

toEnum :: Int -> VecCount Source #

fromEnum :: VecCount -> Int Source #

enumFrom :: VecCount -> [VecCount] Source #

enumFromThen :: VecCount -> VecCount -> [VecCount] Source #

enumFromTo :: VecCount -> VecCount -> [VecCount] Source #

enumFromThenTo :: VecCount -> VecCount -> VecCount -> [VecCount] Source #

Enum VecElem | Since: base-4.10.0.0

Instance details

Defined in GHC.Internal.Enum

Methods

succ :: VecElem -> VecElem Source #

pred :: VecElem -> VecElem Source #

toEnum :: Int -> VecElem Source #

fromEnum :: VecElem -> Int Source #

enumFrom :: VecElem -> [VecElem] Source #

enumFromThen :: VecElem -> VecElem -> [VecElem] Source #

enumFromTo :: VecElem -> VecElem -> [VecElem] Source #

enumFromThenTo :: VecElem -> VecElem -> VecElem -> [VecElem] Source #

Enum Word | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods succ :: Word -> Word Source # pred :: Word -> Word Source # toEnum :: Int -> Word Source # fromEnum :: Word -> Int Source # enumFrom :: Word -> [Word] Source # enumFromThen :: Word -> Word -> [Word] Source # enumFromTo :: Word -> Word -> [Word] Source # enumFromThenTo :: Word -> Word -> Word -> [Word] Source #
Enum (ContentId c) Source # |

Instance details

Defined in Game.LambdaHack.Definition.DefsInternal

Methods

succ :: ContentId c -> ContentId c Source #

pred :: ContentId c -> ContentId c Source #

toEnum :: Int -> ContentId c Source #

fromEnum :: ContentId c -> Int Source #

enumFrom :: ContentId c -> [ContentId c] Source #

enumFromThen :: ContentId c -> ContentId c -> [ContentId c] Source #

enumFromTo :: ContentId c -> ContentId c -> [ContentId c] Source #

enumFromThenTo :: ContentId c -> ContentId c -> ContentId c -> [ContentId c] Source #

Enum a => Enum (Blind a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

succ :: Blind a -> Blind a Source #

pred :: Blind a -> Blind a Source #

toEnum :: Int -> Blind a Source #

fromEnum :: Blind a -> Int Source #

enumFrom :: Blind a -> [Blind a] Source #

enumFromThen :: Blind a -> Blind a -> [Blind a] Source #

enumFromTo :: Blind a -> Blind a -> [Blind a] Source #

enumFromThenTo :: Blind a -> Blind a -> Blind a -> [Blind a] Source #

Enum a => Enum (Fixed a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

succ :: Fixed a -> Fixed a Source #

pred :: Fixed a -> Fixed a Source #

toEnum :: Int -> Fixed a Source #

fromEnum :: Fixed a -> Int Source #

enumFrom :: Fixed a -> [Fixed a] Source #

enumFromThen :: Fixed a -> Fixed a -> [Fixed a] Source #

enumFromTo :: Fixed a -> Fixed a -> [Fixed a] Source #

enumFromThenTo :: Fixed a -> Fixed a -> Fixed a -> [Fixed a] Source #

Enum a => Enum (Large a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

succ :: Large a -> Large a Source #

pred :: Large a -> Large a Source #

toEnum :: Int -> Large a Source #

fromEnum :: Large a -> Int Source #

enumFrom :: Large a -> [Large a] Source #

enumFromThen :: Large a -> Large a -> [Large a] Source #

enumFromTo :: Large a -> Large a -> [Large a] Source #

enumFromThenTo :: Large a -> Large a -> Large a -> [Large a] Source #

Enum a => Enum (Negative a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

succ :: Negative a -> Negative a Source #

pred :: Negative a -> Negative a Source #

toEnum :: Int -> Negative a Source #

fromEnum :: Negative a -> Int Source #

enumFrom :: Negative a -> [Negative a] Source #

enumFromThen :: Negative a -> Negative a -> [Negative a] Source #

enumFromTo :: Negative a -> Negative a -> [Negative a] Source #

enumFromThenTo :: Negative a -> Negative a -> Negative a -> [Negative a] Source #

Enum a => Enum (NonNegative a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

succ :: NonNegative a -> NonNegative a Source #

pred :: NonNegative a -> NonNegative a Source #

toEnum :: Int -> NonNegative a Source #

fromEnum :: NonNegative a -> Int Source #

enumFrom :: NonNegative a -> [NonNegative a] Source #

enumFromThen :: NonNegative a -> NonNegative a -> [NonNegative a] Source #

enumFromTo :: NonNegative a -> NonNegative a -> [NonNegative a] Source #

enumFromThenTo :: NonNegative a -> NonNegative a -> NonNegative a -> [NonNegative a] Source #

Enum a => Enum (NonPositive a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

succ :: NonPositive a -> NonPositive a Source #

pred :: NonPositive a -> NonPositive a Source #

toEnum :: Int -> NonPositive a Source #

fromEnum :: NonPositive a -> Int Source #

enumFrom :: NonPositive a -> [NonPositive a] Source #

enumFromThen :: NonPositive a -> NonPositive a -> [NonPositive a] Source #

enumFromTo :: NonPositive a -> NonPositive a -> [NonPositive a] Source #

enumFromThenTo :: NonPositive a -> NonPositive a -> NonPositive a -> [NonPositive a] Source #

Enum a => Enum (NonZero a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

succ :: NonZero a -> NonZero a Source #

pred :: NonZero a -> NonZero a Source #

toEnum :: Int -> NonZero a Source #

fromEnum :: NonZero a -> Int Source #

enumFrom :: NonZero a -> [NonZero a] Source #

enumFromThen :: NonZero a -> NonZero a -> [NonZero a] Source #

enumFromTo :: NonZero a -> NonZero a -> [NonZero a] Source #

enumFromThenTo :: NonZero a -> NonZero a -> NonZero a -> [NonZero a] Source #

Enum a => Enum (Positive a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

succ :: Positive a -> Positive a Source #

pred :: Positive a -> Positive a Source #

toEnum :: Int -> Positive a Source #

fromEnum :: Positive a -> Int Source #

enumFrom :: Positive a -> [Positive a] Source #

enumFromThen :: Positive a -> Positive a -> [Positive a] Source #

enumFromTo :: Positive a -> Positive a -> [Positive a] Source #

enumFromThenTo :: Positive a -> Positive a -> Positive a -> [Positive a] Source #

Enum a => Enum (Shrink2 a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

succ :: Shrink2 a -> Shrink2 a Source #

pred :: Shrink2 a -> Shrink2 a Source #

toEnum :: Int -> Shrink2 a Source #

fromEnum :: Shrink2 a -> Int Source #

enumFrom :: Shrink2 a -> [Shrink2 a] Source #

enumFromThen :: Shrink2 a -> Shrink2 a -> [Shrink2 a] Source #

enumFromTo :: Shrink2 a -> Shrink2 a -> [Shrink2 a] Source #

enumFromThenTo :: Shrink2 a -> Shrink2 a -> Shrink2 a -> [Shrink2 a] Source #

Enum a => Enum (Small a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

succ :: Small a -> Small a Source #

pred :: Small a -> Small a Source #

toEnum :: Int -> Small a Source #

fromEnum :: Small a -> Int Source #

enumFrom :: Small a -> [Small a] Source #

enumFromThen :: Small a -> Small a -> [Small a] Source #

enumFromTo :: Small a -> Small a -> [Small a] Source #

enumFromThenTo :: Small a -> Small a -> Small a -> [Small a] Source #

Enum a => Enum (First a) | Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

succ :: First a -> First a Source #

pred :: First a -> First a Source #

toEnum :: Int -> First a Source #

fromEnum :: First a -> Int Source #

enumFrom :: First a -> [First a] Source #

enumFromThen :: First a -> First a -> [First a] Source #

enumFromTo :: First a -> First a -> [First a] Source #

enumFromThenTo :: First a -> First a -> First a -> [First a] Source #

Enum a => Enum (Last a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods succ :: Last a -> Last a Source # pred :: Last a -> Last a Source # toEnum :: Int -> Last a Source # fromEnum :: Last a -> Int Source # enumFrom :: Last a -> [Last a] Source # enumFromThen :: Last a -> Last a -> [Last a] Source # enumFromTo :: Last a -> Last a -> [Last a] Source # enumFromThenTo :: Last a -> Last a -> Last a -> [Last a] Source #
Enum a => Enum (Max a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods succ :: Max a -> Max a Source # pred :: Max a -> Max a Source # toEnum :: Int -> Max a Source # fromEnum :: Max a -> Int Source # enumFrom :: Max a -> [Max a] Source # enumFromThen :: Max a -> Max a -> [Max a] Source # enumFromTo :: Max a -> Max a -> [Max a] Source # enumFromThenTo :: Max a -> Max a -> Max a -> [Max a] Source #
Enum a => Enum (Min a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods succ :: Min a -> Min a Source # pred :: Min a -> Min a Source # toEnum :: Int -> Min a Source # fromEnum :: Min a -> Int Source # enumFrom :: Min a -> [Min a] Source # enumFromThen :: Min a -> Min a -> [Min a] Source # enumFromTo :: Min a -> Min a -> [Min a] Source # enumFromThenTo :: Min a -> Min a -> Min a -> [Min a] Source #
Enum a => Enum (WrappedMonoid a) | Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

succ :: WrappedMonoid a -> WrappedMonoid a Source #

pred :: WrappedMonoid a -> WrappedMonoid a Source #

toEnum :: Int -> WrappedMonoid a Source #

fromEnum :: WrappedMonoid a -> Int Source #

enumFrom :: WrappedMonoid a -> [WrappedMonoid a] Source #

enumFromThen :: WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] Source #

enumFromTo :: WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] Source #

enumFromThenTo :: WrappedMonoid a -> WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] Source #

Enum n => Enum (VarInt n) |

Instance details

Defined in Data.Bytes.VarInt

Methods

succ :: VarInt n -> VarInt n Source #

pred :: VarInt n -> VarInt n Source #

toEnum :: Int -> VarInt n Source #

fromEnum :: VarInt n -> Int Source #

enumFrom :: VarInt n -> [VarInt n] Source #

enumFromThen :: VarInt n -> VarInt n -> [VarInt n] Source #

enumFromTo :: VarInt n -> VarInt n -> [VarInt n] Source #

enumFromThenTo :: VarInt n -> VarInt n -> VarInt n -> [VarInt n] Source #

Enum a => Enum (Identity a) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Identity

Methods

succ :: Identity a -> Identity a Source #

pred :: Identity a -> Identity a Source #

toEnum :: Int -> Identity a Source #

fromEnum :: Identity a -> Int Source #

enumFrom :: Identity a -> [Identity a] Source #

enumFromThen :: Identity a -> Identity a -> [Identity a] Source #

enumFromTo :: Identity a -> Identity a -> [Identity a] Source #

enumFromThenTo :: Identity a -> Identity a -> Identity a -> [Identity a] Source #

(Enum a, Bounded a, Eq a) => Enum (Down a) | Swaps ``succ`` and ``pred`` of the underlying type. Since: base-4.18.0.0

Instance details

Defined in GHC.Internal.Data.Ord

Methods

succ :: Down a -> Down a Source #

pred :: Down a -> Down a Source #

toEnum :: Int -> Down a Source #

fromEnum :: Down a -> Int Source #

enumFrom :: Down a -> [Down a] Source #

enumFromThen :: Down a -> Down a -> [Down a] Source #

enumFromTo :: Down a -> Down a -> [Down a] Source #

enumFromThenTo :: Down a -> Down a -> Down a -> [Down a] Source #

Integral a => Enum (Ratio a) | Since: base-2.0.1

Instance details

Defined in GHC.Internal.Real

Methods

succ :: Ratio a -> Ratio a Source #

pred :: Ratio a -> Ratio a Source #

toEnum :: Int -> Ratio a Source #

fromEnum :: Ratio a -> Int Source #

enumFrom :: Ratio a -> [Ratio a] Source #

enumFromThen :: Ratio a -> Ratio a -> [Ratio a] Source #

enumFromTo :: Ratio a -> Ratio a -> [Ratio a] Source #

enumFromThenTo :: Ratio a -> Ratio a -> Ratio a -> [Ratio a] Source #

Enum (V0 a) |
Instance details Defined in Linear.V0 Methods succ :: V0 a -> V0 a Source # pred :: V0 a -> V0 a Source # toEnum :: Int -> V0 a Source # fromEnum :: V0 a -> Int Source # enumFrom :: V0 a -> [V0 a] Source # enumFromThen :: V0 a -> V0 a -> [V0 a] Source # enumFromTo :: V0 a -> V0 a -> [V0 a] Source # enumFromThenTo :: V0 a -> V0 a -> V0 a -> [V0 a] Source #
Enum a => Enum (Solo a) |

Instance details

Defined in GHC.Internal.Enum

Methods

succ :: Solo a -> Solo a Source #

pred :: Solo a -> Solo a Source #

toEnum :: Int -> Solo a Source #

fromEnum :: Solo a -> Int Source #

enumFrom :: Solo a -> [Solo a] Source #

enumFromThen :: Solo a -> Solo a -> [Solo a] Source #

enumFromTo :: Solo a -> Solo a -> [Solo a] Source #

enumFromThenTo :: Solo a -> Solo a -> Solo a -> [Solo a] Source #

Enum (Fixed a)

Recall that, for numeric types, `succ` and `pred` typically add and subtract `1`, respectively. This is not true in the case of `Fixed`, whose successor and predecessor functions intuitively return the "next" and "previous" values in the enumeration. The results of these functions thus depend on the resolution of the `Fixed` value. For example, when enumerating values of resolution `10^-3` of `type Milli = Fixed E3`,

    >>> succ (0.000 :: Milli)
    0.001

and likewise

    >>> pred (0.000 :: Milli)
    -0.001

In other words, `succ` and `pred` increment and decrement a fixed-precision value by the least amount such that the value's resolution is unchanged. For example, `10^-12` is the smallest (positive) amount that can be added to a value of `type Pico = Fixed E12` without changing its resolution, and so

    >>> succ (0.000000000000 :: Pico)
    0.000000000001

and similarly

    >>> pred (0.000000000000 :: Pico)
    -0.000000000001

This is worth bearing in mind when defining `Fixed` arithmetic sequences. In particular, you may be forgiven for thinking the sequence

      [1..10] :: [Pico]

evaluates to `[1, 2, 3, 4, 5, 6, 7, 8, 9, 10] :: [Pico]`.

However, this is not true. On the contrary, similarly to the above implementations of `succ` and `pred`, `enumFromTo :: Pico -> Pico -> [Pico]` has a "step size" of `10^-12`. Hence, the list `[1..10] :: [Pico]` has the form

      [1.000000000000, 1.00000000001, 1.00000000002, ..., 10.000000000000]

and contains `9 * 10^12 + 1` values.

Since: base-2.1

Instance details

Defined in Data.Fixed

Methods

succ :: Fixed a -> Fixed a Source #

pred :: Fixed a -> Fixed a Source #

toEnum :: Int -> Fixed a Source #

fromEnum :: Fixed a -> Int Source #

enumFrom :: Fixed a -> [Fixed a] Source #

enumFromThen :: Fixed a -> Fixed a -> [Fixed a] Source #

enumFromTo :: Fixed a -> Fixed a -> [Fixed a] Source #

enumFromThenTo :: Fixed a -> Fixed a -> Fixed a -> [Fixed a] Source #

Enum a => Enum (Const a b) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

succ :: Const a b -> Const a b Source #

pred :: Const a b -> Const a b Source #

toEnum :: Int -> Const a b Source #

fromEnum :: Const a b -> Int Source #

enumFrom :: Const a b -> [Const a b] Source #

enumFromThen :: Const a b -> Const a b -> [Const a b] Source #

enumFromTo :: Const a b -> Const a b -> [Const a b] Source #

enumFromThenTo :: Const a b -> Const a b -> Const a b -> [Const a b] Source #

Enum (f a) => Enum (Ap f a) | Since: base-4.12.0.0

Instance details

Defined in GHC.Internal.Data.Monoid

Methods

succ :: Ap f a -> Ap f a Source #

pred :: Ap f a -> Ap f a Source #

toEnum :: Int -> Ap f a Source #

fromEnum :: Ap f a -> Int Source #

enumFrom :: Ap f a -> [Ap f a] Source #

enumFromThen :: Ap f a -> Ap f a -> [Ap f a] Source #

enumFromTo :: Ap f a -> Ap f a -> [Ap f a] Source #

enumFromThenTo :: Ap f a -> Ap f a -> Ap f a -> [Ap f a] Source #

Enum (f a) => Enum (Alt f a) | Since: base-4.8.0.0

Instance details

Defined in GHC.Internal.Data.Semigroup.Internal

Methods

succ :: Alt f a -> Alt f a Source #

pred :: Alt f a -> Alt f a Source #

toEnum :: Int -> Alt f a Source #

fromEnum :: Alt f a -> Int Source #

enumFrom :: Alt f a -> [Alt f a] Source #

enumFromThen :: Alt f a -> Alt f a -> [Alt f a] Source #

enumFromTo :: Alt f a -> Alt f a -> [Alt f a] Source #

enumFromThenTo :: Alt f a -> Alt f a -> Alt f a -> [Alt f a] Source #

Enum a => Enum (Tagged s a) |

Instance details

Defined in Data.Tagged

Methods

succ :: Tagged s a -> Tagged s a Source #

pred :: Tagged s a -> Tagged s a Source #

toEnum :: Int -> Tagged s a Source #

fromEnum :: Tagged s a -> Int Source #

enumFrom :: Tagged s a -> [Tagged s a] Source #

enumFromThen :: Tagged s a -> Tagged s a -> [Tagged s a] Source #

enumFromTo :: Tagged s a -> Tagged s a -> [Tagged s a] Source #

enumFromThenTo :: Tagged s a -> Tagged s a -> Tagged s a -> [Tagged s a] Source #

Enum (f (g a)) => Enum (Compose f g a) | Since: base-4.19.0.0

Instance details

Defined in Data.Functor.Compose

Methods

succ :: Compose f g a -> Compose f g a Source #

pred :: Compose f g a -> Compose f g a Source #

toEnum :: Int -> Compose f g a Source #

fromEnum :: Compose f g a -> Int Source #

enumFrom :: Compose f g a -> [Compose f g a] Source #

enumFromThen :: Compose f g a -> Compose f g a -> [Compose f g a] Source #

enumFromTo :: Compose f g a -> Compose f g a -> [Compose f g a] Source #

enumFromThenTo :: Compose f g a -> Compose f g a -> Compose f g a -> [Compose f g a] Source #

class (Real a, Fractional a) => RealFrac a where Source #

Extracting components of fractions.

Minimal complete definition

properFraction

Methods

properFraction :: Integral b => a -> (b, a) Source #

The function `properFraction` takes a real fractional number `x` and returns a pair `(n,f)` such that `x = n+f`, and:

- `n` is an integral number with the same sign as `x`; and
- `f` is a fraction with the same type and sign as `x`, and with absolute value less than `1`.

The default definitions of the `ceiling`, `floor`, `truncate` and `round` functions are in terms of `properFraction`.

truncate :: Integral b => a -> b Source #

``truncate` x` returns the integer nearest `x` between zero and `x`

round :: Integral b => a -> b Source #

``round` x` returns the nearest integer to `x`; the even integer if `x` is equidistant between two integers

ceiling :: Integral b => a -> b Source #

``ceiling` x` returns the least integer not less than `x`

floor :: Integral b => a -> b Source #

``floor` x` returns the greatest integer not greater than `x`

#### Instances

Instances details

RealFrac CDouble |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods properFraction :: Integral b => CDouble -> (b, CDouble) Source # truncate :: Integral b => CDouble -> b Source # round :: Integral b => CDouble -> b Source # ceiling :: Integral b => CDouble -> b Source # floor :: Integral b => CDouble -> b Source #
RealFrac CFloat |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods properFraction :: Integral b => CFloat -> (b, CFloat) Source # truncate :: Integral b => CFloat -> b Source # round :: Integral b => CFloat -> b Source # ceiling :: Integral b => CFloat -> b Source # floor :: Integral b => CFloat -> b Source #
RealFrac Scientific |
Instance details Defined in Data.Scientific Methods properFraction :: Integral b => Scientific -> (b, Scientific) Source # truncate :: Integral b => Scientific -> b Source # round :: Integral b => Scientific -> b Source # ceiling :: Integral b => Scientific -> b Source # floor :: Integral b => Scientific -> b Source #
RealFrac DiffTime |
Instance details Defined in Data.Time.Clock.Internal.DiffTime Methods properFraction :: Integral b => DiffTime -> (b, DiffTime) Source # truncate :: Integral b => DiffTime -> b Source # round :: Integral b => DiffTime -> b Source # ceiling :: Integral b => DiffTime -> b Source # floor :: Integral b => DiffTime -> b Source #
RealFrac NominalDiffTime |
Instance details Defined in Data.Time.Clock.Internal.NominalDiffTime Methods properFraction :: Integral b => NominalDiffTime -> (b, NominalDiffTime) Source # truncate :: Integral b => NominalDiffTime -> b Source # round :: Integral b => NominalDiffTime -> b Source # ceiling :: Integral b => NominalDiffTime -> b Source # floor :: Integral b => NominalDiffTime -> b Source #

RealFrac Double

Beware that results for non-finite arguments are garbage:

    >>> [ f x | f <- [round, floor, ceiling], x <- [-1/0, 0/0, 1/0] ] :: [Int]
    [0,0,0,0,0,0,0,0,0]
    >>> map properFraction [-1/0, 0/0, 1/0] :: [(Int, Double)]
    [(0,0.0),(0,0.0),(0,0.0)]

and get even more non-sensical if you ask for `Integer` instead of `Int`.

Since: base-2.1

Instance details Defined in GHC.Internal.Float Methods properFraction :: Integral b => Double -> (b, Double) Source # truncate :: Integral b => Double -> b Source # round :: Integral b => Double -> b Source # ceiling :: Integral b => Double -> b Source # floor :: Integral b => Double -> b Source #

RealFrac Float

Beware that results for non-finite arguments are garbage:

    >>> [ f x | f <- [round, floor, ceiling], x <- [-1/0, 0/0, 1/0 :: Float] ] :: [Int]
    [0,0,0,0,0,0,0,0,0]
    >>> map properFraction [-1/0, 0/0, 1/0] :: [(Int, Float)]
    [(0,0.0),(0,0.0),(0,0.0)]

and get even more non-sensical if you ask for `Integer` instead of `Int`.

Since: base-2.1

Instance details Defined in GHC.Internal.Float Methods properFraction :: Integral b => Float -> (b, Float) Source # truncate :: Integral b => Float -> b Source # round :: Integral b => Float -> b Source # ceiling :: Integral b => Float -> b Source # floor :: Integral b => Float -> b Source #
RealFrac a => RealFrac (Identity a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Functor.Identity Methods properFraction :: Integral b => Identity a -> (b, Identity a) Source # truncate :: Integral b => Identity a -> b Source # round :: Integral b => Identity a -> b Source # ceiling :: Integral b => Identity a -> b Source # floor :: Integral b => Identity a -> b Source #
RealFrac a => RealFrac (Down a) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Data.Ord Methods properFraction :: Integral b => Down a -> (b, Down a) Source # truncate :: Integral b => Down a -> b Source # round :: Integral b => Down a -> b Source # ceiling :: Integral b => Down a -> b Source # floor :: Integral b => Down a -> b Source #
Integral a => RealFrac (Ratio a) | Since: base-2.0.1
Instance details Defined in GHC.Internal.Real Methods properFraction :: Integral b => Ratio a -> (b, Ratio a) Source # truncate :: Integral b => Ratio a -> b Source # round :: Integral b => Ratio a -> b Source # ceiling :: Integral b => Ratio a -> b Source # floor :: Integral b => Ratio a -> b Source #
HasResolution a => RealFrac (Fixed a) | Since: base-2.1
Instance details Defined in Data.Fixed Methods properFraction :: Integral b => Fixed a -> (b, Fixed a) Source # truncate :: Integral b => Fixed a -> b Source # round :: Integral b => Fixed a -> b Source # ceiling :: Integral b => Fixed a -> b Source # floor :: Integral b => Fixed a -> b Source #
RealFrac a => RealFrac (Const a b) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Functor.Const Methods properFraction :: Integral b0 => Const a b -> (b0, Const a b) Source # truncate :: Integral b0 => Const a b -> b0 Source # round :: Integral b0 => Const a b -> b0 Source # ceiling :: Integral b0 => Const a b -> b0 Source # floor :: Integral b0 => Const a b -> b0 Source #
RealFrac a => RealFrac (Tagged s a) |
Instance details Defined in Data.Tagged Methods properFraction :: Integral b => Tagged s a -> (b, Tagged s a) Source # truncate :: Integral b => Tagged s a -> b Source # round :: Integral b => Tagged s a -> b Source # ceiling :: Integral b => Tagged s a -> b Source # floor :: Integral b => Tagged s a -> b Source #
RealFrac (f (g a)) => RealFrac (Compose f g a) | Since: base-4.20.0.0
Instance details Defined in Data.Functor.Compose Methods properFraction :: Integral b => Compose f g a -> (b, Compose f g a) Source # truncate :: Integral b => Compose f g a -> b Source # round :: Integral b => Compose f g a -> b Source # ceiling :: Integral b => Compose f g a -> b Source # floor :: Integral b => Compose f g a -> b Source #

class (Real a, Enum a) => Integral a where Source #

Integral numbers, supporting integer division.

The Haskell Report defines no laws for `Integral`. However, `Integral` instances are customarily expected to define a Euclidean domain and have the following properties for the `div`/`mod` and `quot`/`rem` pairs, given suitable Euclidean functions `f` and `g`:

- `x` = `y * quot x y + rem x y` with `rem x y` = `fromInteger 0` or `g (rem x y)` < `g y`
- `x` = `y * div x y + mod x y` with `mod x y` = `fromInteger 0` or `f (mod x y)` < `f y`

An example of a suitable Euclidean function, for `Integer`'s instance, is `abs`.

In addition, `toInteger` should be total, and `fromInteger` should be a left inverse for it, i.e. `fromInteger (toInteger i) = i`.

Minimal complete definition

quotRem, toInteger

Methods

quot :: a -> a -> a infixl 7 Source #

Integer division truncated toward zero.

WARNING: This function is partial (because it throws when 0 is passed as the divisor) for all the integer types in `base`.

rem :: a -> a -> a infixl 7 Source #

Integer remainder, satisfying

    (x `quot` y)*y + (x `rem` y) == x

WARNING: This function is partial (because it throws when 0 is passed as the divisor) for all the integer types in `base`.

div :: a -> a -> a infixl 7 Source #

Integer division truncated toward negative infinity.

WARNING: This function is partial (because it throws when 0 is passed as the divisor) for all the integer types in `base`.

mod :: a -> a -> a infixl 7 Source #

Integer modulus, satisfying

    (x `div` y)*y + (x `mod` y) == x

WARNING: This function is partial (because it throws when 0 is passed as the divisor) for all the integer types in `base`.

quotRem :: a -> a -> (a, a) Source #

Simultaneous `quot` and `rem`.

WARNING: This function is partial (because it throws when 0 is passed as the divisor) for all the integer types in `base`.

divMod :: a -> a -> (a, a) Source #

simultaneous `div` and `mod`.

WARNING: This function is partial (because it throws when 0 is passed as the divisor) for all the integer types in `base`.

toInteger :: a -> Integer Source #

Conversion to `Integer`.

#### Instances

Instances details

Integral CBool |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods quot :: CBool -> CBool -> CBool Source # rem :: CBool -> CBool -> CBool Source # div :: CBool -> CBool -> CBool Source # mod :: CBool -> CBool -> CBool Source # quotRem :: CBool -> CBool -> (CBool, CBool) Source # divMod :: CBool -> CBool -> (CBool, CBool) Source # toInteger :: CBool -> Integer Source #
Integral CChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods quot :: CChar -> CChar -> CChar Source # rem :: CChar -> CChar -> CChar Source # div :: CChar -> CChar -> CChar Source # mod :: CChar -> CChar -> CChar Source # quotRem :: CChar -> CChar -> (CChar, CChar) Source # divMod :: CChar -> CChar -> (CChar, CChar) Source # toInteger :: CChar -> Integer Source #
Integral CInt |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods quot :: CInt -> CInt -> CInt Source # rem :: CInt -> CInt -> CInt Source # div :: CInt -> CInt -> CInt Source # mod :: CInt -> CInt -> CInt Source # quotRem :: CInt -> CInt -> (CInt, CInt) Source # divMod :: CInt -> CInt -> (CInt, CInt) Source # toInteger :: CInt -> Integer Source #
Integral CIntMax |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

quot :: CIntMax -> CIntMax -> CIntMax Source #

rem :: CIntMax -> CIntMax -> CIntMax Source #

div :: CIntMax -> CIntMax -> CIntMax Source #

mod :: CIntMax -> CIntMax -> CIntMax Source #

quotRem :: CIntMax -> CIntMax -> (CIntMax, CIntMax) Source #

divMod :: CIntMax -> CIntMax -> (CIntMax, CIntMax) Source #

toInteger :: CIntMax -> Integer Source #

Integral CIntPtr |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

quot :: CIntPtr -> CIntPtr -> CIntPtr Source #

rem :: CIntPtr -> CIntPtr -> CIntPtr Source #

div :: CIntPtr -> CIntPtr -> CIntPtr Source #

mod :: CIntPtr -> CIntPtr -> CIntPtr Source #

quotRem :: CIntPtr -> CIntPtr -> (CIntPtr, CIntPtr) Source #

divMod :: CIntPtr -> CIntPtr -> (CIntPtr, CIntPtr) Source #

toInteger :: CIntPtr -> Integer Source #

Integral CLLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods quot :: CLLong -> CLLong -> CLLong Source # rem :: CLLong -> CLLong -> CLLong Source # div :: CLLong -> CLLong -> CLLong Source # mod :: CLLong -> CLLong -> CLLong Source # quotRem :: CLLong -> CLLong -> (CLLong, CLLong) Source # divMod :: CLLong -> CLLong -> (CLLong, CLLong) Source # toInteger :: CLLong -> Integer Source #
Integral CLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods quot :: CLong -> CLong -> CLong Source # rem :: CLong -> CLong -> CLong Source # div :: CLong -> CLong -> CLong Source # mod :: CLong -> CLong -> CLong Source # quotRem :: CLong -> CLong -> (CLong, CLong) Source # divMod :: CLong -> CLong -> (CLong, CLong) Source # toInteger :: CLong -> Integer Source #
Integral CPtrdiff |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

quot :: CPtrdiff -> CPtrdiff -> CPtrdiff Source #

rem :: CPtrdiff -> CPtrdiff -> CPtrdiff Source #

div :: CPtrdiff -> CPtrdiff -> CPtrdiff Source #

mod :: CPtrdiff -> CPtrdiff -> CPtrdiff Source #

quotRem :: CPtrdiff -> CPtrdiff -> (CPtrdiff, CPtrdiff) Source #

divMod :: CPtrdiff -> CPtrdiff -> (CPtrdiff, CPtrdiff) Source #

toInteger :: CPtrdiff -> Integer Source #

Integral CSChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods quot :: CSChar -> CSChar -> CSChar Source # rem :: CSChar -> CSChar -> CSChar Source # div :: CSChar -> CSChar -> CSChar Source # mod :: CSChar -> CSChar -> CSChar Source # quotRem :: CSChar -> CSChar -> (CSChar, CSChar) Source # divMod :: CSChar -> CSChar -> (CSChar, CSChar) Source # toInteger :: CSChar -> Integer Source #
Integral CShort |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods quot :: CShort -> CShort -> CShort Source # rem :: CShort -> CShort -> CShort Source # div :: CShort -> CShort -> CShort Source # mod :: CShort -> CShort -> CShort Source # quotRem :: CShort -> CShort -> (CShort, CShort) Source # divMod :: CShort -> CShort -> (CShort, CShort) Source # toInteger :: CShort -> Integer Source #
Integral CSigAtomic |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

quot :: CSigAtomic -> CSigAtomic -> CSigAtomic Source #

rem :: CSigAtomic -> CSigAtomic -> CSigAtomic Source #

div :: CSigAtomic -> CSigAtomic -> CSigAtomic Source #

mod :: CSigAtomic -> CSigAtomic -> CSigAtomic Source #

quotRem :: CSigAtomic -> CSigAtomic -> (CSigAtomic, CSigAtomic) Source #

divMod :: CSigAtomic -> CSigAtomic -> (CSigAtomic, CSigAtomic) Source #

toInteger :: CSigAtomic -> Integer Source #

Integral CSize |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods quot :: CSize -> CSize -> CSize Source # rem :: CSize -> CSize -> CSize Source # div :: CSize -> CSize -> CSize Source # mod :: CSize -> CSize -> CSize Source # quotRem :: CSize -> CSize -> (CSize, CSize) Source # divMod :: CSize -> CSize -> (CSize, CSize) Source # toInteger :: CSize -> Integer Source #
Integral CUChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods quot :: CUChar -> CUChar -> CUChar Source # rem :: CUChar -> CUChar -> CUChar Source # div :: CUChar -> CUChar -> CUChar Source # mod :: CUChar -> CUChar -> CUChar Source # quotRem :: CUChar -> CUChar -> (CUChar, CUChar) Source # divMod :: CUChar -> CUChar -> (CUChar, CUChar) Source # toInteger :: CUChar -> Integer Source #
Integral CUInt |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods quot :: CUInt -> CUInt -> CUInt Source # rem :: CUInt -> CUInt -> CUInt Source # div :: CUInt -> CUInt -> CUInt Source # mod :: CUInt -> CUInt -> CUInt Source # quotRem :: CUInt -> CUInt -> (CUInt, CUInt) Source # divMod :: CUInt -> CUInt -> (CUInt, CUInt) Source # toInteger :: CUInt -> Integer Source #
Integral CUIntMax |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

quot :: CUIntMax -> CUIntMax -> CUIntMax Source #

rem :: CUIntMax -> CUIntMax -> CUIntMax Source #

div :: CUIntMax -> CUIntMax -> CUIntMax Source #

mod :: CUIntMax -> CUIntMax -> CUIntMax Source #

quotRem :: CUIntMax -> CUIntMax -> (CUIntMax, CUIntMax) Source #

divMod :: CUIntMax -> CUIntMax -> (CUIntMax, CUIntMax) Source #

toInteger :: CUIntMax -> Integer Source #

Integral CUIntPtr |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

quot :: CUIntPtr -> CUIntPtr -> CUIntPtr Source #

rem :: CUIntPtr -> CUIntPtr -> CUIntPtr Source #

div :: CUIntPtr -> CUIntPtr -> CUIntPtr Source #

mod :: CUIntPtr -> CUIntPtr -> CUIntPtr Source #

quotRem :: CUIntPtr -> CUIntPtr -> (CUIntPtr, CUIntPtr) Source #

divMod :: CUIntPtr -> CUIntPtr -> (CUIntPtr, CUIntPtr) Source #

toInteger :: CUIntPtr -> Integer Source #

Integral CULLong |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

quot :: CULLong -> CULLong -> CULLong Source #

rem :: CULLong -> CULLong -> CULLong Source #

div :: CULLong -> CULLong -> CULLong Source #

mod :: CULLong -> CULLong -> CULLong Source #

quotRem :: CULLong -> CULLong -> (CULLong, CULLong) Source #

divMod :: CULLong -> CULLong -> (CULLong, CULLong) Source #

toInteger :: CULLong -> Integer Source #

Integral CULong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods quot :: CULong -> CULong -> CULong Source # rem :: CULong -> CULong -> CULong Source # div :: CULong -> CULong -> CULong Source # mod :: CULong -> CULong -> CULong Source # quotRem :: CULong -> CULong -> (CULong, CULong) Source # divMod :: CULong -> CULong -> (CULong, CULong) Source # toInteger :: CULong -> Integer Source #
Integral CUShort |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

quot :: CUShort -> CUShort -> CUShort Source #

rem :: CUShort -> CUShort -> CUShort Source #

div :: CUShort -> CUShort -> CUShort Source #

mod :: CUShort -> CUShort -> CUShort Source #

quotRem :: CUShort -> CUShort -> (CUShort, CUShort) Source #

divMod :: CUShort -> CUShort -> (CUShort, CUShort) Source #

toInteger :: CUShort -> Integer Source #

Integral CWchar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods quot :: CWchar -> CWchar -> CWchar Source # rem :: CWchar -> CWchar -> CWchar Source # div :: CWchar -> CWchar -> CWchar Source # mod :: CWchar -> CWchar -> CWchar Source # quotRem :: CWchar -> CWchar -> (CWchar, CWchar) Source # divMod :: CWchar -> CWchar -> (CWchar, CWchar) Source # toInteger :: CWchar -> Integer Source #
Integral Int16 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods quot :: Int16 -> Int16 -> Int16 Source # rem :: Int16 -> Int16 -> Int16 Source # div :: Int16 -> Int16 -> Int16 Source # mod :: Int16 -> Int16 -> Int16 Source # quotRem :: Int16 -> Int16 -> (Int16, Int16) Source # divMod :: Int16 -> Int16 -> (Int16, Int16) Source # toInteger :: Int16 -> Integer Source #
Integral Int32 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods quot :: Int32 -> Int32 -> Int32 Source # rem :: Int32 -> Int32 -> Int32 Source # div :: Int32 -> Int32 -> Int32 Source # mod :: Int32 -> Int32 -> Int32 Source # quotRem :: Int32 -> Int32 -> (Int32, Int32) Source # divMod :: Int32 -> Int32 -> (Int32, Int32) Source # toInteger :: Int32 -> Integer Source #
Integral Int64 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods quot :: Int64 -> Int64 -> Int64 Source # rem :: Int64 -> Int64 -> Int64 Source # div :: Int64 -> Int64 -> Int64 Source # mod :: Int64 -> Int64 -> Int64 Source # quotRem :: Int64 -> Int64 -> (Int64, Int64) Source # divMod :: Int64 -> Int64 -> (Int64, Int64) Source # toInteger :: Int64 -> Integer Source #
Integral Int8 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods quot :: Int8 -> Int8 -> Int8 Source # rem :: Int8 -> Int8 -> Int8 Source # div :: Int8 -> Int8 -> Int8 Source # mod :: Int8 -> Int8 -> Int8 Source # quotRem :: Int8 -> Int8 -> (Int8, Int8) Source # divMod :: Int8 -> Int8 -> (Int8, Int8) Source # toInteger :: Int8 -> Integer Source #
Integral Word16 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods quot :: Word16 -> Word16 -> Word16 Source # rem :: Word16 -> Word16 -> Word16 Source # div :: Word16 -> Word16 -> Word16 Source # mod :: Word16 -> Word16 -> Word16 Source # quotRem :: Word16 -> Word16 -> (Word16, Word16) Source # divMod :: Word16 -> Word16 -> (Word16, Word16) Source # toInteger :: Word16 -> Integer Source #
Integral Word32 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods quot :: Word32 -> Word32 -> Word32 Source # rem :: Word32 -> Word32 -> Word32 Source # div :: Word32 -> Word32 -> Word32 Source # mod :: Word32 -> Word32 -> Word32 Source # quotRem :: Word32 -> Word32 -> (Word32, Word32) Source # divMod :: Word32 -> Word32 -> (Word32, Word32) Source # toInteger :: Word32 -> Integer Source #
Integral Word64 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods quot :: Word64 -> Word64 -> Word64 Source # rem :: Word64 -> Word64 -> Word64 Source # div :: Word64 -> Word64 -> Word64 Source # mod :: Word64 -> Word64 -> Word64 Source # quotRem :: Word64 -> Word64 -> (Word64, Word64) Source # divMod :: Word64 -> Word64 -> (Word64, Word64) Source # toInteger :: Word64 -> Integer Source #
Integral Word8 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods quot :: Word8 -> Word8 -> Word8 Source # rem :: Word8 -> Word8 -> Word8 Source # div :: Word8 -> Word8 -> Word8 Source # mod :: Word8 -> Word8 -> Word8 Source # quotRem :: Word8 -> Word8 -> (Word8, Word8) Source # divMod :: Word8 -> Word8 -> (Word8, Word8) Source # toInteger :: Word8 -> Integer Source #
Integral I8 |
Instance details Defined in Data.Text.Foreign Methods quot :: I8 -> I8 -> I8 Source # rem :: I8 -> I8 -> I8 Source # div :: I8 -> I8 -> I8 Source # mod :: I8 -> I8 -> I8 Source # quotRem :: I8 -> I8 -> (I8, I8) Source # divMod :: I8 -> I8 -> (I8, I8) Source # toInteger :: I8 -> Integer Source #
Integral Integer | Since: base-2.0.1
Instance details Defined in GHC.Internal.Real Methods quot :: Integer -> Integer -> Integer Source # rem :: Integer -> Integer -> Integer Source # div :: Integer -> Integer -> Integer Source # mod :: Integer -> Integer -> Integer Source # quotRem :: Integer -> Integer -> (Integer, Integer) Source # divMod :: Integer -> Integer -> (Integer, Integer) Source # toInteger :: Integer -> Integer Source #
Integral Natural | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Real Methods quot :: Natural -> Natural -> Natural Source # rem :: Natural -> Natural -> Natural Source # div :: Natural -> Natural -> Natural Source # mod :: Natural -> Natural -> Natural Source # quotRem :: Natural -> Natural -> (Natural, Natural) Source # divMod :: Natural -> Natural -> (Natural, Natural) Source # toInteger :: Natural -> Integer Source #
Integral Int | Since: base-2.0.1
Instance details Defined in GHC.Internal.Real Methods quot :: Int -> Int -> Int Source # rem :: Int -> Int -> Int Source # div :: Int -> Int -> Int Source # mod :: Int -> Int -> Int Source # quotRem :: Int -> Int -> (Int, Int) Source # divMod :: Int -> Int -> (Int, Int) Source # toInteger :: Int -> Integer Source #
Integral Word | Since: base-2.1
Instance details Defined in GHC.Internal.Real Methods quot :: Word -> Word -> Word Source # rem :: Word -> Word -> Word Source # div :: Word -> Word -> Word Source # mod :: Word -> Word -> Word Source # quotRem :: Word -> Word -> (Word, Word) Source # divMod :: Word -> Word -> (Word, Word) Source # toInteger :: Word -> Integer Source #
Integral a => Integral (Blind a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

quot :: Blind a -> Blind a -> Blind a Source #

rem :: Blind a -> Blind a -> Blind a Source #

div :: Blind a -> Blind a -> Blind a Source #

mod :: Blind a -> Blind a -> Blind a Source #

quotRem :: Blind a -> Blind a -> (Blind a, Blind a) Source #

divMod :: Blind a -> Blind a -> (Blind a, Blind a) Source #

toInteger :: Blind a -> Integer Source #

Integral a => Integral (Fixed a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

quot :: Fixed a -> Fixed a -> Fixed a Source #

rem :: Fixed a -> Fixed a -> Fixed a Source #

div :: Fixed a -> Fixed a -> Fixed a Source #

mod :: Fixed a -> Fixed a -> Fixed a Source #

quotRem :: Fixed a -> Fixed a -> (Fixed a, Fixed a) Source #

divMod :: Fixed a -> Fixed a -> (Fixed a, Fixed a) Source #

toInteger :: Fixed a -> Integer Source #

Integral a => Integral (Large a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

quot :: Large a -> Large a -> Large a Source #

rem :: Large a -> Large a -> Large a Source #

div :: Large a -> Large a -> Large a Source #

mod :: Large a -> Large a -> Large a Source #

quotRem :: Large a -> Large a -> (Large a, Large a) Source #

divMod :: Large a -> Large a -> (Large a, Large a) Source #

toInteger :: Large a -> Integer Source #

Integral a => Integral (Shrink2 a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

quot :: Shrink2 a -> Shrink2 a -> Shrink2 a Source #

rem :: Shrink2 a -> Shrink2 a -> Shrink2 a Source #

div :: Shrink2 a -> Shrink2 a -> Shrink2 a Source #

mod :: Shrink2 a -> Shrink2 a -> Shrink2 a Source #

quotRem :: Shrink2 a -> Shrink2 a -> (Shrink2 a, Shrink2 a) Source #

divMod :: Shrink2 a -> Shrink2 a -> (Shrink2 a, Shrink2 a) Source #

toInteger :: Shrink2 a -> Integer Source #

Integral a => Integral (Small a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

quot :: Small a -> Small a -> Small a Source #

rem :: Small a -> Small a -> Small a Source #

div :: Small a -> Small a -> Small a Source #

mod :: Small a -> Small a -> Small a Source #

quotRem :: Small a -> Small a -> (Small a, Small a) Source #

divMod :: Small a -> Small a -> (Small a, Small a) Source #

toInteger :: Small a -> Integer Source #

Integral n => Integral (VarInt n) |

Instance details

Defined in Data.Bytes.VarInt

Methods

quot :: VarInt n -> VarInt n -> VarInt n Source #

rem :: VarInt n -> VarInt n -> VarInt n Source #

div :: VarInt n -> VarInt n -> VarInt n Source #

mod :: VarInt n -> VarInt n -> VarInt n Source #

quotRem :: VarInt n -> VarInt n -> (VarInt n, VarInt n) Source #

divMod :: VarInt n -> VarInt n -> (VarInt n, VarInt n) Source #

toInteger :: VarInt n -> Integer Source #

Integral a => Integral (Identity a) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Identity

Methods

quot :: Identity a -> Identity a -> Identity a Source #

rem :: Identity a -> Identity a -> Identity a Source #

div :: Identity a -> Identity a -> Identity a Source #

mod :: Identity a -> Identity a -> Identity a Source #

quotRem :: Identity a -> Identity a -> (Identity a, Identity a) Source #

divMod :: Identity a -> Identity a -> (Identity a, Identity a) Source #

toInteger :: Identity a -> Integer Source #

Integral a => Integral (Const a b) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

quot :: Const a b -> Const a b -> Const a b Source #

rem :: Const a b -> Const a b -> Const a b Source #

div :: Const a b -> Const a b -> Const a b Source #

mod :: Const a b -> Const a b -> Const a b Source #

quotRem :: Const a b -> Const a b -> (Const a b, Const a b) Source #

divMod :: Const a b -> Const a b -> (Const a b, Const a b) Source #

toInteger :: Const a b -> Integer Source #

Integral a => Integral (Tagged s a) |

Instance details

Defined in Data.Tagged

Methods

quot :: Tagged s a -> Tagged s a -> Tagged s a Source #

rem :: Tagged s a -> Tagged s a -> Tagged s a Source #

div :: Tagged s a -> Tagged s a -> Tagged s a Source #

mod :: Tagged s a -> Tagged s a -> Tagged s a Source #

quotRem :: Tagged s a -> Tagged s a -> (Tagged s a, Tagged s a) Source #

divMod :: Tagged s a -> Tagged s a -> (Tagged s a, Tagged s a) Source #

toInteger :: Tagged s a -> Integer Source #

Integral (f (g a)) => Integral (Compose f g a) | Since: base-4.19.0.0

Instance details

Defined in Data.Functor.Compose

Methods

quot :: Compose f g a -> Compose f g a -> Compose f g a Source #

rem :: Compose f g a -> Compose f g a -> Compose f g a Source #

div :: Compose f g a -> Compose f g a -> Compose f g a Source #

mod :: Compose f g a -> Compose f g a -> Compose f g a Source #

quotRem :: Compose f g a -> Compose f g a -> (Compose f g a, Compose f g a) Source #

divMod :: Compose f g a -> Compose f g a -> (Compose f g a, Compose f g a) Source #

toInteger :: Compose f g a -> Integer Source #

class Read a where Source #

Parsing of `String`s, producing values.

Derived instances of `Read` make the following assumptions, which derived instances of `Show` obey:

- If the constructor is defined to be an infix operator, then the derived `Read` instance will parse only infix applications of the constructor (not the prefix form).
- Associativity is not used to reduce the occurrence of parentheses, although precedence may be.
- If the constructor is defined using record syntax, the derived `Read` will parse only the record-syntax form, and furthermore, the fields must be given in the same order as the original declaration.
- The derived `Read` instance allows arbitrary Haskell whitespace between tokens of the input string. Extra parentheses are also allowed.

For example, given the declarations

    infixr 5 :^:
    data Tree a =  Leaf a  |  Tree a :^: Tree a

the derived instance of `Read` in Haskell 2010 is equivalent to

    instance (Read a) => Read (Tree a) where

            readsPrec d r =  readParen (d > app_prec)
                             (\r -> [(Leaf m,t) |
                                     ("Leaf",s) <- lex r,
                                     (m,t) <- readsPrec (app_prec+1) s]) r

                          ++ readParen (d > up_prec)
                             (\r -> [(u:^:v,w) |
                                     (u,s) <- readsPrec (up_prec+1) r,
                                     (":^:",t) <- lex s,
                                     (v,w) <- readsPrec (up_prec+1) t]) r

              where app_prec = 10
                    up_prec = 5

Note that right-associativity of `:^:` is unused.

The derived instance in GHC is equivalent to

    instance (Read a) => Read (Tree a) where

            readPrec = parens $ (prec app_prec $ do
                                     Ident "Leaf" <- lexP
                                     m <- step readPrec
                                     return (Leaf m))

                         +++ (prec up_prec $ do
                                     u <- step readPrec
                                     Symbol ":^:" <- lexP
                                     v <- step readPrec
                                     return (u :^: v))

              where app_prec = 10
                    up_prec = 5

            readListPrec = readListPrecDefault

Why do both `readsPrec` and `readPrec` exist, and why does GHC opt to implement `readPrec` in derived `Read` instances instead of `readsPrec`? The reason is that `readsPrec` is based on the `ReadS` type, and although `ReadS` is mentioned in the Haskell 2010 Report, it is not a very efficient parser data structure.

`readPrec`, on the other hand, is based on a much more efficient `ReadPrec` datatype (a.k.a "new-style parsers"), but its definition relies on the use of the `RankNTypes` language extension. Therefore, `readPrec` (and its cousin, `readListPrec`) are marked as GHC-only. Nevertheless, it is recommended to use `readPrec` instead of `readsPrec` whenever possible for the efficiency improvements it brings.

As mentioned above, derived `Read` instances in GHC will implement `readPrec` instead of `readsPrec`. The default implementations of `readsPrec` (and its cousin, `readList`) will simply use `readPrec` under the hood. If you are writing a `Read` instance by hand, it is recommended to write it like so:

    instance Read T where
      readPrec     = ...
      readListPrec = readListPrecDefault

Minimal complete definition

readsPrec | readPrec

Methods

readsPrec Source #

Arguments

:: Int | the operator precedence of the enclosing context (a number from `0` to `11`). Function application has precedence `10`.
-> ReadS a |

attempts to parse a value from the front of the string, returning a list of (parsed value, remaining string) pairs. If there is no successful parse, the returned list is empty.

Derived instances of `Read` and `Show` satisfy the following:

- `(x,"")` is an element of `(`readsPrec` d (`showsPrec` d x ""))`.

That is, `readsPrec` parses the string produced by `showsPrec`, and delivers the value that `showsPrec` started with.

readList :: ReadS [a] Source #

The method `readList` is provided to allow the programmer to give a specialised way of parsing lists of values. For example, this is used by the predefined `Read` instance of the `Char` type, where values of type `String` are expected to use double quotes, rather than square brackets.

#### Instances

Instances details

Read AimModeCmd Source # |
Instance details Defined in Game.LambdaHack.Client.UI.HumanCmd Methods readsPrec :: Int -> ReadS AimModeCmd Source # readList :: ReadS [AimModeCmd] Source # readPrec :: ReadPrec AimModeCmd Source # readListPrec :: ReadPrec [AimModeCmd] Source #
Read CmdArea Source # |
Instance details Defined in Game.LambdaHack.Client.UI.HumanCmd Methods readsPrec :: Int -> ReadS CmdArea Source # readList :: ReadS [CmdArea] Source # readPrec :: ReadPrec CmdArea Source # readListPrec :: ReadPrec [CmdArea] Source #
Read CmdCategory Source # |
Instance details Defined in Game.LambdaHack.Client.UI.HumanCmd Methods readsPrec :: Int -> ReadS CmdCategory Source # readList :: ReadS [CmdCategory] Source # readPrec :: ReadPrec CmdCategory Source # readListPrec :: ReadPrec [CmdCategory] Source #
Read HumanCmd Source # |
Instance details Defined in Game.LambdaHack.Client.UI.HumanCmd Methods readsPrec :: Int -> ReadS HumanCmd Source # readList :: ReadS [HumanCmd] Source # readPrec :: ReadPrec HumanCmd Source # readListPrec :: ReadPrec [HumanCmd] Source #
Read TriggerItem Source # |
Instance details Defined in Game.LambdaHack.Client.UI.HumanCmd Methods readsPrec :: Int -> ReadS TriggerItem Source # readList :: ReadS [TriggerItem] Source # readPrec :: ReadPrec TriggerItem Source # readListPrec :: ReadPrec [TriggerItem] Source #
Read FullscreenMode Source # |
Instance details Defined in Game.LambdaHack.Common.ClientOptions Methods readsPrec :: Int -> ReadS FullscreenMode Source # readList :: ReadS [FullscreenMode] Source # readPrec :: ReadPrec FullscreenMode Source # readListPrec :: ReadPrec [FullscreenMode] Source #
Read FontDefinition Source # |
Instance details Defined in Game.LambdaHack.Common.Misc Methods readsPrec :: Int -> ReadS FontDefinition Source # readList :: ReadS [FontDefinition] Source # readPrec :: ReadPrec FontDefinition Source # readListPrec :: ReadPrec [FontDefinition] Source #
Read FontSet Source # |
Instance details Defined in Game.LambdaHack.Common.Misc Methods readsPrec :: Int -> ReadS FontSet Source # readList :: ReadS [FontSet] Source # readPrec :: ReadPrec FontSet Source # readListPrec :: ReadPrec [FontSet] Source #
Read HintingMode Source # |
Instance details Defined in Game.LambdaHack.Common.Misc Methods readsPrec :: Int -> ReadS HintingMode Source # readList :: ReadS [HintingMode] Source # readPrec :: ReadPrec HintingMode Source # readListPrec :: ReadPrec [HintingMode] Source #
Read Vector Source # |
Instance details Defined in Game.LambdaHack.Common.Vector Methods readsPrec :: Int -> ReadS Vector Source # readList :: ReadS [Vector] Source # readPrec :: ReadPrec Vector Source # readListPrec :: ReadPrec [Vector] Source #
Read Color Source # |
Instance details Defined in Game.LambdaHack.Definition.Color Methods readsPrec :: Int -> ReadS Color Source # readList :: ReadS [Color] Source # readPrec :: ReadPrec Color Source # readListPrec :: ReadPrec [Color] Source #
Read CStore Source # |
Instance details Defined in Game.LambdaHack.Definition.Defs Methods readsPrec :: Int -> ReadS CStore Source # readList :: ReadS [CStore] Source # readPrec :: ReadPrec CStore Source # readListPrec :: ReadPrec [CStore] Source #
Read Direction Source # |
Instance details Defined in Game.LambdaHack.Definition.Defs Methods readsPrec :: Int -> ReadS Direction Source # readList :: ReadS [Direction] Source # readPrec :: ReadPrec Direction Source # readListPrec :: ReadPrec [Direction] Source #
Read ItemDialogMode Source # |
Instance details Defined in Game.LambdaHack.Definition.Defs Methods readsPrec :: Int -> ReadS ItemDialogMode Source # readList :: ReadS [ItemDialogMode] Source # readPrec :: ReadPrec ItemDialogMode Source # readListPrec :: ReadPrec [ItemDialogMode] Source #
Read SLore Source # |
Instance details Defined in Game.LambdaHack.Definition.Defs Methods readsPrec :: Int -> ReadS SLore Source # readList :: ReadS [SLore] Source # readPrec :: ReadPrec SLore Source # readListPrec :: ReadPrec [SLore] Source #
Read ASCIIString |
Instance details Defined in Test.QuickCheck.Modifiers Methods readsPrec :: Int -> ReadS ASCIIString Source # readList :: ReadS [ASCIIString] Source # readPrec :: ReadPrec ASCIIString Source # readListPrec :: ReadPrec [ASCIIString] Source #
Read PrintableString |
Instance details Defined in Test.QuickCheck.Modifiers Methods readsPrec :: Int -> ReadS PrintableString Source # readList :: ReadS [PrintableString] Source # readPrec :: ReadPrec PrintableString Source # readListPrec :: ReadPrec [PrintableString] Source #
Read UnicodeString |
Instance details Defined in Test.QuickCheck.Modifiers Methods readsPrec :: Int -> ReadS UnicodeString Source # readList :: ReadS [UnicodeString] Source # readPrec :: ReadPrec UnicodeString Source # readListPrec :: ReadPrec [UnicodeString] Source #
Read QCGen |
Instance details Defined in Test.QuickCheck.Random Methods readsPrec :: Int -> ReadS QCGen Source # readList :: ReadS [QCGen] Source # readPrec :: ReadPrec QCGen Source # readListPrec :: ReadPrec [QCGen] Source #
Read Args |
Instance details Defined in Test.QuickCheck.Test Methods readsPrec :: Int -> ReadS Args Source # readList :: ReadS [Args] Source # readPrec :: ReadPrec Args Source # readListPrec :: ReadPrec [Args] Source #
Read DotNetTime |
Instance details Defined in Data.Aeson.Types.Internal Methods readsPrec :: Int -> ReadS DotNetTime Source # readList :: ReadS [DotNetTime] Source # readPrec :: ReadPrec DotNetTime Source # readListPrec :: ReadPrec [DotNetTime] Source #
Read Value |
Instance details Defined in Data.Aeson.Types.Internal Methods readsPrec :: Int -> ReadS Value Source # readList :: ReadS [Value] Source # readPrec :: ReadPrec Value Source # readListPrec :: ReadPrec [Value] Source #
Read BlinkSpeed |
Instance details Defined in System.Console.ANSI.Types Methods readsPrec :: Int -> ReadS BlinkSpeed Source # readList :: ReadS [BlinkSpeed] Source # readPrec :: ReadPrec BlinkSpeed Source # readListPrec :: ReadPrec [BlinkSpeed] Source #
Read Color |
Instance details Defined in System.Console.ANSI.Types Methods readsPrec :: Int -> ReadS Color Source # readList :: ReadS [Color] Source # readPrec :: ReadPrec Color Source # readListPrec :: ReadPrec [Color] Source #
Read ColorIntensity |
Instance details Defined in System.Console.ANSI.Types Methods readsPrec :: Int -> ReadS ColorIntensity Source # readList :: ReadS [ColorIntensity] Source # readPrec :: ReadPrec ColorIntensity Source # readListPrec :: ReadPrec [ColorIntensity] Source #
Read ConsoleIntensity |
Instance details Defined in System.Console.ANSI.Types Methods readsPrec :: Int -> ReadS ConsoleIntensity Source # readList :: ReadS [ConsoleIntensity] Source # readPrec :: ReadPrec ConsoleIntensity Source # readListPrec :: ReadPrec [ConsoleIntensity] Source #
Read ConsoleLayer |
Instance details Defined in System.Console.ANSI.Types Methods readsPrec :: Int -> ReadS ConsoleLayer Source # readList :: ReadS [ConsoleLayer] Source # readPrec :: ReadPrec ConsoleLayer Source # readListPrec :: ReadPrec [ConsoleLayer] Source #
Read SGR |
Instance details Defined in System.Console.ANSI.Types Methods readsPrec :: Int -> ReadS SGR Source # readList :: ReadS [SGR] Source # readPrec :: ReadPrec SGR Source # readListPrec :: ReadPrec [SGR] Source #
Read Underlining |
Instance details Defined in System.Console.ANSI.Types Methods readsPrec :: Int -> ReadS Underlining Source # readList :: ReadS [Underlining] Source # readPrec :: ReadPrec Underlining Source # readListPrec :: ReadPrec [Underlining] Source #
Read ByteString |
Instance details Defined in Data.ByteString.Internal.Type Methods readsPrec :: Int -> ReadS ByteString Source # readList :: ReadS [ByteString] Source # readPrec :: ReadPrec ByteString Source # readListPrec :: ReadPrec [ByteString] Source #
Read ByteString |
Instance details Defined in Data.ByteString.Lazy.Internal Methods readsPrec :: Int -> ReadS ByteString Source # readList :: ReadS [ByteString] Source # readPrec :: ReadPrec ByteString Source # readListPrec :: ReadPrec [ByteString] Source #
Read ShortByteString |
Instance details Defined in Data.ByteString.Short.Internal Methods readsPrec :: Int -> ReadS ShortByteString Source # readList :: ReadS [ShortByteString] Source # readPrec :: ReadPrec ShortByteString Source # readListPrec :: ReadPrec [ShortByteString] Source #
Read IntSet |
Instance details Defined in Data.IntSet.Internal Methods readsPrec :: Int -> ReadS IntSet Source # readList :: ReadS [IntSet] Source # readPrec :: ReadPrec IntSet Source # readListPrec :: ReadPrec [IntSet] Source #
Read Void | Reading a `Void` value is always a parse error, considering `Void` as a data type with no constructors. Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Void Source # readList :: ReadS [Void] Source # readPrec :: ReadPrec Void Source # readListPrec :: ReadPrec [Void] Source #
Read ByteOrder | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.ByteOrder Methods readsPrec :: Int -> ReadS ByteOrder Source # readList :: ReadS [ByteOrder] Source # readPrec :: ReadPrec ByteOrder Source # readListPrec :: ReadPrec [ByteOrder] Source #
Read All | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS All Source # readList :: ReadS [All] Source # readPrec :: ReadPrec All Source # readListPrec :: ReadPrec [All] Source #
Read Any | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS Any Source # readList :: ReadS [Any] Source # readPrec :: ReadPrec Any Source # readListPrec :: ReadPrec [Any] Source #
Read Version | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Version Methods readsPrec :: Int -> ReadS Version Source # readList :: ReadS [Version] Source # readPrec :: ReadPrec Version Source # readListPrec :: ReadPrec [Version] Source #
Read CBool |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CBool Source # readList :: ReadS [CBool] Source # readPrec :: ReadPrec CBool Source # readListPrec :: ReadPrec [CBool] Source #
Read CChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CChar Source # readList :: ReadS [CChar] Source # readPrec :: ReadPrec CChar Source # readListPrec :: ReadPrec [CChar] Source #
Read CClock |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CClock Source # readList :: ReadS [CClock] Source # readPrec :: ReadPrec CClock Source # readListPrec :: ReadPrec [CClock] Source #
Read CDouble |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CDouble Source # readList :: ReadS [CDouble] Source # readPrec :: ReadPrec CDouble Source # readListPrec :: ReadPrec [CDouble] Source #
Read CFloat |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CFloat Source # readList :: ReadS [CFloat] Source # readPrec :: ReadPrec CFloat Source # readListPrec :: ReadPrec [CFloat] Source #
Read CInt |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CInt Source # readList :: ReadS [CInt] Source # readPrec :: ReadPrec CInt Source # readListPrec :: ReadPrec [CInt] Source #
Read CIntMax |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CIntMax Source # readList :: ReadS [CIntMax] Source # readPrec :: ReadPrec CIntMax Source # readListPrec :: ReadPrec [CIntMax] Source #
Read CIntPtr |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CIntPtr Source # readList :: ReadS [CIntPtr] Source # readPrec :: ReadPrec CIntPtr Source # readListPrec :: ReadPrec [CIntPtr] Source #
Read CLLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CLLong Source # readList :: ReadS [CLLong] Source # readPrec :: ReadPrec CLLong Source # readListPrec :: ReadPrec [CLLong] Source #
Read CLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CLong Source # readList :: ReadS [CLong] Source # readPrec :: ReadPrec CLong Source # readListPrec :: ReadPrec [CLong] Source #
Read CPtrdiff |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CPtrdiff Source # readList :: ReadS [CPtrdiff] Source # readPrec :: ReadPrec CPtrdiff Source # readListPrec :: ReadPrec [CPtrdiff] Source #
Read CSChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CSChar Source # readList :: ReadS [CSChar] Source # readPrec :: ReadPrec CSChar Source # readListPrec :: ReadPrec [CSChar] Source #
Read CSUSeconds |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CSUSeconds Source # readList :: ReadS [CSUSeconds] Source # readPrec :: ReadPrec CSUSeconds Source # readListPrec :: ReadPrec [CSUSeconds] Source #
Read CShort |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CShort Source # readList :: ReadS [CShort] Source # readPrec :: ReadPrec CShort Source # readListPrec :: ReadPrec [CShort] Source #
Read CSigAtomic |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CSigAtomic Source # readList :: ReadS [CSigAtomic] Source # readPrec :: ReadPrec CSigAtomic Source # readListPrec :: ReadPrec [CSigAtomic] Source #
Read CSize |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CSize Source # readList :: ReadS [CSize] Source # readPrec :: ReadPrec CSize Source # readListPrec :: ReadPrec [CSize] Source #
Read CTime |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CTime Source # readList :: ReadS [CTime] Source # readPrec :: ReadPrec CTime Source # readListPrec :: ReadPrec [CTime] Source #
Read CUChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CUChar Source # readList :: ReadS [CUChar] Source # readPrec :: ReadPrec CUChar Source # readListPrec :: ReadPrec [CUChar] Source #
Read CUInt |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CUInt Source # readList :: ReadS [CUInt] Source # readPrec :: ReadPrec CUInt Source # readListPrec :: ReadPrec [CUInt] Source #
Read CUIntMax |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CUIntMax Source # readList :: ReadS [CUIntMax] Source # readPrec :: ReadPrec CUIntMax Source # readListPrec :: ReadPrec [CUIntMax] Source #
Read CUIntPtr |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CUIntPtr Source # readList :: ReadS [CUIntPtr] Source # readPrec :: ReadPrec CUIntPtr Source # readListPrec :: ReadPrec [CUIntPtr] Source #
Read CULLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CULLong Source # readList :: ReadS [CULLong] Source # readPrec :: ReadPrec CULLong Source # readListPrec :: ReadPrec [CULLong] Source #
Read CULong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CULong Source # readList :: ReadS [CULong] Source # readPrec :: ReadPrec CULong Source # readListPrec :: ReadPrec [CULong] Source #
Read CUSeconds |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CUSeconds Source # readList :: ReadS [CUSeconds] Source # readPrec :: ReadPrec CUSeconds Source # readListPrec :: ReadPrec [CUSeconds] Source #
Read CUShort |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CUShort Source # readList :: ReadS [CUShort] Source # readPrec :: ReadPrec CUShort Source # readListPrec :: ReadPrec [CUShort] Source #
Read CWchar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods readsPrec :: Int -> ReadS CWchar Source # readList :: ReadS [CWchar] Source # readPrec :: ReadPrec CWchar Source # readListPrec :: ReadPrec [CWchar] Source #
Read Associativity | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Generics Methods readsPrec :: Int -> ReadS Associativity Source # readList :: ReadS [Associativity] Source # readPrec :: ReadPrec Associativity Source # readListPrec :: ReadPrec [Associativity] Source #
Read DecidedStrictness | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods readsPrec :: Int -> ReadS DecidedStrictness Source # readList :: ReadS [DecidedStrictness] Source # readPrec :: ReadPrec DecidedStrictness Source # readListPrec :: ReadPrec [DecidedStrictness] Source #
Read Fixity | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Generics Methods readsPrec :: Int -> ReadS Fixity Source # readList :: ReadS [Fixity] Source # readPrec :: ReadPrec Fixity Source # readListPrec :: ReadPrec [Fixity] Source #
Read SourceStrictness | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods readsPrec :: Int -> ReadS SourceStrictness Source # readList :: ReadS [SourceStrictness] Source # readPrec :: ReadPrec SourceStrictness Source # readListPrec :: ReadPrec [SourceStrictness] Source #
Read SourceUnpackedness | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods readsPrec :: Int -> ReadS SourceUnpackedness Source # readList :: ReadS [SourceUnpackedness] Source # readPrec :: ReadPrec SourceUnpackedness Source # readListPrec :: ReadPrec [SourceUnpackedness] Source #
Read ExitCode |
Instance details Defined in GHC.Internal.IO.Exception Methods readsPrec :: Int -> ReadS ExitCode Source # readList :: ReadS [ExitCode] Source # readPrec :: ReadPrec ExitCode Source # readListPrec :: ReadPrec [ExitCode] Source #
Read BufferMode | Since: base-4.2.0.0
Instance details Defined in GHC.Internal.IO.Handle.Types Methods readsPrec :: Int -> ReadS BufferMode Source # readList :: ReadS [BufferMode] Source # readPrec :: ReadPrec BufferMode Source # readListPrec :: ReadPrec [BufferMode] Source #
Read Newline | Since: base-4.3.0.0
Instance details Defined in GHC.Internal.IO.Handle.Types Methods readsPrec :: Int -> ReadS Newline Source # readList :: ReadS [Newline] Source # readPrec :: ReadPrec Newline Source # readListPrec :: ReadPrec [Newline] Source #
Read NewlineMode | Since: base-4.3.0.0
Instance details Defined in GHC.Internal.IO.Handle.Types Methods readsPrec :: Int -> ReadS NewlineMode Source # readList :: ReadS [NewlineMode] Source # readPrec :: ReadPrec NewlineMode Source # readListPrec :: ReadPrec [NewlineMode] Source #
Read IOMode | Since: base-4.2.0.0
Instance details Defined in GHC.Internal.IO.IOMode Methods readsPrec :: Int -> ReadS IOMode Source # readList :: ReadS [IOMode] Source # readPrec :: ReadPrec IOMode Source # readListPrec :: ReadPrec [IOMode] Source #
Read Int16 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods readsPrec :: Int -> ReadS Int16 Source # readList :: ReadS [Int16] Source # readPrec :: ReadPrec Int16 Source # readListPrec :: ReadPrec [Int16] Source #
Read Int32 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods readsPrec :: Int -> ReadS Int32 Source # readList :: ReadS [Int32] Source # readPrec :: ReadPrec Int32 Source # readListPrec :: ReadPrec [Int32] Source #
Read Int64 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods readsPrec :: Int -> ReadS Int64 Source # readList :: ReadS [Int64] Source # readPrec :: ReadPrec Int64 Source # readListPrec :: ReadPrec [Int64] Source #
Read Int8 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods readsPrec :: Int -> ReadS Int8 Source # readList :: ReadS [Int8] Source # readPrec :: ReadPrec Int8 Source # readListPrec :: ReadPrec [Int8] Source #
Read GCDetails | Since: base-4.10.0.0
Instance details Defined in GHC.Internal.Stats Methods readsPrec :: Int -> ReadS GCDetails Source # readList :: ReadS [GCDetails] Source # readPrec :: ReadPrec GCDetails Source # readListPrec :: ReadPrec [GCDetails] Source #
Read RTSStats | Since: base-4.10.0.0
Instance details Defined in GHC.Internal.Stats Methods readsPrec :: Int -> ReadS RTSStats Source # readList :: ReadS [RTSStats] Source # readPrec :: ReadPrec RTSStats Source # readListPrec :: ReadPrec [RTSStats] Source #
Read Lexeme | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Lexeme Source # readList :: ReadS [Lexeme] Source # readPrec :: ReadPrec Lexeme Source # readListPrec :: ReadPrec [Lexeme] Source #
Read SomeNat | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.TypeNats Methods readsPrec :: Int -> ReadS SomeNat Source # readList :: ReadS [SomeNat] Source # readPrec :: ReadPrec SomeNat Source # readListPrec :: ReadPrec [SomeNat] Source #
Read GeneralCategory | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS GeneralCategory Source # readList :: ReadS [GeneralCategory] Source # readPrec :: ReadPrec GeneralCategory Source # readListPrec :: ReadPrec [GeneralCategory] Source #
Read Word16 | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Word16 Source # readList :: ReadS [Word16] Source # readPrec :: ReadPrec Word16 Source # readListPrec :: ReadPrec [Word16] Source #
Read Word32 | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Word32 Source # readList :: ReadS [Word32] Source # readPrec :: ReadPrec Word32 Source # readListPrec :: ReadPrec [Word32] Source #
Read Word64 | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Word64 Source # readList :: ReadS [Word64] Source # readPrec :: ReadPrec Word64 Source # readListPrec :: ReadPrec [Word64] Source #
Read Word8 | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Word8 Source # readList :: ReadS [Word8] Source # readPrec :: ReadPrec Word8 Source # readListPrec :: ReadPrec [Word8] Source #
Read Ordering | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Ordering Source # readList :: ReadS [Ordering] Source # readPrec :: ReadPrec Ordering Source # readListPrec :: ReadPrec [Ordering] Source #
Read Part |
Instance details Defined in NLP.Miniutter.English Methods readsPrec :: Int -> ReadS Part Source # readList :: ReadS [Part] Source # readPrec :: ReadPrec Part Source # readListPrec :: ReadPrec [Part] Source #
Read Scientific |
Instance details Defined in Data.Scientific Methods readsPrec :: Int -> ReadS Scientific Source # readList :: ReadS [Scientific] Source # readPrec :: ReadPrec Scientific Source # readListPrec :: ReadPrec [Scientific] Source #
Read AudioDeviceStatus |
Instance details Defined in SDL.Audio Methods readsPrec :: Int -> ReadS AudioDeviceStatus Source # readList :: ReadS [AudioDeviceStatus] Source # readPrec :: ReadPrec AudioDeviceStatus Source # readListPrec :: ReadPrec [AudioDeviceStatus] Source #
Read AudioDeviceUsage |
Instance details Defined in SDL.Audio Methods readsPrec :: Int -> ReadS AudioDeviceUsage Source # readList :: ReadS [AudioDeviceUsage] Source # readPrec :: ReadPrec AudioDeviceUsage Source # readListPrec :: ReadPrec [AudioDeviceUsage] Source #
Read Channels |
Instance details Defined in SDL.Audio Methods readsPrec :: Int -> ReadS Channels Source # readList :: ReadS [Channels] Source # readPrec :: ReadPrec Channels Source # readListPrec :: ReadPrec [Channels] Source #
Read LockState |
Instance details Defined in SDL.Audio Methods readsPrec :: Int -> ReadS LockState Source # readList :: ReadS [LockState] Source # readPrec :: ReadPrec LockState Source # readListPrec :: ReadPrec [LockState] Source #
Read PlaybackState |
Instance details Defined in SDL.Audio Methods readsPrec :: Int -> ReadS PlaybackState Source # readList :: ReadS [PlaybackState] Source # readPrec :: ReadPrec PlaybackState Source # readListPrec :: ReadPrec [PlaybackState] Source #
Read EventPushResult |
Instance details Defined in SDL.Event Methods readsPrec :: Int -> ReadS EventPushResult Source # readList :: ReadS [EventPushResult] Source # readPrec :: ReadPrec EventPushResult Source # readListPrec :: ReadPrec [EventPushResult] Source #
Read InputMotion |
Instance details Defined in SDL.Event Methods readsPrec :: Int -> ReadS InputMotion Source # readList :: ReadS [InputMotion] Source # readPrec :: ReadPrec InputMotion Source # readListPrec :: ReadPrec [InputMotion] Source #
Read SDLException |
Instance details Defined in SDL.Exception Methods readsPrec :: Int -> ReadS SDLException Source # readList :: ReadS [SDLException] Source # readPrec :: ReadPrec SDLException Source # readListPrec :: ReadPrec [SDLException] Source #
Read AccelerometerJoystickOptions |
Instance details Defined in SDL.Hint Methods readsPrec :: Int -> ReadS AccelerometerJoystickOptions Source # readList :: ReadS [AccelerometerJoystickOptions] Source # readPrec :: ReadPrec AccelerometerJoystickOptions Source # readListPrec :: ReadPrec [AccelerometerJoystickOptions] Source #
Read FramebufferAccelerationOptions |
Instance details Defined in SDL.Hint Methods readsPrec :: Int -> ReadS FramebufferAccelerationOptions Source # readList :: ReadS [FramebufferAccelerationOptions] Source # readPrec :: ReadPrec FramebufferAccelerationOptions Source # readListPrec :: ReadPrec [FramebufferAccelerationOptions] Source #
Read HintPriority |
Instance details Defined in SDL.Hint Methods readsPrec :: Int -> ReadS HintPriority Source # readList :: ReadS [HintPriority] Source # readPrec :: ReadPrec HintPriority Source # readListPrec :: ReadPrec [HintPriority] Source #
Read MacCTRLClickOptions |
Instance details Defined in SDL.Hint Methods readsPrec :: Int -> ReadS MacCTRLClickOptions Source # readList :: ReadS [MacCTRLClickOptions] Source # readPrec :: ReadPrec MacCTRLClickOptions Source # readListPrec :: ReadPrec [MacCTRLClickOptions] Source #
Read MouseModeWarpOptions |
Instance details Defined in SDL.Hint Methods readsPrec :: Int -> ReadS MouseModeWarpOptions Source # readList :: ReadS [MouseModeWarpOptions] Source # readPrec :: ReadPrec MouseModeWarpOptions Source # readListPrec :: ReadPrec [MouseModeWarpOptions] Source #
Read RenderDrivers |
Instance details Defined in SDL.Hint Methods readsPrec :: Int -> ReadS RenderDrivers Source # readList :: ReadS [RenderDrivers] Source # readPrec :: ReadPrec RenderDrivers Source # readListPrec :: ReadPrec [RenderDrivers] Source #
Read RenderOpenGLShaderOptions |
Instance details Defined in SDL.Hint Methods readsPrec :: Int -> ReadS RenderOpenGLShaderOptions Source # readList :: ReadS [RenderOpenGLShaderOptions] Source # readPrec :: ReadPrec RenderOpenGLShaderOptions Source # readListPrec :: ReadPrec [RenderOpenGLShaderOptions] Source #
Read RenderScaleQuality |
Instance details Defined in SDL.Hint Methods readsPrec :: Int -> ReadS RenderScaleQuality Source # readList :: ReadS [RenderScaleQuality] Source # readPrec :: ReadPrec RenderScaleQuality Source # readListPrec :: ReadPrec [RenderScaleQuality] Source #
Read RenderVSyncOptions |
Instance details Defined in SDL.Hint Methods readsPrec :: Int -> ReadS RenderVSyncOptions Source # readList :: ReadS [RenderVSyncOptions] Source # readPrec :: ReadPrec RenderVSyncOptions Source # readListPrec :: ReadPrec [RenderVSyncOptions] Source #
Read VideoWinD3DCompilerOptions |
Instance details Defined in SDL.Hint Methods readsPrec :: Int -> ReadS VideoWinD3DCompilerOptions Source # readList :: ReadS [VideoWinD3DCompilerOptions] Source # readPrec :: ReadPrec VideoWinD3DCompilerOptions Source # readListPrec :: ReadPrec [VideoWinD3DCompilerOptions] Source #
Read InitFlag |
Instance details Defined in SDL.Init Methods readsPrec :: Int -> ReadS InitFlag Source # readList :: ReadS [InitFlag] Source # readPrec :: ReadPrec InitFlag Source # readListPrec :: ReadPrec [InitFlag] Source #
Read ControllerAxis |
Instance details Defined in SDL.Input.GameController Methods readsPrec :: Int -> ReadS ControllerAxis Source # readList :: ReadS [ControllerAxis] Source # readPrec :: ReadPrec ControllerAxis Source # readListPrec :: ReadPrec [ControllerAxis] Source #
Read ControllerButton |
Instance details Defined in SDL.Input.GameController Methods readsPrec :: Int -> ReadS ControllerButton Source # readList :: ReadS [ControllerButton] Source # readPrec :: ReadPrec ControllerButton Source # readListPrec :: ReadPrec [ControllerButton] Source #
Read ControllerButtonState |
Instance details Defined in SDL.Input.GameController Methods readsPrec :: Int -> ReadS ControllerButtonState Source # readList :: ReadS [ControllerButtonState] Source # readPrec :: ReadPrec ControllerButtonState Source # readListPrec :: ReadPrec [ControllerButtonState] Source #
Read ControllerDevice |
Instance details Defined in SDL.Input.GameController Methods readsPrec :: Int -> ReadS ControllerDevice Source # readList :: ReadS [ControllerDevice] Source # readPrec :: ReadPrec ControllerDevice Source # readListPrec :: ReadPrec [ControllerDevice] Source #
Read ControllerDeviceConnection |
Instance details Defined in SDL.Input.GameController Methods readsPrec :: Int -> ReadS ControllerDeviceConnection Source # readList :: ReadS [ControllerDeviceConnection] Source # readPrec :: ReadPrec ControllerDeviceConnection Source # readListPrec :: ReadPrec [ControllerDeviceConnection] Source #
Read JoyButtonState |
Instance details Defined in SDL.Input.Joystick Methods readsPrec :: Int -> ReadS JoyButtonState Source # readList :: ReadS [JoyButtonState] Source # readPrec :: ReadPrec JoyButtonState Source # readListPrec :: ReadPrec [JoyButtonState] Source #
Read JoyDeviceConnection |
Instance details Defined in SDL.Input.Joystick Methods readsPrec :: Int -> ReadS JoyDeviceConnection Source # readList :: ReadS [JoyDeviceConnection] Source # readPrec :: ReadPrec JoyDeviceConnection Source # readListPrec :: ReadPrec [JoyDeviceConnection] Source #
Read JoyHatPosition |
Instance details Defined in SDL.Input.Joystick Methods readsPrec :: Int -> ReadS JoyHatPosition Source # readList :: ReadS [JoyHatPosition] Source # readPrec :: ReadPrec JoyHatPosition Source # readListPrec :: ReadPrec [JoyHatPosition] Source #
Read JoystickDevice |
Instance details Defined in SDL.Input.Joystick Methods readsPrec :: Int -> ReadS JoystickDevice Source # readList :: ReadS [JoystickDevice] Source # readPrec :: ReadPrec JoystickDevice Source # readListPrec :: ReadPrec [JoystickDevice] Source #
Read KeyModifier |
Instance details Defined in SDL.Input.Keyboard Methods readsPrec :: Int -> ReadS KeyModifier Source # readList :: ReadS [KeyModifier] Source # readPrec :: ReadPrec KeyModifier Source # readListPrec :: ReadPrec [KeyModifier] Source #
Read Keysym |
Instance details Defined in SDL.Input.Keyboard Methods readsPrec :: Int -> ReadS Keysym Source # readList :: ReadS [Keysym] Source # readPrec :: ReadPrec Keysym Source # readListPrec :: ReadPrec [Keysym] Source #
Read Keycode |
Instance details Defined in SDL.Input.Keyboard.Codes Methods readsPrec :: Int -> ReadS Keycode Source # readList :: ReadS [Keycode] Source # readPrec :: ReadPrec Keycode Source # readListPrec :: ReadPrec [Keycode] Source #
Read Scancode |
Instance details Defined in SDL.Input.Keyboard.Codes Methods readsPrec :: Int -> ReadS Scancode Source # readList :: ReadS [Scancode] Source # readPrec :: ReadPrec Scancode Source # readListPrec :: ReadPrec [Scancode] Source #
Read LocationMode |
Instance details Defined in SDL.Input.Mouse Methods readsPrec :: Int -> ReadS LocationMode Source # readList :: ReadS [LocationMode] Source # readPrec :: ReadPrec LocationMode Source # readListPrec :: ReadPrec [LocationMode] Source #
Read ModalLocation |
Instance details Defined in SDL.Input.Mouse Methods readsPrec :: Int -> ReadS ModalLocation Source # readList :: ReadS [ModalLocation] Source # readPrec :: ReadPrec ModalLocation Source # readListPrec :: ReadPrec [ModalLocation] Source #
Read MouseButton |
Instance details Defined in SDL.Input.Mouse Methods readsPrec :: Int -> ReadS MouseButton Source # readList :: ReadS [MouseButton] Source # readPrec :: ReadPrec MouseButton Source # readListPrec :: ReadPrec [MouseButton] Source #
Read MouseDevice |
Instance details Defined in SDL.Input.Mouse Methods readsPrec :: Int -> ReadS MouseDevice Source # readList :: ReadS [MouseDevice] Source # readPrec :: ReadPrec MouseDevice Source # readListPrec :: ReadPrec [MouseDevice] Source #
Read MouseScrollDirection |
Instance details Defined in SDL.Input.Mouse Methods readsPrec :: Int -> ReadS MouseScrollDirection Source # readList :: ReadS [MouseScrollDirection] Source # readPrec :: ReadPrec MouseScrollDirection Source # readListPrec :: ReadPrec [MouseScrollDirection] Source #
Read BatteryState |
Instance details Defined in SDL.Power Methods readsPrec :: Int -> ReadS BatteryState Source # readList :: ReadS [BatteryState] Source # readPrec :: ReadPrec BatteryState Source # readListPrec :: ReadPrec [BatteryState] Source #
Read Charge |
Instance details Defined in SDL.Power Methods readsPrec :: Int -> ReadS Charge Source # readList :: ReadS [Charge] Source # readPrec :: ReadPrec Charge Source # readListPrec :: ReadPrec [Charge] Source #
Read PowerState |
Instance details Defined in SDL.Power Methods readsPrec :: Int -> ReadS PowerState Source # readList :: ReadS [PowerState] Source # readPrec :: ReadPrec PowerState Source # readListPrec :: ReadPrec [PowerState] Source #
Read RetriggerTimer |
Instance details Defined in SDL.Time Methods readsPrec :: Int -> ReadS RetriggerTimer Source # readList :: ReadS [RetriggerTimer] Source # readPrec :: ReadPrec RetriggerTimer Source # readListPrec :: ReadPrec [RetriggerTimer] Source #
Read Display |
Instance details Defined in SDL.Video Methods readsPrec :: Int -> ReadS Display Source # readList :: ReadS [Display] Source # readPrec :: ReadPrec Display Source # readListPrec :: ReadPrec [Display] Source #
Read DisplayMode |
Instance details Defined in SDL.Video Methods readsPrec :: Int -> ReadS DisplayMode Source # readList :: ReadS [DisplayMode] Source # readPrec :: ReadPrec DisplayMode Source # readListPrec :: ReadPrec [DisplayMode] Source #
Read MessageKind |
Instance details Defined in SDL.Video Methods readsPrec :: Int -> ReadS MessageKind Source # readList :: ReadS [MessageKind] Source # readPrec :: ReadPrec MessageKind Source # readListPrec :: ReadPrec [MessageKind] Source #
Read VideoDriver |
Instance details Defined in SDL.Video Methods readsPrec :: Int -> ReadS VideoDriver Source # readList :: ReadS [VideoDriver] Source # readPrec :: ReadPrec VideoDriver Source # readListPrec :: ReadPrec [VideoDriver] Source #
Read WindowConfig |
Instance details Defined in SDL.Video Methods readsPrec :: Int -> ReadS WindowConfig Source # readList :: ReadS [WindowConfig] Source # readPrec :: ReadPrec WindowConfig Source # readListPrec :: ReadPrec [WindowConfig] Source #
Read WindowGraphicsContext |
Instance details Defined in SDL.Video Methods readsPrec :: Int -> ReadS WindowGraphicsContext Source # readList :: ReadS [WindowGraphicsContext] Source # readPrec :: ReadPrec WindowGraphicsContext Source # readListPrec :: ReadPrec [WindowGraphicsContext] Source #
Read WindowMode |
Instance details Defined in SDL.Video Methods readsPrec :: Int -> ReadS WindowMode Source # readList :: ReadS [WindowMode] Source # readPrec :: ReadPrec WindowMode Source # readListPrec :: ReadPrec [WindowMode] Source #
Read WindowPosition |
Instance details Defined in SDL.Video Methods readsPrec :: Int -> ReadS WindowPosition Source # readList :: ReadS [WindowPosition] Source # readPrec :: ReadPrec WindowPosition Source # readListPrec :: ReadPrec [WindowPosition] Source #
Read Mode |
Instance details Defined in SDL.Video.OpenGL Methods readsPrec :: Int -> ReadS Mode Source # readList :: ReadS [Mode] Source # readPrec :: ReadPrec Mode Source # readListPrec :: ReadPrec [Mode] Source #
Read OpenGLConfig |
Instance details Defined in SDL.Video.OpenGL Methods readsPrec :: Int -> ReadS OpenGLConfig Source # readList :: ReadS [OpenGLConfig] Source # readPrec :: ReadPrec OpenGLConfig Source # readListPrec :: ReadPrec [OpenGLConfig] Source #
Read Profile |
Instance details Defined in SDL.Video.OpenGL Methods readsPrec :: Int -> ReadS Profile Source # readList :: ReadS [Profile] Source # readPrec :: ReadPrec Profile Source # readListPrec :: ReadPrec [Profile] Source #
Read SwapInterval |
Instance details Defined in SDL.Video.OpenGL Methods readsPrec :: Int -> ReadS SwapInterval Source # readList :: ReadS [SwapInterval] Source # readPrec :: ReadPrec SwapInterval Source # readListPrec :: ReadPrec [SwapInterval] Source #
Read BlendMode |
Instance details Defined in SDL.Video.Renderer Methods readsPrec :: Int -> ReadS BlendMode Source # readList :: ReadS [BlendMode] Source # readPrec :: ReadPrec BlendMode Source # readListPrec :: ReadPrec [BlendMode] Source #
Read PixelFormat |
Instance details Defined in SDL.Video.Renderer Methods readsPrec :: Int -> ReadS PixelFormat Source # readList :: ReadS [PixelFormat] Source # readPrec :: ReadPrec PixelFormat Source # readListPrec :: ReadPrec [PixelFormat] Source #
Read RendererConfig |
Instance details Defined in SDL.Video.Renderer Methods readsPrec :: Int -> ReadS RendererConfig Source # readList :: ReadS [RendererConfig] Source # readPrec :: ReadPrec RendererConfig Source # readListPrec :: ReadPrec [RendererConfig] Source #
Read RendererInfo |
Instance details Defined in SDL.Video.Renderer Methods readsPrec :: Int -> ReadS RendererInfo Source # readList :: ReadS [RendererInfo] Source # readPrec :: ReadPrec RendererInfo Source # readListPrec :: ReadPrec [RendererInfo] Source #
Read RendererType |
Instance details Defined in SDL.Video.Renderer Methods readsPrec :: Int -> ReadS RendererType Source # readList :: ReadS [RendererType] Source # readPrec :: ReadPrec RendererType Source # readListPrec :: ReadPrec [RendererType] Source #
Read TextureAccess |
Instance details Defined in SDL.Video.Renderer Methods readsPrec :: Int -> ReadS TextureAccess Source # readList :: ReadS [TextureAccess] Source # readPrec :: ReadPrec TextureAccess Source # readListPrec :: ReadPrec [TextureAccess] Source #
Read TextureInfo |
Instance details Defined in SDL.Video.Renderer Methods readsPrec :: Int -> ReadS TextureInfo Source # readList :: ReadS [TextureInfo] Source # readPrec :: ReadPrec TextureInfo Source # readListPrec :: ReadPrec [TextureInfo] Source #
Read Hinting |
Instance details Defined in SDL.Font Methods readsPrec :: Int -> ReadS Hinting Source # readList :: ReadS [Hinting] Source # readPrec :: ReadPrec Hinting Source # readListPrec :: ReadPrec [Hinting] Source #
Read Style |
Instance details Defined in SDL.Font Methods readsPrec :: Int -> ReadS Style Source # readList :: ReadS [Style] Source # readPrec :: ReadPrec Style Source # readListPrec :: ReadPrec [Style] Source #

Read SMGen

    >>> readMaybe "SMGen 1 1" :: Maybe SMGen
    Just (SMGen 1 1)

    >>> readMaybe "SMGen 1 2" :: Maybe SMGen
    Nothing

    >>> readMaybe (show (mkSMGen 42)) :: Maybe SMGen
    Just (SMGen 9297814886316923340 13679457532755275413)

Instance details Defined in System.Random.SplitMix Methods readsPrec :: Int -> ReadS SMGen Source # readList :: ReadS [SMGen] Source # readPrec :: ReadPrec SMGen Source # readListPrec :: ReadPrec [SMGen] Source #

Read SMGen

    >>> readMaybe "SMGen 1 1" :: Maybe SMGen
    Just (SMGen 1 1)

    >>> readMaybe "SMGen 1 2" :: Maybe SMGen
    Nothing

    >>> readMaybe (show (mkSMGen 42)) :: Maybe SMGen
    Just (SMGen 142593372 1604540297)

Instance details Defined in System.Random.SplitMix32 Methods readsPrec :: Int -> ReadS SMGen Source # readList :: ReadS [SMGen] Source # readPrec :: ReadPrec SMGen Source # readListPrec :: ReadPrec [SMGen] Source #
Read I8 |
Instance details Defined in Data.Text.Foreign Methods readsPrec :: Int -> ReadS I8 Source # readList :: ReadS [I8] Source # readPrec :: ReadPrec I8 Source # readListPrec :: ReadPrec [I8] Source #
Read Text |
Instance details Defined in Data.Text Methods readsPrec :: Int -> ReadS Text Source # readList :: ReadS [Text] Source # readPrec :: ReadPrec Text Source # readListPrec :: ReadPrec [Text] Source #
Read Text |
Instance details Defined in Data.Text.Lazy Methods readsPrec :: Int -> ReadS Text Source # readList :: ReadS [Text] Source # readPrec :: ReadPrec Text Source # readListPrec :: ReadPrec [Text] Source #
Read FPFormat |
Instance details Defined in Data.Text.Lazy.Builder.RealFloat Methods readsPrec :: Int -> ReadS FPFormat Source # readList :: ReadS [FPFormat] Source # readPrec :: ReadPrec FPFormat Source # readListPrec :: ReadPrec [FPFormat] Source #
Read ShortText |
Instance details Defined in Data.Text.Short.Internal Methods readsPrec :: Int -> ReadS ShortText Source # readList :: ReadS [ShortText] Source # readPrec :: ReadPrec ShortText Source # readListPrec :: ReadPrec [ShortText] Source #
Read DatatypeVariant |
Instance details Defined in Language.Haskell.TH.Datatype Methods readsPrec :: Int -> ReadS DatatypeVariant Source # readList :: ReadS [DatatypeVariant] Source # readPrec :: ReadPrec DatatypeVariant Source # readListPrec :: ReadPrec [DatatypeVariant] Source #
Read Day |
Instance details Defined in Data.Time.Format.Parse Methods readsPrec :: Int -> ReadS Day Source # readList :: ReadS [Day] Source # readPrec :: ReadPrec Day Source # readListPrec :: ReadPrec [Day] Source #
Read Month | Read as `yyyy-mm`.
Instance details Defined in Data.Time.Calendar.Month Methods readsPrec :: Int -> ReadS Month Source # readList :: ReadS [Month] Source # readPrec :: ReadPrec Month Source # readListPrec :: ReadPrec [Month] Source #
Read Quarter | Read as `yyyy-Qn`.
Instance details Defined in Data.Time.Calendar.Quarter Methods readsPrec :: Int -> ReadS Quarter Source # readList :: ReadS [Quarter] Source # readPrec :: ReadPrec Quarter Source # readListPrec :: ReadPrec [Quarter] Source #
Read QuarterOfYear |
Instance details Defined in Data.Time.Calendar.Quarter Methods readsPrec :: Int -> ReadS QuarterOfYear Source # readList :: ReadS [QuarterOfYear] Source # readPrec :: ReadPrec QuarterOfYear Source # readListPrec :: ReadPrec [QuarterOfYear] Source #
Read DiffTime |
Instance details Defined in Data.Time.Clock.Internal.DiffTime Methods readsPrec :: Int -> ReadS DiffTime Source # readList :: ReadS [DiffTime] Source # readPrec :: ReadPrec DiffTime Source # readListPrec :: ReadPrec [DiffTime] Source #
Read NominalDiffTime |
Instance details Defined in Data.Time.Clock.Internal.NominalDiffTime Methods readsPrec :: Int -> ReadS NominalDiffTime Source # readList :: ReadS [NominalDiffTime] Source # readPrec :: ReadPrec NominalDiffTime Source # readListPrec :: ReadPrec [NominalDiffTime] Source #
Read UTCTime |
Instance details Defined in Data.Time.Format.Parse Methods readsPrec :: Int -> ReadS UTCTime Source # readList :: ReadS [UTCTime] Source # readPrec :: ReadPrec UTCTime Source # readListPrec :: ReadPrec [UTCTime] Source #
Read UniversalTime |
Instance details Defined in Data.Time.Format.Parse Methods readsPrec :: Int -> ReadS UniversalTime Source # readList :: ReadS [UniversalTime] Source # readPrec :: ReadPrec UniversalTime Source # readListPrec :: ReadPrec [UniversalTime] Source #
Read LocalTime |
Instance details Defined in Data.Time.Format.Parse Methods readsPrec :: Int -> ReadS LocalTime Source # readList :: ReadS [LocalTime] Source # readPrec :: ReadPrec LocalTime Source # readListPrec :: ReadPrec [LocalTime] Source #
Read TimeOfDay |
Instance details Defined in Data.Time.Format.Parse Methods readsPrec :: Int -> ReadS TimeOfDay Source # readList :: ReadS [TimeOfDay] Source # readPrec :: ReadPrec TimeOfDay Source # readListPrec :: ReadPrec [TimeOfDay] Source #
Read TimeZone | This only works for `±HHMM` format, single-letter military time-zones, and these time-zones: "UTC", "UT", "GMT", "EST", "EDT", "CST", "CDT", "MST", "MDT", "PST", "PDT", per RFC 822 section 5.
Instance details Defined in Data.Time.Format.Parse Methods readsPrec :: Int -> ReadS TimeZone Source # readList :: ReadS [TimeZone] Source # readPrec :: ReadPrec TimeZone Source # readListPrec :: ReadPrec [TimeZone] Source #
Read ZonedTime | This only works for a `zonedTimeZone` in `±HHMM` format, single-letter military time-zones, and these time-zones: "UTC", "UT", "GMT", "EST", "EDT", "CST", "CDT", "MST", "MDT", "PST", "PDT", per RFC 822 section 5.
Instance details Defined in Data.Time.Format.Parse Methods readsPrec :: Int -> ReadS ZonedTime Source # readList :: ReadS [ZonedTime] Source # readPrec :: ReadPrec ZonedTime Source # readListPrec :: ReadPrec [ZonedTime] Source #
Read UUID |
Instance details Defined in Data.UUID.Types.Internal Methods readsPrec :: Int -> ReadS UUID Source # readList :: ReadS [UUID] Source # readPrec :: ReadPrec UUID Source # readListPrec :: ReadPrec [UUID] Source #
Read UnpackedUUID |
Instance details Defined in Data.UUID.Types.Internal Methods readsPrec :: Int -> ReadS UnpackedUUID Source # readList :: ReadS [UnpackedUUID] Source # readPrec :: ReadPrec UnpackedUUID Source # readListPrec :: ReadPrec [UnpackedUUID] Source #
Read DictionaryHash |
Instance details Defined in Codec.Compression.Zlib.Stream Methods readsPrec :: Int -> ReadS DictionaryHash Source # readList :: ReadS [DictionaryHash] Source # readPrec :: ReadPrec DictionaryHash Source # readListPrec :: ReadPrec [DictionaryHash] Source #
Read Integer | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Integer Source # readList :: ReadS [Integer] Source # readPrec :: ReadPrec Integer Source # readListPrec :: ReadPrec [Integer] Source #
Read Natural | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Natural Source # readList :: ReadS [Natural] Source # readPrec :: ReadPrec Natural Source # readListPrec :: ReadPrec [Natural] Source #
Read () | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS () Source # readList :: ReadS [()] Source # readPrec :: ReadPrec () Source # readListPrec :: ReadPrec [()] Source #
Read Bool | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Bool Source # readList :: ReadS [Bool] Source # readPrec :: ReadPrec Bool Source # readListPrec :: ReadPrec [Bool] Source #
Read Char | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Char Source # readList :: ReadS [Char] Source # readPrec :: ReadPrec Char Source # readListPrec :: ReadPrec [Char] Source #
Read Double | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Double Source # readList :: ReadS [Double] Source # readPrec :: ReadPrec Double Source # readListPrec :: ReadPrec [Double] Source #
Read Float | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Float Source # readList :: ReadS [Float] Source # readPrec :: ReadPrec Float Source # readListPrec :: ReadPrec [Float] Source #
Read Int | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Int Source # readList :: ReadS [Int] Source # readPrec :: ReadPrec Int Source # readListPrec :: ReadPrec [Int] Source #
Read Word | Since: base-4.5.0.0
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Word Source # readList :: ReadS [Word] Source # readPrec :: ReadPrec Word Source # readListPrec :: ReadPrec [Word] Source #
Read a => Read (Fixed a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods readsPrec :: Int -> ReadS (Fixed a) Source # readList :: ReadS [Fixed a] Source # readPrec :: ReadPrec (Fixed a) Source # readListPrec :: ReadPrec [Fixed a] Source #
Read a => Read (Large a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods readsPrec :: Int -> ReadS (Large a) Source # readList :: ReadS [Large a] Source # readPrec :: ReadPrec (Large a) Source # readListPrec :: ReadPrec [Large a] Source #
Read a => Read (Negative a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods readsPrec :: Int -> ReadS (Negative a) Source # readList :: ReadS [Negative a] Source # readPrec :: ReadPrec (Negative a) Source # readListPrec :: ReadPrec [Negative a] Source #
Read a => Read (NonEmptyList a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods readsPrec :: Int -> ReadS (NonEmptyList a) Source # readList :: ReadS [NonEmptyList a] Source # readPrec :: ReadPrec (NonEmptyList a) Source # readListPrec :: ReadPrec [NonEmptyList a] Source #
Read a => Read (NonNegative a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods readsPrec :: Int -> ReadS (NonNegative a) Source # readList :: ReadS [NonNegative a] Source # readPrec :: ReadPrec (NonNegative a) Source # readListPrec :: ReadPrec [NonNegative a] Source #
Read a => Read (NonPositive a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods readsPrec :: Int -> ReadS (NonPositive a) Source # readList :: ReadS [NonPositive a] Source # readPrec :: ReadPrec (NonPositive a) Source # readListPrec :: ReadPrec [NonPositive a] Source #
Read a => Read (NonZero a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods readsPrec :: Int -> ReadS (NonZero a) Source # readList :: ReadS [NonZero a] Source # readPrec :: ReadPrec (NonZero a) Source # readListPrec :: ReadPrec [NonZero a] Source #
Read a => Read (OrderedList a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods readsPrec :: Int -> ReadS (OrderedList a) Source # readList :: ReadS [OrderedList a] Source # readPrec :: ReadPrec (OrderedList a) Source # readListPrec :: ReadPrec [OrderedList a] Source #
Read a => Read (Positive a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods readsPrec :: Int -> ReadS (Positive a) Source # readList :: ReadS [Positive a] Source # readPrec :: ReadPrec (Positive a) Source # readListPrec :: ReadPrec [Positive a] Source #
Read a => Read (Shrink2 a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods readsPrec :: Int -> ReadS (Shrink2 a) Source # readList :: ReadS [Shrink2 a] Source # readPrec :: ReadPrec (Shrink2 a) Source # readListPrec :: ReadPrec [Shrink2 a] Source #
Read a => Read (Small a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods readsPrec :: Int -> ReadS (Small a) Source # readList :: ReadS [Small a] Source # readPrec :: ReadPrec (Small a) Source # readListPrec :: ReadPrec [Small a] Source #
Read a => Read (SortedList a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods readsPrec :: Int -> ReadS (SortedList a) Source # readList :: ReadS [SortedList a] Source # readPrec :: ReadPrec (SortedList a) Source # readListPrec :: ReadPrec [SortedList a] Source #
Read v => Read (KeyMap v) |
Instance details Defined in Data.Aeson.KeyMap Methods readsPrec :: Int -> ReadS (KeyMap v) Source # readList :: ReadS [KeyMap v] Source # readPrec :: ReadPrec (KeyMap v) Source # readListPrec :: ReadPrec [KeyMap v] Source #
Read a => Read (Complex a) | Since: base-2.1
Instance details Defined in Data.Complex Methods readsPrec :: Int -> ReadS (Complex a) Source # readList :: ReadS [Complex a] Source # readPrec :: ReadPrec (Complex a) Source # readListPrec :: ReadPrec [Complex a] Source #
Read a => Read (First a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (First a) Source # readList :: ReadS [First a] Source # readPrec :: ReadPrec (First a) Source # readListPrec :: ReadPrec [First a] Source #
Read a => Read (Last a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Last a) Source # readList :: ReadS [Last a] Source # readPrec :: ReadPrec (Last a) Source # readListPrec :: ReadPrec [Last a] Source #
Read a => Read (Max a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Max a) Source # readList :: ReadS [Max a] Source # readPrec :: ReadPrec (Max a) Source # readListPrec :: ReadPrec [Max a] Source #
Read a => Read (Min a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Min a) Source # readList :: ReadS [Min a] Source # readPrec :: ReadPrec (Min a) Source # readListPrec :: ReadPrec [Min a] Source #
Read m => Read (WrappedMonoid m) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (WrappedMonoid m) Source # readList :: ReadS [WrappedMonoid m] Source # readPrec :: ReadPrec (WrappedMonoid m) Source # readListPrec :: ReadPrec [WrappedMonoid m] Source #
(Fractional a, Read a) => Read (AlphaColour a) |
Instance details Defined in Data.Colour Methods readsPrec :: Int -> ReadS (AlphaColour a) Source # readList :: ReadS [AlphaColour a] Source # readPrec :: ReadPrec (AlphaColour a) Source # readListPrec :: ReadPrec [AlphaColour a] Source #
(Fractional a, Read a) => Read (Colour a) |
Instance details Defined in Data.Colour Methods readsPrec :: Int -> ReadS (Colour a) Source # readList :: ReadS [Colour a] Source # readPrec :: ReadPrec (Colour a) Source # readListPrec :: ReadPrec [Colour a] Source #
Read vertex => Read (SCC vertex) | Since: containers-0.5.9
Instance details Defined in Data.Graph Methods readsPrec :: Int -> ReadS (SCC vertex) Source # readList :: ReadS [SCC vertex] Source # readPrec :: ReadPrec (SCC vertex) Source # readListPrec :: ReadPrec [SCC vertex] Source #
Read e => Read (IntMap e) |
Instance details Defined in Data.IntMap.Internal Methods readsPrec :: Int -> ReadS (IntMap e) Source # readList :: ReadS [IntMap e] Source # readPrec :: ReadPrec (IntMap e) Source # readListPrec :: ReadPrec [IntMap e] Source #
Read a => Read (Seq a) |
Instance details Defined in Data.Sequence.Internal Methods readsPrec :: Int -> ReadS (Seq a) Source # readList :: ReadS [Seq a] Source # readPrec :: ReadPrec (Seq a) Source # readListPrec :: ReadPrec [Seq a] Source #
Read a => Read (ViewL a) |
Instance details Defined in Data.Sequence.Internal Methods readsPrec :: Int -> ReadS (ViewL a) Source # readList :: ReadS [ViewL a] Source # readPrec :: ReadPrec (ViewL a) Source # readListPrec :: ReadPrec [ViewL a] Source #
Read a => Read (ViewR a) |
Instance details Defined in Data.Sequence.Internal Methods readsPrec :: Int -> ReadS (ViewR a) Source # readList :: ReadS [ViewR a] Source # readPrec :: ReadPrec (ViewR a) Source # readListPrec :: ReadPrec [ViewR a] Source #
(Read a, Ord a) => Read (Set a) |
Instance details Defined in Data.Set.Internal Methods readsPrec :: Int -> ReadS (Set a) Source # readList :: ReadS [Set a] Source # readPrec :: ReadPrec (Set a) Source # readListPrec :: ReadPrec [Set a] Source #
Read a => Read (Tree a) |
Instance details Defined in Data.Tree Methods readsPrec :: Int -> ReadS (Tree a) Source # readList :: ReadS [Tree a] Source # readPrec :: ReadPrec (Tree a) Source # readListPrec :: ReadPrec [Tree a] Source #
Read1 f => Read (Fix f) |
Instance details Defined in Data.Fix Methods readsPrec :: Int -> ReadS (Fix f) Source # readList :: ReadS [Fix f] Source # readPrec :: ReadPrec (Fix f) Source # readListPrec :: ReadPrec [Fix f] Source #
(Functor f, Read1 f) => Read (Mu f) |
Instance details Defined in Data.Fix Methods readsPrec :: Int -> ReadS (Mu f) Source # readList :: ReadS [Mu f] Source # readPrec :: ReadPrec (Mu f) Source # readListPrec :: ReadPrec [Mu f] Source #
(Functor f, Read1 f) => Read (Nu f) |
Instance details Defined in Data.Fix Methods readsPrec :: Int -> ReadS (Nu f) Source # readList :: ReadS [Nu f] Source # readPrec :: ReadPrec (Nu f) Source # readListPrec :: ReadPrec [Nu f] Source #
Read a => Read (DNonEmpty a) |
Instance details Defined in Data.DList.DNonEmpty.Internal Methods readsPrec :: Int -> ReadS (DNonEmpty a) Source # readList :: ReadS [DNonEmpty a] Source # readPrec :: ReadPrec (DNonEmpty a) Source # readListPrec :: ReadPrec [DNonEmpty a] Source #
Read a => Read (DList a) |
Instance details Defined in Data.DList.Internal Methods readsPrec :: Int -> ReadS (DList a) Source # readList :: ReadS [DList a] Source # readPrec :: ReadPrec (DList a) Source # readListPrec :: ReadPrec [DList a] Source #
(Enum k, Read k) => Read (EnumSet k) |
Instance details Defined in Data.EnumSet Methods readsPrec :: Int -> ReadS (EnumSet k) Source # readList :: ReadS [EnumSet k] Source # readPrec :: ReadPrec (EnumSet k) Source # readListPrec :: ReadPrec [EnumSet k] Source #
Read a => Read (NonEmpty a) | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (NonEmpty a) Source # readList :: ReadS [NonEmpty a] Source # readPrec :: ReadPrec (NonEmpty a) Source # readListPrec :: ReadPrec [NonEmpty a] Source #
Read a => Read (Identity a) | This instance would be equivalent to the derived instances of the `Identity` newtype if the `runIdentity` field were removed Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Functor.Identity Methods readsPrec :: Int -> ReadS (Identity a) Source # readList :: ReadS [Identity a] Source # readPrec :: ReadPrec (Identity a) Source # readListPrec :: ReadPrec [Identity a] Source #
Read a => Read (First a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Monoid Methods readsPrec :: Int -> ReadS (First a) Source # readList :: ReadS [First a] Source # readPrec :: ReadPrec (First a) Source # readListPrec :: ReadPrec [First a] Source #
Read a => Read (Last a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Monoid Methods readsPrec :: Int -> ReadS (Last a) Source # readList :: ReadS [Last a] Source # readPrec :: ReadPrec (Last a) Source # readListPrec :: ReadPrec [Last a] Source #
Read a => Read (Down a) | This instance would be equivalent to the derived instances of the `Down` newtype if the `getDown` field were removed Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Data.Ord Methods readsPrec :: Int -> ReadS (Down a) Source # readList :: ReadS [Down a] Source # readPrec :: ReadPrec (Down a) Source # readListPrec :: ReadPrec [Down a] Source #
Read a => Read (Dual a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS (Dual a) Source # readList :: ReadS [Dual a] Source # readPrec :: ReadPrec (Dual a) Source # readListPrec :: ReadPrec [Dual a] Source #
Read a => Read (Product a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS (Product a) Source # readList :: ReadS [Product a] Source # readPrec :: ReadPrec (Product a) Source # readListPrec :: ReadPrec [Product a] Source #
Read a => Read (Sum a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS (Sum a) Source # readList :: ReadS [Sum a] Source # readPrec :: ReadPrec (Sum a) Source # readListPrec :: ReadPrec [Sum a] Source #
Read a => Read (ZipList a) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Functor.ZipList Methods readsPrec :: Int -> ReadS (ZipList a) Source # readList :: ReadS [ZipList a] Source # readPrec :: ReadPrec (ZipList a) Source # readListPrec :: ReadPrec [ZipList a] Source #
Read p => Read (Par1 p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods readsPrec :: Int -> ReadS (Par1 p) Source # readList :: ReadS [Par1 p] Source # readPrec :: ReadPrec (Par1 p) Source # readListPrec :: ReadPrec [Par1 p] Source #
(Integral a, Read a) => Read (Ratio a) | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (Ratio a) Source # readList :: ReadS [Ratio a] Source # readPrec :: ReadPrec (Ratio a) Source # readListPrec :: ReadPrec [Ratio a] Source #
Read a => Read (Plucker a) |
Instance details Defined in Linear.Plucker Methods readsPrec :: Int -> ReadS (Plucker a) Source # readList :: ReadS [Plucker a] Source # readPrec :: ReadPrec (Plucker a) Source # readListPrec :: ReadPrec [Plucker a] Source #
Read a => Read (Quaternion a) |
Instance details Defined in Linear.Quaternion Methods readsPrec :: Int -> ReadS (Quaternion a) Source # readList :: ReadS [Quaternion a] Source # readPrec :: ReadPrec (Quaternion a) Source # readListPrec :: ReadPrec [Quaternion a] Source #
Read (V0 a) |
Instance details Defined in Linear.V0 Methods readsPrec :: Int -> ReadS (V0 a) Source # readList :: ReadS [V0 a] Source # readPrec :: ReadPrec (V0 a) Source # readListPrec :: ReadPrec [V0 a] Source #
Read a => Read (V1 a) |
Instance details Defined in Linear.V1 Methods readsPrec :: Int -> ReadS (V1 a) Source # readList :: ReadS [V1 a] Source # readPrec :: ReadPrec (V1 a) Source # readListPrec :: ReadPrec [V1 a] Source #
Read a => Read (V2 a) |
Instance details Defined in Linear.V2 Methods readsPrec :: Int -> ReadS (V2 a) Source # readList :: ReadS [V2 a] Source # readPrec :: ReadPrec (V2 a) Source # readListPrec :: ReadPrec [V2 a] Source #
Read a => Read (V3 a) |
Instance details Defined in Linear.V3 Methods readsPrec :: Int -> ReadS (V3 a) Source # readList :: ReadS [V3 a] Source # readPrec :: ReadPrec (V3 a) Source # readListPrec :: ReadPrec [V3 a] Source #
Read a => Read (V4 a) |
Instance details Defined in Linear.V4 Methods readsPrec :: Int -> ReadS (V4 a) Source # readList :: ReadS [V4 a] Source # readPrec :: ReadPrec (V4 a) Source # readListPrec :: ReadPrec [V4 a] Source #
Read a => Read (Array a) |
Instance details Defined in Data.Primitive.Array Methods readsPrec :: Int -> ReadS (Array a) Source # readList :: ReadS [Array a] Source # readPrec :: ReadPrec (Array a) Source # readListPrec :: ReadPrec [Array a] Source #
Read a => Read (SmallArray a) |
Instance details Defined in Data.Primitive.SmallArray Methods readsPrec :: Int -> ReadS (SmallArray a) Source # readList :: ReadS [SmallArray a] Source # readPrec :: ReadPrec (SmallArray a) Source # readListPrec :: ReadPrec [SmallArray a] Source #
Read a => Read (Changeable a) |
Instance details Defined in SDL.Audio Methods readsPrec :: Int -> ReadS (Changeable a) Source # readList :: ReadS [Changeable a] Source # readPrec :: ReadPrec (Changeable a) Source # readListPrec :: ReadPrec [Changeable a] Source #
Read a => Read (V2 a) |
Instance details Defined in SDL.Internal.Vect Methods readsPrec :: Int -> ReadS (V2 a) Source # readList :: ReadS [V2 a] Source # readPrec :: ReadPrec (V2 a) Source # readListPrec :: ReadPrec [V2 a] Source #
Read a => Read (V3 a) |
Instance details Defined in SDL.Internal.Vect Methods readsPrec :: Int -> ReadS (V3 a) Source # readList :: ReadS [V3 a] Source # readPrec :: ReadPrec (V3 a) Source # readListPrec :: ReadPrec [V3 a] Source #
Read a => Read (V4 a) |
Instance details Defined in SDL.Internal.Vect Methods readsPrec :: Int -> ReadS (V4 a) Source # readList :: ReadS [V4 a] Source # readPrec :: ReadPrec (V4 a) Source # readListPrec :: ReadPrec [V4 a] Source #
Read a => Read (Rectangle a) |
Instance details Defined in SDL.Video.Renderer Methods readsPrec :: Int -> ReadS (Rectangle a) Source # readList :: ReadS [Rectangle a] Source # readPrec :: ReadPrec (Rectangle a) Source # readListPrec :: ReadPrec [Rectangle a] Source #
Read a => Read (Maybe a) |
Instance details Defined in Data.Strict.Maybe Methods readsPrec :: Int -> ReadS (Maybe a) Source # readList :: ReadS [Maybe a] Source # readPrec :: ReadPrec (Maybe a) Source # readListPrec :: ReadPrec [Maybe a] Source #
(Eq a, Hashable a, Read a) => Read (HashSet a) |
Instance details Defined in Data.HashSet.Internal Methods readsPrec :: Int -> ReadS (HashSet a) Source # readList :: ReadS [HashSet a] Source # readPrec :: ReadPrec (HashSet a) Source # readListPrec :: ReadPrec [HashSet a] Source #
Read a => Read (Vector a) |
Instance details Defined in Data.Vector Methods readsPrec :: Int -> ReadS (Vector a) Source # readList :: ReadS [Vector a] Source # readPrec :: ReadPrec (Vector a) Source # readListPrec :: ReadPrec [Vector a] Source #
(Read a, Prim a) => Read (Vector a) |
Instance details Defined in Data.Vector.Primitive Methods readsPrec :: Int -> ReadS (Vector a) Source # readList :: ReadS [Vector a] Source # readPrec :: ReadPrec (Vector a) Source # readListPrec :: ReadPrec [Vector a] Source #
(Read a, Storable a) => Read (Vector a) |
Instance details Defined in Data.Vector.Storable Methods readsPrec :: Int -> ReadS (Vector a) Source # readList :: ReadS [Vector a] Source # readPrec :: ReadPrec (Vector a) Source # readListPrec :: ReadPrec [Vector a] Source #
Read a => Read (Vector a) |
Instance details Defined in Data.Vector.Strict Methods readsPrec :: Int -> ReadS (Vector a) Source # readList :: ReadS [Vector a] Source # readPrec :: ReadPrec (Vector a) Source # readListPrec :: ReadPrec [Vector a] Source #
(Read a, Unbox a) => Read (Vector a) |
Instance details Defined in Data.Vector.Unboxed Methods readsPrec :: Int -> ReadS (Vector a) Source # readList :: ReadS [Vector a] Source # readPrec :: ReadPrec (Vector a) Source # readListPrec :: ReadPrec [Vector a] Source #
Read a => Read (Maybe a) | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (Maybe a) Source # readList :: ReadS [Maybe a] Source # readPrec :: ReadPrec (Maybe a) Source # readListPrec :: ReadPrec [Maybe a] Source #
Read a => Read (Solo a) | Since: base-4.15
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (Solo a) Source # readList :: ReadS [Solo a] Source # readPrec :: ReadPrec (Solo a) Source # readListPrec :: ReadPrec [Solo a] Source #
Read a => Read [a] | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS [a] Source # readList :: ReadS [[a]] Source # readPrec :: ReadPrec [a] Source # readListPrec :: ReadPrec [[a]] Source #
HasResolution a => Read (Fixed a) | Since: base-4.3.0.0
Instance details Defined in Data.Fixed Methods readsPrec :: Int -> ReadS (Fixed a) Source # readList :: ReadS [Fixed a] Source # readPrec :: ReadPrec (Fixed a) Source # readListPrec :: ReadPrec [Fixed a] Source #
(Read a, Read b) => Read (Arg a b) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Arg a b) Source # readList :: ReadS [Arg a b] Source # readPrec :: ReadPrec (Arg a b) Source # readListPrec :: ReadPrec [Arg a b] Source #
(Ord k, Read k, Read e) => Read (Map k e) |
Instance details Defined in Data.Map.Internal Methods readsPrec :: Int -> ReadS (Map k e) Source # readList :: ReadS [Map k e] Source # readPrec :: ReadPrec (Map k e) Source # readListPrec :: ReadPrec [Map k e] Source #
(Enum k, Read k, Read a) => Read (EnumMap k a) |
Instance details Defined in Data.EnumMap.Base Methods readsPrec :: Int -> ReadS (EnumMap k a) Source # readList :: ReadS [EnumMap k a] Source # readPrec :: ReadPrec (EnumMap k a) Source # readListPrec :: ReadPrec [EnumMap k a] Source #
(Read1 f, Read a) => Read (Cofree f a) |
Instance details Defined in Control.Comonad.Cofree Methods readsPrec :: Int -> ReadS (Cofree f a) Source # readList :: ReadS [Cofree f a] Source # readPrec :: ReadPrec (Cofree f a) Source # readListPrec :: ReadPrec [Cofree f a] Source #
(Read1 f, Read a) => Read (Free f a) |
Instance details Defined in Control.Monad.Free Methods readsPrec :: Int -> ReadS (Free f a) Source # readList :: ReadS [Free f a] Source # readPrec :: ReadPrec (Free f a) Source # readListPrec :: ReadPrec [Free f a] Source #
(Ix a, Read a, Read b) => Read (Array a b) | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (Array a b) Source # readList :: ReadS [Array a b] Source # readPrec :: ReadPrec (Array a b) Source # readListPrec :: ReadPrec [Array a b] Source #
(Read a, Read b) => Read (Either a b) | Since: base-3.0
Instance details Defined in GHC.Internal.Data.Either Methods readsPrec :: Int -> ReadS (Either a b) Source # readList :: ReadS [Either a b] Source # readPrec :: ReadPrec (Either a b) Source # readListPrec :: ReadPrec [Either a b] Source #
Read (U1 p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods readsPrec :: Int -> ReadS (U1 p) Source # readList :: ReadS [U1 p] Source # readPrec :: ReadPrec (U1 p) Source # readListPrec :: ReadPrec [U1 p] Source #
Read (V1 p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods readsPrec :: Int -> ReadS (V1 p) Source # readList :: ReadS [V1 p] Source # readPrec :: ReadPrec (V1 p) Source # readListPrec :: ReadPrec [V1 p] Source #
(Functor f, Read (f a)) => Read (Yoneda f a) |
Instance details Defined in Data.Functor.Yoneda Methods readsPrec :: Int -> ReadS (Yoneda f a) Source # readList :: ReadS [Yoneda f a] Source # readPrec :: ReadPrec (Yoneda f a) Source # readListPrec :: ReadPrec [Yoneda f a] Source #
Read (f a) => Read (Point f a) |
Instance details Defined in Linear.Affine Methods readsPrec :: Int -> ReadS (Point f a) Source # readList :: ReadS [Point f a] Source # readPrec :: ReadPrec (Point f a) Source # readListPrec :: ReadPrec [Point f a] Source #
Read (f a) => Read (Point f a) |
Instance details Defined in SDL.Internal.Vect Methods readsPrec :: Int -> ReadS (Point f a) Source # readList :: ReadS [Point f a] Source # readPrec :: ReadPrec (Point f a) Source # readListPrec :: ReadPrec [Point f a] Source #
(Read a, Read b) => Read (Either a b) |
Instance details Defined in Data.Strict.Either Methods readsPrec :: Int -> ReadS (Either a b) Source # readList :: ReadS [Either a b] Source # readPrec :: ReadPrec (Either a b) Source # readListPrec :: ReadPrec [Either a b] Source #
(Read a, Read b) => Read (These a b) |
Instance details Defined in Data.Strict.These Methods readsPrec :: Int -> ReadS (These a b) Source # readList :: ReadS [These a b] Source # readPrec :: ReadPrec (These a b) Source # readListPrec :: ReadPrec [These a b] Source #
(Read a, Read b) => Read (Pair a b) |
Instance details Defined in Data.Strict.Tuple Methods readsPrec :: Int -> ReadS (Pair a b) Source # readList :: ReadS [Pair a b] Source # readPrec :: ReadPrec (Pair a b) Source # readListPrec :: ReadPrec [Pair a b] Source #
(Read a, Read b) => Read (These a b) |
Instance details Defined in Data.These Methods readsPrec :: Int -> ReadS (These a b) Source # readList :: ReadS [These a b] Source # readPrec :: ReadPrec (These a b) Source # readListPrec :: ReadPrec [These a b] Source #
(Read1 f, Read a) => Read (Lift f a) |
Instance details Defined in Control.Applicative.Lift Methods readsPrec :: Int -> ReadS (Lift f a) Source # readList :: ReadS [Lift f a] Source # readPrec :: ReadPrec (Lift f a) Source # readListPrec :: ReadPrec [Lift f a] Source #
(Read1 m, Read a) => Read (MaybeT m a) |
Instance details Defined in Control.Monad.Trans.Maybe Methods readsPrec :: Int -> ReadS (MaybeT m a) Source # readList :: ReadS [MaybeT m a] Source # readPrec :: ReadPrec (MaybeT m a) Source # readListPrec :: ReadPrec [MaybeT m a] Source #
(Eq k, Hashable k, Read k, Read e) => Read (HashMap k e) |
Instance details Defined in Data.HashMap.Internal Methods readsPrec :: Int -> ReadS (HashMap k e) Source # readList :: ReadS [HashMap k e] Source # readPrec :: ReadPrec (HashMap k e) Source # readListPrec :: ReadPrec [HashMap k e] Source #
(Read a, Read b) => Read (a, b) | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (a, b) Source # readList :: ReadS [(a, b)] Source # readPrec :: ReadPrec (a, b) Source # readListPrec :: ReadPrec [(a, b)] Source #
Read (p (Fix p a) a) => Read (Fix p a) |
Instance details Defined in Data.Bifunctor.Fix Methods readsPrec :: Int -> ReadS (Fix p a) Source # readList :: ReadS [Fix p a] Source # readPrec :: ReadPrec (Fix p a) Source # readListPrec :: ReadPrec [Fix p a] Source #
Read (p a a) => Read (Join p a) |
Instance details Defined in Data.Bifunctor.Join Methods readsPrec :: Int -> ReadS (Join p a) Source # readList :: ReadS [Join p a] Source # readPrec :: ReadPrec (Join p a) Source # readListPrec :: ReadPrec [Join p a] Source #
(Read a, Read (f b)) => Read (CofreeF f a b) |
Instance details Defined in Control.Comonad.Trans.Cofree Methods readsPrec :: Int -> ReadS (CofreeF f a b) Source # readList :: ReadS [CofreeF f a b] Source # readPrec :: ReadPrec (CofreeF f a b) Source # readListPrec :: ReadPrec [CofreeF f a b] Source #
Read (w (CofreeF f a (CofreeT f w a))) => Read (CofreeT f w a) |
Instance details Defined in Control.Comonad.Trans.Cofree Methods readsPrec :: Int -> ReadS (CofreeT f w a) Source # readList :: ReadS [CofreeT f w a] Source # readPrec :: ReadPrec (CofreeT f w a) Source # readListPrec :: ReadPrec [CofreeT f w a] Source #
(Read a, Read (f b)) => Read (FreeF f a b) |
Instance details Defined in Control.Monad.Trans.Free Methods readsPrec :: Int -> ReadS (FreeF f a b) Source # readList :: ReadS [FreeF f a b] Source # readPrec :: ReadPrec (FreeF f a b) Source # readListPrec :: ReadPrec [FreeF f a b] Source #
(Read1 f, Read1 m, Read a) => Read (FreeT f m a) |
Instance details Defined in Control.Monad.Trans.Free Methods readsPrec :: Int -> ReadS (FreeT f m a) Source # readList :: ReadS [FreeT f m a] Source # readPrec :: ReadPrec (FreeT f m a) Source # readListPrec :: ReadPrec [FreeT f m a] Source #
Read a => Read (Const a b) | This instance would be equivalent to the derived instances of the `Const` newtype if the `getConst` field were removed Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Functor.Const Methods readsPrec :: Int -> ReadS (Const a b) Source # readList :: ReadS [Const a b] Source # readPrec :: ReadPrec (Const a b) Source # readListPrec :: ReadPrec [Const a b] Source #
Read (f a) => Read (Ap f a) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods readsPrec :: Int -> ReadS (Ap f a) Source # readList :: ReadS [Ap f a] Source # readPrec :: ReadPrec (Ap f a) Source # readListPrec :: ReadPrec [Ap f a] Source #
Read (f a) => Read (Alt f a) | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS (Alt f a) Source # readList :: ReadS [Alt f a] Source # readPrec :: ReadPrec (Alt f a) Source # readListPrec :: ReadPrec [Alt f a] Source #
Read (f p) => Read (Rec1 f p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods readsPrec :: Int -> ReadS (Rec1 f p) Source # readList :: ReadS [Rec1 f p] Source # readPrec :: ReadPrec (Rec1 f p) Source # readListPrec :: ReadPrec [Rec1 f p] Source #
Read a => Read (V n a) |
Instance details Defined in Linear.V Methods readsPrec :: Int -> ReadS (V n a) Source # readList :: ReadS [V n a] Source # readPrec :: ReadPrec (V n a) Source # readListPrec :: ReadPrec [V n a] Source #
Read b => Read (Tagged s b) |
Instance details Defined in Data.Tagged Methods readsPrec :: Int -> ReadS (Tagged s b) Source # readList :: ReadS [Tagged s b] Source # readPrec :: ReadPrec (Tagged s b) Source # readListPrec :: ReadPrec [Tagged s b] Source #
(Read (f a), Read (g a), Read a) => Read (These1 f g a) |
Instance details Defined in Data.Functor.These Methods readsPrec :: Int -> ReadS (These1 f g a) Source # readList :: ReadS [These1 f g a] Source # readPrec :: ReadPrec (These1 f g a) Source # readListPrec :: ReadPrec [These1 f g a] Source #
(Read1 f, Read a) => Read (Backwards f a) |
Instance details Defined in Control.Applicative.Backwards Methods readsPrec :: Int -> ReadS (Backwards f a) Source # readList :: ReadS [Backwards f a] Source # readPrec :: ReadPrec (Backwards f a) Source # readListPrec :: ReadPrec [Backwards f a] Source #
(Read e, Read1 m, Read a) => Read (ExceptT e m a) |
Instance details Defined in Control.Monad.Trans.Except Methods readsPrec :: Int -> ReadS (ExceptT e m a) Source # readList :: ReadS [ExceptT e m a] Source # readPrec :: ReadPrec (ExceptT e m a) Source # readListPrec :: ReadPrec [ExceptT e m a] Source #
(Read1 f, Read a) => Read (IdentityT f a) |
Instance details Defined in Control.Monad.Trans.Identity Methods readsPrec :: Int -> ReadS (IdentityT f a) Source # readList :: ReadS [IdentityT f a] Source # readPrec :: ReadPrec (IdentityT f a) Source # readListPrec :: ReadPrec [IdentityT f a] Source #
(Read w, Read1 m, Read a) => Read (WriterT w m a) |
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods readsPrec :: Int -> ReadS (WriterT w m a) Source # readList :: ReadS [WriterT w m a] Source # readPrec :: ReadPrec (WriterT w m a) Source # readListPrec :: ReadPrec [WriterT w m a] Source #
(Read w, Read1 m, Read a) => Read (WriterT w m a) |
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods readsPrec :: Int -> ReadS (WriterT w m a) Source # readList :: ReadS [WriterT w m a] Source # readPrec :: ReadPrec (WriterT w m a) Source # readListPrec :: ReadPrec [WriterT w m a] Source #
Read a => Read (Constant a b) |
Instance details Defined in Data.Functor.Constant Methods readsPrec :: Int -> ReadS (Constant a b) Source # readList :: ReadS [Constant a b] Source # readPrec :: ReadPrec (Constant a b) Source # readListPrec :: ReadPrec [Constant a b] Source #
(Read1 f, Read a) => Read (Reverse f a) |
Instance details Defined in Data.Functor.Reverse Methods readsPrec :: Int -> ReadS (Reverse f a) Source # readList :: ReadS [Reverse f a] Source # readPrec :: ReadPrec (Reverse f a) Source # readListPrec :: ReadPrec [Reverse f a] Source #
(Read a, Read b, Read c) => Read (a, b, c) | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (a, b, c) Source # readList :: ReadS [(a, b, c)] Source # readPrec :: ReadPrec (a, b, c) Source # readListPrec :: ReadPrec [(a, b, c)] Source #
(Read (f a), Read (g a)) => Read (Product f g a) | Since: base-4.18.0.0
Instance details Defined in Data.Functor.Product Methods readsPrec :: Int -> ReadS (Product f g a) Source # readList :: ReadS [Product f g a] Source # readPrec :: ReadPrec (Product f g a) Source # readListPrec :: ReadPrec [Product f g a] Source #
(Read (f a), Read (g a)) => Read (Sum f g a) | Since: base-4.18.0.0
Instance details Defined in Data.Functor.Sum Methods readsPrec :: Int -> ReadS (Sum f g a) Source # readList :: ReadS [Sum f g a] Source # readPrec :: ReadPrec (Sum f g a) Source # readListPrec :: ReadPrec [Sum f g a] Source #
(Read (f p), Read (g p)) => Read ((f :*: g) p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods readsPrec :: Int -> ReadS ((f :*: g) p) Source # readList :: ReadS [(f :*: g) p] Source # readPrec :: ReadPrec ((f :*: g) p) Source # readListPrec :: ReadPrec [(f :*: g) p] Source #
(Read (f p), Read (g p)) => Read ((f :+: g) p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods readsPrec :: Int -> ReadS ((f :+: g) p) Source # readList :: ReadS [(f :+: g) p] Source # readPrec :: ReadPrec ((f :+: g) p) Source # readListPrec :: ReadPrec [(f :+: g) p] Source #
Read c => Read (K1 i c p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods readsPrec :: Int -> ReadS (K1 i c p) Source # readList :: ReadS [K1 i c p] Source # readPrec :: ReadPrec (K1 i c p) Source # readListPrec :: ReadPrec [K1 i c p] Source #
(Read a, Read b, Read c, Read d) => Read (a, b, c, d) | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (a, b, c, d) Source # readList :: ReadS [(a, b, c, d)] Source # readPrec :: ReadPrec (a, b, c, d) Source # readListPrec :: ReadPrec [(a, b, c, d)] Source #
Read (f (g a)) => Read (Compose f g a) | Since: base-4.18.0.0
Instance details Defined in Data.Functor.Compose Methods readsPrec :: Int -> ReadS (Compose f g a) Source # readList :: ReadS [Compose f g a] Source # readPrec :: ReadPrec (Compose f g a) Source # readListPrec :: ReadPrec [Compose f g a] Source #
Read (f a) => Read (Clown f a b) |
Instance details Defined in Data.Bifunctor.Clown Methods readsPrec :: Int -> ReadS (Clown f a b) Source # readList :: ReadS [Clown f a b] Source # readPrec :: ReadPrec (Clown f a b) Source # readListPrec :: ReadPrec [Clown f a b] Source #
Read (p b a) => Read (Flip p a b) |
Instance details Defined in Data.Bifunctor.Flip Methods readsPrec :: Int -> ReadS (Flip p a b) Source # readList :: ReadS [Flip p a b] Source # readPrec :: ReadPrec (Flip p a b) Source # readListPrec :: ReadPrec [Flip p a b] Source #
Read (g b) => Read (Joker g a b) |
Instance details Defined in Data.Bifunctor.Joker Methods readsPrec :: Int -> ReadS (Joker g a b) Source # readList :: ReadS [Joker g a b] Source # readPrec :: ReadPrec (Joker g a b) Source # readListPrec :: ReadPrec [Joker g a b] Source #
Read (p a b) => Read (WrappedBifunctor p a b) |
Instance details Defined in Data.Bifunctor.Wrapped Methods readsPrec :: Int -> ReadS (WrappedBifunctor p a b) Source # readList :: ReadS [WrappedBifunctor p a b] Source # readPrec :: ReadPrec (WrappedBifunctor p a b) Source # readListPrec :: ReadPrec [WrappedBifunctor p a b] Source #
Read (f (g p)) => Read ((f :.: g) p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods readsPrec :: Int -> ReadS ((f :.: g) p) Source # readList :: ReadS [(f :.: g) p] Source # readPrec :: ReadPrec ((f :.: g) p) Source # readListPrec :: ReadPrec [(f :.: g) p] Source #
Read (f p) => Read (M1 i c f p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods readsPrec :: Int -> ReadS (M1 i c f p) Source # readList :: ReadS [M1 i c f p] Source # readPrec :: ReadPrec (M1 i c f p) Source # readListPrec :: ReadPrec [M1 i c f p] Source #
(Read a, Read b, Read c, Read d, Read e) => Read (a, b, c, d, e) | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e) Source # readList :: ReadS [(a, b, c, d, e)] Source # readPrec :: ReadPrec (a, b, c, d, e) Source # readListPrec :: ReadPrec [(a, b, c, d, e)] Source #
(Read (f a b), Read (g a b)) => Read (Product f g a b) |
Instance details Defined in Data.Bifunctor.Product Methods readsPrec :: Int -> ReadS (Product f g a b) Source # readList :: ReadS [Product f g a b] Source # readPrec :: ReadPrec (Product f g a b) Source # readListPrec :: ReadPrec [Product f g a b] Source #
(Read (p a b), Read (q a b)) => Read (Sum p q a b) |
Instance details Defined in Data.Bifunctor.Sum Methods readsPrec :: Int -> ReadS (Sum p q a b) Source # readList :: ReadS [Sum p q a b] Source # readPrec :: ReadPrec (Sum p q a b) Source # readListPrec :: ReadPrec [Sum p q a b] Source #
(Read a, Read b, Read c, Read d, Read e, Read f) => Read (a, b, c, d, e, f) | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f) Source # readList :: ReadS [(a, b, c, d, e, f)] Source # readPrec :: ReadPrec (a, b, c, d, e, f) Source # readListPrec :: ReadPrec [(a, b, c, d, e, f)] Source #
Read (f (p a b)) => Read (Tannen f p a b) |
Instance details Defined in Data.Bifunctor.Tannen Methods readsPrec :: Int -> ReadS (Tannen f p a b) Source # readList :: ReadS [Tannen f p a b] Source # readPrec :: ReadPrec (Tannen f p a b) Source # readListPrec :: ReadPrec [Tannen f p a b] Source #
(Read a, Read b, Read c, Read d, Read e, Read f, Read g) => Read (a, b, c, d, e, f, g) | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g) Source # readList :: ReadS [(a, b, c, d, e, f, g)] Source # readPrec :: ReadPrec (a, b, c, d, e, f, g) Source # readListPrec :: ReadPrec [(a, b, c, d, e, f, g)] Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h) Source # readList :: ReadS [(a, b, c, d, e, f, g, h)] Source # readPrec :: ReadPrec (a, b, c, d, e, f, g, h) Source # readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h)] Source #
Read (p (f a) (g b)) => Read (Biff p f g a b) |
Instance details Defined in Data.Bifunctor.Biff Methods readsPrec :: Int -> ReadS (Biff p f g a b) Source # readList :: ReadS [Biff p f g a b] Source # readPrec :: ReadPrec (Biff p f g a b) Source # readListPrec :: ReadPrec [Biff p f g a b] Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i) Source # readList :: ReadS [(a, b, c, d, e, f, g, h, i)] Source # readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i) Source # readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i)] Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j) Source # readList :: ReadS [(a, b, c, d, e, f, g, h, i, j)] Source # readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j) Source # readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i, j)] Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k) Source # readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k)] Source # readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k) Source # readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i, j, k)] Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l) Source # readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l)] Source # readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l) Source # readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i, j, k, l)] Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l, m) Source # readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l, m)] Source # readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l, m) Source # readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i, j, k, l, m)] Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l, m, n) Source # readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l, m, n)] Source # readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l, m, n) Source # readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i, j, k, l, m, n)] Source #
(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) | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) Source # readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)] Source # readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) Source # readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)] Source #

data Bool Source #

Constructors

False |
True |

#### Instances

Instances details

UnboxRepClass Bool Source # |

Instance details

Defined in Game.LambdaHack.Common.PointArray

Associated Types

type UnboxRep Bool |
Instance details Defined in Game.LambdaHack.Common.PointArray type UnboxRep Bool = Bool

Methods

toUnboxRepUnsafe :: Bool -> UnboxRep Bool Source #

fromUnboxRep :: UnboxRep Bool -> Bool Source #

Arbitrary Bool |
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen Bool Source # shrink :: Bool -> [Bool] Source #
CoArbitrary Bool |
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Bool -> Gen b -> Gen b Source #
Function Bool |
Instance details Defined in Test.QuickCheck.Function Methods function :: (Bool -> b) -> Bool :-> b Source #
Testable Bool |
Instance details Defined in Test.QuickCheck.Property Methods property :: Bool -> Property Source # propertyForAllShrinkShow :: Gen a -> (a -> [a]) -> (a -> [String]) -> (a -> Bool) -> Property Source #
Binary Bool |
Instance details Defined in Data.Binary.Class Methods put :: Bool -> Put Source # get :: Get Bool Source # putList :: [Bool] -> Put Source #
NFData Bool |
Instance details Defined in Control.DeepSeq Methods rnf :: Bool -> () Source #
Bits Bool | Interpret `Bool` as 1-bit bit-field Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Bits

Methods

(.&.) :: Bool -> Bool -> Bool Source #

(.|.) :: Bool -> Bool -> Bool Source #

xor :: Bool -> Bool -> Bool Source #

complement :: Bool -> Bool Source #

shift :: Bool -> Int -> Bool Source #

rotate :: Bool -> Int -> Bool Source #

zeroBits :: Bool Source #

bit :: Int -> Bool Source #

setBit :: Bool -> Int -> Bool Source #

clearBit :: Bool -> Int -> Bool Source #

complementBit :: Bool -> Int -> Bool Source #

testBit :: Bool -> Int -> Bool Source #

bitSizeMaybe :: Bool -> Maybe Int Source #

bitSize :: Bool -> Int Source #

isSigned :: Bool -> Bool Source #

shiftL :: Bool -> Int -> Bool Source #

unsafeShiftL :: Bool -> Int -> Bool Source #

shiftR :: Bool -> Int -> Bool Source #

unsafeShiftR :: Bool -> Int -> Bool Source #

rotateL :: Bool -> Int -> Bool Source #

rotateR :: Bool -> Int -> Bool Source #

popCount :: Bool -> Int Source #

FiniteBits Bool | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Bits Methods finiteBitSize :: Bool -> Int Source # countLeadingZeros :: Bool -> Int Source # countTrailingZeros :: Bool -> Int Source #
Bounded Bool | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: Bool Source # maxBound :: Bool Source #
Enum Bool | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods succ :: Bool -> Bool Source # pred :: Bool -> Bool Source # toEnum :: Int -> Bool Source # fromEnum :: Bool -> Int Source # enumFrom :: Bool -> [Bool] Source # enumFromThen :: Bool -> Bool -> [Bool] Source # enumFromTo :: Bool -> Bool -> [Bool] Source # enumFromThenTo :: Bool -> Bool -> Bool -> [Bool] Source #
Storable Bool | Since: base-2.1

Instance details

Defined in GHC.Internal.Foreign.Storable

Methods

sizeOf :: Bool -> Int Source #

alignment :: Bool -> Int Source #

peekElemOff :: Ptr Bool -> Int -> IO Bool Source #

pokeElemOff :: Ptr Bool -> Int -> Bool -> IO () Source #

peekByteOff :: Ptr b -> Int -> IO Bool Source #

pokeByteOff :: Ptr b -> Int -> Bool -> IO () Source #

peek :: Ptr Bool -> IO Bool Source #

poke :: Ptr Bool -> Bool -> IO () Source #

Generic Bool |

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep Bool | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Generics type Rep Bool = D1 ('MetaData "Bool" "GHC.Types" "ghc-prim" 'False) (C1 ('MetaCons "False" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "True" 'PrefixI 'False) (U1 :: Type -> Type))

Methods

from :: Bool -> Rep Bool x Source #

to :: Rep Bool x -> Bool Source #

SingKind Bool | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Associated Types

type DemoteRep Bool |
Instance details Defined in GHC.Internal.Generics type DemoteRep Bool = Bool

Methods

fromSing :: forall (a :: Bool). Sing a -> DemoteRep Bool

Ix Bool | Since: base-2.1
Instance details Defined in GHC.Internal.Ix Methods range :: (Bool, Bool) -> [Bool] Source # index :: (Bool, Bool) -> Bool -> Int Source # unsafeIndex :: (Bool, Bool) -> Bool -> Int Source # inRange :: (Bool, Bool) -> Bool -> Bool Source # rangeSize :: (Bool, Bool) -> Int Source # unsafeRangeSize :: (Bool, Bool) -> Int Source #
Read Bool | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Bool Source # readList :: ReadS [Bool] Source # readPrec :: ReadPrec Bool Source # readListPrec :: ReadPrec [Bool] Source #
Show Bool | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Bool -> ShowS Source # show :: Bool -> String Source # showList :: [Bool] -> ShowS Source #
Eq Bool |
Instance details Defined in GHC.Classes Methods (==) :: Bool -> Bool -> Bool Source # (/=) :: Bool -> Bool -> Bool Source #
Ord Bool |
Instance details Defined in GHC.Classes Methods compare :: Bool -> Bool -> Ordering Source # (<) :: Bool -> Bool -> Bool Source # (<=) :: Bool -> Bool -> Bool Source # (>) :: Bool -> Bool -> Bool Source # (>=) :: Bool -> Bool -> Bool Source # max :: Bool -> Bool -> Bool Source # min :: Bool -> Bool -> Bool Source #
Hashable Bool |
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Bool -> Int Source # hash :: Bool -> Int Source #
Pretty Bool |
Instance details Defined in Prettyprinter.Internal Methods pretty :: Bool -> Doc ann # prettyList :: [Bool] -> Doc ann #
Random Bool |
Instance details Defined in System.Random Methods randomR :: RandomGen g => (Bool, Bool) -> g -> (Bool, g) random :: RandomGen g => g -> (Bool, g) randomRs :: RandomGen g => (Bool, Bool) -> g -> [Bool] randoms :: RandomGen g => g -> [Bool]
Uniform Bool |
Instance details Defined in System.Random.Internal Methods uniformM :: StatefulGen g m => g -> m Bool
UniformRange Bool |
Instance details Defined in System.Random.Internal Methods uniformRM :: StatefulGen g m => (Bool, Bool) -> g -> m Bool
Unbox Bool |
Instance details Defined in Data.Vector.Unboxed.Base
SingI 'False | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods sing :: Sing 'False
SingI 'True | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods sing :: Sing 'True
Lift Bool |
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Quote m => Bool -> m Exp Source # liftTyped :: forall (m :: Type -> Type). Quote m => Bool -> Code m Bool Source #
Vector Vector Bool |

Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: Mutable Vector s Bool -> ST s (Vector Bool)

basicUnsafeThaw :: Vector Bool -> ST s (Mutable Vector s Bool)

basicLength :: Vector Bool -> Int

basicUnsafeSlice :: Int -> Int -> Vector Bool -> Vector Bool

basicUnsafeIndexM :: Vector Bool -> Int -> Box Bool

basicUnsafeCopy :: Mutable Vector s Bool -> Vector Bool -> ST s ()

elemseq :: Vector Bool -> Bool -> b -> b

MVector MVector Bool |

Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Bool -> Int

basicUnsafeSlice :: Int -> Int -> MVector s Bool -> MVector s Bool

basicOverlaps :: MVector s Bool -> MVector s Bool -> Bool

basicUnsafeNew :: Int -> ST s (MVector s Bool)

basicInitialize :: MVector s Bool -> ST s ()

basicUnsafeReplicate :: Int -> Bool -> ST s (MVector s Bool)

basicUnsafeRead :: MVector s Bool -> Int -> ST s Bool

basicUnsafeWrite :: MVector s Bool -> Int -> Bool -> ST s ()

basicClear :: MVector s Bool -> ST s ()

basicSet :: MVector s Bool -> Bool -> ST s ()

basicUnsafeCopy :: MVector s Bool -> MVector s Bool -> ST s ()

basicUnsafeMove :: MVector s Bool -> MVector s Bool -> ST s ()

basicUnsafeGrow :: MVector s Bool -> Int -> ST s (MVector s Bool)

type UnboxRep Bool Source # |
Instance details Defined in Game.LambdaHack.Common.PointArray type UnboxRep Bool = Bool
type DemoteRep Bool |
Instance details Defined in GHC.Internal.Generics type DemoteRep Bool = Bool
type Rep Bool | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Generics type Rep Bool = D1 ('MetaData "Bool" "GHC.Types" "ghc-prim" 'False) (C1 ('MetaCons "False" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "True" 'PrefixI 'False) (U1 :: Type -> Type))
data Sing (a :: Bool) |

Instance details

Defined in GHC.Internal.Generics

data Sing (a :: Bool) where

- STrue :: Sing 'True
- SFalse :: Sing 'False

newtype Vector Bool |
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Bool = V_Bool (Vector Word8)
newtype MVector s Bool |
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Bool = MV_Bool (MVector s Word8)

data IO a Source #

A value of type ``IO` a` is a computation which, when performed, does some I/O before returning a value of type `a`.

There is really only one way to "perform" an I/O action: bind it to `Main.main` in your program. When your program is run, the I/O will be performed. It isn't possible to perform I/O from an arbitrary function, unless that function is itself in the `IO` monad and called at some point, directly or indirectly, from `Main.main`.

`IO` is a monad, so `IO` actions can be combined using either the do-notation or the `>>` and `>>=` operations from the `Monad` class.

#### Instances

Instances details

MonadIO IO | Since: base-4.9.0.0
Instance details Defined in Control.Monad.IO.Class Methods liftIO :: IO a -> IO a Source #
Alternative IO | Takes the first non-throwing `IO` action's result. `empty` throws an exception. Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods empty :: IO a Source # (<|>) :: IO a -> IO a -> IO a Source # some :: IO a -> IO [a] Source # many :: IO a -> IO [a] Source #
Applicative IO | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods pure :: a -> IO a Source # (<*>) :: IO (a -> b) -> IO a -> IO b Source # liftA2 :: (a -> b -> c) -> IO a -> IO b -> IO c Source # (*>) :: IO a -> IO b -> IO b Source # (<*) :: IO a -> IO b -> IO a Source #
Functor IO | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods fmap :: (a -> b) -> IO a -> IO b Source # (<$) :: a -> IO b -> IO a Source #
Monad IO | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods (>>=) :: IO a -> (a -> IO b) -> IO b Source # (>>) :: IO a -> IO b -> IO b Source # return :: a -> IO a Source #
MonadPlus IO | Takes the first non-throwing `IO` action's result. `mzero` throws an exception. Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods mzero :: IO a Source # mplus :: IO a -> IO a -> IO a Source #
MonadFail IO | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Control.Monad.Fail Methods fail :: String -> IO a Source #
PrimBase IO |
Instance details Defined in Control.Monad.Primitive Methods internal :: IO a -> State# (PrimState IO) -> (# State# (PrimState IO), a #) Source #
PrimMonad IO |

Instance details

Defined in Control.Monad.Primitive

Associated Types

type PrimState IO |
Instance details Defined in Control.Monad.Primitive type PrimState IO = RealWorld

Methods

primitive :: (State# (PrimState IO) -> (# State# (PrimState IO), a #)) -> IO a Source #

Quasi IO |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

qNewName :: String -> IO Name Source #

qReport :: Bool -> String -> IO () Source #

qRecover :: IO a -> IO a -> IO a Source #

qLookupName :: Bool -> String -> IO (Maybe Name) Source #

qReify :: Name -> IO Info Source #

qReifyFixity :: Name -> IO (Maybe Fixity) Source #

qReifyType :: Name -> IO Type Source #

qReifyInstances :: Name -> [Type] -> IO [Dec] Source #

qReifyRoles :: Name -> IO [Role] Source #

qReifyAnnotations :: Data a => AnnLookup -> IO [a] Source #

qReifyModule :: Module -> IO ModuleInfo Source #

qReifyConStrictness :: Name -> IO [DecidedStrictness] Source #

qLocation :: IO Loc Source #

qRunIO :: IO a -> IO a Source #

qGetPackageRoot :: IO FilePath Source #

qAddDependentFile :: FilePath -> IO () Source #

qAddTempFile :: String -> IO FilePath Source #

qAddTopDecls :: [Dec] -> IO () Source #

qAddForeignFilePath :: ForeignSrcLang -> String -> IO () Source #

qAddModFinalizer :: Q () -> IO () Source #

qAddCorePlugin :: String -> IO () Source #

qGetQ :: Typeable a => IO (Maybe a) Source #

qPutQ :: Typeable a => a -> IO () Source #

qIsExtEnabled :: Extension -> IO Bool Source #

qExtsEnabled :: IO [Extension] Source #

qPutDoc :: DocLoc -> String -> IO () Source #

qGetDoc :: DocLoc -> IO (Maybe String) Source #

Quote IO |
Instance details Defined in Language.Haskell.TH.Syntax Methods newName :: String -> IO Name Source #
MArray TArray e IO | Writes are slow in `IO`.

Instance details

Defined in Control.Concurrent.STM.TArray

Methods

getBounds :: Ix i => TArray i e -> IO (i, i) Source #

getNumElements :: Ix i => TArray i e -> IO Int Source #

newArray :: Ix i => (i, i) -> e -> IO (TArray i e) Source #

newArray_ :: Ix i => (i, i) -> IO (TArray i e) Source #

unsafeNewArray_ :: Ix i => (i, i) -> IO (TArray i e) Source #

unsafeRead :: Ix i => TArray i e -> Int -> IO e Source #

unsafeWrite :: Ix i => TArray i e -> Int -> e -> IO () Source #

a ~ () => HPrintfType (IO a) | Since: base-4.7.0.0
Instance details Defined in Text.Printf Methods hspr :: Handle -> String -> [UPrintf] -> IO a
a ~ () => PrintfType (IO a) | Since: base-4.7.0.0
Instance details Defined in Text.Printf Methods spr :: String -> [UPrintf] -> IO a
Monoid a => Monoid (IO a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods mempty :: IO a Source # mappend :: IO a -> IO a -> IO a Source # mconcat :: [IO a] -> IO a Source #
Semigroup a => Semigroup (IO a) | Since: base-4.10.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: IO a -> IO a -> IO a Source # sconcat :: NonEmpty (IO a) -> IO a Source # stimes :: Integral b => b -> IO a -> IO a Source #
HasGetter (IO a) a |
Instance details Defined in Data.StateVar Methods get :: MonadIO m => IO a -> m a #
type PrimState IO |
Instance details Defined in Control.Monad.Primitive type PrimState IO = RealWorld

class Eq a where Source #

The `Eq` class defines equality (`==`) and inequality (`/=`). All the basic datatypes exported by the Prelude are instances of `Eq`, and `Eq` may be derived for any datatype whose constituents are also instances of `Eq`.

The Haskell Report defines no laws for `Eq`. However, instances are encouraged to follow these properties:

Reflexivity
  `x == x` = `True`
Symmetry
  `x == y` = `y == x`
Transitivity
  if `x == y && y == z` = `True`, then `x == z` = `True`
Extensionality
  if `x == y` = `True` and `f` is a function whose return type is an instance of `Eq`, then `f x == f y` = `True`
Negation
  `x /= y` = `not (x == y)`

Minimal complete definition

(==) | (/=)

Methods

(==) :: a -> a -> Bool infix 4 Source #

(/=) :: a -> a -> Bool infix 4 Source #

#### Instances

Instances details

Eq PosAtomic Source # |
Instance details Defined in Game.LambdaHack.Atomic.PosAtomicRead Methods (==) :: PosAtomic -> PosAtomic -> Bool Source # (/=) :: PosAtomic -> PosAtomic -> Bool Source #
Eq ApplyItemGroup Source # |
Instance details Defined in Game.LambdaHack.Client.AI.PickActionM Methods (==) :: ApplyItemGroup -> ApplyItemGroup -> Bool Source # (/=) :: ApplyItemGroup -> ApplyItemGroup -> Bool Source #
Eq BfsDistance Source # |
Instance details Defined in Game.LambdaHack.Client.Bfs Methods (==) :: BfsDistance -> BfsDistance -> Bool Source # (/=) :: BfsDistance -> BfsDistance -> Bool Source #
Eq MoveLegal Source # |
Instance details Defined in Game.LambdaHack.Client.Bfs Methods (==) :: MoveLegal -> MoveLegal -> Bool Source # (/=) :: MoveLegal -> MoveLegal -> Bool Source #
Eq FleeViaStairsOrEscape Source # |
Instance details Defined in Game.LambdaHack.Client.BfsM Methods (==) :: FleeViaStairsOrEscape -> FleeViaStairsOrEscape -> Bool Source # (/=) :: FleeViaStairsOrEscape -> FleeViaStairsOrEscape -> Bool Source #
Eq TGoal Source # |
Instance details Defined in Game.LambdaHack.Client.State Methods (==) :: TGoal -> TGoal -> Bool Source # (/=) :: TGoal -> TGoal -> Bool Source #
Eq Target Source # |
Instance details Defined in Game.LambdaHack.Client.State Methods (==) :: Target -> Target -> Bool Source # (/=) :: Target -> Target -> Bool Source #
Eq ActorUI Source # |
Instance details Defined in Game.LambdaHack.Client.UI.ActorUI Methods (==) :: ActorUI -> ActorUI -> Bool Source # (/=) :: ActorUI -> ActorUI -> Bool Source #
Eq Animation Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Animation Methods (==) :: Animation -> Animation -> Bool Source # (/=) :: Animation -> Animation -> Bool Source #
Eq DetailLevel Source # |
Instance details Defined in Game.LambdaHack.Client.UI.EffectDescription Methods (==) :: DetailLevel -> DetailLevel -> Bool Source # (/=) :: DetailLevel -> DetailLevel -> Bool Source #
Eq ColorMode Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Frame Methods (==) :: ColorMode -> ColorMode -> Bool Source # (/=) :: ColorMode -> ColorMode -> Bool Source #
Eq SingleFrame Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Frame Methods (==) :: SingleFrame -> SingleFrame -> Bool Source # (/=) :: SingleFrame -> SingleFrame -> Bool Source #
Eq FailError Source # |
Instance details Defined in Game.LambdaHack.Client.UI.HandleHelperM Methods (==) :: FailError -> FailError -> Bool Source # (/=) :: FailError -> FailError -> Bool Source #
Eq AimModeCmd Source # |
Instance details Defined in Game.LambdaHack.Client.UI.HumanCmd Methods (==) :: AimModeCmd -> AimModeCmd -> Bool Source # (/=) :: AimModeCmd -> AimModeCmd -> Bool Source #
Eq CmdArea Source # |
Instance details Defined in Game.LambdaHack.Client.UI.HumanCmd Methods (==) :: CmdArea -> CmdArea -> Bool Source # (/=) :: CmdArea -> CmdArea -> Bool Source #
Eq CmdCategory Source # |
Instance details Defined in Game.LambdaHack.Client.UI.HumanCmd Methods (==) :: CmdCategory -> CmdCategory -> Bool Source # (/=) :: CmdCategory -> CmdCategory -> Bool Source #
Eq HumanCmd Source # |
Instance details Defined in Game.LambdaHack.Client.UI.HumanCmd Methods (==) :: HumanCmd -> HumanCmd -> Bool Source # (/=) :: HumanCmd -> HumanCmd -> Bool Source #
Eq TriggerItem Source # |
Instance details Defined in Game.LambdaHack.Client.UI.HumanCmd Methods (==) :: TriggerItem -> TriggerItem -> Bool Source # (/=) :: TriggerItem -> TriggerItem -> Bool Source #
Eq ItemDialogState Source # |
Instance details Defined in Game.LambdaHack.Client.UI.InventoryM Methods (==) :: ItemDialogState -> ItemDialogState -> Bool Source # (/=) :: ItemDialogState -> ItemDialogState -> Bool Source #
Eq KM Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Key Methods (==) :: KM -> KM -> Bool Source # (/=) :: KM -> KM -> Bool Source #
Eq Key Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Key Methods (==) :: Key -> Key -> Bool Source # (/=) :: Key -> Key -> Bool Source #
Eq Modifier Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Key Methods (==) :: Modifier -> Modifier -> Bool Source # (/=) :: Modifier -> Modifier -> Bool Source #
Eq Msg Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods (==) :: Msg -> Msg -> Bool Source # (/=) :: Msg -> Msg -> Bool Source #
Eq MsgClass Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods (==) :: MsgClass -> MsgClass -> Bool Source # (/=) :: MsgClass -> MsgClass -> Bool Source #
Eq MsgClassDistinct Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods (==) :: MsgClassDistinct -> MsgClassDistinct -> Bool Source # (/=) :: MsgClassDistinct -> MsgClassDistinct -> Bool Source #
Eq MsgClassIgnore Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods (==) :: MsgClassIgnore -> MsgClassIgnore -> Bool Source # (/=) :: MsgClassIgnore -> MsgClassIgnore -> Bool Source #
Eq MsgClassSave Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods (==) :: MsgClassSave -> MsgClassSave -> Bool Source # (/=) :: MsgClassSave -> MsgClassSave -> Bool Source #
Eq MsgClassShow Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods (==) :: MsgClassShow -> MsgClassShow -> Bool Source # (/=) :: MsgClassShow -> MsgClassShow -> Bool Source #
Eq MsgClassShowAndSave Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods (==) :: MsgClassShowAndSave -> MsgClassShowAndSave -> Bool Source # (/=) :: MsgClassShowAndSave -> MsgClassShowAndSave -> Bool Source #
Eq AttrLine Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Overlay Methods (==) :: AttrLine -> AttrLine -> Bool Source # (/=) :: AttrLine -> AttrLine -> Bool Source #
Eq DisplayFont Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Overlay Methods (==) :: DisplayFont -> DisplayFont -> Bool Source # (/=) :: DisplayFont -> DisplayFont -> Bool Source #
Eq FontSetup Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Overlay Methods (==) :: FontSetup -> FontSetup -> Bool Source # (/=) :: FontSetup -> FontSetup -> Bool Source #
Eq PointSquare Source # |
Instance details Defined in Game.LambdaHack.Client.UI.PointUI Methods (==) :: PointSquare -> PointSquare -> Bool Source # (/=) :: PointSquare -> PointSquare -> Bool Source #
Eq PointUI Source # |
Instance details Defined in Game.LambdaHack.Client.UI.PointUI Methods (==) :: PointUI -> PointUI -> Bool Source # (/=) :: PointUI -> PointUI -> Bool Source #
Eq AimMode Source # |
Instance details Defined in Game.LambdaHack.Client.UI.SessionUI Methods (==) :: AimMode -> AimMode -> Bool Source # (/=) :: AimMode -> AimMode -> Bool Source #
Eq KeyMacro Source # |
Instance details Defined in Game.LambdaHack.Client.UI.SessionUI Methods (==) :: KeyMacro -> KeyMacro -> Bool Source # (/=) :: KeyMacro -> KeyMacro -> Bool Source #
Eq ReqDelay Source # |
Instance details Defined in Game.LambdaHack.Client.UI.SessionUI Methods (==) :: ReqDelay -> ReqDelay -> Bool Source # (/=) :: ReqDelay -> ReqDelay -> Bool Source #
Eq ButtonWidth Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Slideshow Methods (==) :: ButtonWidth -> ButtonWidth -> Bool Source # (/=) :: ButtonWidth -> ButtonWidth -> Bool Source #
Eq MenuSlot Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Slideshow Methods (==) :: MenuSlot -> MenuSlot -> Bool Source # (/=) :: MenuSlot -> MenuSlot -> Bool Source #
Eq Slideshow Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Slideshow Methods (==) :: Slideshow -> Slideshow -> Bool Source # (/=) :: Slideshow -> Slideshow -> Bool Source #
Eq Threat Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Watch.WatchUpdAtomicM Methods (==) :: Threat -> Threat -> Bool Source # (/=) :: Threat -> Threat -> Bool Source #
Eq Actor Source # |
Instance details Defined in Game.LambdaHack.Common.Actor Methods (==) :: Actor -> Actor -> Bool Source # (/=) :: Actor -> Actor -> Bool Source #
Eq ResDelta Source # |
Instance details Defined in Game.LambdaHack.Common.Actor Methods (==) :: ResDelta -> ResDelta -> Bool Source # (/=) :: ResDelta -> ResDelta -> Bool Source #
Eq Watchfulness Source # |
Instance details Defined in Game.LambdaHack.Common.Actor Methods (==) :: Watchfulness -> Watchfulness -> Bool Source # (/=) :: Watchfulness -> Watchfulness -> Bool Source #
Eq Analytics Source # |
Instance details Defined in Game.LambdaHack.Common.Analytics Methods (==) :: Analytics -> Analytics -> Bool Source # (/=) :: Analytics -> Analytics -> Bool Source #
Eq KillHow Source # |
Instance details Defined in Game.LambdaHack.Common.Analytics Methods (==) :: KillHow -> KillHow -> Bool Source # (/=) :: KillHow -> KillHow -> Bool Source #
Eq Area Source # |
Instance details Defined in Game.LambdaHack.Common.Area Methods (==) :: Area -> Area -> Bool Source # (/=) :: Area -> Area -> Bool Source #
Eq ClientOptions Source # |
Instance details Defined in Game.LambdaHack.Common.ClientOptions Methods (==) :: ClientOptions -> ClientOptions -> Bool Source # (/=) :: ClientOptions -> ClientOptions -> Bool Source #
Eq FullscreenMode Source # |
Instance details Defined in Game.LambdaHack.Common.ClientOptions Methods (==) :: FullscreenMode -> FullscreenMode -> Bool Source # (/=) :: FullscreenMode -> FullscreenMode -> Bool Source #
Eq Challenge Source # |
Instance details Defined in Game.LambdaHack.Common.Faction Methods (==) :: Challenge -> Challenge -> Bool Source # (/=) :: Challenge -> Challenge -> Bool Source #
Eq Diplomacy Source # |
Instance details Defined in Game.LambdaHack.Common.Faction Methods (==) :: Diplomacy -> Diplomacy -> Bool Source # (/=) :: Diplomacy -> Diplomacy -> Bool Source #
Eq Faction Source # |
Instance details Defined in Game.LambdaHack.Common.Faction Methods (==) :: Faction -> Faction -> Bool Source # (/=) :: Faction -> Faction -> Bool Source #
Eq Status Source # |
Instance details Defined in Game.LambdaHack.Common.Faction Methods (==) :: Status -> Status -> Bool Source # (/=) :: Status -> Status -> Bool Source #
Eq ScoreRecord Source # |
Instance details Defined in Game.LambdaHack.Common.HighScore Methods (==) :: ScoreRecord -> ScoreRecord -> Bool Source # (/=) :: ScoreRecord -> ScoreRecord -> Bool Source #
Eq ScoreTable Source # |
Instance details Defined in Game.LambdaHack.Common.HighScore Methods (==) :: ScoreTable -> ScoreTable -> Bool Source # (/=) :: ScoreTable -> ScoreTable -> Bool Source #
Eq Item Source # |
Instance details Defined in Game.LambdaHack.Common.Item Methods (==) :: Item -> Item -> Bool Source # (/=) :: Item -> Item -> Bool Source #
Eq ItemDisco Source # |
Instance details Defined in Game.LambdaHack.Common.Item Methods (==) :: ItemDisco -> ItemDisco -> Bool Source # (/=) :: ItemDisco -> ItemDisco -> Bool Source #
Eq ItemIdentity Source # |
Instance details Defined in Game.LambdaHack.Common.Item Methods (==) :: ItemIdentity -> ItemIdentity -> Bool Source # (/=) :: ItemIdentity -> ItemIdentity -> Bool Source #
Eq ItemKindIx Source # |
Instance details Defined in Game.LambdaHack.Common.Item Methods (==) :: ItemKindIx -> ItemKindIx -> Bool Source # (/=) :: ItemKindIx -> ItemKindIx -> Bool Source #
Eq ItemTimer Source # |
Instance details Defined in Game.LambdaHack.Common.Item Methods (==) :: ItemTimer -> ItemTimer -> Bool Source # (/=) :: ItemTimer -> ItemTimer -> Bool Source #
Eq AspectRecord Source # |
Instance details Defined in Game.LambdaHack.Common.ItemAspect Methods (==) :: AspectRecord -> AspectRecord -> Bool Source # (/=) :: AspectRecord -> AspectRecord -> Bool Source #
Eq KindMean Source # |
Instance details Defined in Game.LambdaHack.Common.ItemAspect Methods (==) :: KindMean -> KindMean -> Bool Source # (/=) :: KindMean -> KindMean -> Bool Source #
Eq COps Source # |
Instance details Defined in Game.LambdaHack.Common.Kind Methods (==) :: COps -> COps -> Bool Source # (/=) :: COps -> COps -> Bool Source #
Eq Level Source # |
Instance details Defined in Game.LambdaHack.Common.Level Methods (==) :: Level -> Level -> Bool Source # (/=) :: Level -> Level -> Bool Source #
Eq FontDefinition Source # |
Instance details Defined in Game.LambdaHack.Common.Misc Methods (==) :: FontDefinition -> FontDefinition -> Bool Source # (/=) :: FontDefinition -> FontDefinition -> Bool Source #
Eq FontSet Source # |
Instance details Defined in Game.LambdaHack.Common.Misc Methods (==) :: FontSet -> FontSet -> Bool Source # (/=) :: FontSet -> FontSet -> Bool Source #
Eq HintingMode Source # |
Instance details Defined in Game.LambdaHack.Common.Misc Methods (==) :: HintingMode -> HintingMode -> Bool Source # (/=) :: HintingMode -> HintingMode -> Bool Source #
Eq PerSmelled Source # |
Instance details Defined in Game.LambdaHack.Common.Perception Methods (==) :: PerSmelled -> PerSmelled -> Bool Source # (/=) :: PerSmelled -> PerSmelled -> Bool Source #
Eq PerVisible Source # |
Instance details Defined in Game.LambdaHack.Common.Perception Methods (==) :: PerVisible -> PerVisible -> Bool Source # (/=) :: PerVisible -> PerVisible -> Bool Source #
Eq Perception Source # |
Instance details Defined in Game.LambdaHack.Common.Perception Methods (==) :: Perception -> Perception -> Bool Source # (/=) :: Perception -> Perception -> Bool Source #
Eq Point Source # |
Instance details Defined in Game.LambdaHack.Common.Point Methods (==) :: Point -> Point -> Bool Source # (/=) :: Point -> Point -> Bool Source #
Eq ReqFailure Source # |
Instance details Defined in Game.LambdaHack.Common.ReqFailure Methods (==) :: ReqFailure -> ReqFailure -> Bool Source # (/=) :: ReqFailure -> ReqFailure -> Bool Source #
Eq State Source # |
Instance details Defined in Game.LambdaHack.Common.State Methods (==) :: State -> State -> Bool Source # (/=) :: State -> State -> Bool Source #
Eq Speed Source # |
Instance details Defined in Game.LambdaHack.Common.Time Methods (==) :: Speed -> Speed -> Bool Source # (/=) :: Speed -> Speed -> Bool Source #
Eq Time Source # |
Instance details Defined in Game.LambdaHack.Common.Time Methods (==) :: Time -> Time -> Bool Source # (/=) :: Time -> Time -> Bool Source #
Eq ActorId Source # |
Instance details Defined in Game.LambdaHack.Common.Types Methods (==) :: ActorId -> ActorId -> Bool Source # (/=) :: ActorId -> ActorId -> Bool Source #
Eq Container Source # |
Instance details Defined in Game.LambdaHack.Common.Types Methods (==) :: Container -> Container -> Bool Source # (/=) :: Container -> Container -> Bool Source #
Eq FactionId Source # |
Instance details Defined in Game.LambdaHack.Common.Types Methods (==) :: FactionId -> FactionId -> Bool Source # (/=) :: FactionId -> FactionId -> Bool Source #
Eq ItemId Source # |
Instance details Defined in Game.LambdaHack.Common.Types Methods (==) :: ItemId -> ItemId -> Bool Source # (/=) :: ItemId -> ItemId -> Bool Source #
Eq LevelId Source # |
Instance details Defined in Game.LambdaHack.Common.Types Methods (==) :: LevelId -> LevelId -> Bool Source # (/=) :: LevelId -> LevelId -> Bool Source #
Eq Vector Source # |
Instance details Defined in Game.LambdaHack.Common.Vector Methods (==) :: Vector -> Vector -> Bool Source # (/=) :: Vector -> Vector -> Bool Source #
Eq InitSleep Source # |
Instance details Defined in Game.LambdaHack.Content.CaveKind Methods (==) :: InitSleep -> InitSleep -> Bool Source # (/=) :: InitSleep -> InitSleep -> Bool Source #
Eq FactionKind Source # |
Instance details Defined in Game.LambdaHack.Content.FactionKind Methods (==) :: FactionKind -> FactionKind -> Bool Source # (/=) :: FactionKind -> FactionKind -> Bool Source #
Eq HiIndeterminant Source # |
Instance details Defined in Game.LambdaHack.Content.FactionKind Methods (==) :: HiIndeterminant -> HiIndeterminant -> Bool Source # (/=) :: HiIndeterminant -> HiIndeterminant -> Bool Source #
Eq Outcome Source # |
Instance details Defined in Game.LambdaHack.Content.FactionKind Methods (==) :: Outcome -> Outcome -> Bool Source # (/=) :: Outcome -> Outcome -> Bool Source #
Eq TeamContinuity Source # |
Instance details Defined in Game.LambdaHack.Content.FactionKind Methods (==) :: TeamContinuity -> TeamContinuity -> Bool Source # (/=) :: TeamContinuity -> TeamContinuity -> Bool Source #
Eq Aspect Source # |
Instance details Defined in Game.LambdaHack.Content.ItemKind Methods (==) :: Aspect -> Aspect -> Bool Source # (/=) :: Aspect -> Aspect -> Bool Source #
Eq Condition Source # |
Instance details Defined in Game.LambdaHack.Content.ItemKind Methods (==) :: Condition -> Condition -> Bool Source # (/=) :: Condition -> Condition -> Bool Source #
Eq DetectKind Source # |
Instance details Defined in Game.LambdaHack.Content.ItemKind Methods (==) :: DetectKind -> DetectKind -> Bool Source # (/=) :: DetectKind -> DetectKind -> Bool Source #
Eq Effect Source # |
Instance details Defined in Game.LambdaHack.Content.ItemKind Methods (==) :: Effect -> Effect -> Bool Source # (/=) :: Effect -> Effect -> Bool Source #
Eq ThrowMod Source # |
Instance details Defined in Game.LambdaHack.Content.ItemKind Methods (==) :: ThrowMod -> ThrowMod -> Bool Source # (/=) :: ThrowMod -> ThrowMod -> Bool Source #
Eq TimerDice Source # |
Instance details Defined in Game.LambdaHack.Content.ItemKind Methods (==) :: TimerDice -> TimerDice -> Bool Source # (/=) :: TimerDice -> TimerDice -> Bool Source #
Eq Cover Source # |
Instance details Defined in Game.LambdaHack.Content.PlaceKind Methods (==) :: Cover -> Cover -> Bool Source # (/=) :: Cover -> Cover -> Bool Source #
Eq Fence Source # |
Instance details Defined in Game.LambdaHack.Content.PlaceKind Methods (==) :: Fence -> Fence -> Bool Source # (/=) :: Fence -> Fence -> Bool Source #
Eq PlaceEntry Source # |
Instance details Defined in Game.LambdaHack.Content.PlaceKind Methods (==) :: PlaceEntry -> PlaceEntry -> Bool Source # (/=) :: PlaceEntry -> PlaceEntry -> Bool Source #
Eq Feature Source # |
Instance details Defined in Game.LambdaHack.Content.TileKind Methods (==) :: Feature -> Feature -> Bool Source # (/=) :: Feature -> Feature -> Bool Source #
Eq ProjectileTriggers Source # |
Instance details Defined in Game.LambdaHack.Content.TileKind Methods (==) :: ProjectileTriggers -> ProjectileTriggers -> Bool Source # (/=) :: ProjectileTriggers -> ProjectileTriggers -> Bool Source #
Eq AbsDepth Source # |
Instance details Defined in Game.LambdaHack.Core.Dice Methods (==) :: AbsDepth -> AbsDepth -> Bool Source # (/=) :: AbsDepth -> AbsDepth -> Bool Source #
Eq Dice Source # |
Instance details Defined in Game.LambdaHack.Core.Dice Methods (==) :: Dice -> Dice -> Bool Source # (/=) :: Dice -> Dice -> Bool Source #
Eq ActivationFlag Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods (==) :: ActivationFlag -> ActivationFlag -> Bool Source # (/=) :: ActivationFlag -> ActivationFlag -> Bool Source #
Eq Doctrine Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods (==) :: Doctrine -> Doctrine -> Bool Source # (/=) :: Doctrine -> Doctrine -> Bool Source #
Eq EqpSlot Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods (==) :: EqpSlot -> EqpSlot -> Bool Source # (/=) :: EqpSlot -> EqpSlot -> Bool Source #
Eq Flag Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods (==) :: Flag -> Flag -> Bool Source # (/=) :: Flag -> Flag -> Bool Source #
Eq Flags Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods (==) :: Flags -> Flags -> Bool Source # (/=) :: Flags -> Flags -> Bool Source #
Eq Skill Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods (==) :: Skill -> Skill -> Bool Source # (/=) :: Skill -> Skill -> Bool Source #
Eq Skills Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods (==) :: Skills -> Skills -> Bool Source # (/=) :: Skills -> Skills -> Bool Source #
Eq Attr Source # |
Instance details Defined in Game.LambdaHack.Definition.Color Methods (==) :: Attr -> Attr -> Bool Source # (/=) :: Attr -> Attr -> Bool Source #
Eq AttrChar Source # |
Instance details Defined in Game.LambdaHack.Definition.Color Methods (==) :: AttrChar -> AttrChar -> Bool Source # (/=) :: AttrChar -> AttrChar -> Bool Source #
Eq AttrCharW32 Source # |
Instance details Defined in Game.LambdaHack.Definition.Color Methods (==) :: AttrCharW32 -> AttrCharW32 -> Bool Source # (/=) :: AttrCharW32 -> AttrCharW32 -> Bool Source #
Eq Color Source # |
Instance details Defined in Game.LambdaHack.Definition.Color Methods (==) :: Color -> Color -> Bool Source # (/=) :: Color -> Color -> Bool Source #
Eq Highlight Source # |
Instance details Defined in Game.LambdaHack.Definition.Color Methods (==) :: Highlight -> Highlight -> Bool Source # (/=) :: Highlight -> Highlight -> Bool Source #
Eq CStore Source # |
Instance details Defined in Game.LambdaHack.Definition.Defs Methods (==) :: CStore -> CStore -> Bool Source # (/=) :: CStore -> CStore -> Bool Source #
Eq Direction Source # |
Instance details Defined in Game.LambdaHack.Definition.Defs Methods (==) :: Direction -> Direction -> Bool Source # (/=) :: Direction -> Direction -> Bool Source #
Eq ItemDialogMode Source # |
Instance details Defined in Game.LambdaHack.Definition.Defs Methods (==) :: ItemDialogMode -> ItemDialogMode -> Bool Source # (/=) :: ItemDialogMode -> ItemDialogMode -> Bool Source #
Eq SLore Source # |
Instance details Defined in Game.LambdaHack.Definition.Defs Methods (==) :: SLore -> SLore -> Bool Source # (/=) :: SLore -> SLore -> Bool Source #
Eq FancyName Source # |
Instance details Defined in Game.LambdaHack.Definition.Flavour Methods (==) :: FancyName -> FancyName -> Bool Source # (/=) :: FancyName -> FancyName -> Bool Source #
Eq Flavour Source # |
Instance details Defined in Game.LambdaHack.Definition.Flavour Methods (==) :: Flavour -> Flavour -> Bool Source # (/=) :: Flavour -> Flavour -> Bool Source #
Eq HV Source # |
Instance details Defined in Game.LambdaHack.Server.DungeonGen.AreaRnd Methods (==) :: HV -> HV -> Bool Source # (/=) :: HV -> HV -> Bool Source #
Eq CacheBeforeLucid Source # |
Instance details Defined in Game.LambdaHack.Server.Fov Methods (==) :: CacheBeforeLucid -> CacheBeforeLucid -> Bool Source # (/=) :: CacheBeforeLucid -> CacheBeforeLucid -> Bool Source #
Eq FovClear Source # |
Instance details Defined in Game.LambdaHack.Server.Fov Methods (==) :: FovClear -> FovClear -> Bool Source # (/=) :: FovClear -> FovClear -> Bool Source #
Eq FovLit Source # |
Instance details Defined in Game.LambdaHack.Server.Fov Methods (==) :: FovLit -> FovLit -> Bool Source # (/=) :: FovLit -> FovLit -> Bool Source #
Eq FovLucid Source # |
Instance details Defined in Game.LambdaHack.Server.Fov Methods (==) :: FovLucid -> FovLucid -> Bool Source # (/=) :: FovLucid -> FovLucid -> Bool Source #
Eq FovShine Source # |
Instance details Defined in Game.LambdaHack.Server.Fov Methods (==) :: FovShine -> FovShine -> Bool Source # (/=) :: FovShine -> FovShine -> Bool Source #
Eq PerReachable Source # |
Instance details Defined in Game.LambdaHack.Server.Fov Methods (==) :: PerReachable -> PerReachable -> Bool Source # (/=) :: PerReachable -> PerReachable -> Bool Source #
Eq PerceptionCache Source # |
Instance details Defined in Game.LambdaHack.Server.Fov Methods (==) :: PerceptionCache -> PerceptionCache -> Bool Source # (/=) :: PerceptionCache -> PerceptionCache -> Bool Source #
Eq EffToUse Source # |
Instance details Defined in Game.LambdaHack.Server.HandleEffectM Methods (==) :: EffToUse -> EffToUse -> Bool Source # (/=) :: EffToUse -> EffToUse -> Bool Source #
Eq UseResult Source # |
Instance details Defined in Game.LambdaHack.Server.HandleEffectM Methods (==) :: UseResult -> UseResult -> Bool Source # (/=) :: UseResult -> UseResult -> Bool Source #
Eq ItemKnown Source # |
Instance details Defined in Game.LambdaHack.Server.ItemRev Methods (==) :: ItemKnown -> ItemKnown -> Bool Source # (/=) :: ItemKnown -> ItemKnown -> Bool Source #
Eq Shrunk |
Instance details Defined in Test.QuickCheck.Function Methods (==) :: Shrunk -> Shrunk -> Bool Source # (/=) :: Shrunk -> Shrunk -> Bool Source #
Eq ASCIIString |
Instance details Defined in Test.QuickCheck.Modifiers Methods (==) :: ASCIIString -> ASCIIString -> Bool Source # (/=) :: ASCIIString -> ASCIIString -> Bool Source #
Eq PrintableString |
Instance details Defined in Test.QuickCheck.Modifiers Methods (==) :: PrintableString -> PrintableString -> Bool Source # (/=) :: PrintableString -> PrintableString -> Bool Source #
Eq UnicodeString |
Instance details Defined in Test.QuickCheck.Modifiers Methods (==) :: UnicodeString -> UnicodeString -> Bool Source # (/=) :: UnicodeString -> UnicodeString -> Bool Source #
Eq A |
Instance details Defined in Test.QuickCheck.Poly Methods (==) :: A -> A -> Bool Source # (/=) :: A -> A -> Bool Source #
Eq B |
Instance details Defined in Test.QuickCheck.Poly Methods (==) :: B -> B -> Bool Source # (/=) :: B -> B -> Bool Source #
Eq C |
Instance details Defined in Test.QuickCheck.Poly Methods (==) :: C -> C -> Bool Source # (/=) :: C -> C -> Bool Source #
Eq OrdA |
Instance details Defined in Test.QuickCheck.Poly Methods (==) :: OrdA -> OrdA -> Bool Source # (/=) :: OrdA -> OrdA -> Bool Source #
Eq OrdB |
Instance details Defined in Test.QuickCheck.Poly Methods (==) :: OrdB -> OrdB -> Bool Source # (/=) :: OrdB -> OrdB -> Bool Source #
Eq OrdC |
Instance details Defined in Test.QuickCheck.Poly Methods (==) :: OrdC -> OrdC -> Bool Source # (/=) :: OrdC -> OrdC -> Bool Source #
Eq DotNetTime |
Instance details Defined in Data.Aeson.Types.Internal Methods (==) :: DotNetTime -> DotNetTime -> Bool Source # (/=) :: DotNetTime -> DotNetTime -> Bool Source #
Eq JSONPathElement |
Instance details Defined in Data.Aeson.Types.Internal Methods (==) :: JSONPathElement -> JSONPathElement -> Bool Source # (/=) :: JSONPathElement -> JSONPathElement -> Bool Source #
Eq SumEncoding |
Instance details Defined in Data.Aeson.Types.Internal Methods (==) :: SumEncoding -> SumEncoding -> Bool Source # (/=) :: SumEncoding -> SumEncoding -> Bool Source #
Eq Value |
Instance details Defined in Data.Aeson.Types.Internal Methods (==) :: Value -> Value -> Bool Source # (/=) :: Value -> Value -> Bool Source #
Eq BlinkSpeed |
Instance details Defined in System.Console.ANSI.Types Methods (==) :: BlinkSpeed -> BlinkSpeed -> Bool Source # (/=) :: BlinkSpeed -> BlinkSpeed -> Bool Source #
Eq Color |
Instance details Defined in System.Console.ANSI.Types Methods (==) :: Color -> Color -> Bool Source # (/=) :: Color -> Color -> Bool Source #
Eq ColorIntensity |
Instance details Defined in System.Console.ANSI.Types Methods (==) :: ColorIntensity -> ColorIntensity -> Bool Source # (/=) :: ColorIntensity -> ColorIntensity -> Bool Source #
Eq ConsoleIntensity |
Instance details Defined in System.Console.ANSI.Types Methods (==) :: ConsoleIntensity -> ConsoleIntensity -> Bool Source # (/=) :: ConsoleIntensity -> ConsoleIntensity -> Bool Source #
Eq ConsoleLayer |
Instance details Defined in System.Console.ANSI.Types Methods (==) :: ConsoleLayer -> ConsoleLayer -> Bool Source # (/=) :: ConsoleLayer -> ConsoleLayer -> Bool Source #
Eq SGR |
Instance details Defined in System.Console.ANSI.Types Methods (==) :: SGR -> SGR -> Bool Source # (/=) :: SGR -> SGR -> Bool Source #
Eq Underlining |
Instance details Defined in System.Console.ANSI.Types Methods (==) :: Underlining -> Underlining -> Bool Source # (/=) :: Underlining -> Underlining -> Bool Source #
Eq AsyncCancelled |
Instance details Defined in Control.Concurrent.Async.Internal Methods (==) :: AsyncCancelled -> AsyncCancelled -> Bool Source # (/=) :: AsyncCancelled -> AsyncCancelled -> Bool Source #
Eq ByteArray | Since: base-4.17.0.0
Instance details Defined in Data.Array.Byte Methods (==) :: ByteArray -> ByteArray -> Bool Source # (/=) :: ByteArray -> ByteArray -> Bool Source #
Eq Timeout |
Instance details Defined in System.Timeout Methods (==) :: Timeout -> Timeout -> Bool Source # (/=) :: Timeout -> Timeout -> Bool Source #
Eq ByteString |
Instance details Defined in Data.ByteString.Internal.Type Methods (==) :: ByteString -> ByteString -> Bool Source # (/=) :: ByteString -> ByteString -> Bool Source #
Eq ByteString |
Instance details Defined in Data.ByteString.Lazy.Internal Methods (==) :: ByteString -> ByteString -> Bool Source # (/=) :: ByteString -> ByteString -> Bool Source #
Eq ShortByteString |
Instance details Defined in Data.ByteString.Short.Internal Methods (==) :: ShortByteString -> ShortByteString -> Bool Source # (/=) :: ShortByteString -> ShortByteString -> Bool Source #
Eq IntSet |
Instance details Defined in Data.IntSet.Internal Methods (==) :: IntSet -> IntSet -> Bool Source # (/=) :: IntSet -> IntSet -> Bool Source #
Eq BigNat |
Instance details Defined in GHC.Num.BigNat Methods (==) :: BigNat -> BigNat -> Bool Source # (/=) :: BigNat -> BigNat -> Bool Source #
Eq ForeignSrcLang |
Instance details Defined in GHC.ForeignSrcLang.Type Methods (==) :: ForeignSrcLang -> ForeignSrcLang -> Bool Source # (/=) :: ForeignSrcLang -> ForeignSrcLang -> Bool Source #
Eq Extension |
Instance details Defined in GHC.LanguageExtensions.Type Methods (==) :: Extension -> Extension -> Bool Source # (/=) :: Extension -> Extension -> Bool Source #
Eq Void | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Base Methods (==) :: Void -> Void -> Bool Source # (/=) :: Void -> Void -> Bool Source #
Eq ByteOrder | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.ByteOrder Methods (==) :: ByteOrder -> ByteOrder -> Bool Source # (/=) :: ByteOrder -> ByteOrder -> Bool Source #
Eq BlockReason | Since: base-4.3.0.0
Instance details Defined in GHC.Internal.Conc.Sync Methods (==) :: BlockReason -> BlockReason -> Bool Source # (/=) :: BlockReason -> BlockReason -> Bool Source #
Eq ThreadId | Since: base-4.2.0.0
Instance details Defined in GHC.Internal.Conc.Sync Methods (==) :: ThreadId -> ThreadId -> Bool Source # (/=) :: ThreadId -> ThreadId -> Bool Source #
Eq ThreadStatus | Since: base-4.3.0.0
Instance details Defined in GHC.Internal.Conc.Sync Methods (==) :: ThreadStatus -> ThreadStatus -> Bool Source # (/=) :: ThreadStatus -> ThreadStatus -> Bool Source #
Eq All | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (==) :: All -> All -> Bool Source # (/=) :: All -> All -> Bool Source #
Eq Any | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (==) :: Any -> Any -> Bool Source # (/=) :: Any -> Any -> Bool Source #
Eq SomeTypeRep |
Instance details Defined in GHC.Internal.Data.Typeable.Internal Methods (==) :: SomeTypeRep -> SomeTypeRep -> Bool Source # (/=) :: SomeTypeRep -> SomeTypeRep -> Bool Source #
Eq Version | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Version Methods (==) :: Version -> Version -> Bool Source # (/=) :: Version -> Version -> Bool Source #
Eq ErrorCall | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Exception Methods (==) :: ErrorCall -> ErrorCall -> Bool Source # (/=) :: ErrorCall -> ErrorCall -> Bool Source #
Eq ArithException | Since: base-3.0
Instance details Defined in GHC.Internal.Exception.Type Methods (==) :: ArithException -> ArithException -> Bool Source # (/=) :: ArithException -> ArithException -> Bool Source #
Eq CBool |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CBool -> CBool -> Bool Source # (/=) :: CBool -> CBool -> Bool Source #
Eq CChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CChar -> CChar -> Bool Source # (/=) :: CChar -> CChar -> Bool Source #
Eq CClock |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CClock -> CClock -> Bool Source # (/=) :: CClock -> CClock -> Bool Source #
Eq CDouble |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CDouble -> CDouble -> Bool Source # (/=) :: CDouble -> CDouble -> Bool Source #
Eq CFloat |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CFloat -> CFloat -> Bool Source # (/=) :: CFloat -> CFloat -> Bool Source #
Eq CInt |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CInt -> CInt -> Bool Source # (/=) :: CInt -> CInt -> Bool Source #
Eq CIntMax |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CIntMax -> CIntMax -> Bool Source # (/=) :: CIntMax -> CIntMax -> Bool Source #
Eq CIntPtr |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CIntPtr -> CIntPtr -> Bool Source # (/=) :: CIntPtr -> CIntPtr -> Bool Source #
Eq CLLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CLLong -> CLLong -> Bool Source # (/=) :: CLLong -> CLLong -> Bool Source #
Eq CLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CLong -> CLong -> Bool Source # (/=) :: CLong -> CLong -> Bool Source #
Eq CPtrdiff |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CPtrdiff -> CPtrdiff -> Bool Source # (/=) :: CPtrdiff -> CPtrdiff -> Bool Source #
Eq CSChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CSChar -> CSChar -> Bool Source # (/=) :: CSChar -> CSChar -> Bool Source #
Eq CSUSeconds |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CSUSeconds -> CSUSeconds -> Bool Source # (/=) :: CSUSeconds -> CSUSeconds -> Bool Source #
Eq CShort |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CShort -> CShort -> Bool Source # (/=) :: CShort -> CShort -> Bool Source #
Eq CSigAtomic |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CSigAtomic -> CSigAtomic -> Bool Source # (/=) :: CSigAtomic -> CSigAtomic -> Bool Source #
Eq CSize |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CSize -> CSize -> Bool Source # (/=) :: CSize -> CSize -> Bool Source #
Eq CTime |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CTime -> CTime -> Bool Source # (/=) :: CTime -> CTime -> Bool Source #
Eq CUChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CUChar -> CUChar -> Bool Source # (/=) :: CUChar -> CUChar -> Bool Source #
Eq CUInt |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CUInt -> CUInt -> Bool Source # (/=) :: CUInt -> CUInt -> Bool Source #
Eq CUIntMax |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CUIntMax -> CUIntMax -> Bool Source # (/=) :: CUIntMax -> CUIntMax -> Bool Source #
Eq CUIntPtr |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CUIntPtr -> CUIntPtr -> Bool Source # (/=) :: CUIntPtr -> CUIntPtr -> Bool Source #
Eq CULLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CULLong -> CULLong -> Bool Source # (/=) :: CULLong -> CULLong -> Bool Source #
Eq CULong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CULong -> CULong -> Bool Source # (/=) :: CULong -> CULong -> Bool Source #
Eq CUSeconds |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CUSeconds -> CUSeconds -> Bool Source # (/=) :: CUSeconds -> CUSeconds -> Bool Source #
Eq CUShort |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CUShort -> CUShort -> Bool Source # (/=) :: CUShort -> CUShort -> Bool Source #
Eq CWchar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (==) :: CWchar -> CWchar -> Bool Source # (/=) :: CWchar -> CWchar -> Bool Source #
Eq Associativity | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: Associativity -> Associativity -> Bool Source # (/=) :: Associativity -> Associativity -> Bool Source #
Eq DecidedStrictness | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: DecidedStrictness -> DecidedStrictness -> Bool Source # (/=) :: DecidedStrictness -> DecidedStrictness -> Bool Source #
Eq Fixity | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: Fixity -> Fixity -> Bool Source # (/=) :: Fixity -> Fixity -> Bool Source #
Eq SourceStrictness | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: SourceStrictness -> SourceStrictness -> Bool Source # (/=) :: SourceStrictness -> SourceStrictness -> Bool Source #
Eq SourceUnpackedness | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: SourceUnpackedness -> SourceUnpackedness -> Bool Source # (/=) :: SourceUnpackedness -> SourceUnpackedness -> Bool Source #
Eq MaskingState | Since: base-4.3.0.0
Instance details Defined in GHC.Internal.IO Methods (==) :: MaskingState -> MaskingState -> Bool Source # (/=) :: MaskingState -> MaskingState -> Bool Source #
Eq BufferState | Since: base-4.2.0.0
Instance details Defined in GHC.Internal.IO.Buffer Methods (==) :: BufferState -> BufferState -> Bool Source # (/=) :: BufferState -> BufferState -> Bool Source #
Eq CodingProgress | Since: base-4.4.0.0
Instance details Defined in GHC.Internal.IO.Encoding.Types Methods (==) :: CodingProgress -> CodingProgress -> Bool Source # (/=) :: CodingProgress -> CodingProgress -> Bool Source #
Eq ArrayException | Since: base-4.2.0.0
Instance details Defined in GHC.Internal.IO.Exception Methods (==) :: ArrayException -> ArrayException -> Bool Source # (/=) :: ArrayException -> ArrayException -> Bool Source #
Eq AsyncException | Since: base-4.2.0.0
Instance details Defined in GHC.Internal.IO.Exception Methods (==) :: AsyncException -> AsyncException -> Bool Source # (/=) :: AsyncException -> AsyncException -> Bool Source #
Eq ExitCode |
Instance details Defined in GHC.Internal.IO.Exception Methods (==) :: ExitCode -> ExitCode -> Bool Source # (/=) :: ExitCode -> ExitCode -> Bool Source #
Eq IOErrorType | Since: base-4.1.0.0
Instance details Defined in GHC.Internal.IO.Exception Methods (==) :: IOErrorType -> IOErrorType -> Bool Source # (/=) :: IOErrorType -> IOErrorType -> Bool Source #
Eq IOException | Since: base-4.1.0.0
Instance details Defined in GHC.Internal.IO.Exception Methods (==) :: IOException -> IOException -> Bool Source # (/=) :: IOException -> IOException -> Bool Source #
Eq HandlePosn | Since: base-4.1.0.0
Instance details Defined in GHC.Internal.IO.Handle Methods (==) :: HandlePosn -> HandlePosn -> Bool Source # (/=) :: HandlePosn -> HandlePosn -> Bool Source #
Eq BufferMode | Since: base-4.2.0.0
Instance details Defined in GHC.Internal.IO.Handle.Types Methods (==) :: BufferMode -> BufferMode -> Bool Source # (/=) :: BufferMode -> BufferMode -> Bool Source #
Eq Handle | Since: base-4.1.0.0
Instance details Defined in GHC.Internal.IO.Handle.Types Methods (==) :: Handle -> Handle -> Bool Source # (/=) :: Handle -> Handle -> Bool Source #
Eq Newline | Since: base-4.2.0.0
Instance details Defined in GHC.Internal.IO.Handle.Types Methods (==) :: Newline -> Newline -> Bool Source # (/=) :: Newline -> Newline -> Bool Source #
Eq NewlineMode | Since: base-4.2.0.0
Instance details Defined in GHC.Internal.IO.Handle.Types Methods (==) :: NewlineMode -> NewlineMode -> Bool Source # (/=) :: NewlineMode -> NewlineMode -> Bool Source #
Eq IOMode | Since: base-4.2.0.0
Instance details Defined in GHC.Internal.IO.IOMode Methods (==) :: IOMode -> IOMode -> Bool Source # (/=) :: IOMode -> IOMode -> Bool Source #
Eq Int16 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods (==) :: Int16 -> Int16 -> Bool Source # (/=) :: Int16 -> Int16 -> Bool Source #
Eq Int32 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods (==) :: Int32 -> Int32 -> Bool Source # (/=) :: Int32 -> Int32 -> Bool Source #
Eq Int64 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods (==) :: Int64 -> Int64 -> Bool Source # (/=) :: Int64 -> Int64 -> Bool Source #
Eq Int8 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods (==) :: Int8 -> Int8 -> Bool Source # (/=) :: Int8 -> Int8 -> Bool Source #
Eq IoSubSystem |
Instance details Defined in GHC.Internal.RTS.Flags Methods (==) :: IoSubSystem -> IoSubSystem -> Bool Source # (/=) :: IoSubSystem -> IoSubSystem -> Bool Source #
Eq SrcLoc | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Stack.Types Methods (==) :: SrcLoc -> SrcLoc -> Bool Source # (/=) :: SrcLoc -> SrcLoc -> Bool Source #
Eq Lexeme | Since: base-2.1
Instance details Defined in GHC.Internal.Text.Read.Lex Methods (==) :: Lexeme -> Lexeme -> Bool Source # (/=) :: Lexeme -> Lexeme -> Bool Source #
Eq Number | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Text.Read.Lex Methods (==) :: Number -> Number -> Bool Source # (/=) :: Number -> Number -> Bool Source #
Eq SomeNat | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.TypeNats Methods (==) :: SomeNat -> SomeNat -> Bool Source # (/=) :: SomeNat -> SomeNat -> Bool Source #
Eq GeneralCategory | Since: base-2.1
Instance details Defined in GHC.Internal.Unicode Methods (==) :: GeneralCategory -> GeneralCategory -> Bool Source # (/=) :: GeneralCategory -> GeneralCategory -> Bool Source #
Eq Word16 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods (==) :: Word16 -> Word16 -> Bool Source # (/=) :: Word16 -> Word16 -> Bool Source #
Eq Word32 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods (==) :: Word32 -> Word32 -> Bool Source # (/=) :: Word32 -> Word32 -> Bool Source #
Eq Word64 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods (==) :: Word64 -> Word64 -> Bool Source # (/=) :: Word64 -> Word64 -> Bool Source #
Eq Word8 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods (==) :: Word8 -> Word8 -> Bool Source # (/=) :: Word8 -> Word8 -> Bool Source #
Eq Module |
Instance details Defined in GHC.Classes Methods (==) :: Module -> Module -> Bool Source # (/=) :: Module -> Module -> Bool Source #
Eq Ordering |
Instance details Defined in GHC.Classes Methods (==) :: Ordering -> Ordering -> Bool Source # (/=) :: Ordering -> Ordering -> Bool Source #
Eq TrName |
Instance details Defined in GHC.Classes Methods (==) :: TrName -> TrName -> Bool Source # (/=) :: TrName -> TrName -> Bool Source #
Eq TyCon |
Instance details Defined in GHC.Classes Methods (==) :: TyCon -> TyCon -> Bool Source # (/=) :: TyCon -> TyCon -> Bool Source #
Eq IniFile |
Instance details Defined in Data.Ini.Reader.Internals Methods (==) :: IniFile -> IniFile -> Bool Source # (/=) :: IniFile -> IniFile -> Bool Source #
Eq IniReaderError |
Instance details Defined in Data.Ini.Reader.Internals Methods (==) :: IniReaderError -> IniReaderError -> Bool Source # (/=) :: IniReaderError -> IniReaderError -> Bool Source #
Eq LinePass |
Instance details Defined in Linear.Plucker Methods (==) :: LinePass -> LinePass -> Bool Source # (/=) :: LinePass -> LinePass -> Bool Source #
Eq Part |
Instance details Defined in NLP.Miniutter.English Methods (==) :: Part -> Part -> Bool Source # (/=) :: Part -> Part -> Bool Source #
Eq Person |
Instance details Defined in NLP.Miniutter.English Methods (==) :: Person -> Person -> Bool Source # (/=) :: Person -> Person -> Bool Source #
Eq Polarity |
Instance details Defined in NLP.Miniutter.English Methods (==) :: Polarity -> Polarity -> Bool Source # (/=) :: Polarity -> Polarity -> Bool Source #
Eq URI |
Instance details Defined in Network.URI Methods (==) :: URI -> URI -> Bool Source # (/=) :: URI -> URI -> Bool Source #
Eq URIAuth |
Instance details Defined in Network.URI Methods (==) :: URIAuth -> URIAuth -> Bool Source # (/=) :: URIAuth -> URIAuth -> Bool Source #
Eq Richness |
Instance details Defined in Options.Applicative.BashCompletion Methods (==) :: Richness -> Richness -> Bool Source # (/=) :: Richness -> Richness -> Bool Source #
Eq Parenthetic |
Instance details Defined in Options.Applicative.Help.Core Methods (==) :: Parenthetic -> Parenthetic -> Bool Source # (/=) :: Parenthetic -> Parenthetic -> Bool Source #
Eq AltNodeType |
Instance details Defined in Options.Applicative.Types Methods (==) :: AltNodeType -> AltNodeType -> Bool Source # (/=) :: AltNodeType -> AltNodeType -> Bool Source #
Eq ArgPolicy |
Instance details Defined in Options.Applicative.Types Methods (==) :: ArgPolicy -> ArgPolicy -> Bool Source # (/=) :: ArgPolicy -> ArgPolicy -> Bool Source #
Eq ArgumentReachability |
Instance details Defined in Options.Applicative.Types Methods (==) :: ArgumentReachability -> ArgumentReachability -> Bool Source # (/=) :: ArgumentReachability -> ArgumentReachability -> Bool Source #
Eq Backtracking |
Instance details Defined in Options.Applicative.Types Methods (==) :: Backtracking -> Backtracking -> Bool Source # (/=) :: Backtracking -> Backtracking -> Bool Source #
Eq OptName |
Instance details Defined in Options.Applicative.Types Methods (==) :: OptName -> OptName -> Bool Source # (/=) :: OptName -> OptName -> Bool Source #
Eq OptVisibility |
Instance details Defined in Options.Applicative.Types Methods (==) :: OptVisibility -> OptVisibility -> Bool Source # (/=) :: OptVisibility -> OptVisibility -> Bool Source #
Eq ParserPrefs |
Instance details Defined in Options.Applicative.Types Methods (==) :: ParserPrefs -> ParserPrefs -> Bool Source # (/=) :: ParserPrefs -> ParserPrefs -> Bool Source #
Eq OsChar | Byte equality of the internal representation.
Instance details Defined in System.OsString.Internal.Types Methods (==) :: OsChar -> OsChar -> Bool Source # (/=) :: OsChar -> OsChar -> Bool Source #
Eq OsString | Byte equality of the internal representation.
Instance details Defined in System.OsString.Internal.Types Methods (==) :: OsString -> OsString -> Bool Source # (/=) :: OsString -> OsString -> Bool Source #
Eq PosixChar |
Instance details Defined in System.OsString.Internal.Types Methods (==) :: PosixChar -> PosixChar -> Bool Source # (/=) :: PosixChar -> PosixChar -> Bool Source #
Eq PosixString |
Instance details Defined in System.OsString.Internal.Types Methods (==) :: PosixString -> PosixString -> Bool Source # (/=) :: PosixString -> PosixString -> Bool Source #
Eq WindowsChar |
Instance details Defined in System.OsString.Internal.Types Methods (==) :: WindowsChar -> WindowsChar -> Bool Source # (/=) :: WindowsChar -> WindowsChar -> Bool Source #
Eq WindowsString |
Instance details Defined in System.OsString.Internal.Types Methods (==) :: WindowsString -> WindowsString -> Bool Source # (/=) :: WindowsString -> WindowsString -> Bool Source #
Eq Mode |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: Mode -> Mode -> Bool Source # (/=) :: Mode -> Mode -> Bool Source #
Eq Style |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: Style -> Style -> Bool Source # (/=) :: Style -> Style -> Bool Source #
Eq TextDetails |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: TextDetails -> TextDetails -> Bool Source # (/=) :: TextDetails -> TextDetails -> Bool Source #
Eq Doc |
Instance details Defined in Text.PrettyPrint.HughesPJ Methods (==) :: Doc -> Doc -> Bool Source # (/=) :: Doc -> Doc -> Bool Source #
Eq FusionDepth |
Instance details Defined in Prettyprinter.Internal Methods (==) :: FusionDepth -> FusionDepth -> Bool Source # (/=) :: FusionDepth -> FusionDepth -> Bool Source #
Eq LayoutOptions |
Instance details Defined in Prettyprinter.Internal Methods (==) :: LayoutOptions -> LayoutOptions -> Bool Source # (/=) :: LayoutOptions -> LayoutOptions -> Bool Source #
Eq PageWidth |
Instance details Defined in Prettyprinter.Internal Methods (==) :: PageWidth -> PageWidth -> Bool Source # (/=) :: PageWidth -> PageWidth -> Bool Source #
Eq StdGen |
Instance details Defined in System.Random.Internal Methods (==) :: StdGen -> StdGen -> Bool Source # (/=) :: StdGen -> StdGen -> Bool Source #
Eq Scientific |
Instance details Defined in Data.Scientific Methods (==) :: Scientific -> Scientific -> Bool Source # (/=) :: Scientific -> Scientific -> Bool Source #
Eq AudioDevice |
Instance details Defined in SDL.Audio Methods (==) :: AudioDevice -> AudioDevice -> Bool Source # (/=) :: AudioDevice -> AudioDevice -> Bool Source #
Eq AudioDeviceStatus |
Instance details Defined in SDL.Audio Methods (==) :: AudioDeviceStatus -> AudioDeviceStatus -> Bool Source # (/=) :: AudioDeviceStatus -> AudioDeviceStatus -> Bool Source #
Eq AudioDeviceUsage |
Instance details Defined in SDL.Audio Methods (==) :: AudioDeviceUsage -> AudioDeviceUsage -> Bool Source # (/=) :: AudioDeviceUsage -> AudioDeviceUsage -> Bool Source #
Eq AudioDriver |
Instance details Defined in SDL.Audio Methods (==) :: AudioDriver -> AudioDriver -> Bool Source # (/=) :: AudioDriver -> AudioDriver -> Bool Source #
Eq Channels |
Instance details Defined in SDL.Audio Methods (==) :: Channels -> Channels -> Bool Source # (/=) :: Channels -> Channels -> Bool Source #
Eq LockState |
Instance details Defined in SDL.Audio Methods (==) :: LockState -> LockState -> Bool Source # (/=) :: LockState -> LockState -> Bool Source #
Eq PlaybackState |
Instance details Defined in SDL.Audio Methods (==) :: PlaybackState -> PlaybackState -> Bool Source # (/=) :: PlaybackState -> PlaybackState -> Bool Source #
Eq AudioDeviceEventData |
Instance details Defined in SDL.Event Methods (==) :: AudioDeviceEventData -> AudioDeviceEventData -> Bool Source # (/=) :: AudioDeviceEventData -> AudioDeviceEventData -> Bool Source #
Eq ControllerAxisEventData |
Instance details Defined in SDL.Event Methods (==) :: ControllerAxisEventData -> ControllerAxisEventData -> Bool Source # (/=) :: ControllerAxisEventData -> ControllerAxisEventData -> Bool Source #
Eq ControllerButtonEventData |
Instance details Defined in SDL.Event Methods (==) :: ControllerButtonEventData -> ControllerButtonEventData -> Bool Source # (/=) :: ControllerButtonEventData -> ControllerButtonEventData -> Bool Source #
Eq ControllerDeviceEventData |
Instance details Defined in SDL.Event Methods (==) :: ControllerDeviceEventData -> ControllerDeviceEventData -> Bool Source # (/=) :: ControllerDeviceEventData -> ControllerDeviceEventData -> Bool Source #
Eq DollarGestureEventData |
Instance details Defined in SDL.Event Methods (==) :: DollarGestureEventData -> DollarGestureEventData -> Bool Source # (/=) :: DollarGestureEventData -> DollarGestureEventData -> Bool Source #
Eq DropEventData |
Instance details Defined in SDL.Event Methods (==) :: DropEventData -> DropEventData -> Bool Source # (/=) :: DropEventData -> DropEventData -> Bool Source #
Eq Event |
Instance details Defined in SDL.Event Methods (==) :: Event -> Event -> Bool Source # (/=) :: Event -> Event -> Bool Source #
Eq EventPayload |
Instance details Defined in SDL.Event Methods (==) :: EventPayload -> EventPayload -> Bool Source # (/=) :: EventPayload -> EventPayload -> Bool Source #
Eq EventPushResult |
Instance details Defined in SDL.Event Methods (==) :: EventPushResult -> EventPushResult -> Bool Source # (/=) :: EventPushResult -> EventPushResult -> Bool Source #
Eq InputMotion |
Instance details Defined in SDL.Event Methods (==) :: InputMotion -> InputMotion -> Bool Source # (/=) :: InputMotion -> InputMotion -> Bool Source #
Eq JoyAxisEventData |
Instance details Defined in SDL.Event Methods (==) :: JoyAxisEventData -> JoyAxisEventData -> Bool Source # (/=) :: JoyAxisEventData -> JoyAxisEventData -> Bool Source #
Eq JoyBallEventData |
Instance details Defined in SDL.Event Methods (==) :: JoyBallEventData -> JoyBallEventData -> Bool Source # (/=) :: JoyBallEventData -> JoyBallEventData -> Bool Source #
Eq JoyButtonEventData |
Instance details Defined in SDL.Event Methods (==) :: JoyButtonEventData -> JoyButtonEventData -> Bool Source # (/=) :: JoyButtonEventData -> JoyButtonEventData -> Bool Source #
Eq JoyDeviceEventData |
Instance details Defined in SDL.Event Methods (==) :: JoyDeviceEventData -> JoyDeviceEventData -> Bool Source # (/=) :: JoyDeviceEventData -> JoyDeviceEventData -> Bool Source #
Eq JoyHatEventData |
Instance details Defined in SDL.Event Methods (==) :: JoyHatEventData -> JoyHatEventData -> Bool Source # (/=) :: JoyHatEventData -> JoyHatEventData -> Bool Source #
Eq KeyboardEventData |
Instance details Defined in SDL.Event Methods (==) :: KeyboardEventData -> KeyboardEventData -> Bool Source # (/=) :: KeyboardEventData -> KeyboardEventData -> Bool Source #
Eq MouseButtonEventData |
Instance details Defined in SDL.Event Methods (==) :: MouseButtonEventData -> MouseButtonEventData -> Bool Source # (/=) :: MouseButtonEventData -> MouseButtonEventData -> Bool Source #
Eq MouseMotionEventData |
Instance details Defined in SDL.Event Methods (==) :: MouseMotionEventData -> MouseMotionEventData -> Bool Source # (/=) :: MouseMotionEventData -> MouseMotionEventData -> Bool Source #
Eq MouseWheelEventData |
Instance details Defined in SDL.Event Methods (==) :: MouseWheelEventData -> MouseWheelEventData -> Bool Source # (/=) :: MouseWheelEventData -> MouseWheelEventData -> Bool Source #
Eq MultiGestureEventData |
Instance details Defined in SDL.Event Methods (==) :: MultiGestureEventData -> MultiGestureEventData -> Bool Source # (/=) :: MultiGestureEventData -> MultiGestureEventData -> Bool Source #
Eq RegisteredEventData |
Instance details Defined in SDL.Event Methods (==) :: RegisteredEventData -> RegisteredEventData -> Bool Source # (/=) :: RegisteredEventData -> RegisteredEventData -> Bool Source #
Eq SysWMEventData |
Instance details Defined in SDL.Event Methods (==) :: SysWMEventData -> SysWMEventData -> Bool Source # (/=) :: SysWMEventData -> SysWMEventData -> Bool Source #
Eq TextEditingEventData |
Instance details Defined in SDL.Event Methods (==) :: TextEditingEventData -> TextEditingEventData -> Bool Source # (/=) :: TextEditingEventData -> TextEditingEventData -> Bool Source #
Eq TextInputEventData |
Instance details Defined in SDL.Event Methods (==) :: TextInputEventData -> TextInputEventData -> Bool Source # (/=) :: TextInputEventData -> TextInputEventData -> Bool Source #
Eq TouchFingerEventData |
Instance details Defined in SDL.Event Methods (==) :: TouchFingerEventData -> TouchFingerEventData -> Bool Source # (/=) :: TouchFingerEventData -> TouchFingerEventData -> Bool Source #
Eq TouchFingerMotionEventData |
Instance details Defined in SDL.Event Methods (==) :: TouchFingerMotionEventData -> TouchFingerMotionEventData -> Bool Source # (/=) :: TouchFingerMotionEventData -> TouchFingerMotionEventData -> Bool Source #
Eq UnknownEventData |
Instance details Defined in SDL.Event Methods (==) :: UnknownEventData -> UnknownEventData -> Bool Source # (/=) :: UnknownEventData -> UnknownEventData -> Bool Source #
Eq UserEventData |
Instance details Defined in SDL.Event Methods (==) :: UserEventData -> UserEventData -> Bool Source # (/=) :: UserEventData -> UserEventData -> Bool Source #
Eq WindowClosedEventData |
Instance details Defined in SDL.Event Methods (==) :: WindowClosedEventData -> WindowClosedEventData -> Bool Source # (/=) :: WindowClosedEventData -> WindowClosedEventData -> Bool Source #
Eq WindowExposedEventData |
Instance details Defined in SDL.Event Methods (==) :: WindowExposedEventData -> WindowExposedEventData -> Bool Source # (/=) :: WindowExposedEventData -> WindowExposedEventData -> Bool Source #
Eq WindowGainedKeyboardFocusEventData |
Instance details Defined in SDL.Event Methods (==) :: WindowGainedKeyboardFocusEventData -> WindowGainedKeyboardFocusEventData -> Bool Source # (/=) :: WindowGainedKeyboardFocusEventData -> WindowGainedKeyboardFocusEventData -> Bool Source #
Eq WindowGainedMouseFocusEventData |
Instance details Defined in SDL.Event Methods (==) :: WindowGainedMouseFocusEventData -> WindowGainedMouseFocusEventData -> Bool Source # (/=) :: WindowGainedMouseFocusEventData -> WindowGainedMouseFocusEventData -> Bool Source #
Eq WindowHiddenEventData |
Instance details Defined in SDL.Event Methods (==) :: WindowHiddenEventData -> WindowHiddenEventData -> Bool Source # (/=) :: WindowHiddenEventData -> WindowHiddenEventData -> Bool Source #
Eq WindowLostKeyboardFocusEventData |
Instance details Defined in SDL.Event Methods (==) :: WindowLostKeyboardFocusEventData -> WindowLostKeyboardFocusEventData -> Bool Source # (/=) :: WindowLostKeyboardFocusEventData -> WindowLostKeyboardFocusEventData -> Bool Source #
Eq WindowLostMouseFocusEventData |
Instance details Defined in SDL.Event Methods (==) :: WindowLostMouseFocusEventData -> WindowLostMouseFocusEventData -> Bool Source # (/=) :: WindowLostMouseFocusEventData -> WindowLostMouseFocusEventData -> Bool Source #
Eq WindowMaximizedEventData |
Instance details Defined in SDL.Event Methods (==) :: WindowMaximizedEventData -> WindowMaximizedEventData -> Bool Source # (/=) :: WindowMaximizedEventData -> WindowMaximizedEventData -> Bool Source #
Eq WindowMinimizedEventData |
Instance details Defined in SDL.Event Methods (==) :: WindowMinimizedEventData -> WindowMinimizedEventData -> Bool Source # (/=) :: WindowMinimizedEventData -> WindowMinimizedEventData -> Bool Source #
Eq WindowMovedEventData |
Instance details Defined in SDL.Event Methods (==) :: WindowMovedEventData -> WindowMovedEventData -> Bool Source # (/=) :: WindowMovedEventData -> WindowMovedEventData -> Bool Source #
Eq WindowResizedEventData |
Instance details Defined in SDL.Event Methods (==) :: WindowResizedEventData -> WindowResizedEventData -> Bool Source # (/=) :: WindowResizedEventData -> WindowResizedEventData -> Bool Source #
Eq WindowRestoredEventData |
Instance details Defined in SDL.Event Methods (==) :: WindowRestoredEventData -> WindowRestoredEventData -> Bool Source # (/=) :: WindowRestoredEventData -> WindowRestoredEventData -> Bool Source #
Eq WindowShownEventData |
Instance details Defined in SDL.Event Methods (==) :: WindowShownEventData -> WindowShownEventData -> Bool Source # (/=) :: WindowShownEventData -> WindowShownEventData -> Bool Source #
Eq WindowSizeChangedEventData |
Instance details Defined in SDL.Event Methods (==) :: WindowSizeChangedEventData -> WindowSizeChangedEventData -> Bool Source # (/=) :: WindowSizeChangedEventData -> WindowSizeChangedEventData -> Bool Source #
Eq SDLException |
Instance details Defined in SDL.Exception Methods (==) :: SDLException -> SDLException -> Bool Source # (/=) :: SDLException -> SDLException -> Bool Source #
Eq AccelerometerJoystickOptions |
Instance details Defined in SDL.Hint Methods (==) :: AccelerometerJoystickOptions -> AccelerometerJoystickOptions -> Bool Source # (/=) :: AccelerometerJoystickOptions -> AccelerometerJoystickOptions -> Bool Source #
Eq FramebufferAccelerationOptions |
Instance details Defined in SDL.Hint Methods (==) :: FramebufferAccelerationOptions -> FramebufferAccelerationOptions -> Bool Source # (/=) :: FramebufferAccelerationOptions -> FramebufferAccelerationOptions -> Bool Source #
Eq HintPriority |
Instance details Defined in SDL.Hint Methods (==) :: HintPriority -> HintPriority -> Bool Source # (/=) :: HintPriority -> HintPriority -> Bool Source #
Eq MacCTRLClickOptions |
Instance details Defined in SDL.Hint Methods (==) :: MacCTRLClickOptions -> MacCTRLClickOptions -> Bool Source # (/=) :: MacCTRLClickOptions -> MacCTRLClickOptions -> Bool Source #
Eq MouseModeWarpOptions |
Instance details Defined in SDL.Hint Methods (==) :: MouseModeWarpOptions -> MouseModeWarpOptions -> Bool Source # (/=) :: MouseModeWarpOptions -> MouseModeWarpOptions -> Bool Source #
Eq RenderDrivers |
Instance details Defined in SDL.Hint Methods (==) :: RenderDrivers -> RenderDrivers -> Bool Source # (/=) :: RenderDrivers -> RenderDrivers -> Bool Source #
Eq RenderOpenGLShaderOptions |
Instance details Defined in SDL.Hint Methods (==) :: RenderOpenGLShaderOptions -> RenderOpenGLShaderOptions -> Bool Source # (/=) :: RenderOpenGLShaderOptions -> RenderOpenGLShaderOptions -> Bool Source #
Eq RenderScaleQuality |
Instance details Defined in SDL.Hint Methods (==) :: RenderScaleQuality -> RenderScaleQuality -> Bool Source # (/=) :: RenderScaleQuality -> RenderScaleQuality -> Bool Source #
Eq RenderVSyncOptions |
Instance details Defined in SDL.Hint Methods (==) :: RenderVSyncOptions -> RenderVSyncOptions -> Bool Source # (/=) :: RenderVSyncOptions -> RenderVSyncOptions -> Bool Source #
Eq VideoWinD3DCompilerOptions |
Instance details Defined in SDL.Hint Methods (==) :: VideoWinD3DCompilerOptions -> VideoWinD3DCompilerOptions -> Bool Source # (/=) :: VideoWinD3DCompilerOptions -> VideoWinD3DCompilerOptions -> Bool Source #
Eq InitFlag |
Instance details Defined in SDL.Init Methods (==) :: InitFlag -> InitFlag -> Bool Source # (/=) :: InitFlag -> InitFlag -> Bool Source #
Eq ControllerAxis |
Instance details Defined in SDL.Input.GameController Methods (==) :: ControllerAxis -> ControllerAxis -> Bool Source # (/=) :: ControllerAxis -> ControllerAxis -> Bool Source #
Eq ControllerButton |
Instance details Defined in SDL.Input.GameController Methods (==) :: ControllerButton -> ControllerButton -> Bool Source # (/=) :: ControllerButton -> ControllerButton -> Bool Source #
Eq ControllerButtonState |
Instance details Defined in SDL.Input.GameController Methods (==) :: ControllerButtonState -> ControllerButtonState -> Bool Source # (/=) :: ControllerButtonState -> ControllerButtonState -> Bool Source #
Eq ControllerDevice |
Instance details Defined in SDL.Input.GameController Methods (==) :: ControllerDevice -> ControllerDevice -> Bool Source # (/=) :: ControllerDevice -> ControllerDevice -> Bool Source #
Eq ControllerDeviceConnection |
Instance details Defined in SDL.Input.GameController Methods (==) :: ControllerDeviceConnection -> ControllerDeviceConnection -> Bool Source # (/=) :: ControllerDeviceConnection -> ControllerDeviceConnection -> Bool Source #
Eq JoyButtonState |
Instance details Defined in SDL.Input.Joystick Methods (==) :: JoyButtonState -> JoyButtonState -> Bool Source # (/=) :: JoyButtonState -> JoyButtonState -> Bool Source #
Eq JoyDeviceConnection |
Instance details Defined in SDL.Input.Joystick Methods (==) :: JoyDeviceConnection -> JoyDeviceConnection -> Bool Source # (/=) :: JoyDeviceConnection -> JoyDeviceConnection -> Bool Source #
Eq JoyHatPosition |
Instance details Defined in SDL.Input.Joystick Methods (==) :: JoyHatPosition -> JoyHatPosition -> Bool Source # (/=) :: JoyHatPosition -> JoyHatPosition -> Bool Source #
Eq JoystickDevice |
Instance details Defined in SDL.Input.Joystick Methods (==) :: JoystickDevice -> JoystickDevice -> Bool Source # (/=) :: JoystickDevice -> JoystickDevice -> Bool Source #
Eq KeyModifier |
Instance details Defined in SDL.Input.Keyboard Methods (==) :: KeyModifier -> KeyModifier -> Bool Source # (/=) :: KeyModifier -> KeyModifier -> Bool Source #
Eq Keysym |
Instance details Defined in SDL.Input.Keyboard Methods (==) :: Keysym -> Keysym -> Bool Source # (/=) :: Keysym -> Keysym -> Bool Source #
Eq Keycode |
Instance details Defined in SDL.Input.Keyboard.Codes Methods (==) :: Keycode -> Keycode -> Bool Source # (/=) :: Keycode -> Keycode -> Bool Source #
Eq Scancode |
Instance details Defined in SDL.Input.Keyboard.Codes Methods (==) :: Scancode -> Scancode -> Bool Source # (/=) :: Scancode -> Scancode -> Bool Source #
Eq Cursor |
Instance details Defined in SDL.Input.Mouse Methods (==) :: Cursor -> Cursor -> Bool Source # (/=) :: Cursor -> Cursor -> Bool Source #
Eq LocationMode |
Instance details Defined in SDL.Input.Mouse Methods (==) :: LocationMode -> LocationMode -> Bool Source # (/=) :: LocationMode -> LocationMode -> Bool Source #
Eq ModalLocation |
Instance details Defined in SDL.Input.Mouse Methods (==) :: ModalLocation -> ModalLocation -> Bool Source # (/=) :: ModalLocation -> ModalLocation -> Bool Source #
Eq MouseButton |
Instance details Defined in SDL.Input.Mouse Methods (==) :: MouseButton -> MouseButton -> Bool Source # (/=) :: MouseButton -> MouseButton -> Bool Source #
Eq MouseDevice |
Instance details Defined in SDL.Input.Mouse Methods (==) :: MouseDevice -> MouseDevice -> Bool Source # (/=) :: MouseDevice -> MouseDevice -> Bool Source #
Eq MouseScrollDirection |
Instance details Defined in SDL.Input.Mouse Methods (==) :: MouseScrollDirection -> MouseScrollDirection -> Bool Source # (/=) :: MouseScrollDirection -> MouseScrollDirection -> Bool Source #
Eq WarpMouseOrigin |
Instance details Defined in SDL.Input.Mouse Methods (==) :: WarpMouseOrigin -> WarpMouseOrigin -> Bool Source # (/=) :: WarpMouseOrigin -> WarpMouseOrigin -> Bool Source #
Eq GameController |
Instance details Defined in SDL.Internal.Types Methods (==) :: GameController -> GameController -> Bool Source # (/=) :: GameController -> GameController -> Bool Source #
Eq Joystick |
Instance details Defined in SDL.Internal.Types Methods (==) :: Joystick -> Joystick -> Bool Source # (/=) :: Joystick -> Joystick -> Bool Source #
Eq Renderer |
Instance details Defined in SDL.Internal.Types Methods (==) :: Renderer -> Renderer -> Bool Source # (/=) :: Renderer -> Renderer -> Bool Source #
Eq Window |
Instance details Defined in SDL.Internal.Types Methods (==) :: Window -> Window -> Bool Source # (/=) :: Window -> Window -> Bool Source #
Eq BatteryState |
Instance details Defined in SDL.Power Methods (==) :: BatteryState -> BatteryState -> Bool Source # (/=) :: BatteryState -> BatteryState -> Bool Source #
Eq Charge |
Instance details Defined in SDL.Power Methods (==) :: Charge -> Charge -> Bool Source # (/=) :: Charge -> Charge -> Bool Source #
Eq PowerState |
Instance details Defined in SDL.Power Methods (==) :: PowerState -> PowerState -> Bool Source # (/=) :: PowerState -> PowerState -> Bool Source #
Eq SDLError |
Instance details Defined in SDL.Raw.Error Methods (==) :: SDLError -> SDLError -> Bool Source # (/=) :: SDLError -> SDLError -> Bool Source #
Eq Atomic |
Instance details Defined in SDL.Raw.Types Methods (==) :: Atomic -> Atomic -> Bool Source # (/=) :: Atomic -> Atomic -> Bool Source #
Eq AudioCVT |
Instance details Defined in SDL.Raw.Types Methods (==) :: AudioCVT -> AudioCVT -> Bool Source # (/=) :: AudioCVT -> AudioCVT -> Bool Source #
Eq AudioSpec |
Instance details Defined in SDL.Raw.Types Methods (==) :: AudioSpec -> AudioSpec -> Bool Source # (/=) :: AudioSpec -> AudioSpec -> Bool Source #
Eq Color |
Instance details Defined in SDL.Raw.Types Methods (==) :: Color -> Color -> Bool Source # (/=) :: Color -> Color -> Bool Source #
Eq DisplayMode |
Instance details Defined in SDL.Raw.Types Methods (==) :: DisplayMode -> DisplayMode -> Bool Source # (/=) :: DisplayMode -> DisplayMode -> Bool Source #
Eq Event |
Instance details Defined in SDL.Raw.Types Methods (==) :: Event -> Event -> Bool Source # (/=) :: Event -> Event -> Bool Source #
Eq FPoint |
Instance details Defined in SDL.Raw.Types Methods (==) :: FPoint -> FPoint -> Bool Source # (/=) :: FPoint -> FPoint -> Bool Source #
Eq FRect |
Instance details Defined in SDL.Raw.Types Methods (==) :: FRect -> FRect -> Bool Source # (/=) :: FRect -> FRect -> Bool Source #
Eq Finger |
Instance details Defined in SDL.Raw.Types Methods (==) :: Finger -> Finger -> Bool Source # (/=) :: Finger -> Finger -> Bool Source #
Eq GameControllerButtonBind |
Instance details Defined in SDL.Raw.Types Methods (==) :: GameControllerButtonBind -> GameControllerButtonBind -> Bool Source # (/=) :: GameControllerButtonBind -> GameControllerButtonBind -> Bool Source #
Eq HapticDirection |
Instance details Defined in SDL.Raw.Types Methods (==) :: HapticDirection -> HapticDirection -> Bool Source # (/=) :: HapticDirection -> HapticDirection -> Bool Source #
Eq HapticEffect |
Instance details Defined in SDL.Raw.Types Methods (==) :: HapticEffect -> HapticEffect -> Bool Source # (/=) :: HapticEffect -> HapticEffect -> Bool Source #
Eq JoystickGUID |
Instance details Defined in SDL.Raw.Types Methods (==) :: JoystickGUID -> JoystickGUID -> Bool Source # (/=) :: JoystickGUID -> JoystickGUID -> Bool Source #
Eq Keysym |
Instance details Defined in SDL.Raw.Types Methods (==) :: Keysym -> Keysym -> Bool Source # (/=) :: Keysym -> Keysym -> Bool Source #
Eq MessageBoxButtonData |
Instance details Defined in SDL.Raw.Types Methods (==) :: MessageBoxButtonData -> MessageBoxButtonData -> Bool Source # (/=) :: MessageBoxButtonData -> MessageBoxButtonData -> Bool Source #
Eq MessageBoxColor |
Instance details Defined in SDL.Raw.Types Methods (==) :: MessageBoxColor -> MessageBoxColor -> Bool Source # (/=) :: MessageBoxColor -> MessageBoxColor -> Bool Source #
Eq MessageBoxColorScheme |
Instance details Defined in SDL.Raw.Types Methods (==) :: MessageBoxColorScheme -> MessageBoxColorScheme -> Bool Source # (/=) :: MessageBoxColorScheme -> MessageBoxColorScheme -> Bool Source #
Eq MessageBoxData |
Instance details Defined in SDL.Raw.Types Methods (==) :: MessageBoxData -> MessageBoxData -> Bool Source # (/=) :: MessageBoxData -> MessageBoxData -> Bool Source #
Eq Palette |
Instance details Defined in SDL.Raw.Types Methods (==) :: Palette -> Palette -> Bool Source # (/=) :: Palette -> Palette -> Bool Source #
Eq PixelFormat |
Instance details Defined in SDL.Raw.Types Methods (==) :: PixelFormat -> PixelFormat -> Bool Source # (/=) :: PixelFormat -> PixelFormat -> Bool Source #
Eq Point |
Instance details Defined in SDL.Raw.Types Methods (==) :: Point -> Point -> Bool Source # (/=) :: Point -> Point -> Bool Source #
Eq RWops |
Instance details Defined in SDL.Raw.Types Methods (==) :: RWops -> RWops -> Bool Source # (/=) :: RWops -> RWops -> Bool Source #
Eq Rect |
Instance details Defined in SDL.Raw.Types Methods (==) :: Rect -> Rect -> Bool Source # (/=) :: Rect -> Rect -> Bool Source #
Eq RendererInfo |
Instance details Defined in SDL.Raw.Types Methods (==) :: RendererInfo -> RendererInfo -> Bool Source # (/=) :: RendererInfo -> RendererInfo -> Bool Source #
Eq Surface |
Instance details Defined in SDL.Raw.Types Methods (==) :: Surface -> Surface -> Bool Source # (/=) :: Surface -> Surface -> Bool Source #
Eq Version |
Instance details Defined in SDL.Raw.Types Methods (==) :: Version -> Version -> Bool Source # (/=) :: Version -> Version -> Bool Source #
Eq Vertex |
Instance details Defined in SDL.Raw.Types Methods (==) :: Vertex -> Vertex -> Bool Source # (/=) :: Vertex -> Vertex -> Bool Source #
Eq RetriggerTimer |
Instance details Defined in SDL.Time Methods (==) :: RetriggerTimer -> RetriggerTimer -> Bool Source # (/=) :: RetriggerTimer -> RetriggerTimer -> Bool Source #
Eq Display |
Instance details Defined in SDL.Video Methods (==) :: Display -> Display -> Bool Source # (/=) :: Display -> Display -> Bool Source #
Eq DisplayMode |
Instance details Defined in SDL.Video Methods (==) :: DisplayMode -> DisplayMode -> Bool Source # (/=) :: DisplayMode -> DisplayMode -> Bool Source #
Eq MessageKind |
Instance details Defined in SDL.Video Methods (==) :: MessageKind -> MessageKind -> Bool Source # (/=) :: MessageKind -> MessageKind -> Bool Source #
Eq VideoDriver |
Instance details Defined in SDL.Video Methods (==) :: VideoDriver -> VideoDriver -> Bool Source # (/=) :: VideoDriver -> VideoDriver -> Bool Source #
Eq WindowConfig |
Instance details Defined in SDL.Video Methods (==) :: WindowConfig -> WindowConfig -> Bool Source # (/=) :: WindowConfig -> WindowConfig -> Bool Source #
Eq WindowGraphicsContext |
Instance details Defined in SDL.Video Methods (==) :: WindowGraphicsContext -> WindowGraphicsContext -> Bool Source # (/=) :: WindowGraphicsContext -> WindowGraphicsContext -> Bool Source #
Eq WindowMode |
Instance details Defined in SDL.Video Methods (==) :: WindowMode -> WindowMode -> Bool Source # (/=) :: WindowMode -> WindowMode -> Bool Source #
Eq WindowPosition |
Instance details Defined in SDL.Video Methods (==) :: WindowPosition -> WindowPosition -> Bool Source # (/=) :: WindowPosition -> WindowPosition -> Bool Source #
Eq GLContext |
Instance details Defined in SDL.Video.OpenGL Methods (==) :: GLContext -> GLContext -> Bool Source # (/=) :: GLContext -> GLContext -> Bool Source #
Eq Mode |
Instance details Defined in SDL.Video.OpenGL Methods (==) :: Mode -> Mode -> Bool Source # (/=) :: Mode -> Mode -> Bool Source #
Eq OpenGLConfig |
Instance details Defined in SDL.Video.OpenGL Methods (==) :: OpenGLConfig -> OpenGLConfig -> Bool Source # (/=) :: OpenGLConfig -> OpenGLConfig -> Bool Source #
Eq Profile |
Instance details Defined in SDL.Video.OpenGL Methods (==) :: Profile -> Profile -> Bool Source # (/=) :: Profile -> Profile -> Bool Source #
Eq SwapInterval |
Instance details Defined in SDL.Video.OpenGL Methods (==) :: SwapInterval -> SwapInterval -> Bool Source # (/=) :: SwapInterval -> SwapInterval -> Bool Source #
Eq BlendMode |
Instance details Defined in SDL.Video.Renderer Methods (==) :: BlendMode -> BlendMode -> Bool Source # (/=) :: BlendMode -> BlendMode -> Bool Source #
Eq Palette |
Instance details Defined in SDL.Video.Renderer Methods (==) :: Palette -> Palette -> Bool Source # (/=) :: Palette -> Palette -> Bool Source #
Eq PixelFormat |
Instance details Defined in SDL.Video.Renderer Methods (==) :: PixelFormat -> PixelFormat -> Bool Source # (/=) :: PixelFormat -> PixelFormat -> Bool Source #
Eq RendererConfig |
Instance details Defined in SDL.Video.Renderer Methods (==) :: RendererConfig -> RendererConfig -> Bool Source # (/=) :: RendererConfig -> RendererConfig -> Bool Source #
Eq RendererInfo |
Instance details Defined in SDL.Video.Renderer Methods (==) :: RendererInfo -> RendererInfo -> Bool Source # (/=) :: RendererInfo -> RendererInfo -> Bool Source #
Eq RendererType |
Instance details Defined in SDL.Video.Renderer Methods (==) :: RendererType -> RendererType -> Bool Source # (/=) :: RendererType -> RendererType -> Bool Source #
Eq SurfacePixelFormat |
Instance details Defined in SDL.Video.Renderer Methods (==) :: SurfacePixelFormat -> SurfacePixelFormat -> Bool Source # (/=) :: SurfacePixelFormat -> SurfacePixelFormat -> Bool Source #
Eq Texture |
Instance details Defined in SDL.Video.Renderer Methods (==) :: Texture -> Texture -> Bool Source # (/=) :: Texture -> Texture -> Bool Source #
Eq TextureAccess |
Instance details Defined in SDL.Video.Renderer Methods (==) :: TextureAccess -> TextureAccess -> Bool Source # (/=) :: TextureAccess -> TextureAccess -> Bool Source #
Eq TextureInfo |
Instance details Defined in SDL.Video.Renderer Methods (==) :: TextureInfo -> TextureInfo -> Bool Source # (/=) :: TextureInfo -> TextureInfo -> Bool Source #
Eq Font |
Instance details Defined in SDL.Font Methods (==) :: Font -> Font -> Bool Source # (/=) :: Font -> Font -> Bool Source #
Eq Hinting |
Instance details Defined in SDL.Font Methods (==) :: Hinting -> Hinting -> Bool Source # (/=) :: Hinting -> Hinting -> Bool Source #
Eq Style |
Instance details Defined in SDL.Font Methods (==) :: Style -> Style -> Bool Source # (/=) :: Style -> Style -> Bool Source #
Eq TSem |
Instance details Defined in Control.Concurrent.STM.TSem Methods (==) :: TSem -> TSem -> Bool Source # (/=) :: TSem -> TSem -> Bool Source #
Eq AnnLookup |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: AnnLookup -> AnnLookup -> Bool Source # (/=) :: AnnLookup -> AnnLookup -> Bool Source #
Eq AnnTarget |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: AnnTarget -> AnnTarget -> Bool Source # (/=) :: AnnTarget -> AnnTarget -> Bool Source #
Eq Bang |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Bang -> Bang -> Bool Source # (/=) :: Bang -> Bang -> Bool Source #
Eq BndrVis |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: BndrVis -> BndrVis -> Bool Source # (/=) :: BndrVis -> BndrVis -> Bool Source #
Eq Body |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Body -> Body -> Bool Source # (/=) :: Body -> Body -> Bool Source #
Eq Bytes |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Bytes -> Bytes -> Bool Source # (/=) :: Bytes -> Bytes -> Bool Source #
Eq Callconv |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Callconv -> Callconv -> Bool Source # (/=) :: Callconv -> Callconv -> Bool Source #
Eq Clause |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Clause -> Clause -> Bool Source # (/=) :: Clause -> Clause -> Bool Source #
Eq Con |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Con -> Con -> Bool Source # (/=) :: Con -> Con -> Bool Source #
Eq Dec |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Dec -> Dec -> Bool Source # (/=) :: Dec -> Dec -> Bool Source #
Eq DecidedStrictness |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: DecidedStrictness -> DecidedStrictness -> Bool Source # (/=) :: DecidedStrictness -> DecidedStrictness -> Bool Source #
Eq DerivClause |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: DerivClause -> DerivClause -> Bool Source # (/=) :: DerivClause -> DerivClause -> Bool Source #
Eq DerivStrategy |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: DerivStrategy -> DerivStrategy -> Bool Source # (/=) :: DerivStrategy -> DerivStrategy -> Bool Source #
Eq DocLoc |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: DocLoc -> DocLoc -> Bool Source # (/=) :: DocLoc -> DocLoc -> Bool Source #
Eq Exp |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Exp -> Exp -> Bool Source # (/=) :: Exp -> Exp -> Bool Source #
Eq FamilyResultSig |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: FamilyResultSig -> FamilyResultSig -> Bool Source # (/=) :: FamilyResultSig -> FamilyResultSig -> Bool Source #
Eq Fixity |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Fixity -> Fixity -> Bool Source # (/=) :: Fixity -> Fixity -> Bool Source #
Eq FixityDirection |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: FixityDirection -> FixityDirection -> Bool Source # (/=) :: FixityDirection -> FixityDirection -> Bool Source #
Eq Foreign |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Foreign -> Foreign -> Bool Source # (/=) :: Foreign -> Foreign -> Bool Source #
Eq FunDep |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: FunDep -> FunDep -> Bool Source # (/=) :: FunDep -> FunDep -> Bool Source #
Eq Guard |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Guard -> Guard -> Bool Source # (/=) :: Guard -> Guard -> Bool Source #
Eq Info |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Info -> Info -> Bool Source # (/=) :: Info -> Info -> Bool Source #
Eq InjectivityAnn |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: InjectivityAnn -> InjectivityAnn -> Bool Source # (/=) :: InjectivityAnn -> InjectivityAnn -> Bool Source #
Eq Inline |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Inline -> Inline -> Bool Source # (/=) :: Inline -> Inline -> Bool Source #
Eq Lit |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Lit -> Lit -> Bool Source # (/=) :: Lit -> Lit -> Bool Source #
Eq Loc |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Loc -> Loc -> Bool Source # (/=) :: Loc -> Loc -> Bool Source #
Eq Match |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Match -> Match -> Bool Source # (/=) :: Match -> Match -> Bool Source #
Eq ModName |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: ModName -> ModName -> Bool Source # (/=) :: ModName -> ModName -> Bool Source #
Eq Module |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Module -> Module -> Bool Source # (/=) :: Module -> Module -> Bool Source #
Eq ModuleInfo |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: ModuleInfo -> ModuleInfo -> Bool Source # (/=) :: ModuleInfo -> ModuleInfo -> Bool Source #
Eq Name |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Name -> Name -> Bool Source # (/=) :: Name -> Name -> Bool Source #
Eq NameFlavour |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: NameFlavour -> NameFlavour -> Bool Source # (/=) :: NameFlavour -> NameFlavour -> Bool Source #
Eq NameSpace |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: NameSpace -> NameSpace -> Bool Source # (/=) :: NameSpace -> NameSpace -> Bool Source #
Eq NamespaceSpecifier |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool Source # (/=) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool Source #
Eq OccName |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: OccName -> OccName -> Bool Source # (/=) :: OccName -> OccName -> Bool Source #
Eq Overlap |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Overlap -> Overlap -> Bool Source # (/=) :: Overlap -> Overlap -> Bool Source #
Eq Pat |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Pat -> Pat -> Bool Source # (/=) :: Pat -> Pat -> Bool Source #
Eq PatSynArgs |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: PatSynArgs -> PatSynArgs -> Bool Source # (/=) :: PatSynArgs -> PatSynArgs -> Bool Source #
Eq PatSynDir |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: PatSynDir -> PatSynDir -> Bool Source # (/=) :: PatSynDir -> PatSynDir -> Bool Source #
Eq Phases |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Phases -> Phases -> Bool Source # (/=) :: Phases -> Phases -> Bool Source #
Eq PkgName |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: PkgName -> PkgName -> Bool Source # (/=) :: PkgName -> PkgName -> Bool Source #
Eq Pragma |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Pragma -> Pragma -> Bool Source # (/=) :: Pragma -> Pragma -> Bool Source #
Eq Range |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Range -> Range -> Bool Source # (/=) :: Range -> Range -> Bool Source #
Eq Role |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Role -> Role -> Bool Source # (/=) :: Role -> Role -> Bool Source #
Eq RuleBndr |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: RuleBndr -> RuleBndr -> Bool Source # (/=) :: RuleBndr -> RuleBndr -> Bool Source #
Eq RuleMatch |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: RuleMatch -> RuleMatch -> Bool Source # (/=) :: RuleMatch -> RuleMatch -> Bool Source #
Eq Safety |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Safety -> Safety -> Bool Source # (/=) :: Safety -> Safety -> Bool Source #
Eq SourceStrictness |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: SourceStrictness -> SourceStrictness -> Bool Source # (/=) :: SourceStrictness -> SourceStrictness -> Bool Source #
Eq SourceUnpackedness |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: SourceUnpackedness -> SourceUnpackedness -> Bool Source # (/=) :: SourceUnpackedness -> SourceUnpackedness -> Bool Source #
Eq Specificity |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Specificity -> Specificity -> Bool Source # (/=) :: Specificity -> Specificity -> Bool Source #
Eq Stmt |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Stmt -> Stmt -> Bool Source # (/=) :: Stmt -> Stmt -> Bool Source #
Eq TyLit |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: TyLit -> TyLit -> Bool Source # (/=) :: TyLit -> TyLit -> Bool Source #
Eq TySynEqn |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: TySynEqn -> TySynEqn -> Bool Source # (/=) :: TySynEqn -> TySynEqn -> Bool Source #
Eq Type |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Type -> Type -> Bool Source # (/=) :: Type -> Type -> Bool Source #
Eq TypeFamilyHead |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: TypeFamilyHead -> TypeFamilyHead -> Bool Source # (/=) :: TypeFamilyHead -> TypeFamilyHead -> Bool Source #
Eq UnicodeException |
Instance details Defined in Data.Text.Encoding.Error Methods (==) :: UnicodeException -> UnicodeException -> Bool Source # (/=) :: UnicodeException -> UnicodeException -> Bool Source #
Eq I8 |
Instance details Defined in Data.Text.Foreign Methods (==) :: I8 -> I8 -> Bool Source # (/=) :: I8 -> I8 -> Bool Source #
Eq Text |
Instance details Defined in Data.Text Methods (==) :: Text -> Text -> Bool Source # (/=) :: Text -> Text -> Bool Source #
Eq Builder |
Instance details Defined in Data.Text.Internal.Builder Methods (==) :: Builder -> Builder -> Bool Source # (/=) :: Builder -> Builder -> Bool Source #
Eq PartialUtf8CodePoint |
Instance details Defined in Data.Text.Internal.Encoding Methods (==) :: PartialUtf8CodePoint -> PartialUtf8CodePoint -> Bool Source # (/=) :: PartialUtf8CodePoint -> PartialUtf8CodePoint -> Bool Source #
Eq Utf8State |
Instance details Defined in Data.Text.Internal.Encoding Methods (==) :: Utf8State -> Utf8State -> Bool Source # (/=) :: Utf8State -> Utf8State -> Bool Source #
Eq DecoderState |
Instance details Defined in Data.Text.Internal.Encoding.Utf8 Methods (==) :: DecoderState -> DecoderState -> Bool Source # (/=) :: DecoderState -> DecoderState -> Bool Source #
Eq Size |
Instance details Defined in Data.Text.Internal.Fusion.Size Methods (==) :: Size -> Size -> Bool Source # (/=) :: Size -> Size -> Bool Source #
Eq Text |
Instance details Defined in Data.Text.Lazy Methods (==) :: Text -> Text -> Bool Source # (/=) :: Text -> Text -> Bool Source #
Eq B |
Instance details Defined in Data.Text.Short.Internal Methods (==) :: B -> B -> Bool Source # (/=) :: B -> B -> Bool Source #
Eq ShortText |
Instance details Defined in Data.Text.Short.Internal Methods (==) :: ShortText -> ShortText -> Bool Source # (/=) :: ShortText -> ShortText -> Bool Source #
Eq ConstructorInfo |
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: ConstructorInfo -> ConstructorInfo -> Bool Source # (/=) :: ConstructorInfo -> ConstructorInfo -> Bool Source #
Eq ConstructorVariant |
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: ConstructorVariant -> ConstructorVariant -> Bool Source # (/=) :: ConstructorVariant -> ConstructorVariant -> Bool Source #
Eq DatatypeInfo |
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: DatatypeInfo -> DatatypeInfo -> Bool Source # (/=) :: DatatypeInfo -> DatatypeInfo -> Bool Source #
Eq DatatypeVariant |
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: DatatypeVariant -> DatatypeVariant -> Bool Source # (/=) :: DatatypeVariant -> DatatypeVariant -> Bool Source #
Eq FieldStrictness |
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: FieldStrictness -> FieldStrictness -> Bool Source # (/=) :: FieldStrictness -> FieldStrictness -> Bool Source #
Eq Strictness |
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: Strictness -> Strictness -> Bool Source # (/=) :: Strictness -> Strictness -> Bool Source #
Eq Unpackedness |
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: Unpackedness -> Unpackedness -> Bool Source # (/=) :: Unpackedness -> Unpackedness -> Bool Source #
Eq CalendarDiffDays |
Instance details Defined in Data.Time.Calendar.CalendarDiffDays Methods (==) :: CalendarDiffDays -> CalendarDiffDays -> Bool Source # (/=) :: CalendarDiffDays -> CalendarDiffDays -> Bool Source #
Eq Day |
Instance details Defined in Data.Time.Calendar.Days Methods (==) :: Day -> Day -> Bool Source # (/=) :: Day -> Day -> Bool Source #
Eq Month |
Instance details Defined in Data.Time.Calendar.Month Methods (==) :: Month -> Month -> Bool Source # (/=) :: Month -> Month -> Bool Source #
Eq Quarter |
Instance details Defined in Data.Time.Calendar.Quarter Methods (==) :: Quarter -> Quarter -> Bool Source # (/=) :: Quarter -> Quarter -> Bool Source #
Eq QuarterOfYear |
Instance details Defined in Data.Time.Calendar.Quarter Methods (==) :: QuarterOfYear -> QuarterOfYear -> Bool Source # (/=) :: QuarterOfYear -> QuarterOfYear -> Bool Source #
Eq FirstWeekType |
Instance details Defined in Data.Time.Calendar.WeekDate Methods (==) :: FirstWeekType -> FirstWeekType -> Bool Source # (/=) :: FirstWeekType -> FirstWeekType -> Bool Source #
Eq DiffTime |
Instance details Defined in Data.Time.Clock.Internal.DiffTime Methods (==) :: DiffTime -> DiffTime -> Bool Source # (/=) :: DiffTime -> DiffTime -> Bool Source #
Eq NominalDiffTime |
Instance details Defined in Data.Time.Clock.Internal.NominalDiffTime Methods (==) :: NominalDiffTime -> NominalDiffTime -> Bool Source # (/=) :: NominalDiffTime -> NominalDiffTime -> Bool Source #
Eq UTCTime |
Instance details Defined in Data.Time.Clock.Internal.UTCTime Methods (==) :: UTCTime -> UTCTime -> Bool Source # (/=) :: UTCTime -> UTCTime -> Bool Source #
Eq UniversalTime |
Instance details Defined in Data.Time.Clock.Internal.UniversalTime Methods (==) :: UniversalTime -> UniversalTime -> Bool Source # (/=) :: UniversalTime -> UniversalTime -> Bool Source #
Eq CalendarDiffTime |
Instance details Defined in Data.Time.LocalTime.Internal.CalendarDiffTime Methods (==) :: CalendarDiffTime -> CalendarDiffTime -> Bool Source # (/=) :: CalendarDiffTime -> CalendarDiffTime -> Bool Source #
Eq LocalTime |
Instance details Defined in Data.Time.LocalTime.Internal.LocalTime Methods (==) :: LocalTime -> LocalTime -> Bool Source # (/=) :: LocalTime -> LocalTime -> Bool Source #
Eq TimeOfDay |
Instance details Defined in Data.Time.LocalTime.Internal.TimeOfDay Methods (==) :: TimeOfDay -> TimeOfDay -> Bool Source # (/=) :: TimeOfDay -> TimeOfDay -> Bool Source #
Eq TimeZone |
Instance details Defined in Data.Time.LocalTime.Internal.TimeZone Methods (==) :: TimeZone -> TimeZone -> Bool Source # (/=) :: TimeZone -> TimeZone -> Bool Source #
Eq SubHashPath |
Instance details Defined in Data.HashMap.Internal.Debug Methods (==) :: SubHashPath -> SubHashPath -> Bool Source # (/=) :: SubHashPath -> SubHashPath -> Bool Source #
Eq UUID |
Instance details Defined in Data.UUID.Types.Internal Methods (==) :: UUID -> UUID -> Bool Source # (/=) :: UUID -> UUID -> Bool Source #
Eq UnpackedUUID |
Instance details Defined in Data.UUID.Types.Internal Methods (==) :: UnpackedUUID -> UnpackedUUID -> Bool Source # (/=) :: UnpackedUUID -> UnpackedUUID -> Bool Source #
Eq Size |
Instance details Defined in Data.Vector.Fusion.Bundle.Size Methods (==) :: Size -> Size -> Bool Source # (/=) :: Size -> Size -> Bool Source #
Eq Checks |
Instance details Defined in Data.Vector.Internal.Check Methods (==) :: Checks -> Checks -> Bool Source # (/=) :: Checks -> Checks -> Bool Source #
Eq CompressParams | Since: zlib-0.7.0.0
Instance details Defined in Codec.Compression.Zlib.Internal Methods (==) :: CompressParams -> CompressParams -> Bool Source # (/=) :: CompressParams -> CompressParams -> Bool Source #
Eq DecompressError |
Instance details Defined in Codec.Compression.Zlib.Internal Methods (==) :: DecompressError -> DecompressError -> Bool Source # (/=) :: DecompressError -> DecompressError -> Bool Source #
Eq DecompressParams | Since: zlib-0.7.0.0
Instance details Defined in Codec.Compression.Zlib.Internal Methods (==) :: DecompressParams -> DecompressParams -> Bool Source # (/=) :: DecompressParams -> DecompressParams -> Bool Source #
Eq CompressionLevel |
Instance details Defined in Codec.Compression.Zlib.Stream Methods (==) :: CompressionLevel -> CompressionLevel -> Bool Source # (/=) :: CompressionLevel -> CompressionLevel -> Bool Source #
Eq CompressionStrategy |
Instance details Defined in Codec.Compression.Zlib.Stream Methods (==) :: CompressionStrategy -> CompressionStrategy -> Bool Source # (/=) :: CompressionStrategy -> CompressionStrategy -> Bool Source #
Eq DictionaryHash |
Instance details Defined in Codec.Compression.Zlib.Stream Methods (==) :: DictionaryHash -> DictionaryHash -> Bool Source # (/=) :: DictionaryHash -> DictionaryHash -> Bool Source #
Eq Format |
Instance details Defined in Codec.Compression.Zlib.Stream Methods (==) :: Format -> Format -> Bool Source # (/=) :: Format -> Format -> Bool Source #
Eq MemoryLevel |
Instance details Defined in Codec.Compression.Zlib.Stream Methods (==) :: MemoryLevel -> MemoryLevel -> Bool Source # (/=) :: MemoryLevel -> MemoryLevel -> Bool Source #
Eq Method |
Instance details Defined in Codec.Compression.Zlib.Stream Methods (==) :: Method -> Method -> Bool Source # (/=) :: Method -> Method -> Bool Source #
Eq WindowBits |
Instance details Defined in Codec.Compression.Zlib.Stream Methods (==) :: WindowBits -> WindowBits -> Bool Source # (/=) :: WindowBits -> WindowBits -> Bool Source #
Eq Integer |
Instance details Defined in GHC.Num.Integer Methods (==) :: Integer -> Integer -> Bool Source # (/=) :: Integer -> Integer -> Bool Source #
Eq Natural |
Instance details Defined in GHC.Num.Natural Methods (==) :: Natural -> Natural -> Bool Source # (/=) :: Natural -> Natural -> Bool Source #
Eq () |
Instance details Defined in GHC.Classes Methods (==) :: () -> () -> Bool Source # (/=) :: () -> () -> Bool Source #
Eq Bool |
Instance details Defined in GHC.Classes Methods (==) :: Bool -> Bool -> Bool Source # (/=) :: Bool -> Bool -> Bool Source #
Eq Char |
Instance details Defined in GHC.Classes Methods (==) :: Char -> Char -> Bool Source # (/=) :: Char -> Char -> Bool Source #

Eq Double

Note that due to the presence of `NaN`, `Double`'s `Eq` instance does not satisfy reflexivity.

    >>> 0/0 == (0/0 :: Double)
    False

Also note that `Double`'s `Eq` instance does not satisfy substitutivity:

    >>> 0 == (-0 :: Double)
    True
    >>> recip 0 == recip (-0 :: Double)
    False

Instance details Defined in GHC.Classes Methods (==) :: Double -> Double -> Bool Source # (/=) :: Double -> Double -> Bool Source #

Eq Float

Note that due to the presence of `NaN`, `Float`'s `Eq` instance does not satisfy reflexivity.

    >>> 0/0 == (0/0 :: Float)
    False

Also note that `Float`'s `Eq` instance does not satisfy extensionality:

    >>> 0 == (-0 :: Float)
    True
    >>> recip 0 == recip (-0 :: Float)
    False

Instance details Defined in GHC.Classes Methods (==) :: Float -> Float -> Bool Source # (/=) :: Float -> Float -> Bool Source #
Eq Int |
Instance details Defined in GHC.Classes Methods (==) :: Int -> Int -> Bool Source # (/=) :: Int -> Int -> Bool Source #
Eq Word |
Instance details Defined in GHC.Classes Methods (==) :: Word -> Word -> Bool Source # (/=) :: Word -> Word -> Bool Source #
UnboxRepClass c => Eq (Array c) Source # |
Instance details Defined in Game.LambdaHack.Common.PointArray Methods (==) :: Array c -> Array c -> Bool Source # (/=) :: Array c -> Array c -> Bool Source #
Eq a => Eq (Delta a) Source # |
Instance details Defined in Game.LambdaHack.Common.Time Methods (==) :: Delta a -> Delta a -> Bool Source # (/=) :: Delta a -> Delta a -> Bool Source #
Eq a => Eq (Frequency a) Source # |
Instance details Defined in Game.LambdaHack.Core.Frequency Methods (==) :: Frequency a -> Frequency a -> Bool Source # (/=) :: Frequency a -> Frequency a -> Bool Source #
Eq (ContentId c) Source # |
Instance details Defined in Game.LambdaHack.Definition.DefsInternal Methods (==) :: ContentId c -> ContentId c -> Bool Source # (/=) :: ContentId c -> ContentId c -> Bool Source #
Eq (GroupName c) Source # |
Instance details Defined in Game.LambdaHack.Definition.DefsInternal Methods (==) :: GroupName c -> GroupName c -> Bool Source # (/=) :: GroupName c -> GroupName c -> Bool Source #
Eq a => Eq (FovValid a) Source # |
Instance details Defined in Game.LambdaHack.Server.Fov Methods (==) :: FovValid a -> FovValid a -> Bool Source # (/=) :: FovValid a -> FovValid a -> Bool Source #
Eq a => Eq (Blind a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods (==) :: Blind a -> Blind a -> Bool Source # (/=) :: Blind a -> Blind a -> Bool Source #
Eq a => Eq (Fixed a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods (==) :: Fixed a -> Fixed a -> Bool Source # (/=) :: Fixed a -> Fixed a -> Bool Source #
Eq a => Eq (Large a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods (==) :: Large a -> Large a -> Bool Source # (/=) :: Large a -> Large a -> Bool Source #
Eq a => Eq (Negative a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods (==) :: Negative a -> Negative a -> Bool Source # (/=) :: Negative a -> Negative a -> Bool Source #
Eq a => Eq (NonEmptyList a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods (==) :: NonEmptyList a -> NonEmptyList a -> Bool Source # (/=) :: NonEmptyList a -> NonEmptyList a -> Bool Source #
Eq a => Eq (NonNegative a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods (==) :: NonNegative a -> NonNegative a -> Bool Source # (/=) :: NonNegative a -> NonNegative a -> Bool Source #
Eq a => Eq (NonPositive a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods (==) :: NonPositive a -> NonPositive a -> Bool Source # (/=) :: NonPositive a -> NonPositive a -> Bool Source #
Eq a => Eq (NonZero a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods (==) :: NonZero a -> NonZero a -> Bool Source # (/=) :: NonZero a -> NonZero a -> Bool Source #
Eq a => Eq (OrderedList a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods (==) :: OrderedList a -> OrderedList a -> Bool Source # (/=) :: OrderedList a -> OrderedList a -> Bool Source #
Eq a => Eq (Positive a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods (==) :: Positive a -> Positive a -> Bool Source # (/=) :: Positive a -> Positive a -> Bool Source #
Eq a => Eq (Shrink2 a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods (==) :: Shrink2 a -> Shrink2 a -> Bool Source # (/=) :: Shrink2 a -> Shrink2 a -> Bool Source #
Eq a => Eq (Small a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods (==) :: Small a -> Small a -> Bool Source # (/=) :: Small a -> Small a -> Bool Source #
Eq a => Eq (SortedList a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods (==) :: SortedList a -> SortedList a -> Bool Source # (/=) :: SortedList a -> SortedList a -> Bool Source #
Eq v => Eq (KeyMap v) |
Instance details Defined in Data.Aeson.KeyMap Methods (==) :: KeyMap v -> KeyMap v -> Bool Source # (/=) :: KeyMap v -> KeyMap v -> Bool Source #
Eq a => Eq (IResult a) |
Instance details Defined in Data.Aeson.Types.Internal Methods (==) :: IResult a -> IResult a -> Bool Source # (/=) :: IResult a -> IResult a -> Bool Source #
Eq a => Eq (Result a) |
Instance details Defined in Data.Aeson.Types.Internal Methods (==) :: Result a -> Result a -> Bool Source # (/=) :: Result a -> Result a -> Bool Source #
Eq (Async a) |
Instance details Defined in Control.Concurrent.Async.Internal Methods (==) :: Async a -> Async a -> Bool Source # (/=) :: Async a -> Async a -> Bool Source #
Eq (Chan a) | Since: base-4.4.0.0
Instance details Defined in Control.Concurrent.Chan Methods (==) :: Chan a -> Chan a -> Bool Source # (/=) :: Chan a -> Chan a -> Bool Source #
Eq (MutableByteArray s) | Since: base-4.17.0.0
Instance details Defined in Data.Array.Byte Methods (==) :: MutableByteArray s -> MutableByteArray s -> Bool Source # (/=) :: MutableByteArray s -> MutableByteArray s -> Bool Source #
Eq a => Eq (Complex a) | Since: base-2.1
Instance details Defined in Data.Complex Methods (==) :: Complex a -> Complex a -> Bool Source # (/=) :: Complex a -> Complex a -> Bool Source #
Eq a => Eq (First a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: First a -> First a -> Bool Source # (/=) :: First a -> First a -> Bool Source #
Eq a => Eq (Last a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: Last a -> Last a -> Bool Source # (/=) :: Last a -> Last a -> Bool Source #
Eq a => Eq (Max a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: Max a -> Max a -> Bool Source # (/=) :: Max a -> Max a -> Bool Source #
Eq a => Eq (Min a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: Min a -> Min a -> Bool Source # (/=) :: Min a -> Min a -> Bool Source #
Eq m => Eq (WrappedMonoid m) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: WrappedMonoid m -> WrappedMonoid m -> Bool Source # (/=) :: WrappedMonoid m -> WrappedMonoid m -> Bool Source #
Eq n => Eq (VarInt n) |
Instance details Defined in Data.Bytes.VarInt Methods (==) :: VarInt n -> VarInt n -> Bool Source # (/=) :: VarInt n -> VarInt n -> Bool Source #
Eq a => Eq (AlphaColour a) |
Instance details Defined in Data.Colour.Internal Methods (==) :: AlphaColour a -> AlphaColour a -> Bool Source # (/=) :: AlphaColour a -> AlphaColour a -> Bool Source #
Eq a => Eq (Colour a) |
Instance details Defined in Data.Colour.Internal Methods (==) :: Colour a -> Colour a -> Bool Source # (/=) :: Colour a -> Colour a -> Bool Source #
Eq vertex => Eq (SCC vertex) | Since: containers-0.5.9
Instance details Defined in Data.Graph Methods (==) :: SCC vertex -> SCC vertex -> Bool Source # (/=) :: SCC vertex -> SCC vertex -> Bool Source #
Eq a => Eq (IntMap a) |
Instance details Defined in Data.IntMap.Internal Methods (==) :: IntMap a -> IntMap a -> Bool Source # (/=) :: IntMap a -> IntMap a -> Bool Source #
Eq a => Eq (Seq a) |
Instance details Defined in Data.Sequence.Internal Methods (==) :: Seq a -> Seq a -> Bool Source # (/=) :: Seq a -> Seq a -> Bool Source #
Eq a => Eq (ViewL a) |
Instance details Defined in Data.Sequence.Internal Methods (==) :: ViewL a -> ViewL a -> Bool Source # (/=) :: ViewL a -> ViewL a -> Bool Source #
Eq a => Eq (ViewR a) |
Instance details Defined in Data.Sequence.Internal Methods (==) :: ViewR a -> ViewR a -> Bool Source # (/=) :: ViewR a -> ViewR a -> Bool Source #
Eq a => Eq (Intersection a) |
Instance details Defined in Data.Set.Internal Methods (==) :: Intersection a -> Intersection a -> Bool Source # (/=) :: Intersection a -> Intersection a -> Bool Source #
Eq a => Eq (Set a) |
Instance details Defined in Data.Set.Internal Methods (==) :: Set a -> Set a -> Bool Source # (/=) :: Set a -> Set a -> Bool Source #
Eq a => Eq (Tree a) |
Instance details Defined in Data.Tree Methods (==) :: Tree a -> Tree a -> Bool Source # (/=) :: Tree a -> Tree a -> Bool Source #
Eq1 f => Eq (Fix f) |
Instance details Defined in Data.Fix Methods (==) :: Fix f -> Fix f -> Bool Source # (/=) :: Fix f -> Fix f -> Bool Source #
(Functor f, Eq1 f) => Eq (Mu f) |
Instance details Defined in Data.Fix Methods (==) :: Mu f -> Mu f -> Bool Source # (/=) :: Mu f -> Mu f -> Bool Source #
(Functor f, Eq1 f) => Eq (Nu f) |
Instance details Defined in Data.Fix Methods (==) :: Nu f -> Nu f -> Bool Source # (/=) :: Nu f -> Nu f -> Bool Source #
Eq a => Eq (DNonEmpty a) |
Instance details Defined in Data.DList.DNonEmpty.Internal Methods (==) :: DNonEmpty a -> DNonEmpty a -> Bool Source # (/=) :: DNonEmpty a -> DNonEmpty a -> Bool Source #
Eq a => Eq (DList a) |
Instance details Defined in Data.DList.Internal Methods (==) :: DList a -> DList a -> Bool Source # (/=) :: DList a -> DList a -> Bool Source #
Eq (EnumSet k) |
Instance details Defined in Data.EnumSet Methods (==) :: EnumSet k -> EnumSet k -> Bool Source # (/=) :: EnumSet k -> EnumSet k -> Bool Source #
Eq a => Eq (NonEmpty a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (==) :: NonEmpty a -> NonEmpty a -> Bool Source # (/=) :: NonEmpty a -> NonEmpty a -> Bool Source #
Eq (TVar a) | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Conc.Sync Methods (==) :: TVar a -> TVar a -> Bool Source # (/=) :: TVar a -> TVar a -> Bool Source #
Eq a => Eq (Identity a) | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Functor.Identity Methods (==) :: Identity a -> Identity a -> Bool Source # (/=) :: Identity a -> Identity a -> Bool Source #
Eq a => Eq (First a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Monoid Methods (==) :: First a -> First a -> Bool Source # (/=) :: First a -> First a -> Bool Source #
Eq a => Eq (Last a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Monoid Methods (==) :: Last a -> Last a -> Bool Source # (/=) :: Last a -> Last a -> Bool Source #
Eq a => Eq (Down a) | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Data.Ord Methods (==) :: Down a -> Down a -> Bool Source # (/=) :: Down a -> Down a -> Bool Source #
Eq a => Eq (Dual a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (==) :: Dual a -> Dual a -> Bool Source # (/=) :: Dual a -> Dual a -> Bool Source #
Eq a => Eq (Product a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (==) :: Product a -> Product a -> Bool Source # (/=) :: Product a -> Product a -> Bool Source #
Eq a => Eq (Sum a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (==) :: Sum a -> Sum a -> Bool Source # (/=) :: Sum a -> Sum a -> Bool Source #
Eq (ForeignPtr a) | Since: base-2.1
Instance details Defined in GHC.Internal.ForeignPtr Methods (==) :: ForeignPtr a -> ForeignPtr a -> Bool Source # (/=) :: ForeignPtr a -> ForeignPtr a -> Bool Source #
Eq a => Eq (ZipList a) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Functor.ZipList Methods (==) :: ZipList a -> ZipList a -> Bool Source # (/=) :: ZipList a -> ZipList a -> Bool Source #
Eq p => Eq (Par1 p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: Par1 p -> Par1 p -> Bool Source # (/=) :: Par1 p -> Par1 p -> Bool Source #
Eq (IORef a) | Pointer equality. Since: base-4.0.0.0
Instance details Defined in GHC.Internal.IORef Methods (==) :: IORef a -> IORef a -> Bool Source # (/=) :: IORef a -> IORef a -> Bool Source #
Eq (MVar a) | Compares the underlying pointers. Since: base-4.1.0.0
Instance details Defined in GHC.Internal.MVar Methods (==) :: MVar a -> MVar a -> Bool Source # (/=) :: MVar a -> MVar a -> Bool Source #
Eq (FunPtr a) |
Instance details Defined in GHC.Internal.Ptr Methods (==) :: FunPtr a -> FunPtr a -> Bool Source # (/=) :: FunPtr a -> FunPtr a -> Bool Source #
Eq (Ptr a) | Since: base-2.1
Instance details Defined in GHC.Internal.Ptr Methods (==) :: Ptr a -> Ptr a -> Bool Source # (/=) :: Ptr a -> Ptr a -> Bool Source #
Eq a => Eq (Ratio a) | Since: base-2.1
Instance details Defined in GHC.Internal.Real Methods (==) :: Ratio a -> Ratio a -> Bool Source # (/=) :: Ratio a -> Ratio a -> Bool Source #
Eq (SNat n) | Since: base-4.19.0.0
Instance details Defined in GHC.Internal.TypeNats Methods (==) :: SNat n -> SNat n -> Bool Source # (/=) :: SNat n -> SNat n -> Bool Source #
Eq a => Eq (Hashed a) | Uses precomputed hash to detect inequality faster
Instance details Defined in Data.Hashable.Class Methods (==) :: Hashed a -> Hashed a -> Bool Source # (/=) :: Hashed a -> Hashed a -> Bool Source #
Eq a => Eq (Plucker a) |
Instance details Defined in Linear.Plucker Methods (==) :: Plucker a -> Plucker a -> Bool Source # (/=) :: Plucker a -> Plucker a -> Bool Source #
Eq a => Eq (Quaternion a) |
Instance details Defined in Linear.Quaternion Methods (==) :: Quaternion a -> Quaternion a -> Bool Source # (/=) :: Quaternion a -> Quaternion a -> Bool Source #
Eq (V0 a) |
Instance details Defined in Linear.V0 Methods (==) :: V0 a -> V0 a -> Bool Source # (/=) :: V0 a -> V0 a -> Bool Source #
Eq a => Eq (V1 a) |
Instance details Defined in Linear.V1 Methods (==) :: V1 a -> V1 a -> Bool Source # (/=) :: V1 a -> V1 a -> Bool Source #
Eq a => Eq (V2 a) |
Instance details Defined in Linear.V2 Methods (==) :: V2 a -> V2 a -> Bool Source # (/=) :: V2 a -> V2 a -> Bool Source #
Eq a => Eq (V3 a) |
Instance details Defined in Linear.V3 Methods (==) :: V3 a -> V3 a -> Bool Source # (/=) :: V3 a -> V3 a -> Bool Source #
Eq a => Eq (V4 a) |
Instance details Defined in Linear.V4 Methods (==) :: V4 a -> V4 a -> Bool Source # (/=) :: V4 a -> V4 a -> Bool Source #
Eq a => Eq (Chunk a) |
Instance details Defined in Options.Applicative.Help.Chunk Methods (==) :: Chunk a -> Chunk a -> Bool Source # (/=) :: Chunk a -> Chunk a -> Bool Source #
Eq a => Eq (AnnotDetails a) |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: AnnotDetails a -> AnnotDetails a -> Bool Source # (/=) :: AnnotDetails a -> AnnotDetails a -> Bool Source #
Eq (Doc a) |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: Doc a -> Doc a -> Bool Source # (/=) :: Doc a -> Doc a -> Bool Source #
Eq a => Eq (Span a) |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: Span a -> Span a -> Bool Source # (/=) :: Span a -> Span a -> Bool Source #
Eq ann => Eq (SimpleDocStream ann) |
Instance details Defined in Prettyprinter.Internal Methods (==) :: SimpleDocStream ann -> SimpleDocStream ann -> Bool Source # (/=) :: SimpleDocStream ann -> SimpleDocStream ann -> Bool Source #
Eq a => Eq (Array a) |
Instance details Defined in Data.Primitive.Array Methods (==) :: Array a -> Array a -> Bool Source # (/=) :: Array a -> Array a -> Bool Source #
(Eq a, Prim a) => Eq (PrimArray a) | Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.PrimArray Methods (==) :: PrimArray a -> PrimArray a -> Bool Source # (/=) :: PrimArray a -> PrimArray a -> Bool Source #
Eq a => Eq (SmallArray a) |
Instance details Defined in Data.Primitive.SmallArray Methods (==) :: SmallArray a -> SmallArray a -> Bool Source # (/=) :: SmallArray a -> SmallArray a -> Bool Source #
Eq g => Eq (StateGen g) |
Instance details Defined in System.Random.Internal Methods (==) :: StateGen g -> StateGen g -> Bool Source # (/=) :: StateGen g -> StateGen g -> Bool Source #
Eq g => Eq (AtomicGen g) |
Instance details Defined in System.Random.Stateful Methods (==) :: AtomicGen g -> AtomicGen g -> Bool Source # (/=) :: AtomicGen g -> AtomicGen g -> Bool Source #
Eq g => Eq (IOGen g) |
Instance details Defined in System.Random.Stateful Methods (==) :: IOGen g -> IOGen g -> Bool Source # (/=) :: IOGen g -> IOGen g -> Bool Source #
Eq g => Eq (STGen g) |
Instance details Defined in System.Random.Stateful Methods (==) :: STGen g -> STGen g -> Bool Source # (/=) :: STGen g -> STGen g -> Bool Source #
Eq g => Eq (TGen g) |
Instance details Defined in System.Random.Stateful Methods (==) :: TGen g -> TGen g -> Bool Source # (/=) :: TGen g -> TGen g -> Bool Source #
Eq (AudioFormat sampleType) |
Instance details Defined in SDL.Audio Methods (==) :: AudioFormat sampleType -> AudioFormat sampleType -> Bool Source # (/=) :: AudioFormat sampleType -> AudioFormat sampleType -> Bool Source #
Eq a => Eq (Changeable a) |
Instance details Defined in SDL.Audio Methods (==) :: Changeable a -> Changeable a -> Bool Source # (/=) :: Changeable a -> Changeable a -> Bool Source #
Eq a => Eq (V2 a) |
Instance details Defined in SDL.Internal.Vect Methods (==) :: V2 a -> V2 a -> Bool Source # (/=) :: V2 a -> V2 a -> Bool Source #
Eq a => Eq (V3 a) |
Instance details Defined in SDL.Internal.Vect Methods (==) :: V3 a -> V3 a -> Bool Source # (/=) :: V3 a -> V3 a -> Bool Source #
Eq a => Eq (V4 a) |
Instance details Defined in SDL.Internal.Vect Methods (==) :: V4 a -> V4 a -> Bool Source # (/=) :: V4 a -> V4 a -> Bool Source #
Eq a => Eq (Rectangle a) |
Instance details Defined in SDL.Video.Renderer Methods (==) :: Rectangle a -> Rectangle a -> Bool Source # (/=) :: Rectangle a -> Rectangle a -> Bool Source #
Eq (TBQueue a) |
Instance details Defined in Control.Concurrent.STM.TBQueue Methods (==) :: TBQueue a -> TBQueue a -> Bool Source # (/=) :: TBQueue a -> TBQueue a -> Bool Source #
Eq (TChan a) |
Instance details Defined in Control.Concurrent.STM.TChan Methods (==) :: TChan a -> TChan a -> Bool Source # (/=) :: TChan a -> TChan a -> Bool Source #
Eq (TMVar a) |
Instance details Defined in Control.Concurrent.STM.TMVar Methods (==) :: TMVar a -> TMVar a -> Bool Source # (/=) :: TMVar a -> TMVar a -> Bool Source #
Eq (TQueue a) |
Instance details Defined in Control.Concurrent.STM.TQueue Methods (==) :: TQueue a -> TQueue a -> Bool Source # (/=) :: TQueue a -> TQueue a -> Bool Source #
Eq a => Eq (Maybe a) |
Instance details Defined in Data.Strict.Maybe Methods (==) :: Maybe a -> Maybe a -> Bool Source # (/=) :: Maybe a -> Maybe a -> Bool Source #
Eq flag => Eq (TyVarBndr flag) |
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: TyVarBndr flag -> TyVarBndr flag -> Bool Source # (/=) :: TyVarBndr flag -> TyVarBndr flag -> Bool Source #
Eq a => Eq (Stream a) |
Instance details Defined in Data.Text.Internal.Fusion.Types Methods (==) :: Stream a -> Stream a -> Bool Source # (/=) :: Stream a -> Stream a -> Bool Source #
Eq k => Eq (Error k) |
Instance details Defined in Data.HashMap.Internal.Debug Methods (==) :: Error k -> Error k -> Bool Source # (/=) :: Error k -> Error k -> Bool Source #
Eq k => Eq (Validity k) |
Instance details Defined in Data.HashMap.Internal.Debug Methods (==) :: Validity k -> Validity k -> Bool Source # (/=) :: Validity k -> Validity k -> Bool Source #

Eq a => Eq (HashSet a)

Note that, in the presence of hash collisions, equal `HashSet`s may behave differently, i.e. extensionality may be violated:

    >>> data D = A | B deriving (Eq, Show)
    >>> instance Hashable D where hashWithSalt salt _d = salt

    >>> x = fromList [A, B]
    >>> y = fromList [B, A]

    >>> x == y
    True
    >>> toList x
    [A,B]
    >>> toList y
    [B,A]

In general, the lack of extensionality can be observed with any function that depends on the key ordering, such as folds and traversals.

Instance details Defined in Data.HashSet.Internal Methods (==) :: HashSet a -> HashSet a -> Bool Source # (/=) :: HashSet a -> HashSet a -> Bool Source #
Eq a => Eq (Vector a) |
Instance details Defined in Data.Vector Methods (==) :: Vector a -> Vector a -> Bool Source # (/=) :: Vector a -> Vector a -> Bool Source #
(Prim a, Eq a) => Eq (Vector a) |
Instance details Defined in Data.Vector.Primitive Methods (==) :: Vector a -> Vector a -> Bool Source # (/=) :: Vector a -> Vector a -> Bool Source #
(Storable a, Eq a) => Eq (Vector a) |
Instance details Defined in Data.Vector.Storable Methods (==) :: Vector a -> Vector a -> Bool Source # (/=) :: Vector a -> Vector a -> Bool Source #
Eq a => Eq (Vector a) |
Instance details Defined in Data.Vector.Strict Methods (==) :: Vector a -> Vector a -> Bool Source # (/=) :: Vector a -> Vector a -> Bool Source #
(Unbox a, Eq a) => Eq (Vector a) |
Instance details Defined in Data.Vector.Unboxed Methods (==) :: Vector a -> Vector a -> Bool Source # (/=) :: Vector a -> Vector a -> Bool Source #
Eq a => Eq (Maybe a) | Since: base-2.1
Instance details Defined in GHC.Internal.Maybe Methods (==) :: Maybe a -> Maybe a -> Bool Source # (/=) :: Maybe a -> Maybe a -> Bool Source #
Eq a => Eq (Solo a) |
Instance details Defined in GHC.Classes Methods (==) :: Solo a -> Solo a -> Bool Source # (/=) :: Solo a -> Solo a -> Bool Source #
Eq a => Eq [a] |
Instance details Defined in GHC.Classes Methods (==) :: [a] -> [a] -> Bool Source # (/=) :: [a] -> [a] -> Bool Source #
Eq (Fixed a) | Since: base-2.1
Instance details Defined in Data.Fixed Methods (==) :: Fixed a -> Fixed a -> Bool Source # (/=) :: Fixed a -> Fixed a -> Bool Source #
Eq a => Eq (Arg a b) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: Arg a b -> Arg a b -> Bool Source # (/=) :: Arg a b -> Arg a b -> Bool Source #
(Eq k, Eq a) => Eq (Map k a) |
Instance details Defined in Data.Map.Internal Methods (==) :: Map k a -> Map k a -> Bool Source # (/=) :: Map k a -> Map k a -> Bool Source #
Eq a => Eq (EnumMap k a) |
Instance details Defined in Data.EnumMap.Base Methods (==) :: EnumMap k a -> EnumMap k a -> Bool Source # (/=) :: EnumMap k a -> EnumMap k a -> Bool Source #
(Eq1 f, Eq a) => Eq (Cofree f a) |
Instance details Defined in Control.Comonad.Cofree Methods (==) :: Cofree f a -> Cofree f a -> Bool Source # (/=) :: Cofree f a -> Cofree f a -> Bool Source #
(Eq1 f, Eq a) => Eq (Free f a) |
Instance details Defined in Control.Monad.Free Methods (==) :: Free f a -> Free f a -> Bool Source # (/=) :: Free f a -> Free f a -> Bool Source #
(Eq a, Eq b) => Eq (Either a b) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Either Methods (==) :: Either a b -> Either a b -> Bool Source # (/=) :: Either a b -> Either a b -> Bool Source #
Eq (TypeRep a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Typeable.Internal Methods (==) :: TypeRep a -> TypeRep a -> Bool Source # (/=) :: TypeRep a -> TypeRep a -> Bool Source #
Eq (U1 p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: U1 p -> U1 p -> Bool Source # (/=) :: U1 p -> U1 p -> Bool Source #
Eq (V1 p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: V1 p -> V1 p -> Bool Source # (/=) :: V1 p -> V1 p -> Bool Source #
Eq (STRef s a) | Pointer equality. Since: base-2.1
Instance details Defined in GHC.Internal.STRef Methods (==) :: STRef s a -> STRef s a -> Bool Source # (/=) :: STRef s a -> STRef s a -> Bool Source #
(Eq1 f, Eq a) => Eq (Yoneda f a) |
Instance details Defined in Data.Functor.Yoneda Methods (==) :: Yoneda f a -> Yoneda f a -> Bool Source # (/=) :: Yoneda f a -> Yoneda f a -> Bool Source #
Eq (f a) => Eq (Point f a) |
Instance details Defined in Linear.Affine Methods (==) :: Point f a -> Point f a -> Bool Source # (/=) :: Point f a -> Point f a -> Bool Source #
Eq (MutableArray s a) |
Instance details Defined in Data.Primitive.Array Methods (==) :: MutableArray s a -> MutableArray s a -> Bool Source # (/=) :: MutableArray s a -> MutableArray s a -> Bool Source #
Eq (MVar s a) |
Instance details Defined in Data.Primitive.MVar Methods (==) :: MVar s a -> MVar s a -> Bool Source # (/=) :: MVar s a -> MVar s a -> Bool Source #
Eq (MutVar s a) |
Instance details Defined in Data.Primitive.MutVar Methods (==) :: MutVar s a -> MutVar s a -> Bool Source # (/=) :: MutVar s a -> MutVar s a -> Bool Source #
Eq (MutablePrimArray s a) |
Instance details Defined in Data.Primitive.PrimArray Methods (==) :: MutablePrimArray s a -> MutablePrimArray s a -> Bool Source # (/=) :: MutablePrimArray s a -> MutablePrimArray s a -> Bool Source #
Eq (PrimVar s a) |
Instance details Defined in Data.Primitive.PrimVar Methods (==) :: PrimVar s a -> PrimVar s a -> Bool Source # (/=) :: PrimVar s a -> PrimVar s a -> Bool Source #
Eq (SmallMutableArray s a) |
Instance details Defined in Data.Primitive.SmallArray Methods (==) :: SmallMutableArray s a -> SmallMutableArray s a -> Bool Source # (/=) :: SmallMutableArray s a -> SmallMutableArray s a -> Bool Source #
Eq (f a) => Eq (Point f a) |
Instance details Defined in SDL.Internal.Vect Methods (==) :: Point f a -> Point f a -> Bool Source # (/=) :: Point f a -> Point f a -> Bool Source #
(Eq i, Eq e) => Eq (TArray i e) |
Instance details Defined in Control.Concurrent.STM.TArray Methods (==) :: TArray i e -> TArray i e -> Bool Source # (/=) :: TArray i e -> TArray i e -> Bool Source #
(Eq a, Eq b) => Eq (Either a b) |
Instance details Defined in Data.Strict.Either Methods (==) :: Either a b -> Either a b -> Bool Source # (/=) :: Either a b -> Either a b -> Bool Source #
(Eq a, Eq b) => Eq (These a b) |
Instance details Defined in Data.Strict.These Methods (==) :: These a b -> These a b -> Bool Source # (/=) :: These a b -> These a b -> Bool Source #
(Eq a, Eq b) => Eq (Pair a b) |
Instance details Defined in Data.Strict.Tuple Methods (==) :: Pair a b -> Pair a b -> Bool Source # (/=) :: Pair a b -> Pair a b -> Bool Source #
(Eq a, Eq b) => Eq (These a b) |
Instance details Defined in Data.These Methods (==) :: These a b -> These a b -> Bool Source # (/=) :: These a b -> These a b -> Bool Source #
(Eq1 f, Eq a) => Eq (Lift f a) |
Instance details Defined in Control.Applicative.Lift Methods (==) :: Lift f a -> Lift f a -> Bool Source # (/=) :: Lift f a -> Lift f a -> Bool Source #
(Eq1 m, Eq a) => Eq (MaybeT m a) |
Instance details Defined in Control.Monad.Trans.Maybe Methods (==) :: MaybeT m a -> MaybeT m a -> Bool Source # (/=) :: MaybeT m a -> MaybeT m a -> Bool Source #

(Eq k, Eq v) => Eq (HashMap k v)

Note that, in the presence of hash collisions, equal `HashMap`s may behave differently, i.e. extensionality may be violated:

    >>> data D = A | B deriving (Eq, Show)
    >>> instance Hashable D where hashWithSalt salt _d = salt

    >>> x = fromList [(A,1), (B,2)]
    >>> y = fromList [(B,2), (A,1)]

    >>> x == y
    True
    >>> toList x
    [(A,1),(B,2)]
    >>> toList y
    [(B,2),(A,1)]

In general, the lack of extensionality can be observed with any function that depends on the key ordering, such as folds and traversals.

Instance details Defined in Data.HashMap.Internal Methods (==) :: HashMap k v -> HashMap k v -> Bool Source # (/=) :: HashMap k v -> HashMap k v -> Bool Source #
(Eq k, Eq v) => Eq (Leaf k v) |
Instance details Defined in Data.HashMap.Internal Methods (==) :: Leaf k v -> Leaf k v -> Bool Source # (/=) :: Leaf k v -> Leaf k v -> Bool Source #
(Eq a, Eq b) => Eq (a, b) |
Instance details Defined in GHC.Classes Methods (==) :: (a, b) -> (a, b) -> Bool Source # (/=) :: (a, b) -> (a, b) -> Bool Source #
Eq (p (Fix p a) a) => Eq (Fix p a) |
Instance details Defined in Data.Bifunctor.Fix Methods (==) :: Fix p a -> Fix p a -> Bool Source # (/=) :: Fix p a -> Fix p a -> Bool Source #
Eq (p a a) => Eq (Join p a) |
Instance details Defined in Data.Bifunctor.Join Methods (==) :: Join p a -> Join p a -> Bool Source # (/=) :: Join p a -> Join p a -> Bool Source #
(Eq a, Eq (f b)) => Eq (CofreeF f a b) |
Instance details Defined in Control.Comonad.Trans.Cofree Methods (==) :: CofreeF f a b -> CofreeF f a b -> Bool Source # (/=) :: CofreeF f a b -> CofreeF f a b -> Bool Source #
Eq (w (CofreeF f a (CofreeT f w a))) => Eq (CofreeT f w a) |
Instance details Defined in Control.Comonad.Trans.Cofree Methods (==) :: CofreeT f w a -> CofreeT f w a -> Bool Source # (/=) :: CofreeT f w a -> CofreeT f w a -> Bool Source #
(Eq a, Eq (f b)) => Eq (FreeF f a b) |
Instance details Defined in Control.Monad.Trans.Free Methods (==) :: FreeF f a b -> FreeF f a b -> Bool Source # (/=) :: FreeF f a b -> FreeF f a b -> Bool Source #
(Eq1 f, Eq1 m, Eq a) => Eq (FreeT f m a) |
Instance details Defined in Control.Monad.Trans.Free Methods (==) :: FreeT f m a -> FreeT f m a -> Bool Source # (/=) :: FreeT f m a -> FreeT f m a -> Bool Source #
Eq a => Eq (Const a b) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Functor.Const Methods (==) :: Const a b -> Const a b -> Bool Source # (/=) :: Const a b -> Const a b -> Bool Source #
Eq (f a) => Eq (Ap f a) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods (==) :: Ap f a -> Ap f a -> Bool Source # (/=) :: Ap f a -> Ap f a -> Bool Source #
Eq (f a) => Eq (Alt f a) | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (==) :: Alt f a -> Alt f a -> Bool Source # (/=) :: Alt f a -> Alt f a -> Bool Source #
Eq (OrderingI a b) |
Instance details Defined in GHC.Internal.Data.Type.Ord Methods (==) :: OrderingI a b -> OrderingI a b -> Bool Source # (/=) :: OrderingI a b -> OrderingI a b -> Bool Source #
(Generic1 f, Eq (Rep1 f a)) => Eq (Generically1 f a) | Since: base-4.18.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: Generically1 f a -> Generically1 f a -> Bool Source # (/=) :: Generically1 f a -> Generically1 f a -> Bool Source #
Eq (f p) => Eq (Rec1 f p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: Rec1 f p -> Rec1 f p -> Bool Source # (/=) :: Rec1 f p -> Rec1 f p -> Bool Source #
Eq (URec (Ptr ()) p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool Source # (/=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool Source #
Eq (URec Char p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: URec Char p -> URec Char p -> Bool Source # (/=) :: URec Char p -> URec Char p -> Bool Source #
Eq (URec Double p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: URec Double p -> URec Double p -> Bool Source # (/=) :: URec Double p -> URec Double p -> Bool Source #
Eq (URec Float p) |
Instance details Defined in GHC.Internal.Generics Methods (==) :: URec Float p -> URec Float p -> Bool Source # (/=) :: URec Float p -> URec Float p -> Bool Source #
Eq (URec Int p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: URec Int p -> URec Int p -> Bool Source # (/=) :: URec Int p -> URec Int p -> Bool Source #
Eq (URec Word p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: URec Word p -> URec Word p -> Bool Source # (/=) :: URec Word p -> URec Word p -> Bool Source #
Eq a => Eq (V n a) |
Instance details Defined in Linear.V Methods (==) :: V n a -> V n a -> Bool Source # (/=) :: V n a -> V n a -> Bool Source #
Eq b => Eq (Tagged s b) |
Instance details Defined in Data.Tagged Methods (==) :: Tagged s b -> Tagged s b -> Bool Source # (/=) :: Tagged s b -> Tagged s b -> Bool Source #
(Eq (f a), Eq (g a), Eq a) => Eq (These1 f g a) |
Instance details Defined in Data.Functor.These Methods (==) :: These1 f g a -> These1 f g a -> Bool Source # (/=) :: These1 f g a -> These1 f g a -> Bool Source #
(Eq1 f, Eq a) => Eq (Backwards f a) |
Instance details Defined in Control.Applicative.Backwards Methods (==) :: Backwards f a -> Backwards f a -> Bool Source # (/=) :: Backwards f a -> Backwards f a -> Bool Source #
(Eq e, Eq1 m, Eq a) => Eq (ExceptT e m a) |
Instance details Defined in Control.Monad.Trans.Except Methods (==) :: ExceptT e m a -> ExceptT e m a -> Bool Source # (/=) :: ExceptT e m a -> ExceptT e m a -> Bool Source #
(Eq1 f, Eq a) => Eq (IdentityT f a) |
Instance details Defined in Control.Monad.Trans.Identity Methods (==) :: IdentityT f a -> IdentityT f a -> Bool Source # (/=) :: IdentityT f a -> IdentityT f a -> Bool Source #
(Eq w, Eq1 m, Eq a) => Eq (WriterT w m a) |
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods (==) :: WriterT w m a -> WriterT w m a -> Bool Source # (/=) :: WriterT w m a -> WriterT w m a -> Bool Source #
(Eq w, Eq1 m, Eq a) => Eq (WriterT w m a) |
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods (==) :: WriterT w m a -> WriterT w m a -> Bool Source # (/=) :: WriterT w m a -> WriterT w m a -> Bool Source #
Eq a => Eq (Constant a b) |
Instance details Defined in Data.Functor.Constant Methods (==) :: Constant a b -> Constant a b -> Bool Source # (/=) :: Constant a b -> Constant a b -> Bool Source #
(Eq1 f, Eq a) => Eq (Reverse f a) |
Instance details Defined in Data.Functor.Reverse Methods (==) :: Reverse f a -> Reverse f a -> Bool Source # (/=) :: Reverse f a -> Reverse f a -> Bool Source #
Eq a => Eq (Bundle Id v a) |
Instance details Defined in Data.Vector.Fusion.Bundle Methods (==) :: Bundle Id v a -> Bundle Id v a -> Bool Source # (/=) :: Bundle Id v a -> Bundle Id v a -> Bool Source #
(Eq a, Eq b, Eq c) => Eq (a, b, c) |
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c) -> (a, b, c) -> Bool Source # (/=) :: (a, b, c) -> (a, b, c) -> Bool Source #
(Eq (f a), Eq (g a)) => Eq (Product f g a) | Since: base-4.18.0.0
Instance details Defined in Data.Functor.Product Methods (==) :: Product f g a -> Product f g a -> Bool Source # (/=) :: Product f g a -> Product f g a -> Bool Source #
(Eq (f a), Eq (g a)) => Eq (Sum f g a) | Since: base-4.18.0.0
Instance details Defined in Data.Functor.Sum Methods (==) :: Sum f g a -> Sum f g a -> Bool Source # (/=) :: Sum f g a -> Sum f g a -> Bool Source #
(Eq (f p), Eq (g p)) => Eq ((f :*: g) p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: (f :*: g) p -> (f :*: g) p -> Bool Source # (/=) :: (f :*: g) p -> (f :*: g) p -> Bool Source #
(Eq (f p), Eq (g p)) => Eq ((f :+: g) p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: (f :+: g) p -> (f :+: g) p -> Bool Source # (/=) :: (f :+: g) p -> (f :+: g) p -> Bool Source #
Eq c => Eq (K1 i c p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: K1 i c p -> K1 i c p -> Bool Source # (/=) :: K1 i c p -> K1 i c p -> Bool Source #
(Eq a, Eq b, Eq c, Eq d) => Eq (a, b, c, d) |
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d) -> (a, b, c, d) -> Bool Source # (/=) :: (a, b, c, d) -> (a, b, c, d) -> Bool Source #
Eq (f (g a)) => Eq (Compose f g a) | Since: base-4.18.0.0
Instance details Defined in Data.Functor.Compose Methods (==) :: Compose f g a -> Compose f g a -> Bool Source # (/=) :: Compose f g a -> Compose f g a -> Bool Source #
Eq (f a) => Eq (Clown f a b) |
Instance details Defined in Data.Bifunctor.Clown Methods (==) :: Clown f a b -> Clown f a b -> Bool Source # (/=) :: Clown f a b -> Clown f a b -> Bool Source #
Eq (p b a) => Eq (Flip p a b) |
Instance details Defined in Data.Bifunctor.Flip Methods (==) :: Flip p a b -> Flip p a b -> Bool Source # (/=) :: Flip p a b -> Flip p a b -> Bool Source #
Eq (g b) => Eq (Joker g a b) |
Instance details Defined in Data.Bifunctor.Joker Methods (==) :: Joker g a b -> Joker g a b -> Bool Source # (/=) :: Joker g a b -> Joker g a b -> Bool Source #
Eq (p a b) => Eq (WrappedBifunctor p a b) |
Instance details Defined in Data.Bifunctor.Wrapped Methods (==) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool Source # (/=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool Source #
Eq (f (g p)) => Eq ((f :.: g) p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: (f :.: g) p -> (f :.: g) p -> Bool Source # (/=) :: (f :.: g) p -> (f :.: g) p -> Bool Source #
Eq (f p) => Eq (M1 i c f p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: M1 i c f p -> M1 i c f p -> Bool Source # (/=) :: M1 i c f p -> M1 i c f p -> Bool Source #
(Eq a, Eq b, Eq c, Eq d, Eq e) => Eq (a, b, c, d, e) |
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool Source # (/=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool Source #
(Eq (f a b), Eq (g a b)) => Eq (Product f g a b) |
Instance details Defined in Data.Bifunctor.Product Methods (==) :: Product f g a b -> Product f g a b -> Bool Source # (/=) :: Product f g a b -> Product f g a b -> Bool Source #
(Eq (p a b), Eq (q a b)) => Eq (Sum p q a b) |
Instance details Defined in Data.Bifunctor.Sum Methods (==) :: Sum p q a b -> Sum p q a b -> Bool Source # (/=) :: Sum p q a b -> Sum p q a b -> Bool Source #
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f) => Eq (a, b, c, d, e, f) |
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool Source # (/=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool Source #
Eq (f (p a b)) => Eq (Tannen f p a b) |
Instance details Defined in Data.Bifunctor.Tannen Methods (==) :: Tannen f p a b -> Tannen f p a b -> Bool Source # (/=) :: Tannen f p a b -> Tannen f p a b -> Bool Source #
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g) => Eq (a, b, c, d, e, f, g) |
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool Source # (/=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool Source #
(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) |
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool Source # (/=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool Source #
Eq (p (f a) (g b)) => Eq (Biff p f g a b) |
Instance details Defined in Data.Bifunctor.Biff Methods (==) :: Biff p f g a b -> Biff p f g a b -> Bool Source # (/=) :: Biff p f g a b -> Biff p f g a b -> Bool Source #
(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) |
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool Source # (/=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool Source #
(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) |
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool Source # (/=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool Source #
(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) |
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool Source # (/=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool Source #
(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) |
Instance details Defined in GHC.Classes Methods (==) :: (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 Source # (/=) :: (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 Source #
(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) |
Instance details Defined in GHC.Classes Methods (==) :: (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 Source # (/=) :: (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 Source #
(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) |
Instance details Defined in GHC.Classes Methods (==) :: (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 Source # (/=) :: (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 Source #
(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) |
Instance details Defined in GHC.Classes Methods (==) :: (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 Source # (/=) :: (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 Source #

class Eq a => Ord a where Source #

The `Ord` class is used for totally ordered datatypes.

Instances of `Ord` can be derived for any user-defined datatype whose constituent types are in `Ord`. The declared order of the constructors in the data declaration determines the ordering in derived `Ord` instances. The `Ordering` datatype allows a single comparison to determine the precise ordering of two objects.

`Ord`, as defined by the Haskell report, implements a total order and has the following properties:

Comparability
  `x <= y || y <= x` = `True`
Transitivity
  if `x <= y && y <= z` = `True`, then `x <= z` = `True`
Reflexivity
  `x <= x` = `True`
Antisymmetry
  if `x <= y && y <= x` = `True`, then `x == y` = `True`

The following operator interactions are expected to hold:

1. `x >= y` = `y <= x`
2. `x < y` = `x <= y && x /= y`
3. `x > y` = `y < x`
4. `x < y` = `compare x y == LT`
5. `x > y` = `compare x y == GT`
6. `x == y` = `compare x y == EQ`
7. `min x y == if x <= y then x else y` = `True`
8. `max x y == if x >= y then x else y` = `True`

Note that (7.) and (8.) do not require `min` and `max` to return either of their arguments. The result is merely required to equal one of the arguments in terms of `(==)`.

Minimal complete definition: either `compare` or `<=`. Using `compare` can be more efficient for complex types.

Minimal complete definition

compare | (<=)

Methods

compare :: a -> a -> Ordering Source #

(<) :: a -> a -> Bool infix 4 Source #

(<=) :: a -> a -> Bool infix 4 Source #

(>) :: a -> a -> Bool infix 4 Source #

(>=) :: a -> a -> Bool infix 4 Source #

max :: a -> a -> a Source #

min :: a -> a -> a Source #

#### Instances

Instances details

Ord BfsDistance Source # |

Instance details

Defined in Game.LambdaHack.Client.Bfs

Methods

compare :: BfsDistance -> BfsDistance -> Ordering Source #

(<) :: BfsDistance -> BfsDistance -> Bool Source #

(<=) :: BfsDistance -> BfsDistance -> Bool Source #

(>) :: BfsDistance -> BfsDistance -> Bool Source #

(>=) :: BfsDistance -> BfsDistance -> Bool Source #

max :: BfsDistance -> BfsDistance -> BfsDistance Source #

min :: BfsDistance -> BfsDistance -> BfsDistance Source #

Ord DetailLevel Source # |

Instance details

Defined in Game.LambdaHack.Client.UI.EffectDescription

Methods

compare :: DetailLevel -> DetailLevel -> Ordering Source #

(<) :: DetailLevel -> DetailLevel -> Bool Source #

(<=) :: DetailLevel -> DetailLevel -> Bool Source #

(>) :: DetailLevel -> DetailLevel -> Bool Source #

(>=) :: DetailLevel -> DetailLevel -> Bool Source #

max :: DetailLevel -> DetailLevel -> DetailLevel Source #

min :: DetailLevel -> DetailLevel -> DetailLevel Source #

Ord AimModeCmd Source # |

Instance details

Defined in Game.LambdaHack.Client.UI.HumanCmd

Methods

compare :: AimModeCmd -> AimModeCmd -> Ordering Source #

(<) :: AimModeCmd -> AimModeCmd -> Bool Source #

(<=) :: AimModeCmd -> AimModeCmd -> Bool Source #

(>) :: AimModeCmd -> AimModeCmd -> Bool Source #

(>=) :: AimModeCmd -> AimModeCmd -> Bool Source #

max :: AimModeCmd -> AimModeCmd -> AimModeCmd Source #

min :: AimModeCmd -> AimModeCmd -> AimModeCmd Source #

Ord CmdArea Source # |
Instance details Defined in Game.LambdaHack.Client.UI.HumanCmd Methods compare :: CmdArea -> CmdArea -> Ordering Source # (<) :: CmdArea -> CmdArea -> Bool Source # (<=) :: CmdArea -> CmdArea -> Bool Source # (>) :: CmdArea -> CmdArea -> Bool Source # (>=) :: CmdArea -> CmdArea -> Bool Source # max :: CmdArea -> CmdArea -> CmdArea Source # min :: CmdArea -> CmdArea -> CmdArea Source #
Ord HumanCmd Source # |

Instance details

Defined in Game.LambdaHack.Client.UI.HumanCmd

Methods

compare :: HumanCmd -> HumanCmd -> Ordering Source #

(<) :: HumanCmd -> HumanCmd -> Bool Source #

(<=) :: HumanCmd -> HumanCmd -> Bool Source #

(>) :: HumanCmd -> HumanCmd -> Bool Source #

(>=) :: HumanCmd -> HumanCmd -> Bool Source #

max :: HumanCmd -> HumanCmd -> HumanCmd Source #

min :: HumanCmd -> HumanCmd -> HumanCmd Source #

Ord TriggerItem Source # |

Instance details

Defined in Game.LambdaHack.Client.UI.HumanCmd

Methods

compare :: TriggerItem -> TriggerItem -> Ordering Source #

(<) :: TriggerItem -> TriggerItem -> Bool Source #

(<=) :: TriggerItem -> TriggerItem -> Bool Source #

(>) :: TriggerItem -> TriggerItem -> Bool Source #

(>=) :: TriggerItem -> TriggerItem -> Bool Source #

max :: TriggerItem -> TriggerItem -> TriggerItem Source #

min :: TriggerItem -> TriggerItem -> TriggerItem Source #

Ord KM Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Key Methods compare :: KM -> KM -> Ordering Source # (<) :: KM -> KM -> Bool Source # (<=) :: KM -> KM -> Bool Source # (>) :: KM -> KM -> Bool Source # (>=) :: KM -> KM -> Bool Source # max :: KM -> KM -> KM Source # min :: KM -> KM -> KM Source #
Ord Key Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Key Methods compare :: Key -> Key -> Ordering Source # (<) :: Key -> Key -> Bool Source # (<=) :: Key -> Key -> Bool Source # (>) :: Key -> Key -> Bool Source # (>=) :: Key -> Key -> Bool Source # max :: Key -> Key -> Key Source # min :: Key -> Key -> Key Source #
Ord Modifier Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Key Methods compare :: Modifier -> Modifier -> Ordering Source # (<) :: Modifier -> Modifier -> Bool Source # (<=) :: Modifier -> Modifier -> Bool Source # (>) :: Modifier -> Modifier -> Bool Source # (>=) :: Modifier -> Modifier -> Bool Source # max :: Modifier -> Modifier -> Modifier Source # min :: Modifier -> Modifier -> Modifier Source #
Ord Msg Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods compare :: Msg -> Msg -> Ordering Source # (<) :: Msg -> Msg -> Bool Source # (<=) :: Msg -> Msg -> Bool Source # (>) :: Msg -> Msg -> Bool Source # (>=) :: Msg -> Msg -> Bool Source # max :: Msg -> Msg -> Msg Source # min :: Msg -> Msg -> Msg Source #
Ord MsgClass Source # |
Instance details Defined in Game.LambdaHack.Client.UI.Msg Methods compare :: MsgClass -> MsgClass -> Ordering Source # (<) :: MsgClass -> MsgClass -> Bool Source # (<=) :: MsgClass -> MsgClass -> Bool Source # (>) :: MsgClass -> MsgClass -> Bool Source # (>=) :: MsgClass -> MsgClass -> Bool Source # max :: MsgClass -> MsgClass -> MsgClass Source # min :: MsgClass -> MsgClass -> MsgClass Source #
Ord MsgClassDistinct Source # |

Instance details

Defined in Game.LambdaHack.Client.UI.Msg

Methods

compare :: MsgClassDistinct -> MsgClassDistinct -> Ordering Source #

(<) :: MsgClassDistinct -> MsgClassDistinct -> Bool Source #

(<=) :: MsgClassDistinct -> MsgClassDistinct -> Bool Source #

(>) :: MsgClassDistinct -> MsgClassDistinct -> Bool Source #

(>=) :: MsgClassDistinct -> MsgClassDistinct -> Bool Source #

max :: MsgClassDistinct -> MsgClassDistinct -> MsgClassDistinct Source #

min :: MsgClassDistinct -> MsgClassDistinct -> MsgClassDistinct Source #

Ord MsgClassIgnore Source # |

Instance details

Defined in Game.LambdaHack.Client.UI.Msg

Methods

compare :: MsgClassIgnore -> MsgClassIgnore -> Ordering Source #

(<) :: MsgClassIgnore -> MsgClassIgnore -> Bool Source #

(<=) :: MsgClassIgnore -> MsgClassIgnore -> Bool Source #

(>) :: MsgClassIgnore -> MsgClassIgnore -> Bool Source #

(>=) :: MsgClassIgnore -> MsgClassIgnore -> Bool Source #

max :: MsgClassIgnore -> MsgClassIgnore -> MsgClassIgnore Source #

min :: MsgClassIgnore -> MsgClassIgnore -> MsgClassIgnore Source #

Ord MsgClassSave Source # |

Instance details

Defined in Game.LambdaHack.Client.UI.Msg

Methods

compare :: MsgClassSave -> MsgClassSave -> Ordering Source #

(<) :: MsgClassSave -> MsgClassSave -> Bool Source #

(<=) :: MsgClassSave -> MsgClassSave -> Bool Source #

(>) :: MsgClassSave -> MsgClassSave -> Bool Source #

(>=) :: MsgClassSave -> MsgClassSave -> Bool Source #

max :: MsgClassSave -> MsgClassSave -> MsgClassSave Source #

min :: MsgClassSave -> MsgClassSave -> MsgClassSave Source #

Ord MsgClassShow Source # |

Instance details

Defined in Game.LambdaHack.Client.UI.Msg

Methods

compare :: MsgClassShow -> MsgClassShow -> Ordering Source #

(<) :: MsgClassShow -> MsgClassShow -> Bool Source #

(<=) :: MsgClassShow -> MsgClassShow -> Bool Source #

(>) :: MsgClassShow -> MsgClassShow -> Bool Source #

(>=) :: MsgClassShow -> MsgClassShow -> Bool Source #

max :: MsgClassShow -> MsgClassShow -> MsgClassShow Source #

min :: MsgClassShow -> MsgClassShow -> MsgClassShow Source #

Ord MsgClassShowAndSave Source # |

Instance details

Defined in Game.LambdaHack.Client.UI.Msg

Methods

compare :: MsgClassShowAndSave -> MsgClassShowAndSave -> Ordering Source #

(<) :: MsgClassShowAndSave -> MsgClassShowAndSave -> Bool Source #

(<=) :: MsgClassShowAndSave -> MsgClassShowAndSave -> Bool Source #

(>) :: MsgClassShowAndSave -> MsgClassShowAndSave -> Bool Source #

(>=) :: MsgClassShowAndSave -> MsgClassShowAndSave -> Bool Source #

max :: MsgClassShowAndSave -> MsgClassShowAndSave -> MsgClassShowAndSave Source #

min :: MsgClassShowAndSave -> MsgClassShowAndSave -> MsgClassShowAndSave Source #

Ord MenuSlot Source # |

Instance details

Defined in Game.LambdaHack.Client.UI.Slideshow

Methods

compare :: MenuSlot -> MenuSlot -> Ordering Source #

(<) :: MenuSlot -> MenuSlot -> Bool Source #

(<=) :: MenuSlot -> MenuSlot -> Bool Source #

(>) :: MenuSlot -> MenuSlot -> Bool Source #

(>=) :: MenuSlot -> MenuSlot -> Bool Source #

max :: MenuSlot -> MenuSlot -> MenuSlot Source #

min :: MenuSlot -> MenuSlot -> MenuSlot Source #

Ord Challenge Source # |

Instance details

Defined in Game.LambdaHack.Common.Faction

Methods

compare :: Challenge -> Challenge -> Ordering Source #

(<) :: Challenge -> Challenge -> Bool Source #

(<=) :: Challenge -> Challenge -> Bool Source #

(>) :: Challenge -> Challenge -> Bool Source #

(>=) :: Challenge -> Challenge -> Bool Source #

max :: Challenge -> Challenge -> Challenge Source #

min :: Challenge -> Challenge -> Challenge Source #

Ord Diplomacy Source # |

Instance details

Defined in Game.LambdaHack.Common.Faction

Methods

compare :: Diplomacy -> Diplomacy -> Ordering Source #

(<) :: Diplomacy -> Diplomacy -> Bool Source #

(<=) :: Diplomacy -> Diplomacy -> Bool Source #

(>) :: Diplomacy -> Diplomacy -> Bool Source #

(>=) :: Diplomacy -> Diplomacy -> Bool Source #

max :: Diplomacy -> Diplomacy -> Diplomacy Source #

min :: Diplomacy -> Diplomacy -> Diplomacy Source #

Ord Status Source # |
Instance details Defined in Game.LambdaHack.Common.Faction Methods compare :: Status -> Status -> Ordering Source # (<) :: Status -> Status -> Bool Source # (<=) :: Status -> Status -> Bool Source # (>) :: Status -> Status -> Bool Source # (>=) :: Status -> Status -> Bool Source # max :: Status -> Status -> Status Source # min :: Status -> Status -> Status Source #
Ord ScoreRecord Source # |

Instance details

Defined in Game.LambdaHack.Common.HighScore

Methods

compare :: ScoreRecord -> ScoreRecord -> Ordering Source #

(<) :: ScoreRecord -> ScoreRecord -> Bool Source #

(<=) :: ScoreRecord -> ScoreRecord -> Bool Source #

(>) :: ScoreRecord -> ScoreRecord -> Bool Source #

(>=) :: ScoreRecord -> ScoreRecord -> Bool Source #

max :: ScoreRecord -> ScoreRecord -> ScoreRecord Source #

min :: ScoreRecord -> ScoreRecord -> ScoreRecord Source #

Ord ItemDisco Source # |

Instance details

Defined in Game.LambdaHack.Common.Item

Methods

compare :: ItemDisco -> ItemDisco -> Ordering Source #

(<) :: ItemDisco -> ItemDisco -> Bool Source #

(<=) :: ItemDisco -> ItemDisco -> Bool Source #

(>) :: ItemDisco -> ItemDisco -> Bool Source #

(>=) :: ItemDisco -> ItemDisco -> Bool Source #

max :: ItemDisco -> ItemDisco -> ItemDisco Source #

min :: ItemDisco -> ItemDisco -> ItemDisco Source #

Ord ItemKindIx Source # |

Instance details

Defined in Game.LambdaHack.Common.Item

Methods

compare :: ItemKindIx -> ItemKindIx -> Ordering Source #

(<) :: ItemKindIx -> ItemKindIx -> Bool Source #

(<=) :: ItemKindIx -> ItemKindIx -> Bool Source #

(>) :: ItemKindIx -> ItemKindIx -> Bool Source #

(>=) :: ItemKindIx -> ItemKindIx -> Bool Source #

max :: ItemKindIx -> ItemKindIx -> ItemKindIx Source #

min :: ItemKindIx -> ItemKindIx -> ItemKindIx Source #

Ord AspectRecord Source # |

Instance details

Defined in Game.LambdaHack.Common.ItemAspect

Methods

compare :: AspectRecord -> AspectRecord -> Ordering Source #

(<) :: AspectRecord -> AspectRecord -> Bool Source #

(<=) :: AspectRecord -> AspectRecord -> Bool Source #

(>) :: AspectRecord -> AspectRecord -> Bool Source #

(>=) :: AspectRecord -> AspectRecord -> Bool Source #

max :: AspectRecord -> AspectRecord -> AspectRecord Source #

min :: AspectRecord -> AspectRecord -> AspectRecord Source #

Ord KindMean Source # |

Instance details

Defined in Game.LambdaHack.Common.ItemAspect

Methods

compare :: KindMean -> KindMean -> Ordering Source #

(<) :: KindMean -> KindMean -> Bool Source #

(<=) :: KindMean -> KindMean -> Bool Source #

(>) :: KindMean -> KindMean -> Bool Source #

(>=) :: KindMean -> KindMean -> Bool Source #

max :: KindMean -> KindMean -> KindMean Source #

min :: KindMean -> KindMean -> KindMean Source #

Ord Point Source # |
Instance details Defined in Game.LambdaHack.Common.Point Methods compare :: Point -> Point -> Ordering Source # (<) :: Point -> Point -> Bool Source # (<=) :: Point -> Point -> Bool Source # (>) :: Point -> Point -> Bool Source # (>=) :: Point -> Point -> Bool Source # max :: Point -> Point -> Point Source # min :: Point -> Point -> Point Source #
Ord Speed Source # |
Instance details Defined in Game.LambdaHack.Common.Time Methods compare :: Speed -> Speed -> Ordering Source # (<) :: Speed -> Speed -> Bool Source # (<=) :: Speed -> Speed -> Bool Source # (>) :: Speed -> Speed -> Bool Source # (>=) :: Speed -> Speed -> Bool Source # max :: Speed -> Speed -> Speed Source # min :: Speed -> Speed -> Speed Source #
Ord Time Source # |
Instance details Defined in Game.LambdaHack.Common.Time Methods compare :: Time -> Time -> Ordering Source # (<) :: Time -> Time -> Bool Source # (<=) :: Time -> Time -> Bool Source # (>) :: Time -> Time -> Bool Source # (>=) :: Time -> Time -> Bool Source # max :: Time -> Time -> Time Source # min :: Time -> Time -> Time Source #
Ord ActorId Source # |
Instance details Defined in Game.LambdaHack.Common.Types Methods compare :: ActorId -> ActorId -> Ordering Source # (<) :: ActorId -> ActorId -> Bool Source # (<=) :: ActorId -> ActorId -> Bool Source # (>) :: ActorId -> ActorId -> Bool Source # (>=) :: ActorId -> ActorId -> Bool Source # max :: ActorId -> ActorId -> ActorId Source # min :: ActorId -> ActorId -> ActorId Source #
Ord Container Source # |

Instance details

Defined in Game.LambdaHack.Common.Types

Methods

compare :: Container -> Container -> Ordering Source #

(<) :: Container -> Container -> Bool Source #

(<=) :: Container -> Container -> Bool Source #

(>) :: Container -> Container -> Bool Source #

(>=) :: Container -> Container -> Bool Source #

max :: Container -> Container -> Container Source #

min :: Container -> Container -> Container Source #

Ord FactionId Source # |

Instance details

Defined in Game.LambdaHack.Common.Types

Methods

compare :: FactionId -> FactionId -> Ordering Source #

(<) :: FactionId -> FactionId -> Bool Source #

(<=) :: FactionId -> FactionId -> Bool Source #

(>) :: FactionId -> FactionId -> Bool Source #

(>=) :: FactionId -> FactionId -> Bool Source #

max :: FactionId -> FactionId -> FactionId Source #

min :: FactionId -> FactionId -> FactionId Source #

Ord ItemId Source # |
Instance details Defined in Game.LambdaHack.Common.Types Methods compare :: ItemId -> ItemId -> Ordering Source # (<) :: ItemId -> ItemId -> Bool Source # (<=) :: ItemId -> ItemId -> Bool Source # (>) :: ItemId -> ItemId -> Bool Source # (>=) :: ItemId -> ItemId -> Bool Source # max :: ItemId -> ItemId -> ItemId Source # min :: ItemId -> ItemId -> ItemId Source #
Ord LevelId Source # |
Instance details Defined in Game.LambdaHack.Common.Types Methods compare :: LevelId -> LevelId -> Ordering Source # (<) :: LevelId -> LevelId -> Bool Source # (<=) :: LevelId -> LevelId -> Bool Source # (>) :: LevelId -> LevelId -> Bool Source # (>=) :: LevelId -> LevelId -> Bool Source # max :: LevelId -> LevelId -> LevelId Source # min :: LevelId -> LevelId -> LevelId Source #
Ord Vector Source # |
Instance details Defined in Game.LambdaHack.Common.Vector Methods compare :: Vector -> Vector -> Ordering Source # (<) :: Vector -> Vector -> Bool Source # (<=) :: Vector -> Vector -> Bool Source # (>) :: Vector -> Vector -> Bool Source # (>=) :: Vector -> Vector -> Bool Source # max :: Vector -> Vector -> Vector Source # min :: Vector -> Vector -> Vector Source #
Ord Outcome Source # |
Instance details Defined in Game.LambdaHack.Content.FactionKind Methods compare :: Outcome -> Outcome -> Ordering Source # (<) :: Outcome -> Outcome -> Bool Source # (<=) :: Outcome -> Outcome -> Bool Source # (>) :: Outcome -> Outcome -> Bool Source # (>=) :: Outcome -> Outcome -> Bool Source # max :: Outcome -> Outcome -> Outcome Source # min :: Outcome -> Outcome -> Outcome Source #
Ord TeamContinuity Source # |

Instance details

Defined in Game.LambdaHack.Content.FactionKind

Methods

compare :: TeamContinuity -> TeamContinuity -> Ordering Source #

(<) :: TeamContinuity -> TeamContinuity -> Bool Source #

(<=) :: TeamContinuity -> TeamContinuity -> Bool Source #

(>) :: TeamContinuity -> TeamContinuity -> Bool Source #

(>=) :: TeamContinuity -> TeamContinuity -> Bool Source #

max :: TeamContinuity -> TeamContinuity -> TeamContinuity Source #

min :: TeamContinuity -> TeamContinuity -> TeamContinuity Source #

Ord ThrowMod Source # |

Instance details

Defined in Game.LambdaHack.Content.ItemKind

Methods

compare :: ThrowMod -> ThrowMod -> Ordering Source #

(<) :: ThrowMod -> ThrowMod -> Bool Source #

(<=) :: ThrowMod -> ThrowMod -> Bool Source #

(>) :: ThrowMod -> ThrowMod -> Bool Source #

(>=) :: ThrowMod -> ThrowMod -> Bool Source #

max :: ThrowMod -> ThrowMod -> ThrowMod Source #

min :: ThrowMod -> ThrowMod -> ThrowMod Source #

Ord AbsDepth Source # |
Instance details Defined in Game.LambdaHack.Core.Dice Methods compare :: AbsDepth -> AbsDepth -> Ordering Source # (<) :: AbsDepth -> AbsDepth -> Bool Source # (<=) :: AbsDepth -> AbsDepth -> Bool Source # (>) :: AbsDepth -> AbsDepth -> Bool Source # (>=) :: AbsDepth -> AbsDepth -> Bool Source # max :: AbsDepth -> AbsDepth -> AbsDepth Source # min :: AbsDepth -> AbsDepth -> AbsDepth Source #
Ord EqpSlot Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods compare :: EqpSlot -> EqpSlot -> Ordering Source # (<) :: EqpSlot -> EqpSlot -> Bool Source # (<=) :: EqpSlot -> EqpSlot -> Bool Source # (>) :: EqpSlot -> EqpSlot -> Bool Source # (>=) :: EqpSlot -> EqpSlot -> Bool Source # max :: EqpSlot -> EqpSlot -> EqpSlot Source # min :: EqpSlot -> EqpSlot -> EqpSlot Source #
Ord Flags Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods compare :: Flags -> Flags -> Ordering Source # (<) :: Flags -> Flags -> Bool Source # (<=) :: Flags -> Flags -> Bool Source # (>) :: Flags -> Flags -> Bool Source # (>=) :: Flags -> Flags -> Bool Source # max :: Flags -> Flags -> Flags Source # min :: Flags -> Flags -> Flags Source #
Ord Skills Source # |
Instance details Defined in Game.LambdaHack.Definition.Ability Methods compare :: Skills -> Skills -> Ordering Source # (<) :: Skills -> Skills -> Bool Source # (<=) :: Skills -> Skills -> Bool Source # (>) :: Skills -> Skills -> Bool Source # (>=) :: Skills -> Skills -> Bool Source # max :: Skills -> Skills -> Skills Source # min :: Skills -> Skills -> Skills Source #
Ord AttrCharW32 Source # |

Instance details

Defined in Game.LambdaHack.Definition.Color

Methods

compare :: AttrCharW32 -> AttrCharW32 -> Ordering Source #

(<) :: AttrCharW32 -> AttrCharW32 -> Bool Source #

(<=) :: AttrCharW32 -> AttrCharW32 -> Bool Source #

(>) :: AttrCharW32 -> AttrCharW32 -> Bool Source #

(>=) :: AttrCharW32 -> AttrCharW32 -> Bool Source #

max :: AttrCharW32 -> AttrCharW32 -> AttrCharW32 Source #

min :: AttrCharW32 -> AttrCharW32 -> AttrCharW32 Source #

Ord Color Source # |
Instance details Defined in Game.LambdaHack.Definition.Color Methods compare :: Color -> Color -> Ordering Source # (<) :: Color -> Color -> Bool Source # (<=) :: Color -> Color -> Bool Source # (>) :: Color -> Color -> Bool Source # (>=) :: Color -> Color -> Bool Source # max :: Color -> Color -> Color Source # min :: Color -> Color -> Color Source #
Ord Highlight Source # |

Instance details

Defined in Game.LambdaHack.Definition.Color

Methods

compare :: Highlight -> Highlight -> Ordering Source #

(<) :: Highlight -> Highlight -> Bool Source #

(<=) :: Highlight -> Highlight -> Bool Source #

(>) :: Highlight -> Highlight -> Bool Source #

(>=) :: Highlight -> Highlight -> Bool Source #

max :: Highlight -> Highlight -> Highlight Source #

min :: Highlight -> Highlight -> Highlight Source #

Ord CStore Source # |
Instance details Defined in Game.LambdaHack.Definition.Defs Methods compare :: CStore -> CStore -> Ordering Source # (<) :: CStore -> CStore -> Bool Source # (<=) :: CStore -> CStore -> Bool Source # (>) :: CStore -> CStore -> Bool Source # (>=) :: CStore -> CStore -> Bool Source # max :: CStore -> CStore -> CStore Source # min :: CStore -> CStore -> CStore Source #
Ord Direction Source # |

Instance details

Defined in Game.LambdaHack.Definition.Defs

Methods

compare :: Direction -> Direction -> Ordering Source #

(<) :: Direction -> Direction -> Bool Source #

(<=) :: Direction -> Direction -> Bool Source #

(>) :: Direction -> Direction -> Bool Source #

(>=) :: Direction -> Direction -> Bool Source #

max :: Direction -> Direction -> Direction Source #

min :: Direction -> Direction -> Direction Source #

Ord ItemDialogMode Source # |

Instance details

Defined in Game.LambdaHack.Definition.Defs

Methods

compare :: ItemDialogMode -> ItemDialogMode -> Ordering Source #

(<) :: ItemDialogMode -> ItemDialogMode -> Bool Source #

(<=) :: ItemDialogMode -> ItemDialogMode -> Bool Source #

(>) :: ItemDialogMode -> ItemDialogMode -> Bool Source #

(>=) :: ItemDialogMode -> ItemDialogMode -> Bool Source #

max :: ItemDialogMode -> ItemDialogMode -> ItemDialogMode Source #

min :: ItemDialogMode -> ItemDialogMode -> ItemDialogMode Source #

Ord SLore Source # |
Instance details Defined in Game.LambdaHack.Definition.Defs Methods compare :: SLore -> SLore -> Ordering Source # (<) :: SLore -> SLore -> Bool Source # (<=) :: SLore -> SLore -> Bool Source # (>) :: SLore -> SLore -> Bool Source # (>=) :: SLore -> SLore -> Bool Source # max :: SLore -> SLore -> SLore Source # min :: SLore -> SLore -> SLore Source #
Ord FancyName Source # |

Instance details

Defined in Game.LambdaHack.Definition.Flavour

Methods

compare :: FancyName -> FancyName -> Ordering Source #

(<) :: FancyName -> FancyName -> Bool Source #

(<=) :: FancyName -> FancyName -> Bool Source #

(>) :: FancyName -> FancyName -> Bool Source #

(>=) :: FancyName -> FancyName -> Bool Source #

max :: FancyName -> FancyName -> FancyName Source #

min :: FancyName -> FancyName -> FancyName Source #

Ord Flavour Source # |
Instance details Defined in Game.LambdaHack.Definition.Flavour Methods compare :: Flavour -> Flavour -> Ordering Source # (<) :: Flavour -> Flavour -> Bool Source # (<=) :: Flavour -> Flavour -> Bool Source # (>) :: Flavour -> Flavour -> Bool Source # (>=) :: Flavour -> Flavour -> Bool Source # max :: Flavour -> Flavour -> Flavour Source # min :: Flavour -> Flavour -> Flavour Source #
Ord UseResult Source # |

Instance details

Defined in Game.LambdaHack.Server.HandleEffectM

Methods

compare :: UseResult -> UseResult -> Ordering Source #

(<) :: UseResult -> UseResult -> Bool Source #

(<=) :: UseResult -> UseResult -> Bool Source #

(>) :: UseResult -> UseResult -> Bool Source #

(>=) :: UseResult -> UseResult -> Bool Source #

max :: UseResult -> UseResult -> UseResult Source #

min :: UseResult -> UseResult -> UseResult Source #

Ord ASCIIString |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

compare :: ASCIIString -> ASCIIString -> Ordering Source #

(<) :: ASCIIString -> ASCIIString -> Bool Source #

(<=) :: ASCIIString -> ASCIIString -> Bool Source #

(>) :: ASCIIString -> ASCIIString -> Bool Source #

(>=) :: ASCIIString -> ASCIIString -> Bool Source #

max :: ASCIIString -> ASCIIString -> ASCIIString Source #

min :: ASCIIString -> ASCIIString -> ASCIIString Source #

Ord PrintableString |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

compare :: PrintableString -> PrintableString -> Ordering Source #

(<) :: PrintableString -> PrintableString -> Bool Source #

(<=) :: PrintableString -> PrintableString -> Bool Source #

(>) :: PrintableString -> PrintableString -> Bool Source #

(>=) :: PrintableString -> PrintableString -> Bool Source #

max :: PrintableString -> PrintableString -> PrintableString Source #

min :: PrintableString -> PrintableString -> PrintableString Source #

Ord UnicodeString |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

compare :: UnicodeString -> UnicodeString -> Ordering Source #

(<) :: UnicodeString -> UnicodeString -> Bool Source #

(<=) :: UnicodeString -> UnicodeString -> Bool Source #

(>) :: UnicodeString -> UnicodeString -> Bool Source #

(>=) :: UnicodeString -> UnicodeString -> Bool Source #

max :: UnicodeString -> UnicodeString -> UnicodeString Source #

min :: UnicodeString -> UnicodeString -> UnicodeString Source #

Ord OrdA |
Instance details Defined in Test.QuickCheck.Poly Methods compare :: OrdA -> OrdA -> Ordering Source # (<) :: OrdA -> OrdA -> Bool Source # (<=) :: OrdA -> OrdA -> Bool Source # (>) :: OrdA -> OrdA -> Bool Source # (>=) :: OrdA -> OrdA -> Bool Source # max :: OrdA -> OrdA -> OrdA Source # min :: OrdA -> OrdA -> OrdA Source #
Ord OrdB |
Instance details Defined in Test.QuickCheck.Poly Methods compare :: OrdB -> OrdB -> Ordering Source # (<) :: OrdB -> OrdB -> Bool Source # (<=) :: OrdB -> OrdB -> Bool Source # (>) :: OrdB -> OrdB -> Bool Source # (>=) :: OrdB -> OrdB -> Bool Source # max :: OrdB -> OrdB -> OrdB Source # min :: OrdB -> OrdB -> OrdB Source #
Ord OrdC |
Instance details Defined in Test.QuickCheck.Poly Methods compare :: OrdC -> OrdC -> Ordering Source # (<) :: OrdC -> OrdC -> Bool Source # (<=) :: OrdC -> OrdC -> Bool Source # (>) :: OrdC -> OrdC -> Bool Source # (>=) :: OrdC -> OrdC -> Bool Source # max :: OrdC -> OrdC -> OrdC Source # min :: OrdC -> OrdC -> OrdC Source #
Ord DotNetTime |

Instance details

Defined in Data.Aeson.Types.Internal

Methods

compare :: DotNetTime -> DotNetTime -> Ordering Source #

(<) :: DotNetTime -> DotNetTime -> Bool Source #

(<=) :: DotNetTime -> DotNetTime -> Bool Source #

(>) :: DotNetTime -> DotNetTime -> Bool Source #

(>=) :: DotNetTime -> DotNetTime -> Bool Source #

max :: DotNetTime -> DotNetTime -> DotNetTime Source #

min :: DotNetTime -> DotNetTime -> DotNetTime Source #

Ord JSONPathElement |

Instance details

Defined in Data.Aeson.Types.Internal

Methods

compare :: JSONPathElement -> JSONPathElement -> Ordering Source #

(<) :: JSONPathElement -> JSONPathElement -> Bool Source #

(<=) :: JSONPathElement -> JSONPathElement -> Bool Source #

(>) :: JSONPathElement -> JSONPathElement -> Bool Source #

(>=) :: JSONPathElement -> JSONPathElement -> Bool Source #

max :: JSONPathElement -> JSONPathElement -> JSONPathElement Source #

min :: JSONPathElement -> JSONPathElement -> JSONPathElement Source #

Ord Value |
Instance details Defined in Data.Aeson.Types.Internal Methods compare :: Value -> Value -> Ordering Source # (<) :: Value -> Value -> Bool Source # (<=) :: Value -> Value -> Bool Source # (>) :: Value -> Value -> Bool Source # (>=) :: Value -> Value -> Bool Source # max :: Value -> Value -> Value Source # min :: Value -> Value -> Value Source #
Ord BlinkSpeed |

Instance details

Defined in System.Console.ANSI.Types

Methods

compare :: BlinkSpeed -> BlinkSpeed -> Ordering Source #

(<) :: BlinkSpeed -> BlinkSpeed -> Bool Source #

(<=) :: BlinkSpeed -> BlinkSpeed -> Bool Source #

(>) :: BlinkSpeed -> BlinkSpeed -> Bool Source #

(>=) :: BlinkSpeed -> BlinkSpeed -> Bool Source #

max :: BlinkSpeed -> BlinkSpeed -> BlinkSpeed Source #

min :: BlinkSpeed -> BlinkSpeed -> BlinkSpeed Source #

Ord Color |
Instance details Defined in System.Console.ANSI.Types Methods compare :: Color -> Color -> Ordering Source # (<) :: Color -> Color -> Bool Source # (<=) :: Color -> Color -> Bool Source # (>) :: Color -> Color -> Bool Source # (>=) :: Color -> Color -> Bool Source # max :: Color -> Color -> Color Source # min :: Color -> Color -> Color Source #
Ord ColorIntensity |

Instance details

Defined in System.Console.ANSI.Types

Methods

compare :: ColorIntensity -> ColorIntensity -> Ordering Source #

(<) :: ColorIntensity -> ColorIntensity -> Bool Source #

(<=) :: ColorIntensity -> ColorIntensity -> Bool Source #

(>) :: ColorIntensity -> ColorIntensity -> Bool Source #

(>=) :: ColorIntensity -> ColorIntensity -> Bool Source #

max :: ColorIntensity -> ColorIntensity -> ColorIntensity Source #

min :: ColorIntensity -> ColorIntensity -> ColorIntensity Source #

Ord ConsoleIntensity |

Instance details

Defined in System.Console.ANSI.Types

Methods

compare :: ConsoleIntensity -> ConsoleIntensity -> Ordering Source #

(<) :: ConsoleIntensity -> ConsoleIntensity -> Bool Source #

(<=) :: ConsoleIntensity -> ConsoleIntensity -> Bool Source #

(>) :: ConsoleIntensity -> ConsoleIntensity -> Bool Source #

(>=) :: ConsoleIntensity -> ConsoleIntensity -> Bool Source #

max :: ConsoleIntensity -> ConsoleIntensity -> ConsoleIntensity Source #

min :: ConsoleIntensity -> ConsoleIntensity -> ConsoleIntensity Source #

Ord ConsoleLayer |

Instance details

Defined in System.Console.ANSI.Types

Methods

compare :: ConsoleLayer -> ConsoleLayer -> Ordering Source #

(<) :: ConsoleLayer -> ConsoleLayer -> Bool Source #

(<=) :: ConsoleLayer -> ConsoleLayer -> Bool Source #

(>) :: ConsoleLayer -> ConsoleLayer -> Bool Source #

(>=) :: ConsoleLayer -> ConsoleLayer -> Bool Source #

max :: ConsoleLayer -> ConsoleLayer -> ConsoleLayer Source #

min :: ConsoleLayer -> ConsoleLayer -> ConsoleLayer Source #

Ord Underlining |

Instance details

Defined in System.Console.ANSI.Types

Methods

compare :: Underlining -> Underlining -> Ordering Source #

(<) :: Underlining -> Underlining -> Bool Source #

(<=) :: Underlining -> Underlining -> Bool Source #

(>) :: Underlining -> Underlining -> Bool Source #

(>=) :: Underlining -> Underlining -> Bool Source #

max :: Underlining -> Underlining -> Underlining Source #

min :: Underlining -> Underlining -> Underlining Source #

Ord ByteArray | 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
Instance details Defined in Data.Array.Byte Methods compare :: ByteArray -> ByteArray -> Ordering Source # (<) :: ByteArray -> ByteArray -> Bool Source # (<=) :: ByteArray -> ByteArray -> Bool Source # (>) :: ByteArray -> ByteArray -> Bool Source # (>=) :: ByteArray -> ByteArray -> Bool Source # max :: ByteArray -> ByteArray -> ByteArray Source # min :: ByteArray -> ByteArray -> ByteArray Source #
Ord ByteString |

Instance details

Defined in Data.ByteString.Internal.Type

Methods

compare :: ByteString -> ByteString -> Ordering Source #

(<) :: ByteString -> ByteString -> Bool Source #

(<=) :: ByteString -> ByteString -> Bool Source #

(>) :: ByteString -> ByteString -> Bool Source #

(>=) :: ByteString -> ByteString -> Bool Source #

max :: ByteString -> ByteString -> ByteString Source #

min :: ByteString -> ByteString -> ByteString Source #

Ord ByteString |

Instance details

Defined in Data.ByteString.Lazy.Internal

Methods

compare :: ByteString -> ByteString -> Ordering Source #

(<) :: ByteString -> ByteString -> Bool Source #

(<=) :: ByteString -> ByteString -> Bool Source #

(>) :: ByteString -> ByteString -> Bool Source #

(>=) :: ByteString -> ByteString -> Bool Source #

max :: ByteString -> ByteString -> ByteString Source #

min :: ByteString -> ByteString -> ByteString Source #

Ord ShortByteString | Lexicographic order.

Instance details

Defined in Data.ByteString.Short.Internal

Methods

compare :: ShortByteString -> ShortByteString -> Ordering Source #

(<) :: ShortByteString -> ShortByteString -> Bool Source #

(<=) :: ShortByteString -> ShortByteString -> Bool Source #

(>) :: ShortByteString -> ShortByteString -> Bool Source #

(>=) :: ShortByteString -> ShortByteString -> Bool Source #

max :: ShortByteString -> ShortByteString -> ShortByteString Source #

min :: ShortByteString -> ShortByteString -> ShortByteString Source #

Ord IntSet |
Instance details Defined in Data.IntSet.Internal Methods compare :: IntSet -> IntSet -> Ordering Source # (<) :: IntSet -> IntSet -> Bool Source # (<=) :: IntSet -> IntSet -> Bool Source # (>) :: IntSet -> IntSet -> Bool Source # (>=) :: IntSet -> IntSet -> Bool Source # max :: IntSet -> IntSet -> IntSet Source # min :: IntSet -> IntSet -> IntSet Source #
Ord BigNat |
Instance details Defined in GHC.Num.BigNat Methods compare :: BigNat -> BigNat -> Ordering Source # (<) :: BigNat -> BigNat -> Bool Source # (<=) :: BigNat -> BigNat -> Bool Source # (>) :: BigNat -> BigNat -> Bool Source # (>=) :: BigNat -> BigNat -> Bool Source # max :: BigNat -> BigNat -> BigNat Source # min :: BigNat -> BigNat -> BigNat Source #
Ord Extension |

Instance details

Defined in GHC.LanguageExtensions.Type

Methods

compare :: Extension -> Extension -> Ordering Source #

(<) :: Extension -> Extension -> Bool Source #

(<=) :: Extension -> Extension -> Bool Source #

(>) :: Extension -> Extension -> Bool Source #

(>=) :: Extension -> Extension -> Bool Source #

max :: Extension -> Extension -> Extension Source #

min :: Extension -> Extension -> Extension Source #

Ord Void | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Base Methods compare :: Void -> Void -> Ordering Source # (<) :: Void -> Void -> Bool Source # (<=) :: Void -> Void -> Bool Source # (>) :: Void -> Void -> Bool Source # (>=) :: Void -> Void -> Bool Source # max :: Void -> Void -> Void Source # min :: Void -> Void -> Void Source #
Ord ByteOrder | Since: base-4.11.0.0

Instance details

Defined in GHC.Internal.ByteOrder

Methods

compare :: ByteOrder -> ByteOrder -> Ordering Source #

(<) :: ByteOrder -> ByteOrder -> Bool Source #

(<=) :: ByteOrder -> ByteOrder -> Bool Source #

(>) :: ByteOrder -> ByteOrder -> Bool Source #

(>=) :: ByteOrder -> ByteOrder -> Bool Source #

max :: ByteOrder -> ByteOrder -> ByteOrder Source #

min :: ByteOrder -> ByteOrder -> ByteOrder Source #

Ord BlockReason | Since: base-4.3.0.0

Instance details

Defined in GHC.Internal.Conc.Sync

Methods

compare :: BlockReason -> BlockReason -> Ordering Source #

(<) :: BlockReason -> BlockReason -> Bool Source #

(<=) :: BlockReason -> BlockReason -> Bool Source #

(>) :: BlockReason -> BlockReason -> Bool Source #

(>=) :: BlockReason -> BlockReason -> Bool Source #

max :: BlockReason -> BlockReason -> BlockReason Source #

min :: BlockReason -> BlockReason -> BlockReason Source #

Ord ThreadId | Since: base-4.2.0.0
Instance details Defined in GHC.Internal.Conc.Sync Methods compare :: ThreadId -> ThreadId -> Ordering Source # (<) :: ThreadId -> ThreadId -> Bool Source # (<=) :: ThreadId -> ThreadId -> Bool Source # (>) :: ThreadId -> ThreadId -> Bool Source # (>=) :: ThreadId -> ThreadId -> Bool Source # max :: ThreadId -> ThreadId -> ThreadId Source # min :: ThreadId -> ThreadId -> ThreadId Source #
Ord ThreadStatus | Since: base-4.3.0.0

Instance details

Defined in GHC.Internal.Conc.Sync

Methods

compare :: ThreadStatus -> ThreadStatus -> Ordering Source #

(<) :: ThreadStatus -> ThreadStatus -> Bool Source #

(<=) :: ThreadStatus -> ThreadStatus -> Bool Source #

(>) :: ThreadStatus -> ThreadStatus -> Bool Source #

(>=) :: ThreadStatus -> ThreadStatus -> Bool Source #

max :: ThreadStatus -> ThreadStatus -> ThreadStatus Source #

min :: ThreadStatus -> ThreadStatus -> ThreadStatus Source #

Ord All | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods compare :: All -> All -> Ordering Source # (<) :: All -> All -> Bool Source # (<=) :: All -> All -> Bool Source # (>) :: All -> All -> Bool Source # (>=) :: All -> All -> Bool Source # max :: All -> All -> All Source # min :: All -> All -> All Source #
Ord Any | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods compare :: Any -> Any -> Ordering Source # (<) :: Any -> Any -> Bool Source # (<=) :: Any -> Any -> Bool Source # (>) :: Any -> Any -> Bool Source # (>=) :: Any -> Any -> Bool Source # max :: Any -> Any -> Any Source # min :: Any -> Any -> Any Source #
Ord SomeTypeRep |

Instance details

Defined in GHC.Internal.Data.Typeable.Internal

Methods

compare :: SomeTypeRep -> SomeTypeRep -> Ordering Source #

(<) :: SomeTypeRep -> SomeTypeRep -> Bool Source #

(<=) :: SomeTypeRep -> SomeTypeRep -> Bool Source #

(>) :: SomeTypeRep -> SomeTypeRep -> Bool Source #

(>=) :: SomeTypeRep -> SomeTypeRep -> Bool Source #

max :: SomeTypeRep -> SomeTypeRep -> SomeTypeRep Source #

min :: SomeTypeRep -> SomeTypeRep -> SomeTypeRep Source #

Ord Version | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Version Methods compare :: Version -> Version -> Ordering Source # (<) :: Version -> Version -> Bool Source # (<=) :: Version -> Version -> Bool Source # (>) :: Version -> Version -> Bool Source # (>=) :: Version -> Version -> Bool Source # max :: Version -> Version -> Version Source # min :: Version -> Version -> Version Source #
Ord ErrorCall | Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Exception

Methods

compare :: ErrorCall -> ErrorCall -> Ordering Source #

(<) :: ErrorCall -> ErrorCall -> Bool Source #

(<=) :: ErrorCall -> ErrorCall -> Bool Source #

(>) :: ErrorCall -> ErrorCall -> Bool Source #

(>=) :: ErrorCall -> ErrorCall -> Bool Source #

max :: ErrorCall -> ErrorCall -> ErrorCall Source #

min :: ErrorCall -> ErrorCall -> ErrorCall Source #

Ord ArithException | Since: base-3.0

Instance details

Defined in GHC.Internal.Exception.Type

Methods

compare :: ArithException -> ArithException -> Ordering Source #

(<) :: ArithException -> ArithException -> Bool Source #

(<=) :: ArithException -> ArithException -> Bool Source #

(>) :: ArithException -> ArithException -> Bool Source #

(>=) :: ArithException -> ArithException -> Bool Source #

max :: ArithException -> ArithException -> ArithException Source #

min :: ArithException -> ArithException -> ArithException Source #

Ord CBool |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CBool -> CBool -> Ordering Source # (<) :: CBool -> CBool -> Bool Source # (<=) :: CBool -> CBool -> Bool Source # (>) :: CBool -> CBool -> Bool Source # (>=) :: CBool -> CBool -> Bool Source # max :: CBool -> CBool -> CBool Source # min :: CBool -> CBool -> CBool Source #
Ord CChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CChar -> CChar -> Ordering Source # (<) :: CChar -> CChar -> Bool Source # (<=) :: CChar -> CChar -> Bool Source # (>) :: CChar -> CChar -> Bool Source # (>=) :: CChar -> CChar -> Bool Source # max :: CChar -> CChar -> CChar Source # min :: CChar -> CChar -> CChar Source #
Ord CClock |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CClock -> CClock -> Ordering Source # (<) :: CClock -> CClock -> Bool Source # (<=) :: CClock -> CClock -> Bool Source # (>) :: CClock -> CClock -> Bool Source # (>=) :: CClock -> CClock -> Bool Source # max :: CClock -> CClock -> CClock Source # min :: CClock -> CClock -> CClock Source #
Ord CDouble |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CDouble -> CDouble -> Ordering Source # (<) :: CDouble -> CDouble -> Bool Source # (<=) :: CDouble -> CDouble -> Bool Source # (>) :: CDouble -> CDouble -> Bool Source # (>=) :: CDouble -> CDouble -> Bool Source # max :: CDouble -> CDouble -> CDouble Source # min :: CDouble -> CDouble -> CDouble Source #
Ord CFloat |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CFloat -> CFloat -> Ordering Source # (<) :: CFloat -> CFloat -> Bool Source # (<=) :: CFloat -> CFloat -> Bool Source # (>) :: CFloat -> CFloat -> Bool Source # (>=) :: CFloat -> CFloat -> Bool Source # max :: CFloat -> CFloat -> CFloat Source # min :: CFloat -> CFloat -> CFloat Source #
Ord CInt |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CInt -> CInt -> Ordering Source # (<) :: CInt -> CInt -> Bool Source # (<=) :: CInt -> CInt -> Bool Source # (>) :: CInt -> CInt -> Bool Source # (>=) :: CInt -> CInt -> Bool Source # max :: CInt -> CInt -> CInt Source # min :: CInt -> CInt -> CInt Source #
Ord CIntMax |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CIntMax -> CIntMax -> Ordering Source # (<) :: CIntMax -> CIntMax -> Bool Source # (<=) :: CIntMax -> CIntMax -> Bool Source # (>) :: CIntMax -> CIntMax -> Bool Source # (>=) :: CIntMax -> CIntMax -> Bool Source # max :: CIntMax -> CIntMax -> CIntMax Source # min :: CIntMax -> CIntMax -> CIntMax Source #
Ord CIntPtr |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CIntPtr -> CIntPtr -> Ordering Source # (<) :: CIntPtr -> CIntPtr -> Bool Source # (<=) :: CIntPtr -> CIntPtr -> Bool Source # (>) :: CIntPtr -> CIntPtr -> Bool Source # (>=) :: CIntPtr -> CIntPtr -> Bool Source # max :: CIntPtr -> CIntPtr -> CIntPtr Source # min :: CIntPtr -> CIntPtr -> CIntPtr Source #
Ord CLLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CLLong -> CLLong -> Ordering Source # (<) :: CLLong -> CLLong -> Bool Source # (<=) :: CLLong -> CLLong -> Bool Source # (>) :: CLLong -> CLLong -> Bool Source # (>=) :: CLLong -> CLLong -> Bool Source # max :: CLLong -> CLLong -> CLLong Source # min :: CLLong -> CLLong -> CLLong Source #
Ord CLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CLong -> CLong -> Ordering Source # (<) :: CLong -> CLong -> Bool Source # (<=) :: CLong -> CLong -> Bool Source # (>) :: CLong -> CLong -> Bool Source # (>=) :: CLong -> CLong -> Bool Source # max :: CLong -> CLong -> CLong Source # min :: CLong -> CLong -> CLong Source #
Ord CPtrdiff |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CPtrdiff -> CPtrdiff -> Ordering Source # (<) :: CPtrdiff -> CPtrdiff -> Bool Source # (<=) :: CPtrdiff -> CPtrdiff -> Bool Source # (>) :: CPtrdiff -> CPtrdiff -> Bool Source # (>=) :: CPtrdiff -> CPtrdiff -> Bool Source # max :: CPtrdiff -> CPtrdiff -> CPtrdiff Source # min :: CPtrdiff -> CPtrdiff -> CPtrdiff Source #
Ord CSChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CSChar -> CSChar -> Ordering Source # (<) :: CSChar -> CSChar -> Bool Source # (<=) :: CSChar -> CSChar -> Bool Source # (>) :: CSChar -> CSChar -> Bool Source # (>=) :: CSChar -> CSChar -> Bool Source # max :: CSChar -> CSChar -> CSChar Source # min :: CSChar -> CSChar -> CSChar Source #
Ord CSUSeconds |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

compare :: CSUSeconds -> CSUSeconds -> Ordering Source #

(<) :: CSUSeconds -> CSUSeconds -> Bool Source #

(<=) :: CSUSeconds -> CSUSeconds -> Bool Source #

(>) :: CSUSeconds -> CSUSeconds -> Bool Source #

(>=) :: CSUSeconds -> CSUSeconds -> Bool Source #

max :: CSUSeconds -> CSUSeconds -> CSUSeconds Source #

min :: CSUSeconds -> CSUSeconds -> CSUSeconds Source #

Ord CShort |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CShort -> CShort -> Ordering Source # (<) :: CShort -> CShort -> Bool Source # (<=) :: CShort -> CShort -> Bool Source # (>) :: CShort -> CShort -> Bool Source # (>=) :: CShort -> CShort -> Bool Source # max :: CShort -> CShort -> CShort Source # min :: CShort -> CShort -> CShort Source #
Ord CSigAtomic |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

compare :: CSigAtomic -> CSigAtomic -> Ordering Source #

(<) :: CSigAtomic -> CSigAtomic -> Bool Source #

(<=) :: CSigAtomic -> CSigAtomic -> Bool Source #

(>) :: CSigAtomic -> CSigAtomic -> Bool Source #

(>=) :: CSigAtomic -> CSigAtomic -> Bool Source #

max :: CSigAtomic -> CSigAtomic -> CSigAtomic Source #

min :: CSigAtomic -> CSigAtomic -> CSigAtomic Source #

Ord CSize |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CSize -> CSize -> Ordering Source # (<) :: CSize -> CSize -> Bool Source # (<=) :: CSize -> CSize -> Bool Source # (>) :: CSize -> CSize -> Bool Source # (>=) :: CSize -> CSize -> Bool Source # max :: CSize -> CSize -> CSize Source # min :: CSize -> CSize -> CSize Source #
Ord CTime |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CTime -> CTime -> Ordering Source # (<) :: CTime -> CTime -> Bool Source # (<=) :: CTime -> CTime -> Bool Source # (>) :: CTime -> CTime -> Bool Source # (>=) :: CTime -> CTime -> Bool Source # max :: CTime -> CTime -> CTime Source # min :: CTime -> CTime -> CTime Source #
Ord CUChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CUChar -> CUChar -> Ordering Source # (<) :: CUChar -> CUChar -> Bool Source # (<=) :: CUChar -> CUChar -> Bool Source # (>) :: CUChar -> CUChar -> Bool Source # (>=) :: CUChar -> CUChar -> Bool Source # max :: CUChar -> CUChar -> CUChar Source # min :: CUChar -> CUChar -> CUChar Source #
Ord CUInt |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CUInt -> CUInt -> Ordering Source # (<) :: CUInt -> CUInt -> Bool Source # (<=) :: CUInt -> CUInt -> Bool Source # (>) :: CUInt -> CUInt -> Bool Source # (>=) :: CUInt -> CUInt -> Bool Source # max :: CUInt -> CUInt -> CUInt Source # min :: CUInt -> CUInt -> CUInt Source #
Ord CUIntMax |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CUIntMax -> CUIntMax -> Ordering Source # (<) :: CUIntMax -> CUIntMax -> Bool Source # (<=) :: CUIntMax -> CUIntMax -> Bool Source # (>) :: CUIntMax -> CUIntMax -> Bool Source # (>=) :: CUIntMax -> CUIntMax -> Bool Source # max :: CUIntMax -> CUIntMax -> CUIntMax Source # min :: CUIntMax -> CUIntMax -> CUIntMax Source #
Ord CUIntPtr |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CUIntPtr -> CUIntPtr -> Ordering Source # (<) :: CUIntPtr -> CUIntPtr -> Bool Source # (<=) :: CUIntPtr -> CUIntPtr -> Bool Source # (>) :: CUIntPtr -> CUIntPtr -> Bool Source # (>=) :: CUIntPtr -> CUIntPtr -> Bool Source # max :: CUIntPtr -> CUIntPtr -> CUIntPtr Source # min :: CUIntPtr -> CUIntPtr -> CUIntPtr Source #
Ord CULLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CULLong -> CULLong -> Ordering Source # (<) :: CULLong -> CULLong -> Bool Source # (<=) :: CULLong -> CULLong -> Bool Source # (>) :: CULLong -> CULLong -> Bool Source # (>=) :: CULLong -> CULLong -> Bool Source # max :: CULLong -> CULLong -> CULLong Source # min :: CULLong -> CULLong -> CULLong Source #
Ord CULong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CULong -> CULong -> Ordering Source # (<) :: CULong -> CULong -> Bool Source # (<=) :: CULong -> CULong -> Bool Source # (>) :: CULong -> CULong -> Bool Source # (>=) :: CULong -> CULong -> Bool Source # max :: CULong -> CULong -> CULong Source # min :: CULong -> CULong -> CULong Source #
Ord CUSeconds |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

compare :: CUSeconds -> CUSeconds -> Ordering Source #

(<) :: CUSeconds -> CUSeconds -> Bool Source #

(<=) :: CUSeconds -> CUSeconds -> Bool Source #

(>) :: CUSeconds -> CUSeconds -> Bool Source #

(>=) :: CUSeconds -> CUSeconds -> Bool Source #

max :: CUSeconds -> CUSeconds -> CUSeconds Source #

min :: CUSeconds -> CUSeconds -> CUSeconds Source #

Ord CUShort |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CUShort -> CUShort -> Ordering Source # (<) :: CUShort -> CUShort -> Bool Source # (<=) :: CUShort -> CUShort -> Bool Source # (>) :: CUShort -> CUShort -> Bool Source # (>=) :: CUShort -> CUShort -> Bool Source # max :: CUShort -> CUShort -> CUShort Source # min :: CUShort -> CUShort -> CUShort Source #
Ord CWchar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods compare :: CWchar -> CWchar -> Ordering Source # (<) :: CWchar -> CWchar -> Bool Source # (<=) :: CWchar -> CWchar -> Bool Source # (>) :: CWchar -> CWchar -> Bool Source # (>=) :: CWchar -> CWchar -> Bool Source # max :: CWchar -> CWchar -> CWchar Source # min :: CWchar -> CWchar -> CWchar Source #
Ord Associativity | Since: base-4.6.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: Associativity -> Associativity -> Ordering Source #

(<) :: Associativity -> Associativity -> Bool Source #

(<=) :: Associativity -> Associativity -> Bool Source #

(>) :: Associativity -> Associativity -> Bool Source #

(>=) :: Associativity -> Associativity -> Bool Source #

max :: Associativity -> Associativity -> Associativity Source #

min :: Associativity -> Associativity -> Associativity Source #

Ord DecidedStrictness | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: DecidedStrictness -> DecidedStrictness -> Ordering Source #

(<) :: DecidedStrictness -> DecidedStrictness -> Bool Source #

(<=) :: DecidedStrictness -> DecidedStrictness -> Bool Source #

(>) :: DecidedStrictness -> DecidedStrictness -> Bool Source #

(>=) :: DecidedStrictness -> DecidedStrictness -> Bool Source #

max :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness Source #

min :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness Source #

Ord Fixity | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Generics Methods compare :: Fixity -> Fixity -> Ordering Source # (<) :: Fixity -> Fixity -> Bool Source # (<=) :: Fixity -> Fixity -> Bool Source # (>) :: Fixity -> Fixity -> Bool Source # (>=) :: Fixity -> Fixity -> Bool Source # max :: Fixity -> Fixity -> Fixity Source # min :: Fixity -> Fixity -> Fixity Source #
Ord SourceStrictness | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: SourceStrictness -> SourceStrictness -> Ordering Source #

(<) :: SourceStrictness -> SourceStrictness -> Bool Source #

(<=) :: SourceStrictness -> SourceStrictness -> Bool Source #

(>) :: SourceStrictness -> SourceStrictness -> Bool Source #

(>=) :: SourceStrictness -> SourceStrictness -> Bool Source #

max :: SourceStrictness -> SourceStrictness -> SourceStrictness Source #

min :: SourceStrictness -> SourceStrictness -> SourceStrictness Source #

Ord SourceUnpackedness | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: SourceUnpackedness -> SourceUnpackedness -> Ordering Source #

(<) :: SourceUnpackedness -> SourceUnpackedness -> Bool Source #

(<=) :: SourceUnpackedness -> SourceUnpackedness -> Bool Source #

(>) :: SourceUnpackedness -> SourceUnpackedness -> Bool Source #

(>=) :: SourceUnpackedness -> SourceUnpackedness -> Bool Source #

max :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness Source #

min :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness Source #

Ord ArrayException | Since: base-4.2.0.0

Instance details

Defined in GHC.Internal.IO.Exception

Methods

compare :: ArrayException -> ArrayException -> Ordering Source #

(<) :: ArrayException -> ArrayException -> Bool Source #

(<=) :: ArrayException -> ArrayException -> Bool Source #

(>) :: ArrayException -> ArrayException -> Bool Source #

(>=) :: ArrayException -> ArrayException -> Bool Source #

max :: ArrayException -> ArrayException -> ArrayException Source #

min :: ArrayException -> ArrayException -> ArrayException Source #

Ord AsyncException | Since: base-4.2.0.0

Instance details

Defined in GHC.Internal.IO.Exception

Methods

compare :: AsyncException -> AsyncException -> Ordering Source #

(<) :: AsyncException -> AsyncException -> Bool Source #

(<=) :: AsyncException -> AsyncException -> Bool Source #

(>) :: AsyncException -> AsyncException -> Bool Source #

(>=) :: AsyncException -> AsyncException -> Bool Source #

max :: AsyncException -> AsyncException -> AsyncException Source #

min :: AsyncException -> AsyncException -> AsyncException Source #

Ord ExitCode |
Instance details Defined in GHC.Internal.IO.Exception Methods compare :: ExitCode -> ExitCode -> Ordering Source # (<) :: ExitCode -> ExitCode -> Bool Source # (<=) :: ExitCode -> ExitCode -> Bool Source # (>) :: ExitCode -> ExitCode -> Bool Source # (>=) :: ExitCode -> ExitCode -> Bool Source # max :: ExitCode -> ExitCode -> ExitCode Source # min :: ExitCode -> ExitCode -> ExitCode Source #
Ord BufferMode | Since: base-4.2.0.0

Instance details

Defined in GHC.Internal.IO.Handle.Types

Methods

compare :: BufferMode -> BufferMode -> Ordering Source #

(<) :: BufferMode -> BufferMode -> Bool Source #

(<=) :: BufferMode -> BufferMode -> Bool Source #

(>) :: BufferMode -> BufferMode -> Bool Source #

(>=) :: BufferMode -> BufferMode -> Bool Source #

max :: BufferMode -> BufferMode -> BufferMode Source #

min :: BufferMode -> BufferMode -> BufferMode Source #

Ord Newline | Since: base-4.3.0.0
Instance details Defined in GHC.Internal.IO.Handle.Types Methods compare :: Newline -> Newline -> Ordering Source # (<) :: Newline -> Newline -> Bool Source # (<=) :: Newline -> Newline -> Bool Source # (>) :: Newline -> Newline -> Bool Source # (>=) :: Newline -> Newline -> Bool Source # max :: Newline -> Newline -> Newline Source # min :: Newline -> Newline -> Newline Source #
Ord NewlineMode | Since: base-4.3.0.0

Instance details

Defined in GHC.Internal.IO.Handle.Types

Methods

compare :: NewlineMode -> NewlineMode -> Ordering Source #

(<) :: NewlineMode -> NewlineMode -> Bool Source #

(<=) :: NewlineMode -> NewlineMode -> Bool Source #

(>) :: NewlineMode -> NewlineMode -> Bool Source #

(>=) :: NewlineMode -> NewlineMode -> Bool Source #

max :: NewlineMode -> NewlineMode -> NewlineMode Source #

min :: NewlineMode -> NewlineMode -> NewlineMode Source #

Ord IOMode | Since: base-4.2.0.0
Instance details Defined in GHC.Internal.IO.IOMode Methods compare :: IOMode -> IOMode -> Ordering Source # (<) :: IOMode -> IOMode -> Bool Source # (<=) :: IOMode -> IOMode -> Bool Source # (>) :: IOMode -> IOMode -> Bool Source # (>=) :: IOMode -> IOMode -> Bool Source # max :: IOMode -> IOMode -> IOMode Source # min :: IOMode -> IOMode -> IOMode Source #
Ord Int16 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods compare :: Int16 -> Int16 -> Ordering Source # (<) :: Int16 -> Int16 -> Bool Source # (<=) :: Int16 -> Int16 -> Bool Source # (>) :: Int16 -> Int16 -> Bool Source # (>=) :: Int16 -> Int16 -> Bool Source # max :: Int16 -> Int16 -> Int16 Source # min :: Int16 -> Int16 -> Int16 Source #
Ord Int32 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods compare :: Int32 -> Int32 -> Ordering Source # (<) :: Int32 -> Int32 -> Bool Source # (<=) :: Int32 -> Int32 -> Bool Source # (>) :: Int32 -> Int32 -> Bool Source # (>=) :: Int32 -> Int32 -> Bool Source # max :: Int32 -> Int32 -> Int32 Source # min :: Int32 -> Int32 -> Int32 Source #
Ord Int64 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods compare :: Int64 -> Int64 -> Ordering Source # (<) :: Int64 -> Int64 -> Bool Source # (<=) :: Int64 -> Int64 -> Bool Source # (>) :: Int64 -> Int64 -> Bool Source # (>=) :: Int64 -> Int64 -> Bool Source # max :: Int64 -> Int64 -> Int64 Source # min :: Int64 -> Int64 -> Int64 Source #
Ord Int8 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods compare :: Int8 -> Int8 -> Ordering Source # (<) :: Int8 -> Int8 -> Bool Source # (<=) :: Int8 -> Int8 -> Bool Source # (>) :: Int8 -> Int8 -> Bool Source # (>=) :: Int8 -> Int8 -> Bool Source # max :: Int8 -> Int8 -> Int8 Source # min :: Int8 -> Int8 -> Int8 Source #
Ord SomeNat | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.TypeNats Methods compare :: SomeNat -> SomeNat -> Ordering Source # (<) :: SomeNat -> SomeNat -> Bool Source # (<=) :: SomeNat -> SomeNat -> Bool Source # (>) :: SomeNat -> SomeNat -> Bool Source # (>=) :: SomeNat -> SomeNat -> Bool Source # max :: SomeNat -> SomeNat -> SomeNat Source # min :: SomeNat -> SomeNat -> SomeNat Source #
Ord GeneralCategory | Since: base-2.1

Instance details

Defined in GHC.Internal.Unicode

Methods

compare :: GeneralCategory -> GeneralCategory -> Ordering Source #

(<) :: GeneralCategory -> GeneralCategory -> Bool Source #

(<=) :: GeneralCategory -> GeneralCategory -> Bool Source #

(>) :: GeneralCategory -> GeneralCategory -> Bool Source #

(>=) :: GeneralCategory -> GeneralCategory -> Bool Source #

max :: GeneralCategory -> GeneralCategory -> GeneralCategory Source #

min :: GeneralCategory -> GeneralCategory -> GeneralCategory Source #

Ord Word16 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods compare :: Word16 -> Word16 -> Ordering Source # (<) :: Word16 -> Word16 -> Bool Source # (<=) :: Word16 -> Word16 -> Bool Source # (>) :: Word16 -> Word16 -> Bool Source # (>=) :: Word16 -> Word16 -> Bool Source # max :: Word16 -> Word16 -> Word16 Source # min :: Word16 -> Word16 -> Word16 Source #
Ord Word32 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods compare :: Word32 -> Word32 -> Ordering Source # (<) :: Word32 -> Word32 -> Bool Source # (<=) :: Word32 -> Word32 -> Bool Source # (>) :: Word32 -> Word32 -> Bool Source # (>=) :: Word32 -> Word32 -> Bool Source # max :: Word32 -> Word32 -> Word32 Source # min :: Word32 -> Word32 -> Word32 Source #
Ord Word64 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods compare :: Word64 -> Word64 -> Ordering Source # (<) :: Word64 -> Word64 -> Bool Source # (<=) :: Word64 -> Word64 -> Bool Source # (>) :: Word64 -> Word64 -> Bool Source # (>=) :: Word64 -> Word64 -> Bool Source # max :: Word64 -> Word64 -> Word64 Source # min :: Word64 -> Word64 -> Word64 Source #
Ord Word8 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods compare :: Word8 -> Word8 -> Ordering Source # (<) :: Word8 -> Word8 -> Bool Source # (<=) :: Word8 -> Word8 -> Bool Source # (>) :: Word8 -> Word8 -> Bool Source # (>=) :: Word8 -> Word8 -> Bool Source # max :: Word8 -> Word8 -> Word8 Source # min :: Word8 -> Word8 -> Word8 Source #
Ord Ordering |
Instance details Defined in GHC.Classes Methods compare :: Ordering -> Ordering -> Ordering Source # (<) :: Ordering -> Ordering -> Bool Source # (<=) :: Ordering -> Ordering -> Bool Source # (>) :: Ordering -> Ordering -> Bool Source # (>=) :: Ordering -> Ordering -> Bool Source # max :: Ordering -> Ordering -> Ordering Source # min :: Ordering -> Ordering -> Ordering Source #
Ord TyCon |
Instance details Defined in GHC.Classes Methods compare :: TyCon -> TyCon -> Ordering Source # (<) :: TyCon -> TyCon -> Bool Source # (<=) :: TyCon -> TyCon -> Bool Source # (>) :: TyCon -> TyCon -> Bool Source # (>=) :: TyCon -> TyCon -> Bool Source # max :: TyCon -> TyCon -> TyCon Source # min :: TyCon -> TyCon -> TyCon Source #
Ord Part |
Instance details Defined in NLP.Miniutter.English Methods compare :: Part -> Part -> Ordering Source # (<) :: Part -> Part -> Bool Source # (<=) :: Part -> Part -> Bool Source # (>) :: Part -> Part -> Bool Source # (>=) :: Part -> Part -> Bool Source # max :: Part -> Part -> Part Source # min :: Part -> Part -> Part Source #
Ord Person |
Instance details Defined in NLP.Miniutter.English Methods compare :: Person -> Person -> Ordering Source # (<) :: Person -> Person -> Bool Source # (<=) :: Person -> Person -> Bool Source # (>) :: Person -> Person -> Bool Source # (>=) :: Person -> Person -> Bool Source # max :: Person -> Person -> Person Source # min :: Person -> Person -> Person Source #
Ord Polarity |
Instance details Defined in NLP.Miniutter.English Methods compare :: Polarity -> Polarity -> Ordering Source # (<) :: Polarity -> Polarity -> Bool Source # (<=) :: Polarity -> Polarity -> Bool Source # (>) :: Polarity -> Polarity -> Bool Source # (>=) :: Polarity -> Polarity -> Bool Source # max :: Polarity -> Polarity -> Polarity Source # min :: Polarity -> Polarity -> Polarity Source #
Ord URI |
Instance details Defined in Network.URI Methods compare :: URI -> URI -> Ordering Source # (<) :: URI -> URI -> Bool Source # (<=) :: URI -> URI -> Bool Source # (>) :: URI -> URI -> Bool Source # (>=) :: URI -> URI -> Bool Source # max :: URI -> URI -> URI Source # min :: URI -> URI -> URI Source #
Ord URIAuth |
Instance details Defined in Network.URI Methods compare :: URIAuth -> URIAuth -> Ordering Source # (<) :: URIAuth -> URIAuth -> Bool Source # (<=) :: URIAuth -> URIAuth -> Bool Source # (>) :: URIAuth -> URIAuth -> Bool Source # (>=) :: URIAuth -> URIAuth -> Bool Source # max :: URIAuth -> URIAuth -> URIAuth Source # min :: URIAuth -> URIAuth -> URIAuth Source #
Ord Richness |

Instance details

Defined in Options.Applicative.BashCompletion

Methods

compare :: Richness -> Richness -> Ordering Source #

(<) :: Richness -> Richness -> Bool Source #

(<=) :: Richness -> Richness -> Bool Source #

(>) :: Richness -> Richness -> Bool Source #

(>=) :: Richness -> Richness -> Bool Source #

max :: Richness -> Richness -> Richness Source #

min :: Richness -> Richness -> Richness Source #

Ord Parenthetic |

Instance details

Defined in Options.Applicative.Help.Core

Methods

compare :: Parenthetic -> Parenthetic -> Ordering Source #

(<) :: Parenthetic -> Parenthetic -> Bool Source #

(<=) :: Parenthetic -> Parenthetic -> Bool Source #

(>) :: Parenthetic -> Parenthetic -> Bool Source #

(>=) :: Parenthetic -> Parenthetic -> Bool Source #

max :: Parenthetic -> Parenthetic -> Parenthetic Source #

min :: Parenthetic -> Parenthetic -> Parenthetic Source #

Ord ArgPolicy |

Instance details

Defined in Options.Applicative.Types

Methods

compare :: ArgPolicy -> ArgPolicy -> Ordering Source #

(<) :: ArgPolicy -> ArgPolicy -> Bool Source #

(<=) :: ArgPolicy -> ArgPolicy -> Bool Source #

(>) :: ArgPolicy -> ArgPolicy -> Bool Source #

(>=) :: ArgPolicy -> ArgPolicy -> Bool Source #

max :: ArgPolicy -> ArgPolicy -> ArgPolicy Source #

min :: ArgPolicy -> ArgPolicy -> ArgPolicy Source #

Ord OptName |
Instance details Defined in Options.Applicative.Types Methods compare :: OptName -> OptName -> Ordering Source # (<) :: OptName -> OptName -> Bool Source # (<=) :: OptName -> OptName -> Bool Source # (>) :: OptName -> OptName -> Bool Source # (>=) :: OptName -> OptName -> Bool Source # max :: OptName -> OptName -> OptName Source # min :: OptName -> OptName -> OptName Source #
Ord OptVisibility |

Instance details

Defined in Options.Applicative.Types

Methods

compare :: OptVisibility -> OptVisibility -> Ordering Source #

(<) :: OptVisibility -> OptVisibility -> Bool Source #

(<=) :: OptVisibility -> OptVisibility -> Bool Source #

(>) :: OptVisibility -> OptVisibility -> Bool Source #

(>=) :: OptVisibility -> OptVisibility -> Bool Source #

max :: OptVisibility -> OptVisibility -> OptVisibility Source #

min :: OptVisibility -> OptVisibility -> OptVisibility Source #

Ord OsChar | Byte ordering of the internal representation.
Instance details Defined in System.OsString.Internal.Types Methods compare :: OsChar -> OsChar -> Ordering Source # (<) :: OsChar -> OsChar -> Bool Source # (<=) :: OsChar -> OsChar -> Bool Source # (>) :: OsChar -> OsChar -> Bool Source # (>=) :: OsChar -> OsChar -> Bool Source # max :: OsChar -> OsChar -> OsChar Source # min :: OsChar -> OsChar -> OsChar Source #
Ord OsString | Byte ordering of the internal representation.
Instance details Defined in System.OsString.Internal.Types Methods compare :: OsString -> OsString -> Ordering Source # (<) :: OsString -> OsString -> Bool Source # (<=) :: OsString -> OsString -> Bool Source # (>) :: OsString -> OsString -> Bool Source # (>=) :: OsString -> OsString -> Bool Source # max :: OsString -> OsString -> OsString Source # min :: OsString -> OsString -> OsString Source #
Ord PosixChar |

Instance details

Defined in System.OsString.Internal.Types

Methods

compare :: PosixChar -> PosixChar -> Ordering Source #

(<) :: PosixChar -> PosixChar -> Bool Source #

(<=) :: PosixChar -> PosixChar -> Bool Source #

(>) :: PosixChar -> PosixChar -> Bool Source #

(>=) :: PosixChar -> PosixChar -> Bool Source #

max :: PosixChar -> PosixChar -> PosixChar Source #

min :: PosixChar -> PosixChar -> PosixChar Source #

Ord PosixString |

Instance details

Defined in System.OsString.Internal.Types

Methods

compare :: PosixString -> PosixString -> Ordering Source #

(<) :: PosixString -> PosixString -> Bool Source #

(<=) :: PosixString -> PosixString -> Bool Source #

(>) :: PosixString -> PosixString -> Bool Source #

(>=) :: PosixString -> PosixString -> Bool Source #

max :: PosixString -> PosixString -> PosixString Source #

min :: PosixString -> PosixString -> PosixString Source #

Ord WindowsChar |

Instance details

Defined in System.OsString.Internal.Types

Methods

compare :: WindowsChar -> WindowsChar -> Ordering Source #

(<) :: WindowsChar -> WindowsChar -> Bool Source #

(<=) :: WindowsChar -> WindowsChar -> Bool Source #

(>) :: WindowsChar -> WindowsChar -> Bool Source #

(>=) :: WindowsChar -> WindowsChar -> Bool Source #

max :: WindowsChar -> WindowsChar -> WindowsChar Source #

min :: WindowsChar -> WindowsChar -> WindowsChar Source #

Ord WindowsString |

Instance details

Defined in System.OsString.Internal.Types

Methods

compare :: WindowsString -> WindowsString -> Ordering Source #

(<) :: WindowsString -> WindowsString -> Bool Source #

(<=) :: WindowsString -> WindowsString -> Bool Source #

(>) :: WindowsString -> WindowsString -> Bool Source #

(>=) :: WindowsString -> WindowsString -> Bool Source #

max :: WindowsString -> WindowsString -> WindowsString Source #

min :: WindowsString -> WindowsString -> WindowsString Source #

Ord FusionDepth |

Instance details

Defined in Prettyprinter.Internal

Methods

compare :: FusionDepth -> FusionDepth -> Ordering Source #

(<) :: FusionDepth -> FusionDepth -> Bool Source #

(<=) :: FusionDepth -> FusionDepth -> Bool Source #

(>) :: FusionDepth -> FusionDepth -> Bool Source #

(>=) :: FusionDepth -> FusionDepth -> Bool Source #

max :: FusionDepth -> FusionDepth -> FusionDepth Source #

min :: FusionDepth -> FusionDepth -> FusionDepth Source #

Ord LayoutOptions |

Instance details

Defined in Prettyprinter.Internal

Methods

compare :: LayoutOptions -> LayoutOptions -> Ordering Source #

(<) :: LayoutOptions -> LayoutOptions -> Bool Source #

(<=) :: LayoutOptions -> LayoutOptions -> Bool Source #

(>) :: LayoutOptions -> LayoutOptions -> Bool Source #

(>=) :: LayoutOptions -> LayoutOptions -> Bool Source #

max :: LayoutOptions -> LayoutOptions -> LayoutOptions Source #

min :: LayoutOptions -> LayoutOptions -> LayoutOptions Source #

Ord PageWidth |

Instance details

Defined in Prettyprinter.Internal

Methods

compare :: PageWidth -> PageWidth -> Ordering Source #

(<) :: PageWidth -> PageWidth -> Bool Source #

(<=) :: PageWidth -> PageWidth -> Bool Source #

(>) :: PageWidth -> PageWidth -> Bool Source #

(>=) :: PageWidth -> PageWidth -> Bool Source #

max :: PageWidth -> PageWidth -> PageWidth Source #

min :: PageWidth -> PageWidth -> PageWidth Source #

Ord Scientific |

Instance details

Defined in Data.Scientific

Methods

compare :: Scientific -> Scientific -> Ordering Source #

(<) :: Scientific -> Scientific -> Bool Source #

(<=) :: Scientific -> Scientific -> Bool Source #

(>) :: Scientific -> Scientific -> Bool Source #

(>=) :: Scientific -> Scientific -> Bool Source #

max :: Scientific -> Scientific -> Scientific Source #

min :: Scientific -> Scientific -> Scientific Source #

Ord AudioDeviceStatus |

Instance details

Defined in SDL.Audio

Methods

compare :: AudioDeviceStatus -> AudioDeviceStatus -> Ordering Source #

(<) :: AudioDeviceStatus -> AudioDeviceStatus -> Bool Source #

(<=) :: AudioDeviceStatus -> AudioDeviceStatus -> Bool Source #

(>) :: AudioDeviceStatus -> AudioDeviceStatus -> Bool Source #

(>=) :: AudioDeviceStatus -> AudioDeviceStatus -> Bool Source #

max :: AudioDeviceStatus -> AudioDeviceStatus -> AudioDeviceStatus Source #

min :: AudioDeviceStatus -> AudioDeviceStatus -> AudioDeviceStatus Source #

Ord AudioDeviceUsage |

Instance details

Defined in SDL.Audio

Methods

compare :: AudioDeviceUsage -> AudioDeviceUsage -> Ordering Source #

(<) :: AudioDeviceUsage -> AudioDeviceUsage -> Bool Source #

(<=) :: AudioDeviceUsage -> AudioDeviceUsage -> Bool Source #

(>) :: AudioDeviceUsage -> AudioDeviceUsage -> Bool Source #

(>=) :: AudioDeviceUsage -> AudioDeviceUsage -> Bool Source #

max :: AudioDeviceUsage -> AudioDeviceUsage -> AudioDeviceUsage Source #

min :: AudioDeviceUsage -> AudioDeviceUsage -> AudioDeviceUsage Source #

Ord Channels |
Instance details Defined in SDL.Audio Methods compare :: Channels -> Channels -> Ordering Source # (<) :: Channels -> Channels -> Bool Source # (<=) :: Channels -> Channels -> Bool Source # (>) :: Channels -> Channels -> Bool Source # (>=) :: Channels -> Channels -> Bool Source # max :: Channels -> Channels -> Channels Source # min :: Channels -> Channels -> Channels Source #
Ord LockState |
Instance details Defined in SDL.Audio Methods compare :: LockState -> LockState -> Ordering Source # (<) :: LockState -> LockState -> Bool Source # (<=) :: LockState -> LockState -> Bool Source # (>) :: LockState -> LockState -> Bool Source # (>=) :: LockState -> LockState -> Bool Source # max :: LockState -> LockState -> LockState Source # min :: LockState -> LockState -> LockState Source #
Ord PlaybackState |

Instance details

Defined in SDL.Audio

Methods

compare :: PlaybackState -> PlaybackState -> Ordering Source #

(<) :: PlaybackState -> PlaybackState -> Bool Source #

(<=) :: PlaybackState -> PlaybackState -> Bool Source #

(>) :: PlaybackState -> PlaybackState -> Bool Source #

(>=) :: PlaybackState -> PlaybackState -> Bool Source #

max :: PlaybackState -> PlaybackState -> PlaybackState Source #

min :: PlaybackState -> PlaybackState -> PlaybackState Source #

Ord AudioDeviceEventData |

Instance details

Defined in SDL.Event

Methods

compare :: AudioDeviceEventData -> AudioDeviceEventData -> Ordering Source #

(<) :: AudioDeviceEventData -> AudioDeviceEventData -> Bool Source #

(<=) :: AudioDeviceEventData -> AudioDeviceEventData -> Bool Source #

(>) :: AudioDeviceEventData -> AudioDeviceEventData -> Bool Source #

(>=) :: AudioDeviceEventData -> AudioDeviceEventData -> Bool Source #

max :: AudioDeviceEventData -> AudioDeviceEventData -> AudioDeviceEventData Source #

min :: AudioDeviceEventData -> AudioDeviceEventData -> AudioDeviceEventData Source #

Ord ControllerAxisEventData |

Instance details

Defined in SDL.Event

Methods

compare :: ControllerAxisEventData -> ControllerAxisEventData -> Ordering Source #

(<) :: ControllerAxisEventData -> ControllerAxisEventData -> Bool Source #

(<=) :: ControllerAxisEventData -> ControllerAxisEventData -> Bool Source #

(>) :: ControllerAxisEventData -> ControllerAxisEventData -> Bool Source #

(>=) :: ControllerAxisEventData -> ControllerAxisEventData -> Bool Source #

max :: ControllerAxisEventData -> ControllerAxisEventData -> ControllerAxisEventData Source #

min :: ControllerAxisEventData -> ControllerAxisEventData -> ControllerAxisEventData Source #

Ord ControllerButtonEventData |

Instance details

Defined in SDL.Event

Methods

compare :: ControllerButtonEventData -> ControllerButtonEventData -> Ordering Source #

(<) :: ControllerButtonEventData -> ControllerButtonEventData -> Bool Source #

(<=) :: ControllerButtonEventData -> ControllerButtonEventData -> Bool Source #

(>) :: ControllerButtonEventData -> ControllerButtonEventData -> Bool Source #

(>=) :: ControllerButtonEventData -> ControllerButtonEventData -> Bool Source #

max :: ControllerButtonEventData -> ControllerButtonEventData -> ControllerButtonEventData Source #

min :: ControllerButtonEventData -> ControllerButtonEventData -> ControllerButtonEventData Source #

Ord ControllerDeviceEventData |

Instance details

Defined in SDL.Event

Methods

compare :: ControllerDeviceEventData -> ControllerDeviceEventData -> Ordering Source #

(<) :: ControllerDeviceEventData -> ControllerDeviceEventData -> Bool Source #

(<=) :: ControllerDeviceEventData -> ControllerDeviceEventData -> Bool Source #

(>) :: ControllerDeviceEventData -> ControllerDeviceEventData -> Bool Source #

(>=) :: ControllerDeviceEventData -> ControllerDeviceEventData -> Bool Source #

max :: ControllerDeviceEventData -> ControllerDeviceEventData -> ControllerDeviceEventData Source #

min :: ControllerDeviceEventData -> ControllerDeviceEventData -> ControllerDeviceEventData Source #

Ord DollarGestureEventData |

Instance details

Defined in SDL.Event

Methods

compare :: DollarGestureEventData -> DollarGestureEventData -> Ordering Source #

(<) :: DollarGestureEventData -> DollarGestureEventData -> Bool Source #

(<=) :: DollarGestureEventData -> DollarGestureEventData -> Bool Source #

(>) :: DollarGestureEventData -> DollarGestureEventData -> Bool Source #

(>=) :: DollarGestureEventData -> DollarGestureEventData -> Bool Source #

max :: DollarGestureEventData -> DollarGestureEventData -> DollarGestureEventData Source #

min :: DollarGestureEventData -> DollarGestureEventData -> DollarGestureEventData Source #

Ord DropEventData |

Instance details

Defined in SDL.Event

Methods

compare :: DropEventData -> DropEventData -> Ordering Source #

(<) :: DropEventData -> DropEventData -> Bool Source #

(<=) :: DropEventData -> DropEventData -> Bool Source #

(>) :: DropEventData -> DropEventData -> Bool Source #

(>=) :: DropEventData -> DropEventData -> Bool Source #

max :: DropEventData -> DropEventData -> DropEventData Source #

min :: DropEventData -> DropEventData -> DropEventData Source #

Ord Event |
Instance details Defined in SDL.Event Methods compare :: Event -> Event -> Ordering Source # (<) :: Event -> Event -> Bool Source # (<=) :: Event -> Event -> Bool Source # (>) :: Event -> Event -> Bool Source # (>=) :: Event -> Event -> Bool Source # max :: Event -> Event -> Event Source # min :: Event -> Event -> Event Source #
Ord EventPayload |

Instance details

Defined in SDL.Event

Methods

compare :: EventPayload -> EventPayload -> Ordering Source #

(<) :: EventPayload -> EventPayload -> Bool Source #

(<=) :: EventPayload -> EventPayload -> Bool Source #

(>) :: EventPayload -> EventPayload -> Bool Source #

(>=) :: EventPayload -> EventPayload -> Bool Source #

max :: EventPayload -> EventPayload -> EventPayload Source #

min :: EventPayload -> EventPayload -> EventPayload Source #

Ord EventPushResult |

Instance details

Defined in SDL.Event

Methods

compare :: EventPushResult -> EventPushResult -> Ordering Source #

(<) :: EventPushResult -> EventPushResult -> Bool Source #

(<=) :: EventPushResult -> EventPushResult -> Bool Source #

(>) :: EventPushResult -> EventPushResult -> Bool Source #

(>=) :: EventPushResult -> EventPushResult -> Bool Source #

max :: EventPushResult -> EventPushResult -> EventPushResult Source #

min :: EventPushResult -> EventPushResult -> EventPushResult Source #

Ord InputMotion |

Instance details

Defined in SDL.Event

Methods

compare :: InputMotion -> InputMotion -> Ordering Source #

(<) :: InputMotion -> InputMotion -> Bool Source #

(<=) :: InputMotion -> InputMotion -> Bool Source #

(>) :: InputMotion -> InputMotion -> Bool Source #

(>=) :: InputMotion -> InputMotion -> Bool Source #

max :: InputMotion -> InputMotion -> InputMotion Source #

min :: InputMotion -> InputMotion -> InputMotion Source #

Ord JoyAxisEventData |

Instance details

Defined in SDL.Event

Methods

compare :: JoyAxisEventData -> JoyAxisEventData -> Ordering Source #

(<) :: JoyAxisEventData -> JoyAxisEventData -> Bool Source #

(<=) :: JoyAxisEventData -> JoyAxisEventData -> Bool Source #

(>) :: JoyAxisEventData -> JoyAxisEventData -> Bool Source #

(>=) :: JoyAxisEventData -> JoyAxisEventData -> Bool Source #

max :: JoyAxisEventData -> JoyAxisEventData -> JoyAxisEventData Source #

min :: JoyAxisEventData -> JoyAxisEventData -> JoyAxisEventData Source #

Ord JoyBallEventData |

Instance details

Defined in SDL.Event

Methods

compare :: JoyBallEventData -> JoyBallEventData -> Ordering Source #

(<) :: JoyBallEventData -> JoyBallEventData -> Bool Source #

(<=) :: JoyBallEventData -> JoyBallEventData -> Bool Source #

(>) :: JoyBallEventData -> JoyBallEventData -> Bool Source #

(>=) :: JoyBallEventData -> JoyBallEventData -> Bool Source #

max :: JoyBallEventData -> JoyBallEventData -> JoyBallEventData Source #

min :: JoyBallEventData -> JoyBallEventData -> JoyBallEventData Source #

Ord JoyButtonEventData |

Instance details

Defined in SDL.Event

Methods

compare :: JoyButtonEventData -> JoyButtonEventData -> Ordering Source #

(<) :: JoyButtonEventData -> JoyButtonEventData -> Bool Source #

(<=) :: JoyButtonEventData -> JoyButtonEventData -> Bool Source #

(>) :: JoyButtonEventData -> JoyButtonEventData -> Bool Source #

(>=) :: JoyButtonEventData -> JoyButtonEventData -> Bool Source #

max :: JoyButtonEventData -> JoyButtonEventData -> JoyButtonEventData Source #

min :: JoyButtonEventData -> JoyButtonEventData -> JoyButtonEventData Source #

Ord JoyDeviceEventData |

Instance details

Defined in SDL.Event

Methods

compare :: JoyDeviceEventData -> JoyDeviceEventData -> Ordering Source #

(<) :: JoyDeviceEventData -> JoyDeviceEventData -> Bool Source #

(<=) :: JoyDeviceEventData -> JoyDeviceEventData -> Bool Source #

(>) :: JoyDeviceEventData -> JoyDeviceEventData -> Bool Source #

(>=) :: JoyDeviceEventData -> JoyDeviceEventData -> Bool Source #

max :: JoyDeviceEventData -> JoyDeviceEventData -> JoyDeviceEventData Source #

min :: JoyDeviceEventData -> JoyDeviceEventData -> JoyDeviceEventData Source #

Ord JoyHatEventData |

Instance details

Defined in SDL.Event

Methods

compare :: JoyHatEventData -> JoyHatEventData -> Ordering Source #

(<) :: JoyHatEventData -> JoyHatEventData -> Bool Source #

(<=) :: JoyHatEventData -> JoyHatEventData -> Bool Source #

(>) :: JoyHatEventData -> JoyHatEventData -> Bool Source #

(>=) :: JoyHatEventData -> JoyHatEventData -> Bool Source #

max :: JoyHatEventData -> JoyHatEventData -> JoyHatEventData Source #

min :: JoyHatEventData -> JoyHatEventData -> JoyHatEventData Source #

Ord KeyboardEventData |

Instance details

Defined in SDL.Event

Methods

compare :: KeyboardEventData -> KeyboardEventData -> Ordering Source #

(<) :: KeyboardEventData -> KeyboardEventData -> Bool Source #

(<=) :: KeyboardEventData -> KeyboardEventData -> Bool Source #

(>) :: KeyboardEventData -> KeyboardEventData -> Bool Source #

(>=) :: KeyboardEventData -> KeyboardEventData -> Bool Source #

max :: KeyboardEventData -> KeyboardEventData -> KeyboardEventData Source #

min :: KeyboardEventData -> KeyboardEventData -> KeyboardEventData Source #

Ord MouseButtonEventData |

Instance details

Defined in SDL.Event

Methods

compare :: MouseButtonEventData -> MouseButtonEventData -> Ordering Source #

(<) :: MouseButtonEventData -> MouseButtonEventData -> Bool Source #

(<=) :: MouseButtonEventData -> MouseButtonEventData -> Bool Source #

(>) :: MouseButtonEventData -> MouseButtonEventData -> Bool Source #

(>=) :: MouseButtonEventData -> MouseButtonEventData -> Bool Source #

max :: MouseButtonEventData -> MouseButtonEventData -> MouseButtonEventData Source #

min :: MouseButtonEventData -> MouseButtonEventData -> MouseButtonEventData Source #

Ord MouseMotionEventData |

Instance details

Defined in SDL.Event

Methods

compare :: MouseMotionEventData -> MouseMotionEventData -> Ordering Source #

(<) :: MouseMotionEventData -> MouseMotionEventData -> Bool Source #

(<=) :: MouseMotionEventData -> MouseMotionEventData -> Bool Source #

(>) :: MouseMotionEventData -> MouseMotionEventData -> Bool Source #

(>=) :: MouseMotionEventData -> MouseMotionEventData -> Bool Source #

max :: MouseMotionEventData -> MouseMotionEventData -> MouseMotionEventData Source #

min :: MouseMotionEventData -> MouseMotionEventData -> MouseMotionEventData Source #

Ord MouseWheelEventData |

Instance details

Defined in SDL.Event

Methods

compare :: MouseWheelEventData -> MouseWheelEventData -> Ordering Source #

(<) :: MouseWheelEventData -> MouseWheelEventData -> Bool Source #

(<=) :: MouseWheelEventData -> MouseWheelEventData -> Bool Source #

(>) :: MouseWheelEventData -> MouseWheelEventData -> Bool Source #

(>=) :: MouseWheelEventData -> MouseWheelEventData -> Bool Source #

max :: MouseWheelEventData -> MouseWheelEventData -> MouseWheelEventData Source #

min :: MouseWheelEventData -> MouseWheelEventData -> MouseWheelEventData Source #

Ord MultiGestureEventData |

Instance details

Defined in SDL.Event

Methods

compare :: MultiGestureEventData -> MultiGestureEventData -> Ordering Source #

(<) :: MultiGestureEventData -> MultiGestureEventData -> Bool Source #

(<=) :: MultiGestureEventData -> MultiGestureEventData -> Bool Source #

(>) :: MultiGestureEventData -> MultiGestureEventData -> Bool Source #

(>=) :: MultiGestureEventData -> MultiGestureEventData -> Bool Source #

max :: MultiGestureEventData -> MultiGestureEventData -> MultiGestureEventData Source #

min :: MultiGestureEventData -> MultiGestureEventData -> MultiGestureEventData Source #

Ord RegisteredEventData |

Instance details

Defined in SDL.Event

Methods

compare :: RegisteredEventData -> RegisteredEventData -> Ordering Source #

(<) :: RegisteredEventData -> RegisteredEventData -> Bool Source #

(<=) :: RegisteredEventData -> RegisteredEventData -> Bool Source #

(>) :: RegisteredEventData -> RegisteredEventData -> Bool Source #

(>=) :: RegisteredEventData -> RegisteredEventData -> Bool Source #

max :: RegisteredEventData -> RegisteredEventData -> RegisteredEventData Source #

min :: RegisteredEventData -> RegisteredEventData -> RegisteredEventData Source #

Ord SysWMEventData |

Instance details

Defined in SDL.Event

Methods

compare :: SysWMEventData -> SysWMEventData -> Ordering Source #

(<) :: SysWMEventData -> SysWMEventData -> Bool Source #

(<=) :: SysWMEventData -> SysWMEventData -> Bool Source #

(>) :: SysWMEventData -> SysWMEventData -> Bool Source #

(>=) :: SysWMEventData -> SysWMEventData -> Bool Source #

max :: SysWMEventData -> SysWMEventData -> SysWMEventData Source #

min :: SysWMEventData -> SysWMEventData -> SysWMEventData Source #

Ord TextEditingEventData |

Instance details

Defined in SDL.Event

Methods

compare :: TextEditingEventData -> TextEditingEventData -> Ordering Source #

(<) :: TextEditingEventData -> TextEditingEventData -> Bool Source #

(<=) :: TextEditingEventData -> TextEditingEventData -> Bool Source #

(>) :: TextEditingEventData -> TextEditingEventData -> Bool Source #

(>=) :: TextEditingEventData -> TextEditingEventData -> Bool Source #

max :: TextEditingEventData -> TextEditingEventData -> TextEditingEventData Source #

min :: TextEditingEventData -> TextEditingEventData -> TextEditingEventData Source #

Ord TextInputEventData |

Instance details

Defined in SDL.Event

Methods

compare :: TextInputEventData -> TextInputEventData -> Ordering Source #

(<) :: TextInputEventData -> TextInputEventData -> Bool Source #

(<=) :: TextInputEventData -> TextInputEventData -> Bool Source #

(>) :: TextInputEventData -> TextInputEventData -> Bool Source #

(>=) :: TextInputEventData -> TextInputEventData -> Bool Source #

max :: TextInputEventData -> TextInputEventData -> TextInputEventData Source #

min :: TextInputEventData -> TextInputEventData -> TextInputEventData Source #

Ord TouchFingerEventData |

Instance details

Defined in SDL.Event

Methods

compare :: TouchFingerEventData -> TouchFingerEventData -> Ordering Source #

(<) :: TouchFingerEventData -> TouchFingerEventData -> Bool Source #

(<=) :: TouchFingerEventData -> TouchFingerEventData -> Bool Source #

(>) :: TouchFingerEventData -> TouchFingerEventData -> Bool Source #

(>=) :: TouchFingerEventData -> TouchFingerEventData -> Bool Source #

max :: TouchFingerEventData -> TouchFingerEventData -> TouchFingerEventData Source #

min :: TouchFingerEventData -> TouchFingerEventData -> TouchFingerEventData Source #

Ord TouchFingerMotionEventData |

Instance details

Defined in SDL.Event

Methods

compare :: TouchFingerMotionEventData -> TouchFingerMotionEventData -> Ordering Source #

(<) :: TouchFingerMotionEventData -> TouchFingerMotionEventData -> Bool Source #

(<=) :: TouchFingerMotionEventData -> TouchFingerMotionEventData -> Bool Source #

(>) :: TouchFingerMotionEventData -> TouchFingerMotionEventData -> Bool Source #

(>=) :: TouchFingerMotionEventData -> TouchFingerMotionEventData -> Bool Source #

max :: TouchFingerMotionEventData -> TouchFingerMotionEventData -> TouchFingerMotionEventData Source #

min :: TouchFingerMotionEventData -> TouchFingerMotionEventData -> TouchFingerMotionEventData Source #

Ord UnknownEventData |

Instance details

Defined in SDL.Event

Methods

compare :: UnknownEventData -> UnknownEventData -> Ordering Source #

(<) :: UnknownEventData -> UnknownEventData -> Bool Source #

(<=) :: UnknownEventData -> UnknownEventData -> Bool Source #

(>) :: UnknownEventData -> UnknownEventData -> Bool Source #

(>=) :: UnknownEventData -> UnknownEventData -> Bool Source #

max :: UnknownEventData -> UnknownEventData -> UnknownEventData Source #

min :: UnknownEventData -> UnknownEventData -> UnknownEventData Source #

Ord UserEventData |

Instance details

Defined in SDL.Event

Methods

compare :: UserEventData -> UserEventData -> Ordering Source #

(<) :: UserEventData -> UserEventData -> Bool Source #

(<=) :: UserEventData -> UserEventData -> Bool Source #

(>) :: UserEventData -> UserEventData -> Bool Source #

(>=) :: UserEventData -> UserEventData -> Bool Source #

max :: UserEventData -> UserEventData -> UserEventData Source #

min :: UserEventData -> UserEventData -> UserEventData Source #

Ord WindowClosedEventData |

Instance details

Defined in SDL.Event

Methods

compare :: WindowClosedEventData -> WindowClosedEventData -> Ordering Source #

(<) :: WindowClosedEventData -> WindowClosedEventData -> Bool Source #

(<=) :: WindowClosedEventData -> WindowClosedEventData -> Bool Source #

(>) :: WindowClosedEventData -> WindowClosedEventData -> Bool Source #

(>=) :: WindowClosedEventData -> WindowClosedEventData -> Bool Source #

max :: WindowClosedEventData -> WindowClosedEventData -> WindowClosedEventData Source #

min :: WindowClosedEventData -> WindowClosedEventData -> WindowClosedEventData Source #

Ord WindowExposedEventData |

Instance details

Defined in SDL.Event

Methods

compare :: WindowExposedEventData -> WindowExposedEventData -> Ordering Source #

(<) :: WindowExposedEventData -> WindowExposedEventData -> Bool Source #

(<=) :: WindowExposedEventData -> WindowExposedEventData -> Bool Source #

(>) :: WindowExposedEventData -> WindowExposedEventData -> Bool Source #

(>=) :: WindowExposedEventData -> WindowExposedEventData -> Bool Source #

max :: WindowExposedEventData -> WindowExposedEventData -> WindowExposedEventData Source #

min :: WindowExposedEventData -> WindowExposedEventData -> WindowExposedEventData Source #

Ord WindowGainedKeyboardFocusEventData |

Instance details

Defined in SDL.Event

Methods

compare :: WindowGainedKeyboardFocusEventData -> WindowGainedKeyboardFocusEventData -> Ordering Source #

(<) :: WindowGainedKeyboardFocusEventData -> WindowGainedKeyboardFocusEventData -> Bool Source #

(<=) :: WindowGainedKeyboardFocusEventData -> WindowGainedKeyboardFocusEventData -> Bool Source #

(>) :: WindowGainedKeyboardFocusEventData -> WindowGainedKeyboardFocusEventData -> Bool Source #

(>=) :: WindowGainedKeyboardFocusEventData -> WindowGainedKeyboardFocusEventData -> Bool Source #

max :: WindowGainedKeyboardFocusEventData -> WindowGainedKeyboardFocusEventData -> WindowGainedKeyboardFocusEventData Source #

min :: WindowGainedKeyboardFocusEventData -> WindowGainedKeyboardFocusEventData -> WindowGainedKeyboardFocusEventData Source #

Ord WindowGainedMouseFocusEventData |

Instance details

Defined in SDL.Event

Methods

compare :: WindowGainedMouseFocusEventData -> WindowGainedMouseFocusEventData -> Ordering Source #

(<) :: WindowGainedMouseFocusEventData -> WindowGainedMouseFocusEventData -> Bool Source #

(<=) :: WindowGainedMouseFocusEventData -> WindowGainedMouseFocusEventData -> Bool Source #

(>) :: WindowGainedMouseFocusEventData -> WindowGainedMouseFocusEventData -> Bool Source #

(>=) :: WindowGainedMouseFocusEventData -> WindowGainedMouseFocusEventData -> Bool Source #

max :: WindowGainedMouseFocusEventData -> WindowGainedMouseFocusEventData -> WindowGainedMouseFocusEventData Source #

min :: WindowGainedMouseFocusEventData -> WindowGainedMouseFocusEventData -> WindowGainedMouseFocusEventData Source #

Ord WindowHiddenEventData |

Instance details

Defined in SDL.Event

Methods

compare :: WindowHiddenEventData -> WindowHiddenEventData -> Ordering Source #

(<) :: WindowHiddenEventData -> WindowHiddenEventData -> Bool Source #

(<=) :: WindowHiddenEventData -> WindowHiddenEventData -> Bool Source #

(>) :: WindowHiddenEventData -> WindowHiddenEventData -> Bool Source #

(>=) :: WindowHiddenEventData -> WindowHiddenEventData -> Bool Source #

max :: WindowHiddenEventData -> WindowHiddenEventData -> WindowHiddenEventData Source #

min :: WindowHiddenEventData -> WindowHiddenEventData -> WindowHiddenEventData Source #

Ord WindowLostKeyboardFocusEventData |

Instance details

Defined in SDL.Event

Methods

compare :: WindowLostKeyboardFocusEventData -> WindowLostKeyboardFocusEventData -> Ordering Source #

(<) :: WindowLostKeyboardFocusEventData -> WindowLostKeyboardFocusEventData -> Bool Source #

(<=) :: WindowLostKeyboardFocusEventData -> WindowLostKeyboardFocusEventData -> Bool Source #

(>) :: WindowLostKeyboardFocusEventData -> WindowLostKeyboardFocusEventData -> Bool Source #

(>=) :: WindowLostKeyboardFocusEventData -> WindowLostKeyboardFocusEventData -> Bool Source #

max :: WindowLostKeyboardFocusEventData -> WindowLostKeyboardFocusEventData -> WindowLostKeyboardFocusEventData Source #

min :: WindowLostKeyboardFocusEventData -> WindowLostKeyboardFocusEventData -> WindowLostKeyboardFocusEventData Source #

Ord WindowLostMouseFocusEventData |

Instance details

Defined in SDL.Event

Methods

compare :: WindowLostMouseFocusEventData -> WindowLostMouseFocusEventData -> Ordering Source #

(<) :: WindowLostMouseFocusEventData -> WindowLostMouseFocusEventData -> Bool Source #

(<=) :: WindowLostMouseFocusEventData -> WindowLostMouseFocusEventData -> Bool Source #

(>) :: WindowLostMouseFocusEventData -> WindowLostMouseFocusEventData -> Bool Source #

(>=) :: WindowLostMouseFocusEventData -> WindowLostMouseFocusEventData -> Bool Source #

max :: WindowLostMouseFocusEventData -> WindowLostMouseFocusEventData -> WindowLostMouseFocusEventData Source #

min :: WindowLostMouseFocusEventData -> WindowLostMouseFocusEventData -> WindowLostMouseFocusEventData Source #

Ord WindowMaximizedEventData |

Instance details

Defined in SDL.Event

Methods

compare :: WindowMaximizedEventData -> WindowMaximizedEventData -> Ordering Source #

(<) :: WindowMaximizedEventData -> WindowMaximizedEventData -> Bool Source #

(<=) :: WindowMaximizedEventData -> WindowMaximizedEventData -> Bool Source #

(>) :: WindowMaximizedEventData -> WindowMaximizedEventData -> Bool Source #

(>=) :: WindowMaximizedEventData -> WindowMaximizedEventData -> Bool Source #

max :: WindowMaximizedEventData -> WindowMaximizedEventData -> WindowMaximizedEventData Source #

min :: WindowMaximizedEventData -> WindowMaximizedEventData -> WindowMaximizedEventData Source #

Ord WindowMinimizedEventData |

Instance details

Defined in SDL.Event

Methods

compare :: WindowMinimizedEventData -> WindowMinimizedEventData -> Ordering Source #

(<) :: WindowMinimizedEventData -> WindowMinimizedEventData -> Bool Source #

(<=) :: WindowMinimizedEventData -> WindowMinimizedEventData -> Bool Source #

(>) :: WindowMinimizedEventData -> WindowMinimizedEventData -> Bool Source #

(>=) :: WindowMinimizedEventData -> WindowMinimizedEventData -> Bool Source #

max :: WindowMinimizedEventData -> WindowMinimizedEventData -> WindowMinimizedEventData Source #

min :: WindowMinimizedEventData -> WindowMinimizedEventData -> WindowMinimizedEventData Source #

Ord WindowMovedEventData |

Instance details

Defined in SDL.Event

Methods

compare :: WindowMovedEventData -> WindowMovedEventData -> Ordering Source #

(<) :: WindowMovedEventData -> WindowMovedEventData -> Bool Source #

(<=) :: WindowMovedEventData -> WindowMovedEventData -> Bool Source #

(>) :: WindowMovedEventData -> WindowMovedEventData -> Bool Source #

(>=) :: WindowMovedEventData -> WindowMovedEventData -> Bool Source #

max :: WindowMovedEventData -> WindowMovedEventData -> WindowMovedEventData Source #

min :: WindowMovedEventData -> WindowMovedEventData -> WindowMovedEventData Source #

Ord WindowResizedEventData |

Instance details

Defined in SDL.Event

Methods

compare :: WindowResizedEventData -> WindowResizedEventData -> Ordering Source #

(<) :: WindowResizedEventData -> WindowResizedEventData -> Bool Source #

(<=) :: WindowResizedEventData -> WindowResizedEventData -> Bool Source #

(>) :: WindowResizedEventData -> WindowResizedEventData -> Bool Source #

(>=) :: WindowResizedEventData -> WindowResizedEventData -> Bool Source #

max :: WindowResizedEventData -> WindowResizedEventData -> WindowResizedEventData Source #

min :: WindowResizedEventData -> WindowResizedEventData -> WindowResizedEventData Source #

Ord WindowRestoredEventData |

Instance details

Defined in SDL.Event

Methods

compare :: WindowRestoredEventData -> WindowRestoredEventData -> Ordering Source #

(<) :: WindowRestoredEventData -> WindowRestoredEventData -> Bool Source #

(<=) :: WindowRestoredEventData -> WindowRestoredEventData -> Bool Source #

(>) :: WindowRestoredEventData -> WindowRestoredEventData -> Bool Source #

(>=) :: WindowRestoredEventData -> WindowRestoredEventData -> Bool Source #

max :: WindowRestoredEventData -> WindowRestoredEventData -> WindowRestoredEventData Source #

min :: WindowRestoredEventData -> WindowRestoredEventData -> WindowRestoredEventData Source #

Ord WindowShownEventData |

Instance details

Defined in SDL.Event

Methods

compare :: WindowShownEventData -> WindowShownEventData -> Ordering Source #

(<) :: WindowShownEventData -> WindowShownEventData -> Bool Source #

(<=) :: WindowShownEventData -> WindowShownEventData -> Bool Source #

(>) :: WindowShownEventData -> WindowShownEventData -> Bool Source #

(>=) :: WindowShownEventData -> WindowShownEventData -> Bool Source #

max :: WindowShownEventData -> WindowShownEventData -> WindowShownEventData Source #

min :: WindowShownEventData -> WindowShownEventData -> WindowShownEventData Source #

Ord WindowSizeChangedEventData |

Instance details

Defined in SDL.Event

Methods

compare :: WindowSizeChangedEventData -> WindowSizeChangedEventData -> Ordering Source #

(<) :: WindowSizeChangedEventData -> WindowSizeChangedEventData -> Bool Source #

(<=) :: WindowSizeChangedEventData -> WindowSizeChangedEventData -> Bool Source #

(>) :: WindowSizeChangedEventData -> WindowSizeChangedEventData -> Bool Source #

(>=) :: WindowSizeChangedEventData -> WindowSizeChangedEventData -> Bool Source #

max :: WindowSizeChangedEventData -> WindowSizeChangedEventData -> WindowSizeChangedEventData Source #

min :: WindowSizeChangedEventData -> WindowSizeChangedEventData -> WindowSizeChangedEventData Source #

Ord SDLException |

Instance details

Defined in SDL.Exception

Methods

compare :: SDLException -> SDLException -> Ordering Source #

(<) :: SDLException -> SDLException -> Bool Source #

(<=) :: SDLException -> SDLException -> Bool Source #

(>) :: SDLException -> SDLException -> Bool Source #

(>=) :: SDLException -> SDLException -> Bool Source #

max :: SDLException -> SDLException -> SDLException Source #

min :: SDLException -> SDLException -> SDLException Source #

Ord AccelerometerJoystickOptions |

Instance details

Defined in SDL.Hint

Methods

compare :: AccelerometerJoystickOptions -> AccelerometerJoystickOptions -> Ordering Source #

(<) :: AccelerometerJoystickOptions -> AccelerometerJoystickOptions -> Bool Source #

(<=) :: AccelerometerJoystickOptions -> AccelerometerJoystickOptions -> Bool Source #

(>) :: AccelerometerJoystickOptions -> AccelerometerJoystickOptions -> Bool Source #

(>=) :: AccelerometerJoystickOptions -> AccelerometerJoystickOptions -> Bool Source #

max :: AccelerometerJoystickOptions -> AccelerometerJoystickOptions -> AccelerometerJoystickOptions Source #

min :: AccelerometerJoystickOptions -> AccelerometerJoystickOptions -> AccelerometerJoystickOptions Source #

Ord FramebufferAccelerationOptions |

Instance details

Defined in SDL.Hint

Methods

compare :: FramebufferAccelerationOptions -> FramebufferAccelerationOptions -> Ordering Source #

(<) :: FramebufferAccelerationOptions -> FramebufferAccelerationOptions -> Bool Source #

(<=) :: FramebufferAccelerationOptions -> FramebufferAccelerationOptions -> Bool Source #

(>) :: FramebufferAccelerationOptions -> FramebufferAccelerationOptions -> Bool Source #

(>=) :: FramebufferAccelerationOptions -> FramebufferAccelerationOptions -> Bool Source #

max :: FramebufferAccelerationOptions -> FramebufferAccelerationOptions -> FramebufferAccelerationOptions Source #

min :: FramebufferAccelerationOptions -> FramebufferAccelerationOptions -> FramebufferAccelerationOptions Source #

Ord HintPriority |

Instance details

Defined in SDL.Hint

Methods

compare :: HintPriority -> HintPriority -> Ordering Source #

(<) :: HintPriority -> HintPriority -> Bool Source #

(<=) :: HintPriority -> HintPriority -> Bool Source #

(>) :: HintPriority -> HintPriority -> Bool Source #

(>=) :: HintPriority -> HintPriority -> Bool Source #

max :: HintPriority -> HintPriority -> HintPriority Source #

min :: HintPriority -> HintPriority -> HintPriority Source #

Ord MacCTRLClickOptions |

Instance details

Defined in SDL.Hint

Methods

compare :: MacCTRLClickOptions -> MacCTRLClickOptions -> Ordering Source #

(<) :: MacCTRLClickOptions -> MacCTRLClickOptions -> Bool Source #

(<=) :: MacCTRLClickOptions -> MacCTRLClickOptions -> Bool Source #

(>) :: MacCTRLClickOptions -> MacCTRLClickOptions -> Bool Source #

(>=) :: MacCTRLClickOptions -> MacCTRLClickOptions -> Bool Source #

max :: MacCTRLClickOptions -> MacCTRLClickOptions -> MacCTRLClickOptions Source #

min :: MacCTRLClickOptions -> MacCTRLClickOptions -> MacCTRLClickOptions Source #

Ord MouseModeWarpOptions |

Instance details

Defined in SDL.Hint

Methods

compare :: MouseModeWarpOptions -> MouseModeWarpOptions -> Ordering Source #

(<) :: MouseModeWarpOptions -> MouseModeWarpOptions -> Bool Source #

(<=) :: MouseModeWarpOptions -> MouseModeWarpOptions -> Bool Source #

(>) :: MouseModeWarpOptions -> MouseModeWarpOptions -> Bool Source #

(>=) :: MouseModeWarpOptions -> MouseModeWarpOptions -> Bool Source #

max :: MouseModeWarpOptions -> MouseModeWarpOptions -> MouseModeWarpOptions Source #

min :: MouseModeWarpOptions -> MouseModeWarpOptions -> MouseModeWarpOptions Source #

Ord RenderDrivers |

Instance details

Defined in SDL.Hint

Methods

compare :: RenderDrivers -> RenderDrivers -> Ordering Source #

(<) :: RenderDrivers -> RenderDrivers -> Bool Source #

(<=) :: RenderDrivers -> RenderDrivers -> Bool Source #

(>) :: RenderDrivers -> RenderDrivers -> Bool Source #

(>=) :: RenderDrivers -> RenderDrivers -> Bool Source #

max :: RenderDrivers -> RenderDrivers -> RenderDrivers Source #

min :: RenderDrivers -> RenderDrivers -> RenderDrivers Source #

Ord RenderOpenGLShaderOptions |

Instance details

Defined in SDL.Hint

Methods

compare :: RenderOpenGLShaderOptions -> RenderOpenGLShaderOptions -> Ordering Source #

(<) :: RenderOpenGLShaderOptions -> RenderOpenGLShaderOptions -> Bool Source #

(<=) :: RenderOpenGLShaderOptions -> RenderOpenGLShaderOptions -> Bool Source #

(>) :: RenderOpenGLShaderOptions -> RenderOpenGLShaderOptions -> Bool Source #

(>=) :: RenderOpenGLShaderOptions -> RenderOpenGLShaderOptions -> Bool Source #

max :: RenderOpenGLShaderOptions -> RenderOpenGLShaderOptions -> RenderOpenGLShaderOptions Source #

min :: RenderOpenGLShaderOptions -> RenderOpenGLShaderOptions -> RenderOpenGLShaderOptions Source #

Ord RenderScaleQuality |

Instance details

Defined in SDL.Hint

Methods

compare :: RenderScaleQuality -> RenderScaleQuality -> Ordering Source #

(<) :: RenderScaleQuality -> RenderScaleQuality -> Bool Source #

(<=) :: RenderScaleQuality -> RenderScaleQuality -> Bool Source #

(>) :: RenderScaleQuality -> RenderScaleQuality -> Bool Source #

(>=) :: RenderScaleQuality -> RenderScaleQuality -> Bool Source #

max :: RenderScaleQuality -> RenderScaleQuality -> RenderScaleQuality Source #

min :: RenderScaleQuality -> RenderScaleQuality -> RenderScaleQuality Source #

Ord RenderVSyncOptions |

Instance details

Defined in SDL.Hint

Methods

compare :: RenderVSyncOptions -> RenderVSyncOptions -> Ordering Source #

(<) :: RenderVSyncOptions -> RenderVSyncOptions -> Bool Source #

(<=) :: RenderVSyncOptions -> RenderVSyncOptions -> Bool Source #

(>) :: RenderVSyncOptions -> RenderVSyncOptions -> Bool Source #

(>=) :: RenderVSyncOptions -> RenderVSyncOptions -> Bool Source #

max :: RenderVSyncOptions -> RenderVSyncOptions -> RenderVSyncOptions Source #

min :: RenderVSyncOptions -> RenderVSyncOptions -> RenderVSyncOptions Source #

Ord VideoWinD3DCompilerOptions |

Instance details

Defined in SDL.Hint

Methods

compare :: VideoWinD3DCompilerOptions -> VideoWinD3DCompilerOptions -> Ordering Source #

(<) :: VideoWinD3DCompilerOptions -> VideoWinD3DCompilerOptions -> Bool Source #

(<=) :: VideoWinD3DCompilerOptions -> VideoWinD3DCompilerOptions -> Bool Source #

(>) :: VideoWinD3DCompilerOptions -> VideoWinD3DCompilerOptions -> Bool Source #

(>=) :: VideoWinD3DCompilerOptions -> VideoWinD3DCompilerOptions -> Bool Source #

max :: VideoWinD3DCompilerOptions -> VideoWinD3DCompilerOptions -> VideoWinD3DCompilerOptions Source #

min :: VideoWinD3DCompilerOptions -> VideoWinD3DCompilerOptions -> VideoWinD3DCompilerOptions Source #

Ord InitFlag |
Instance details Defined in SDL.Init Methods compare :: InitFlag -> InitFlag -> Ordering Source # (<) :: InitFlag -> InitFlag -> Bool Source # (<=) :: InitFlag -> InitFlag -> Bool Source # (>) :: InitFlag -> InitFlag -> Bool Source # (>=) :: InitFlag -> InitFlag -> Bool Source # max :: InitFlag -> InitFlag -> InitFlag Source # min :: InitFlag -> InitFlag -> InitFlag Source #
Ord ControllerAxis |

Instance details

Defined in SDL.Input.GameController

Methods

compare :: ControllerAxis -> ControllerAxis -> Ordering Source #

(<) :: ControllerAxis -> ControllerAxis -> Bool Source #

(<=) :: ControllerAxis -> ControllerAxis -> Bool Source #

(>) :: ControllerAxis -> ControllerAxis -> Bool Source #

(>=) :: ControllerAxis -> ControllerAxis -> Bool Source #

max :: ControllerAxis -> ControllerAxis -> ControllerAxis Source #

min :: ControllerAxis -> ControllerAxis -> ControllerAxis Source #

Ord ControllerButton |

Instance details

Defined in SDL.Input.GameController

Methods

compare :: ControllerButton -> ControllerButton -> Ordering Source #

(<) :: ControllerButton -> ControllerButton -> Bool Source #

(<=) :: ControllerButton -> ControllerButton -> Bool Source #

(>) :: ControllerButton -> ControllerButton -> Bool Source #

(>=) :: ControllerButton -> ControllerButton -> Bool Source #

max :: ControllerButton -> ControllerButton -> ControllerButton Source #

min :: ControllerButton -> ControllerButton -> ControllerButton Source #

Ord ControllerButtonState |

Instance details

Defined in SDL.Input.GameController

Methods

compare :: ControllerButtonState -> ControllerButtonState -> Ordering Source #

(<) :: ControllerButtonState -> ControllerButtonState -> Bool Source #

(<=) :: ControllerButtonState -> ControllerButtonState -> Bool Source #

(>) :: ControllerButtonState -> ControllerButtonState -> Bool Source #

(>=) :: ControllerButtonState -> ControllerButtonState -> Bool Source #

max :: ControllerButtonState -> ControllerButtonState -> ControllerButtonState Source #

min :: ControllerButtonState -> ControllerButtonState -> ControllerButtonState Source #

Ord ControllerDevice |

Instance details

Defined in SDL.Input.GameController

Methods

compare :: ControllerDevice -> ControllerDevice -> Ordering Source #

(<) :: ControllerDevice -> ControllerDevice -> Bool Source #

(<=) :: ControllerDevice -> ControllerDevice -> Bool Source #

(>) :: ControllerDevice -> ControllerDevice -> Bool Source #

(>=) :: ControllerDevice -> ControllerDevice -> Bool Source #

max :: ControllerDevice -> ControllerDevice -> ControllerDevice Source #

min :: ControllerDevice -> ControllerDevice -> ControllerDevice Source #

Ord ControllerDeviceConnection |

Instance details

Defined in SDL.Input.GameController

Methods

compare :: ControllerDeviceConnection -> ControllerDeviceConnection -> Ordering Source #

(<) :: ControllerDeviceConnection -> ControllerDeviceConnection -> Bool Source #

(<=) :: ControllerDeviceConnection -> ControllerDeviceConnection -> Bool Source #

(>) :: ControllerDeviceConnection -> ControllerDeviceConnection -> Bool Source #

(>=) :: ControllerDeviceConnection -> ControllerDeviceConnection -> Bool Source #

max :: ControllerDeviceConnection -> ControllerDeviceConnection -> ControllerDeviceConnection Source #

min :: ControllerDeviceConnection -> ControllerDeviceConnection -> ControllerDeviceConnection Source #

Ord JoyButtonState |

Instance details

Defined in SDL.Input.Joystick

Methods

compare :: JoyButtonState -> JoyButtonState -> Ordering Source #

(<) :: JoyButtonState -> JoyButtonState -> Bool Source #

(<=) :: JoyButtonState -> JoyButtonState -> Bool Source #

(>) :: JoyButtonState -> JoyButtonState -> Bool Source #

(>=) :: JoyButtonState -> JoyButtonState -> Bool Source #

max :: JoyButtonState -> JoyButtonState -> JoyButtonState Source #

min :: JoyButtonState -> JoyButtonState -> JoyButtonState Source #

Ord JoyDeviceConnection |

Instance details

Defined in SDL.Input.Joystick

Methods

compare :: JoyDeviceConnection -> JoyDeviceConnection -> Ordering Source #

(<) :: JoyDeviceConnection -> JoyDeviceConnection -> Bool Source #

(<=) :: JoyDeviceConnection -> JoyDeviceConnection -> Bool Source #

(>) :: JoyDeviceConnection -> JoyDeviceConnection -> Bool Source #

(>=) :: JoyDeviceConnection -> JoyDeviceConnection -> Bool Source #

max :: JoyDeviceConnection -> JoyDeviceConnection -> JoyDeviceConnection Source #

min :: JoyDeviceConnection -> JoyDeviceConnection -> JoyDeviceConnection Source #

Ord JoyHatPosition |

Instance details

Defined in SDL.Input.Joystick

Methods

compare :: JoyHatPosition -> JoyHatPosition -> Ordering Source #

(<) :: JoyHatPosition -> JoyHatPosition -> Bool Source #

(<=) :: JoyHatPosition -> JoyHatPosition -> Bool Source #

(>) :: JoyHatPosition -> JoyHatPosition -> Bool Source #

(>=) :: JoyHatPosition -> JoyHatPosition -> Bool Source #

max :: JoyHatPosition -> JoyHatPosition -> JoyHatPosition Source #

min :: JoyHatPosition -> JoyHatPosition -> JoyHatPosition Source #

Ord JoystickDevice |

Instance details

Defined in SDL.Input.Joystick

Methods

compare :: JoystickDevice -> JoystickDevice -> Ordering Source #

(<) :: JoystickDevice -> JoystickDevice -> Bool Source #

(<=) :: JoystickDevice -> JoystickDevice -> Bool Source #

(>) :: JoystickDevice -> JoystickDevice -> Bool Source #

(>=) :: JoystickDevice -> JoystickDevice -> Bool Source #

max :: JoystickDevice -> JoystickDevice -> JoystickDevice Source #

min :: JoystickDevice -> JoystickDevice -> JoystickDevice Source #

Ord KeyModifier |

Instance details

Defined in SDL.Input.Keyboard

Methods

compare :: KeyModifier -> KeyModifier -> Ordering Source #

(<) :: KeyModifier -> KeyModifier -> Bool Source #

(<=) :: KeyModifier -> KeyModifier -> Bool Source #

(>) :: KeyModifier -> KeyModifier -> Bool Source #

(>=) :: KeyModifier -> KeyModifier -> Bool Source #

max :: KeyModifier -> KeyModifier -> KeyModifier Source #

min :: KeyModifier -> KeyModifier -> KeyModifier Source #

Ord Keysym |
Instance details Defined in SDL.Input.Keyboard Methods compare :: Keysym -> Keysym -> Ordering Source # (<) :: Keysym -> Keysym -> Bool Source # (<=) :: Keysym -> Keysym -> Bool Source # (>) :: Keysym -> Keysym -> Bool Source # (>=) :: Keysym -> Keysym -> Bool Source # max :: Keysym -> Keysym -> Keysym Source # min :: Keysym -> Keysym -> Keysym Source #
Ord Keycode |
Instance details Defined in SDL.Input.Keyboard.Codes Methods compare :: Keycode -> Keycode -> Ordering Source # (<) :: Keycode -> Keycode -> Bool Source # (<=) :: Keycode -> Keycode -> Bool Source # (>) :: Keycode -> Keycode -> Bool Source # (>=) :: Keycode -> Keycode -> Bool Source # max :: Keycode -> Keycode -> Keycode Source # min :: Keycode -> Keycode -> Keycode Source #
Ord Scancode |
Instance details Defined in SDL.Input.Keyboard.Codes Methods compare :: Scancode -> Scancode -> Ordering Source # (<) :: Scancode -> Scancode -> Bool Source # (<=) :: Scancode -> Scancode -> Bool Source # (>) :: Scancode -> Scancode -> Bool Source # (>=) :: Scancode -> Scancode -> Bool Source # max :: Scancode -> Scancode -> Scancode Source # min :: Scancode -> Scancode -> Scancode Source #
Ord LocationMode |

Instance details

Defined in SDL.Input.Mouse

Methods

compare :: LocationMode -> LocationMode -> Ordering Source #

(<) :: LocationMode -> LocationMode -> Bool Source #

(<=) :: LocationMode -> LocationMode -> Bool Source #

(>) :: LocationMode -> LocationMode -> Bool Source #

(>=) :: LocationMode -> LocationMode -> Bool Source #

max :: LocationMode -> LocationMode -> LocationMode Source #

min :: LocationMode -> LocationMode -> LocationMode Source #

Ord ModalLocation |

Instance details

Defined in SDL.Input.Mouse

Methods

compare :: ModalLocation -> ModalLocation -> Ordering Source #

(<) :: ModalLocation -> ModalLocation -> Bool Source #

(<=) :: ModalLocation -> ModalLocation -> Bool Source #

(>) :: ModalLocation -> ModalLocation -> Bool Source #

(>=) :: ModalLocation -> ModalLocation -> Bool Source #

max :: ModalLocation -> ModalLocation -> ModalLocation Source #

min :: ModalLocation -> ModalLocation -> ModalLocation Source #

Ord MouseButton |

Instance details

Defined in SDL.Input.Mouse

Methods

compare :: MouseButton -> MouseButton -> Ordering Source #

(<) :: MouseButton -> MouseButton -> Bool Source #

(<=) :: MouseButton -> MouseButton -> Bool Source #

(>) :: MouseButton -> MouseButton -> Bool Source #

(>=) :: MouseButton -> MouseButton -> Bool Source #

max :: MouseButton -> MouseButton -> MouseButton Source #

min :: MouseButton -> MouseButton -> MouseButton Source #

Ord MouseDevice |

Instance details

Defined in SDL.Input.Mouse

Methods

compare :: MouseDevice -> MouseDevice -> Ordering Source #

(<) :: MouseDevice -> MouseDevice -> Bool Source #

(<=) :: MouseDevice -> MouseDevice -> Bool Source #

(>) :: MouseDevice -> MouseDevice -> Bool Source #

(>=) :: MouseDevice -> MouseDevice -> Bool Source #

max :: MouseDevice -> MouseDevice -> MouseDevice Source #

min :: MouseDevice -> MouseDevice -> MouseDevice Source #

Ord MouseScrollDirection |

Instance details

Defined in SDL.Input.Mouse

Methods

compare :: MouseScrollDirection -> MouseScrollDirection -> Ordering Source #

(<) :: MouseScrollDirection -> MouseScrollDirection -> Bool Source #

(<=) :: MouseScrollDirection -> MouseScrollDirection -> Bool Source #

(>) :: MouseScrollDirection -> MouseScrollDirection -> Bool Source #

(>=) :: MouseScrollDirection -> MouseScrollDirection -> Bool Source #

max :: MouseScrollDirection -> MouseScrollDirection -> MouseScrollDirection Source #

min :: MouseScrollDirection -> MouseScrollDirection -> MouseScrollDirection Source #

Ord WarpMouseOrigin |

Instance details

Defined in SDL.Input.Mouse

Methods

compare :: WarpMouseOrigin -> WarpMouseOrigin -> Ordering Source #

(<) :: WarpMouseOrigin -> WarpMouseOrigin -> Bool Source #

(<=) :: WarpMouseOrigin -> WarpMouseOrigin -> Bool Source #

(>) :: WarpMouseOrigin -> WarpMouseOrigin -> Bool Source #

(>=) :: WarpMouseOrigin -> WarpMouseOrigin -> Bool Source #

max :: WarpMouseOrigin -> WarpMouseOrigin -> WarpMouseOrigin Source #

min :: WarpMouseOrigin -> WarpMouseOrigin -> WarpMouseOrigin Source #

Ord GameController |

Instance details

Defined in SDL.Internal.Types

Methods

compare :: GameController -> GameController -> Ordering Source #

(<) :: GameController -> GameController -> Bool Source #

(<=) :: GameController -> GameController -> Bool Source #

(>) :: GameController -> GameController -> Bool Source #

(>=) :: GameController -> GameController -> Bool Source #

max :: GameController -> GameController -> GameController Source #

min :: GameController -> GameController -> GameController Source #

Ord Joystick |
Instance details Defined in SDL.Internal.Types Methods compare :: Joystick -> Joystick -> Ordering Source # (<) :: Joystick -> Joystick -> Bool Source # (<=) :: Joystick -> Joystick -> Bool Source # (>) :: Joystick -> Joystick -> Bool Source # (>=) :: Joystick -> Joystick -> Bool Source # max :: Joystick -> Joystick -> Joystick Source # min :: Joystick -> Joystick -> Joystick Source #
Ord Renderer |
Instance details Defined in SDL.Internal.Types Methods compare :: Renderer -> Renderer -> Ordering Source # (<) :: Renderer -> Renderer -> Bool Source # (<=) :: Renderer -> Renderer -> Bool Source # (>) :: Renderer -> Renderer -> Bool Source # (>=) :: Renderer -> Renderer -> Bool Source # max :: Renderer -> Renderer -> Renderer Source # min :: Renderer -> Renderer -> Renderer Source #
Ord Window |
Instance details Defined in SDL.Internal.Types Methods compare :: Window -> Window -> Ordering Source # (<) :: Window -> Window -> Bool Source # (<=) :: Window -> Window -> Bool Source # (>) :: Window -> Window -> Bool Source # (>=) :: Window -> Window -> Bool Source # max :: Window -> Window -> Window Source # min :: Window -> Window -> Window Source #
Ord BatteryState |

Instance details

Defined in SDL.Power

Methods

compare :: BatteryState -> BatteryState -> Ordering Source #

(<) :: BatteryState -> BatteryState -> Bool Source #

(<=) :: BatteryState -> BatteryState -> Bool Source #

(>) :: BatteryState -> BatteryState -> Bool Source #

(>=) :: BatteryState -> BatteryState -> Bool Source #

max :: BatteryState -> BatteryState -> BatteryState Source #

min :: BatteryState -> BatteryState -> BatteryState Source #

Ord Charge |
Instance details Defined in SDL.Power Methods compare :: Charge -> Charge -> Ordering Source # (<) :: Charge -> Charge -> Bool Source # (<=) :: Charge -> Charge -> Bool Source # (>) :: Charge -> Charge -> Bool Source # (>=) :: Charge -> Charge -> Bool Source # max :: Charge -> Charge -> Charge Source # min :: Charge -> Charge -> Charge Source #
Ord PowerState |

Instance details

Defined in SDL.Power

Methods

compare :: PowerState -> PowerState -> Ordering Source #

(<) :: PowerState -> PowerState -> Bool Source #

(<=) :: PowerState -> PowerState -> Bool Source #

(>) :: PowerState -> PowerState -> Bool Source #

(>=) :: PowerState -> PowerState -> Bool Source #

max :: PowerState -> PowerState -> PowerState Source #

min :: PowerState -> PowerState -> PowerState Source #

Ord RetriggerTimer |

Instance details

Defined in SDL.Time

Methods

compare :: RetriggerTimer -> RetriggerTimer -> Ordering Source #

(<) :: RetriggerTimer -> RetriggerTimer -> Bool Source #

(<=) :: RetriggerTimer -> RetriggerTimer -> Bool Source #

(>) :: RetriggerTimer -> RetriggerTimer -> Bool Source #

(>=) :: RetriggerTimer -> RetriggerTimer -> Bool Source #

max :: RetriggerTimer -> RetriggerTimer -> RetriggerTimer Source #

min :: RetriggerTimer -> RetriggerTimer -> RetriggerTimer Source #

Ord Display |
Instance details Defined in SDL.Video Methods compare :: Display -> Display -> Ordering Source # (<) :: Display -> Display -> Bool Source # (<=) :: Display -> Display -> Bool Source # (>) :: Display -> Display -> Bool Source # (>=) :: Display -> Display -> Bool Source # max :: Display -> Display -> Display Source # min :: Display -> Display -> Display Source #
Ord DisplayMode |

Instance details

Defined in SDL.Video

Methods

compare :: DisplayMode -> DisplayMode -> Ordering Source #

(<) :: DisplayMode -> DisplayMode -> Bool Source #

(<=) :: DisplayMode -> DisplayMode -> Bool Source #

(>) :: DisplayMode -> DisplayMode -> Bool Source #

(>=) :: DisplayMode -> DisplayMode -> Bool Source #

max :: DisplayMode -> DisplayMode -> DisplayMode Source #

min :: DisplayMode -> DisplayMode -> DisplayMode Source #

Ord MessageKind |

Instance details

Defined in SDL.Video

Methods

compare :: MessageKind -> MessageKind -> Ordering Source #

(<) :: MessageKind -> MessageKind -> Bool Source #

(<=) :: MessageKind -> MessageKind -> Bool Source #

(>) :: MessageKind -> MessageKind -> Bool Source #

(>=) :: MessageKind -> MessageKind -> Bool Source #

max :: MessageKind -> MessageKind -> MessageKind Source #

min :: MessageKind -> MessageKind -> MessageKind Source #

Ord VideoDriver |

Instance details

Defined in SDL.Video

Methods

compare :: VideoDriver -> VideoDriver -> Ordering Source #

(<) :: VideoDriver -> VideoDriver -> Bool Source #

(<=) :: VideoDriver -> VideoDriver -> Bool Source #

(>) :: VideoDriver -> VideoDriver -> Bool Source #

(>=) :: VideoDriver -> VideoDriver -> Bool Source #

max :: VideoDriver -> VideoDriver -> VideoDriver Source #

min :: VideoDriver -> VideoDriver -> VideoDriver Source #

Ord WindowConfig |

Instance details

Defined in SDL.Video

Methods

compare :: WindowConfig -> WindowConfig -> Ordering Source #

(<) :: WindowConfig -> WindowConfig -> Bool Source #

(<=) :: WindowConfig -> WindowConfig -> Bool Source #

(>) :: WindowConfig -> WindowConfig -> Bool Source #

(>=) :: WindowConfig -> WindowConfig -> Bool Source #

max :: WindowConfig -> WindowConfig -> WindowConfig Source #

min :: WindowConfig -> WindowConfig -> WindowConfig Source #

Ord WindowGraphicsContext |

Instance details

Defined in SDL.Video

Methods

compare :: WindowGraphicsContext -> WindowGraphicsContext -> Ordering Source #

(<) :: WindowGraphicsContext -> WindowGraphicsContext -> Bool Source #

(<=) :: WindowGraphicsContext -> WindowGraphicsContext -> Bool Source #

(>) :: WindowGraphicsContext -> WindowGraphicsContext -> Bool Source #

(>=) :: WindowGraphicsContext -> WindowGraphicsContext -> Bool Source #

max :: WindowGraphicsContext -> WindowGraphicsContext -> WindowGraphicsContext Source #

min :: WindowGraphicsContext -> WindowGraphicsContext -> WindowGraphicsContext Source #

Ord WindowMode |

Instance details

Defined in SDL.Video

Methods

compare :: WindowMode -> WindowMode -> Ordering Source #

(<) :: WindowMode -> WindowMode -> Bool Source #

(<=) :: WindowMode -> WindowMode -> Bool Source #

(>) :: WindowMode -> WindowMode -> Bool Source #

(>=) :: WindowMode -> WindowMode -> Bool Source #

max :: WindowMode -> WindowMode -> WindowMode Source #

min :: WindowMode -> WindowMode -> WindowMode Source #

Ord WindowPosition |

Instance details

Defined in SDL.Video

Methods

compare :: WindowPosition -> WindowPosition -> Ordering Source #

(<) :: WindowPosition -> WindowPosition -> Bool Source #

(<=) :: WindowPosition -> WindowPosition -> Bool Source #

(>) :: WindowPosition -> WindowPosition -> Bool Source #

(>=) :: WindowPosition -> WindowPosition -> Bool Source #

max :: WindowPosition -> WindowPosition -> WindowPosition Source #

min :: WindowPosition -> WindowPosition -> WindowPosition Source #

Ord Mode |
Instance details Defined in SDL.Video.OpenGL Methods compare :: Mode -> Mode -> Ordering Source # (<) :: Mode -> Mode -> Bool Source # (<=) :: Mode -> Mode -> Bool Source # (>) :: Mode -> Mode -> Bool Source # (>=) :: Mode -> Mode -> Bool Source # max :: Mode -> Mode -> Mode Source # min :: Mode -> Mode -> Mode Source #
Ord OpenGLConfig |

Instance details

Defined in SDL.Video.OpenGL

Methods

compare :: OpenGLConfig -> OpenGLConfig -> Ordering Source #

(<) :: OpenGLConfig -> OpenGLConfig -> Bool Source #

(<=) :: OpenGLConfig -> OpenGLConfig -> Bool Source #

(>) :: OpenGLConfig -> OpenGLConfig -> Bool Source #

(>=) :: OpenGLConfig -> OpenGLConfig -> Bool Source #

max :: OpenGLConfig -> OpenGLConfig -> OpenGLConfig Source #

min :: OpenGLConfig -> OpenGLConfig -> OpenGLConfig Source #

Ord Profile |
Instance details Defined in SDL.Video.OpenGL Methods compare :: Profile -> Profile -> Ordering Source # (<) :: Profile -> Profile -> Bool Source # (<=) :: Profile -> Profile -> Bool Source # (>) :: Profile -> Profile -> Bool Source # (>=) :: Profile -> Profile -> Bool Source # max :: Profile -> Profile -> Profile Source # min :: Profile -> Profile -> Profile Source #
Ord SwapInterval |

Instance details

Defined in SDL.Video.OpenGL

Methods

compare :: SwapInterval -> SwapInterval -> Ordering Source #

(<) :: SwapInterval -> SwapInterval -> Bool Source #

(<=) :: SwapInterval -> SwapInterval -> Bool Source #

(>) :: SwapInterval -> SwapInterval -> Bool Source #

(>=) :: SwapInterval -> SwapInterval -> Bool Source #

max :: SwapInterval -> SwapInterval -> SwapInterval Source #

min :: SwapInterval -> SwapInterval -> SwapInterval Source #

Ord BlendMode |

Instance details

Defined in SDL.Video.Renderer

Methods

compare :: BlendMode -> BlendMode -> Ordering Source #

(<) :: BlendMode -> BlendMode -> Bool Source #

(<=) :: BlendMode -> BlendMode -> Bool Source #

(>) :: BlendMode -> BlendMode -> Bool Source #

(>=) :: BlendMode -> BlendMode -> Bool Source #

max :: BlendMode -> BlendMode -> BlendMode Source #

min :: BlendMode -> BlendMode -> BlendMode Source #

Ord PixelFormat |

Instance details

Defined in SDL.Video.Renderer

Methods

compare :: PixelFormat -> PixelFormat -> Ordering Source #

(<) :: PixelFormat -> PixelFormat -> Bool Source #

(<=) :: PixelFormat -> PixelFormat -> Bool Source #

(>) :: PixelFormat -> PixelFormat -> Bool Source #

(>=) :: PixelFormat -> PixelFormat -> Bool Source #

max :: PixelFormat -> PixelFormat -> PixelFormat Source #

min :: PixelFormat -> PixelFormat -> PixelFormat Source #

Ord RendererConfig |

Instance details

Defined in SDL.Video.Renderer

Methods

compare :: RendererConfig -> RendererConfig -> Ordering Source #

(<) :: RendererConfig -> RendererConfig -> Bool Source #

(<=) :: RendererConfig -> RendererConfig -> Bool Source #

(>) :: RendererConfig -> RendererConfig -> Bool Source #

(>=) :: RendererConfig -> RendererConfig -> Bool Source #

max :: RendererConfig -> RendererConfig -> RendererConfig Source #

min :: RendererConfig -> RendererConfig -> RendererConfig Source #

Ord RendererInfo |

Instance details

Defined in SDL.Video.Renderer

Methods

compare :: RendererInfo -> RendererInfo -> Ordering Source #

(<) :: RendererInfo -> RendererInfo -> Bool Source #

(<=) :: RendererInfo -> RendererInfo -> Bool Source #

(>) :: RendererInfo -> RendererInfo -> Bool Source #

(>=) :: RendererInfo -> RendererInfo -> Bool Source #

max :: RendererInfo -> RendererInfo -> RendererInfo Source #

min :: RendererInfo -> RendererInfo -> RendererInfo Source #

Ord RendererType |

Instance details

Defined in SDL.Video.Renderer

Methods

compare :: RendererType -> RendererType -> Ordering Source #

(<) :: RendererType -> RendererType -> Bool Source #

(<=) :: RendererType -> RendererType -> Bool Source #

(>) :: RendererType -> RendererType -> Bool Source #

(>=) :: RendererType -> RendererType -> Bool Source #

max :: RendererType -> RendererType -> RendererType Source #

min :: RendererType -> RendererType -> RendererType Source #

Ord TextureAccess |

Instance details

Defined in SDL.Video.Renderer

Methods

compare :: TextureAccess -> TextureAccess -> Ordering Source #

(<) :: TextureAccess -> TextureAccess -> Bool Source #

(<=) :: TextureAccess -> TextureAccess -> Bool Source #

(>) :: TextureAccess -> TextureAccess -> Bool Source #

(>=) :: TextureAccess -> TextureAccess -> Bool Source #

max :: TextureAccess -> TextureAccess -> TextureAccess Source #

min :: TextureAccess -> TextureAccess -> TextureAccess Source #

Ord TextureInfo |

Instance details

Defined in SDL.Video.Renderer

Methods

compare :: TextureInfo -> TextureInfo -> Ordering Source #

(<) :: TextureInfo -> TextureInfo -> Bool Source #

(<=) :: TextureInfo -> TextureInfo -> Bool Source #

(>) :: TextureInfo -> TextureInfo -> Bool Source #

(>=) :: TextureInfo -> TextureInfo -> Bool Source #

max :: TextureInfo -> TextureInfo -> TextureInfo Source #

min :: TextureInfo -> TextureInfo -> TextureInfo Source #

Ord Hinting |
Instance details Defined in SDL.Font Methods compare :: Hinting -> Hinting -> Ordering Source # (<) :: Hinting -> Hinting -> Bool Source # (<=) :: Hinting -> Hinting -> Bool Source # (>) :: Hinting -> Hinting -> Bool Source # (>=) :: Hinting -> Hinting -> Bool Source # max :: Hinting -> Hinting -> Hinting Source # min :: Hinting -> Hinting -> Hinting Source #
Ord Style |
Instance details Defined in SDL.Font Methods compare :: Style -> Style -> Ordering Source # (<) :: Style -> Style -> Bool Source # (<=) :: Style -> Style -> Bool Source # (>) :: Style -> Style -> Bool Source # (>=) :: Style -> Style -> Bool Source # max :: Style -> Style -> Style Source # min :: Style -> Style -> Style Source #
Ord AnnLookup |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: AnnLookup -> AnnLookup -> Ordering Source #

(<) :: AnnLookup -> AnnLookup -> Bool Source #

(<=) :: AnnLookup -> AnnLookup -> Bool Source #

(>) :: AnnLookup -> AnnLookup -> Bool Source #

(>=) :: AnnLookup -> AnnLookup -> Bool Source #

max :: AnnLookup -> AnnLookup -> AnnLookup Source #

min :: AnnLookup -> AnnLookup -> AnnLookup Source #

Ord AnnTarget |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: AnnTarget -> AnnTarget -> Ordering Source #

(<) :: AnnTarget -> AnnTarget -> Bool Source #

(<=) :: AnnTarget -> AnnTarget -> Bool Source #

(>) :: AnnTarget -> AnnTarget -> Bool Source #

(>=) :: AnnTarget -> AnnTarget -> Bool Source #

max :: AnnTarget -> AnnTarget -> AnnTarget Source #

min :: AnnTarget -> AnnTarget -> AnnTarget Source #

Ord Bang |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Bang -> Bang -> Ordering Source # (<) :: Bang -> Bang -> Bool Source # (<=) :: Bang -> Bang -> Bool Source # (>) :: Bang -> Bang -> Bool Source # (>=) :: Bang -> Bang -> Bool Source # max :: Bang -> Bang -> Bang Source # min :: Bang -> Bang -> Bang Source #
Ord BndrVis |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: BndrVis -> BndrVis -> Ordering Source # (<) :: BndrVis -> BndrVis -> Bool Source # (<=) :: BndrVis -> BndrVis -> Bool Source # (>) :: BndrVis -> BndrVis -> Bool Source # (>=) :: BndrVis -> BndrVis -> Bool Source # max :: BndrVis -> BndrVis -> BndrVis Source # min :: BndrVis -> BndrVis -> BndrVis Source #
Ord Body |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Body -> Body -> Ordering Source # (<) :: Body -> Body -> Bool Source # (<=) :: Body -> Body -> Bool Source # (>) :: Body -> Body -> Bool Source # (>=) :: Body -> Body -> Bool Source # max :: Body -> Body -> Body Source # min :: Body -> Body -> Body Source #
Ord Bytes |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Bytes -> Bytes -> Ordering Source # (<) :: Bytes -> Bytes -> Bool Source # (<=) :: Bytes -> Bytes -> Bool Source # (>) :: Bytes -> Bytes -> Bool Source # (>=) :: Bytes -> Bytes -> Bool Source # max :: Bytes -> Bytes -> Bytes Source # min :: Bytes -> Bytes -> Bytes Source #
Ord Callconv |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Callconv -> Callconv -> Ordering Source # (<) :: Callconv -> Callconv -> Bool Source # (<=) :: Callconv -> Callconv -> Bool Source # (>) :: Callconv -> Callconv -> Bool Source # (>=) :: Callconv -> Callconv -> Bool Source # max :: Callconv -> Callconv -> Callconv Source # min :: Callconv -> Callconv -> Callconv Source #
Ord Clause |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Clause -> Clause -> Ordering Source # (<) :: Clause -> Clause -> Bool Source # (<=) :: Clause -> Clause -> Bool Source # (>) :: Clause -> Clause -> Bool Source # (>=) :: Clause -> Clause -> Bool Source # max :: Clause -> Clause -> Clause Source # min :: Clause -> Clause -> Clause Source #
Ord Con |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Con -> Con -> Ordering Source # (<) :: Con -> Con -> Bool Source # (<=) :: Con -> Con -> Bool Source # (>) :: Con -> Con -> Bool Source # (>=) :: Con -> Con -> Bool Source # max :: Con -> Con -> Con Source # min :: Con -> Con -> Con Source #
Ord Dec |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Dec -> Dec -> Ordering Source # (<) :: Dec -> Dec -> Bool Source # (<=) :: Dec -> Dec -> Bool Source # (>) :: Dec -> Dec -> Bool Source # (>=) :: Dec -> Dec -> Bool Source # max :: Dec -> Dec -> Dec Source # min :: Dec -> Dec -> Dec Source #
Ord DecidedStrictness |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: DecidedStrictness -> DecidedStrictness -> Ordering Source #

(<) :: DecidedStrictness -> DecidedStrictness -> Bool Source #

(<=) :: DecidedStrictness -> DecidedStrictness -> Bool Source #

(>) :: DecidedStrictness -> DecidedStrictness -> Bool Source #

(>=) :: DecidedStrictness -> DecidedStrictness -> Bool Source #

max :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness Source #

min :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness Source #

Ord DerivClause |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: DerivClause -> DerivClause -> Ordering Source #

(<) :: DerivClause -> DerivClause -> Bool Source #

(<=) :: DerivClause -> DerivClause -> Bool Source #

(>) :: DerivClause -> DerivClause -> Bool Source #

(>=) :: DerivClause -> DerivClause -> Bool Source #

max :: DerivClause -> DerivClause -> DerivClause Source #

min :: DerivClause -> DerivClause -> DerivClause Source #

Ord DerivStrategy |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: DerivStrategy -> DerivStrategy -> Ordering Source #

(<) :: DerivStrategy -> DerivStrategy -> Bool Source #

(<=) :: DerivStrategy -> DerivStrategy -> Bool Source #

(>) :: DerivStrategy -> DerivStrategy -> Bool Source #

(>=) :: DerivStrategy -> DerivStrategy -> Bool Source #

max :: DerivStrategy -> DerivStrategy -> DerivStrategy Source #

min :: DerivStrategy -> DerivStrategy -> DerivStrategy Source #

Ord DocLoc |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: DocLoc -> DocLoc -> Ordering Source # (<) :: DocLoc -> DocLoc -> Bool Source # (<=) :: DocLoc -> DocLoc -> Bool Source # (>) :: DocLoc -> DocLoc -> Bool Source # (>=) :: DocLoc -> DocLoc -> Bool Source # max :: DocLoc -> DocLoc -> DocLoc Source # min :: DocLoc -> DocLoc -> DocLoc Source #
Ord Exp |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Exp -> Exp -> Ordering Source # (<) :: Exp -> Exp -> Bool Source # (<=) :: Exp -> Exp -> Bool Source # (>) :: Exp -> Exp -> Bool Source # (>=) :: Exp -> Exp -> Bool Source # max :: Exp -> Exp -> Exp Source # min :: Exp -> Exp -> Exp Source #
Ord FamilyResultSig |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: FamilyResultSig -> FamilyResultSig -> Ordering Source #

(<) :: FamilyResultSig -> FamilyResultSig -> Bool Source #

(<=) :: FamilyResultSig -> FamilyResultSig -> Bool Source #

(>) :: FamilyResultSig -> FamilyResultSig -> Bool Source #

(>=) :: FamilyResultSig -> FamilyResultSig -> Bool Source #

max :: FamilyResultSig -> FamilyResultSig -> FamilyResultSig Source #

min :: FamilyResultSig -> FamilyResultSig -> FamilyResultSig Source #

Ord Fixity |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Fixity -> Fixity -> Ordering Source # (<) :: Fixity -> Fixity -> Bool Source # (<=) :: Fixity -> Fixity -> Bool Source # (>) :: Fixity -> Fixity -> Bool Source # (>=) :: Fixity -> Fixity -> Bool Source # max :: Fixity -> Fixity -> Fixity Source # min :: Fixity -> Fixity -> Fixity Source #
Ord FixityDirection |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: FixityDirection -> FixityDirection -> Ordering Source #

(<) :: FixityDirection -> FixityDirection -> Bool Source #

(<=) :: FixityDirection -> FixityDirection -> Bool Source #

(>) :: FixityDirection -> FixityDirection -> Bool Source #

(>=) :: FixityDirection -> FixityDirection -> Bool Source #

max :: FixityDirection -> FixityDirection -> FixityDirection Source #

min :: FixityDirection -> FixityDirection -> FixityDirection Source #

Ord Foreign |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Foreign -> Foreign -> Ordering Source # (<) :: Foreign -> Foreign -> Bool Source # (<=) :: Foreign -> Foreign -> Bool Source # (>) :: Foreign -> Foreign -> Bool Source # (>=) :: Foreign -> Foreign -> Bool Source # max :: Foreign -> Foreign -> Foreign Source # min :: Foreign -> Foreign -> Foreign Source #
Ord FunDep |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: FunDep -> FunDep -> Ordering Source # (<) :: FunDep -> FunDep -> Bool Source # (<=) :: FunDep -> FunDep -> Bool Source # (>) :: FunDep -> FunDep -> Bool Source # (>=) :: FunDep -> FunDep -> Bool Source # max :: FunDep -> FunDep -> FunDep Source # min :: FunDep -> FunDep -> FunDep Source #
Ord Guard |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Guard -> Guard -> Ordering Source # (<) :: Guard -> Guard -> Bool Source # (<=) :: Guard -> Guard -> Bool Source # (>) :: Guard -> Guard -> Bool Source # (>=) :: Guard -> Guard -> Bool Source # max :: Guard -> Guard -> Guard Source # min :: Guard -> Guard -> Guard Source #
Ord Info |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Info -> Info -> Ordering Source # (<) :: Info -> Info -> Bool Source # (<=) :: Info -> Info -> Bool Source # (>) :: Info -> Info -> Bool Source # (>=) :: Info -> Info -> Bool Source # max :: Info -> Info -> Info Source # min :: Info -> Info -> Info Source #
Ord InjectivityAnn |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: InjectivityAnn -> InjectivityAnn -> Ordering Source #

(<) :: InjectivityAnn -> InjectivityAnn -> Bool Source #

(<=) :: InjectivityAnn -> InjectivityAnn -> Bool Source #

(>) :: InjectivityAnn -> InjectivityAnn -> Bool Source #

(>=) :: InjectivityAnn -> InjectivityAnn -> Bool Source #

max :: InjectivityAnn -> InjectivityAnn -> InjectivityAnn Source #

min :: InjectivityAnn -> InjectivityAnn -> InjectivityAnn Source #

Ord Inline |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Inline -> Inline -> Ordering Source # (<) :: Inline -> Inline -> Bool Source # (<=) :: Inline -> Inline -> Bool Source # (>) :: Inline -> Inline -> Bool Source # (>=) :: Inline -> Inline -> Bool Source # max :: Inline -> Inline -> Inline Source # min :: Inline -> Inline -> Inline Source #
Ord Lit |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Lit -> Lit -> Ordering Source # (<) :: Lit -> Lit -> Bool Source # (<=) :: Lit -> Lit -> Bool Source # (>) :: Lit -> Lit -> Bool Source # (>=) :: Lit -> Lit -> Bool Source # max :: Lit -> Lit -> Lit Source # min :: Lit -> Lit -> Lit Source #
Ord Loc |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Loc -> Loc -> Ordering Source # (<) :: Loc -> Loc -> Bool Source # (<=) :: Loc -> Loc -> Bool Source # (>) :: Loc -> Loc -> Bool Source # (>=) :: Loc -> Loc -> Bool Source # max :: Loc -> Loc -> Loc Source # min :: Loc -> Loc -> Loc Source #
Ord Match |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Match -> Match -> Ordering Source # (<) :: Match -> Match -> Bool Source # (<=) :: Match -> Match -> Bool Source # (>) :: Match -> Match -> Bool Source # (>=) :: Match -> Match -> Bool Source # max :: Match -> Match -> Match Source # min :: Match -> Match -> Match Source #
Ord ModName |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: ModName -> ModName -> Ordering Source # (<) :: ModName -> ModName -> Bool Source # (<=) :: ModName -> ModName -> Bool Source # (>) :: ModName -> ModName -> Bool Source # (>=) :: ModName -> ModName -> Bool Source # max :: ModName -> ModName -> ModName Source # min :: ModName -> ModName -> ModName Source #
Ord Module |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Module -> Module -> Ordering Source # (<) :: Module -> Module -> Bool Source # (<=) :: Module -> Module -> Bool Source # (>) :: Module -> Module -> Bool Source # (>=) :: Module -> Module -> Bool Source # max :: Module -> Module -> Module Source # min :: Module -> Module -> Module Source #
Ord ModuleInfo |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: ModuleInfo -> ModuleInfo -> Ordering Source #

(<) :: ModuleInfo -> ModuleInfo -> Bool Source #

(<=) :: ModuleInfo -> ModuleInfo -> Bool Source #

(>) :: ModuleInfo -> ModuleInfo -> Bool Source #

(>=) :: ModuleInfo -> ModuleInfo -> Bool Source #

max :: ModuleInfo -> ModuleInfo -> ModuleInfo Source #

min :: ModuleInfo -> ModuleInfo -> ModuleInfo Source #

Ord Name |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Name -> Name -> Ordering Source # (<) :: Name -> Name -> Bool Source # (<=) :: Name -> Name -> Bool Source # (>) :: Name -> Name -> Bool Source # (>=) :: Name -> Name -> Bool Source # max :: Name -> Name -> Name Source # min :: Name -> Name -> Name Source #
Ord NameFlavour |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: NameFlavour -> NameFlavour -> Ordering Source #

(<) :: NameFlavour -> NameFlavour -> Bool Source #

(<=) :: NameFlavour -> NameFlavour -> Bool Source #

(>) :: NameFlavour -> NameFlavour -> Bool Source #

(>=) :: NameFlavour -> NameFlavour -> Bool Source #

max :: NameFlavour -> NameFlavour -> NameFlavour Source #

min :: NameFlavour -> NameFlavour -> NameFlavour Source #

Ord NameSpace |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: NameSpace -> NameSpace -> Ordering Source #

(<) :: NameSpace -> NameSpace -> Bool Source #

(<=) :: NameSpace -> NameSpace -> Bool Source #

(>) :: NameSpace -> NameSpace -> Bool Source #

(>=) :: NameSpace -> NameSpace -> Bool Source #

max :: NameSpace -> NameSpace -> NameSpace Source #

min :: NameSpace -> NameSpace -> NameSpace Source #

Ord NamespaceSpecifier |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: NamespaceSpecifier -> NamespaceSpecifier -> Ordering Source #

(<) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool Source #

(<=) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool Source #

(>) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool Source #

(>=) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool Source #

max :: NamespaceSpecifier -> NamespaceSpecifier -> NamespaceSpecifier Source #

min :: NamespaceSpecifier -> NamespaceSpecifier -> NamespaceSpecifier Source #

Ord OccName |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: OccName -> OccName -> Ordering Source # (<) :: OccName -> OccName -> Bool Source # (<=) :: OccName -> OccName -> Bool Source # (>) :: OccName -> OccName -> Bool Source # (>=) :: OccName -> OccName -> Bool Source # max :: OccName -> OccName -> OccName Source # min :: OccName -> OccName -> OccName Source #
Ord Overlap |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Overlap -> Overlap -> Ordering Source # (<) :: Overlap -> Overlap -> Bool Source # (<=) :: Overlap -> Overlap -> Bool Source # (>) :: Overlap -> Overlap -> Bool Source # (>=) :: Overlap -> Overlap -> Bool Source # max :: Overlap -> Overlap -> Overlap Source # min :: Overlap -> Overlap -> Overlap Source #
Ord Pat |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Pat -> Pat -> Ordering Source # (<) :: Pat -> Pat -> Bool Source # (<=) :: Pat -> Pat -> Bool Source # (>) :: Pat -> Pat -> Bool Source # (>=) :: Pat -> Pat -> Bool Source # max :: Pat -> Pat -> Pat Source # min :: Pat -> Pat -> Pat Source #
Ord PatSynArgs |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: PatSynArgs -> PatSynArgs -> Ordering Source #

(<) :: PatSynArgs -> PatSynArgs -> Bool Source #

(<=) :: PatSynArgs -> PatSynArgs -> Bool Source #

(>) :: PatSynArgs -> PatSynArgs -> Bool Source #

(>=) :: PatSynArgs -> PatSynArgs -> Bool Source #

max :: PatSynArgs -> PatSynArgs -> PatSynArgs Source #

min :: PatSynArgs -> PatSynArgs -> PatSynArgs Source #

Ord PatSynDir |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: PatSynDir -> PatSynDir -> Ordering Source #

(<) :: PatSynDir -> PatSynDir -> Bool Source #

(<=) :: PatSynDir -> PatSynDir -> Bool Source #

(>) :: PatSynDir -> PatSynDir -> Bool Source #

(>=) :: PatSynDir -> PatSynDir -> Bool Source #

max :: PatSynDir -> PatSynDir -> PatSynDir Source #

min :: PatSynDir -> PatSynDir -> PatSynDir Source #

Ord Phases |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Phases -> Phases -> Ordering Source # (<) :: Phases -> Phases -> Bool Source # (<=) :: Phases -> Phases -> Bool Source # (>) :: Phases -> Phases -> Bool Source # (>=) :: Phases -> Phases -> Bool Source # max :: Phases -> Phases -> Phases Source # min :: Phases -> Phases -> Phases Source #
Ord PkgName |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: PkgName -> PkgName -> Ordering Source # (<) :: PkgName -> PkgName -> Bool Source # (<=) :: PkgName -> PkgName -> Bool Source # (>) :: PkgName -> PkgName -> Bool Source # (>=) :: PkgName -> PkgName -> Bool Source # max :: PkgName -> PkgName -> PkgName Source # min :: PkgName -> PkgName -> PkgName Source #
Ord Pragma |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Pragma -> Pragma -> Ordering Source # (<) :: Pragma -> Pragma -> Bool Source # (<=) :: Pragma -> Pragma -> Bool Source # (>) :: Pragma -> Pragma -> Bool Source # (>=) :: Pragma -> Pragma -> Bool Source # max :: Pragma -> Pragma -> Pragma Source # min :: Pragma -> Pragma -> Pragma Source #
Ord Range |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Range -> Range -> Ordering Source # (<) :: Range -> Range -> Bool Source # (<=) :: Range -> Range -> Bool Source # (>) :: Range -> Range -> Bool Source # (>=) :: Range -> Range -> Bool Source # max :: Range -> Range -> Range Source # min :: Range -> Range -> Range Source #
Ord Role |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Role -> Role -> Ordering Source # (<) :: Role -> Role -> Bool Source # (<=) :: Role -> Role -> Bool Source # (>) :: Role -> Role -> Bool Source # (>=) :: Role -> Role -> Bool Source # max :: Role -> Role -> Role Source # min :: Role -> Role -> Role Source #
Ord RuleBndr |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: RuleBndr -> RuleBndr -> Ordering Source # (<) :: RuleBndr -> RuleBndr -> Bool Source # (<=) :: RuleBndr -> RuleBndr -> Bool Source # (>) :: RuleBndr -> RuleBndr -> Bool Source # (>=) :: RuleBndr -> RuleBndr -> Bool Source # max :: RuleBndr -> RuleBndr -> RuleBndr Source # min :: RuleBndr -> RuleBndr -> RuleBndr Source #
Ord RuleMatch |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: RuleMatch -> RuleMatch -> Ordering Source #

(<) :: RuleMatch -> RuleMatch -> Bool Source #

(<=) :: RuleMatch -> RuleMatch -> Bool Source #

(>) :: RuleMatch -> RuleMatch -> Bool Source #

(>=) :: RuleMatch -> RuleMatch -> Bool Source #

max :: RuleMatch -> RuleMatch -> RuleMatch Source #

min :: RuleMatch -> RuleMatch -> RuleMatch Source #

Ord Safety |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Safety -> Safety -> Ordering Source # (<) :: Safety -> Safety -> Bool Source # (<=) :: Safety -> Safety -> Bool Source # (>) :: Safety -> Safety -> Bool Source # (>=) :: Safety -> Safety -> Bool Source # max :: Safety -> Safety -> Safety Source # min :: Safety -> Safety -> Safety Source #
Ord SourceStrictness |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: SourceStrictness -> SourceStrictness -> Ordering Source #

(<) :: SourceStrictness -> SourceStrictness -> Bool Source #

(<=) :: SourceStrictness -> SourceStrictness -> Bool Source #

(>) :: SourceStrictness -> SourceStrictness -> Bool Source #

(>=) :: SourceStrictness -> SourceStrictness -> Bool Source #

max :: SourceStrictness -> SourceStrictness -> SourceStrictness Source #

min :: SourceStrictness -> SourceStrictness -> SourceStrictness Source #

Ord SourceUnpackedness |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: SourceUnpackedness -> SourceUnpackedness -> Ordering Source #

(<) :: SourceUnpackedness -> SourceUnpackedness -> Bool Source #

(<=) :: SourceUnpackedness -> SourceUnpackedness -> Bool Source #

(>) :: SourceUnpackedness -> SourceUnpackedness -> Bool Source #

(>=) :: SourceUnpackedness -> SourceUnpackedness -> Bool Source #

max :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness Source #

min :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness Source #

Ord Specificity |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Specificity -> Specificity -> Ordering Source #

(<) :: Specificity -> Specificity -> Bool Source #

(<=) :: Specificity -> Specificity -> Bool Source #

(>) :: Specificity -> Specificity -> Bool Source #

(>=) :: Specificity -> Specificity -> Bool Source #

max :: Specificity -> Specificity -> Specificity Source #

min :: Specificity -> Specificity -> Specificity Source #

Ord Stmt |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Stmt -> Stmt -> Ordering Source # (<) :: Stmt -> Stmt -> Bool Source # (<=) :: Stmt -> Stmt -> Bool Source # (>) :: Stmt -> Stmt -> Bool Source # (>=) :: Stmt -> Stmt -> Bool Source # max :: Stmt -> Stmt -> Stmt Source # min :: Stmt -> Stmt -> Stmt Source #
Ord TyLit |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: TyLit -> TyLit -> Ordering Source # (<) :: TyLit -> TyLit -> Bool Source # (<=) :: TyLit -> TyLit -> Bool Source # (>) :: TyLit -> TyLit -> Bool Source # (>=) :: TyLit -> TyLit -> Bool Source # max :: TyLit -> TyLit -> TyLit Source # min :: TyLit -> TyLit -> TyLit Source #
Ord TySynEqn |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: TySynEqn -> TySynEqn -> Ordering Source # (<) :: TySynEqn -> TySynEqn -> Bool Source # (<=) :: TySynEqn -> TySynEqn -> Bool Source # (>) :: TySynEqn -> TySynEqn -> Bool Source # (>=) :: TySynEqn -> TySynEqn -> Bool Source # max :: TySynEqn -> TySynEqn -> TySynEqn Source # min :: TySynEqn -> TySynEqn -> TySynEqn Source #
Ord Type |
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Type -> Type -> Ordering Source # (<) :: Type -> Type -> Bool Source # (<=) :: Type -> Type -> Bool Source # (>) :: Type -> Type -> Bool Source # (>=) :: Type -> Type -> Bool Source # max :: Type -> Type -> Type Source # min :: Type -> Type -> Type Source #
Ord TypeFamilyHead |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: TypeFamilyHead -> TypeFamilyHead -> Ordering Source #

(<) :: TypeFamilyHead -> TypeFamilyHead -> Bool Source #

(<=) :: TypeFamilyHead -> TypeFamilyHead -> Bool Source #

(>) :: TypeFamilyHead -> TypeFamilyHead -> Bool Source #

(>=) :: TypeFamilyHead -> TypeFamilyHead -> Bool Source #

max :: TypeFamilyHead -> TypeFamilyHead -> TypeFamilyHead Source #

min :: TypeFamilyHead -> TypeFamilyHead -> TypeFamilyHead Source #

Ord I8 |
Instance details Defined in Data.Text.Foreign Methods compare :: I8 -> I8 -> Ordering Source # (<) :: I8 -> I8 -> Bool Source # (<=) :: I8 -> I8 -> Bool Source # (>) :: I8 -> I8 -> Bool Source # (>=) :: I8 -> I8 -> Bool Source # max :: I8 -> I8 -> I8 Source # min :: I8 -> I8 -> I8 Source #
Ord Text |
Instance details Defined in Data.Text Methods compare :: Text -> Text -> Ordering Source # (<) :: Text -> Text -> Bool Source # (<=) :: Text -> Text -> Bool Source # (>) :: Text -> Text -> Bool Source # (>=) :: Text -> Text -> Bool Source # max :: Text -> Text -> Text Source # min :: Text -> Text -> Text Source #
Ord Builder |
Instance details Defined in Data.Text.Internal.Builder Methods compare :: Builder -> Builder -> Ordering Source # (<) :: Builder -> Builder -> Bool Source # (<=) :: Builder -> Builder -> Bool Source # (>) :: Builder -> Builder -> Bool Source # (>=) :: Builder -> Builder -> Bool Source # max :: Builder -> Builder -> Builder Source # min :: Builder -> Builder -> Builder Source #
Ord Text |
Instance details Defined in Data.Text.Lazy Methods compare :: Text -> Text -> Ordering Source # (<) :: Text -> Text -> Bool Source # (<=) :: Text -> Text -> Bool Source # (>) :: Text -> Text -> Bool Source # (>=) :: Text -> Text -> Bool Source # max :: Text -> Text -> Text Source # min :: Text -> Text -> Text Source #
Ord B |
Instance details Defined in Data.Text.Short.Internal Methods compare :: B -> B -> Ordering Source # (<) :: B -> B -> Bool Source # (<=) :: B -> B -> Bool Source # (>) :: B -> B -> Bool Source # (>=) :: B -> B -> Bool Source # max :: B -> B -> B Source # min :: B -> B -> B Source #
Ord ShortText |

Instance details

Defined in Data.Text.Short.Internal

Methods

compare :: ShortText -> ShortText -> Ordering Source #

(<) :: ShortText -> ShortText -> Bool Source #

(<=) :: ShortText -> ShortText -> Bool Source #

(>) :: ShortText -> ShortText -> Bool Source #

(>=) :: ShortText -> ShortText -> Bool Source #

max :: ShortText -> ShortText -> ShortText Source #

min :: ShortText -> ShortText -> ShortText Source #

Ord ConstructorVariant |

Instance details

Defined in Language.Haskell.TH.Datatype

Methods

compare :: ConstructorVariant -> ConstructorVariant -> Ordering Source #

(<) :: ConstructorVariant -> ConstructorVariant -> Bool Source #

(<=) :: ConstructorVariant -> ConstructorVariant -> Bool Source #

(>) :: ConstructorVariant -> ConstructorVariant -> Bool Source #

(>=) :: ConstructorVariant -> ConstructorVariant -> Bool Source #

max :: ConstructorVariant -> ConstructorVariant -> ConstructorVariant Source #

min :: ConstructorVariant -> ConstructorVariant -> ConstructorVariant Source #

Ord DatatypeVariant |

Instance details

Defined in Language.Haskell.TH.Datatype

Methods

compare :: DatatypeVariant -> DatatypeVariant -> Ordering Source #

(<) :: DatatypeVariant -> DatatypeVariant -> Bool Source #

(<=) :: DatatypeVariant -> DatatypeVariant -> Bool Source #

(>) :: DatatypeVariant -> DatatypeVariant -> Bool Source #

(>=) :: DatatypeVariant -> DatatypeVariant -> Bool Source #

max :: DatatypeVariant -> DatatypeVariant -> DatatypeVariant Source #

min :: DatatypeVariant -> DatatypeVariant -> DatatypeVariant Source #

Ord FieldStrictness |

Instance details

Defined in Language.Haskell.TH.Datatype

Methods

compare :: FieldStrictness -> FieldStrictness -> Ordering Source #

(<) :: FieldStrictness -> FieldStrictness -> Bool Source #

(<=) :: FieldStrictness -> FieldStrictness -> Bool Source #

(>) :: FieldStrictness -> FieldStrictness -> Bool Source #

(>=) :: FieldStrictness -> FieldStrictness -> Bool Source #

max :: FieldStrictness -> FieldStrictness -> FieldStrictness Source #

min :: FieldStrictness -> FieldStrictness -> FieldStrictness Source #

Ord Strictness |

Instance details

Defined in Language.Haskell.TH.Datatype

Methods

compare :: Strictness -> Strictness -> Ordering Source #

(<) :: Strictness -> Strictness -> Bool Source #

(<=) :: Strictness -> Strictness -> Bool Source #

(>) :: Strictness -> Strictness -> Bool Source #

(>=) :: Strictness -> Strictness -> Bool Source #

max :: Strictness -> Strictness -> Strictness Source #

min :: Strictness -> Strictness -> Strictness Source #

Ord Unpackedness |

Instance details

Defined in Language.Haskell.TH.Datatype

Methods

compare :: Unpackedness -> Unpackedness -> Ordering Source #

(<) :: Unpackedness -> Unpackedness -> Bool Source #

(<=) :: Unpackedness -> Unpackedness -> Bool Source #

(>) :: Unpackedness -> Unpackedness -> Bool Source #

(>=) :: Unpackedness -> Unpackedness -> Bool Source #

max :: Unpackedness -> Unpackedness -> Unpackedness Source #

min :: Unpackedness -> Unpackedness -> Unpackedness Source #

Ord Day |
Instance details Defined in Data.Time.Calendar.Days Methods compare :: Day -> Day -> Ordering Source # (<) :: Day -> Day -> Bool Source # (<=) :: Day -> Day -> Bool Source # (>) :: Day -> Day -> Bool Source # (>=) :: Day -> Day -> Bool Source # max :: Day -> Day -> Day Source # min :: Day -> Day -> Day Source #
Ord Month |
Instance details Defined in Data.Time.Calendar.Month Methods compare :: Month -> Month -> Ordering Source # (<) :: Month -> Month -> Bool Source # (<=) :: Month -> Month -> Bool Source # (>) :: Month -> Month -> Bool Source # (>=) :: Month -> Month -> Bool Source # max :: Month -> Month -> Month Source # min :: Month -> Month -> Month Source #
Ord Quarter |
Instance details Defined in Data.Time.Calendar.Quarter Methods compare :: Quarter -> Quarter -> Ordering Source # (<) :: Quarter -> Quarter -> Bool Source # (<=) :: Quarter -> Quarter -> Bool Source # (>) :: Quarter -> Quarter -> Bool Source # (>=) :: Quarter -> Quarter -> Bool Source # max :: Quarter -> Quarter -> Quarter Source # min :: Quarter -> Quarter -> Quarter Source #
Ord QuarterOfYear |

Instance details

Defined in Data.Time.Calendar.Quarter

Methods

compare :: QuarterOfYear -> QuarterOfYear -> Ordering Source #

(<) :: QuarterOfYear -> QuarterOfYear -> Bool Source #

(<=) :: QuarterOfYear -> QuarterOfYear -> Bool Source #

(>) :: QuarterOfYear -> QuarterOfYear -> Bool Source #

(>=) :: QuarterOfYear -> QuarterOfYear -> Bool Source #

max :: QuarterOfYear -> QuarterOfYear -> QuarterOfYear Source #

min :: QuarterOfYear -> QuarterOfYear -> QuarterOfYear Source #

Ord DiffTime |

Instance details

Defined in Data.Time.Clock.Internal.DiffTime

Methods

compare :: DiffTime -> DiffTime -> Ordering Source #

(<) :: DiffTime -> DiffTime -> Bool Source #

(<=) :: DiffTime -> DiffTime -> Bool Source #

(>) :: DiffTime -> DiffTime -> Bool Source #

(>=) :: DiffTime -> DiffTime -> Bool Source #

max :: DiffTime -> DiffTime -> DiffTime Source #

min :: DiffTime -> DiffTime -> DiffTime Source #

Ord NominalDiffTime |

Instance details

Defined in Data.Time.Clock.Internal.NominalDiffTime

Methods

compare :: NominalDiffTime -> NominalDiffTime -> Ordering Source #

(<) :: NominalDiffTime -> NominalDiffTime -> Bool Source #

(<=) :: NominalDiffTime -> NominalDiffTime -> Bool Source #

(>) :: NominalDiffTime -> NominalDiffTime -> Bool Source #

(>=) :: NominalDiffTime -> NominalDiffTime -> Bool Source #

max :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime Source #

min :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime Source #

Ord UTCTime |
Instance details Defined in Data.Time.Clock.Internal.UTCTime Methods compare :: UTCTime -> UTCTime -> Ordering Source # (<) :: UTCTime -> UTCTime -> Bool Source # (<=) :: UTCTime -> UTCTime -> Bool Source # (>) :: UTCTime -> UTCTime -> Bool Source # (>=) :: UTCTime -> UTCTime -> Bool Source # max :: UTCTime -> UTCTime -> UTCTime Source # min :: UTCTime -> UTCTime -> UTCTime Source #
Ord UniversalTime |

Instance details

Defined in Data.Time.Clock.Internal.UniversalTime

Methods

compare :: UniversalTime -> UniversalTime -> Ordering Source #

(<) :: UniversalTime -> UniversalTime -> Bool Source #

(<=) :: UniversalTime -> UniversalTime -> Bool Source #

(>) :: UniversalTime -> UniversalTime -> Bool Source #

(>=) :: UniversalTime -> UniversalTime -> Bool Source #

max :: UniversalTime -> UniversalTime -> UniversalTime Source #

min :: UniversalTime -> UniversalTime -> UniversalTime Source #

Ord LocalTime |

Instance details

Defined in Data.Time.LocalTime.Internal.LocalTime

Methods

compare :: LocalTime -> LocalTime -> Ordering Source #

(<) :: LocalTime -> LocalTime -> Bool Source #

(<=) :: LocalTime -> LocalTime -> Bool Source #

(>) :: LocalTime -> LocalTime -> Bool Source #

(>=) :: LocalTime -> LocalTime -> Bool Source #

max :: LocalTime -> LocalTime -> LocalTime Source #

min :: LocalTime -> LocalTime -> LocalTime Source #

Ord TimeOfDay |

Instance details

Defined in Data.Time.LocalTime.Internal.TimeOfDay

Methods

compare :: TimeOfDay -> TimeOfDay -> Ordering Source #

(<) :: TimeOfDay -> TimeOfDay -> Bool Source #

(<=) :: TimeOfDay -> TimeOfDay -> Bool Source #

(>) :: TimeOfDay -> TimeOfDay -> Bool Source #

(>=) :: TimeOfDay -> TimeOfDay -> Bool Source #

max :: TimeOfDay -> TimeOfDay -> TimeOfDay Source #

min :: TimeOfDay -> TimeOfDay -> TimeOfDay Source #

Ord TimeZone |

Instance details

Defined in Data.Time.LocalTime.Internal.TimeZone

Methods

compare :: TimeZone -> TimeZone -> Ordering Source #

(<) :: TimeZone -> TimeZone -> Bool Source #

(<=) :: TimeZone -> TimeZone -> Bool Source #

(>) :: TimeZone -> TimeZone -> Bool Source #

(>=) :: TimeZone -> TimeZone -> Bool Source #

max :: TimeZone -> TimeZone -> TimeZone Source #

min :: TimeZone -> TimeZone -> TimeZone Source #

Ord UUID |
Instance details Defined in Data.UUID.Types.Internal Methods compare :: UUID -> UUID -> Ordering Source # (<) :: UUID -> UUID -> Bool Source # (<=) :: UUID -> UUID -> Bool Source # (>) :: UUID -> UUID -> Bool Source # (>=) :: UUID -> UUID -> Bool Source # max :: UUID -> UUID -> UUID Source # min :: UUID -> UUID -> UUID Source #
Ord UnpackedUUID |

Instance details

Defined in Data.UUID.Types.Internal

Methods

compare :: UnpackedUUID -> UnpackedUUID -> Ordering Source #

(<) :: UnpackedUUID -> UnpackedUUID -> Bool Source #

(<=) :: UnpackedUUID -> UnpackedUUID -> Bool Source #

(>) :: UnpackedUUID -> UnpackedUUID -> Bool Source #

(>=) :: UnpackedUUID -> UnpackedUUID -> Bool Source #

max :: UnpackedUUID -> UnpackedUUID -> UnpackedUUID Source #

min :: UnpackedUUID -> UnpackedUUID -> UnpackedUUID Source #

Ord CompressParams | Since: zlib-0.7.0.0

Instance details

Defined in Codec.Compression.Zlib.Internal

Methods

compare :: CompressParams -> CompressParams -> Ordering Source #

(<) :: CompressParams -> CompressParams -> Bool Source #

(<=) :: CompressParams -> CompressParams -> Bool Source #

(>) :: CompressParams -> CompressParams -> Bool Source #

(>=) :: CompressParams -> CompressParams -> Bool Source #

max :: CompressParams -> CompressParams -> CompressParams Source #

min :: CompressParams -> CompressParams -> CompressParams Source #

Ord DecompressError | Since: zlib-0.7.0.0

Instance details

Defined in Codec.Compression.Zlib.Internal

Methods

compare :: DecompressError -> DecompressError -> Ordering Source #

(<) :: DecompressError -> DecompressError -> Bool Source #

(<=) :: DecompressError -> DecompressError -> Bool Source #

(>) :: DecompressError -> DecompressError -> Bool Source #

(>=) :: DecompressError -> DecompressError -> Bool Source #

max :: DecompressError -> DecompressError -> DecompressError Source #

min :: DecompressError -> DecompressError -> DecompressError Source #

Ord DecompressParams | Since: zlib-0.7.0.0

Instance details

Defined in Codec.Compression.Zlib.Internal

Methods

compare :: DecompressParams -> DecompressParams -> Ordering Source #

(<) :: DecompressParams -> DecompressParams -> Bool Source #

(<=) :: DecompressParams -> DecompressParams -> Bool Source #

(>) :: DecompressParams -> DecompressParams -> Bool Source #

(>=) :: DecompressParams -> DecompressParams -> Bool Source #

max :: DecompressParams -> DecompressParams -> DecompressParams Source #

min :: DecompressParams -> DecompressParams -> DecompressParams Source #

Ord CompressionLevel | Since: zlib-0.7.0.0

Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

compare :: CompressionLevel -> CompressionLevel -> Ordering Source #

(<) :: CompressionLevel -> CompressionLevel -> Bool Source #

(<=) :: CompressionLevel -> CompressionLevel -> Bool Source #

(>) :: CompressionLevel -> CompressionLevel -> Bool Source #

(>=) :: CompressionLevel -> CompressionLevel -> Bool Source #

max :: CompressionLevel -> CompressionLevel -> CompressionLevel Source #

min :: CompressionLevel -> CompressionLevel -> CompressionLevel Source #

Ord CompressionStrategy |

Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

compare :: CompressionStrategy -> CompressionStrategy -> Ordering Source #

(<) :: CompressionStrategy -> CompressionStrategy -> Bool Source #

(<=) :: CompressionStrategy -> CompressionStrategy -> Bool Source #

(>) :: CompressionStrategy -> CompressionStrategy -> Bool Source #

(>=) :: CompressionStrategy -> CompressionStrategy -> Bool Source #

max :: CompressionStrategy -> CompressionStrategy -> CompressionStrategy Source #

min :: CompressionStrategy -> CompressionStrategy -> CompressionStrategy Source #

Ord DictionaryHash |

Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

compare :: DictionaryHash -> DictionaryHash -> Ordering Source #

(<) :: DictionaryHash -> DictionaryHash -> Bool Source #

(<=) :: DictionaryHash -> DictionaryHash -> Bool Source #

(>) :: DictionaryHash -> DictionaryHash -> Bool Source #

(>=) :: DictionaryHash -> DictionaryHash -> Bool Source #

max :: DictionaryHash -> DictionaryHash -> DictionaryHash Source #

min :: DictionaryHash -> DictionaryHash -> DictionaryHash Source #

Ord Format |
Instance details Defined in Codec.Compression.Zlib.Stream Methods compare :: Format -> Format -> Ordering Source # (<) :: Format -> Format -> Bool Source # (<=) :: Format -> Format -> Bool Source # (>) :: Format -> Format -> Bool Source # (>=) :: Format -> Format -> Bool Source # max :: Format -> Format -> Format Source # min :: Format -> Format -> Format Source #
Ord MemoryLevel | Since: zlib-0.7.0.0

Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

compare :: MemoryLevel -> MemoryLevel -> Ordering Source #

(<) :: MemoryLevel -> MemoryLevel -> Bool Source #

(<=) :: MemoryLevel -> MemoryLevel -> Bool Source #

(>) :: MemoryLevel -> MemoryLevel -> Bool Source #

(>=) :: MemoryLevel -> MemoryLevel -> Bool Source #

max :: MemoryLevel -> MemoryLevel -> MemoryLevel Source #

min :: MemoryLevel -> MemoryLevel -> MemoryLevel Source #

Ord Method |
Instance details Defined in Codec.Compression.Zlib.Stream Methods compare :: Method -> Method -> Ordering Source # (<) :: Method -> Method -> Bool Source # (<=) :: Method -> Method -> Bool Source # (>) :: Method -> Method -> Bool Source # (>=) :: Method -> Method -> Bool Source # max :: Method -> Method -> Method Source # min :: Method -> Method -> Method Source #
Ord WindowBits |

Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

compare :: WindowBits -> WindowBits -> Ordering Source #

(<) :: WindowBits -> WindowBits -> Bool Source #

(<=) :: WindowBits -> WindowBits -> Bool Source #

(>) :: WindowBits -> WindowBits -> Bool Source #

(>=) :: WindowBits -> WindowBits -> Bool Source #

max :: WindowBits -> WindowBits -> WindowBits Source #

min :: WindowBits -> WindowBits -> WindowBits Source #

Ord Integer |
Instance details Defined in GHC.Num.Integer Methods compare :: Integer -> Integer -> Ordering Source # (<) :: Integer -> Integer -> Bool Source # (<=) :: Integer -> Integer -> Bool Source # (>) :: Integer -> Integer -> Bool Source # (>=) :: Integer -> Integer -> Bool Source # max :: Integer -> Integer -> Integer Source # min :: Integer -> Integer -> Integer Source #
Ord Natural |
Instance details Defined in GHC.Num.Natural Methods compare :: Natural -> Natural -> Ordering Source # (<) :: Natural -> Natural -> Bool Source # (<=) :: Natural -> Natural -> Bool Source # (>) :: Natural -> Natural -> Bool Source # (>=) :: Natural -> Natural -> Bool Source # max :: Natural -> Natural -> Natural Source # min :: Natural -> Natural -> Natural Source #
Ord () |
Instance details Defined in GHC.Classes Methods compare :: () -> () -> Ordering Source # (<) :: () -> () -> Bool Source # (<=) :: () -> () -> Bool Source # (>) :: () -> () -> Bool Source # (>=) :: () -> () -> Bool Source # max :: () -> () -> () Source # min :: () -> () -> () Source #
Ord Bool |
Instance details Defined in GHC.Classes Methods compare :: Bool -> Bool -> Ordering Source # (<) :: Bool -> Bool -> Bool Source # (<=) :: Bool -> Bool -> Bool Source # (>) :: Bool -> Bool -> Bool Source # (>=) :: Bool -> Bool -> Bool Source # max :: Bool -> Bool -> Bool Source # min :: Bool -> Bool -> Bool Source #
Ord Char |
Instance details Defined in GHC.Classes Methods compare :: Char -> Char -> Ordering Source # (<) :: Char -> Char -> Bool Source # (<=) :: Char -> Char -> Bool Source # (>) :: Char -> Char -> Bool Source # (>=) :: Char -> Char -> Bool Source # max :: Char -> Char -> Char Source # min :: Char -> Char -> Char Source #

Ord Double

IEEE 754 `Double`-precision type includes not only numbers, but also positive and negative infinities and a special element called `NaN` (which can be quiet or signal).

IEEE 754-2008, section 5.11 requires that if at least one of arguments of `<=`, `<`, `>`, `>=` is `NaN` then the result of the comparison is `False`, and `instance` `Ord` `Double` complies with this requirement. This violates the reflexivity: both `NaN` `<=` `NaN` and `NaN` `>=` `NaN` are `False`.

IEEE 754-2008, section 5.10 defines `totalOrder` predicate. Unfortunately, `compare` on `Double`s violates the IEEE standard and does not define a total order. More specifically, both `compare` `NaN` `x` and `compare` `x` `NaN` always return `GT`.

Thus, users must be extremely cautious when using `instance` `Ord` `Double`. For instance, one should avoid ordered containers with keys represented by `Double`, because data loss and corruption may happen. An IEEE-compliant `compare` is available in `fp-ieee` package as `TotallyOrdered` newtype.

Moving further, the behaviour of `min` and `max` with regards to `NaN` is also non-compliant. IEEE 754-2008, section 5.3.1 defines that quiet `NaN` should be treated as a missing data by `minNum` and `maxNum` functions, for example, `minNum(NaN, 1) = minNum(1, NaN) = 1`. Some languages such as Java deviate from the standard implementing `minNum(NaN, 1) = minNum(1, NaN) = NaN`. However, `min` / `max` in `base` are even worse: `min` `NaN` 1 is 1, but `min` 1 `NaN` is `NaN`.

IEEE 754-2008 compliant `min` / `max` can be found in `ieee754` package under `minNum` / `maxNum` names. Implementations compliant with `minimumNumber` / `maximumNumber` from a newer IEEE 754-2019, section 9.6 are available from `fp-ieee` package.

Instance details Defined in GHC.Classes Methods compare :: Double -> Double -> Ordering Source # (<) :: Double -> Double -> Bool Source # (<=) :: Double -> Double -> Bool Source # (>) :: Double -> Double -> Bool Source # (>=) :: Double -> Double -> Bool Source # max :: Double -> Double -> Double Source # min :: Double -> Double -> Double Source #
Ord Float | See `instance` `Ord` `Double` for discussion of deviations from IEEE 754 standard.
Instance details Defined in GHC.Classes Methods compare :: Float -> Float -> Ordering Source # (<) :: Float -> Float -> Bool Source # (<=) :: Float -> Float -> Bool Source # (>) :: Float -> Float -> Bool Source # (>=) :: Float -> Float -> Bool Source # max :: Float -> Float -> Float Source # min :: Float -> Float -> Float Source #
Ord Int |
Instance details Defined in GHC.Classes Methods compare :: Int -> Int -> Ordering Source # (<) :: Int -> Int -> Bool Source # (<=) :: Int -> Int -> Bool Source # (>) :: Int -> Int -> Bool Source # (>=) :: Int -> Int -> Bool Source # max :: Int -> Int -> Int Source # min :: Int -> Int -> Int Source #
Ord Word |
Instance details Defined in GHC.Classes Methods compare :: Word -> Word -> Ordering Source # (<) :: Word -> Word -> Bool Source # (<=) :: Word -> Word -> Bool Source # (>) :: Word -> Word -> Bool Source # (>=) :: Word -> Word -> Bool Source # max :: Word -> Word -> Word Source # min :: Word -> Word -> Word Source #
Ord a => Ord (Delta a) Source # |
Instance details Defined in Game.LambdaHack.Common.Time Methods compare :: Delta a -> Delta a -> Ordering Source # (<) :: Delta a -> Delta a -> Bool Source # (<=) :: Delta a -> Delta a -> Bool Source # (>) :: Delta a -> Delta a -> Bool Source # (>=) :: Delta a -> Delta a -> Bool Source # max :: Delta a -> Delta a -> Delta a Source # min :: Delta a -> Delta a -> Delta a Source #
Ord a => Ord (Frequency a) Source # |

Instance details

Defined in Game.LambdaHack.Core.Frequency

Methods

compare :: Frequency a -> Frequency a -> Ordering Source #

(<) :: Frequency a -> Frequency a -> Bool Source #

(<=) :: Frequency a -> Frequency a -> Bool Source #

(>) :: Frequency a -> Frequency a -> Bool Source #

(>=) :: Frequency a -> Frequency a -> Bool Source #

max :: Frequency a -> Frequency a -> Frequency a Source #

min :: Frequency a -> Frequency a -> Frequency a Source #

Ord (ContentId c) Source # |

Instance details

Defined in Game.LambdaHack.Definition.DefsInternal

Methods

compare :: ContentId c -> ContentId c -> Ordering Source #

(<) :: ContentId c -> ContentId c -> Bool Source #

(<=) :: ContentId c -> ContentId c -> Bool Source #

(>) :: ContentId c -> ContentId c -> Bool Source #

(>=) :: ContentId c -> ContentId c -> Bool Source #

max :: ContentId c -> ContentId c -> ContentId c Source #

min :: ContentId c -> ContentId c -> ContentId c Source #

Ord (GroupName c) Source # |

Instance details

Defined in Game.LambdaHack.Definition.DefsInternal

Methods

compare :: GroupName c -> GroupName c -> Ordering Source #

(<) :: GroupName c -> GroupName c -> Bool Source #

(<=) :: GroupName c -> GroupName c -> Bool Source #

(>) :: GroupName c -> GroupName c -> Bool Source #

(>=) :: GroupName c -> GroupName c -> Bool Source #

max :: GroupName c -> GroupName c -> GroupName c Source #

min :: GroupName c -> GroupName c -> GroupName c Source #

Ord a => Ord (Blind a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods compare :: Blind a -> Blind a -> Ordering Source # (<) :: Blind a -> Blind a -> Bool Source # (<=) :: Blind a -> Blind a -> Bool Source # (>) :: Blind a -> Blind a -> Bool Source # (>=) :: Blind a -> Blind a -> Bool Source # max :: Blind a -> Blind a -> Blind a Source # min :: Blind a -> Blind a -> Blind a Source #
Ord a => Ord (Fixed a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods compare :: Fixed a -> Fixed a -> Ordering Source # (<) :: Fixed a -> Fixed a -> Bool Source # (<=) :: Fixed a -> Fixed a -> Bool Source # (>) :: Fixed a -> Fixed a -> Bool Source # (>=) :: Fixed a -> Fixed a -> Bool Source # max :: Fixed a -> Fixed a -> Fixed a Source # min :: Fixed a -> Fixed a -> Fixed a Source #
Ord a => Ord (Large a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods compare :: Large a -> Large a -> Ordering Source # (<) :: Large a -> Large a -> Bool Source # (<=) :: Large a -> Large a -> Bool Source # (>) :: Large a -> Large a -> Bool Source # (>=) :: Large a -> Large a -> Bool Source # max :: Large a -> Large a -> Large a Source # min :: Large a -> Large a -> Large a Source #
Ord a => Ord (Negative a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

compare :: Negative a -> Negative a -> Ordering Source #

(<) :: Negative a -> Negative a -> Bool Source #

(<=) :: Negative a -> Negative a -> Bool Source #

(>) :: Negative a -> Negative a -> Bool Source #

(>=) :: Negative a -> Negative a -> Bool Source #

max :: Negative a -> Negative a -> Negative a Source #

min :: Negative a -> Negative a -> Negative a Source #

Ord a => Ord (NonEmptyList a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

compare :: NonEmptyList a -> NonEmptyList a -> Ordering Source #

(<) :: NonEmptyList a -> NonEmptyList a -> Bool Source #

(<=) :: NonEmptyList a -> NonEmptyList a -> Bool Source #

(>) :: NonEmptyList a -> NonEmptyList a -> Bool Source #

(>=) :: NonEmptyList a -> NonEmptyList a -> Bool Source #

max :: NonEmptyList a -> NonEmptyList a -> NonEmptyList a Source #

min :: NonEmptyList a -> NonEmptyList a -> NonEmptyList a Source #

Ord a => Ord (NonNegative a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

compare :: NonNegative a -> NonNegative a -> Ordering Source #

(<) :: NonNegative a -> NonNegative a -> Bool Source #

(<=) :: NonNegative a -> NonNegative a -> Bool Source #

(>) :: NonNegative a -> NonNegative a -> Bool Source #

(>=) :: NonNegative a -> NonNegative a -> Bool Source #

max :: NonNegative a -> NonNegative a -> NonNegative a Source #

min :: NonNegative a -> NonNegative a -> NonNegative a Source #

Ord a => Ord (NonPositive a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

compare :: NonPositive a -> NonPositive a -> Ordering Source #

(<) :: NonPositive a -> NonPositive a -> Bool Source #

(<=) :: NonPositive a -> NonPositive a -> Bool Source #

(>) :: NonPositive a -> NonPositive a -> Bool Source #

(>=) :: NonPositive a -> NonPositive a -> Bool Source #

max :: NonPositive a -> NonPositive a -> NonPositive a Source #

min :: NonPositive a -> NonPositive a -> NonPositive a Source #

Ord a => Ord (NonZero a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

compare :: NonZero a -> NonZero a -> Ordering Source #

(<) :: NonZero a -> NonZero a -> Bool Source #

(<=) :: NonZero a -> NonZero a -> Bool Source #

(>) :: NonZero a -> NonZero a -> Bool Source #

(>=) :: NonZero a -> NonZero a -> Bool Source #

max :: NonZero a -> NonZero a -> NonZero a Source #

min :: NonZero a -> NonZero a -> NonZero a Source #

Ord a => Ord (OrderedList a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

compare :: OrderedList a -> OrderedList a -> Ordering Source #

(<) :: OrderedList a -> OrderedList a -> Bool Source #

(<=) :: OrderedList a -> OrderedList a -> Bool Source #

(>) :: OrderedList a -> OrderedList a -> Bool Source #

(>=) :: OrderedList a -> OrderedList a -> Bool Source #

max :: OrderedList a -> OrderedList a -> OrderedList a Source #

min :: OrderedList a -> OrderedList a -> OrderedList a Source #

Ord a => Ord (Positive a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

compare :: Positive a -> Positive a -> Ordering Source #

(<) :: Positive a -> Positive a -> Bool Source #

(<=) :: Positive a -> Positive a -> Bool Source #

(>) :: Positive a -> Positive a -> Bool Source #

(>=) :: Positive a -> Positive a -> Bool Source #

max :: Positive a -> Positive a -> Positive a Source #

min :: Positive a -> Positive a -> Positive a Source #

Ord a => Ord (Shrink2 a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

compare :: Shrink2 a -> Shrink2 a -> Ordering Source #

(<) :: Shrink2 a -> Shrink2 a -> Bool Source #

(<=) :: Shrink2 a -> Shrink2 a -> Bool Source #

(>) :: Shrink2 a -> Shrink2 a -> Bool Source #

(>=) :: Shrink2 a -> Shrink2 a -> Bool Source #

max :: Shrink2 a -> Shrink2 a -> Shrink2 a Source #

min :: Shrink2 a -> Shrink2 a -> Shrink2 a Source #

Ord a => Ord (Small a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods compare :: Small a -> Small a -> Ordering Source # (<) :: Small a -> Small a -> Bool Source # (<=) :: Small a -> Small a -> Bool Source # (>) :: Small a -> Small a -> Bool Source # (>=) :: Small a -> Small a -> Bool Source # max :: Small a -> Small a -> Small a Source # min :: Small a -> Small a -> Small a Source #
Ord a => Ord (SortedList a) |

Instance details

Defined in Test.QuickCheck.Modifiers

Methods

compare :: SortedList a -> SortedList a -> Ordering Source #

(<) :: SortedList a -> SortedList a -> Bool Source #

(<=) :: SortedList a -> SortedList a -> Bool Source #

(>) :: SortedList a -> SortedList a -> Bool Source #

(>=) :: SortedList a -> SortedList a -> Bool Source #

max :: SortedList a -> SortedList a -> SortedList a Source #

min :: SortedList a -> SortedList a -> SortedList a Source #

Ord v => Ord (KeyMap v) |
Instance details Defined in Data.Aeson.KeyMap Methods compare :: KeyMap v -> KeyMap v -> Ordering Source # (<) :: KeyMap v -> KeyMap v -> Bool Source # (<=) :: KeyMap v -> KeyMap v -> Bool Source # (>) :: KeyMap v -> KeyMap v -> Bool Source # (>=) :: KeyMap v -> KeyMap v -> Bool Source # max :: KeyMap v -> KeyMap v -> KeyMap v Source # min :: KeyMap v -> KeyMap v -> KeyMap v Source #
Ord (Async a) |
Instance details Defined in Control.Concurrent.Async.Internal Methods compare :: Async a -> Async a -> Ordering Source # (<) :: Async a -> Async a -> Bool Source # (<=) :: Async a -> Async a -> Bool Source # (>) :: Async a -> Async a -> Bool Source # (>=) :: Async a -> Async a -> Bool Source # max :: Async a -> Async a -> Async a Source # min :: Async a -> Async a -> Async a Source #
Ord a => Ord (First a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: First a -> First a -> Ordering Source # (<) :: First a -> First a -> Bool Source # (<=) :: First a -> First a -> Bool Source # (>) :: First a -> First a -> Bool Source # (>=) :: First a -> First a -> Bool Source # max :: First a -> First a -> First a Source # min :: First a -> First a -> First a Source #
Ord a => Ord (Last a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Last a -> Last a -> Ordering Source # (<) :: Last a -> Last a -> Bool Source # (<=) :: Last a -> Last a -> Bool Source # (>) :: Last a -> Last a -> Bool Source # (>=) :: Last a -> Last a -> Bool Source # max :: Last a -> Last a -> Last a Source # min :: Last a -> Last a -> Last a Source #
Ord a => Ord (Max a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Max a -> Max a -> Ordering Source # (<) :: Max a -> Max a -> Bool Source # (<=) :: Max a -> Max a -> Bool Source # (>) :: Max a -> Max a -> Bool Source # (>=) :: Max a -> Max a -> Bool Source # max :: Max a -> Max a -> Max a Source # min :: Max a -> Max a -> Max a Source #
Ord a => Ord (Min a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Min a -> Min a -> Ordering Source # (<) :: Min a -> Min a -> Bool Source # (<=) :: Min a -> Min a -> Bool Source # (>) :: Min a -> Min a -> Bool Source # (>=) :: Min a -> Min a -> Bool Source # max :: Min a -> Min a -> Min a Source # min :: Min a -> Min a -> Min a Source #
Ord m => Ord (WrappedMonoid m) | Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

compare :: WrappedMonoid m -> WrappedMonoid m -> Ordering Source #

(<) :: WrappedMonoid m -> WrappedMonoid m -> Bool Source #

(<=) :: WrappedMonoid m -> WrappedMonoid m -> Bool Source #

(>) :: WrappedMonoid m -> WrappedMonoid m -> Bool Source #

(>=) :: WrappedMonoid m -> WrappedMonoid m -> Bool Source #

max :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m Source #

min :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m Source #

Ord n => Ord (VarInt n) |
Instance details Defined in Data.Bytes.VarInt Methods compare :: VarInt n -> VarInt n -> Ordering Source # (<) :: VarInt n -> VarInt n -> Bool Source # (<=) :: VarInt n -> VarInt n -> Bool Source # (>) :: VarInt n -> VarInt n -> Bool Source # (>=) :: VarInt n -> VarInt n -> Bool Source # max :: VarInt n -> VarInt n -> VarInt n Source # min :: VarInt n -> VarInt n -> VarInt n Source #
Ord a => Ord (IntMap a) |
Instance details Defined in Data.IntMap.Internal Methods compare :: IntMap a -> IntMap a -> Ordering Source # (<) :: IntMap a -> IntMap a -> Bool Source # (<=) :: IntMap a -> IntMap a -> Bool Source # (>) :: IntMap a -> IntMap a -> Bool Source # (>=) :: IntMap a -> IntMap a -> Bool Source # max :: IntMap a -> IntMap a -> IntMap a Source # min :: IntMap a -> IntMap a -> IntMap a Source #
Ord a => Ord (Seq a) |
Instance details Defined in Data.Sequence.Internal Methods compare :: Seq a -> Seq a -> Ordering Source # (<) :: Seq a -> Seq a -> Bool Source # (<=) :: Seq a -> Seq a -> Bool Source # (>) :: Seq a -> Seq a -> Bool Source # (>=) :: Seq a -> Seq a -> Bool Source # max :: Seq a -> Seq a -> Seq a Source # min :: Seq a -> Seq a -> Seq a Source #
Ord a => Ord (ViewL a) |
Instance details Defined in Data.Sequence.Internal Methods compare :: ViewL a -> ViewL a -> Ordering Source # (<) :: ViewL a -> ViewL a -> Bool Source # (<=) :: ViewL a -> ViewL a -> Bool Source # (>) :: ViewL a -> ViewL a -> Bool Source # (>=) :: ViewL a -> ViewL a -> Bool Source # max :: ViewL a -> ViewL a -> ViewL a Source # min :: ViewL a -> ViewL a -> ViewL a Source #
Ord a => Ord (ViewR a) |
Instance details Defined in Data.Sequence.Internal Methods compare :: ViewR a -> ViewR a -> Ordering Source # (<) :: ViewR a -> ViewR a -> Bool Source # (<=) :: ViewR a -> ViewR a -> Bool Source # (>) :: ViewR a -> ViewR a -> Bool Source # (>=) :: ViewR a -> ViewR a -> Bool Source # max :: ViewR a -> ViewR a -> ViewR a Source # min :: ViewR a -> ViewR a -> ViewR a Source #
Ord a => Ord (Intersection a) |

Instance details

Defined in Data.Set.Internal

Methods

compare :: Intersection a -> Intersection a -> Ordering Source #

(<) :: Intersection a -> Intersection a -> Bool Source #

(<=) :: Intersection a -> Intersection a -> Bool Source #

(>) :: Intersection a -> Intersection a -> Bool Source #

(>=) :: Intersection a -> Intersection a -> Bool Source #

max :: Intersection a -> Intersection a -> Intersection a Source #

min :: Intersection a -> Intersection a -> Intersection a Source #

Ord a => Ord (Set a) |
Instance details Defined in Data.Set.Internal Methods compare :: Set a -> Set a -> Ordering Source # (<) :: Set a -> Set a -> Bool Source # (<=) :: Set a -> Set a -> Bool Source # (>) :: Set a -> Set a -> Bool Source # (>=) :: Set a -> Set a -> Bool Source # max :: Set a -> Set a -> Set a Source # min :: Set a -> Set a -> Set a Source #
Ord a => Ord (Tree a) | Since: containers-0.6.5
Instance details Defined in Data.Tree Methods compare :: Tree a -> Tree a -> Ordering Source # (<) :: Tree a -> Tree a -> Bool Source # (<=) :: Tree a -> Tree a -> Bool Source # (>) :: Tree a -> Tree a -> Bool Source # (>=) :: Tree a -> Tree a -> Bool Source # max :: Tree a -> Tree a -> Tree a Source # min :: Tree a -> Tree a -> Tree a Source #
Ord1 f => Ord (Fix f) |
Instance details Defined in Data.Fix Methods compare :: Fix f -> Fix f -> Ordering Source # (<) :: Fix f -> Fix f -> Bool Source # (<=) :: Fix f -> Fix f -> Bool Source # (>) :: Fix f -> Fix f -> Bool Source # (>=) :: Fix f -> Fix f -> Bool Source # max :: Fix f -> Fix f -> Fix f Source # min :: Fix f -> Fix f -> Fix f Source #
(Functor f, Ord1 f) => Ord (Mu f) |
Instance details Defined in Data.Fix Methods compare :: Mu f -> Mu f -> Ordering Source # (<) :: Mu f -> Mu f -> Bool Source # (<=) :: Mu f -> Mu f -> Bool Source # (>) :: Mu f -> Mu f -> Bool Source # (>=) :: Mu f -> Mu f -> Bool Source # max :: Mu f -> Mu f -> Mu f Source # min :: Mu f -> Mu f -> Mu f Source #
(Functor f, Ord1 f) => Ord (Nu f) |
Instance details Defined in Data.Fix Methods compare :: Nu f -> Nu f -> Ordering Source # (<) :: Nu f -> Nu f -> Bool Source # (<=) :: Nu f -> Nu f -> Bool Source # (>) :: Nu f -> Nu f -> Bool Source # (>=) :: Nu f -> Nu f -> Bool Source # max :: Nu f -> Nu f -> Nu f Source # min :: Nu f -> Nu f -> Nu f Source #
Ord a => Ord (DNonEmpty a) |

Instance details

Defined in Data.DList.DNonEmpty.Internal

Methods

compare :: DNonEmpty a -> DNonEmpty a -> Ordering Source #

(<) :: DNonEmpty a -> DNonEmpty a -> Bool Source #

(<=) :: DNonEmpty a -> DNonEmpty a -> Bool Source #

(>) :: DNonEmpty a -> DNonEmpty a -> Bool Source #

(>=) :: DNonEmpty a -> DNonEmpty a -> Bool Source #

max :: DNonEmpty a -> DNonEmpty a -> DNonEmpty a Source #

min :: DNonEmpty a -> DNonEmpty a -> DNonEmpty a Source #

Ord a => Ord (DList a) |
Instance details Defined in Data.DList.Internal Methods compare :: DList a -> DList a -> Ordering Source # (<) :: DList a -> DList a -> Bool Source # (<=) :: DList a -> DList a -> Bool Source # (>) :: DList a -> DList a -> Bool Source # (>=) :: DList a -> DList a -> Bool Source # max :: DList a -> DList a -> DList a Source # min :: DList a -> DList a -> DList a Source #
Ord (EnumSet k) |
Instance details Defined in Data.EnumSet Methods compare :: EnumSet k -> EnumSet k -> Ordering Source # (<) :: EnumSet k -> EnumSet k -> Bool Source # (<=) :: EnumSet k -> EnumSet k -> Bool Source # (>) :: EnumSet k -> EnumSet k -> Bool Source # (>=) :: EnumSet k -> EnumSet k -> Bool Source # max :: EnumSet k -> EnumSet k -> EnumSet k Source # min :: EnumSet k -> EnumSet k -> EnumSet k Source #
Ord a => Ord (NonEmpty a) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Base

Methods

compare :: NonEmpty a -> NonEmpty a -> Ordering Source #

(<) :: NonEmpty a -> NonEmpty a -> Bool Source #

(<=) :: NonEmpty a -> NonEmpty a -> Bool Source #

(>) :: NonEmpty a -> NonEmpty a -> Bool Source #

(>=) :: NonEmpty a -> NonEmpty a -> Bool Source #

max :: NonEmpty a -> NonEmpty a -> NonEmpty a Source #

min :: NonEmpty a -> NonEmpty a -> NonEmpty a Source #

Ord a => Ord (Identity a) | Since: base-4.8.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Identity

Methods

compare :: Identity a -> Identity a -> Ordering Source #

(<) :: Identity a -> Identity a -> Bool Source #

(<=) :: Identity a -> Identity a -> Bool Source #

(>) :: Identity a -> Identity a -> Bool Source #

(>=) :: Identity a -> Identity a -> Bool Source #

max :: Identity a -> Identity a -> Identity a Source #

min :: Identity a -> Identity a -> Identity a Source #

Ord a => Ord (First a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Monoid Methods compare :: First a -> First a -> Ordering Source # (<) :: First a -> First a -> Bool Source # (<=) :: First a -> First a -> Bool Source # (>) :: First a -> First a -> Bool Source # (>=) :: First a -> First a -> Bool Source # max :: First a -> First a -> First a Source # min :: First a -> First a -> First a Source #
Ord a => Ord (Last a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Monoid Methods compare :: Last a -> Last a -> Ordering Source # (<) :: Last a -> Last a -> Bool Source # (<=) :: Last a -> Last a -> Bool Source # (>) :: Last a -> Last a -> Bool Source # (>=) :: Last a -> Last a -> Bool Source # max :: Last a -> Last a -> Last a Source # min :: Last a -> Last a -> Last a Source #
Ord a => Ord (Down a) | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Data.Ord Methods compare :: Down a -> Down a -> Ordering Source # (<) :: Down a -> Down a -> Bool Source # (<=) :: Down a -> Down a -> Bool Source # (>) :: Down a -> Down a -> Bool Source # (>=) :: Down a -> Down a -> Bool Source # max :: Down a -> Down a -> Down a Source # min :: Down a -> Down a -> Down a Source #
Ord a => Ord (Dual a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods compare :: Dual a -> Dual a -> Ordering Source # (<) :: Dual a -> Dual a -> Bool Source # (<=) :: Dual a -> Dual a -> Bool Source # (>) :: Dual a -> Dual a -> Bool Source # (>=) :: Dual a -> Dual a -> Bool Source # max :: Dual a -> Dual a -> Dual a Source # min :: Dual a -> Dual a -> Dual a Source #
Ord a => Ord (Product a) | Since: base-2.1

Instance details

Defined in GHC.Internal.Data.Semigroup.Internal

Methods

compare :: Product a -> Product a -> Ordering Source #

(<) :: Product a -> Product a -> Bool Source #

(<=) :: Product a -> Product a -> Bool Source #

(>) :: Product a -> Product a -> Bool Source #

(>=) :: Product a -> Product a -> Bool Source #

max :: Product a -> Product a -> Product a Source #

min :: Product a -> Product a -> Product a Source #

Ord a => Ord (Sum a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods compare :: Sum a -> Sum a -> Ordering Source # (<) :: Sum a -> Sum a -> Bool Source # (<=) :: Sum a -> Sum a -> Bool Source # (>) :: Sum a -> Sum a -> Bool Source # (>=) :: Sum a -> Sum a -> Bool Source # max :: Sum a -> Sum a -> Sum a Source # min :: Sum a -> Sum a -> Sum a Source #
Ord (ForeignPtr a) | Since: base-2.1

Instance details

Defined in GHC.Internal.ForeignPtr

Methods

compare :: ForeignPtr a -> ForeignPtr a -> Ordering Source #

(<) :: ForeignPtr a -> ForeignPtr a -> Bool Source #

(<=) :: ForeignPtr a -> ForeignPtr a -> Bool Source #

(>) :: ForeignPtr a -> ForeignPtr a -> Bool Source #

(>=) :: ForeignPtr a -> ForeignPtr a -> Bool Source #

max :: ForeignPtr a -> ForeignPtr a -> ForeignPtr a Source #

min :: ForeignPtr a -> ForeignPtr a -> ForeignPtr a Source #

Ord a => Ord (ZipList a) | Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Functor.ZipList

Methods

compare :: ZipList a -> ZipList a -> Ordering Source #

(<) :: ZipList a -> ZipList a -> Bool Source #

(<=) :: ZipList a -> ZipList a -> Bool Source #

(>) :: ZipList a -> ZipList a -> Bool Source #

(>=) :: ZipList a -> ZipList a -> Bool Source #

max :: ZipList a -> ZipList a -> ZipList a Source #

min :: ZipList a -> ZipList a -> ZipList a Source #

Ord p => Ord (Par1 p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods compare :: Par1 p -> Par1 p -> Ordering Source # (<) :: Par1 p -> Par1 p -> Bool Source # (<=) :: Par1 p -> Par1 p -> Bool Source # (>) :: Par1 p -> Par1 p -> Bool Source # (>=) :: Par1 p -> Par1 p -> Bool Source # max :: Par1 p -> Par1 p -> Par1 p Source # min :: Par1 p -> Par1 p -> Par1 p Source #
Ord (FunPtr a) |
Instance details Defined in GHC.Internal.Ptr Methods compare :: FunPtr a -> FunPtr a -> Ordering Source # (<) :: FunPtr a -> FunPtr a -> Bool Source # (<=) :: FunPtr a -> FunPtr a -> Bool Source # (>) :: FunPtr a -> FunPtr a -> Bool Source # (>=) :: FunPtr a -> FunPtr a -> Bool Source # max :: FunPtr a -> FunPtr a -> FunPtr a Source # min :: FunPtr a -> FunPtr a -> FunPtr a Source #
Ord (Ptr a) | Since: base-2.1
Instance details Defined in GHC.Internal.Ptr Methods compare :: Ptr a -> Ptr a -> Ordering Source # (<) :: Ptr a -> Ptr a -> Bool Source # (<=) :: Ptr a -> Ptr a -> Bool Source # (>) :: Ptr a -> Ptr a -> Bool Source # (>=) :: Ptr a -> Ptr a -> Bool Source # max :: Ptr a -> Ptr a -> Ptr a Source # min :: Ptr a -> Ptr a -> Ptr a Source #
Integral a => Ord (Ratio a) | Since: base-2.0.1
Instance details Defined in GHC.Internal.Real Methods compare :: Ratio a -> Ratio a -> Ordering Source # (<) :: Ratio a -> Ratio a -> Bool Source # (<=) :: Ratio a -> Ratio a -> Bool Source # (>) :: Ratio a -> Ratio a -> Bool Source # (>=) :: Ratio a -> Ratio a -> Bool Source # max :: Ratio a -> Ratio a -> Ratio a Source # min :: Ratio a -> Ratio a -> Ratio a Source #
Ord (SNat n) | Since: base-4.19.0.0
Instance details Defined in GHC.Internal.TypeNats Methods compare :: SNat n -> SNat n -> Ordering Source # (<) :: SNat n -> SNat n -> Bool Source # (<=) :: SNat n -> SNat n -> Bool Source # (>) :: SNat n -> SNat n -> Bool Source # (>=) :: SNat n -> SNat n -> Bool Source # max :: SNat n -> SNat n -> SNat n Source # min :: SNat n -> SNat n -> SNat n Source #
Ord a => Ord (Hashed a) |
Instance details Defined in Data.Hashable.Class Methods compare :: Hashed a -> Hashed a -> Ordering Source # (<) :: Hashed a -> Hashed a -> Bool Source # (<=) :: Hashed a -> Hashed a -> Bool Source # (>) :: Hashed a -> Hashed a -> Bool Source # (>=) :: Hashed a -> Hashed a -> Bool Source # max :: Hashed a -> Hashed a -> Hashed a Source # min :: Hashed a -> Hashed a -> Hashed a Source #
Ord a => Ord (Plucker a) |
Instance details Defined in Linear.Plucker Methods compare :: Plucker a -> Plucker a -> Ordering Source # (<) :: Plucker a -> Plucker a -> Bool Source # (<=) :: Plucker a -> Plucker a -> Bool Source # (>) :: Plucker a -> Plucker a -> Bool Source # (>=) :: Plucker a -> Plucker a -> Bool Source # max :: Plucker a -> Plucker a -> Plucker a Source # min :: Plucker a -> Plucker a -> Plucker a Source #
Ord a => Ord (Quaternion a) |

Instance details

Defined in Linear.Quaternion

Methods

compare :: Quaternion a -> Quaternion a -> Ordering Source #

(<) :: Quaternion a -> Quaternion a -> Bool Source #

(<=) :: Quaternion a -> Quaternion a -> Bool Source #

(>) :: Quaternion a -> Quaternion a -> Bool Source #

(>=) :: Quaternion a -> Quaternion a -> Bool Source #

max :: Quaternion a -> Quaternion a -> Quaternion a Source #

min :: Quaternion a -> Quaternion a -> Quaternion a Source #

Ord (V0 a) |
Instance details Defined in Linear.V0 Methods compare :: V0 a -> V0 a -> Ordering Source # (<) :: V0 a -> V0 a -> Bool Source # (<=) :: V0 a -> V0 a -> Bool Source # (>) :: V0 a -> V0 a -> Bool Source # (>=) :: V0 a -> V0 a -> Bool Source # max :: V0 a -> V0 a -> V0 a Source # min :: V0 a -> V0 a -> V0 a Source #
Ord a => Ord (V1 a) |
Instance details Defined in Linear.V1 Methods compare :: V1 a -> V1 a -> Ordering Source # (<) :: V1 a -> V1 a -> Bool Source # (<=) :: V1 a -> V1 a -> Bool Source # (>) :: V1 a -> V1 a -> Bool Source # (>=) :: V1 a -> V1 a -> Bool Source # max :: V1 a -> V1 a -> V1 a Source # min :: V1 a -> V1 a -> V1 a Source #
Ord a => Ord (V2 a) |
Instance details Defined in Linear.V2 Methods compare :: V2 a -> V2 a -> Ordering Source # (<) :: V2 a -> V2 a -> Bool Source # (<=) :: V2 a -> V2 a -> Bool Source # (>) :: V2 a -> V2 a -> Bool Source # (>=) :: V2 a -> V2 a -> Bool Source # max :: V2 a -> V2 a -> V2 a Source # min :: V2 a -> V2 a -> V2 a Source #
Ord a => Ord (V3 a) |
Instance details Defined in Linear.V3 Methods compare :: V3 a -> V3 a -> Ordering Source # (<) :: V3 a -> V3 a -> Bool Source # (<=) :: V3 a -> V3 a -> Bool Source # (>) :: V3 a -> V3 a -> Bool Source # (>=) :: V3 a -> V3 a -> Bool Source # max :: V3 a -> V3 a -> V3 a Source # min :: V3 a -> V3 a -> V3 a Source #
Ord a => Ord (V4 a) |
Instance details Defined in Linear.V4 Methods compare :: V4 a -> V4 a -> Ordering Source # (<) :: V4 a -> V4 a -> Bool Source # (<=) :: V4 a -> V4 a -> Bool Source # (>) :: V4 a -> V4 a -> Bool Source # (>=) :: V4 a -> V4 a -> Bool Source # max :: V4 a -> V4 a -> V4 a Source # min :: V4 a -> V4 a -> V4 a Source #
Ord ann => Ord (SimpleDocStream ann) |

Instance details

Defined in Prettyprinter.Internal

Methods

compare :: SimpleDocStream ann -> SimpleDocStream ann -> Ordering Source #

(<) :: SimpleDocStream ann -> SimpleDocStream ann -> Bool Source #

(<=) :: SimpleDocStream ann -> SimpleDocStream ann -> Bool Source #

(>) :: SimpleDocStream ann -> SimpleDocStream ann -> Bool Source #

(>=) :: SimpleDocStream ann -> SimpleDocStream ann -> Bool Source #

max :: SimpleDocStream ann -> SimpleDocStream ann -> SimpleDocStream ann Source #

min :: SimpleDocStream ann -> SimpleDocStream ann -> SimpleDocStream ann Source #

Ord a => Ord (Array a) | Lexicographic ordering. Subject to change between major versions.
Instance details Defined in Data.Primitive.Array Methods compare :: Array a -> Array a -> Ordering Source # (<) :: Array a -> Array a -> Bool Source # (<=) :: Array a -> Array a -> Bool Source # (>) :: Array a -> Array a -> Bool Source # (>=) :: Array a -> Array a -> Bool Source # max :: Array a -> Array a -> Array a Source # min :: Array a -> Array a -> Array a Source #
(Ord a, Prim a) => Ord (PrimArray a) | Lexicographic ordering. Subject to change between major versions. Since: primitive-0.6.4.0

Instance details

Defined in Data.Primitive.PrimArray

Methods

compare :: PrimArray a -> PrimArray a -> Ordering Source #

(<) :: PrimArray a -> PrimArray a -> Bool Source #

(<=) :: PrimArray a -> PrimArray a -> Bool Source #

(>) :: PrimArray a -> PrimArray a -> Bool Source #

(>=) :: PrimArray a -> PrimArray a -> Bool Source #

max :: PrimArray a -> PrimArray a -> PrimArray a Source #

min :: PrimArray a -> PrimArray a -> PrimArray a Source #

Ord a => Ord (SmallArray a) | Lexicographic ordering. Subject to change between major versions.

Instance details

Defined in Data.Primitive.SmallArray

Methods

compare :: SmallArray a -> SmallArray a -> Ordering Source #

(<) :: SmallArray a -> SmallArray a -> Bool Source #

(<=) :: SmallArray a -> SmallArray a -> Bool Source #

(>) :: SmallArray a -> SmallArray a -> Bool Source #

(>=) :: SmallArray a -> SmallArray a -> Bool Source #

max :: SmallArray a -> SmallArray a -> SmallArray a Source #

min :: SmallArray a -> SmallArray a -> SmallArray a Source #

Ord g => Ord (StateGen g) |

Instance details

Defined in System.Random.Internal

Methods

compare :: StateGen g -> StateGen g -> Ordering Source #

(<) :: StateGen g -> StateGen g -> Bool Source #

(<=) :: StateGen g -> StateGen g -> Bool Source #

(>) :: StateGen g -> StateGen g -> Bool Source #

(>=) :: StateGen g -> StateGen g -> Bool Source #

max :: StateGen g -> StateGen g -> StateGen g Source #

min :: StateGen g -> StateGen g -> StateGen g Source #

Ord g => Ord (AtomicGen g) |

Instance details

Defined in System.Random.Stateful

Methods

compare :: AtomicGen g -> AtomicGen g -> Ordering Source #

(<) :: AtomicGen g -> AtomicGen g -> Bool Source #

(<=) :: AtomicGen g -> AtomicGen g -> Bool Source #

(>) :: AtomicGen g -> AtomicGen g -> Bool Source #

(>=) :: AtomicGen g -> AtomicGen g -> Bool Source #

max :: AtomicGen g -> AtomicGen g -> AtomicGen g Source #

min :: AtomicGen g -> AtomicGen g -> AtomicGen g Source #

Ord g => Ord (IOGen g) |
Instance details Defined in System.Random.Stateful Methods compare :: IOGen g -> IOGen g -> Ordering Source # (<) :: IOGen g -> IOGen g -> Bool Source # (<=) :: IOGen g -> IOGen g -> Bool Source # (>) :: IOGen g -> IOGen g -> Bool Source # (>=) :: IOGen g -> IOGen g -> Bool Source # max :: IOGen g -> IOGen g -> IOGen g Source # min :: IOGen g -> IOGen g -> IOGen g Source #
Ord g => Ord (STGen g) |
Instance details Defined in System.Random.Stateful Methods compare :: STGen g -> STGen g -> Ordering Source # (<) :: STGen g -> STGen g -> Bool Source # (<=) :: STGen g -> STGen g -> Bool Source # (>) :: STGen g -> STGen g -> Bool Source # (>=) :: STGen g -> STGen g -> Bool Source # max :: STGen g -> STGen g -> STGen g Source # min :: STGen g -> STGen g -> STGen g Source #
Ord g => Ord (TGen g) |
Instance details Defined in System.Random.Stateful Methods compare :: TGen g -> TGen g -> Ordering Source # (<) :: TGen g -> TGen g -> Bool Source # (<=) :: TGen g -> TGen g -> Bool Source # (>) :: TGen g -> TGen g -> Bool Source # (>=) :: TGen g -> TGen g -> Bool Source # max :: TGen g -> TGen g -> TGen g Source # min :: TGen g -> TGen g -> TGen g Source #
Ord (AudioFormat sampleType) |

Instance details

Defined in SDL.Audio

Methods

compare :: AudioFormat sampleType -> AudioFormat sampleType -> Ordering Source #

(<) :: AudioFormat sampleType -> AudioFormat sampleType -> Bool Source #

(<=) :: AudioFormat sampleType -> AudioFormat sampleType -> Bool Source #

(>) :: AudioFormat sampleType -> AudioFormat sampleType -> Bool Source #

(>=) :: AudioFormat sampleType -> AudioFormat sampleType -> Bool Source #

max :: AudioFormat sampleType -> AudioFormat sampleType -> AudioFormat sampleType Source #

min :: AudioFormat sampleType -> AudioFormat sampleType -> AudioFormat sampleType Source #

Ord a => Ord (V2 a) |
Instance details Defined in SDL.Internal.Vect Methods compare :: V2 a -> V2 a -> Ordering Source # (<) :: V2 a -> V2 a -> Bool Source # (<=) :: V2 a -> V2 a -> Bool Source # (>) :: V2 a -> V2 a -> Bool Source # (>=) :: V2 a -> V2 a -> Bool Source # max :: V2 a -> V2 a -> V2 a Source # min :: V2 a -> V2 a -> V2 a Source #
Ord a => Ord (V3 a) |
Instance details Defined in SDL.Internal.Vect Methods compare :: V3 a -> V3 a -> Ordering Source # (<) :: V3 a -> V3 a -> Bool Source # (<=) :: V3 a -> V3 a -> Bool Source # (>) :: V3 a -> V3 a -> Bool Source # (>=) :: V3 a -> V3 a -> Bool Source # max :: V3 a -> V3 a -> V3 a Source # min :: V3 a -> V3 a -> V3 a Source #
Ord a => Ord (V4 a) |
Instance details Defined in SDL.Internal.Vect Methods compare :: V4 a -> V4 a -> Ordering Source # (<) :: V4 a -> V4 a -> Bool Source # (<=) :: V4 a -> V4 a -> Bool Source # (>) :: V4 a -> V4 a -> Bool Source # (>=) :: V4 a -> V4 a -> Bool Source # max :: V4 a -> V4 a -> V4 a Source # min :: V4 a -> V4 a -> V4 a Source #
Ord a => Ord (Rectangle a) |

Instance details

Defined in SDL.Video.Renderer

Methods

compare :: Rectangle a -> Rectangle a -> Ordering Source #

(<) :: Rectangle a -> Rectangle a -> Bool Source #

(<=) :: Rectangle a -> Rectangle a -> Bool Source #

(>) :: Rectangle a -> Rectangle a -> Bool Source #

(>=) :: Rectangle a -> Rectangle a -> Bool Source #

max :: Rectangle a -> Rectangle a -> Rectangle a Source #

min :: Rectangle a -> Rectangle a -> Rectangle a Source #

Ord a => Ord (Maybe a) |
Instance details Defined in Data.Strict.Maybe Methods compare :: Maybe a -> Maybe a -> Ordering Source # (<) :: Maybe a -> Maybe a -> Bool Source # (<=) :: Maybe a -> Maybe a -> Bool Source # (>) :: Maybe a -> Maybe a -> Bool Source # (>=) :: Maybe a -> Maybe a -> Bool Source # max :: Maybe a -> Maybe a -> Maybe a Source # min :: Maybe a -> Maybe a -> Maybe a Source #
Ord flag => Ord (TyVarBndr flag) |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: TyVarBndr flag -> TyVarBndr flag -> Ordering Source #

(<) :: TyVarBndr flag -> TyVarBndr flag -> Bool Source #

(<=) :: TyVarBndr flag -> TyVarBndr flag -> Bool Source #

(>) :: TyVarBndr flag -> TyVarBndr flag -> Bool Source #

(>=) :: TyVarBndr flag -> TyVarBndr flag -> Bool Source #

max :: TyVarBndr flag -> TyVarBndr flag -> TyVarBndr flag Source #

min :: TyVarBndr flag -> TyVarBndr flag -> TyVarBndr flag Source #

Ord a => Ord (Stream a) |
Instance details Defined in Data.Text.Internal.Fusion.Types Methods compare :: Stream a -> Stream a -> Ordering Source # (<) :: Stream a -> Stream a -> Bool Source # (<=) :: Stream a -> Stream a -> Bool Source # (>) :: Stream a -> Stream a -> Bool Source # (>=) :: Stream a -> Stream a -> Bool Source # max :: Stream a -> Stream a -> Stream a Source # min :: Stream a -> Stream a -> Stream a Source #
Ord a => Ord (HashSet a) |

Instance details

Defined in Data.HashSet.Internal

Methods

compare :: HashSet a -> HashSet a -> Ordering Source #

(<) :: HashSet a -> HashSet a -> Bool Source #

(<=) :: HashSet a -> HashSet a -> Bool Source #

(>) :: HashSet a -> HashSet a -> Bool Source #

(>=) :: HashSet a -> HashSet a -> Bool Source #

max :: HashSet a -> HashSet a -> HashSet a Source #

min :: HashSet a -> HashSet a -> HashSet a Source #

Ord a => Ord (Vector a) |
Instance details Defined in Data.Vector Methods compare :: Vector a -> Vector a -> Ordering Source # (<) :: Vector a -> Vector a -> Bool Source # (<=) :: Vector a -> Vector a -> Bool Source # (>) :: Vector a -> Vector a -> Bool Source # (>=) :: Vector a -> Vector a -> Bool Source # max :: Vector a -> Vector a -> Vector a Source # min :: Vector a -> Vector a -> Vector a Source #
(Prim a, Ord a) => Ord (Vector a) |
Instance details Defined in Data.Vector.Primitive Methods compare :: Vector a -> Vector a -> Ordering Source # (<) :: Vector a -> Vector a -> Bool Source # (<=) :: Vector a -> Vector a -> Bool Source # (>) :: Vector a -> Vector a -> Bool Source # (>=) :: Vector a -> Vector a -> Bool Source # max :: Vector a -> Vector a -> Vector a Source # min :: Vector a -> Vector a -> Vector a Source #
(Storable a, Ord a) => Ord (Vector a) |
Instance details Defined in Data.Vector.Storable Methods compare :: Vector a -> Vector a -> Ordering Source # (<) :: Vector a -> Vector a -> Bool Source # (<=) :: Vector a -> Vector a -> Bool Source # (>) :: Vector a -> Vector a -> Bool Source # (>=) :: Vector a -> Vector a -> Bool Source # max :: Vector a -> Vector a -> Vector a Source # min :: Vector a -> Vector a -> Vector a Source #
Ord a => Ord (Vector a) |
Instance details Defined in Data.Vector.Strict Methods compare :: Vector a -> Vector a -> Ordering Source # (<) :: Vector a -> Vector a -> Bool Source # (<=) :: Vector a -> Vector a -> Bool Source # (>) :: Vector a -> Vector a -> Bool Source # (>=) :: Vector a -> Vector a -> Bool Source # max :: Vector a -> Vector a -> Vector a Source # min :: Vector a -> Vector a -> Vector a Source #
(Unbox a, Ord a) => Ord (Vector a) |
Instance details Defined in Data.Vector.Unboxed Methods compare :: Vector a -> Vector a -> Ordering Source # (<) :: Vector a -> Vector a -> Bool Source # (<=) :: Vector a -> Vector a -> Bool Source # (>) :: Vector a -> Vector a -> Bool Source # (>=) :: Vector a -> Vector a -> Bool Source # max :: Vector a -> Vector a -> Vector a Source # min :: Vector a -> Vector a -> Vector a Source #
Ord a => Ord (Maybe a) | Since: base-2.1
Instance details Defined in GHC.Internal.Maybe Methods compare :: Maybe a -> Maybe a -> Ordering Source # (<) :: Maybe a -> Maybe a -> Bool Source # (<=) :: Maybe a -> Maybe a -> Bool Source # (>) :: Maybe a -> Maybe a -> Bool Source # (>=) :: Maybe a -> Maybe a -> Bool Source # max :: Maybe a -> Maybe a -> Maybe a Source # min :: Maybe a -> Maybe a -> Maybe a Source #
Ord a => Ord (Solo a) |
Instance details Defined in GHC.Classes Methods compare :: Solo a -> Solo a -> Ordering Source # (<) :: Solo a -> Solo a -> Bool Source # (<=) :: Solo a -> Solo a -> Bool Source # (>) :: Solo a -> Solo a -> Bool Source # (>=) :: Solo a -> Solo a -> Bool Source # max :: Solo a -> Solo a -> Solo a Source # min :: Solo a -> Solo a -> Solo a Source #
Ord a => Ord [a] |
Instance details Defined in GHC.Classes Methods compare :: [a] -> [a] -> Ordering Source # (<) :: [a] -> [a] -> Bool Source # (<=) :: [a] -> [a] -> Bool Source # (>) :: [a] -> [a] -> Bool Source # (>=) :: [a] -> [a] -> Bool Source # max :: [a] -> [a] -> [a] Source # min :: [a] -> [a] -> [a] Source #
Ord (Fixed a) | Since: base-2.1
Instance details Defined in Data.Fixed Methods compare :: Fixed a -> Fixed a -> Ordering Source # (<) :: Fixed a -> Fixed a -> Bool Source # (<=) :: Fixed a -> Fixed a -> Bool Source # (>) :: Fixed a -> Fixed a -> Bool Source # (>=) :: Fixed a -> Fixed a -> Bool Source # max :: Fixed a -> Fixed a -> Fixed a Source # min :: Fixed a -> Fixed a -> Fixed a Source #
Ord a => Ord (Arg a b) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Arg a b -> Arg a b -> Ordering Source # (<) :: Arg a b -> Arg a b -> Bool Source # (<=) :: Arg a b -> Arg a b -> Bool Source # (>) :: Arg a b -> Arg a b -> Bool Source # (>=) :: Arg a b -> Arg a b -> Bool Source # max :: Arg a b -> Arg a b -> Arg a b Source # min :: Arg a b -> Arg a b -> Arg a b Source #
(Ord k, Ord v) => Ord (Map k v) |
Instance details Defined in Data.Map.Internal Methods compare :: Map k v -> Map k v -> Ordering Source # (<) :: Map k v -> Map k v -> Bool Source # (<=) :: Map k v -> Map k v -> Bool Source # (>) :: Map k v -> Map k v -> Bool Source # (>=) :: Map k v -> Map k v -> Bool Source # max :: Map k v -> Map k v -> Map k v Source # min :: Map k v -> Map k v -> Map k v Source #
Ord a => Ord (EnumMap k a) |

Instance details

Defined in Data.EnumMap.Base

Methods

compare :: EnumMap k a -> EnumMap k a -> Ordering Source #

(<) :: EnumMap k a -> EnumMap k a -> Bool Source #

(<=) :: EnumMap k a -> EnumMap k a -> Bool Source #

(>) :: EnumMap k a -> EnumMap k a -> Bool Source #

(>=) :: EnumMap k a -> EnumMap k a -> Bool Source #

max :: EnumMap k a -> EnumMap k a -> EnumMap k a Source #

min :: EnumMap k a -> EnumMap k a -> EnumMap k a Source #

(Ord1 f, Ord a) => Ord (Cofree f a) |

Instance details

Defined in Control.Comonad.Cofree

Methods

compare :: Cofree f a -> Cofree f a -> Ordering Source #

(<) :: Cofree f a -> Cofree f a -> Bool Source #

(<=) :: Cofree f a -> Cofree f a -> Bool Source #

(>) :: Cofree f a -> Cofree f a -> Bool Source #

(>=) :: Cofree f a -> Cofree f a -> Bool Source #

max :: Cofree f a -> Cofree f a -> Cofree f a Source #

min :: Cofree f a -> Cofree f a -> Cofree f a Source #

(Ord1 f, Ord a) => Ord (Free f a) |
Instance details Defined in Control.Monad.Free Methods compare :: Free f a -> Free f a -> Ordering Source # (<) :: Free f a -> Free f a -> Bool Source # (<=) :: Free f a -> Free f a -> Bool Source # (>) :: Free f a -> Free f a -> Bool Source # (>=) :: Free f a -> Free f a -> Bool Source # max :: Free f a -> Free f a -> Free f a Source # min :: Free f a -> Free f a -> Free f a Source #
(Ord a, Ord b) => Ord (Either a b) | Since: base-2.1

Instance details

Defined in GHC.Internal.Data.Either

Methods

compare :: Either a b -> Either a b -> Ordering Source #

(<) :: Either a b -> Either a b -> Bool Source #

(<=) :: Either a b -> Either a b -> Bool Source #

(>) :: Either a b -> Either a b -> Bool Source #

(>=) :: Either a b -> Either a b -> Bool Source #

max :: Either a b -> Either a b -> Either a b Source #

min :: Either a b -> Either a b -> Either a b Source #

Ord (TypeRep a) | Since: base-4.4.0.0

Instance details

Defined in GHC.Internal.Data.Typeable.Internal

Methods

compare :: TypeRep a -> TypeRep a -> Ordering Source #

(<) :: TypeRep a -> TypeRep a -> Bool Source #

(<=) :: TypeRep a -> TypeRep a -> Bool Source #

(>) :: TypeRep a -> TypeRep a -> Bool Source #

(>=) :: TypeRep a -> TypeRep a -> Bool Source #

max :: TypeRep a -> TypeRep a -> TypeRep a Source #

min :: TypeRep a -> TypeRep a -> TypeRep a Source #

Ord (U1 p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods compare :: U1 p -> U1 p -> Ordering Source # (<) :: U1 p -> U1 p -> Bool Source # (<=) :: U1 p -> U1 p -> Bool Source # (>) :: U1 p -> U1 p -> Bool Source # (>=) :: U1 p -> U1 p -> Bool Source # max :: U1 p -> U1 p -> U1 p Source # min :: U1 p -> U1 p -> U1 p Source #
Ord (V1 p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods compare :: V1 p -> V1 p -> Ordering Source # (<) :: V1 p -> V1 p -> Bool Source # (<=) :: V1 p -> V1 p -> Bool Source # (>) :: V1 p -> V1 p -> Bool Source # (>=) :: V1 p -> V1 p -> Bool Source # max :: V1 p -> V1 p -> V1 p Source # min :: V1 p -> V1 p -> V1 p Source #
(Ord1 f, Ord a) => Ord (Yoneda f a) |

Instance details

Defined in Data.Functor.Yoneda

Methods

compare :: Yoneda f a -> Yoneda f a -> Ordering Source #

(<) :: Yoneda f a -> Yoneda f a -> Bool Source #

(<=) :: Yoneda f a -> Yoneda f a -> Bool Source #

(>) :: Yoneda f a -> Yoneda f a -> Bool Source #

(>=) :: Yoneda f a -> Yoneda f a -> Bool Source #

max :: Yoneda f a -> Yoneda f a -> Yoneda f a Source #

min :: Yoneda f a -> Yoneda f a -> Yoneda f a Source #

Ord (f a) => Ord (Point f a) |
Instance details Defined in Linear.Affine Methods compare :: Point f a -> Point f a -> Ordering Source # (<) :: Point f a -> Point f a -> Bool Source # (<=) :: Point f a -> Point f a -> Bool Source # (>) :: Point f a -> Point f a -> Bool Source # (>=) :: Point f a -> Point f a -> Bool Source # max :: Point f a -> Point f a -> Point f a Source # min :: Point f a -> Point f a -> Point f a Source #
Ord (f a) => Ord (Point f a) |

Instance details

Defined in SDL.Internal.Vect

Methods

compare :: Point f a -> Point f a -> Ordering Source #

(<) :: Point f a -> Point f a -> Bool Source #

(<=) :: Point f a -> Point f a -> Bool Source #

(>) :: Point f a -> Point f a -> Bool Source #

(>=) :: Point f a -> Point f a -> Bool Source #

max :: Point f a -> Point f a -> Point f a Source #

min :: Point f a -> Point f a -> Point f a Source #

(Ord a, Ord b) => Ord (Either a b) |

Instance details

Defined in Data.Strict.Either

Methods

compare :: Either a b -> Either a b -> Ordering Source #

(<) :: Either a b -> Either a b -> Bool Source #

(<=) :: Either a b -> Either a b -> Bool Source #

(>) :: Either a b -> Either a b -> Bool Source #

(>=) :: Either a b -> Either a b -> Bool Source #

max :: Either a b -> Either a b -> Either a b Source #

min :: Either a b -> Either a b -> Either a b Source #

(Ord a, Ord b) => Ord (These a b) |

Instance details

Defined in Data.Strict.These

Methods

compare :: These a b -> These a b -> Ordering Source #

(<) :: These a b -> These a b -> Bool Source #

(<=) :: These a b -> These a b -> Bool Source #

(>) :: These a b -> These a b -> Bool Source #

(>=) :: These a b -> These a b -> Bool Source #

max :: These a b -> These a b -> These a b Source #

min :: These a b -> These a b -> These a b Source #

(Ord a, Ord b) => Ord (Pair a b) |
Instance details Defined in Data.Strict.Tuple Methods compare :: Pair a b -> Pair a b -> Ordering Source # (<) :: Pair a b -> Pair a b -> Bool Source # (<=) :: Pair a b -> Pair a b -> Bool Source # (>) :: Pair a b -> Pair a b -> Bool Source # (>=) :: Pair a b -> Pair a b -> Bool Source # max :: Pair a b -> Pair a b -> Pair a b Source # min :: Pair a b -> Pair a b -> Pair a b Source #
(Ord a, Ord b) => Ord (These a b) |
Instance details Defined in Data.These Methods compare :: These a b -> These a b -> Ordering Source # (<) :: These a b -> These a b -> Bool Source # (<=) :: These a b -> These a b -> Bool Source # (>) :: These a b -> These a b -> Bool Source # (>=) :: These a b -> These a b -> Bool Source # max :: These a b -> These a b -> These a b Source # min :: These a b -> These a b -> These a b Source #
(Ord1 f, Ord a) => Ord (Lift f a) |
Instance details Defined in Control.Applicative.Lift Methods compare :: Lift f a -> Lift f a -> Ordering Source # (<) :: Lift f a -> Lift f a -> Bool Source # (<=) :: Lift f a -> Lift f a -> Bool Source # (>) :: Lift f a -> Lift f a -> Bool Source # (>=) :: Lift f a -> Lift f a -> Bool Source # max :: Lift f a -> Lift f a -> Lift f a Source # min :: Lift f a -> Lift f a -> Lift f a Source #
(Ord1 m, Ord a) => Ord (MaybeT m a) |

Instance details

Defined in Control.Monad.Trans.Maybe

Methods

compare :: MaybeT m a -> MaybeT m a -> Ordering Source #

(<) :: MaybeT m a -> MaybeT m a -> Bool Source #

(<=) :: MaybeT m a -> MaybeT m a -> Bool Source #

(>) :: MaybeT m a -> MaybeT m a -> Bool Source #

(>=) :: MaybeT m a -> MaybeT m a -> Bool Source #

max :: MaybeT m a -> MaybeT m a -> MaybeT m a Source #

min :: MaybeT m a -> MaybeT m a -> MaybeT m a Source #

(Ord k, Ord v) => Ord (HashMap k v) | The ordering is total and consistent with the `Eq` instance. However, nothing else about the ordering is specified, and it may change from version to version of either this package or of `hashable`.

Instance details

Defined in Data.HashMap.Internal

Methods

compare :: HashMap k v -> HashMap k v -> Ordering Source #

(<) :: HashMap k v -> HashMap k v -> Bool Source #

(<=) :: HashMap k v -> HashMap k v -> Bool Source #

(>) :: HashMap k v -> HashMap k v -> Bool Source #

(>=) :: HashMap k v -> HashMap k v -> Bool Source #

max :: HashMap k v -> HashMap k v -> HashMap k v Source #

min :: HashMap k v -> HashMap k v -> HashMap k v Source #

(Ord a, Ord b) => Ord (a, b) |
Instance details Defined in GHC.Classes Methods compare :: (a, b) -> (a, b) -> Ordering Source # (<) :: (a, b) -> (a, b) -> Bool Source # (<=) :: (a, b) -> (a, b) -> Bool Source # (>) :: (a, b) -> (a, b) -> Bool Source # (>=) :: (a, b) -> (a, b) -> Bool Source # max :: (a, b) -> (a, b) -> (a, b) Source # min :: (a, b) -> (a, b) -> (a, b) Source #
Ord (p (Fix p a) a) => Ord (Fix p a) |
Instance details Defined in Data.Bifunctor.Fix Methods compare :: Fix p a -> Fix p a -> Ordering Source # (<) :: Fix p a -> Fix p a -> Bool Source # (<=) :: Fix p a -> Fix p a -> Bool Source # (>) :: Fix p a -> Fix p a -> Bool Source # (>=) :: Fix p a -> Fix p a -> Bool Source # max :: Fix p a -> Fix p a -> Fix p a Source # min :: Fix p a -> Fix p a -> Fix p a Source #
Ord (p a a) => Ord (Join p a) |
Instance details Defined in Data.Bifunctor.Join Methods compare :: Join p a -> Join p a -> Ordering Source # (<) :: Join p a -> Join p a -> Bool Source # (<=) :: Join p a -> Join p a -> Bool Source # (>) :: Join p a -> Join p a -> Bool Source # (>=) :: Join p a -> Join p a -> Bool Source # max :: Join p a -> Join p a -> Join p a Source # min :: Join p a -> Join p a -> Join p a Source #
(Ord a, Ord (f b)) => Ord (CofreeF f a b) |

Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

compare :: CofreeF f a b -> CofreeF f a b -> Ordering Source #

(<) :: CofreeF f a b -> CofreeF f a b -> Bool Source #

(<=) :: CofreeF f a b -> CofreeF f a b -> Bool Source #

(>) :: CofreeF f a b -> CofreeF f a b -> Bool Source #

(>=) :: CofreeF f a b -> CofreeF f a b -> Bool Source #

max :: CofreeF f a b -> CofreeF f a b -> CofreeF f a b Source #

min :: CofreeF f a b -> CofreeF f a b -> CofreeF f a b Source #

Ord (w (CofreeF f a (CofreeT f w a))) => Ord (CofreeT f w a) |

Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

compare :: CofreeT f w a -> CofreeT f w a -> Ordering Source #

(<) :: CofreeT f w a -> CofreeT f w a -> Bool Source #

(<=) :: CofreeT f w a -> CofreeT f w a -> Bool Source #

(>) :: CofreeT f w a -> CofreeT f w a -> Bool Source #

(>=) :: CofreeT f w a -> CofreeT f w a -> Bool Source #

max :: CofreeT f w a -> CofreeT f w a -> CofreeT f w a Source #

min :: CofreeT f w a -> CofreeT f w a -> CofreeT f w a Source #

(Ord a, Ord (f b)) => Ord (FreeF f a b) |

Instance details

Defined in Control.Monad.Trans.Free

Methods

compare :: FreeF f a b -> FreeF f a b -> Ordering Source #

(<) :: FreeF f a b -> FreeF f a b -> Bool Source #

(<=) :: FreeF f a b -> FreeF f a b -> Bool Source #

(>) :: FreeF f a b -> FreeF f a b -> Bool Source #

(>=) :: FreeF f a b -> FreeF f a b -> Bool Source #

max :: FreeF f a b -> FreeF f a b -> FreeF f a b Source #

min :: FreeF f a b -> FreeF f a b -> FreeF f a b Source #

(Ord1 f, Ord1 m, Ord a) => Ord (FreeT f m a) |

Instance details

Defined in Control.Monad.Trans.Free

Methods

compare :: FreeT f m a -> FreeT f m a -> Ordering Source #

(<) :: FreeT f m a -> FreeT f m a -> Bool Source #

(<=) :: FreeT f m a -> FreeT f m a -> Bool Source #

(>) :: FreeT f m a -> FreeT f m a -> Bool Source #

(>=) :: FreeT f m a -> FreeT f m a -> Bool Source #

max :: FreeT f m a -> FreeT f m a -> FreeT f m a Source #

min :: FreeT f m a -> FreeT f m a -> FreeT f m a Source #

Ord a => Ord (Const a b) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

compare :: Const a b -> Const a b -> Ordering Source #

(<) :: Const a b -> Const a b -> Bool Source #

(<=) :: Const a b -> Const a b -> Bool Source #

(>) :: Const a b -> Const a b -> Bool Source #

(>=) :: Const a b -> Const a b -> Bool Source #

max :: Const a b -> Const a b -> Const a b Source #

min :: Const a b -> Const a b -> Const a b Source #

Ord (f a) => Ord (Ap f a) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods compare :: Ap f a -> Ap f a -> Ordering Source # (<) :: Ap f a -> Ap f a -> Bool Source # (<=) :: Ap f a -> Ap f a -> Bool Source # (>) :: Ap f a -> Ap f a -> Bool Source # (>=) :: Ap f a -> Ap f a -> Bool Source # max :: Ap f a -> Ap f a -> Ap f a Source # min :: Ap f a -> Ap f a -> Ap f a Source #
Ord (f a) => Ord (Alt f a) | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods compare :: Alt f a -> Alt f a -> Ordering Source # (<) :: Alt f a -> Alt f a -> Bool Source # (<=) :: Alt f a -> Alt f a -> Bool Source # (>) :: Alt f a -> Alt f a -> Bool Source # (>=) :: Alt f a -> Alt f a -> Bool Source # max :: Alt f a -> Alt f a -> Alt f a Source # min :: Alt f a -> Alt f a -> Alt f a Source #
(Generic1 f, Ord (Rep1 f a)) => Ord (Generically1 f a) | Since: base-4.18.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: Generically1 f a -> Generically1 f a -> Ordering Source #

(<) :: Generically1 f a -> Generically1 f a -> Bool Source #

(<=) :: Generically1 f a -> Generically1 f a -> Bool Source #

(>) :: Generically1 f a -> Generically1 f a -> Bool Source #

(>=) :: Generically1 f a -> Generically1 f a -> Bool Source #

max :: Generically1 f a -> Generically1 f a -> Generically1 f a Source #

min :: Generically1 f a -> Generically1 f a -> Generically1 f a Source #

Ord (f p) => Ord (Rec1 f p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods compare :: Rec1 f p -> Rec1 f p -> Ordering Source # (<) :: Rec1 f p -> Rec1 f p -> Bool Source # (<=) :: Rec1 f p -> Rec1 f p -> Bool Source # (>) :: Rec1 f p -> Rec1 f p -> Bool Source # (>=) :: Rec1 f p -> Rec1 f p -> Bool Source # max :: Rec1 f p -> Rec1 f p -> Rec1 f p Source # min :: Rec1 f p -> Rec1 f p -> Rec1 f p Source #
Ord (URec (Ptr ()) p) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: URec (Ptr ()) p -> URec (Ptr ()) p -> Ordering Source #

(<) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool Source #

(<=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool Source #

(>) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool Source #

(>=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool Source #

max :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p Source #

min :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p Source #

Ord (URec Char p) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: URec Char p -> URec Char p -> Ordering Source #

(<) :: URec Char p -> URec Char p -> Bool Source #

(<=) :: URec Char p -> URec Char p -> Bool Source #

(>) :: URec Char p -> URec Char p -> Bool Source #

(>=) :: URec Char p -> URec Char p -> Bool Source #

max :: URec Char p -> URec Char p -> URec Char p Source #

min :: URec Char p -> URec Char p -> URec Char p Source #

Ord (URec Double p) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: URec Double p -> URec Double p -> Ordering Source #

(<) :: URec Double p -> URec Double p -> Bool Source #

(<=) :: URec Double p -> URec Double p -> Bool Source #

(>) :: URec Double p -> URec Double p -> Bool Source #

(>=) :: URec Double p -> URec Double p -> Bool Source #

max :: URec Double p -> URec Double p -> URec Double p Source #

min :: URec Double p -> URec Double p -> URec Double p Source #

Ord (URec Float p) |

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: URec Float p -> URec Float p -> Ordering Source #

(<) :: URec Float p -> URec Float p -> Bool Source #

(<=) :: URec Float p -> URec Float p -> Bool Source #

(>) :: URec Float p -> URec Float p -> Bool Source #

(>=) :: URec Float p -> URec Float p -> Bool Source #

max :: URec Float p -> URec Float p -> URec Float p Source #

min :: URec Float p -> URec Float p -> URec Float p Source #

Ord (URec Int p) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: URec Int p -> URec Int p -> Ordering Source #

(<) :: URec Int p -> URec Int p -> Bool Source #

(<=) :: URec Int p -> URec Int p -> Bool Source #

(>) :: URec Int p -> URec Int p -> Bool Source #

(>=) :: URec Int p -> URec Int p -> Bool Source #

max :: URec Int p -> URec Int p -> URec Int p Source #

min :: URec Int p -> URec Int p -> URec Int p Source #

Ord (URec Word p) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: URec Word p -> URec Word p -> Ordering Source #

(<) :: URec Word p -> URec Word p -> Bool Source #

(<=) :: URec Word p -> URec Word p -> Bool Source #

(>) :: URec Word p -> URec Word p -> Bool Source #

(>=) :: URec Word p -> URec Word p -> Bool Source #

max :: URec Word p -> URec Word p -> URec Word p Source #

min :: URec Word p -> URec Word p -> URec Word p Source #

Ord a => Ord (V n a) |
Instance details Defined in Linear.V Methods compare :: V n a -> V n a -> Ordering Source # (<) :: V n a -> V n a -> Bool Source # (<=) :: V n a -> V n a -> Bool Source # (>) :: V n a -> V n a -> Bool Source # (>=) :: V n a -> V n a -> Bool Source # max :: V n a -> V n a -> V n a Source # min :: V n a -> V n a -> V n a Source #
Ord b => Ord (Tagged s b) |

Instance details

Defined in Data.Tagged

Methods

compare :: Tagged s b -> Tagged s b -> Ordering Source #

(<) :: Tagged s b -> Tagged s b -> Bool Source #

(<=) :: Tagged s b -> Tagged s b -> Bool Source #

(>) :: Tagged s b -> Tagged s b -> Bool Source #

(>=) :: Tagged s b -> Tagged s b -> Bool Source #

max :: Tagged s b -> Tagged s b -> Tagged s b Source #

min :: Tagged s b -> Tagged s b -> Tagged s b Source #

(Ord (f a), Ord (g a), Ord a) => Ord (These1 f g a) |

Instance details

Defined in Data.Functor.These

Methods

compare :: These1 f g a -> These1 f g a -> Ordering Source #

(<) :: These1 f g a -> These1 f g a -> Bool Source #

(<=) :: These1 f g a -> These1 f g a -> Bool Source #

(>) :: These1 f g a -> These1 f g a -> Bool Source #

(>=) :: These1 f g a -> These1 f g a -> Bool Source #

max :: These1 f g a -> These1 f g a -> These1 f g a Source #

min :: These1 f g a -> These1 f g a -> These1 f g a Source #

(Ord1 f, Ord a) => Ord (Backwards f a) |

Instance details

Defined in Control.Applicative.Backwards

Methods

compare :: Backwards f a -> Backwards f a -> Ordering Source #

(<) :: Backwards f a -> Backwards f a -> Bool Source #

(<=) :: Backwards f a -> Backwards f a -> Bool Source #

(>) :: Backwards f a -> Backwards f a -> Bool Source #

(>=) :: Backwards f a -> Backwards f a -> Bool Source #

max :: Backwards f a -> Backwards f a -> Backwards f a Source #

min :: Backwards f a -> Backwards f a -> Backwards f a Source #

(Ord e, Ord1 m, Ord a) => Ord (ExceptT e m a) |

Instance details

Defined in Control.Monad.Trans.Except

Methods

compare :: ExceptT e m a -> ExceptT e m a -> Ordering Source #

(<) :: ExceptT e m a -> ExceptT e m a -> Bool Source #

(<=) :: ExceptT e m a -> ExceptT e m a -> Bool Source #

(>) :: ExceptT e m a -> ExceptT e m a -> Bool Source #

(>=) :: ExceptT e m a -> ExceptT e m a -> Bool Source #

max :: ExceptT e m a -> ExceptT e m a -> ExceptT e m a Source #

min :: ExceptT e m a -> ExceptT e m a -> ExceptT e m a Source #

(Ord1 f, Ord a) => Ord (IdentityT f a) |

Instance details

Defined in Control.Monad.Trans.Identity

Methods

compare :: IdentityT f a -> IdentityT f a -> Ordering Source #

(<) :: IdentityT f a -> IdentityT f a -> Bool Source #

(<=) :: IdentityT f a -> IdentityT f a -> Bool Source #

(>) :: IdentityT f a -> IdentityT f a -> Bool Source #

(>=) :: IdentityT f a -> IdentityT f a -> Bool Source #

max :: IdentityT f a -> IdentityT f a -> IdentityT f a Source #

min :: IdentityT f a -> IdentityT f a -> IdentityT f a Source #

(Ord w, Ord1 m, Ord a) => Ord (WriterT w m a) |

Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

compare :: WriterT w m a -> WriterT w m a -> Ordering Source #

(<) :: WriterT w m a -> WriterT w m a -> Bool Source #

(<=) :: WriterT w m a -> WriterT w m a -> Bool Source #

(>) :: WriterT w m a -> WriterT w m a -> Bool Source #

(>=) :: WriterT w m a -> WriterT w m a -> Bool Source #

max :: WriterT w m a -> WriterT w m a -> WriterT w m a Source #

min :: WriterT w m a -> WriterT w m a -> WriterT w m a Source #

(Ord w, Ord1 m, Ord a) => Ord (WriterT w m a) |

Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

compare :: WriterT w m a -> WriterT w m a -> Ordering Source #

(<) :: WriterT w m a -> WriterT w m a -> Bool Source #

(<=) :: WriterT w m a -> WriterT w m a -> Bool Source #

(>) :: WriterT w m a -> WriterT w m a -> Bool Source #

(>=) :: WriterT w m a -> WriterT w m a -> Bool Source #

max :: WriterT w m a -> WriterT w m a -> WriterT w m a Source #

min :: WriterT w m a -> WriterT w m a -> WriterT w m a Source #

Ord a => Ord (Constant a b) |

Instance details

Defined in Data.Functor.Constant

Methods

compare :: Constant a b -> Constant a b -> Ordering Source #

(<) :: Constant a b -> Constant a b -> Bool Source #

(<=) :: Constant a b -> Constant a b -> Bool Source #

(>) :: Constant a b -> Constant a b -> Bool Source #

(>=) :: Constant a b -> Constant a b -> Bool Source #

max :: Constant a b -> Constant a b -> Constant a b Source #

min :: Constant a b -> Constant a b -> Constant a b Source #

(Ord1 f, Ord a) => Ord (Reverse f a) |

Instance details

Defined in Data.Functor.Reverse

Methods

compare :: Reverse f a -> Reverse f a -> Ordering Source #

(<) :: Reverse f a -> Reverse f a -> Bool Source #

(<=) :: Reverse f a -> Reverse f a -> Bool Source #

(>) :: Reverse f a -> Reverse f a -> Bool Source #

(>=) :: Reverse f a -> Reverse f a -> Bool Source #

max :: Reverse f a -> Reverse f a -> Reverse f a Source #

min :: Reverse f a -> Reverse f a -> Reverse f a Source #

Ord a => Ord (Bundle Id v a) |

Instance details

Defined in Data.Vector.Fusion.Bundle

Methods

compare :: Bundle Id v a -> Bundle Id v a -> Ordering Source #

(<) :: Bundle Id v a -> Bundle Id v a -> Bool Source #

(<=) :: Bundle Id v a -> Bundle Id v a -> Bool Source #

(>) :: Bundle Id v a -> Bundle Id v a -> Bool Source #

(>=) :: Bundle Id v a -> Bundle Id v a -> Bool Source #

max :: Bundle Id v a -> Bundle Id v a -> Bundle Id v a Source #

min :: Bundle Id v a -> Bundle Id v a -> Bundle Id v a Source #

(Ord a, Ord b, Ord c) => Ord (a, b, c) |
Instance details Defined in GHC.Classes Methods compare :: (a, b, c) -> (a, b, c) -> Ordering Source # (<) :: (a, b, c) -> (a, b, c) -> Bool Source # (<=) :: (a, b, c) -> (a, b, c) -> Bool Source # (>) :: (a, b, c) -> (a, b, c) -> Bool Source # (>=) :: (a, b, c) -> (a, b, c) -> Bool Source # max :: (a, b, c) -> (a, b, c) -> (a, b, c) Source # min :: (a, b, c) -> (a, b, c) -> (a, b, c) Source #
(Ord (f a), Ord (g a)) => Ord (Product f g a) | Since: base-4.18.0.0

Instance details

Defined in Data.Functor.Product

Methods

compare :: Product f g a -> Product f g a -> Ordering Source #

(<) :: Product f g a -> Product f g a -> Bool Source #

(<=) :: Product f g a -> Product f g a -> Bool Source #

(>) :: Product f g a -> Product f g a -> Bool Source #

(>=) :: Product f g a -> Product f g a -> Bool Source #

max :: Product f g a -> Product f g a -> Product f g a Source #

min :: Product f g a -> Product f g a -> Product f g a Source #

(Ord (f a), Ord (g a)) => Ord (Sum f g a) | Since: base-4.18.0.0

Instance details

Defined in Data.Functor.Sum

Methods

compare :: Sum f g a -> Sum f g a -> Ordering Source #

(<) :: Sum f g a -> Sum f g a -> Bool Source #

(<=) :: Sum f g a -> Sum f g a -> Bool Source #

(>) :: Sum f g a -> Sum f g a -> Bool Source #

(>=) :: Sum f g a -> Sum f g a -> Bool Source #

max :: Sum f g a -> Sum f g a -> Sum f g a Source #

min :: Sum f g a -> Sum f g a -> Sum f g a Source #

(Ord (f p), Ord (g p)) => Ord ((f :*: g) p) | Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: (f :*: g) p -> (f :*: g) p -> Ordering Source #

(<) :: (f :*: g) p -> (f :*: g) p -> Bool Source #

(<=) :: (f :*: g) p -> (f :*: g) p -> Bool Source #

(>) :: (f :*: g) p -> (f :*: g) p -> Bool Source #

(>=) :: (f :*: g) p -> (f :*: g) p -> Bool Source #

max :: (f :*: g) p -> (f :*: g) p -> (f :*: g) p Source #

min :: (f :*: g) p -> (f :*: g) p -> (f :*: g) p Source #

(Ord (f p), Ord (g p)) => Ord ((f :+: g) p) | Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: (f :+: g) p -> (f :+: g) p -> Ordering Source #

(<) :: (f :+: g) p -> (f :+: g) p -> Bool Source #

(<=) :: (f :+: g) p -> (f :+: g) p -> Bool Source #

(>) :: (f :+: g) p -> (f :+: g) p -> Bool Source #

(>=) :: (f :+: g) p -> (f :+: g) p -> Bool Source #

max :: (f :+: g) p -> (f :+: g) p -> (f :+: g) p Source #

min :: (f :+: g) p -> (f :+: g) p -> (f :+: g) p Source #

Ord c => Ord (K1 i c p) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Generics Methods compare :: K1 i c p -> K1 i c p -> Ordering Source # (<) :: K1 i c p -> K1 i c p -> Bool Source # (<=) :: K1 i c p -> K1 i c p -> Bool Source # (>) :: K1 i c p -> K1 i c p -> Bool Source # (>=) :: K1 i c p -> K1 i c p -> Bool Source # max :: K1 i c p -> K1 i c p -> K1 i c p Source # min :: K1 i c p -> K1 i c p -> K1 i c p Source #
(Ord a, Ord b, Ord c, Ord d) => Ord (a, b, c, d) |

Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d) -> (a, b, c, d) -> Ordering Source #

(<) :: (a, b, c, d) -> (a, b, c, d) -> Bool Source #

(<=) :: (a, b, c, d) -> (a, b, c, d) -> Bool Source #

(>) :: (a, b, c, d) -> (a, b, c, d) -> Bool Source #

(>=) :: (a, b, c, d) -> (a, b, c, d) -> Bool Source #

max :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) Source #

min :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) Source #

Ord (f (g a)) => Ord (Compose f g a) | Since: base-4.18.0.0

Instance details

Defined in Data.Functor.Compose

Methods

compare :: Compose f g a -> Compose f g a -> Ordering Source #

(<) :: Compose f g a -> Compose f g a -> Bool Source #

(<=) :: Compose f g a -> Compose f g a -> Bool Source #

(>) :: Compose f g a -> Compose f g a -> Bool Source #

(>=) :: Compose f g a -> Compose f g a -> Bool Source #

max :: Compose f g a -> Compose f g a -> Compose f g a Source #

min :: Compose f g a -> Compose f g a -> Compose f g a Source #

Ord (f a) => Ord (Clown f a b) |

Instance details

Defined in Data.Bifunctor.Clown

Methods

compare :: Clown f a b -> Clown f a b -> Ordering Source #

(<) :: Clown f a b -> Clown f a b -> Bool Source #

(<=) :: Clown f a b -> Clown f a b -> Bool Source #

(>) :: Clown f a b -> Clown f a b -> Bool Source #

(>=) :: Clown f a b -> Clown f a b -> Bool Source #

max :: Clown f a b -> Clown f a b -> Clown f a b Source #

min :: Clown f a b -> Clown f a b -> Clown f a b Source #

Ord (p b a) => Ord (Flip p a b) |

Instance details

Defined in Data.Bifunctor.Flip

Methods

compare :: Flip p a b -> Flip p a b -> Ordering Source #

(<) :: Flip p a b -> Flip p a b -> Bool Source #

(<=) :: Flip p a b -> Flip p a b -> Bool Source #

(>) :: Flip p a b -> Flip p a b -> Bool Source #

(>=) :: Flip p a b -> Flip p a b -> Bool Source #

max :: Flip p a b -> Flip p a b -> Flip p a b Source #

min :: Flip p a b -> Flip p a b -> Flip p a b Source #

Ord (g b) => Ord (Joker g a b) |

Instance details

Defined in Data.Bifunctor.Joker

Methods

compare :: Joker g a b -> Joker g a b -> Ordering Source #

(<) :: Joker g a b -> Joker g a b -> Bool Source #

(<=) :: Joker g a b -> Joker g a b -> Bool Source #

(>) :: Joker g a b -> Joker g a b -> Bool Source #

(>=) :: Joker g a b -> Joker g a b -> Bool Source #

max :: Joker g a b -> Joker g a b -> Joker g a b Source #

min :: Joker g a b -> Joker g a b -> Joker g a b Source #

Ord (p a b) => Ord (WrappedBifunctor p a b) |

Instance details

Defined in Data.Bifunctor.Wrapped

Methods

compare :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Ordering Source #

(<) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool Source #

(<=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool Source #

(>) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool Source #

(>=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool Source #

max :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> WrappedBifunctor p a b Source #

min :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> WrappedBifunctor p a b Source #

Ord (f (g p)) => Ord ((f :.: g) p) | Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: (f :.: g) p -> (f :.: g) p -> Ordering Source #

(<) :: (f :.: g) p -> (f :.: g) p -> Bool Source #

(<=) :: (f :.: g) p -> (f :.: g) p -> Bool Source #

(>) :: (f :.: g) p -> (f :.: g) p -> Bool Source #

(>=) :: (f :.: g) p -> (f :.: g) p -> Bool Source #

max :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p Source #

min :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p Source #

Ord (f p) => Ord (M1 i c f p) | Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: M1 i c f p -> M1 i c f p -> Ordering Source #

(<) :: M1 i c f p -> M1 i c f p -> Bool Source #

(<=) :: M1 i c f p -> M1 i c f p -> Bool Source #

(>) :: M1 i c f p -> M1 i c f p -> Bool Source #

(>=) :: M1 i c f p -> M1 i c f p -> Bool Source #

max :: M1 i c f p -> M1 i c f p -> M1 i c f p Source #

min :: M1 i c f p -> M1 i c f p -> M1 i c f p Source #

(Ord a, Ord b, Ord c, Ord d, Ord e) => Ord (a, b, c, d, e) |

Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e) -> (a, b, c, d, e) -> Ordering Source #

(<) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool Source #

(<=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool Source #

(>) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool Source #

(>=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool Source #

max :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) Source #

min :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) Source #

(Ord (f a b), Ord (g a b)) => Ord (Product f g a b) |

Instance details

Defined in Data.Bifunctor.Product

Methods

compare :: Product f g a b -> Product f g a b -> Ordering Source #

(<) :: Product f g a b -> Product f g a b -> Bool Source #

(<=) :: Product f g a b -> Product f g a b -> Bool Source #

(>) :: Product f g a b -> Product f g a b -> Bool Source #

(>=) :: Product f g a b -> Product f g a b -> Bool Source #

max :: Product f g a b -> Product f g a b -> Product f g a b Source #

min :: Product f g a b -> Product f g a b -> Product f g a b Source #

(Ord (p a b), Ord (q a b)) => Ord (Sum p q a b) |

Instance details

Defined in Data.Bifunctor.Sum

Methods

compare :: Sum p q a b -> Sum p q a b -> Ordering Source #

(<) :: Sum p q a b -> Sum p q a b -> Bool Source #

(<=) :: Sum p q a b -> Sum p q a b -> Bool Source #

(>) :: Sum p q a b -> Sum p q a b -> Bool Source #

(>=) :: Sum p q a b -> Sum p q a b -> Bool Source #

max :: Sum p q a b -> Sum p q a b -> Sum p q a b Source #

min :: Sum p q a b -> Sum p q a b -> Sum p q a b Source #

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => Ord (a, b, c, d, e, f) |

Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Ordering Source #

(<) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool Source #

(<=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool Source #

(>) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool Source #

(>=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool Source #

max :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) Source #

min :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) Source #

Ord (f (p a b)) => Ord (Tannen f p a b) |

Instance details

Defined in Data.Bifunctor.Tannen

Methods

compare :: Tannen f p a b -> Tannen f p a b -> Ordering Source #

(<) :: Tannen f p a b -> Tannen f p a b -> Bool Source #

(<=) :: Tannen f p a b -> Tannen f p a b -> Bool Source #

(>) :: Tannen f p a b -> Tannen f p a b -> Bool Source #

(>=) :: Tannen f p a b -> Tannen f p a b -> Bool Source #

max :: Tannen f p a b -> Tannen f p a b -> Tannen f p a b Source #

min :: Tannen f p a b -> Tannen f p a b -> Tannen f p a b Source #

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => Ord (a, b, c, d, e, f, g) |

Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Ordering Source #

(<) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool Source #

(<=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool Source #

(>) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool Source #

(>=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool Source #

max :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) Source #

min :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) Source #

(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) |

Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Ordering Source #

(<) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool Source #

(<=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool Source #

(>) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool Source #

(>=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool Source #

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) Source #

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) Source #

Ord (p (f a) (g b)) => Ord (Biff p f g a b) |

Instance details

Defined in Data.Bifunctor.Biff

Methods

compare :: Biff p f g a b -> Biff p f g a b -> Ordering Source #

(<) :: Biff p f g a b -> Biff p f g a b -> Bool Source #

(<=) :: Biff p f g a b -> Biff p f g a b -> Bool Source #

(>) :: Biff p f g a b -> Biff p f g a b -> Bool Source #

(>=) :: Biff p f g a b -> Biff p f g a b -> Bool Source #

max :: Biff p f g a b -> Biff p f g a b -> Biff p f g a b Source #

min :: Biff p f g a b -> Biff p f g a b -> Biff p f g a b Source #

(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) |

Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Ordering Source #

(<) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool Source #

(<=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool Source #

(>) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool Source #

(>=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool Source #

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) Source #

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) Source #

(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) |

Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Ordering Source #

(<) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool Source #

(<=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool Source #

(>) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool Source #

(>=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool Source #

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) Source #

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) Source #

(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) |

Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Ordering Source #

(<) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool Source #

(<=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool Source #

(>) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool Source #

(>=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool Source #

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) Source #

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) Source #

(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) |

Instance details

Defined in GHC.Classes

Methods

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 Source #

(<) :: (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 Source #

(<=) :: (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 Source #

(>) :: (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 Source #

(>=) :: (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 Source #

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) Source #

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) Source #

(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) |

Instance details

Defined in GHC.Classes

Methods

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 Source #

(<) :: (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 Source #

(<=) :: (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 Source #

(>) :: (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 Source #

(>=) :: (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 Source #

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) Source #

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) Source #

(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) |

Instance details

Defined in GHC.Classes

Methods

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 Source #

(<) :: (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 Source #

(<=) :: (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 Source #

(>) :: (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 Source #

(>=) :: (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 Source #

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) Source #

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) Source #

(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) |

Instance details

Defined in GHC.Classes

Methods

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 Source #

(<) :: (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 Source #

(<=) :: (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 Source #

(>) :: (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 Source #

(>=) :: (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 Source #

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) Source #

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) Source #

type String = [Char] Source #

`String` is an alias for a list of characters.

String constants in Haskell are values of type `String`. That means if you write a string literal like `"hello world"`, it will have the type `[Char]`, which is the same as `String`.

Note: You can ask the compiler to automatically infer different types with the `-XOverloadedStrings` language extension, for example `"hello world" :: Text`. See `IsString` for more information.

Because `String` is just a list of characters, you can use normal list functions to do basic string manipulation. See Data.List for operations on lists.

### Performance considerations

Expand

`[Char]` is a relatively memory-inefficient type. It is a linked list of boxed word-size characters, internally it looks something like:

    ╭─────┬───┬──╮  ╭─────┬───┬──╮  ╭─────┬───┬──╮  ╭────╮
    │ (:) │   │ ─┼─>│ (:) │   │ ─┼─>│ (:) │   │ ─┼─>│ [] │
    ╰─────┴─┼─┴──╯  ╰─────┴─┼─┴──╯  ╰─────┴─┼─┴──╯  ╰────╯
            v               v               v
           'a'             'b'             'c'

The `String` "abc" will use `5*3+1 = 16` (in general `5n+1`) words of space in memory.

Furthermore, operations like `(++)` (string concatenation) are `O(n)` (in the left argument).

For historical reasons, the `base` library uses `String` in a lot of places for the conceptual simplicity, but library code dealing with user-data should use the text package for Unicode text, or the the bytestring package for binary data.

data Char Source #

The character type `Char` represents Unicode codespace and its elements are code points as in definitions D9 and D10 of the Unicode Standard.

Character literals in Haskell are single-quoted: `'Q'`, `'Я'` or `'Ω'`. To represent a single quote itself use `'\''`, and to represent a backslash use `'\\'`. The full grammar can be found in the section 2.6 of the Haskell 2010 Language Report.

To specify a character by its code point one can use decimal, hexadecimal or octal notation: `'\65'`, `'\x41'` and `'\o101'` are all alternative forms of `'A'`. The largest code point is `'\x10ffff'`.

There is a special escape syntax for ASCII control characters:

Escape | Alternatives | Meaning
--- | --- | ---
`'\NUL'` | `'\0'` | null character
`'\SOH'` | `'\1'` | start of heading
`'\STX'` | `'\2'` | start of text
`'\ETX'` | `'\3'` | end of text
`'\EOT'` | `'\4'` | end of transmission
`'\ENQ'` | `'\5'` | enquiry
`'\ACK'` | `'\6'` | acknowledge
`'\BEL'` | `'\7'`, `'\a'` | bell (alert)
`'\BS'` | `'\8'`, `'\b'` | backspace
`'\HT'` | `'\9'`, `'\t'` | horizontal tab
`'\LF'` | `'\10'`, `'\n'` | line feed (new line)
`'\VT'` | `'\11'`, `'\v'` | vertical tab
`'\FF'` | `'\12'`, `'\f'` | form feed
`'\CR'` | `'\13'`, `'\r'` | carriage return
`'\SO'` | `'\14'` | shift out
`'\SI'` | `'\15'` | shift in
`'\DLE'` | `'\16'` | data link escape
`'\DC1'` | `'\17'` | device control 1
`'\DC2'` | `'\18'` | device control 2
`'\DC3'` | `'\19'` | device control 3
`'\DC4'` | `'\20'` | device control 4
`'\NAK'` | `'\21'` | negative acknowledge
`'\SYN'` | `'\22'` | synchronous idle
`'\ETB'` | `'\23'` | end of transmission block
`'\CAN'` | `'\24'` | cancel
`'\EM'` | `'\25'` | end of medium
`'\SUB'` | `'\26'` | substitute
`'\ESC'` | `'\27'` | escape
`'\FS'` | `'\28'` | file separator
`'\GS'` | `'\29'` | group separator
`'\RS'` | `'\30'` | record separator
`'\US'` | `'\31'` | unit separator
`'\SP'` | `'\32'`, `' '` | space
`'\DEL'` | `'\127'` | delete

Data.Char provides utilities to work with `Char`.

#### Instances

Instances details

Arbitrary Char |
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen Char Source # shrink :: Char -> [Char] Source #
CoArbitrary Char |
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Char -> Gen b -> Gen b Source #
Function Char |
Instance details Defined in Test.QuickCheck.Function Methods function :: (Char -> b) -> Char :-> b Source #
IsChar Char | Since: base-2.1
Instance details Defined in Text.Printf Methods toChar :: Char -> Char Source # fromChar :: Char -> Char Source #
PrintfArg Char | Since: base-2.1
Instance details Defined in Text.Printf Methods formatArg :: Char -> FieldFormatter Source # parseFormat :: Char -> ModifierParser Source #
Binary Char |
Instance details Defined in Data.Binary.Class Methods put :: Char -> Put Source # get :: Get Char Source # putList :: [Char] -> Put Source #
NFData Char |
Instance details Defined in Control.DeepSeq Methods rnf :: Char -> () Source #
Bounded Char | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: Char Source # maxBound :: Char Source #
Enum Char | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods succ :: Char -> Char Source # pred :: Char -> Char Source # toEnum :: Int -> Char Source # fromEnum :: Char -> Int Source # enumFrom :: Char -> [Char] Source # enumFromThen :: Char -> Char -> [Char] Source # enumFromTo :: Char -> Char -> [Char] Source # enumFromThenTo :: Char -> Char -> Char -> [Char] Source #
Storable Char | Since: base-2.1

Instance details

Defined in GHC.Internal.Foreign.Storable

Methods

sizeOf :: Char -> Int Source #

alignment :: Char -> Int Source #

peekElemOff :: Ptr Char -> Int -> IO Char Source #

pokeElemOff :: Ptr Char -> Int -> Char -> IO () Source #

peekByteOff :: Ptr b -> Int -> IO Char Source #

pokeByteOff :: Ptr b -> Int -> Char -> IO () Source #

peek :: Ptr Char -> IO Char Source #

poke :: Ptr Char -> Char -> IO () Source #

Ix Char | Since: base-2.1
Instance details Defined in GHC.Internal.Ix Methods range :: (Char, Char) -> [Char] Source # index :: (Char, Char) -> Char -> Int Source # unsafeIndex :: (Char, Char) -> Char -> Int Source # inRange :: (Char, Char) -> Char -> Bool Source # rangeSize :: (Char, Char) -> Int Source # unsafeRangeSize :: (Char, Char) -> Int Source #
Read Char | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Char Source # readList :: ReadS [Char] Source # readPrec :: ReadPrec Char Source # readListPrec :: ReadPrec [Char] Source #
Show Char | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Char -> ShowS Source # show :: Char -> String Source # showList :: [Char] -> ShowS Source #
Eq Char |
Instance details Defined in GHC.Classes Methods (==) :: Char -> Char -> Bool Source # (/=) :: Char -> Char -> Bool Source #
Ord Char |
Instance details Defined in GHC.Classes Methods compare :: Char -> Char -> Ordering Source # (<) :: Char -> Char -> Bool Source # (<=) :: Char -> Char -> Bool Source # (>) :: Char -> Char -> Bool Source # (>=) :: Char -> Char -> Bool Source # max :: Char -> Char -> Char Source # min :: Char -> Char -> Char Source #
Hashable Char |
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Char -> Int Source # hash :: Char -> Int Source #
Pretty Char |
Instance details Defined in Prettyprinter.Internal Methods pretty :: Char -> Doc ann # prettyList :: [Char] -> Doc ann #
Prim Char |

Instance details

Defined in Data.Primitive.Types

Methods

sizeOfType# :: Proxy Char -> Int# Source #

sizeOf# :: Char -> Int# Source #

alignmentOfType# :: Proxy Char -> Int# Source #

alignment# :: Char -> Int# Source #

indexByteArray# :: ByteArray# -> Int# -> Char Source #

readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Char #) Source #

writeByteArray# :: MutableByteArray# s -> Int# -> Char -> State# s -> State# s Source #

setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Char -> State# s -> State# s Source #

indexOffAddr# :: Addr# -> Int# -> Char Source #

readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Char #) Source #

writeOffAddr# :: Addr# -> Int# -> Char -> State# s -> State# s Source #

setOffAddr# :: Addr# -> Int# -> Int# -> Char -> State# s -> State# s Source #

Random Char |
Instance details Defined in System.Random Methods randomR :: RandomGen g => (Char, Char) -> g -> (Char, g) random :: RandomGen g => g -> (Char, g) randomRs :: RandomGen g => (Char, Char) -> g -> [Char] randoms :: RandomGen g => g -> [Char]
Uniform Char |
Instance details Defined in System.Random.Internal Methods uniformM :: StatefulGen g m => g -> m Char
UniformRange Char |
Instance details Defined in System.Random.Internal Methods uniformRM :: StatefulGen g m => (Char, Char) -> g -> m Char
Unbox Char |
Instance details Defined in Data.Vector.Unboxed.Base
Lift Char |
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Quote m => Char -> m Exp Source # liftTyped :: forall (m :: Type -> Type). Quote m => Char -> Code m Char Source #
Vector Vector Char |

Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: Mutable Vector s Char -> ST s (Vector Char)

basicUnsafeThaw :: Vector Char -> ST s (Mutable Vector s Char)

basicLength :: Vector Char -> Int

basicUnsafeSlice :: Int -> Int -> Vector Char -> Vector Char

basicUnsafeIndexM :: Vector Char -> Int -> Box Char

basicUnsafeCopy :: Mutable Vector s Char -> Vector Char -> ST s ()

elemseq :: Vector Char -> Char -> b -> b

MVector MVector Char |

Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Char -> Int

basicUnsafeSlice :: Int -> Int -> MVector s Char -> MVector s Char

basicOverlaps :: MVector s Char -> MVector s Char -> Bool

basicUnsafeNew :: Int -> ST s (MVector s Char)

basicInitialize :: MVector s Char -> ST s ()

basicUnsafeReplicate :: Int -> Char -> ST s (MVector s Char)

basicUnsafeRead :: MVector s Char -> Int -> ST s Char

basicUnsafeWrite :: MVector s Char -> Int -> Char -> ST s ()

basicClear :: MVector s Char -> ST s ()

basicSet :: MVector s Char -> Char -> ST s ()

basicUnsafeCopy :: MVector s Char -> MVector s Char -> ST s ()

basicUnsafeMove :: MVector s Char -> MVector s Char -> ST s ()

basicUnsafeGrow :: MVector s Char -> Int -> ST s (MVector s Char)

From Text String | Uses `unpack`.
Instance details Defined in Witch.Instances Methods from :: Text -> String Source #
From Text String | Uses `unpack`.
Instance details Defined in Witch.Instances Methods from :: Text -> String Source #
From Latin1L String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: Latin1L -> String Source #
From Latin1S String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: Latin1S -> String Source #
From String Text | Uses `pack`. Some `Char` values cannot be represented in `Text` and will be replaced with `'\xFFFD'`.
Instance details Defined in Witch.Instances Methods from :: String -> Text Source #
From String Text | Uses `pack`. Some `Char` values cannot be represented in `Text` and will be replaced with `'\xFFFD'`.
Instance details Defined in Witch.Instances Methods from :: String -> Text Source #
From String Utf16BL | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf16BL Source #
From String Utf16BS | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf16BS Source #
From String Utf16LL | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf16LL Source #
From String Utf16LS | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf16LS Source #
From String Utf32BL | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf32BL Source #
From String Utf32BS | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf32BS Source #
From String Utf32LL | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf32LL Source #
From String Utf32LS | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf32LS Source #
From String Utf8L | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf8L Source #
From String Utf8S | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf8S Source #
TryFrom Utf16BL String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf16BL -> Either (TryFromException Utf16BL String) String Source #
TryFrom Utf16BS String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf16BS -> Either (TryFromException Utf16BS String) String Source #
TryFrom Utf16LL String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf16LL -> Either (TryFromException Utf16LL String) String Source #
TryFrom Utf16LS String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf16LS -> Either (TryFromException Utf16LS String) String Source #
TryFrom Utf32BL String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf32BL -> Either (TryFromException Utf32BL String) String Source #
TryFrom Utf32BS String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf32BS -> Either (TryFromException Utf32BS String) String Source #
TryFrom Utf32LL String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf32LL -> Either (TryFromException Utf32LL String) String Source #
TryFrom Utf32LS String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf32LS -> Either (TryFromException Utf32LS String) String Source #
TryFrom Utf8L String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf8L -> Either (TryFromException Utf8L String) String Source #
TryFrom Utf8S String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf8S -> Either (TryFromException Utf8S String) String Source #
TryFrom String Latin1L | Uses `pack` when each character `isLatin1`.
Instance details Defined in Witch.Instances Methods tryFrom :: String -> Either (TryFromException String Latin1L) Latin1L Source #
TryFrom String Latin1S | Uses `pack` when each character `isLatin1`.
Instance details Defined in Witch.Instances Methods tryFrom :: String -> Either (TryFromException String Latin1S) Latin1S Source #
KnownSymbol n => Reifies (n :: Symbol) String |
Instance details Defined in Data.Reflection Methods reflect :: proxy n -> String
Generic1 (URec Char :: k -> Type) |

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep1 (URec Char :: k -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep1 (URec Char :: k -> Type) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UChar" 'PrefixI 'True) (S1 ('MetaSel ('Just "uChar#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UChar :: k -> Type)))

Methods

from1 :: forall (a :: k). URec Char a -> Rep1 (URec Char :: k -> Type) a Source #

to1 :: forall (a :: k). Rep1 (URec Char :: k -> Type) a -> URec Char a Source #

Eq1 (UChar :: Type -> Type) |
Instance details Defined in Data.Orphans Methods liftEq :: (a -> b -> Bool) -> UChar a -> UChar b -> Bool Source #
Ord1 (UChar :: Type -> Type) |
Instance details Defined in Data.Orphans Methods liftCompare :: (a -> b -> Ordering) -> UChar a -> UChar b -> Ordering Source #
Show1 (UChar :: Type -> Type) |
Instance details Defined in Data.Orphans Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> UChar a -> ShowS Source # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [UChar a] -> ShowS Source #
Foldable (UChar :: Type -> Type) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => UChar m -> m Source #

foldMap :: Monoid m => (a -> m) -> UChar a -> m Source #

foldMap' :: Monoid m => (a -> m) -> UChar a -> m Source #

foldr :: (a -> b -> b) -> b -> UChar a -> b Source #

foldr' :: (a -> b -> b) -> b -> UChar a -> b Source #

foldl :: (b -> a -> b) -> b -> UChar a -> b Source #

foldl' :: (b -> a -> b) -> b -> UChar a -> b Source #

foldr1 :: (a -> a -> a) -> UChar a -> a Source #

foldl1 :: (a -> a -> a) -> UChar a -> a Source #

toList :: UChar a -> [a] Source #

null :: UChar a -> Bool Source #

length :: UChar a -> Int Source #

elem :: Eq a => a -> UChar a -> Bool Source #

maximum :: Ord a => UChar a -> a Source #

minimum :: Ord a => UChar a -> a Source #

sum :: Num a => UChar a -> a Source #

product :: Num a => UChar a -> a Source #

Traversable (UChar :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> UChar a -> f (UChar b) Source # sequenceA :: Applicative f => UChar (f a) -> f (UChar a) Source # mapM :: Monad m => (a -> m b) -> UChar a -> m (UChar b) Source # sequence :: Monad m => UChar (m a) -> m (UChar a) Source #
Functor (URec Char :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> URec Char a -> URec Char b Source # (<$) :: a -> URec Char b -> URec Char a Source #
Generic (URec Char p) |

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep (URec Char p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep (URec Char p) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UChar" 'PrefixI 'True) (S1 ('MetaSel ('Just "uChar#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UChar :: Type -> Type)))

Methods

from :: URec Char p -> Rep (URec Char p) x Source #

to :: Rep (URec Char p) x -> URec Char p Source #

Show (URec Char p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> URec Char p -> ShowS Source # show :: URec Char p -> String Source # showList :: [URec Char p] -> ShowS Source #
Eq (URec Char p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: URec Char p -> URec Char p -> Bool Source # (/=) :: URec Char p -> URec Char p -> Bool Source #
Ord (URec Char p) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: URec Char p -> URec Char p -> Ordering Source #

(<) :: URec Char p -> URec Char p -> Bool Source #

(<=) :: URec Char p -> URec Char p -> Bool Source #

(>) :: URec Char p -> URec Char p -> Bool Source #

(>=) :: URec Char p -> URec Char p -> Bool Source #

max :: URec Char p -> URec Char p -> URec Char p Source #

min :: URec Char p -> URec Char p -> URec Char p Source #

newtype Vector Char |
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Char = V_Char (Vector Char)
data URec Char (p :: k) | Used for marking occurrences of `Char#` Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

data URec Char (p :: k) = UChar {

- uChar# :: Char#

}

newtype MVector s Char |
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Char = MV_Char (MVector s Char)
type Compare (a :: Char) (b :: Char) |
Instance details Defined in GHC.Internal.Data.Type.Ord type Compare (a :: Char) (b :: Char) = CmpChar a b
type Rep1 (URec Char :: k -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep1 (URec Char :: k -> Type) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UChar" 'PrefixI 'True) (S1 ('MetaSel ('Just "uChar#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UChar :: k -> Type)))
type Rep (URec Char p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep (URec Char p) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UChar" 'PrefixI 'True) (S1 ('MetaSel ('Just "uChar#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UChar :: Type -> Type)))

data Word Source #

A `Word` is an unsigned integral type, with the same size as `Int`.

#### Instances

Instances details

Arbitrary Word |
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen Word Source # shrink :: Word -> [Word] Source #
CoArbitrary Word |
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Word -> Gen b -> Gen b Source #
Function Word |
Instance details Defined in Test.QuickCheck.Function Methods function :: (Word -> b) -> Word :-> b Source #
PrintfArg Word | Since: base-2.1
Instance details Defined in Text.Printf Methods formatArg :: Word -> FieldFormatter Source # parseFormat :: Word -> ModifierParser Source #
Binary Word |
Instance details Defined in Data.Binary.Class Methods put :: Word -> Put Source # get :: Get Word Source # putList :: [Word] -> Put Source #
NFData Word |
Instance details Defined in Control.DeepSeq Methods rnf :: Word -> () Source #
Bits Word | Since: base-2.1

Instance details

Defined in GHC.Internal.Bits

Methods

(.&.) :: Word -> Word -> Word Source #

(.|.) :: Word -> Word -> Word Source #

xor :: Word -> Word -> Word Source #

complement :: Word -> Word Source #

shift :: Word -> Int -> Word Source #

rotate :: Word -> Int -> Word Source #

zeroBits :: Word Source #

bit :: Int -> Word Source #

setBit :: Word -> Int -> Word Source #

clearBit :: Word -> Int -> Word Source #

complementBit :: Word -> Int -> Word Source #

testBit :: Word -> Int -> Bool Source #

bitSizeMaybe :: Word -> Maybe Int Source #

bitSize :: Word -> Int Source #

isSigned :: Word -> Bool Source #

shiftL :: Word -> Int -> Word Source #

unsafeShiftL :: Word -> Int -> Word Source #

shiftR :: Word -> Int -> Word Source #

unsafeShiftR :: Word -> Int -> Word Source #

rotateL :: Word -> Int -> Word Source #

rotateR :: Word -> Int -> Word Source #

popCount :: Word -> Int Source #

FiniteBits Word | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Bits Methods finiteBitSize :: Word -> Int Source # countLeadingZeros :: Word -> Int Source # countTrailingZeros :: Word -> Int Source #
Bounded Word | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: Word Source # maxBound :: Word Source #
Enum Word | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods succ :: Word -> Word Source # pred :: Word -> Word Source # toEnum :: Int -> Word Source # fromEnum :: Word -> Int Source # enumFrom :: Word -> [Word] Source # enumFromThen :: Word -> Word -> [Word] Source # enumFromTo :: Word -> Word -> [Word] Source # enumFromThenTo :: Word -> Word -> Word -> [Word] Source #
Storable Word | Since: base-2.1

Instance details

Defined in GHC.Internal.Foreign.Storable

Methods

sizeOf :: Word -> Int Source #

alignment :: Word -> Int Source #

peekElemOff :: Ptr Word -> Int -> IO Word Source #

pokeElemOff :: Ptr Word -> Int -> Word -> IO () Source #

peekByteOff :: Ptr b -> Int -> IO Word Source #

pokeByteOff :: Ptr b -> Int -> Word -> IO () Source #

peek :: Ptr Word -> IO Word Source #

poke :: Ptr Word -> Word -> IO () Source #

Ix Word | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Ix Methods range :: (Word, Word) -> [Word] Source # index :: (Word, Word) -> Word -> Int Source # unsafeIndex :: (Word, Word) -> Word -> Int Source # inRange :: (Word, Word) -> Word -> Bool Source # rangeSize :: (Word, Word) -> Int Source # unsafeRangeSize :: (Word, Word) -> Int Source #
Num Word | Since: base-2.1
Instance details Defined in GHC.Internal.Num Methods (+) :: Word -> Word -> Word Source # (-) :: Word -> Word -> Word Source # (*) :: Word -> Word -> Word Source # negate :: Word -> Word Source # abs :: Word -> Word Source # signum :: Word -> Word Source # fromInteger :: Integer -> Word Source #
Read Word | Since: base-4.5.0.0
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Word Source # readList :: ReadS [Word] Source # readPrec :: ReadPrec Word Source # readListPrec :: ReadPrec [Word] Source #
Integral Word | Since: base-2.1
Instance details Defined in GHC.Internal.Real Methods quot :: Word -> Word -> Word Source # rem :: Word -> Word -> Word Source # div :: Word -> Word -> Word Source # mod :: Word -> Word -> Word Source # quotRem :: Word -> Word -> (Word, Word) Source # divMod :: Word -> Word -> (Word, Word) Source # toInteger :: Word -> Integer Source #
Real Word | Since: base-2.1
Instance details Defined in GHC.Internal.Real Methods toRational :: Word -> Rational Source #
Show Word | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Word -> ShowS Source # show :: Word -> String Source # showList :: [Word] -> ShowS Source #
Eq Word |
Instance details Defined in GHC.Classes Methods (==) :: Word -> Word -> Bool Source # (/=) :: Word -> Word -> Bool Source #
Ord Word |
Instance details Defined in GHC.Classes Methods compare :: Word -> Word -> Ordering Source # (<) :: Word -> Word -> Bool Source # (<=) :: Word -> Word -> Bool Source # (>) :: Word -> Word -> Bool Source # (>=) :: Word -> Word -> Bool Source # max :: Word -> Word -> Word Source # min :: Word -> Word -> Word Source #
Hashable Word |
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Word -> Int Source # hash :: Word -> Int Source #
Pretty Word |
Instance details Defined in Prettyprinter.Internal Methods pretty :: Word -> Doc ann # prettyList :: [Word] -> Doc ann #
Prim Word |

Instance details

Defined in Data.Primitive.Types

Methods

sizeOfType# :: Proxy Word -> Int# Source #

sizeOf# :: Word -> Int# Source #

alignmentOfType# :: Proxy Word -> Int# Source #

alignment# :: Word -> Int# Source #

indexByteArray# :: ByteArray# -> Int# -> Word Source #

readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Word #) Source #

writeByteArray# :: MutableByteArray# s -> Int# -> Word -> State# s -> State# s Source #

setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word -> State# s -> State# s Source #

indexOffAddr# :: Addr# -> Int# -> Word Source #

readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Word #) Source #

writeOffAddr# :: Addr# -> Int# -> Word -> State# s -> State# s Source #

setOffAddr# :: Addr# -> Int# -> Int# -> Word -> State# s -> State# s Source #

Random Word |
Instance details Defined in System.Random Methods randomR :: RandomGen g => (Word, Word) -> g -> (Word, g) random :: RandomGen g => g -> (Word, g) randomRs :: RandomGen g => (Word, Word) -> g -> [Word] randoms :: RandomGen g => g -> [Word]
Uniform Word |
Instance details Defined in System.Random.Internal Methods uniformM :: StatefulGen g m => g -> m Word
UniformRange Word |
Instance details Defined in System.Random.Internal Methods uniformRM :: StatefulGen g m => (Word, Word) -> g -> m Word
Unbox Word |
Instance details Defined in Data.Vector.Unboxed.Base
Lift Word |
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Quote m => Word -> m Exp Source # liftTyped :: forall (m :: Type -> Type). Quote m => Word -> Code m Word Source #
Vector Vector Word |

Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: Mutable Vector s Word -> ST s (Vector Word)

basicUnsafeThaw :: Vector Word -> ST s (Mutable Vector s Word)

basicLength :: Vector Word -> Int

basicUnsafeSlice :: Int -> Int -> Vector Word -> Vector Word

basicUnsafeIndexM :: Vector Word -> Int -> Box Word

basicUnsafeCopy :: Mutable Vector s Word -> Vector Word -> ST s ()

elemseq :: Vector Word -> Word -> b -> b

MVector MVector Word |

Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Word -> Int

basicUnsafeSlice :: Int -> Int -> MVector s Word -> MVector s Word

basicOverlaps :: MVector s Word -> MVector s Word -> Bool

basicUnsafeNew :: Int -> ST s (MVector s Word)

basicInitialize :: MVector s Word -> ST s ()

basicUnsafeReplicate :: Int -> Word -> ST s (MVector s Word)

basicUnsafeRead :: MVector s Word -> Int -> ST s Word

basicUnsafeWrite :: MVector s Word -> Int -> Word -> ST s ()

basicClear :: MVector s Word -> ST s ()

basicSet :: MVector s Word -> Word -> ST s ()

basicUnsafeCopy :: MVector s Word -> MVector s Word -> ST s ()

basicUnsafeMove :: MVector s Word -> MVector s Word -> ST s ()

basicUnsafeGrow :: MVector s Word -> Int -> ST s (MVector s Word)

From Word16 Word | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Word16 -> Word Source #
From Word8 Word | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Word8 -> Word Source #
From Word Word64 | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Word -> Word64 Source #
From Word Integer | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Word -> Integer Source #
From Word Natural | Uses `fromIntegral`.
Instance details Defined in Witch.Instances Methods from :: Word -> Natural Source #
TryFrom Int16 Word | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Int16 -> Either (TryFromException Int16 Word) Word Source #
TryFrom Int32 Word | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Int32 -> Either (TryFromException Int32 Word) Word Source #
TryFrom Int64 Word | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Int64 -> Either (TryFromException Int64 Word) Word Source #
TryFrom Int8 Word | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Int8 -> Either (TryFromException Int8 Word) Word Source #
TryFrom Word32 Word | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Word32 -> Either (TryFromException Word32 Word) Word Source #
TryFrom Word64 Word | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Word64 -> Either (TryFromException Word64 Word) Word Source #
TryFrom Integer Word | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Integer -> Either (TryFromException Integer Word) Word Source #
TryFrom Natural Word | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Natural -> Either (TryFromException Natural Word) Word Source #
TryFrom Double Word | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Double -> Either (TryFromException Double Word) Word Source #
TryFrom Float Word | Converts via `Integer`.
Instance details Defined in Witch.Instances Methods tryFrom :: Float -> Either (TryFromException Float Word) Word Source #
TryFrom Int Word | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Int -> Either (TryFromException Int Word) Word Source #
TryFrom Word Int16 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Word -> Either (TryFromException Word Int16) Int16 Source #
TryFrom Word Int32 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Word -> Either (TryFromException Word Int32) Int32 Source #
TryFrom Word Int64 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Word -> Either (TryFromException Word Int64) Int64 Source #
TryFrom Word Int8 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Word -> Either (TryFromException Word Int8) Int8 Source #
TryFrom Word Word16 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Word -> Either (TryFromException Word Word16) Word16 Source #
TryFrom Word Word32 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Word -> Either (TryFromException Word Word32) Word32 Source #
TryFrom Word Word8 | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Word -> Either (TryFromException Word Word8) Word8 Source #
TryFrom Word Double | Uses `fromIntegral` when the input is less than or equal to 9,007,199,254,740,991.
Instance details Defined in Witch.Instances Methods tryFrom :: Word -> Either (TryFromException Word Double) Double Source #
TryFrom Word Float | Uses `fromIntegral` when the input is less than or equal to 16,777,215.
Instance details Defined in Witch.Instances Methods tryFrom :: Word -> Either (TryFromException Word Float) Float Source #
TryFrom Word Int | Uses `toIntegralSized`.
Instance details Defined in Witch.Instances Methods tryFrom :: Word -> Either (TryFromException Word Int) Int Source #
Generic1 (URec Word :: k -> Type) |

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep1 (URec Word :: k -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep1 (URec Word :: k -> Type) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UWord" 'PrefixI 'True) (S1 ('MetaSel ('Just "uWord#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UWord :: k -> Type)))

Methods

from1 :: forall (a :: k). URec Word a -> Rep1 (URec Word :: k -> Type) a Source #

to1 :: forall (a :: k). Rep1 (URec Word :: k -> Type) a -> URec Word a Source #

Eq1 (UWord :: Type -> Type) |
Instance details Defined in Data.Orphans Methods liftEq :: (a -> b -> Bool) -> UWord a -> UWord b -> Bool Source #
Ord1 (UWord :: Type -> Type) |
Instance details Defined in Data.Orphans Methods liftCompare :: (a -> b -> Ordering) -> UWord a -> UWord b -> Ordering Source #
Show1 (UWord :: Type -> Type) |
Instance details Defined in Data.Orphans Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> UWord a -> ShowS Source # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [UWord a] -> ShowS Source #
Foldable (UWord :: Type -> Type) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => UWord m -> m Source #

foldMap :: Monoid m => (a -> m) -> UWord a -> m Source #

foldMap' :: Monoid m => (a -> m) -> UWord a -> m Source #

foldr :: (a -> b -> b) -> b -> UWord a -> b Source #

foldr' :: (a -> b -> b) -> b -> UWord a -> b Source #

foldl :: (b -> a -> b) -> b -> UWord a -> b Source #

foldl' :: (b -> a -> b) -> b -> UWord a -> b Source #

foldr1 :: (a -> a -> a) -> UWord a -> a Source #

foldl1 :: (a -> a -> a) -> UWord a -> a Source #

toList :: UWord a -> [a] Source #

null :: UWord a -> Bool Source #

length :: UWord a -> Int Source #

elem :: Eq a => a -> UWord a -> Bool Source #

maximum :: Ord a => UWord a -> a Source #

minimum :: Ord a => UWord a -> a Source #

sum :: Num a => UWord a -> a Source #

product :: Num a => UWord a -> a Source #

Traversable (UWord :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> UWord a -> f (UWord b) Source # sequenceA :: Applicative f => UWord (f a) -> f (UWord a) Source # mapM :: Monad m => (a -> m b) -> UWord a -> m (UWord b) Source # sequence :: Monad m => UWord (m a) -> m (UWord a) Source #
Functor (URec Word :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> URec Word a -> URec Word b Source # (<$) :: a -> URec Word b -> URec Word a Source #
Generic (URec Word p) |

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep (URec Word p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep (URec Word p) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UWord" 'PrefixI 'True) (S1 ('MetaSel ('Just "uWord#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UWord :: Type -> Type)))

Methods

from :: URec Word p -> Rep (URec Word p) x Source #

to :: Rep (URec Word p) x -> URec Word p Source #

Show (URec Word p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods showsPrec :: Int -> URec Word p -> ShowS Source # show :: URec Word p -> String Source # showList :: [URec Word p] -> ShowS Source #
Eq (URec Word p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (==) :: URec Word p -> URec Word p -> Bool Source # (/=) :: URec Word p -> URec Word p -> Bool Source #
Ord (URec Word p) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

compare :: URec Word p -> URec Word p -> Ordering Source #

(<) :: URec Word p -> URec Word p -> Bool Source #

(<=) :: URec Word p -> URec Word p -> Bool Source #

(>) :: URec Word p -> URec Word p -> Bool Source #

(>=) :: URec Word p -> URec Word p -> Bool Source #

max :: URec Word p -> URec Word p -> URec Word p Source #

min :: URec Word p -> URec Word p -> URec Word p Source #

type Signed Word |
Instance details Defined in Data.Bytes.Signed type Signed Word = Int
type Unsigned Word |
Instance details Defined in Data.Bytes.Signed type Unsigned Word = Word
newtype Vector Word |
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Word = V_Word (Vector Word)
data URec Word (p :: k) | Used for marking occurrences of `Word#` Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

data URec Word (p :: k) = UWord {

- uWord# :: Word#

}

newtype MVector s Word |
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Word = MV_Word (MVector s Word)
type Rep1 (URec Word :: k -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep1 (URec Word :: k -> Type) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UWord" 'PrefixI 'True) (S1 ('MetaSel ('Just "uWord#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UWord :: k -> Type)))
type Rep (URec Word p) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics type Rep (URec Word p) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" 'False) (C1 ('MetaCons "UWord" 'PrefixI 'True) (S1 ('MetaSel ('Just "uWord#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UWord :: Type -> Type)))

data Ordering Source #

Constructors

LT |
EQ |
GT |

#### Instances

Instances details

Arbitrary Ordering |
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen Ordering Source # shrink :: Ordering -> [Ordering] Source #
CoArbitrary Ordering |
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Ordering -> Gen b -> Gen b Source #
Function Ordering |
Instance details Defined in Test.QuickCheck.Function Methods function :: (Ordering -> b) -> Ordering :-> b Source #
Binary Ordering |
Instance details Defined in Data.Binary.Class Methods put :: Ordering -> Put Source # get :: Get Ordering Source # putList :: [Ordering] -> Put Source #
NFData Ordering |
Instance details Defined in Control.DeepSeq Methods rnf :: Ordering -> () Source #
Monoid Ordering | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods mempty :: Ordering Source # mappend :: Ordering -> Ordering -> Ordering Source # mconcat :: [Ordering] -> Ordering Source #
Semigroup Ordering | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: Ordering -> Ordering -> Ordering Source # sconcat :: NonEmpty Ordering -> Ordering Source # stimes :: Integral b => b -> Ordering -> Ordering Source #
Bounded Ordering | Since: base-2.1
Instance details Defined in GHC.Internal.Enum Methods minBound :: Ordering Source # maxBound :: Ordering Source #
Enum Ordering | Since: base-2.1

Instance details

Defined in GHC.Internal.Enum

Methods

succ :: Ordering -> Ordering Source #

pred :: Ordering -> Ordering Source #

toEnum :: Int -> Ordering Source #

fromEnum :: Ordering -> Int Source #

enumFrom :: Ordering -> [Ordering] Source #

enumFromThen :: Ordering -> Ordering -> [Ordering] Source #

enumFromTo :: Ordering -> Ordering -> [Ordering] Source #

enumFromThenTo :: Ordering -> Ordering -> Ordering -> [Ordering] Source #

Generic Ordering |

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep Ordering | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Generics type Rep Ordering = D1 ('MetaData "Ordering" "GHC.Types" "ghc-prim" 'False) (C1 ('MetaCons "LT" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "EQ" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "GT" 'PrefixI 'False) (U1 :: Type -> Type)))

Methods

from :: Ordering -> Rep Ordering x Source #

to :: Rep Ordering x -> Ordering Source #

Ix Ordering | Since: base-2.1
Instance details Defined in GHC.Internal.Ix Methods range :: (Ordering, Ordering) -> [Ordering] Source # index :: (Ordering, Ordering) -> Ordering -> Int Source # unsafeIndex :: (Ordering, Ordering) -> Ordering -> Int Source # inRange :: (Ordering, Ordering) -> Ordering -> Bool Source # rangeSize :: (Ordering, Ordering) -> Int Source # unsafeRangeSize :: (Ordering, Ordering) -> Int Source #
Read Ordering | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS Ordering Source # readList :: ReadS [Ordering] Source # readPrec :: ReadPrec Ordering Source # readListPrec :: ReadPrec [Ordering] Source #
Show Ordering | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> Ordering -> ShowS Source # show :: Ordering -> String Source # showList :: [Ordering] -> ShowS Source #
Eq Ordering |
Instance details Defined in GHC.Classes Methods (==) :: Ordering -> Ordering -> Bool Source # (/=) :: Ordering -> Ordering -> Bool Source #
Ord Ordering |
Instance details Defined in GHC.Classes Methods compare :: Ordering -> Ordering -> Ordering Source # (<) :: Ordering -> Ordering -> Bool Source # (<=) :: Ordering -> Ordering -> Bool Source # (>) :: Ordering -> Ordering -> Bool Source # (>=) :: Ordering -> Ordering -> Bool Source # max :: Ordering -> Ordering -> Ordering Source # min :: Ordering -> Ordering -> Ordering Source #
Hashable Ordering |
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Ordering -> Int Source # hash :: Ordering -> Int Source #
type Rep Ordering | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Generics type Rep Ordering = D1 ('MetaData "Ordering" "GHC.Types" "ghc-prim" 'False) (C1 ('MetaCons "LT" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "EQ" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "GT" 'PrefixI 'False) (U1 :: Type -> Type)))

class a ~# b => (a :: k) ~ (b :: k) infix 4 Source #

Lifted, homogeneous equality. By lifted, we mean that it can be bogus (deferred type error). By homogeneous, the two types `a` and `b` must have the same kinds.

realToFrac :: (Real a, Fractional b) => a -> b Source #

General coercion to `Fractional` types.

WARNING: This function goes through the `Rational` type, which does not have values for `NaN` for example. This means it does not round-trip.

For `Double` it also behaves differently with or without -O0:

    Prelude> realToFrac nan -- With -O0
    -Infinity
    Prelude> realToFrac nan
    NaN

class (Num a, Ord a) => Real a where Source #

Real numbers.

The Haskell report defines no laws for `Real`, however `Real` instances are customarily expected to adhere to the following law:

Coherence with `fromRational`
  if the type also implements `Fractional`, then `fromRational` is a left inverse for `toRational`, i.e. `fromRational (toRational i) = i`

The law does not hold for `Float`, `Double`, `CFloat`, `CDouble`, etc., because these types contain non-finite values, which cannot be roundtripped through `Rational`.

Methods

toRational :: a -> Rational Source #

Rational equivalent of its real argument with full precision.

#### Instances

Instances details

Real CBool |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CBool -> Rational Source #
Real CChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CChar -> Rational Source #
Real CClock |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CClock -> Rational Source #
Real CDouble |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CDouble -> Rational Source #
Real CFloat |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CFloat -> Rational Source #
Real CInt |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CInt -> Rational Source #
Real CIntMax |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CIntMax -> Rational Source #
Real CIntPtr |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CIntPtr -> Rational Source #
Real CLLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CLLong -> Rational Source #
Real CLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CLong -> Rational Source #
Real CPtrdiff |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CPtrdiff -> Rational Source #
Real CSChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CSChar -> Rational Source #
Real CSUSeconds |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CSUSeconds -> Rational Source #
Real CShort |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CShort -> Rational Source #
Real CSigAtomic |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CSigAtomic -> Rational Source #
Real CSize |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CSize -> Rational Source #
Real CTime |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CTime -> Rational Source #
Real CUChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CUChar -> Rational Source #
Real CUInt |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CUInt -> Rational Source #
Real CUIntMax |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CUIntMax -> Rational Source #
Real CUIntPtr |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CUIntPtr -> Rational Source #
Real CULLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CULLong -> Rational Source #
Real CULong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CULong -> Rational Source #
Real CUSeconds |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CUSeconds -> Rational Source #
Real CUShort |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CUShort -> Rational Source #
Real CWchar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CWchar -> Rational Source #
Real Int16 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods toRational :: Int16 -> Rational Source #
Real Int32 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods toRational :: Int32 -> Rational Source #
Real Int64 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods toRational :: Int64 -> Rational Source #
Real Int8 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods toRational :: Int8 -> Rational Source #
Real Word16 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods toRational :: Word16 -> Rational Source #
Real Word32 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods toRational :: Word32 -> Rational Source #
Real Word64 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods toRational :: Word64 -> Rational Source #
Real Word8 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods toRational :: Word8 -> Rational Source #
Real Scientific |
Instance details Defined in Data.Scientific Methods toRational :: Scientific -> Rational Source #
Real I8 |
Instance details Defined in Data.Text.Foreign Methods toRational :: I8 -> Rational Source #
Real DiffTime |
Instance details Defined in Data.Time.Clock.Internal.DiffTime Methods toRational :: DiffTime -> Rational Source #
Real NominalDiffTime |
Instance details Defined in Data.Time.Clock.Internal.NominalDiffTime Methods toRational :: NominalDiffTime -> Rational Source #
Real Integer | Since: base-2.0.1
Instance details Defined in GHC.Internal.Real Methods toRational :: Integer -> Rational Source #
Real Natural | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Real Methods toRational :: Natural -> Rational Source #

Real Double

Beware that `toRational` generates garbage for non-finite arguments:

    >>> toRational (1/0)
    179769313 (and 300 more digits...) % 1
    >>> toRational (0/0)
    269653970 (and 300 more digits...) % 1

Since: base-2.1

Instance details Defined in GHC.Internal.Float Methods toRational :: Double -> Rational Source #

Real Float

Beware that `toRational` generates garbage for non-finite arguments:

    >>> toRational (1/0 :: Float)
    340282366920938463463374607431768211456 % 1
    >>> toRational (0/0 :: Float)
    510423550381407695195061911147652317184 % 1

Since: base-2.1

Instance details Defined in GHC.Internal.Float Methods toRational :: Float -> Rational Source #
Real Int | Since: base-2.0.1
Instance details Defined in GHC.Internal.Real Methods toRational :: Int -> Rational Source #
Real Word | Since: base-2.1
Instance details Defined in GHC.Internal.Real Methods toRational :: Word -> Rational Source #
Real a => Real (Blind a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods toRational :: Blind a -> Rational Source #
Real a => Real (Fixed a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods toRational :: Fixed a -> Rational Source #
Real a => Real (Large a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods toRational :: Large a -> Rational Source #
Real a => Real (Shrink2 a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods toRational :: Shrink2 a -> Rational Source #
Real a => Real (Small a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods toRational :: Small a -> Rational Source #
Real n => Real (VarInt n) |
Instance details Defined in Data.Bytes.VarInt Methods toRational :: VarInt n -> Rational Source #
Real a => Real (Identity a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Functor.Identity Methods toRational :: Identity a -> Rational Source #
Real a => Real (Down a) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Data.Ord Methods toRational :: Down a -> Rational Source #
Integral a => Real (Ratio a) | Since: base-2.0.1
Instance details Defined in GHC.Internal.Real Methods toRational :: Ratio a -> Rational Source #
HasResolution a => Real (Fixed a) | Since: base-2.1
Instance details Defined in Data.Fixed Methods toRational :: Fixed a -> Rational Source #
Real a => Real (Const a b) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Functor.Const Methods toRational :: Const a b -> Rational Source #
Real a => Real (Tagged s a) |
Instance details Defined in Data.Tagged Methods toRational :: Tagged s a -> Rational Source #
Real (f (g a)) => Real (Compose f g a) | Since: base-4.19.0.0
Instance details Defined in Data.Functor.Compose Methods toRational :: Compose f g a -> Rational Source #

class Num a => Fractional a where Source #

Fractional numbers, supporting real division.

The Haskell Report defines no laws for `Fractional`. However, `(`+`)` and `(`*`)` are customarily expected to define a division ring and have the following properties:

`recip` gives the multiplicative inverse
  `x * recip x` = `recip x * x` = `fromInteger 1`
Totality of `toRational`
  `toRational` is total
Coherence with `toRational`
  if the type also implements `Real`, then `fromRational` is a left inverse for `toRational`, i.e. `fromRational (toRational i) = i`

Note that it isn't customarily expected that a type instance of `Fractional` implement a field. However, all instances in `base` do.

Minimal complete definition

fromRational, (recip | (/))

Methods

(/) :: a -> a -> a infixl 7 Source #

Fractional division.

recip :: a -> a Source #

Reciprocal fraction.

fromRational :: Rational -> a Source #

Conversion from a `Rational` (that is ``Ratio` `Integer``). A floating literal stands for an application of `fromRational` to a value of type `Rational`, so such literals have type `(`Fractional` a) => a`.

#### Instances

Instances details

Fractional CDouble |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (/) :: CDouble -> CDouble -> CDouble Source # recip :: CDouble -> CDouble Source # fromRational :: Rational -> CDouble Source #
Fractional CFloat |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (/) :: CFloat -> CFloat -> CFloat Source # recip :: CFloat -> CFloat Source # fromRational :: Rational -> CFloat Source #
Fractional Scientific |
Instance details Defined in Data.Scientific Methods (/) :: Scientific -> Scientific -> Scientific Source # recip :: Scientific -> Scientific Source # fromRational :: Rational -> Scientific Source #
Fractional DiffTime |
Instance details Defined in Data.Time.Clock.Internal.DiffTime Methods (/) :: DiffTime -> DiffTime -> DiffTime Source # recip :: DiffTime -> DiffTime Source # fromRational :: Rational -> DiffTime Source #
Fractional NominalDiffTime |
Instance details Defined in Data.Time.Clock.Internal.NominalDiffTime Methods (/) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime Source # recip :: NominalDiffTime -> NominalDiffTime Source # fromRational :: Rational -> NominalDiffTime Source #

Fractional Double

This instance implements IEEE 754 standard with all its usual pitfalls about NaN, infinities and negative zero.

    >>> 0 == (-0 :: Double)
    True
    >>> recip 0 == recip (-0 :: Double)
    False
    >>> map (/ 0) [-1, 0, 1]
    [-Infinity,NaN,Infinity]
    >>> map (* 0) $ map (/ 0) [-1, 0, 1]
    [NaN,NaN,NaN]

Since: base-2.1

Instance details Defined in GHC.Internal.Float Methods (/) :: Double -> Double -> Double Source # recip :: Double -> Double Source # fromRational :: Rational -> Double Source #

Fractional Float

This instance implements IEEE 754 standard with all its usual pitfalls about NaN, infinities and negative zero.

    >>> 0 == (-0 :: Float)
    True
    >>> recip 0 == recip (-0 :: Float)
    False
    >>> map (/ 0) [-1, 0, 1 :: Float]
    [-Infinity,NaN,Infinity]
    >>> map (* 0) $ map (/ 0) [-1, 0, 1 :: Float]
    [NaN,NaN,NaN]

Since: base-2.1

Instance details Defined in GHC.Internal.Float Methods (/) :: Float -> Float -> Float Source # recip :: Float -> Float Source # fromRational :: Rational -> Float Source #
RealFloat a => Fractional (Complex a) | Since: base-2.1
Instance details Defined in Data.Complex Methods (/) :: Complex a -> Complex a -> Complex a Source # recip :: Complex a -> Complex a Source # fromRational :: Rational -> Complex a Source #
Fractional a => Fractional (Identity a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Functor.Identity Methods (/) :: Identity a -> Identity a -> Identity a Source # recip :: Identity a -> Identity a Source # fromRational :: Rational -> Identity a Source #
Fractional a => Fractional (Down a) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Data.Ord Methods (/) :: Down a -> Down a -> Down a Source # recip :: Down a -> Down a Source # fromRational :: Rational -> Down a Source #
Integral a => Fractional (Ratio a) | Since: base-2.0.1
Instance details Defined in GHC.Internal.Real Methods (/) :: Ratio a -> Ratio a -> Ratio a Source # recip :: Ratio a -> Ratio a Source # fromRational :: Rational -> Ratio a Source #
Fractional a => Fractional (Plucker a) |
Instance details Defined in Linear.Plucker Methods (/) :: Plucker a -> Plucker a -> Plucker a Source # recip :: Plucker a -> Plucker a Source # fromRational :: Rational -> Plucker a Source #
RealFloat a => Fractional (Quaternion a) |
Instance details Defined in Linear.Quaternion Methods (/) :: Quaternion a -> Quaternion a -> Quaternion a Source # recip :: Quaternion a -> Quaternion a Source # fromRational :: Rational -> Quaternion a Source #
Fractional (V0 a) |
Instance details Defined in Linear.V0 Methods (/) :: V0 a -> V0 a -> V0 a Source # recip :: V0 a -> V0 a Source # fromRational :: Rational -> V0 a Source #
Fractional a => Fractional (V1 a) |
Instance details Defined in Linear.V1 Methods (/) :: V1 a -> V1 a -> V1 a Source # recip :: V1 a -> V1 a Source # fromRational :: Rational -> V1 a Source #
Fractional a => Fractional (V2 a) |
Instance details Defined in Linear.V2 Methods (/) :: V2 a -> V2 a -> V2 a Source # recip :: V2 a -> V2 a Source # fromRational :: Rational -> V2 a Source #
Fractional a => Fractional (V3 a) |
Instance details Defined in Linear.V3 Methods (/) :: V3 a -> V3 a -> V3 a Source # recip :: V3 a -> V3 a Source # fromRational :: Rational -> V3 a Source #
Fractional a => Fractional (V4 a) |
Instance details Defined in Linear.V4 Methods (/) :: V4 a -> V4 a -> V4 a Source # recip :: V4 a -> V4 a Source # fromRational :: Rational -> V4 a Source #
Fractional a => Fractional (V2 a) |
Instance details Defined in SDL.Internal.Vect Methods (/) :: V2 a -> V2 a -> V2 a Source # recip :: V2 a -> V2 a Source # fromRational :: Rational -> V2 a Source #
Fractional a => Fractional (V3 a) |
Instance details Defined in SDL.Internal.Vect Methods (/) :: V3 a -> V3 a -> V3 a Source # recip :: V3 a -> V3 a Source # fromRational :: Rational -> V3 a Source #
Fractional a => Fractional (V4 a) |
Instance details Defined in SDL.Internal.Vect Methods (/) :: V4 a -> V4 a -> V4 a Source # recip :: V4 a -> V4 a Source # fromRational :: Rational -> V4 a Source #
Fractional a => Fractional (Q a) |
Instance details Defined in Data.Reflection Methods (/) :: Q a -> Q a -> Q a Source # recip :: Q a -> Q a Source # fromRational :: Rational -> Q a Source #
HasResolution a => Fractional (Fixed a) | Since: base-2.1
Instance details Defined in Data.Fixed Methods (/) :: Fixed a -> Fixed a -> Fixed a Source # recip :: Fixed a -> Fixed a Source # fromRational :: Rational -> Fixed a Source #
Fractional a => Fractional (Op a b) |
Instance details Defined in Data.Functor.Contravariant Methods (/) :: Op a b -> Op a b -> Op a b Source # recip :: Op a b -> Op a b Source # fromRational :: Rational -> Op a b Source #
Fractional (f a) => Fractional (Point f a) |
Instance details Defined in Linear.Affine Methods (/) :: Point f a -> Point f a -> Point f a Source # recip :: Point f a -> Point f a Source # fromRational :: Rational -> Point f a Source #
Fractional (f a) => Fractional (Point f a) |
Instance details Defined in SDL.Internal.Vect Methods (/) :: Point f a -> Point f a -> Point f a Source # recip :: Point f a -> Point f a Source # fromRational :: Rational -> Point f a Source #
Fractional a => Fractional (Const a b) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Functor.Const Methods (/) :: Const a b -> Const a b -> Const a b Source # recip :: Const a b -> Const a b Source # fromRational :: Rational -> Const a b Source #
(Dim n, Fractional a) => Fractional (V n a) |
Instance details Defined in Linear.V Methods (/) :: V n a -> V n a -> V n a Source # recip :: V n a -> V n a Source # fromRational :: Rational -> V n a Source #
Fractional a => Fractional (Tagged s a) |
Instance details Defined in Data.Tagged Methods (/) :: Tagged s a -> Tagged s a -> Tagged s a Source # recip :: Tagged s a -> Tagged s a Source # fromRational :: Rational -> Tagged s a Source #
Fractional (f (g a)) => Fractional (Compose f g a) | Since: base-4.20.0.0
Instance details Defined in Data.Functor.Compose Methods (/) :: Compose f g a -> Compose f g a -> Compose f g a Source # recip :: Compose f g a -> Compose f g a Source # fromRational :: Rational -> Compose f g a Source #

type Rational = Ratio Integer Source #

Arbitrary-precision rational numbers, represented as a ratio of two `Integer` values. A rational number may be constructed using the `%` operator.

($) :: (a -> b) -> a -> b infixr 0 Source #

``($)`` is the function application operator.

Applying ``($)`` to a function `f` and an argument `x` gives the same result as applying `f` to `x` directly. The definition is akin to this:

    ($) :: (a -> b) -> a -> b
    ($) f x = f x

This is ``id`` specialized from `a -> a` to `(a -> b) -> (a -> b)` which by the associativity of `(->)` is the same as `(a -> b) -> a -> b`.

On the face of it, this may appear pointless! But it's actually one of the most useful and important operators in Haskell.

The order of operations is very different between `($)` and normal function application. Normal function application has precedence 10 - higher than any operator - and associates to the left. So these two definitions are equivalent:

    expr = min 5 1 + 5
    expr = ((min 5) 1) + 5

`($)` has precedence 0 (the lowest) and associates to the right, so these are equivalent:

    expr = min 5 $ 1 + 5
    expr = (min 5) (1 + 5)

#### Examples

Expand

A common use cases of `($)` is to avoid parentheses in complex expressions.

For example, instead of using nested parentheses in the following Haskell function:

    -- | Sum numbers in a string: strSum "100  5 -7" == 98
    strSum :: String -> Int
    strSum s = sum (mapMaybe readMaybe (words s))

we can deploy the function application operator:

    -- | Sum numbers in a string: strSum "100  5 -7" == 98
    strSum :: String -> Int
    strSum s = sum $ mapMaybe readMaybe $ words s

`($)` is also used as a section (a partially applied operator), in order to indicate that we wish to apply some yet-unspecified function to a given value. For example, to apply the argument `5` to a list of functions:

    applyFive :: [Int]
    applyFive = map ($ 5) [(+1), (2^)]
    >>> [6, 32]

#### Technical Remark (Representation Polymorphism)

Expand

`($)` is fully representation-polymorphic. This allows it to also be used with arguments of unlifted and even unboxed kinds, such as unboxed integers:

    fastMod :: Int -> Int -> Int
    fastMod (I# x) (I# m) = I# $ remInt# x m

otherwise :: Bool Source #

`otherwise` is defined as the value `True`. It helps to make guards more readable. eg.

     f x | x < 0     = ...
         | otherwise = ...

(++) :: [a] -> [a] -> [a] infixr 5 Source #

`(++)` appends two lists, i.e.,

    [x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn]
    [x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]

If the first list is not finite, the result is the first list.

#### Performance considerations

Expand

This function takes linear time in the number of elements of the first list. Thus it is better to associate repeated applications of `(++)` to the right (which is the default behaviour): `xs ++ (ys ++ zs)` or simply `xs ++ ys ++ zs`, but not `(xs ++ ys) ++ zs`. For the same reason `concat` `=` `foldr` `(++)` `[]` has linear performance, while `foldl` `(++)` `[]` is prone to quadratic slowdown

#### Examples

Expand

    >>> [1, 2, 3] ++ [4, 5, 6]
    [1,2,3,4,5,6]

    >>> [] ++ [1, 2, 3]
    [1,2,3]

    >>> [3, 2, 1] ++ []
    [3,2,1]

class Foldable (t :: Type -> Type) where Source #

The Foldable class represents data structures that can be reduced to a summary value one element at a time. Strict left-associative folds are a good fit for space-efficient reduction, while lazy right-associative folds are a good fit for corecursive iteration, or for folds that short-circuit after processing an initial subsequence of the structure's elements.

Instances can be derived automatically by enabling the `DeriveFoldable` extension. For example, a derived instance for a binary tree might be:

    {-# LANGUAGE DeriveFoldable #-}
    data Tree a = Empty
                | Leaf a
                | Node (Tree a) a (Tree a)
        deriving Foldable

A more detailed description can be found in the Overview section of Data.Foldable.

For the class laws see the Laws section of Data.Foldable.

Minimal complete definition

foldMap | foldr

Methods

foldMap :: Monoid m => (a -> m) -> t a -> m Source #

Map each element of the structure into a monoid, and combine the results with `(`<>`)`. This fold is right-associative and lazy in the accumulator. For strict left-associative folds consider `foldMap'` instead.

#### Examples

Expand

Basic usage:

    >>> foldMap Sum [1, 3, 5]
    Sum {getSum = 9}

    >>> foldMap Product [1, 3, 5]
    Product {getProduct = 15}

    >>> foldMap (replicate 3) [1, 2, 3]
    [1,1,1,2,2,2,3,3,3]

When a Monoid's `(`<>`)` is lazy in its second argument, `foldMap` can return a result even from an unbounded structure. For example, lazy accumulation enables Data.ByteString.Builder to efficiently serialise large data structures and produce the output incrementally:

    >>> import qualified Data.ByteString.Lazy as L
    >>> import qualified Data.ByteString.Builder as B
    >>> let bld :: Int -> B.Builder; bld i = B.intDec i <> B.word8 0x20
    >>> let lbs = B.toLazyByteString $ foldMap bld [0..]
    >>> L.take 64 lbs
    "0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24"

foldr :: (a -> b -> b) -> b -> t a -> b Source #

Right-associative fold of a structure, lazy in the accumulator.

In the case of lists, `foldr`, when applied to a binary operator, a starting value (typically the right-identity of the operator), and a list, reduces the list using the binary operator, from right to left:

    foldr f z [x1, x2, ..., xn] == x1 `f` (x2 `f` ... (xn `f` z)...)

Note that since the head of the resulting expression is produced by an application of the operator to the first element of the list, given an operator lazy in its right argument, `foldr` can produce a terminating expression from an unbounded list.

For a general `Foldable` structure this should be semantically identical to,

    foldr f z = foldr f z . toList

#### Examples

Expand

Basic usage:

    >>> foldr (||) False [False, True, False]
    True

    >>> foldr (||) False []
    False

    >>> foldr (\c acc -> acc ++ [c]) "foo" ['a', 'b', 'c', 'd']
    "foodcba"

##### Infinite structures

⚠️ Applying `foldr` to infinite structures usually doesn't terminate.

It may still terminate under one of the following conditions:

- the folding function is short-circuiting
- the folding function is lazy on its second argument

###### Short-circuiting

`(`||`)` short-circuits on `True` values, so the following terminates because there is a `True` value finitely far from the left side:

    >>> foldr (||) False (True : repeat False)
    True

But the following doesn't terminate:

    >>> foldr (||) False (repeat False ++ [True])
    * Hangs forever *

###### Laziness in the second argument

Applying `foldr` to infinite structures terminates when the operator is lazy in its second argument (the initial accumulator is never used in this case, and so could be left `undefined`, but `[]` is more clear):

    >>> take 5 $ foldr (\i acc -> i : fmap (+3) acc) [] (repeat 1)
    [1,4,7,10,13]

foldl' :: (b -> a -> b) -> b -> t a -> b Source #

Left-associative fold of a structure but with strict application of the operator.

This ensures that each step of the fold is forced to Weak Head Normal Form before being applied, avoiding the collection of thunks that would otherwise occur. This is often what you want to strictly reduce a finite structure to a single strict result (e.g. `sum`).

For a general `Foldable` structure this should be semantically identical to,

    foldl' f z = foldl' f z . toList

Since: base-4.6.0.0

foldr1 :: (a -> a -> a) -> t a -> a Source #

A variant of `foldr` that has no base case, and thus may only be applied to non-empty structures.

This function is non-total and will raise a runtime exception if the structure happens to be empty.

#### Examples

Expand

Basic usage:

    >>> foldr1 (+) [1..4]
    10

    >>> foldr1 (+) []
    Exception: Prelude.foldr1: empty list

    >>> foldr1 (+) Nothing
    *** Exception: foldr1: empty structure

    >>> foldr1 (-) [1..4]
    -2

    >>> foldr1 (&&) [True, False, True, True]
    False

    >>> foldr1 (||) [False, False, True, True]
    True

    >>> foldr1 (+) [1..]
    * Hangs forever *

elem :: Eq a => a -> t a -> Bool infix 4 Source #

Does the element occur in the structure?

Note: `elem` is often used in infix form.

#### Examples

Expand

Basic usage:

    >>> 3 `elem` []
    False

    >>> 3 `elem` [1,2]
    False

    >>> 3 `elem` [1,2,3,4,5]
    True

For infinite structures, the default implementation of `elem` terminates if the sought-after value exists at a finite distance from the left side of the structure:

    >>> 3 `elem` [1..]
    True

    >>> 3 `elem` ([4..] ++ [3])
    * Hangs forever *

Since: base-4.8.0.0

maximum :: Ord a => t a -> a Source #

The largest element of a non-empty structure.

This function is non-total and will raise a runtime exception if the structure happens to be empty. A structure that supports random access and maintains its elements in order should provide a specialised implementation to return the maximum in faster than linear time.

#### Examples

Expand

Basic usage:

    >>> maximum [1..10]
    10

    >>> maximum []
    *** Exception: Prelude.maximum: empty list

    >>> maximum Nothing
    *** Exception: maximum: empty structure

WARNING: This function is partial for possibly-empty structures like lists.

Since: base-4.8.0.0

minimum :: Ord a => t a -> a Source #

The least element of a non-empty structure.

This function is non-total and will raise a runtime exception if the structure happens to be empty. A structure that supports random access and maintains its elements in order should provide a specialised implementation to return the minimum in faster than linear time.

#### Examples

Expand

Basic usage:

    >>> minimum [1..10]
    1

    >>> minimum []
    *** Exception: Prelude.minimum: empty list

    >>> minimum Nothing
    *** Exception: minimum: empty structure

WARNING: This function is partial for possibly-empty structures like lists.

Since: base-4.8.0.0

product :: Num a => t a -> a Source #

The `product` function computes the product of the numbers of a structure.

#### Examples

Expand

Basic usage:

    >>> product []
    1

    >>> product [42]
    42

    >>> product [1..10]
    3628800

    >>> product [4.1, 2.0, 1.7]
    13.939999999999998

    >>> product [1..]
    * Hangs forever *

Since: base-4.8.0.0

#### Instances

Instances details

Foldable Strategy Source # |

Instance details

Defined in Game.LambdaHack.Client.AI.Strategy

Methods

fold :: Monoid m => Strategy m -> m Source #

foldMap :: Monoid m => (a -> m) -> Strategy a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Strategy a -> m Source #

foldr :: (a -> b -> b) -> b -> Strategy a -> b Source #

foldr' :: (a -> b -> b) -> b -> Strategy a -> b Source #

foldl :: (b -> a -> b) -> b -> Strategy a -> b Source #

foldl' :: (b -> a -> b) -> b -> Strategy a -> b Source #

foldr1 :: (a -> a -> a) -> Strategy a -> a Source #

foldl1 :: (a -> a -> a) -> Strategy a -> a Source #

toList :: Strategy a -> [a] Source #

null :: Strategy a -> Bool Source #

length :: Strategy a -> Int Source #

elem :: Eq a => a -> Strategy a -> Bool Source #

maximum :: Ord a => Strategy a -> a Source #

minimum :: Ord a => Strategy a -> a Source #

sum :: Num a => Strategy a -> a Source #

product :: Num a => Strategy a -> a Source #

Foldable Frequency Source # |

Instance details

Defined in Game.LambdaHack.Core.Frequency

Methods

fold :: Monoid m => Frequency m -> m Source #

foldMap :: Monoid m => (a -> m) -> Frequency a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Frequency a -> m Source #

foldr :: (a -> b -> b) -> b -> Frequency a -> b Source #

foldr' :: (a -> b -> b) -> b -> Frequency a -> b Source #

foldl :: (b -> a -> b) -> b -> Frequency a -> b Source #

foldl' :: (b -> a -> b) -> b -> Frequency a -> b Source #

foldr1 :: (a -> a -> a) -> Frequency a -> a Source #

foldl1 :: (a -> a -> a) -> Frequency a -> a Source #

toList :: Frequency a -> [a] Source #

null :: Frequency a -> Bool Source #

length :: Frequency a -> Int Source #

elem :: Eq a => a -> Frequency a -> Bool Source #

maximum :: Ord a => Frequency a -> a Source #

minimum :: Ord a => Frequency a -> a Source #

sum :: Num a => Frequency a -> a Source #

product :: Num a => Frequency a -> a Source #

Foldable KeyMap |

Instance details

Defined in Data.Aeson.KeyMap

Methods

fold :: Monoid m => KeyMap m -> m Source #

foldMap :: Monoid m => (a -> m) -> KeyMap a -> m Source #

foldMap' :: Monoid m => (a -> m) -> KeyMap a -> m Source #

foldr :: (a -> b -> b) -> b -> KeyMap a -> b Source #

foldr' :: (a -> b -> b) -> b -> KeyMap a -> b Source #

foldl :: (b -> a -> b) -> b -> KeyMap a -> b Source #

foldl' :: (b -> a -> b) -> b -> KeyMap a -> b Source #

foldr1 :: (a -> a -> a) -> KeyMap a -> a Source #

foldl1 :: (a -> a -> a) -> KeyMap a -> a Source #

toList :: KeyMap a -> [a] Source #

null :: KeyMap a -> Bool Source #

length :: KeyMap a -> Int Source #

elem :: Eq a => a -> KeyMap a -> Bool Source #

maximum :: Ord a => KeyMap a -> a Source #

minimum :: Ord a => KeyMap a -> a Source #

sum :: Num a => KeyMap a -> a Source #

product :: Num a => KeyMap a -> a Source #

Foldable IResult |

Instance details

Defined in Data.Aeson.Types.Internal

Methods

fold :: Monoid m => IResult m -> m Source #

foldMap :: Monoid m => (a -> m) -> IResult a -> m Source #

foldMap' :: Monoid m => (a -> m) -> IResult a -> m Source #

foldr :: (a -> b -> b) -> b -> IResult a -> b Source #

foldr' :: (a -> b -> b) -> b -> IResult a -> b Source #

foldl :: (b -> a -> b) -> b -> IResult a -> b Source #

foldl' :: (b -> a -> b) -> b -> IResult a -> b Source #

foldr1 :: (a -> a -> a) -> IResult a -> a Source #

foldl1 :: (a -> a -> a) -> IResult a -> a Source #

toList :: IResult a -> [a] Source #

null :: IResult a -> Bool Source #

length :: IResult a -> Int Source #

elem :: Eq a => a -> IResult a -> Bool Source #

maximum :: Ord a => IResult a -> a Source #

minimum :: Ord a => IResult a -> a Source #

sum :: Num a => IResult a -> a Source #

product :: Num a => IResult a -> a Source #

Foldable Result |

Instance details

Defined in Data.Aeson.Types.Internal

Methods

fold :: Monoid m => Result m -> m Source #

foldMap :: Monoid m => (a -> m) -> Result a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Result a -> m Source #

foldr :: (a -> b -> b) -> b -> Result a -> b Source #

foldr' :: (a -> b -> b) -> b -> Result a -> b Source #

foldl :: (b -> a -> b) -> b -> Result a -> b Source #

foldl' :: (b -> a -> b) -> b -> Result a -> b Source #

foldr1 :: (a -> a -> a) -> Result a -> a Source #

foldl1 :: (a -> a -> a) -> Result a -> a Source #

toList :: Result a -> [a] Source #

null :: Result a -> Bool Source #

length :: Result a -> Int Source #

elem :: Eq a => a -> Result a -> Bool Source #

maximum :: Ord a => Result a -> a Source #

minimum :: Ord a => Result a -> a Source #

sum :: Num a => Result a -> a Source #

product :: Num a => Result a -> a Source #

Foldable Complex | Since: base-4.9.0.0

Instance details

Defined in Data.Complex

Methods

fold :: Monoid m => Complex m -> m Source #

foldMap :: Monoid m => (a -> m) -> Complex a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Complex a -> m Source #

foldr :: (a -> b -> b) -> b -> Complex a -> b Source #

foldr' :: (a -> b -> b) -> b -> Complex a -> b Source #

foldl :: (b -> a -> b) -> b -> Complex a -> b Source #

foldl' :: (b -> a -> b) -> b -> Complex a -> b Source #

foldr1 :: (a -> a -> a) -> Complex a -> a Source #

foldl1 :: (a -> a -> a) -> Complex a -> a Source #

toList :: Complex a -> [a] Source #

null :: Complex a -> Bool Source #

length :: Complex a -> Int Source #

elem :: Eq a => a -> Complex a -> Bool Source #

maximum :: Ord a => Complex a -> a Source #

minimum :: Ord a => Complex a -> a Source #

sum :: Num a => Complex a -> a Source #

product :: Num a => Complex a -> a Source #

Foldable First | Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fold :: Monoid m => First m -> m Source #

foldMap :: Monoid m => (a -> m) -> First a -> m Source #

foldMap' :: Monoid m => (a -> m) -> First a -> m Source #

foldr :: (a -> b -> b) -> b -> First a -> b Source #

foldr' :: (a -> b -> b) -> b -> First a -> b Source #

foldl :: (b -> a -> b) -> b -> First a -> b Source #

foldl' :: (b -> a -> b) -> b -> First a -> b Source #

foldr1 :: (a -> a -> a) -> First a -> a Source #

foldl1 :: (a -> a -> a) -> First a -> a Source #

toList :: First a -> [a] Source #

null :: First a -> Bool Source #

length :: First a -> Int Source #

elem :: Eq a => a -> First a -> Bool Source #

maximum :: Ord a => First a -> a Source #

minimum :: Ord a => First a -> a Source #

sum :: Num a => First a -> a Source #

product :: Num a => First a -> a Source #

Foldable Last | Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fold :: Monoid m => Last m -> m Source #

foldMap :: Monoid m => (a -> m) -> Last a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Last a -> m Source #

foldr :: (a -> b -> b) -> b -> Last a -> b Source #

foldr' :: (a -> b -> b) -> b -> Last a -> b Source #

foldl :: (b -> a -> b) -> b -> Last a -> b Source #

foldl' :: (b -> a -> b) -> b -> Last a -> b Source #

foldr1 :: (a -> a -> a) -> Last a -> a Source #

foldl1 :: (a -> a -> a) -> Last a -> a Source #

toList :: Last a -> [a] Source #

null :: Last a -> Bool Source #

length :: Last a -> Int Source #

elem :: Eq a => a -> Last a -> Bool Source #

maximum :: Ord a => Last a -> a Source #

minimum :: Ord a => Last a -> a Source #

sum :: Num a => Last a -> a Source #

product :: Num a => Last a -> a Source #

Foldable Max | Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fold :: Monoid m => Max m -> m Source #

foldMap :: Monoid m => (a -> m) -> Max a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Max a -> m Source #

foldr :: (a -> b -> b) -> b -> Max a -> b Source #

foldr' :: (a -> b -> b) -> b -> Max a -> b Source #

foldl :: (b -> a -> b) -> b -> Max a -> b Source #

foldl' :: (b -> a -> b) -> b -> Max a -> b Source #

foldr1 :: (a -> a -> a) -> Max a -> a Source #

foldl1 :: (a -> a -> a) -> Max a -> a Source #

toList :: Max a -> [a] Source #

null :: Max a -> Bool Source #

length :: Max a -> Int Source #

elem :: Eq a => a -> Max a -> Bool Source #

maximum :: Ord a => Max a -> a Source #

minimum :: Ord a => Max a -> a Source #

sum :: Num a => Max a -> a Source #

product :: Num a => Max a -> a Source #

Foldable Min | Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fold :: Monoid m => Min m -> m Source #

foldMap :: Monoid m => (a -> m) -> Min a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Min a -> m Source #

foldr :: (a -> b -> b) -> b -> Min a -> b Source #

foldr' :: (a -> b -> b) -> b -> Min a -> b Source #

foldl :: (b -> a -> b) -> b -> Min a -> b Source #

foldl' :: (b -> a -> b) -> b -> Min a -> b Source #

foldr1 :: (a -> a -> a) -> Min a -> a Source #

foldl1 :: (a -> a -> a) -> Min a -> a Source #

toList :: Min a -> [a] Source #

null :: Min a -> Bool Source #

length :: Min a -> Int Source #

elem :: Eq a => a -> Min a -> Bool Source #

maximum :: Ord a => Min a -> a Source #

minimum :: Ord a => Min a -> a Source #

sum :: Num a => Min a -> a Source #

product :: Num a => Min a -> a Source #

Foldable SCC | Since: containers-0.5.9

Instance details

Defined in Data.Graph

Methods

fold :: Monoid m => SCC m -> m Source #

foldMap :: Monoid m => (a -> m) -> SCC a -> m Source #

foldMap' :: Monoid m => (a -> m) -> SCC a -> m Source #

foldr :: (a -> b -> b) -> b -> SCC a -> b Source #

foldr' :: (a -> b -> b) -> b -> SCC a -> b Source #

foldl :: (b -> a -> b) -> b -> SCC a -> b Source #

foldl' :: (b -> a -> b) -> b -> SCC a -> b Source #

foldr1 :: (a -> a -> a) -> SCC a -> a Source #

foldl1 :: (a -> a -> a) -> SCC a -> a Source #

toList :: SCC a -> [a] Source #

null :: SCC a -> Bool Source #

length :: SCC a -> Int Source #

elem :: Eq a => a -> SCC a -> Bool Source #

maximum :: Ord a => SCC a -> a Source #

minimum :: Ord a => SCC a -> a Source #

sum :: Num a => SCC a -> a Source #

product :: Num a => SCC a -> a Source #

Foldable IntMap | Folds in order of increasing key.

Instance details

Defined in Data.IntMap.Internal

Methods

fold :: Monoid m => IntMap m -> m Source #

foldMap :: Monoid m => (a -> m) -> IntMap a -> m Source #

foldMap' :: Monoid m => (a -> m) -> IntMap a -> m Source #

foldr :: (a -> b -> b) -> b -> IntMap a -> b Source #

foldr' :: (a -> b -> b) -> b -> IntMap a -> b Source #

foldl :: (b -> a -> b) -> b -> IntMap a -> b Source #

foldl' :: (b -> a -> b) -> b -> IntMap a -> b Source #

foldr1 :: (a -> a -> a) -> IntMap a -> a Source #

foldl1 :: (a -> a -> a) -> IntMap a -> a Source #

toList :: IntMap a -> [a] Source #

null :: IntMap a -> Bool Source #

length :: IntMap a -> Int Source #

elem :: Eq a => a -> IntMap a -> Bool Source #

maximum :: Ord a => IntMap a -> a Source #

minimum :: Ord a => IntMap a -> a Source #

sum :: Num a => IntMap a -> a Source #

product :: Num a => IntMap a -> a Source #

Foldable Digit |

Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => Digit m -> m Source #

foldMap :: Monoid m => (a -> m) -> Digit a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Digit a -> m Source #

foldr :: (a -> b -> b) -> b -> Digit a -> b Source #

foldr' :: (a -> b -> b) -> b -> Digit a -> b Source #

foldl :: (b -> a -> b) -> b -> Digit a -> b Source #

foldl' :: (b -> a -> b) -> b -> Digit a -> b Source #

foldr1 :: (a -> a -> a) -> Digit a -> a Source #

foldl1 :: (a -> a -> a) -> Digit a -> a Source #

toList :: Digit a -> [a] Source #

null :: Digit a -> Bool Source #

length :: Digit a -> Int Source #

elem :: Eq a => a -> Digit a -> Bool Source #

maximum :: Ord a => Digit a -> a Source #

minimum :: Ord a => Digit a -> a Source #

sum :: Num a => Digit a -> a Source #

product :: Num a => Digit a -> a Source #

Foldable Elem |

Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => Elem m -> m Source #

foldMap :: Monoid m => (a -> m) -> Elem a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Elem a -> m Source #

foldr :: (a -> b -> b) -> b -> Elem a -> b Source #

foldr' :: (a -> b -> b) -> b -> Elem a -> b Source #

foldl :: (b -> a -> b) -> b -> Elem a -> b Source #

foldl' :: (b -> a -> b) -> b -> Elem a -> b Source #

foldr1 :: (a -> a -> a) -> Elem a -> a Source #

foldl1 :: (a -> a -> a) -> Elem a -> a Source #

toList :: Elem a -> [a] Source #

null :: Elem a -> Bool Source #

length :: Elem a -> Int Source #

elem :: Eq a => a -> Elem a -> Bool Source #

maximum :: Ord a => Elem a -> a Source #

minimum :: Ord a => Elem a -> a Source #

sum :: Num a => Elem a -> a Source #

product :: Num a => Elem a -> a Source #

Foldable FingerTree |

Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => FingerTree m -> m Source #

foldMap :: Monoid m => (a -> m) -> FingerTree a -> m Source #

foldMap' :: Monoid m => (a -> m) -> FingerTree a -> m Source #

foldr :: (a -> b -> b) -> b -> FingerTree a -> b Source #

foldr' :: (a -> b -> b) -> b -> FingerTree a -> b Source #

foldl :: (b -> a -> b) -> b -> FingerTree a -> b Source #

foldl' :: (b -> a -> b) -> b -> FingerTree a -> b Source #

foldr1 :: (a -> a -> a) -> FingerTree a -> a Source #

foldl1 :: (a -> a -> a) -> FingerTree a -> a Source #

toList :: FingerTree a -> [a] Source #

null :: FingerTree a -> Bool Source #

length :: FingerTree a -> Int Source #

elem :: Eq a => a -> FingerTree a -> Bool Source #

maximum :: Ord a => FingerTree a -> a Source #

minimum :: Ord a => FingerTree a -> a Source #

sum :: Num a => FingerTree a -> a Source #

product :: Num a => FingerTree a -> a Source #

Foldable Node |

Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => Node m -> m Source #

foldMap :: Monoid m => (a -> m) -> Node a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Node a -> m Source #

foldr :: (a -> b -> b) -> b -> Node a -> b Source #

foldr' :: (a -> b -> b) -> b -> Node a -> b Source #

foldl :: (b -> a -> b) -> b -> Node a -> b Source #

foldl' :: (b -> a -> b) -> b -> Node a -> b Source #

foldr1 :: (a -> a -> a) -> Node a -> a Source #

foldl1 :: (a -> a -> a) -> Node a -> a Source #

toList :: Node a -> [a] Source #

null :: Node a -> Bool Source #

length :: Node a -> Int Source #

elem :: Eq a => a -> Node a -> Bool Source #

maximum :: Ord a => Node a -> a Source #

minimum :: Ord a => Node a -> a Source #

sum :: Num a => Node a -> a Source #

product :: Num a => Node a -> a Source #

Foldable Seq |

Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => Seq m -> m Source #

foldMap :: Monoid m => (a -> m) -> Seq a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Seq a -> m Source #

foldr :: (a -> b -> b) -> b -> Seq a -> b Source #

foldr' :: (a -> b -> b) -> b -> Seq a -> b Source #

foldl :: (b -> a -> b) -> b -> Seq a -> b Source #

foldl' :: (b -> a -> b) -> b -> Seq a -> b Source #

foldr1 :: (a -> a -> a) -> Seq a -> a Source #

foldl1 :: (a -> a -> a) -> Seq a -> a Source #

toList :: Seq a -> [a] Source #

null :: Seq a -> Bool Source #

length :: Seq a -> Int Source #

elem :: Eq a => a -> Seq a -> Bool Source #

maximum :: Ord a => Seq a -> a Source #

minimum :: Ord a => Seq a -> a Source #

sum :: Num a => Seq a -> a Source #

product :: Num a => Seq a -> a Source #

Foldable ViewL |

Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => ViewL m -> m Source #

foldMap :: Monoid m => (a -> m) -> ViewL a -> m Source #

foldMap' :: Monoid m => (a -> m) -> ViewL a -> m Source #

foldr :: (a -> b -> b) -> b -> ViewL a -> b Source #

foldr' :: (a -> b -> b) -> b -> ViewL a -> b Source #

foldl :: (b -> a -> b) -> b -> ViewL a -> b Source #

foldl' :: (b -> a -> b) -> b -> ViewL a -> b Source #

foldr1 :: (a -> a -> a) -> ViewL a -> a Source #

foldl1 :: (a -> a -> a) -> ViewL a -> a Source #

toList :: ViewL a -> [a] Source #

null :: ViewL a -> Bool Source #

length :: ViewL a -> Int Source #

elem :: Eq a => a -> ViewL a -> Bool Source #

maximum :: Ord a => ViewL a -> a Source #

minimum :: Ord a => ViewL a -> a Source #

sum :: Num a => ViewL a -> a Source #

product :: Num a => ViewL a -> a Source #

Foldable ViewR |

Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => ViewR m -> m Source #

foldMap :: Monoid m => (a -> m) -> ViewR a -> m Source #

foldMap' :: Monoid m => (a -> m) -> ViewR a -> m Source #

foldr :: (a -> b -> b) -> b -> ViewR a -> b Source #

foldr' :: (a -> b -> b) -> b -> ViewR a -> b Source #

foldl :: (b -> a -> b) -> b -> ViewR a -> b Source #

foldl' :: (b -> a -> b) -> b -> ViewR a -> b Source #

foldr1 :: (a -> a -> a) -> ViewR a -> a Source #

foldl1 :: (a -> a -> a) -> ViewR a -> a Source #

toList :: ViewR a -> [a] Source #

null :: ViewR a -> Bool Source #

length :: ViewR a -> Int Source #

elem :: Eq a => a -> ViewR a -> Bool Source #

maximum :: Ord a => ViewR a -> a Source #

minimum :: Ord a => ViewR a -> a Source #

sum :: Num a => ViewR a -> a Source #

product :: Num a => ViewR a -> a Source #

Foldable Set | Folds in order of increasing key.

Instance details

Defined in Data.Set.Internal

Methods

fold :: Monoid m => Set m -> m Source #

foldMap :: Monoid m => (a -> m) -> Set a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Set a -> m Source #

foldr :: (a -> b -> b) -> b -> Set a -> b Source #

foldr' :: (a -> b -> b) -> b -> Set a -> b Source #

foldl :: (b -> a -> b) -> b -> Set a -> b Source #

foldl' :: (b -> a -> b) -> b -> Set a -> b Source #

foldr1 :: (a -> a -> a) -> Set a -> a Source #

foldl1 :: (a -> a -> a) -> Set a -> a Source #

toList :: Set a -> [a] Source #

null :: Set a -> Bool Source #

length :: Set a -> Int Source #

elem :: Eq a => a -> Set a -> Bool Source #

maximum :: Ord a => Set a -> a Source #

minimum :: Ord a => Set a -> a Source #

sum :: Num a => Set a -> a Source #

product :: Num a => Set a -> a Source #

Foldable Tree | Folds in preorder

Instance details

Defined in Data.Tree

Methods

fold :: Monoid m => Tree m -> m Source #

foldMap :: Monoid m => (a -> m) -> Tree a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Tree a -> m Source #

foldr :: (a -> b -> b) -> b -> Tree a -> b Source #

foldr' :: (a -> b -> b) -> b -> Tree a -> b Source #

foldl :: (b -> a -> b) -> b -> Tree a -> b Source #

foldl' :: (b -> a -> b) -> b -> Tree a -> b Source #

foldr1 :: (a -> a -> a) -> Tree a -> a Source #

foldl1 :: (a -> a -> a) -> Tree a -> a Source #

toList :: Tree a -> [a] Source #

null :: Tree a -> Bool Source #

length :: Tree a -> Int Source #

elem :: Eq a => a -> Tree a -> Bool Source #

maximum :: Ord a => Tree a -> a Source #

minimum :: Ord a => Tree a -> a Source #

sum :: Num a => Tree a -> a Source #

product :: Num a => Tree a -> a Source #

Foldable DNonEmpty |

Instance details

Defined in Data.DList.DNonEmpty.Internal

Methods

fold :: Monoid m => DNonEmpty m -> m Source #

foldMap :: Monoid m => (a -> m) -> DNonEmpty a -> m Source #

foldMap' :: Monoid m => (a -> m) -> DNonEmpty a -> m Source #

foldr :: (a -> b -> b) -> b -> DNonEmpty a -> b Source #

foldr' :: (a -> b -> b) -> b -> DNonEmpty a -> b Source #

foldl :: (b -> a -> b) -> b -> DNonEmpty a -> b Source #

foldl' :: (b -> a -> b) -> b -> DNonEmpty a -> b Source #

foldr1 :: (a -> a -> a) -> DNonEmpty a -> a Source #

foldl1 :: (a -> a -> a) -> DNonEmpty a -> a Source #

toList :: DNonEmpty a -> [a] Source #

null :: DNonEmpty a -> Bool Source #

length :: DNonEmpty a -> Int Source #

elem :: Eq a => a -> DNonEmpty a -> Bool Source #

maximum :: Ord a => DNonEmpty a -> a Source #

minimum :: Ord a => DNonEmpty a -> a Source #

sum :: Num a => DNonEmpty a -> a Source #

product :: Num a => DNonEmpty a -> a Source #

Foldable DList |

Instance details

Defined in Data.DList.Internal

Methods

fold :: Monoid m => DList m -> m Source #

foldMap :: Monoid m => (a -> m) -> DList a -> m Source #

foldMap' :: Monoid m => (a -> m) -> DList a -> m Source #

foldr :: (a -> b -> b) -> b -> DList a -> b Source #

foldr' :: (a -> b -> b) -> b -> DList a -> b Source #

foldl :: (b -> a -> b) -> b -> DList a -> b Source #

foldl' :: (b -> a -> b) -> b -> DList a -> b Source #

foldr1 :: (a -> a -> a) -> DList a -> a Source #

foldl1 :: (a -> a -> a) -> DList a -> a Source #

toList :: DList a -> [a] Source #

null :: DList a -> Bool Source #

length :: DList a -> Int Source #

elem :: Eq a => a -> DList a -> Bool Source #

maximum :: Ord a => DList a -> a Source #

minimum :: Ord a => DList a -> a Source #

sum :: Num a => DList a -> a Source #

product :: Num a => DList a -> a Source #

Foldable NonEmpty | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => NonEmpty m -> m Source #

foldMap :: Monoid m => (a -> m) -> NonEmpty a -> m Source #

foldMap' :: Monoid m => (a -> m) -> NonEmpty a -> m Source #

foldr :: (a -> b -> b) -> b -> NonEmpty a -> b Source #

foldr' :: (a -> b -> b) -> b -> NonEmpty a -> b Source #

foldl :: (b -> a -> b) -> b -> NonEmpty a -> b Source #

foldl' :: (b -> a -> b) -> b -> NonEmpty a -> b Source #

foldr1 :: (a -> a -> a) -> NonEmpty a -> a Source #

foldl1 :: (a -> a -> a) -> NonEmpty a -> a Source #

toList :: NonEmpty a -> [a] Source #

null :: NonEmpty a -> Bool Source #

length :: NonEmpty a -> Int Source #

elem :: Eq a => a -> NonEmpty a -> Bool Source #

maximum :: Ord a => NonEmpty a -> a Source #

minimum :: Ord a => NonEmpty a -> a Source #

sum :: Num a => NonEmpty a -> a Source #

product :: Num a => NonEmpty a -> a Source #

Foldable Identity | Since: base-4.8.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Identity

Methods

fold :: Monoid m => Identity m -> m Source #

foldMap :: Monoid m => (a -> m) -> Identity a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Identity a -> m Source #

foldr :: (a -> b -> b) -> b -> Identity a -> b Source #

foldr' :: (a -> b -> b) -> b -> Identity a -> b Source #

foldl :: (b -> a -> b) -> b -> Identity a -> b Source #

foldl' :: (b -> a -> b) -> b -> Identity a -> b Source #

foldr1 :: (a -> a -> a) -> Identity a -> a Source #

foldl1 :: (a -> a -> a) -> Identity a -> a Source #

toList :: Identity a -> [a] Source #

null :: Identity a -> Bool Source #

length :: Identity a -> Int Source #

elem :: Eq a => a -> Identity a -> Bool Source #

maximum :: Ord a => Identity a -> a Source #

minimum :: Ord a => Identity a -> a Source #

sum :: Num a => Identity a -> a Source #

product :: Num a => Identity a -> a Source #

Foldable First | Since: base-4.8.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => First m -> m Source #

foldMap :: Monoid m => (a -> m) -> First a -> m Source #

foldMap' :: Monoid m => (a -> m) -> First a -> m Source #

foldr :: (a -> b -> b) -> b -> First a -> b Source #

foldr' :: (a -> b -> b) -> b -> First a -> b Source #

foldl :: (b -> a -> b) -> b -> First a -> b Source #

foldl' :: (b -> a -> b) -> b -> First a -> b Source #

foldr1 :: (a -> a -> a) -> First a -> a Source #

foldl1 :: (a -> a -> a) -> First a -> a Source #

toList :: First a -> [a] Source #

null :: First a -> Bool Source #

length :: First a -> Int Source #

elem :: Eq a => a -> First a -> Bool Source #

maximum :: Ord a => First a -> a Source #

minimum :: Ord a => First a -> a Source #

sum :: Num a => First a -> a Source #

product :: Num a => First a -> a Source #

Foldable Last | Since: base-4.8.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => Last m -> m Source #

foldMap :: Monoid m => (a -> m) -> Last a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Last a -> m Source #

foldr :: (a -> b -> b) -> b -> Last a -> b Source #

foldr' :: (a -> b -> b) -> b -> Last a -> b Source #

foldl :: (b -> a -> b) -> b -> Last a -> b Source #

foldl' :: (b -> a -> b) -> b -> Last a -> b Source #

foldr1 :: (a -> a -> a) -> Last a -> a Source #

foldl1 :: (a -> a -> a) -> Last a -> a Source #

toList :: Last a -> [a] Source #

null :: Last a -> Bool Source #

length :: Last a -> Int Source #

elem :: Eq a => a -> Last a -> Bool Source #

maximum :: Ord a => Last a -> a Source #

minimum :: Ord a => Last a -> a Source #

sum :: Num a => Last a -> a Source #

product :: Num a => Last a -> a Source #

Foldable Down | Since: base-4.12.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => Down m -> m Source #

foldMap :: Monoid m => (a -> m) -> Down a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Down a -> m Source #

foldr :: (a -> b -> b) -> b -> Down a -> b Source #

foldr' :: (a -> b -> b) -> b -> Down a -> b Source #

foldl :: (b -> a -> b) -> b -> Down a -> b Source #

foldl' :: (b -> a -> b) -> b -> Down a -> b Source #

foldr1 :: (a -> a -> a) -> Down a -> a Source #

foldl1 :: (a -> a -> a) -> Down a -> a Source #

toList :: Down a -> [a] Source #

null :: Down a -> Bool Source #

length :: Down a -> Int Source #

elem :: Eq a => a -> Down a -> Bool Source #

maximum :: Ord a => Down a -> a Source #

minimum :: Ord a => Down a -> a Source #

sum :: Num a => Down a -> a Source #

product :: Num a => Down a -> a Source #

Foldable Dual | Since: base-4.8.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => Dual m -> m Source #

foldMap :: Monoid m => (a -> m) -> Dual a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Dual a -> m Source #

foldr :: (a -> b -> b) -> b -> Dual a -> b Source #

foldr' :: (a -> b -> b) -> b -> Dual a -> b Source #

foldl :: (b -> a -> b) -> b -> Dual a -> b Source #

foldl' :: (b -> a -> b) -> b -> Dual a -> b Source #

foldr1 :: (a -> a -> a) -> Dual a -> a Source #

foldl1 :: (a -> a -> a) -> Dual a -> a Source #

toList :: Dual a -> [a] Source #

null :: Dual a -> Bool Source #

length :: Dual a -> Int Source #

elem :: Eq a => a -> Dual a -> Bool Source #

maximum :: Ord a => Dual a -> a Source #

minimum :: Ord a => Dual a -> a Source #

sum :: Num a => Dual a -> a Source #

product :: Num a => Dual a -> a Source #

Foldable Product | Since: base-4.8.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => Product m -> m Source #

foldMap :: Monoid m => (a -> m) -> Product a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Product a -> m Source #

foldr :: (a -> b -> b) -> b -> Product a -> b Source #

foldr' :: (a -> b -> b) -> b -> Product a -> b Source #

foldl :: (b -> a -> b) -> b -> Product a -> b Source #

foldl' :: (b -> a -> b) -> b -> Product a -> b Source #

foldr1 :: (a -> a -> a) -> Product a -> a Source #

foldl1 :: (a -> a -> a) -> Product a -> a Source #

toList :: Product a -> [a] Source #

null :: Product a -> Bool Source #

length :: Product a -> Int Source #

elem :: Eq a => a -> Product a -> Bool Source #

maximum :: Ord a => Product a -> a Source #

minimum :: Ord a => Product a -> a Source #

sum :: Num a => Product a -> a Source #

product :: Num a => Product a -> a Source #

Foldable Sum | Since: base-4.8.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => Sum m -> m Source #

foldMap :: Monoid m => (a -> m) -> Sum a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Sum a -> m Source #

foldr :: (a -> b -> b) -> b -> Sum a -> b Source #

foldr' :: (a -> b -> b) -> b -> Sum a -> b Source #

foldl :: (b -> a -> b) -> b -> Sum a -> b Source #

foldl' :: (b -> a -> b) -> b -> Sum a -> b Source #

foldr1 :: (a -> a -> a) -> Sum a -> a Source #

foldl1 :: (a -> a -> a) -> Sum a -> a Source #

toList :: Sum a -> [a] Source #

null :: Sum a -> Bool Source #

length :: Sum a -> Int Source #

elem :: Eq a => a -> Sum a -> Bool Source #

maximum :: Ord a => Sum a -> a Source #

minimum :: Ord a => Sum a -> a Source #

sum :: Num a => Sum a -> a Source #

product :: Num a => Sum a -> a Source #

Foldable ZipList | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Functor.ZipList

Methods

fold :: Monoid m => ZipList m -> m Source #

foldMap :: Monoid m => (a -> m) -> ZipList a -> m Source #

foldMap' :: Monoid m => (a -> m) -> ZipList a -> m Source #

foldr :: (a -> b -> b) -> b -> ZipList a -> b Source #

foldr' :: (a -> b -> b) -> b -> ZipList a -> b Source #

foldl :: (b -> a -> b) -> b -> ZipList a -> b Source #

foldl' :: (b -> a -> b) -> b -> ZipList a -> b Source #

foldr1 :: (a -> a -> a) -> ZipList a -> a Source #

foldl1 :: (a -> a -> a) -> ZipList a -> a Source #

toList :: ZipList a -> [a] Source #

null :: ZipList a -> Bool Source #

length :: ZipList a -> Int Source #

elem :: Eq a => a -> ZipList a -> Bool Source #

maximum :: Ord a => ZipList a -> a Source #

minimum :: Ord a => ZipList a -> a Source #

sum :: Num a => ZipList a -> a Source #

product :: Num a => ZipList a -> a Source #

Foldable Par1 | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => Par1 m -> m Source #

foldMap :: Monoid m => (a -> m) -> Par1 a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Par1 a -> m Source #

foldr :: (a -> b -> b) -> b -> Par1 a -> b Source #

foldr' :: (a -> b -> b) -> b -> Par1 a -> b Source #

foldl :: (b -> a -> b) -> b -> Par1 a -> b Source #

foldl' :: (b -> a -> b) -> b -> Par1 a -> b Source #

foldr1 :: (a -> a -> a) -> Par1 a -> a Source #

foldl1 :: (a -> a -> a) -> Par1 a -> a Source #

toList :: Par1 a -> [a] Source #

null :: Par1 a -> Bool Source #

length :: Par1 a -> Int Source #

elem :: Eq a => a -> Par1 a -> Bool Source #

maximum :: Ord a => Par1 a -> a Source #

minimum :: Ord a => Par1 a -> a Source #

sum :: Num a => Par1 a -> a Source #

product :: Num a => Par1 a -> a Source #

Foldable Hashed |

Instance details

Defined in Data.Hashable.Class

Methods

fold :: Monoid m => Hashed m -> m Source #

foldMap :: Monoid m => (a -> m) -> Hashed a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Hashed a -> m Source #

foldr :: (a -> b -> b) -> b -> Hashed a -> b Source #

foldr' :: (a -> b -> b) -> b -> Hashed a -> b Source #

foldl :: (b -> a -> b) -> b -> Hashed a -> b Source #

foldl' :: (b -> a -> b) -> b -> Hashed a -> b Source #

foldr1 :: (a -> a -> a) -> Hashed a -> a Source #

foldl1 :: (a -> a -> a) -> Hashed a -> a Source #

toList :: Hashed a -> [a] Source #

null :: Hashed a -> Bool Source #

length :: Hashed a -> Int Source #

elem :: Eq a => a -> Hashed a -> Bool Source #

maximum :: Ord a => Hashed a -> a Source #

minimum :: Ord a => Hashed a -> a Source #

sum :: Num a => Hashed a -> a Source #

product :: Num a => Hashed a -> a Source #

Foldable Plucker |

Instance details

Defined in Linear.Plucker

Methods

fold :: Monoid m => Plucker m -> m Source #

foldMap :: Monoid m => (a -> m) -> Plucker a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Plucker a -> m Source #

foldr :: (a -> b -> b) -> b -> Plucker a -> b Source #

foldr' :: (a -> b -> b) -> b -> Plucker a -> b Source #

foldl :: (b -> a -> b) -> b -> Plucker a -> b Source #

foldl' :: (b -> a -> b) -> b -> Plucker a -> b Source #

foldr1 :: (a -> a -> a) -> Plucker a -> a Source #

foldl1 :: (a -> a -> a) -> Plucker a -> a Source #

toList :: Plucker a -> [a] Source #

null :: Plucker a -> Bool Source #

length :: Plucker a -> Int Source #

elem :: Eq a => a -> Plucker a -> Bool Source #

maximum :: Ord a => Plucker a -> a Source #

minimum :: Ord a => Plucker a -> a Source #

sum :: Num a => Plucker a -> a Source #

product :: Num a => Plucker a -> a Source #

Foldable Quaternion |

Instance details

Defined in Linear.Quaternion

Methods

fold :: Monoid m => Quaternion m -> m Source #

foldMap :: Monoid m => (a -> m) -> Quaternion a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Quaternion a -> m Source #

foldr :: (a -> b -> b) -> b -> Quaternion a -> b Source #

foldr' :: (a -> b -> b) -> b -> Quaternion a -> b Source #

foldl :: (b -> a -> b) -> b -> Quaternion a -> b Source #

foldl' :: (b -> a -> b) -> b -> Quaternion a -> b Source #

foldr1 :: (a -> a -> a) -> Quaternion a -> a Source #

foldl1 :: (a -> a -> a) -> Quaternion a -> a Source #

toList :: Quaternion a -> [a] Source #

null :: Quaternion a -> Bool Source #

length :: Quaternion a -> Int Source #

elem :: Eq a => a -> Quaternion a -> Bool Source #

maximum :: Ord a => Quaternion a -> a Source #

minimum :: Ord a => Quaternion a -> a Source #

sum :: Num a => Quaternion a -> a Source #

product :: Num a => Quaternion a -> a Source #

Foldable V0 |

Instance details

Defined in Linear.V0

Methods

fold :: Monoid m => V0 m -> m Source #

foldMap :: Monoid m => (a -> m) -> V0 a -> m Source #

foldMap' :: Monoid m => (a -> m) -> V0 a -> m Source #

foldr :: (a -> b -> b) -> b -> V0 a -> b Source #

foldr' :: (a -> b -> b) -> b -> V0 a -> b Source #

foldl :: (b -> a -> b) -> b -> V0 a -> b Source #

foldl' :: (b -> a -> b) -> b -> V0 a -> b Source #

foldr1 :: (a -> a -> a) -> V0 a -> a Source #

foldl1 :: (a -> a -> a) -> V0 a -> a Source #

toList :: V0 a -> [a] Source #

null :: V0 a -> Bool Source #

length :: V0 a -> Int Source #

elem :: Eq a => a -> V0 a -> Bool Source #

maximum :: Ord a => V0 a -> a Source #

minimum :: Ord a => V0 a -> a Source #

sum :: Num a => V0 a -> a Source #

product :: Num a => V0 a -> a Source #

Foldable V1 |

Instance details

Defined in Linear.V1

Methods

fold :: Monoid m => V1 m -> m Source #

foldMap :: Monoid m => (a -> m) -> V1 a -> m Source #

foldMap' :: Monoid m => (a -> m) -> V1 a -> m Source #

foldr :: (a -> b -> b) -> b -> V1 a -> b Source #

foldr' :: (a -> b -> b) -> b -> V1 a -> b Source #

foldl :: (b -> a -> b) -> b -> V1 a -> b Source #

foldl' :: (b -> a -> b) -> b -> V1 a -> b Source #

foldr1 :: (a -> a -> a) -> V1 a -> a Source #

foldl1 :: (a -> a -> a) -> V1 a -> a Source #

toList :: V1 a -> [a] Source #

null :: V1 a -> Bool Source #

length :: V1 a -> Int Source #

elem :: Eq a => a -> V1 a -> Bool Source #

maximum :: Ord a => V1 a -> a Source #

minimum :: Ord a => V1 a -> a Source #

sum :: Num a => V1 a -> a Source #

product :: Num a => V1 a -> a Source #

Foldable V2 |

Instance details

Defined in Linear.V2

Methods

fold :: Monoid m => V2 m -> m Source #

foldMap :: Monoid m => (a -> m) -> V2 a -> m Source #

foldMap' :: Monoid m => (a -> m) -> V2 a -> m Source #

foldr :: (a -> b -> b) -> b -> V2 a -> b Source #

foldr' :: (a -> b -> b) -> b -> V2 a -> b Source #

foldl :: (b -> a -> b) -> b -> V2 a -> b Source #

foldl' :: (b -> a -> b) -> b -> V2 a -> b Source #

foldr1 :: (a -> a -> a) -> V2 a -> a Source #

foldl1 :: (a -> a -> a) -> V2 a -> a Source #

toList :: V2 a -> [a] Source #

null :: V2 a -> Bool Source #

length :: V2 a -> Int Source #

elem :: Eq a => a -> V2 a -> Bool Source #

maximum :: Ord a => V2 a -> a Source #

minimum :: Ord a => V2 a -> a Source #

sum :: Num a => V2 a -> a Source #

product :: Num a => V2 a -> a Source #

Foldable V3 |

Instance details

Defined in Linear.V3

Methods

fold :: Monoid m => V3 m -> m Source #

foldMap :: Monoid m => (a -> m) -> V3 a -> m Source #

foldMap' :: Monoid m => (a -> m) -> V3 a -> m Source #

foldr :: (a -> b -> b) -> b -> V3 a -> b Source #

foldr' :: (a -> b -> b) -> b -> V3 a -> b Source #

foldl :: (b -> a -> b) -> b -> V3 a -> b Source #

foldl' :: (b -> a -> b) -> b -> V3 a -> b Source #

foldr1 :: (a -> a -> a) -> V3 a -> a Source #

foldl1 :: (a -> a -> a) -> V3 a -> a Source #

toList :: V3 a -> [a] Source #

null :: V3 a -> Bool Source #

length :: V3 a -> Int Source #

elem :: Eq a => a -> V3 a -> Bool Source #

maximum :: Ord a => V3 a -> a Source #

minimum :: Ord a => V3 a -> a Source #

sum :: Num a => V3 a -> a Source #

product :: Num a => V3 a -> a Source #

Foldable V4 |

Instance details

Defined in Linear.V4

Methods

fold :: Monoid m => V4 m -> m Source #

foldMap :: Monoid m => (a -> m) -> V4 a -> m Source #

foldMap' :: Monoid m => (a -> m) -> V4 a -> m Source #

foldr :: (a -> b -> b) -> b -> V4 a -> b Source #

foldr' :: (a -> b -> b) -> b -> V4 a -> b Source #

foldl :: (b -> a -> b) -> b -> V4 a -> b Source #

foldl' :: (b -> a -> b) -> b -> V4 a -> b Source #

foldr1 :: (a -> a -> a) -> V4 a -> a Source #

foldl1 :: (a -> a -> a) -> V4 a -> a Source #

toList :: V4 a -> [a] Source #

null :: V4 a -> Bool Source #

length :: V4 a -> Int Source #

elem :: Eq a => a -> V4 a -> Bool Source #

maximum :: Ord a => V4 a -> a Source #

minimum :: Ord a => V4 a -> a Source #

sum :: Num a => V4 a -> a Source #

product :: Num a => V4 a -> a Source #

Foldable SimpleDocStream |

Instance details

Defined in Prettyprinter.Internal

Methods

fold :: Monoid m => SimpleDocStream m -> m Source #

foldMap :: Monoid m => (a -> m) -> SimpleDocStream a -> m Source #

foldMap' :: Monoid m => (a -> m) -> SimpleDocStream a -> m Source #

foldr :: (a -> b -> b) -> b -> SimpleDocStream a -> b Source #

foldr' :: (a -> b -> b) -> b -> SimpleDocStream a -> b Source #

foldl :: (b -> a -> b) -> b -> SimpleDocStream a -> b Source #

foldl' :: (b -> a -> b) -> b -> SimpleDocStream a -> b Source #

foldr1 :: (a -> a -> a) -> SimpleDocStream a -> a Source #

foldl1 :: (a -> a -> a) -> SimpleDocStream a -> a Source #

toList :: SimpleDocStream a -> [a] Source #

null :: SimpleDocStream a -> Bool Source #

length :: SimpleDocStream a -> Int Source #

elem :: Eq a => a -> SimpleDocStream a -> Bool Source #

maximum :: Ord a => SimpleDocStream a -> a Source #

minimum :: Ord a => SimpleDocStream a -> a Source #

sum :: Num a => SimpleDocStream a -> a Source #

product :: Num a => SimpleDocStream a -> a Source #

Foldable Array |

Instance details

Defined in Data.Primitive.Array

Methods

fold :: Monoid m => Array m -> m Source #

foldMap :: Monoid m => (a -> m) -> Array a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Array a -> m Source #

foldr :: (a -> b -> b) -> b -> Array a -> b Source #

foldr' :: (a -> b -> b) -> b -> Array a -> b Source #

foldl :: (b -> a -> b) -> b -> Array a -> b Source #

foldl' :: (b -> a -> b) -> b -> Array a -> b Source #

foldr1 :: (a -> a -> a) -> Array a -> a Source #

foldl1 :: (a -> a -> a) -> Array a -> a Source #

toList :: Array a -> [a] Source #

null :: Array a -> Bool Source #

length :: Array a -> Int Source #

elem :: Eq a => a -> Array a -> Bool Source #

maximum :: Ord a => Array a -> a Source #

minimum :: Ord a => Array a -> a Source #

sum :: Num a => Array a -> a Source #

product :: Num a => Array a -> a Source #

Foldable SmallArray |

Instance details

Defined in Data.Primitive.SmallArray

Methods

fold :: Monoid m => SmallArray m -> m Source #

foldMap :: Monoid m => (a -> m) -> SmallArray a -> m Source #

foldMap' :: Monoid m => (a -> m) -> SmallArray a -> m Source #

foldr :: (a -> b -> b) -> b -> SmallArray a -> b Source #

foldr' :: (a -> b -> b) -> b -> SmallArray a -> b Source #

foldl :: (b -> a -> b) -> b -> SmallArray a -> b Source #

foldl' :: (b -> a -> b) -> b -> SmallArray a -> b Source #

foldr1 :: (a -> a -> a) -> SmallArray a -> a Source #

foldl1 :: (a -> a -> a) -> SmallArray a -> a Source #

toList :: SmallArray a -> [a] Source #

null :: SmallArray a -> Bool Source #

length :: SmallArray a -> Int Source #

elem :: Eq a => a -> SmallArray a -> Bool Source #

maximum :: Ord a => SmallArray a -> a Source #

minimum :: Ord a => SmallArray a -> a Source #

sum :: Num a => SmallArray a -> a Source #

product :: Num a => SmallArray a -> a Source #

Foldable Changeable |

Instance details

Defined in SDL.Audio

Methods

fold :: Monoid m => Changeable m -> m Source #

foldMap :: Monoid m => (a -> m) -> Changeable a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Changeable a -> m Source #

foldr :: (a -> b -> b) -> b -> Changeable a -> b Source #

foldr' :: (a -> b -> b) -> b -> Changeable a -> b Source #

foldl :: (b -> a -> b) -> b -> Changeable a -> b Source #

foldl' :: (b -> a -> b) -> b -> Changeable a -> b Source #

foldr1 :: (a -> a -> a) -> Changeable a -> a Source #

foldl1 :: (a -> a -> a) -> Changeable a -> a Source #

toList :: Changeable a -> [a] Source #

null :: Changeable a -> Bool Source #

length :: Changeable a -> Int Source #

elem :: Eq a => a -> Changeable a -> Bool Source #

maximum :: Ord a => Changeable a -> a Source #

minimum :: Ord a => Changeable a -> a Source #

sum :: Num a => Changeable a -> a Source #

product :: Num a => Changeable a -> a Source #

Foldable V2 |

Instance details

Defined in SDL.Internal.Vect

Methods

fold :: Monoid m => V2 m -> m Source #

foldMap :: Monoid m => (a -> m) -> V2 a -> m Source #

foldMap' :: Monoid m => (a -> m) -> V2 a -> m Source #

foldr :: (a -> b -> b) -> b -> V2 a -> b Source #

foldr' :: (a -> b -> b) -> b -> V2 a -> b Source #

foldl :: (b -> a -> b) -> b -> V2 a -> b Source #

foldl' :: (b -> a -> b) -> b -> V2 a -> b Source #

foldr1 :: (a -> a -> a) -> V2 a -> a Source #

foldl1 :: (a -> a -> a) -> V2 a -> a Source #

toList :: V2 a -> [a] Source #

null :: V2 a -> Bool Source #

length :: V2 a -> Int Source #

elem :: Eq a => a -> V2 a -> Bool Source #

maximum :: Ord a => V2 a -> a Source #

minimum :: Ord a => V2 a -> a Source #

sum :: Num a => V2 a -> a Source #

product :: Num a => V2 a -> a Source #

Foldable V3 |

Instance details

Defined in SDL.Internal.Vect

Methods

fold :: Monoid m => V3 m -> m Source #

foldMap :: Monoid m => (a -> m) -> V3 a -> m Source #

foldMap' :: Monoid m => (a -> m) -> V3 a -> m Source #

foldr :: (a -> b -> b) -> b -> V3 a -> b Source #

foldr' :: (a -> b -> b) -> b -> V3 a -> b Source #

foldl :: (b -> a -> b) -> b -> V3 a -> b Source #

foldl' :: (b -> a -> b) -> b -> V3 a -> b Source #

foldr1 :: (a -> a -> a) -> V3 a -> a Source #

foldl1 :: (a -> a -> a) -> V3 a -> a Source #

toList :: V3 a -> [a] Source #

null :: V3 a -> Bool Source #

length :: V3 a -> Int Source #

elem :: Eq a => a -> V3 a -> Bool Source #

maximum :: Ord a => V3 a -> a Source #

minimum :: Ord a => V3 a -> a Source #

sum :: Num a => V3 a -> a Source #

product :: Num a => V3 a -> a Source #

Foldable V4 |

Instance details

Defined in SDL.Internal.Vect

Methods

fold :: Monoid m => V4 m -> m Source #

foldMap :: Monoid m => (a -> m) -> V4 a -> m Source #

foldMap' :: Monoid m => (a -> m) -> V4 a -> m Source #

foldr :: (a -> b -> b) -> b -> V4 a -> b Source #

foldr' :: (a -> b -> b) -> b -> V4 a -> b Source #

foldl :: (b -> a -> b) -> b -> V4 a -> b Source #

foldl' :: (b -> a -> b) -> b -> V4 a -> b Source #

foldr1 :: (a -> a -> a) -> V4 a -> a Source #

foldl1 :: (a -> a -> a) -> V4 a -> a Source #

toList :: V4 a -> [a] Source #

null :: V4 a -> Bool Source #

length :: V4 a -> Int Source #

elem :: Eq a => a -> V4 a -> Bool Source #

maximum :: Ord a => V4 a -> a Source #

minimum :: Ord a => V4 a -> a Source #

sum :: Num a => V4 a -> a Source #

product :: Num a => V4 a -> a Source #

Foldable Maybe |

Instance details

Defined in Data.Strict.Maybe

Methods

fold :: Monoid m => Maybe m -> m Source #

foldMap :: Monoid m => (a -> m) -> Maybe a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Maybe a -> m Source #

foldr :: (a -> b -> b) -> b -> Maybe a -> b Source #

foldr' :: (a -> b -> b) -> b -> Maybe a -> b Source #

foldl :: (b -> a -> b) -> b -> Maybe a -> b Source #

foldl' :: (b -> a -> b) -> b -> Maybe a -> b Source #

foldr1 :: (a -> a -> a) -> Maybe a -> a Source #

foldl1 :: (a -> a -> a) -> Maybe a -> a Source #

toList :: Maybe a -> [a] Source #

null :: Maybe a -> Bool Source #

length :: Maybe a -> Int Source #

elem :: Eq a => a -> Maybe a -> Bool Source #

maximum :: Ord a => Maybe a -> a Source #

minimum :: Ord a => Maybe a -> a Source #

sum :: Num a => Maybe a -> a Source #

product :: Num a => Maybe a -> a Source #

Foldable TyVarBndr |

Instance details

Defined in Language.Haskell.TH.Syntax

Methods

fold :: Monoid m => TyVarBndr m -> m Source #

foldMap :: Monoid m => (a -> m) -> TyVarBndr a -> m Source #

foldMap' :: Monoid m => (a -> m) -> TyVarBndr a -> m Source #

foldr :: (a -> b -> b) -> b -> TyVarBndr a -> b Source #

foldr' :: (a -> b -> b) -> b -> TyVarBndr a -> b Source #

foldl :: (b -> a -> b) -> b -> TyVarBndr a -> b Source #

foldl' :: (b -> a -> b) -> b -> TyVarBndr a -> b Source #

foldr1 :: (a -> a -> a) -> TyVarBndr a -> a Source #

foldl1 :: (a -> a -> a) -> TyVarBndr a -> a Source #

toList :: TyVarBndr a -> [a] Source #

null :: TyVarBndr a -> Bool Source #

length :: TyVarBndr a -> Int Source #

elem :: Eq a => a -> TyVarBndr a -> Bool Source #

maximum :: Ord a => TyVarBndr a -> a Source #

minimum :: Ord a => TyVarBndr a -> a Source #

sum :: Num a => TyVarBndr a -> a Source #

product :: Num a => TyVarBndr a -> a Source #

Foldable HashSet |

Instance details

Defined in Data.HashSet.Internal

Methods

fold :: Monoid m => HashSet m -> m Source #

foldMap :: Monoid m => (a -> m) -> HashSet a -> m Source #

foldMap' :: Monoid m => (a -> m) -> HashSet a -> m Source #

foldr :: (a -> b -> b) -> b -> HashSet a -> b Source #

foldr' :: (a -> b -> b) -> b -> HashSet a -> b Source #

foldl :: (b -> a -> b) -> b -> HashSet a -> b Source #

foldl' :: (b -> a -> b) -> b -> HashSet a -> b Source #

foldr1 :: (a -> a -> a) -> HashSet a -> a Source #

foldl1 :: (a -> a -> a) -> HashSet a -> a Source #

toList :: HashSet a -> [a] Source #

null :: HashSet a -> Bool Source #

length :: HashSet a -> Int Source #

elem :: Eq a => a -> HashSet a -> Bool Source #

maximum :: Ord a => HashSet a -> a Source #

minimum :: Ord a => HashSet a -> a Source #

sum :: Num a => HashSet a -> a Source #

product :: Num a => HashSet a -> a Source #

Foldable Vector |

Instance details

Defined in Data.Vector

Methods

fold :: Monoid m => Vector m -> m Source #

foldMap :: Monoid m => (a -> m) -> Vector a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Vector a -> m Source #

foldr :: (a -> b -> b) -> b -> Vector a -> b Source #

foldr' :: (a -> b -> b) -> b -> Vector a -> b Source #

foldl :: (b -> a -> b) -> b -> Vector a -> b Source #

foldl' :: (b -> a -> b) -> b -> Vector a -> b Source #

foldr1 :: (a -> a -> a) -> Vector a -> a Source #

foldl1 :: (a -> a -> a) -> Vector a -> a Source #

toList :: Vector a -> [a] Source #

null :: Vector a -> Bool Source #

length :: Vector a -> Int Source #

elem :: Eq a => a -> Vector a -> Bool Source #

maximum :: Ord a => Vector a -> a Source #

minimum :: Ord a => Vector a -> a Source #

sum :: Num a => Vector a -> a Source #

product :: Num a => Vector a -> a Source #

Foldable Vector |

Instance details

Defined in Data.Vector.Strict

Methods

fold :: Monoid m => Vector m -> m Source #

foldMap :: Monoid m => (a -> m) -> Vector a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Vector a -> m Source #

foldr :: (a -> b -> b) -> b -> Vector a -> b Source #

foldr' :: (a -> b -> b) -> b -> Vector a -> b Source #

foldl :: (b -> a -> b) -> b -> Vector a -> b Source #

foldl' :: (b -> a -> b) -> b -> Vector a -> b Source #

foldr1 :: (a -> a -> a) -> Vector a -> a Source #

foldl1 :: (a -> a -> a) -> Vector a -> a Source #

toList :: Vector a -> [a] Source #

null :: Vector a -> Bool Source #

length :: Vector a -> Int Source #

elem :: Eq a => a -> Vector a -> Bool Source #

maximum :: Ord a => Vector a -> a Source #

minimum :: Ord a => Vector a -> a Source #

sum :: Num a => Vector a -> a Source #

product :: Num a => Vector a -> a Source #

Foldable Maybe | Since: base-2.1

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => Maybe m -> m Source #

foldMap :: Monoid m => (a -> m) -> Maybe a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Maybe a -> m Source #

foldr :: (a -> b -> b) -> b -> Maybe a -> b Source #

foldr' :: (a -> b -> b) -> b -> Maybe a -> b Source #

foldl :: (b -> a -> b) -> b -> Maybe a -> b Source #

foldl' :: (b -> a -> b) -> b -> Maybe a -> b Source #

foldr1 :: (a -> a -> a) -> Maybe a -> a Source #

foldl1 :: (a -> a -> a) -> Maybe a -> a Source #

toList :: Maybe a -> [a] Source #

null :: Maybe a -> Bool Source #

length :: Maybe a -> Int Source #

elem :: Eq a => a -> Maybe a -> Bool Source #

maximum :: Ord a => Maybe a -> a Source #

minimum :: Ord a => Maybe a -> a Source #

sum :: Num a => Maybe a -> a Source #

product :: Num a => Maybe a -> a Source #

Foldable Solo | Since: base-4.15

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => Solo m -> m Source #

foldMap :: Monoid m => (a -> m) -> Solo a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Solo a -> m Source #

foldr :: (a -> b -> b) -> b -> Solo a -> b Source #

foldr' :: (a -> b -> b) -> b -> Solo a -> b Source #

foldl :: (b -> a -> b) -> b -> Solo a -> b Source #

foldl' :: (b -> a -> b) -> b -> Solo a -> b Source #

foldr1 :: (a -> a -> a) -> Solo a -> a Source #

foldl1 :: (a -> a -> a) -> Solo a -> a Source #

toList :: Solo a -> [a] Source #

null :: Solo a -> Bool Source #

length :: Solo a -> Int Source #

elem :: Eq a => a -> Solo a -> Bool Source #

maximum :: Ord a => Solo a -> a Source #

minimum :: Ord a => Solo a -> a Source #

sum :: Num a => Solo a -> a Source #

product :: Num a => Solo a -> a Source #

Foldable [] | Since: base-2.1

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => [m] -> m Source #

foldMap :: Monoid m => (a -> m) -> [a] -> m Source #

foldMap' :: Monoid m => (a -> m) -> [a] -> m Source #

foldr :: (a -> b -> b) -> b -> [a] -> b Source #

foldr' :: (a -> b -> b) -> b -> [a] -> b Source #

foldl :: (b -> a -> b) -> b -> [a] -> b Source #

foldl' :: (b -> a -> b) -> b -> [a] -> b Source #

foldr1 :: (a -> a -> a) -> [a] -> a Source #

foldl1 :: (a -> a -> a) -> [a] -> a Source #

toList :: [a] -> [a] Source #

null :: [a] -> Bool Source #

length :: [a] -> Int Source #

elem :: Eq a => a -> [a] -> Bool Source #

maximum :: Ord a => [a] -> a Source #

minimum :: Ord a => [a] -> a Source #

sum :: Num a => [a] -> a Source #

product :: Num a => [a] -> a Source #

Foldable (Arg a) | Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fold :: Monoid m => Arg a m -> m Source #

foldMap :: Monoid m => (a0 -> m) -> Arg a a0 -> m Source #

foldMap' :: Monoid m => (a0 -> m) -> Arg a a0 -> m Source #

foldr :: (a0 -> b -> b) -> b -> Arg a a0 -> b Source #

foldr' :: (a0 -> b -> b) -> b -> Arg a a0 -> b Source #

foldl :: (b -> a0 -> b) -> b -> Arg a a0 -> b Source #

foldl' :: (b -> a0 -> b) -> b -> Arg a a0 -> b Source #

foldr1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 Source #

foldl1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 Source #

toList :: Arg a a0 -> [a0] Source #

null :: Arg a a0 -> Bool Source #

length :: Arg a a0 -> Int Source #

elem :: Eq a0 => a0 -> Arg a a0 -> Bool Source #

maximum :: Ord a0 => Arg a a0 -> a0 Source #

minimum :: Ord a0 => Arg a a0 -> a0 Source #

sum :: Num a0 => Arg a a0 -> a0 Source #

product :: Num a0 => Arg a a0 -> a0 Source #

Foldable (Map k) | Folds in order of increasing key.

Instance details

Defined in Data.Map.Internal

Methods

fold :: Monoid m => Map k m -> m Source #

foldMap :: Monoid m => (a -> m) -> Map k a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Map k a -> m Source #

foldr :: (a -> b -> b) -> b -> Map k a -> b Source #

foldr' :: (a -> b -> b) -> b -> Map k a -> b Source #

foldl :: (b -> a -> b) -> b -> Map k a -> b Source #

foldl' :: (b -> a -> b) -> b -> Map k a -> b Source #

foldr1 :: (a -> a -> a) -> Map k a -> a Source #

foldl1 :: (a -> a -> a) -> Map k a -> a Source #

toList :: Map k a -> [a] Source #

null :: Map k a -> Bool Source #

length :: Map k a -> Int Source #

elem :: Eq a => a -> Map k a -> Bool Source #

maximum :: Ord a => Map k a -> a Source #

minimum :: Ord a => Map k a -> a Source #

sum :: Num a => Map k a -> a Source #

product :: Num a => Map k a -> a Source #

Foldable (EnumMap k) |

Instance details

Defined in Data.EnumMap.Base

Methods

fold :: Monoid m => EnumMap k m -> m Source #

foldMap :: Monoid m => (a -> m) -> EnumMap k a -> m Source #

foldMap' :: Monoid m => (a -> m) -> EnumMap k a -> m Source #

foldr :: (a -> b -> b) -> b -> EnumMap k a -> b Source #

foldr' :: (a -> b -> b) -> b -> EnumMap k a -> b Source #

foldl :: (b -> a -> b) -> b -> EnumMap k a -> b Source #

foldl' :: (b -> a -> b) -> b -> EnumMap k a -> b Source #

foldr1 :: (a -> a -> a) -> EnumMap k a -> a Source #

foldl1 :: (a -> a -> a) -> EnumMap k a -> a Source #

toList :: EnumMap k a -> [a] Source #

null :: EnumMap k a -> Bool Source #

length :: EnumMap k a -> Int Source #

elem :: Eq a => a -> EnumMap k a -> Bool Source #

maximum :: Ord a => EnumMap k a -> a Source #

minimum :: Ord a => EnumMap k a -> a Source #

sum :: Num a => EnumMap k a -> a Source #

product :: Num a => EnumMap k a -> a Source #

Foldable f => Foldable (Cofree f) |

Instance details

Defined in Control.Comonad.Cofree

Methods

fold :: Monoid m => Cofree f m -> m Source #

foldMap :: Monoid m => (a -> m) -> Cofree f a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Cofree f a -> m Source #

foldr :: (a -> b -> b) -> b -> Cofree f a -> b Source #

foldr' :: (a -> b -> b) -> b -> Cofree f a -> b Source #

foldl :: (b -> a -> b) -> b -> Cofree f a -> b Source #

foldl' :: (b -> a -> b) -> b -> Cofree f a -> b Source #

foldr1 :: (a -> a -> a) -> Cofree f a -> a Source #

foldl1 :: (a -> a -> a) -> Cofree f a -> a Source #

toList :: Cofree f a -> [a] Source #

null :: Cofree f a -> Bool Source #

length :: Cofree f a -> Int Source #

elem :: Eq a => a -> Cofree f a -> Bool Source #

maximum :: Ord a => Cofree f a -> a Source #

minimum :: Ord a => Cofree f a -> a Source #

sum :: Num a => Cofree f a -> a Source #

product :: Num a => Cofree f a -> a Source #

Foldable f => Foldable (Free f) |

Instance details

Defined in Control.Monad.Free

Methods

fold :: Monoid m => Free f m -> m Source #

foldMap :: Monoid m => (a -> m) -> Free f a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Free f a -> m Source #

foldr :: (a -> b -> b) -> b -> Free f a -> b Source #

foldr' :: (a -> b -> b) -> b -> Free f a -> b Source #

foldl :: (b -> a -> b) -> b -> Free f a -> b Source #

foldl' :: (b -> a -> b) -> b -> Free f a -> b Source #

foldr1 :: (a -> a -> a) -> Free f a -> a Source #

foldl1 :: (a -> a -> a) -> Free f a -> a Source #

toList :: Free f a -> [a] Source #

null :: Free f a -> Bool Source #

length :: Free f a -> Int Source #

elem :: Eq a => a -> Free f a -> Bool Source #

maximum :: Ord a => Free f a -> a Source #

minimum :: Ord a => Free f a -> a Source #

sum :: Num a => Free f a -> a Source #

product :: Num a => Free f a -> a Source #

Foldable (Array i) | Since: base-4.8.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => Array i m -> m Source #

foldMap :: Monoid m => (a -> m) -> Array i a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Array i a -> m Source #

foldr :: (a -> b -> b) -> b -> Array i a -> b Source #

foldr' :: (a -> b -> b) -> b -> Array i a -> b Source #

foldl :: (b -> a -> b) -> b -> Array i a -> b Source #

foldl' :: (b -> a -> b) -> b -> Array i a -> b Source #

foldr1 :: (a -> a -> a) -> Array i a -> a Source #

foldl1 :: (a -> a -> a) -> Array i a -> a Source #

toList :: Array i a -> [a] Source #

null :: Array i a -> Bool Source #

length :: Array i a -> Int Source #

elem :: Eq a => a -> Array i a -> Bool Source #

maximum :: Ord a => Array i a -> a Source #

minimum :: Ord a => Array i a -> a Source #

sum :: Num a => Array i a -> a Source #

product :: Num a => Array i a -> a Source #

Foldable (Either a) | Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => Either a m -> m Source #

foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m Source #

foldMap' :: Monoid m => (a0 -> m) -> Either a a0 -> m Source #

foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b Source #

foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b Source #

foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b Source #

foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b Source #

foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 Source #

foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 Source #

toList :: Either a a0 -> [a0] Source #

null :: Either a a0 -> Bool Source #

length :: Either a a0 -> Int Source #

elem :: Eq a0 => a0 -> Either a a0 -> Bool Source #

maximum :: Ord a0 => Either a a0 -> a0 Source #

minimum :: Ord a0 => Either a a0 -> a0 Source #

sum :: Num a0 => Either a a0 -> a0 Source #

product :: Num a0 => Either a a0 -> a0 Source #

Foldable (Proxy :: Type -> Type) | Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => Proxy m -> m Source #

foldMap :: Monoid m => (a -> m) -> Proxy a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Proxy a -> m Source #

foldr :: (a -> b -> b) -> b -> Proxy a -> b Source #

foldr' :: (a -> b -> b) -> b -> Proxy a -> b Source #

foldl :: (b -> a -> b) -> b -> Proxy a -> b Source #

foldl' :: (b -> a -> b) -> b -> Proxy a -> b Source #

foldr1 :: (a -> a -> a) -> Proxy a -> a Source #

foldl1 :: (a -> a -> a) -> Proxy a -> a Source #

toList :: Proxy a -> [a] Source #

null :: Proxy a -> Bool Source #

length :: Proxy a -> Int Source #

elem :: Eq a => a -> Proxy a -> Bool Source #

maximum :: Ord a => Proxy a -> a Source #

minimum :: Ord a => Proxy a -> a Source #

sum :: Num a => Proxy a -> a Source #

product :: Num a => Proxy a -> a Source #

Foldable (U1 :: Type -> Type) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => U1 m -> m Source #

foldMap :: Monoid m => (a -> m) -> U1 a -> m Source #

foldMap' :: Monoid m => (a -> m) -> U1 a -> m Source #

foldr :: (a -> b -> b) -> b -> U1 a -> b Source #

foldr' :: (a -> b -> b) -> b -> U1 a -> b Source #

foldl :: (b -> a -> b) -> b -> U1 a -> b Source #

foldl' :: (b -> a -> b) -> b -> U1 a -> b Source #

foldr1 :: (a -> a -> a) -> U1 a -> a Source #

foldl1 :: (a -> a -> a) -> U1 a -> a Source #

toList :: U1 a -> [a] Source #

null :: U1 a -> Bool Source #

length :: U1 a -> Int Source #

elem :: Eq a => a -> U1 a -> Bool Source #

maximum :: Ord a => U1 a -> a Source #

minimum :: Ord a => U1 a -> a Source #

sum :: Num a => U1 a -> a Source #

product :: Num a => U1 a -> a Source #

Foldable (UAddr :: Type -> Type) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => UAddr m -> m Source #

foldMap :: Monoid m => (a -> m) -> UAddr a -> m Source #

foldMap' :: Monoid m => (a -> m) -> UAddr a -> m Source #

foldr :: (a -> b -> b) -> b -> UAddr a -> b Source #

foldr' :: (a -> b -> b) -> b -> UAddr a -> b Source #

foldl :: (b -> a -> b) -> b -> UAddr a -> b Source #

foldl' :: (b -> a -> b) -> b -> UAddr a -> b Source #

foldr1 :: (a -> a -> a) -> UAddr a -> a Source #

foldl1 :: (a -> a -> a) -> UAddr a -> a Source #

toList :: UAddr a -> [a] Source #

null :: UAddr a -> Bool Source #

length :: UAddr a -> Int Source #

elem :: Eq a => a -> UAddr a -> Bool Source #

maximum :: Ord a => UAddr a -> a Source #

minimum :: Ord a => UAddr a -> a Source #

sum :: Num a => UAddr a -> a Source #

product :: Num a => UAddr a -> a Source #

Foldable (UChar :: Type -> Type) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => UChar m -> m Source #

foldMap :: Monoid m => (a -> m) -> UChar a -> m Source #

foldMap' :: Monoid m => (a -> m) -> UChar a -> m Source #

foldr :: (a -> b -> b) -> b -> UChar a -> b Source #

foldr' :: (a -> b -> b) -> b -> UChar a -> b Source #

foldl :: (b -> a -> b) -> b -> UChar a -> b Source #

foldl' :: (b -> a -> b) -> b -> UChar a -> b Source #

foldr1 :: (a -> a -> a) -> UChar a -> a Source #

foldl1 :: (a -> a -> a) -> UChar a -> a Source #

toList :: UChar a -> [a] Source #

null :: UChar a -> Bool Source #

length :: UChar a -> Int Source #

elem :: Eq a => a -> UChar a -> Bool Source #

maximum :: Ord a => UChar a -> a Source #

minimum :: Ord a => UChar a -> a Source #

sum :: Num a => UChar a -> a Source #

product :: Num a => UChar a -> a Source #

Foldable (UDouble :: Type -> Type) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => UDouble m -> m Source #

foldMap :: Monoid m => (a -> m) -> UDouble a -> m Source #

foldMap' :: Monoid m => (a -> m) -> UDouble a -> m Source #

foldr :: (a -> b -> b) -> b -> UDouble a -> b Source #

foldr' :: (a -> b -> b) -> b -> UDouble a -> b Source #

foldl :: (b -> a -> b) -> b -> UDouble a -> b Source #

foldl' :: (b -> a -> b) -> b -> UDouble a -> b Source #

foldr1 :: (a -> a -> a) -> UDouble a -> a Source #

foldl1 :: (a -> a -> a) -> UDouble a -> a Source #

toList :: UDouble a -> [a] Source #

null :: UDouble a -> Bool Source #

length :: UDouble a -> Int Source #

elem :: Eq a => a -> UDouble a -> Bool Source #

maximum :: Ord a => UDouble a -> a Source #

minimum :: Ord a => UDouble a -> a Source #

sum :: Num a => UDouble a -> a Source #

product :: Num a => UDouble a -> a Source #

Foldable (UFloat :: Type -> Type) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => UFloat m -> m Source #

foldMap :: Monoid m => (a -> m) -> UFloat a -> m Source #

foldMap' :: Monoid m => (a -> m) -> UFloat a -> m Source #

foldr :: (a -> b -> b) -> b -> UFloat a -> b Source #

foldr' :: (a -> b -> b) -> b -> UFloat a -> b Source #

foldl :: (b -> a -> b) -> b -> UFloat a -> b Source #

foldl' :: (b -> a -> b) -> b -> UFloat a -> b Source #

foldr1 :: (a -> a -> a) -> UFloat a -> a Source #

foldl1 :: (a -> a -> a) -> UFloat a -> a Source #

toList :: UFloat a -> [a] Source #

null :: UFloat a -> Bool Source #

length :: UFloat a -> Int Source #

elem :: Eq a => a -> UFloat a -> Bool Source #

maximum :: Ord a => UFloat a -> a Source #

minimum :: Ord a => UFloat a -> a Source #

sum :: Num a => UFloat a -> a Source #

product :: Num a => UFloat a -> a Source #

Foldable (UInt :: Type -> Type) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => UInt m -> m Source #

foldMap :: Monoid m => (a -> m) -> UInt a -> m Source #

foldMap' :: Monoid m => (a -> m) -> UInt a -> m Source #

foldr :: (a -> b -> b) -> b -> UInt a -> b Source #

foldr' :: (a -> b -> b) -> b -> UInt a -> b Source #

foldl :: (b -> a -> b) -> b -> UInt a -> b Source #

foldl' :: (b -> a -> b) -> b -> UInt a -> b Source #

foldr1 :: (a -> a -> a) -> UInt a -> a Source #

foldl1 :: (a -> a -> a) -> UInt a -> a Source #

toList :: UInt a -> [a] Source #

null :: UInt a -> Bool Source #

length :: UInt a -> Int Source #

elem :: Eq a => a -> UInt a -> Bool Source #

maximum :: Ord a => UInt a -> a Source #

minimum :: Ord a => UInt a -> a Source #

sum :: Num a => UInt a -> a Source #

product :: Num a => UInt a -> a Source #

Foldable (UWord :: Type -> Type) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => UWord m -> m Source #

foldMap :: Monoid m => (a -> m) -> UWord a -> m Source #

foldMap' :: Monoid m => (a -> m) -> UWord a -> m Source #

foldr :: (a -> b -> b) -> b -> UWord a -> b Source #

foldr' :: (a -> b -> b) -> b -> UWord a -> b Source #

foldl :: (b -> a -> b) -> b -> UWord a -> b Source #

foldl' :: (b -> a -> b) -> b -> UWord a -> b Source #

foldr1 :: (a -> a -> a) -> UWord a -> a Source #

foldl1 :: (a -> a -> a) -> UWord a -> a Source #

toList :: UWord a -> [a] Source #

null :: UWord a -> Bool Source #

length :: UWord a -> Int Source #

elem :: Eq a => a -> UWord a -> Bool Source #

maximum :: Ord a => UWord a -> a Source #

minimum :: Ord a => UWord a -> a Source #

sum :: Num a => UWord a -> a Source #

product :: Num a => UWord a -> a Source #

Foldable (V1 :: Type -> Type) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => V1 m -> m Source #

foldMap :: Monoid m => (a -> m) -> V1 a -> m Source #

foldMap' :: Monoid m => (a -> m) -> V1 a -> m Source #

foldr :: (a -> b -> b) -> b -> V1 a -> b Source #

foldr' :: (a -> b -> b) -> b -> V1 a -> b Source #

foldl :: (b -> a -> b) -> b -> V1 a -> b Source #

foldl' :: (b -> a -> b) -> b -> V1 a -> b Source #

foldr1 :: (a -> a -> a) -> V1 a -> a Source #

foldl1 :: (a -> a -> a) -> V1 a -> a Source #

toList :: V1 a -> [a] Source #

null :: V1 a -> Bool Source #

length :: V1 a -> Int Source #

elem :: Eq a => a -> V1 a -> Bool Source #

maximum :: Ord a => V1 a -> a Source #

minimum :: Ord a => V1 a -> a Source #

sum :: Num a => V1 a -> a Source #

product :: Num a => V1 a -> a Source #

Foldable f => Foldable (Yoneda f) |

Instance details

Defined in Data.Functor.Yoneda

Methods

fold :: Monoid m => Yoneda f m -> m Source #

foldMap :: Monoid m => (a -> m) -> Yoneda f a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Yoneda f a -> m Source #

foldr :: (a -> b -> b) -> b -> Yoneda f a -> b Source #

foldr' :: (a -> b -> b) -> b -> Yoneda f a -> b Source #

foldl :: (b -> a -> b) -> b -> Yoneda f a -> b Source #

foldl' :: (b -> a -> b) -> b -> Yoneda f a -> b Source #

foldr1 :: (a -> a -> a) -> Yoneda f a -> a Source #

foldl1 :: (a -> a -> a) -> Yoneda f a -> a Source #

toList :: Yoneda f a -> [a] Source #

null :: Yoneda f a -> Bool Source #

length :: Yoneda f a -> Int Source #

elem :: Eq a => a -> Yoneda f a -> Bool Source #

maximum :: Ord a => Yoneda f a -> a Source #

minimum :: Ord a => Yoneda f a -> a Source #

sum :: Num a => Yoneda f a -> a Source #

product :: Num a => Yoneda f a -> a Source #

Foldable f => Foldable (Point f) |

Instance details

Defined in Linear.Affine

Methods

fold :: Monoid m => Point f m -> m Source #

foldMap :: Monoid m => (a -> m) -> Point f a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Point f a -> m Source #

foldr :: (a -> b -> b) -> b -> Point f a -> b Source #

foldr' :: (a -> b -> b) -> b -> Point f a -> b Source #

foldl :: (b -> a -> b) -> b -> Point f a -> b Source #

foldl' :: (b -> a -> b) -> b -> Point f a -> b Source #

foldr1 :: (a -> a -> a) -> Point f a -> a Source #

foldl1 :: (a -> a -> a) -> Point f a -> a Source #

toList :: Point f a -> [a] Source #

null :: Point f a -> Bool Source #

length :: Point f a -> Int Source #

elem :: Eq a => a -> Point f a -> Bool Source #

maximum :: Ord a => Point f a -> a Source #

minimum :: Ord a => Point f a -> a Source #

sum :: Num a => Point f a -> a Source #

product :: Num a => Point f a -> a Source #

Foldable f => Foldable (Point f) |

Instance details

Defined in SDL.Internal.Vect

Methods

fold :: Monoid m => Point f m -> m Source #

foldMap :: Monoid m => (a -> m) -> Point f a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Point f a -> m Source #

foldr :: (a -> b -> b) -> b -> Point f a -> b Source #

foldr' :: (a -> b -> b) -> b -> Point f a -> b Source #

foldl :: (b -> a -> b) -> b -> Point f a -> b Source #

foldl' :: (b -> a -> b) -> b -> Point f a -> b Source #

foldr1 :: (a -> a -> a) -> Point f a -> a Source #

foldl1 :: (a -> a -> a) -> Point f a -> a Source #

toList :: Point f a -> [a] Source #

null :: Point f a -> Bool Source #

length :: Point f a -> Int Source #

elem :: Eq a => a -> Point f a -> Bool Source #

maximum :: Ord a => Point f a -> a Source #

minimum :: Ord a => Point f a -> a Source #

sum :: Num a => Point f a -> a Source #

product :: Num a => Point f a -> a Source #

Foldable (Either e) |

Instance details

Defined in Data.Strict.Either

Methods

fold :: Monoid m => Either e m -> m Source #

foldMap :: Monoid m => (a -> m) -> Either e a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Either e a -> m Source #

foldr :: (a -> b -> b) -> b -> Either e a -> b Source #

foldr' :: (a -> b -> b) -> b -> Either e a -> b Source #

foldl :: (b -> a -> b) -> b -> Either e a -> b Source #

foldl' :: (b -> a -> b) -> b -> Either e a -> b Source #

foldr1 :: (a -> a -> a) -> Either e a -> a Source #

foldl1 :: (a -> a -> a) -> Either e a -> a Source #

toList :: Either e a -> [a] Source #

null :: Either e a -> Bool Source #

length :: Either e a -> Int Source #

elem :: Eq a => a -> Either e a -> Bool Source #

maximum :: Ord a => Either e a -> a Source #

minimum :: Ord a => Either e a -> a Source #

sum :: Num a => Either e a -> a Source #

product :: Num a => Either e a -> a Source #

Foldable (These a) |

Instance details

Defined in Data.Strict.These

Methods

fold :: Monoid m => These a m -> m Source #

foldMap :: Monoid m => (a0 -> m) -> These a a0 -> m Source #

foldMap' :: Monoid m => (a0 -> m) -> These a a0 -> m Source #

foldr :: (a0 -> b -> b) -> b -> These a a0 -> b Source #

foldr' :: (a0 -> b -> b) -> b -> These a a0 -> b Source #

foldl :: (b -> a0 -> b) -> b -> These a a0 -> b Source #

foldl' :: (b -> a0 -> b) -> b -> These a a0 -> b Source #

foldr1 :: (a0 -> a0 -> a0) -> These a a0 -> a0 Source #

foldl1 :: (a0 -> a0 -> a0) -> These a a0 -> a0 Source #

toList :: These a a0 -> [a0] Source #

null :: These a a0 -> Bool Source #

length :: These a a0 -> Int Source #

elem :: Eq a0 => a0 -> These a a0 -> Bool Source #

maximum :: Ord a0 => These a a0 -> a0 Source #

minimum :: Ord a0 => These a a0 -> a0 Source #

sum :: Num a0 => These a a0 -> a0 Source #

product :: Num a0 => These a a0 -> a0 Source #

Foldable (Pair e) |

Instance details

Defined in Data.Strict.Tuple

Methods

fold :: Monoid m => Pair e m -> m Source #

foldMap :: Monoid m => (a -> m) -> Pair e a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Pair e a -> m Source #

foldr :: (a -> b -> b) -> b -> Pair e a -> b Source #

foldr' :: (a -> b -> b) -> b -> Pair e a -> b Source #

foldl :: (b -> a -> b) -> b -> Pair e a -> b Source #

foldl' :: (b -> a -> b) -> b -> Pair e a -> b Source #

foldr1 :: (a -> a -> a) -> Pair e a -> a Source #

foldl1 :: (a -> a -> a) -> Pair e a -> a Source #

toList :: Pair e a -> [a] Source #

null :: Pair e a -> Bool Source #

length :: Pair e a -> Int Source #

elem :: Eq a => a -> Pair e a -> Bool Source #

maximum :: Ord a => Pair e a -> a Source #

minimum :: Ord a => Pair e a -> a Source #

sum :: Num a => Pair e a -> a Source #

product :: Num a => Pair e a -> a Source #

Foldable (These a) |

Instance details

Defined in Data.These

Methods

fold :: Monoid m => These a m -> m Source #

foldMap :: Monoid m => (a0 -> m) -> These a a0 -> m Source #

foldMap' :: Monoid m => (a0 -> m) -> These a a0 -> m Source #

foldr :: (a0 -> b -> b) -> b -> These a a0 -> b Source #

foldr' :: (a0 -> b -> b) -> b -> These a a0 -> b Source #

foldl :: (b -> a0 -> b) -> b -> These a a0 -> b Source #

foldl' :: (b -> a0 -> b) -> b -> These a a0 -> b Source #

foldr1 :: (a0 -> a0 -> a0) -> These a a0 -> a0 Source #

foldl1 :: (a0 -> a0 -> a0) -> These a a0 -> a0 Source #

toList :: These a a0 -> [a0] Source #

null :: These a a0 -> Bool Source #

length :: These a a0 -> Int Source #

elem :: Eq a0 => a0 -> These a a0 -> Bool Source #

maximum :: Ord a0 => These a a0 -> a0 Source #

minimum :: Ord a0 => These a a0 -> a0 Source #

sum :: Num a0 => These a a0 -> a0 Source #

product :: Num a0 => These a a0 -> a0 Source #

Foldable f => Foldable (Lift f) |

Instance details

Defined in Control.Applicative.Lift

Methods

fold :: Monoid m => Lift f m -> m Source #

foldMap :: Monoid m => (a -> m) -> Lift f a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Lift f a -> m Source #

foldr :: (a -> b -> b) -> b -> Lift f a -> b Source #

foldr' :: (a -> b -> b) -> b -> Lift f a -> b Source #

foldl :: (b -> a -> b) -> b -> Lift f a -> b Source #

foldl' :: (b -> a -> b) -> b -> Lift f a -> b Source #

foldr1 :: (a -> a -> a) -> Lift f a -> a Source #

foldl1 :: (a -> a -> a) -> Lift f a -> a Source #

toList :: Lift f a -> [a] Source #

null :: Lift f a -> Bool Source #

length :: Lift f a -> Int Source #

elem :: Eq a => a -> Lift f a -> Bool Source #

maximum :: Ord a => Lift f a -> a Source #

minimum :: Ord a => Lift f a -> a Source #

sum :: Num a => Lift f a -> a Source #

product :: Num a => Lift f a -> a Source #

Foldable f => Foldable (MaybeT f) |

Instance details

Defined in Control.Monad.Trans.Maybe

Methods

fold :: Monoid m => MaybeT f m -> m Source #

foldMap :: Monoid m => (a -> m) -> MaybeT f a -> m Source #

foldMap' :: Monoid m => (a -> m) -> MaybeT f a -> m Source #

foldr :: (a -> b -> b) -> b -> MaybeT f a -> b Source #

foldr' :: (a -> b -> b) -> b -> MaybeT f a -> b Source #

foldl :: (b -> a -> b) -> b -> MaybeT f a -> b Source #

foldl' :: (b -> a -> b) -> b -> MaybeT f a -> b Source #

foldr1 :: (a -> a -> a) -> MaybeT f a -> a Source #

foldl1 :: (a -> a -> a) -> MaybeT f a -> a Source #

toList :: MaybeT f a -> [a] Source #

null :: MaybeT f a -> Bool Source #

length :: MaybeT f a -> Int Source #

elem :: Eq a => a -> MaybeT f a -> Bool Source #

maximum :: Ord a => MaybeT f a -> a Source #

minimum :: Ord a => MaybeT f a -> a Source #

sum :: Num a => MaybeT f a -> a Source #

product :: Num a => MaybeT f a -> a Source #

Foldable (HashMap k) |

Instance details

Defined in Data.HashMap.Internal

Methods

fold :: Monoid m => HashMap k m -> m Source #

foldMap :: Monoid m => (a -> m) -> HashMap k a -> m Source #

foldMap' :: Monoid m => (a -> m) -> HashMap k a -> m Source #

foldr :: (a -> b -> b) -> b -> HashMap k a -> b Source #

foldr' :: (a -> b -> b) -> b -> HashMap k a -> b Source #

foldl :: (b -> a -> b) -> b -> HashMap k a -> b Source #

foldl' :: (b -> a -> b) -> b -> HashMap k a -> b Source #

foldr1 :: (a -> a -> a) -> HashMap k a -> a Source #

foldl1 :: (a -> a -> a) -> HashMap k a -> a Source #

toList :: HashMap k a -> [a] Source #

null :: HashMap k a -> Bool Source #

length :: HashMap k a -> Int Source #

elem :: Eq a => a -> HashMap k a -> Bool Source #

maximum :: Ord a => HashMap k a -> a Source #

minimum :: Ord a => HashMap k a -> a Source #

sum :: Num a => HashMap k a -> a Source #

product :: Num a => HashMap k a -> a Source #

Foldable ((,) a) | Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => (a, m) -> m Source #

foldMap :: Monoid m => (a0 -> m) -> (a, a0) -> m Source #

foldMap' :: Monoid m => (a0 -> m) -> (a, a0) -> m Source #

foldr :: (a0 -> b -> b) -> b -> (a, a0) -> b Source #

foldr' :: (a0 -> b -> b) -> b -> (a, a0) -> b Source #

foldl :: (b -> a0 -> b) -> b -> (a, a0) -> b Source #

foldl' :: (b -> a0 -> b) -> b -> (a, a0) -> b Source #

foldr1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 Source #

foldl1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 Source #

toList :: (a, a0) -> [a0] Source #

null :: (a, a0) -> Bool Source #

length :: (a, a0) -> Int Source #

elem :: Eq a0 => a0 -> (a, a0) -> Bool Source #

maximum :: Ord a0 => (a, a0) -> a0 Source #

minimum :: Ord a0 => (a, a0) -> a0 Source #

sum :: Num a0 => (a, a0) -> a0 Source #

product :: Num a0 => (a, a0) -> a0 Source #

Bifoldable p => Foldable (Fix p) |

Instance details

Defined in Data.Bifunctor.Fix

Methods

fold :: Monoid m => Fix p m -> m Source #

foldMap :: Monoid m => (a -> m) -> Fix p a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Fix p a -> m Source #

foldr :: (a -> b -> b) -> b -> Fix p a -> b Source #

foldr' :: (a -> b -> b) -> b -> Fix p a -> b Source #

foldl :: (b -> a -> b) -> b -> Fix p a -> b Source #

foldl' :: (b -> a -> b) -> b -> Fix p a -> b Source #

foldr1 :: (a -> a -> a) -> Fix p a -> a Source #

foldl1 :: (a -> a -> a) -> Fix p a -> a Source #

toList :: Fix p a -> [a] Source #

null :: Fix p a -> Bool Source #

length :: Fix p a -> Int Source #

elem :: Eq a => a -> Fix p a -> Bool Source #

maximum :: Ord a => Fix p a -> a Source #

minimum :: Ord a => Fix p a -> a Source #

sum :: Num a => Fix p a -> a Source #

product :: Num a => Fix p a -> a Source #

Bifoldable p => Foldable (Join p) |

Instance details

Defined in Data.Bifunctor.Join

Methods

fold :: Monoid m => Join p m -> m Source #

foldMap :: Monoid m => (a -> m) -> Join p a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Join p a -> m Source #

foldr :: (a -> b -> b) -> b -> Join p a -> b Source #

foldr' :: (a -> b -> b) -> b -> Join p a -> b Source #

foldl :: (b -> a -> b) -> b -> Join p a -> b Source #

foldl' :: (b -> a -> b) -> b -> Join p a -> b Source #

foldr1 :: (a -> a -> a) -> Join p a -> a Source #

foldl1 :: (a -> a -> a) -> Join p a -> a Source #

toList :: Join p a -> [a] Source #

null :: Join p a -> Bool Source #

length :: Join p a -> Int Source #

elem :: Eq a => a -> Join p a -> Bool Source #

maximum :: Ord a => Join p a -> a Source #

minimum :: Ord a => Join p a -> a Source #

sum :: Num a => Join p a -> a Source #

product :: Num a => Join p a -> a Source #

Foldable f => Foldable (CofreeF f a) |

Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

fold :: Monoid m => CofreeF f a m -> m Source #

foldMap :: Monoid m => (a0 -> m) -> CofreeF f a a0 -> m Source #

foldMap' :: Monoid m => (a0 -> m) -> CofreeF f a a0 -> m Source #

foldr :: (a0 -> b -> b) -> b -> CofreeF f a a0 -> b Source #

foldr' :: (a0 -> b -> b) -> b -> CofreeF f a a0 -> b Source #

foldl :: (b -> a0 -> b) -> b -> CofreeF f a a0 -> b Source #

foldl' :: (b -> a0 -> b) -> b -> CofreeF f a a0 -> b Source #

foldr1 :: (a0 -> a0 -> a0) -> CofreeF f a a0 -> a0 Source #

foldl1 :: (a0 -> a0 -> a0) -> CofreeF f a a0 -> a0 Source #

toList :: CofreeF f a a0 -> [a0] Source #

null :: CofreeF f a a0 -> Bool Source #

length :: CofreeF f a a0 -> Int Source #

elem :: Eq a0 => a0 -> CofreeF f a a0 -> Bool Source #

maximum :: Ord a0 => CofreeF f a a0 -> a0 Source #

minimum :: Ord a0 => CofreeF f a a0 -> a0 Source #

sum :: Num a0 => CofreeF f a a0 -> a0 Source #

product :: Num a0 => CofreeF f a a0 -> a0 Source #

(Foldable f, Foldable w) => Foldable (CofreeT f w) |

Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

fold :: Monoid m => CofreeT f w m -> m Source #

foldMap :: Monoid m => (a -> m) -> CofreeT f w a -> m Source #

foldMap' :: Monoid m => (a -> m) -> CofreeT f w a -> m Source #

foldr :: (a -> b -> b) -> b -> CofreeT f w a -> b Source #

foldr' :: (a -> b -> b) -> b -> CofreeT f w a -> b Source #

foldl :: (b -> a -> b) -> b -> CofreeT f w a -> b Source #

foldl' :: (b -> a -> b) -> b -> CofreeT f w a -> b Source #

foldr1 :: (a -> a -> a) -> CofreeT f w a -> a Source #

foldl1 :: (a -> a -> a) -> CofreeT f w a -> a Source #

toList :: CofreeT f w a -> [a] Source #

null :: CofreeT f w a -> Bool Source #

length :: CofreeT f w a -> Int Source #

elem :: Eq a => a -> CofreeT f w a -> Bool Source #

maximum :: Ord a => CofreeT f w a -> a Source #

minimum :: Ord a => CofreeT f w a -> a Source #

sum :: Num a => CofreeT f w a -> a Source #

product :: Num a => CofreeT f w a -> a Source #

Foldable f => Foldable (FreeF f a) |

Instance details

Defined in Control.Monad.Trans.Free

Methods

fold :: Monoid m => FreeF f a m -> m Source #

foldMap :: Monoid m => (a0 -> m) -> FreeF f a a0 -> m Source #

foldMap' :: Monoid m => (a0 -> m) -> FreeF f a a0 -> m Source #

foldr :: (a0 -> b -> b) -> b -> FreeF f a a0 -> b Source #

foldr' :: (a0 -> b -> b) -> b -> FreeF f a a0 -> b Source #

foldl :: (b -> a0 -> b) -> b -> FreeF f a a0 -> b Source #

foldl' :: (b -> a0 -> b) -> b -> FreeF f a a0 -> b Source #

foldr1 :: (a0 -> a0 -> a0) -> FreeF f a a0 -> a0 Source #

foldl1 :: (a0 -> a0 -> a0) -> FreeF f a a0 -> a0 Source #

toList :: FreeF f a a0 -> [a0] Source #

null :: FreeF f a a0 -> Bool Source #

length :: FreeF f a a0 -> Int Source #

elem :: Eq a0 => a0 -> FreeF f a a0 -> Bool Source #

maximum :: Ord a0 => FreeF f a a0 -> a0 Source #

minimum :: Ord a0 => FreeF f a a0 -> a0 Source #

sum :: Num a0 => FreeF f a a0 -> a0 Source #

product :: Num a0 => FreeF f a a0 -> a0 Source #

(Foldable m, Foldable f) => Foldable (FreeT f m) |

Instance details

Defined in Control.Monad.Trans.Free

Methods

fold :: Monoid m0 => FreeT f m m0 -> m0 Source #

foldMap :: Monoid m0 => (a -> m0) -> FreeT f m a -> m0 Source #

foldMap' :: Monoid m0 => (a -> m0) -> FreeT f m a -> m0 Source #

foldr :: (a -> b -> b) -> b -> FreeT f m a -> b Source #

foldr' :: (a -> b -> b) -> b -> FreeT f m a -> b Source #

foldl :: (b -> a -> b) -> b -> FreeT f m a -> b Source #

foldl' :: (b -> a -> b) -> b -> FreeT f m a -> b Source #

foldr1 :: (a -> a -> a) -> FreeT f m a -> a Source #

foldl1 :: (a -> a -> a) -> FreeT f m a -> a Source #

toList :: FreeT f m a -> [a] Source #

null :: FreeT f m a -> Bool Source #

length :: FreeT f m a -> Int Source #

elem :: Eq a => a -> FreeT f m a -> Bool Source #

maximum :: Ord a => FreeT f m a -> a Source #

minimum :: Ord a => FreeT f m a -> a Source #

sum :: Num a => FreeT f m a -> a Source #

product :: Num a => FreeT f m a -> a Source #

Foldable (Const m :: Type -> Type) | Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

fold :: Monoid m0 => Const m m0 -> m0 Source #

foldMap :: Monoid m0 => (a -> m0) -> Const m a -> m0 Source #

foldMap' :: Monoid m0 => (a -> m0) -> Const m a -> m0 Source #

foldr :: (a -> b -> b) -> b -> Const m a -> b Source #

foldr' :: (a -> b -> b) -> b -> Const m a -> b Source #

foldl :: (b -> a -> b) -> b -> Const m a -> b Source #

foldl' :: (b -> a -> b) -> b -> Const m a -> b Source #

foldr1 :: (a -> a -> a) -> Const m a -> a Source #

foldl1 :: (a -> a -> a) -> Const m a -> a Source #

toList :: Const m a -> [a] Source #

null :: Const m a -> Bool Source #

length :: Const m a -> Int Source #

elem :: Eq a => a -> Const m a -> Bool Source #

maximum :: Ord a => Const m a -> a Source #

minimum :: Ord a => Const m a -> a Source #

sum :: Num a => Const m a -> a Source #

product :: Num a => Const m a -> a Source #

Foldable f => Foldable (Ap f) | Since: base-4.12.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => Ap f m -> m Source #

foldMap :: Monoid m => (a -> m) -> Ap f a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Ap f a -> m Source #

foldr :: (a -> b -> b) -> b -> Ap f a -> b Source #

foldr' :: (a -> b -> b) -> b -> Ap f a -> b Source #

foldl :: (b -> a -> b) -> b -> Ap f a -> b Source #

foldl' :: (b -> a -> b) -> b -> Ap f a -> b Source #

foldr1 :: (a -> a -> a) -> Ap f a -> a Source #

foldl1 :: (a -> a -> a) -> Ap f a -> a Source #

toList :: Ap f a -> [a] Source #

null :: Ap f a -> Bool Source #

length :: Ap f a -> Int Source #

elem :: Eq a => a -> Ap f a -> Bool Source #

maximum :: Ord a => Ap f a -> a Source #

minimum :: Ord a => Ap f a -> a Source #

sum :: Num a => Ap f a -> a Source #

product :: Num a => Ap f a -> a Source #

Foldable f => Foldable (Alt f) | Since: base-4.12.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => Alt f m -> m Source #

foldMap :: Monoid m => (a -> m) -> Alt f a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Alt f a -> m Source #

foldr :: (a -> b -> b) -> b -> Alt f a -> b Source #

foldr' :: (a -> b -> b) -> b -> Alt f a -> b Source #

foldl :: (b -> a -> b) -> b -> Alt f a -> b Source #

foldl' :: (b -> a -> b) -> b -> Alt f a -> b Source #

foldr1 :: (a -> a -> a) -> Alt f a -> a Source #

foldl1 :: (a -> a -> a) -> Alt f a -> a Source #

toList :: Alt f a -> [a] Source #

null :: Alt f a -> Bool Source #

length :: Alt f a -> Int Source #

elem :: Eq a => a -> Alt f a -> Bool Source #

maximum :: Ord a => Alt f a -> a Source #

minimum :: Ord a => Alt f a -> a Source #

sum :: Num a => Alt f a -> a Source #

product :: Num a => Alt f a -> a Source #

Foldable f => Foldable (Rec1 f) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => Rec1 f m -> m Source #

foldMap :: Monoid m => (a -> m) -> Rec1 f a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Rec1 f a -> m Source #

foldr :: (a -> b -> b) -> b -> Rec1 f a -> b Source #

foldr' :: (a -> b -> b) -> b -> Rec1 f a -> b Source #

foldl :: (b -> a -> b) -> b -> Rec1 f a -> b Source #

foldl' :: (b -> a -> b) -> b -> Rec1 f a -> b Source #

foldr1 :: (a -> a -> a) -> Rec1 f a -> a Source #

foldl1 :: (a -> a -> a) -> Rec1 f a -> a Source #

toList :: Rec1 f a -> [a] Source #

null :: Rec1 f a -> Bool Source #

length :: Rec1 f a -> Int Source #

elem :: Eq a => a -> Rec1 f a -> Bool Source #

maximum :: Ord a => Rec1 f a -> a Source #

minimum :: Ord a => Rec1 f a -> a Source #

sum :: Num a => Rec1 f a -> a Source #

product :: Num a => Rec1 f a -> a Source #

Foldable (V n) |

Instance details

Defined in Linear.V

Methods

fold :: Monoid m => V n m -> m Source #

foldMap :: Monoid m => (a -> m) -> V n a -> m Source #

foldMap' :: Monoid m => (a -> m) -> V n a -> m Source #

foldr :: (a -> b -> b) -> b -> V n a -> b Source #

foldr' :: (a -> b -> b) -> b -> V n a -> b Source #

foldl :: (b -> a -> b) -> b -> V n a -> b Source #

foldl' :: (b -> a -> b) -> b -> V n a -> b Source #

foldr1 :: (a -> a -> a) -> V n a -> a Source #

foldl1 :: (a -> a -> a) -> V n a -> a Source #

toList :: V n a -> [a] Source #

null :: V n a -> Bool Source #

length :: V n a -> Int Source #

elem :: Eq a => a -> V n a -> Bool Source #

maximum :: Ord a => V n a -> a Source #

minimum :: Ord a => V n a -> a Source #

sum :: Num a => V n a -> a Source #

product :: Num a => V n a -> a Source #

Foldable (Tagged s) |

Instance details

Defined in Data.Tagged

Methods

fold :: Monoid m => Tagged s m -> m Source #

foldMap :: Monoid m => (a -> m) -> Tagged s a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Tagged s a -> m Source #

foldr :: (a -> b -> b) -> b -> Tagged s a -> b Source #

foldr' :: (a -> b -> b) -> b -> Tagged s a -> b Source #

foldl :: (b -> a -> b) -> b -> Tagged s a -> b Source #

foldl' :: (b -> a -> b) -> b -> Tagged s a -> b Source #

foldr1 :: (a -> a -> a) -> Tagged s a -> a Source #

foldl1 :: (a -> a -> a) -> Tagged s a -> a Source #

toList :: Tagged s a -> [a] Source #

null :: Tagged s a -> Bool Source #

length :: Tagged s a -> Int Source #

elem :: Eq a => a -> Tagged s a -> Bool Source #

maximum :: Ord a => Tagged s a -> a Source #

minimum :: Ord a => Tagged s a -> a Source #

sum :: Num a => Tagged s a -> a Source #

product :: Num a => Tagged s a -> a Source #

(Foldable f, Foldable g) => Foldable (These1 f g) |

Instance details

Defined in Data.Functor.These

Methods

fold :: Monoid m => These1 f g m -> m Source #

foldMap :: Monoid m => (a -> m) -> These1 f g a -> m Source #

foldMap' :: Monoid m => (a -> m) -> These1 f g a -> m Source #

foldr :: (a -> b -> b) -> b -> These1 f g a -> b Source #

foldr' :: (a -> b -> b) -> b -> These1 f g a -> b Source #

foldl :: (b -> a -> b) -> b -> These1 f g a -> b Source #

foldl' :: (b -> a -> b) -> b -> These1 f g a -> b Source #

foldr1 :: (a -> a -> a) -> These1 f g a -> a Source #

foldl1 :: (a -> a -> a) -> These1 f g a -> a Source #

toList :: These1 f g a -> [a] Source #

null :: These1 f g a -> Bool Source #

length :: These1 f g a -> Int Source #

elem :: Eq a => a -> These1 f g a -> Bool Source #

maximum :: Ord a => These1 f g a -> a Source #

minimum :: Ord a => These1 f g a -> a Source #

sum :: Num a => These1 f g a -> a Source #

product :: Num a => These1 f g a -> a Source #

Foldable f => Foldable (Backwards f) | Derived instance.

Instance details

Defined in Control.Applicative.Backwards

Methods

fold :: Monoid m => Backwards f m -> m Source #

foldMap :: Monoid m => (a -> m) -> Backwards f a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Backwards f a -> m Source #

foldr :: (a -> b -> b) -> b -> Backwards f a -> b Source #

foldr' :: (a -> b -> b) -> b -> Backwards f a -> b Source #

foldl :: (b -> a -> b) -> b -> Backwards f a -> b Source #

foldl' :: (b -> a -> b) -> b -> Backwards f a -> b Source #

foldr1 :: (a -> a -> a) -> Backwards f a -> a Source #

foldl1 :: (a -> a -> a) -> Backwards f a -> a Source #

toList :: Backwards f a -> [a] Source #

null :: Backwards f a -> Bool Source #

length :: Backwards f a -> Int Source #

elem :: Eq a => a -> Backwards f a -> Bool Source #

maximum :: Ord a => Backwards f a -> a Source #

minimum :: Ord a => Backwards f a -> a Source #

sum :: Num a => Backwards f a -> a Source #

product :: Num a => Backwards f a -> a Source #

Foldable f => Foldable (ExceptT e f) |

Instance details

Defined in Control.Monad.Trans.Except

Methods

fold :: Monoid m => ExceptT e f m -> m Source #

foldMap :: Monoid m => (a -> m) -> ExceptT e f a -> m Source #

foldMap' :: Monoid m => (a -> m) -> ExceptT e f a -> m Source #

foldr :: (a -> b -> b) -> b -> ExceptT e f a -> b Source #

foldr' :: (a -> b -> b) -> b -> ExceptT e f a -> b Source #

foldl :: (b -> a -> b) -> b -> ExceptT e f a -> b Source #

foldl' :: (b -> a -> b) -> b -> ExceptT e f a -> b Source #

foldr1 :: (a -> a -> a) -> ExceptT e f a -> a Source #

foldl1 :: (a -> a -> a) -> ExceptT e f a -> a Source #

toList :: ExceptT e f a -> [a] Source #

null :: ExceptT e f a -> Bool Source #

length :: ExceptT e f a -> Int Source #

elem :: Eq a => a -> ExceptT e f a -> Bool Source #

maximum :: Ord a => ExceptT e f a -> a Source #

minimum :: Ord a => ExceptT e f a -> a Source #

sum :: Num a => ExceptT e f a -> a Source #

product :: Num a => ExceptT e f a -> a Source #

Foldable f => Foldable (IdentityT f) |

Instance details

Defined in Control.Monad.Trans.Identity

Methods

fold :: Monoid m => IdentityT f m -> m Source #

foldMap :: Monoid m => (a -> m) -> IdentityT f a -> m Source #

foldMap' :: Monoid m => (a -> m) -> IdentityT f a -> m Source #

foldr :: (a -> b -> b) -> b -> IdentityT f a -> b Source #

foldr' :: (a -> b -> b) -> b -> IdentityT f a -> b Source #

foldl :: (b -> a -> b) -> b -> IdentityT f a -> b Source #

foldl' :: (b -> a -> b) -> b -> IdentityT f a -> b Source #

foldr1 :: (a -> a -> a) -> IdentityT f a -> a Source #

foldl1 :: (a -> a -> a) -> IdentityT f a -> a Source #

toList :: IdentityT f a -> [a] Source #

null :: IdentityT f a -> Bool Source #

length :: IdentityT f a -> Int Source #

elem :: Eq a => a -> IdentityT f a -> Bool Source #

maximum :: Ord a => IdentityT f a -> a Source #

minimum :: Ord a => IdentityT f a -> a Source #

sum :: Num a => IdentityT f a -> a Source #

product :: Num a => IdentityT f a -> a Source #

Foldable f => Foldable (WriterT w f) |

Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

fold :: Monoid m => WriterT w f m -> m Source #

foldMap :: Monoid m => (a -> m) -> WriterT w f a -> m Source #

foldMap' :: Monoid m => (a -> m) -> WriterT w f a -> m Source #

foldr :: (a -> b -> b) -> b -> WriterT w f a -> b Source #

foldr' :: (a -> b -> b) -> b -> WriterT w f a -> b Source #

foldl :: (b -> a -> b) -> b -> WriterT w f a -> b Source #

foldl' :: (b -> a -> b) -> b -> WriterT w f a -> b Source #

foldr1 :: (a -> a -> a) -> WriterT w f a -> a Source #

foldl1 :: (a -> a -> a) -> WriterT w f a -> a Source #

toList :: WriterT w f a -> [a] Source #

null :: WriterT w f a -> Bool Source #

length :: WriterT w f a -> Int Source #

elem :: Eq a => a -> WriterT w f a -> Bool Source #

maximum :: Ord a => WriterT w f a -> a Source #

minimum :: Ord a => WriterT w f a -> a Source #

sum :: Num a => WriterT w f a -> a Source #

product :: Num a => WriterT w f a -> a Source #

Foldable f => Foldable (WriterT w f) |

Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

fold :: Monoid m => WriterT w f m -> m Source #

foldMap :: Monoid m => (a -> m) -> WriterT w f a -> m Source #

foldMap' :: Monoid m => (a -> m) -> WriterT w f a -> m Source #

foldr :: (a -> b -> b) -> b -> WriterT w f a -> b Source #

foldr' :: (a -> b -> b) -> b -> WriterT w f a -> b Source #

foldl :: (b -> a -> b) -> b -> WriterT w f a -> b Source #

foldl' :: (b -> a -> b) -> b -> WriterT w f a -> b Source #

foldr1 :: (a -> a -> a) -> WriterT w f a -> a Source #

foldl1 :: (a -> a -> a) -> WriterT w f a -> a Source #

toList :: WriterT w f a -> [a] Source #

null :: WriterT w f a -> Bool Source #

length :: WriterT w f a -> Int Source #

elem :: Eq a => a -> WriterT w f a -> Bool Source #

maximum :: Ord a => WriterT w f a -> a Source #

minimum :: Ord a => WriterT w f a -> a Source #

sum :: Num a => WriterT w f a -> a Source #

product :: Num a => WriterT w f a -> a Source #

Foldable (Constant a :: Type -> Type) |

Instance details

Defined in Data.Functor.Constant

Methods

fold :: Monoid m => Constant a m -> m Source #

foldMap :: Monoid m => (a0 -> m) -> Constant a a0 -> m Source #

foldMap' :: Monoid m => (a0 -> m) -> Constant a a0 -> m Source #

foldr :: (a0 -> b -> b) -> b -> Constant a a0 -> b Source #

foldr' :: (a0 -> b -> b) -> b -> Constant a a0 -> b Source #

foldl :: (b -> a0 -> b) -> b -> Constant a a0 -> b Source #

foldl' :: (b -> a0 -> b) -> b -> Constant a a0 -> b Source #

foldr1 :: (a0 -> a0 -> a0) -> Constant a a0 -> a0 Source #

foldl1 :: (a0 -> a0 -> a0) -> Constant a a0 -> a0 Source #

toList :: Constant a a0 -> [a0] Source #

null :: Constant a a0 -> Bool Source #

length :: Constant a a0 -> Int Source #

elem :: Eq a0 => a0 -> Constant a a0 -> Bool Source #

maximum :: Ord a0 => Constant a a0 -> a0 Source #

minimum :: Ord a0 => Constant a a0 -> a0 Source #

sum :: Num a0 => Constant a a0 -> a0 Source #

product :: Num a0 => Constant a a0 -> a0 Source #

Foldable f => Foldable (Reverse f) | Fold from right to left.

Instance details

Defined in Data.Functor.Reverse

Methods

fold :: Monoid m => Reverse f m -> m Source #

foldMap :: Monoid m => (a -> m) -> Reverse f a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Reverse f a -> m Source #

foldr :: (a -> b -> b) -> b -> Reverse f a -> b Source #

foldr' :: (a -> b -> b) -> b -> Reverse f a -> b Source #

foldl :: (b -> a -> b) -> b -> Reverse f a -> b Source #

foldl' :: (b -> a -> b) -> b -> Reverse f a -> b Source #

foldr1 :: (a -> a -> a) -> Reverse f a -> a Source #

foldl1 :: (a -> a -> a) -> Reverse f a -> a Source #

toList :: Reverse f a -> [a] Source #

null :: Reverse f a -> Bool Source #

length :: Reverse f a -> Int Source #

elem :: Eq a => a -> Reverse f a -> Bool Source #

maximum :: Ord a => Reverse f a -> a Source #

minimum :: Ord a => Reverse f a -> a Source #

sum :: Num a => Reverse f a -> a Source #

product :: Num a => Reverse f a -> a Source #

(Foldable f, Foldable g) => Foldable (Product f g) | Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

fold :: Monoid m => Product f g m -> m Source #

foldMap :: Monoid m => (a -> m) -> Product f g a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Product f g a -> m Source #

foldr :: (a -> b -> b) -> b -> Product f g a -> b Source #

foldr' :: (a -> b -> b) -> b -> Product f g a -> b Source #

foldl :: (b -> a -> b) -> b -> Product f g a -> b Source #

foldl' :: (b -> a -> b) -> b -> Product f g a -> b Source #

foldr1 :: (a -> a -> a) -> Product f g a -> a Source #

foldl1 :: (a -> a -> a) -> Product f g a -> a Source #

toList :: Product f g a -> [a] Source #

null :: Product f g a -> Bool Source #

length :: Product f g a -> Int Source #

elem :: Eq a => a -> Product f g a -> Bool Source #

maximum :: Ord a => Product f g a -> a Source #

minimum :: Ord a => Product f g a -> a Source #

sum :: Num a => Product f g a -> a Source #

product :: Num a => Product f g a -> a Source #

(Foldable f, Foldable g) => Foldable (Sum f g) | Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

fold :: Monoid m => Sum f g m -> m Source #

foldMap :: Monoid m => (a -> m) -> Sum f g a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Sum f g a -> m Source #

foldr :: (a -> b -> b) -> b -> Sum f g a -> b Source #

foldr' :: (a -> b -> b) -> b -> Sum f g a -> b Source #

foldl :: (b -> a -> b) -> b -> Sum f g a -> b Source #

foldl' :: (b -> a -> b) -> b -> Sum f g a -> b Source #

foldr1 :: (a -> a -> a) -> Sum f g a -> a Source #

foldl1 :: (a -> a -> a) -> Sum f g a -> a Source #

toList :: Sum f g a -> [a] Source #

null :: Sum f g a -> Bool Source #

length :: Sum f g a -> Int Source #

elem :: Eq a => a -> Sum f g a -> Bool Source #

maximum :: Ord a => Sum f g a -> a Source #

minimum :: Ord a => Sum f g a -> a Source #

sum :: Num a => Sum f g a -> a Source #

product :: Num a => Sum f g a -> a Source #

(Foldable f, Foldable g) => Foldable (f :*: g) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => (f :*: g) m -> m Source #

foldMap :: Monoid m => (a -> m) -> (f :*: g) a -> m Source #

foldMap' :: Monoid m => (a -> m) -> (f :*: g) a -> m Source #

foldr :: (a -> b -> b) -> b -> (f :*: g) a -> b Source #

foldr' :: (a -> b -> b) -> b -> (f :*: g) a -> b Source #

foldl :: (b -> a -> b) -> b -> (f :*: g) a -> b Source #

foldl' :: (b -> a -> b) -> b -> (f :*: g) a -> b Source #

foldr1 :: (a -> a -> a) -> (f :*: g) a -> a Source #

foldl1 :: (a -> a -> a) -> (f :*: g) a -> a Source #

toList :: (f :*: g) a -> [a] Source #

null :: (f :*: g) a -> Bool Source #

length :: (f :*: g) a -> Int Source #

elem :: Eq a => a -> (f :*: g) a -> Bool Source #

maximum :: Ord a => (f :*: g) a -> a Source #

minimum :: Ord a => (f :*: g) a -> a Source #

sum :: Num a => (f :*: g) a -> a Source #

product :: Num a => (f :*: g) a -> a Source #

(Foldable f, Foldable g) => Foldable (f :+: g) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => (f :+: g) m -> m Source #

foldMap :: Monoid m => (a -> m) -> (f :+: g) a -> m Source #

foldMap' :: Monoid m => (a -> m) -> (f :+: g) a -> m Source #

foldr :: (a -> b -> b) -> b -> (f :+: g) a -> b Source #

foldr' :: (a -> b -> b) -> b -> (f :+: g) a -> b Source #

foldl :: (b -> a -> b) -> b -> (f :+: g) a -> b Source #

foldl' :: (b -> a -> b) -> b -> (f :+: g) a -> b Source #

foldr1 :: (a -> a -> a) -> (f :+: g) a -> a Source #

foldl1 :: (a -> a -> a) -> (f :+: g) a -> a Source #

toList :: (f :+: g) a -> [a] Source #

null :: (f :+: g) a -> Bool Source #

length :: (f :+: g) a -> Int Source #

elem :: Eq a => a -> (f :+: g) a -> Bool Source #

maximum :: Ord a => (f :+: g) a -> a Source #

minimum :: Ord a => (f :+: g) a -> a Source #

sum :: Num a => (f :+: g) a -> a Source #

product :: Num a => (f :+: g) a -> a Source #

Foldable (K1 i c :: Type -> Type) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => K1 i c m -> m Source #

foldMap :: Monoid m => (a -> m) -> K1 i c a -> m Source #

foldMap' :: Monoid m => (a -> m) -> K1 i c a -> m Source #

foldr :: (a -> b -> b) -> b -> K1 i c a -> b Source #

foldr' :: (a -> b -> b) -> b -> K1 i c a -> b Source #

foldl :: (b -> a -> b) -> b -> K1 i c a -> b Source #

foldl' :: (b -> a -> b) -> b -> K1 i c a -> b Source #

foldr1 :: (a -> a -> a) -> K1 i c a -> a Source #

foldl1 :: (a -> a -> a) -> K1 i c a -> a Source #

toList :: K1 i c a -> [a] Source #

null :: K1 i c a -> Bool Source #

length :: K1 i c a -> Int Source #

elem :: Eq a => a -> K1 i c a -> Bool Source #

maximum :: Ord a => K1 i c a -> a Source #

minimum :: Ord a => K1 i c a -> a Source #

sum :: Num a => K1 i c a -> a Source #

product :: Num a => K1 i c a -> a Source #

(Foldable f, Foldable g) => Foldable (Compose f g) | Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

fold :: Monoid m => Compose f g m -> m Source #

foldMap :: Monoid m => (a -> m) -> Compose f g a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Compose f g a -> m Source #

foldr :: (a -> b -> b) -> b -> Compose f g a -> b Source #

foldr' :: (a -> b -> b) -> b -> Compose f g a -> b Source #

foldl :: (b -> a -> b) -> b -> Compose f g a -> b Source #

foldl' :: (b -> a -> b) -> b -> Compose f g a -> b Source #

foldr1 :: (a -> a -> a) -> Compose f g a -> a Source #

foldl1 :: (a -> a -> a) -> Compose f g a -> a Source #

toList :: Compose f g a -> [a] Source #

null :: Compose f g a -> Bool Source #

length :: Compose f g a -> Int Source #

elem :: Eq a => a -> Compose f g a -> Bool Source #

maximum :: Ord a => Compose f g a -> a Source #

minimum :: Ord a => Compose f g a -> a Source #

sum :: Num a => Compose f g a -> a Source #

product :: Num a => Compose f g a -> a Source #

Foldable (Clown f a :: Type -> Type) |

Instance details

Defined in Data.Bifunctor.Clown

Methods

fold :: Monoid m => Clown f a m -> m Source #

foldMap :: Monoid m => (a0 -> m) -> Clown f a a0 -> m Source #

foldMap' :: Monoid m => (a0 -> m) -> Clown f a a0 -> m Source #

foldr :: (a0 -> b -> b) -> b -> Clown f a a0 -> b Source #

foldr' :: (a0 -> b -> b) -> b -> Clown f a a0 -> b Source #

foldl :: (b -> a0 -> b) -> b -> Clown f a a0 -> b Source #

foldl' :: (b -> a0 -> b) -> b -> Clown f a a0 -> b Source #

foldr1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 Source #

foldl1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 Source #

toList :: Clown f a a0 -> [a0] Source #

null :: Clown f a a0 -> Bool Source #

length :: Clown f a a0 -> Int Source #

elem :: Eq a0 => a0 -> Clown f a a0 -> Bool Source #

maximum :: Ord a0 => Clown f a a0 -> a0 Source #

minimum :: Ord a0 => Clown f a a0 -> a0 Source #

sum :: Num a0 => Clown f a a0 -> a0 Source #

product :: Num a0 => Clown f a a0 -> a0 Source #

Bifoldable p => Foldable (Flip p a) |

Instance details

Defined in Data.Bifunctor.Flip

Methods

fold :: Monoid m => Flip p a m -> m Source #

foldMap :: Monoid m => (a0 -> m) -> Flip p a a0 -> m Source #

foldMap' :: Monoid m => (a0 -> m) -> Flip p a a0 -> m Source #

foldr :: (a0 -> b -> b) -> b -> Flip p a a0 -> b Source #

foldr' :: (a0 -> b -> b) -> b -> Flip p a a0 -> b Source #

foldl :: (b -> a0 -> b) -> b -> Flip p a a0 -> b Source #

foldl' :: (b -> a0 -> b) -> b -> Flip p a a0 -> b Source #

foldr1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 Source #

foldl1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 Source #

toList :: Flip p a a0 -> [a0] Source #

null :: Flip p a a0 -> Bool Source #

length :: Flip p a a0 -> Int Source #

elem :: Eq a0 => a0 -> Flip p a a0 -> Bool Source #

maximum :: Ord a0 => Flip p a a0 -> a0 Source #

minimum :: Ord a0 => Flip p a a0 -> a0 Source #

sum :: Num a0 => Flip p a a0 -> a0 Source #

product :: Num a0 => Flip p a a0 -> a0 Source #

Foldable g => Foldable (Joker g a) |

Instance details

Defined in Data.Bifunctor.Joker

Methods

fold :: Monoid m => Joker g a m -> m Source #

foldMap :: Monoid m => (a0 -> m) -> Joker g a a0 -> m Source #

foldMap' :: Monoid m => (a0 -> m) -> Joker g a a0 -> m Source #

foldr :: (a0 -> b -> b) -> b -> Joker g a a0 -> b Source #

foldr' :: (a0 -> b -> b) -> b -> Joker g a a0 -> b Source #

foldl :: (b -> a0 -> b) -> b -> Joker g a a0 -> b Source #

foldl' :: (b -> a0 -> b) -> b -> Joker g a a0 -> b Source #

foldr1 :: (a0 -> a0 -> a0) -> Joker g a a0 -> a0 Source #

foldl1 :: (a0 -> a0 -> a0) -> Joker g a a0 -> a0 Source #

toList :: Joker g a a0 -> [a0] Source #

null :: Joker g a a0 -> Bool Source #

length :: Joker g a a0 -> Int Source #

elem :: Eq a0 => a0 -> Joker g a a0 -> Bool Source #

maximum :: Ord a0 => Joker g a a0 -> a0 Source #

minimum :: Ord a0 => Joker g a a0 -> a0 Source #

sum :: Num a0 => Joker g a a0 -> a0 Source #

product :: Num a0 => Joker g a a0 -> a0 Source #

Bifoldable p => Foldable (WrappedBifunctor p a) |

Instance details

Defined in Data.Bifunctor.Wrapped

Methods

fold :: Monoid m => WrappedBifunctor p a m -> m Source #

foldMap :: Monoid m => (a0 -> m) -> WrappedBifunctor p a a0 -> m Source #

foldMap' :: Monoid m => (a0 -> m) -> WrappedBifunctor p a a0 -> m Source #

foldr :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b Source #

foldr' :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b Source #

foldl :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b Source #

foldl' :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b Source #

foldr1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 Source #

foldl1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 Source #

toList :: WrappedBifunctor p a a0 -> [a0] Source #

null :: WrappedBifunctor p a a0 -> Bool Source #

length :: WrappedBifunctor p a a0 -> Int Source #

elem :: Eq a0 => a0 -> WrappedBifunctor p a a0 -> Bool Source #

maximum :: Ord a0 => WrappedBifunctor p a a0 -> a0 Source #

minimum :: Ord a0 => WrappedBifunctor p a a0 -> a0 Source #

sum :: Num a0 => WrappedBifunctor p a a0 -> a0 Source #

product :: Num a0 => WrappedBifunctor p a a0 -> a0 Source #

(Foldable f, Foldable g) => Foldable (f :.: g) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => (f :.: g) m -> m Source #

foldMap :: Monoid m => (a -> m) -> (f :.: g) a -> m Source #

foldMap' :: Monoid m => (a -> m) -> (f :.: g) a -> m Source #

foldr :: (a -> b -> b) -> b -> (f :.: g) a -> b Source #

foldr' :: (a -> b -> b) -> b -> (f :.: g) a -> b Source #

foldl :: (b -> a -> b) -> b -> (f :.: g) a -> b Source #

foldl' :: (b -> a -> b) -> b -> (f :.: g) a -> b Source #

foldr1 :: (a -> a -> a) -> (f :.: g) a -> a Source #

foldl1 :: (a -> a -> a) -> (f :.: g) a -> a Source #

toList :: (f :.: g) a -> [a] Source #

null :: (f :.: g) a -> Bool Source #

length :: (f :.: g) a -> Int Source #

elem :: Eq a => a -> (f :.: g) a -> Bool Source #

maximum :: Ord a => (f :.: g) a -> a Source #

minimum :: Ord a => (f :.: g) a -> a Source #

sum :: Num a => (f :.: g) a -> a Source #

product :: Num a => (f :.: g) a -> a Source #

Foldable f => Foldable (M1 i c f) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => M1 i c f m -> m Source #

foldMap :: Monoid m => (a -> m) -> M1 i c f a -> m Source #

foldMap' :: Monoid m => (a -> m) -> M1 i c f a -> m Source #

foldr :: (a -> b -> b) -> b -> M1 i c f a -> b Source #

foldr' :: (a -> b -> b) -> b -> M1 i c f a -> b Source #

foldl :: (b -> a -> b) -> b -> M1 i c f a -> b Source #

foldl' :: (b -> a -> b) -> b -> M1 i c f a -> b Source #

foldr1 :: (a -> a -> a) -> M1 i c f a -> a Source #

foldl1 :: (a -> a -> a) -> M1 i c f a -> a Source #

toList :: M1 i c f a -> [a] Source #

null :: M1 i c f a -> Bool Source #

length :: M1 i c f a -> Int Source #

elem :: Eq a => a -> M1 i c f a -> Bool Source #

maximum :: Ord a => M1 i c f a -> a Source #

minimum :: Ord a => M1 i c f a -> a Source #

sum :: Num a => M1 i c f a -> a Source #

product :: Num a => M1 i c f a -> a Source #

(Foldable (f a), Foldable (g a)) => Foldable (Product f g a) |

Instance details

Defined in Data.Bifunctor.Product

Methods

fold :: Monoid m => Product f g a m -> m Source #

foldMap :: Monoid m => (a0 -> m) -> Product f g a a0 -> m Source #

foldMap' :: Monoid m => (a0 -> m) -> Product f g a a0 -> m Source #

foldr :: (a0 -> b -> b) -> b -> Product f g a a0 -> b Source #

foldr' :: (a0 -> b -> b) -> b -> Product f g a a0 -> b Source #

foldl :: (b -> a0 -> b) -> b -> Product f g a a0 -> b Source #

foldl' :: (b -> a0 -> b) -> b -> Product f g a a0 -> b Source #

foldr1 :: (a0 -> a0 -> a0) -> Product f g a a0 -> a0 Source #

foldl1 :: (a0 -> a0 -> a0) -> Product f g a a0 -> a0 Source #

toList :: Product f g a a0 -> [a0] Source #

null :: Product f g a a0 -> Bool Source #

length :: Product f g a a0 -> Int Source #

elem :: Eq a0 => a0 -> Product f g a a0 -> Bool Source #

maximum :: Ord a0 => Product f g a a0 -> a0 Source #

minimum :: Ord a0 => Product f g a a0 -> a0 Source #

sum :: Num a0 => Product f g a a0 -> a0 Source #

product :: Num a0 => Product f g a a0 -> a0 Source #

(Foldable (f a), Foldable (g a)) => Foldable (Sum f g a) |

Instance details

Defined in Data.Bifunctor.Sum

Methods

fold :: Monoid m => Sum f g a m -> m Source #

foldMap :: Monoid m => (a0 -> m) -> Sum f g a a0 -> m Source #

foldMap' :: Monoid m => (a0 -> m) -> Sum f g a a0 -> m Source #

foldr :: (a0 -> b -> b) -> b -> Sum f g a a0 -> b Source #

foldr' :: (a0 -> b -> b) -> b -> Sum f g a a0 -> b Source #

foldl :: (b -> a0 -> b) -> b -> Sum f g a a0 -> b Source #

foldl' :: (b -> a0 -> b) -> b -> Sum f g a a0 -> b Source #

foldr1 :: (a0 -> a0 -> a0) -> Sum f g a a0 -> a0 Source #

foldl1 :: (a0 -> a0 -> a0) -> Sum f g a a0 -> a0 Source #

toList :: Sum f g a a0 -> [a0] Source #

null :: Sum f g a a0 -> Bool Source #

length :: Sum f g a a0 -> Int Source #

elem :: Eq a0 => a0 -> Sum f g a a0 -> Bool Source #

maximum :: Ord a0 => Sum f g a a0 -> a0 Source #

minimum :: Ord a0 => Sum f g a a0 -> a0 Source #

sum :: Num a0 => Sum f g a a0 -> a0 Source #

product :: Num a0 => Sum f g a a0 -> a0 Source #

(Foldable f, Bifoldable p) => Foldable (Tannen f p a) |

Instance details

Defined in Data.Bifunctor.Tannen

Methods

fold :: Monoid m => Tannen f p a m -> m Source #

foldMap :: Monoid m => (a0 -> m) -> Tannen f p a a0 -> m Source #

foldMap' :: Monoid m => (a0 -> m) -> Tannen f p a a0 -> m Source #

foldr :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b Source #

foldr' :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b Source #

foldl :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b Source #

foldl' :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b Source #

foldr1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 Source #

foldl1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 Source #

toList :: Tannen f p a a0 -> [a0] Source #

null :: Tannen f p a a0 -> Bool Source #

length :: Tannen f p a a0 -> Int Source #

elem :: Eq a0 => a0 -> Tannen f p a a0 -> Bool Source #

maximum :: Ord a0 => Tannen f p a a0 -> a0 Source #

minimum :: Ord a0 => Tannen f p a a0 -> a0 Source #

sum :: Num a0 => Tannen f p a a0 -> a0 Source #

product :: Num a0 => Tannen f p a a0 -> a0 Source #

(Bifoldable p, Foldable g) => Foldable (Biff p f g a) |

Instance details

Defined in Data.Bifunctor.Biff

Methods

fold :: Monoid m => Biff p f g a m -> m Source #

foldMap :: Monoid m => (a0 -> m) -> Biff p f g a a0 -> m Source #

foldMap' :: Monoid m => (a0 -> m) -> Biff p f g a a0 -> m Source #

foldr :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b Source #

foldr' :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b Source #

foldl :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b Source #

foldl' :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b Source #

foldr1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 Source #

foldl1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 Source #

toList :: Biff p f g a a0 -> [a0] Source #

null :: Biff p f g a a0 -> Bool Source #

length :: Biff p f g a a0 -> Int Source #

elem :: Eq a0 => a0 -> Biff p f g a a0 -> Bool Source #

maximum :: Ord a0 => Biff p f g a a0 -> a0 Source #

minimum :: Ord a0 => Biff p f g a a0 -> a0 Source #

sum :: Num a0 => Biff p f g a a0 -> a0 Source #

product :: Num a0 => Biff p f g a a0 -> a0 Source #

map :: (a -> b) -> [a] -> [b] Source #

\(\mathcal{O}(n)\). `map` `f xs` is the list obtained by applying `f` to each element of `xs`, i.e.,

    map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
    map f [x1, x2, ...] == [f x1, f x2, ...]

this means that `map id == id`

#### Examples

Expand

    >>> map (+1) [1, 2, 3]
    [2,3,4]

    >>> map id [1, 2, 3]
    [1,2,3]

    >>> map (\n -> 3 * n + 1) [1, 2, 3]
    [4,7,10]

class Applicative m => Monad (m :: Type -> Type) where Source #

The `Monad` class defines the basic operations over a monad, a concept from a branch of mathematics known as category theory. From the perspective of a Haskell programmer, however, it is best to think of a monad as an abstract datatype of actions. Haskell's `do` expressions provide a convenient syntax for writing monadic expressions.

Instances of `Monad` should satisfy the following:

Left identity
  ``return` a `>>=` k = k a`
Right identity
  `m `>>=` `return` = m`
Associativity
  `m `>>=` (\x -> k x `>>=` h) = (m `>>=` k) `>>=` h`

Furthermore, the `Monad` and `Applicative` operations should relate as follows:

-     pure = return

-     m1 <*> m2 = m1 >>= (\x1 -> m2 >>= (\x2 -> return (x1 x2)))

The above laws imply:

-     fmap f xs  =  xs >>= return . f

-     (>>) = (*>)

and that `pure` and (`<*>`) satisfy the applicative functor laws.

The instances of `Monad` for `List`, `Maybe` and `IO` defined in the Prelude satisfy these laws.

Minimal complete definition

(>>=)

Methods

(>>=) :: m a -> (a -> m b) -> m b infixl 1 Source #

Sequentially compose two actions, passing any value produced by the first as an argument to the second.

'`as `>>=` bs`' can be understood as the `do` expression

    do a <- as
       bs a

An alternative name for this function is 'bind', but some people may refer to it as 'flatMap', which results from it being equivialent to

    \x f -> join (fmap f x) :: Monad m => m a -> (a -> m b) -> m b

which can be seen as mapping a value with `Monad m => m a -> m (m b)` and then 'flattening' `m (m b)` to `m b` using `join`.

(>>) :: m a -> m b -> m b infixl 1 Source #

Sequentially compose two actions, discarding any value produced by the first, like sequencing operators (such as the semicolon) in imperative languages.

'`as `>>` bs`' can be understood as the `do` expression

    do as
       bs

or in terms of ``(>>=)`` as

    as >>= const bs

return :: a -> m a Source #

Inject a value into the monadic type. This function should not be different from its default implementation as `pure`. The justification for the existence of this function is merely historic.

#### Instances

Instances details

Monad Strategy Source # |
Instance details Defined in Game.LambdaHack.Client.AI.Strategy Methods (>>=) :: Strategy a -> (a -> Strategy b) -> Strategy b Source # (>>) :: Strategy a -> Strategy b -> Strategy b Source # return :: a -> Strategy a Source #
Monad Frequency Source # |
Instance details Defined in Game.LambdaHack.Core.Frequency Methods (>>=) :: Frequency a -> (a -> Frequency b) -> Frequency b Source # (>>) :: Frequency a -> Frequency b -> Frequency b Source # return :: a -> Frequency a Source #
Monad CliImplementation Source # |
Instance details Defined in Implementation.MonadClientImplementation Methods (>>=) :: CliImplementation a -> (a -> CliImplementation b) -> CliImplementation b Source # (>>) :: CliImplementation a -> CliImplementation b -> CliImplementation b Source # return :: a -> CliImplementation a Source #
Monad SerImplementation Source # |
Instance details Defined in Implementation.MonadServerImplementation Methods (>>=) :: SerImplementation a -> (a -> SerImplementation b) -> SerImplementation b Source # (>>) :: SerImplementation a -> SerImplementation b -> SerImplementation b Source # return :: a -> SerImplementation a Source #
Monad Gen |
Instance details Defined in Test.QuickCheck.Gen Methods (>>=) :: Gen a -> (a -> Gen b) -> Gen b Source # (>>) :: Gen a -> Gen b -> Gen b Source # return :: a -> Gen a Source #
Monad Rose |
Instance details Defined in Test.QuickCheck.Property Methods (>>=) :: Rose a -> (a -> Rose b) -> Rose b Source # (>>) :: Rose a -> Rose b -> Rose b Source # return :: a -> Rose a Source #
Monad IResult |
Instance details Defined in Data.Aeson.Types.Internal Methods (>>=) :: IResult a -> (a -> IResult b) -> IResult b Source # (>>) :: IResult a -> IResult b -> IResult b Source # return :: a -> IResult a Source #
Monad Parser |
Instance details Defined in Data.Aeson.Types.Internal Methods (>>=) :: Parser a -> (a -> Parser b) -> Parser b Source # (>>) :: Parser a -> Parser b -> Parser b Source # return :: a -> Parser a Source #
Monad Result |
Instance details Defined in Data.Aeson.Types.Internal Methods (>>=) :: Result a -> (a -> Result b) -> Result b Source # (>>) :: Result a -> Result b -> Result b Source # return :: a -> Result a Source #
Monad Complex | Since: base-4.9.0.0
Instance details Defined in Data.Complex Methods (>>=) :: Complex a -> (a -> Complex b) -> Complex b Source # (>>) :: Complex a -> Complex b -> Complex b Source # return :: a -> Complex a Source #
Monad First | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (>>=) :: First a -> (a -> First b) -> First b Source # (>>) :: First a -> First b -> First b Source # return :: a -> First a Source #
Monad Last | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (>>=) :: Last a -> (a -> Last b) -> Last b Source # (>>) :: Last a -> Last b -> Last b Source # return :: a -> Last a Source #
Monad Max | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (>>=) :: Max a -> (a -> Max b) -> Max b Source # (>>) :: Max a -> Max b -> Max b Source # return :: a -> Max a Source #
Monad Min | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (>>=) :: Min a -> (a -> Min b) -> Min b Source # (>>) :: Min a -> Min b -> Min b Source # return :: a -> Min a Source #
Monad Get |
Instance details Defined in Data.Binary.Get.Internal Methods (>>=) :: Get a -> (a -> Get b) -> Get b Source # (>>) :: Get a -> Get b -> Get b Source # return :: a -> Get a Source #
Monad PutM |
Instance details Defined in Data.Binary.Put Methods (>>=) :: PutM a -> (a -> PutM b) -> PutM b Source # (>>) :: PutM a -> PutM b -> PutM b Source # return :: a -> PutM a Source #
Monad Put |
Instance details Defined in Data.ByteString.Builder.Internal Methods (>>=) :: Put a -> (a -> Put b) -> Put b Source # (>>) :: Put a -> Put b -> Put b Source # return :: a -> Put a Source #
Monad Seq |
Instance details Defined in Data.Sequence.Internal Methods (>>=) :: Seq a -> (a -> Seq b) -> Seq b Source # (>>) :: Seq a -> Seq b -> Seq b Source # return :: a -> Seq a Source #
Monad Tree |
Instance details Defined in Data.Tree Methods (>>=) :: Tree a -> (a -> Tree b) -> Tree b Source # (>>) :: Tree a -> Tree b -> Tree b Source # return :: a -> Tree a Source #
Monad DNonEmpty |
Instance details Defined in Data.DList.DNonEmpty.Internal Methods (>>=) :: DNonEmpty a -> (a -> DNonEmpty b) -> DNonEmpty b Source # (>>) :: DNonEmpty a -> DNonEmpty b -> DNonEmpty b Source # return :: a -> DNonEmpty a Source #
Monad DList |
Instance details Defined in Data.DList.Internal Methods (>>=) :: DList a -> (a -> DList b) -> DList b Source # (>>) :: DList a -> DList b -> DList b Source # return :: a -> DList a Source #
Monad NonEmpty | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (>>=) :: NonEmpty a -> (a -> NonEmpty b) -> NonEmpty b Source # (>>) :: NonEmpty a -> NonEmpty b -> NonEmpty b Source # return :: a -> NonEmpty a Source #
Monad STM | Since: base-4.3.0.0
Instance details Defined in GHC.Internal.Conc.Sync Methods (>>=) :: STM a -> (a -> STM b) -> STM b Source # (>>) :: STM a -> STM b -> STM b Source # return :: a -> STM a Source #
Monad Identity | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Functor.Identity Methods (>>=) :: Identity a -> (a -> Identity b) -> Identity b Source # (>>) :: Identity a -> Identity b -> Identity b Source # return :: a -> Identity a Source #
Monad First | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods (>>=) :: First a -> (a -> First b) -> First b Source # (>>) :: First a -> First b -> First b Source # return :: a -> First a Source #
Monad Last | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods (>>=) :: Last a -> (a -> Last b) -> Last b Source # (>>) :: Last a -> Last b -> Last b Source # return :: a -> Last a Source #
Monad Down | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Data.Ord Methods (>>=) :: Down a -> (a -> Down b) -> Down b Source # (>>) :: Down a -> Down b -> Down b Source # return :: a -> Down a Source #
Monad Dual | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (>>=) :: Dual a -> (a -> Dual b) -> Dual b Source # (>>) :: Dual a -> Dual b -> Dual b Source # return :: a -> Dual a Source #
Monad Product | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (>>=) :: Product a -> (a -> Product b) -> Product b Source # (>>) :: Product a -> Product b -> Product b Source # return :: a -> Product a Source #
Monad Sum | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (>>=) :: Sum a -> (a -> Sum b) -> Sum b Source # (>>) :: Sum a -> Sum b -> Sum b Source # return :: a -> Sum a Source #
Monad Par1 | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (>>=) :: Par1 a -> (a -> Par1 b) -> Par1 b Source # (>>) :: Par1 a -> Par1 b -> Par1 b Source # return :: a -> Par1 a Source #
Monad P | Since: base-2.1
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods (>>=) :: P a -> (a -> P b) -> P b Source # (>>) :: P a -> P b -> P b Source # return :: a -> P a Source #
Monad ReadP | Since: base-2.1
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods (>>=) :: ReadP a -> (a -> ReadP b) -> ReadP b Source # (>>) :: ReadP a -> ReadP b -> ReadP b Source # return :: a -> ReadP a Source #
Monad ReadPrec | Since: base-2.1
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadPrec Methods (>>=) :: ReadPrec a -> (a -> ReadPrec b) -> ReadPrec b Source # (>>) :: ReadPrec a -> ReadPrec b -> ReadPrec b Source # return :: a -> ReadPrec a Source #
Monad IO | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods (>>=) :: IO a -> (a -> IO b) -> IO b Source # (>>) :: IO a -> IO b -> IO b Source # return :: a -> IO a Source #
Monad Plucker |
Instance details Defined in Linear.Plucker Methods (>>=) :: Plucker a -> (a -> Plucker b) -> Plucker b Source # (>>) :: Plucker a -> Plucker b -> Plucker b Source # return :: a -> Plucker a Source #
Monad Quaternion |
Instance details Defined in Linear.Quaternion Methods (>>=) :: Quaternion a -> (a -> Quaternion b) -> Quaternion b Source # (>>) :: Quaternion a -> Quaternion b -> Quaternion b Source # return :: a -> Quaternion a Source #
Monad V0 |
Instance details Defined in Linear.V0 Methods (>>=) :: V0 a -> (a -> V0 b) -> V0 b Source # (>>) :: V0 a -> V0 b -> V0 b Source # return :: a -> V0 a Source #
Monad V1 |
Instance details Defined in Linear.V1 Methods (>>=) :: V1 a -> (a -> V1 b) -> V1 b Source # (>>) :: V1 a -> V1 b -> V1 b Source # return :: a -> V1 a Source #
Monad V2 |
Instance details Defined in Linear.V2 Methods (>>=) :: V2 a -> (a -> V2 b) -> V2 b Source # (>>) :: V2 a -> V2 b -> V2 b Source # return :: a -> V2 a Source #
Monad V3 |
Instance details Defined in Linear.V3 Methods (>>=) :: V3 a -> (a -> V3 b) -> V3 b Source # (>>) :: V3 a -> V3 b -> V3 b Source # return :: a -> V3 a Source #
Monad V4 |
Instance details Defined in Linear.V4 Methods (>>=) :: V4 a -> (a -> V4 b) -> V4 b Source # (>>) :: V4 a -> V4 b -> V4 b Source # return :: a -> V4 a Source #
Monad Chunk |
Instance details Defined in Options.Applicative.Help.Chunk Methods (>>=) :: Chunk a -> (a -> Chunk b) -> Chunk b Source # (>>) :: Chunk a -> Chunk b -> Chunk b Source # return :: a -> Chunk a Source #
Monad ComplResult |
Instance details Defined in Options.Applicative.Internal Methods (>>=) :: ComplResult a -> (a -> ComplResult b) -> ComplResult b Source # (>>) :: ComplResult a -> ComplResult b -> ComplResult b Source # return :: a -> ComplResult a Source #
Monad Completion |
Instance details Defined in Options.Applicative.Internal Methods (>>=) :: Completion a -> (a -> Completion b) -> Completion b Source # (>>) :: Completion a -> Completion b -> Completion b Source # return :: a -> Completion a Source #
Monad P |
Instance details Defined in Options.Applicative.Internal Methods (>>=) :: P a -> (a -> P b) -> P b Source # (>>) :: P a -> P b -> P b Source # return :: a -> P a Source #
Monad ParserM |
Instance details Defined in Options.Applicative.Types Methods (>>=) :: ParserM a -> (a -> ParserM b) -> ParserM b Source # (>>) :: ParserM a -> ParserM b -> ParserM b Source # return :: a -> ParserM a Source #
Monad ParserResult |
Instance details Defined in Options.Applicative.Types Methods (>>=) :: ParserResult a -> (a -> ParserResult b) -> ParserResult b Source # (>>) :: ParserResult a -> ParserResult b -> ParserResult b Source # return :: a -> ParserResult a Source #
Monad ReadM |
Instance details Defined in Options.Applicative.Types Methods (>>=) :: ReadM a -> (a -> ReadM b) -> ReadM b Source # (>>) :: ReadM a -> ReadM b -> ReadM b Source # return :: a -> ReadM a Source #
Monad Array |
Instance details Defined in Data.Primitive.Array Methods (>>=) :: Array a -> (a -> Array b) -> Array b Source # (>>) :: Array a -> Array b -> Array b Source # return :: a -> Array a Source #
Monad SmallArray |
Instance details Defined in Data.Primitive.SmallArray Methods (>>=) :: SmallArray a -> (a -> SmallArray b) -> SmallArray b Source # (>>) :: SmallArray a -> SmallArray b -> SmallArray b Source # return :: a -> SmallArray a Source #
Monad V2 |
Instance details Defined in SDL.Internal.Vect Methods (>>=) :: V2 a -> (a -> V2 b) -> V2 b Source # (>>) :: V2 a -> V2 b -> V2 b Source # return :: a -> V2 a Source #
Monad V3 |
Instance details Defined in SDL.Internal.Vect Methods (>>=) :: V3 a -> (a -> V3 b) -> V3 b Source # (>>) :: V3 a -> V3 b -> V3 b Source # return :: a -> V3 a Source #
Monad V4 |
Instance details Defined in SDL.Internal.Vect Methods (>>=) :: V4 a -> (a -> V4 b) -> V4 b Source # (>>) :: V4 a -> V4 b -> V4 b Source # return :: a -> V4 a Source #
Monad PprM |
Instance details Defined in Language.Haskell.TH.PprLib Methods (>>=) :: PprM a -> (a -> PprM b) -> PprM b Source # (>>) :: PprM a -> PprM b -> PprM b Source # return :: a -> PprM a Source #
Monad Q |
Instance details Defined in Language.Haskell.TH.Syntax Methods (>>=) :: Q a -> (a -> Q b) -> Q b Source # (>>) :: Q a -> Q b -> Q b Source # return :: a -> Q a Source #
Monad Vector |
Instance details Defined in Data.Vector Methods (>>=) :: Vector a -> (a -> Vector b) -> Vector b Source # (>>) :: Vector a -> Vector b -> Vector b Source # return :: a -> Vector a Source #
Monad Id |
Instance details Defined in Data.Vector.Fusion.Util Methods (>>=) :: Id a -> (a -> Id b) -> Id b Source # (>>) :: Id a -> Id b -> Id b Source # return :: a -> Id a Source #
Monad Vector |
Instance details Defined in Data.Vector.Strict Methods (>>=) :: Vector a -> (a -> Vector b) -> Vector b Source # (>>) :: Vector a -> Vector b -> Vector b Source # return :: a -> Vector a Source #
Monad Stream |
Instance details Defined in Codec.Compression.Zlib.Stream Methods (>>=) :: Stream a -> (a -> Stream b) -> Stream b Source # (>>) :: Stream a -> Stream b -> Stream b Source # return :: a -> Stream a Source #
Monad Maybe | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods (>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b Source # (>>) :: Maybe a -> Maybe b -> Maybe b Source # return :: a -> Maybe a Source #
Monad Solo | Since: base-4.15
Instance details Defined in GHC.Internal.Base Methods (>>=) :: Solo a -> (a -> Solo b) -> Solo b Source # (>>) :: Solo a -> Solo b -> Solo b Source # return :: a -> Solo a Source #
Monad [] | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods (>>=) :: [a] -> (a -> [b]) -> [b] Source # (>>) :: [a] -> [b] -> [b] Source # return :: a -> [a] Source #
Monad m => Monad (PropertyM m) |
Instance details Defined in Test.QuickCheck.Monadic Methods (>>=) :: PropertyM m a -> (a -> PropertyM m b) -> PropertyM m b Source # (>>) :: PropertyM m a -> PropertyM m b -> PropertyM m b Source # return :: a -> PropertyM m a Source #
Representable f => Monad (Co f) |
Instance details Defined in Data.Functor.Rep Methods (>>=) :: Co f a -> (a -> Co f b) -> Co f b Source # (>>) :: Co f a -> Co f b -> Co f b Source # return :: a -> Co f a Source #
Monad m => Monad (WrappedMonad m) | Since: base-4.7.0.0
Instance details Defined in Control.Applicative Methods (>>=) :: WrappedMonad m a -> (a -> WrappedMonad m b) -> WrappedMonad m b Source # (>>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b Source # return :: a -> WrappedMonad m a Source #
Monad (SetM s) |
Instance details Defined in Data.Graph Methods (>>=) :: SetM s a -> (a -> SetM s b) -> SetM s b Source # (>>) :: SetM s a -> SetM s b -> SetM s b Source # return :: a -> SetM s a Source #
Alternative f => Monad (Cofree f) |
Instance details Defined in Control.Comonad.Cofree Methods (>>=) :: Cofree f a -> (a -> Cofree f b) -> Cofree f b Source # (>>) :: Cofree f a -> Cofree f b -> Cofree f b Source # return :: a -> Cofree f a Source #
Functor f => Monad (Free f) |
Instance details Defined in Control.Monad.Free Methods (>>=) :: Free f a -> (a -> Free f b) -> Free f b Source # (>>) :: Free f a -> Free f b -> Free f b Source # return :: a -> Free f a Source #
ArrowApply a => Monad (ArrowMonad a) | Since: base-2.1
Instance details Defined in GHC.Internal.Control.Arrow Methods (>>=) :: ArrowMonad a a0 -> (a0 -> ArrowMonad a b) -> ArrowMonad a b Source # (>>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b Source # return :: a0 -> ArrowMonad a a0 Source #
Monad (Either e) | Since: base-4.4.0.0
Instance details Defined in GHC.Internal.Data.Either Methods (>>=) :: Either e a -> (a -> Either e b) -> Either e b Source # (>>) :: Either e a -> Either e b -> Either e b Source # return :: a -> Either e a Source #
Monad (U1 :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (>>=) :: U1 a -> (a -> U1 b) -> U1 b Source # (>>) :: U1 a -> U1 b -> U1 b Source # return :: a -> U1 a Source #
Monad (ST s) | Since: base-2.1
Instance details Defined in GHC.Internal.ST Methods (>>=) :: ST s a -> (a -> ST s b) -> ST s b Source # (>>) :: ST s a -> ST s b -> ST s b Source # return :: a -> ST s a Source #
Monad m => Monad (Yoneda m) |
Instance details Defined in Data.Functor.Yoneda Methods (>>=) :: Yoneda m a -> (a -> Yoneda m b) -> Yoneda m b Source # (>>) :: Yoneda m a -> Yoneda m b -> Yoneda m b Source # return :: a -> Yoneda m a Source #
Monad (ReifiedFold s) |
Instance details Defined in Control.Lens.Reified Methods (>>=) :: ReifiedFold s a -> (a -> ReifiedFold s b) -> ReifiedFold s b Source # (>>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b Source # return :: a -> ReifiedFold s a Source #
Monad (ReifiedGetter s) |
Instance details Defined in Control.Lens.Reified Methods (>>=) :: ReifiedGetter s a -> (a -> ReifiedGetter s b) -> ReifiedGetter s b Source # (>>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b Source # return :: a -> ReifiedGetter s a Source #
Monad f => Monad (Point f) |
Instance details Defined in Linear.Affine Methods (>>=) :: Point f a -> (a -> Point f b) -> Point f b Source # (>>) :: Point f a -> Point f b -> Point f b Source # return :: a -> Point f a Source #
Monad m => Monad (ListT m) |
Instance details Defined in Options.Applicative.Internal Methods (>>=) :: ListT m a -> (a -> ListT m b) -> ListT m b Source # (>>) :: ListT m a -> ListT m b -> ListT m b Source # return :: a -> ListT m a Source #
Monad m => Monad (NondetT m) |
Instance details Defined in Options.Applicative.Internal Methods (>>=) :: NondetT m a -> (a -> NondetT m b) -> NondetT m b Source # (>>) :: NondetT m a -> NondetT m b -> NondetT m b Source # return :: a -> NondetT m a Source #
Monad f => Monad (Point f) |
Instance details Defined in SDL.Internal.Vect Methods (>>=) :: Point f a -> (a -> Point f b) -> Point f b Source # (>>) :: Point f a -> Point f b -> Point f b Source # return :: a -> Point f a Source #
Semigroup a => Monad (These a) |
Instance details Defined in Data.Strict.These Methods (>>=) :: These a a0 -> (a0 -> These a b) -> These a b Source # (>>) :: These a a0 -> These a b -> These a b Source # return :: a0 -> These a a0 Source #
Monad (IParser t) |
Instance details Defined in Data.Text.Internal.Read Methods (>>=) :: IParser t a -> (a -> IParser t b) -> IParser t b Source # (>>) :: IParser t a -> IParser t b -> IParser t b Source # return :: a -> IParser t a Source #
Semigroup a => Monad (These a) |
Instance details Defined in Data.These Methods (>>=) :: These a a0 -> (a0 -> These a b) -> These a b Source # (>>) :: These a a0 -> These a b -> These a b Source # return :: a0 -> These a a0 Source #
Monad m => Monad (MaybeT m) |
Instance details Defined in Control.Monad.Trans.Maybe Methods (>>=) :: MaybeT m a -> (a -> MaybeT m b) -> MaybeT m b Source # (>>) :: MaybeT m a -> MaybeT m b -> MaybeT m b Source # return :: a -> MaybeT m a Source #
Monoid a => Monad ((,) a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (>>=) :: (a, a0) -> (a0 -> (a, b)) -> (a, b) Source # (>>) :: (a, a0) -> (a, b) -> (a, b) Source # return :: a0 -> (a, a0) Source #
(Applicative f, Monad f) => Monad (WhenMissing f x) | Equivalent to `ReaderT k (ReaderT x (MaybeT f))`. Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods (>>=) :: WhenMissing f x a -> (a -> WhenMissing f x b) -> WhenMissing f x b Source # (>>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b Source # return :: a -> WhenMissing f x a Source #
(Alternative f, Monad w) => Monad (CofreeT f w) |
Instance details Defined in Control.Comonad.Trans.Cofree Methods (>>=) :: CofreeT f w a -> (a -> CofreeT f w b) -> CofreeT f w b Source # (>>) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w b Source # return :: a -> CofreeT f w a Source #
(Functor f, Monad m) => Monad (FreeT f m) |
Instance details Defined in Control.Monad.Trans.Free Methods (>>=) :: FreeT f m a -> (a -> FreeT f m b) -> FreeT f m b Source # (>>) :: FreeT f m a -> FreeT f m b -> FreeT f m b Source # return :: a -> FreeT f m a Source #
Monad m => Monad (Kleisli m a) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Control.Arrow Methods (>>=) :: Kleisli m a a0 -> (a0 -> Kleisli m a b) -> Kleisli m a b Source # (>>) :: Kleisli m a a0 -> Kleisli m a b -> Kleisli m a b Source # return :: a0 -> Kleisli m a a0 Source #
Monad m => Monad (StateT s m) | Since: base-4.18.0.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods (>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b Source # (>>) :: StateT s m a -> StateT s m b -> StateT s m b Source # return :: a -> StateT s m a Source #
Monad f => Monad (Ap f) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods (>>=) :: Ap f a -> (a -> Ap f b) -> Ap f b Source # (>>) :: Ap f a -> Ap f b -> Ap f b Source # return :: a -> Ap f a Source #
Monad f => Monad (Alt f) | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (>>=) :: Alt f a -> (a -> Alt f b) -> Alt f b Source # (>>) :: Alt f a -> Alt f b -> Alt f b Source # return :: a -> Alt f a Source #
Monad f => Monad (Rec1 f) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (>>=) :: Rec1 f a -> (a -> Rec1 f b) -> Rec1 f b Source # (>>) :: Rec1 f a -> Rec1 f b -> Rec1 f b Source # return :: a -> Rec1 f a Source #
Monad (Indexed i a) |
Instance details Defined in Control.Lens.Internal.Indexed Methods (>>=) :: Indexed i a a0 -> (a0 -> Indexed i a b) -> Indexed i a b Source # (>>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b Source # return :: a0 -> Indexed i a a0 Source #
Dim n => Monad (V n) |
Instance details Defined in Linear.V Methods (>>=) :: V n a -> (a -> V n b) -> V n b Source # (>>) :: V n a -> V n b -> V n b Source # return :: a -> V n a Source #
(Monad (Rep p), Representable p) => Monad (Prep p) |
Instance details Defined in Data.Profunctor.Rep Methods (>>=) :: Prep p a -> (a -> Prep p b) -> Prep p b Source # (>>) :: Prep p a -> Prep p b -> Prep p b Source # return :: a -> Prep p a Source #
Monad (Tagged s) |
Instance details Defined in Data.Tagged Methods (>>=) :: Tagged s a -> (a -> Tagged s b) -> Tagged s b Source # (>>) :: Tagged s a -> Tagged s b -> Tagged s b Source # return :: a -> Tagged s a Source #
(Monoid w, Functor m, Monad m) => Monad (AccumT w m) |
Instance details Defined in Control.Monad.Trans.Accum Methods (>>=) :: AccumT w m a -> (a -> AccumT w m b) -> AccumT w m b Source # (>>) :: AccumT w m a -> AccumT w m b -> AccumT w m b Source # return :: a -> AccumT w m a Source #
Monad m => Monad (ExceptT e m) |
Instance details Defined in Control.Monad.Trans.Except Methods (>>=) :: ExceptT e m a -> (a -> ExceptT e m b) -> ExceptT e m b Source # (>>) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m b Source # return :: a -> ExceptT e m a Source #
Monad m => Monad (IdentityT m) |
Instance details Defined in Control.Monad.Trans.Identity Methods (>>=) :: IdentityT m a -> (a -> IdentityT m b) -> IdentityT m b Source # (>>) :: IdentityT m a -> IdentityT m b -> IdentityT m b Source # return :: a -> IdentityT m a Source #
Monad m => Monad (ReaderT r m) |
Instance details Defined in Control.Monad.Trans.Reader Methods (>>=) :: ReaderT r m a -> (a -> ReaderT r m b) -> ReaderT r m b Source # (>>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b Source # return :: a -> ReaderT r m a Source #
Monad m => Monad (SelectT r m) |
Instance details Defined in Control.Monad.Trans.Select Methods (>>=) :: SelectT r m a -> (a -> SelectT r m b) -> SelectT r m b Source # (>>) :: SelectT r m a -> SelectT r m b -> SelectT r m b Source # return :: a -> SelectT r m a Source #
Monad m => Monad (StateT s m) |
Instance details Defined in Control.Monad.Trans.State.Lazy Methods (>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b Source # (>>) :: StateT s m a -> StateT s m b -> StateT s m b Source # return :: a -> StateT s m a Source #
Monad m => Monad (StateT s m) |
Instance details Defined in Control.Monad.Trans.State.Strict Methods (>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b Source # (>>) :: StateT s m a -> StateT s m b -> StateT s m b Source # return :: a -> StateT s m a Source #
Monad m => Monad (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.CPS Methods (>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b Source # (>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b Source # return :: a -> WriterT w m a Source #
(Monoid w, Monad m) => Monad (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods (>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b Source # (>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b Source # return :: a -> WriterT w m a Source #
(Monoid w, Monad m) => Monad (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods (>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b Source # (>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b Source # return :: a -> WriterT w m a Source #
Monad m => Monad (Reverse m) | Derived instance.
Instance details Defined in Data.Functor.Reverse Methods (>>=) :: Reverse m a -> (a -> Reverse m b) -> Reverse m b Source # (>>) :: Reverse m a -> Reverse m b -> Reverse m b Source # return :: a -> Reverse m a Source #
(Monoid a, Monoid b) => Monad ((,,) a b) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Base Methods (>>=) :: (a, b, a0) -> (a0 -> (a, b, b0)) -> (a, b, b0) Source # (>>) :: (a, b, a0) -> (a, b, b0) -> (a, b, b0) Source # return :: a0 -> (a, b, a0) Source #
(Monad f, Monad g) => Monad (Product f g) | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods (>>=) :: Product f g a -> (a -> Product f g b) -> Product f g b Source # (>>) :: Product f g a -> Product f g b -> Product f g b Source # return :: a -> Product f g a Source #
(Monad f, Applicative f) => Monad (WhenMatched f x y) | Equivalent to `ReaderT Key (ReaderT x (ReaderT y (MaybeT f)))` Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods (>>=) :: WhenMatched f x y a -> (a -> WhenMatched f x y b) -> WhenMatched f x y b Source # (>>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b Source # return :: a -> WhenMatched f x y a Source #
(Applicative f, Monad f) => Monad (WhenMissing f k x) | Equivalent to `ReaderT k (ReaderT x (MaybeT f))` . Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods (>>=) :: WhenMissing f k x a -> (a -> WhenMissing f k x b) -> WhenMissing f k x b Source # (>>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b Source # return :: a -> WhenMissing f k x a Source #
(Monad f, Monad g) => Monad (f :*: g) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (>>=) :: (f :*: g) a -> (a -> (f :*: g) b) -> (f :*: g) b Source # (>>) :: (f :*: g) a -> (f :*: g) b -> (f :*: g) b Source # return :: a -> (f :*: g) a Source #
Monad (ContT r m) |
Instance details Defined in Control.Monad.Trans.Cont Methods (>>=) :: ContT r m a -> (a -> ContT r m b) -> ContT r m b Source # (>>) :: ContT r m a -> ContT r m b -> ContT r m b Source # return :: a -> ContT r m a Source #
(Monoid a, Monoid b, Monoid c) => Monad ((,,,) a b c) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Base Methods (>>=) :: (a, b, c, a0) -> (a0 -> (a, b, c, b0)) -> (a, b, c, b0) Source # (>>) :: (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, b0) Source # return :: a0 -> (a, b, c, a0) Source #
Monad ((->) r) | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods (>>=) :: (r -> a) -> (a -> r -> b) -> r -> b Source # (>>) :: (r -> a) -> (r -> b) -> r -> b Source # return :: a -> r -> a Source #
(Monad f, Applicative f) => Monad (WhenMatched f k x y) | Equivalent to `ReaderT k (ReaderT x (ReaderT y (MaybeT f)))` Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods (>>=) :: WhenMatched f k x y a -> (a -> WhenMatched f k x y b) -> WhenMatched f k x y b Source # (>>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b Source # return :: a -> WhenMatched f k x y a Source #
Monad f => Monad (M1 i c f) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (>>=) :: M1 i c f a -> (a -> M1 i c f b) -> M1 i c f b Source # (>>) :: M1 i c f a -> M1 i c f b -> M1 i c f b Source # return :: a -> M1 i c f a Source #
Monad m => Monad (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.CPS Methods (>>=) :: RWST r w s m a -> (a -> RWST r w s m b) -> RWST r w s m b Source # (>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b Source # return :: a -> RWST r w s m a Source #
(Monoid w, Monad m) => Monad (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.Lazy Methods (>>=) :: RWST r w s m a -> (a -> RWST r w s m b) -> RWST r w s m b Source # (>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b Source # return :: a -> RWST r w s m a Source #
(Monoid w, Monad m) => Monad (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.Strict Methods (>>=) :: RWST r w s m a -> (a -> RWST r w s m b) -> RWST r w s m b Source # (>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b Source # return :: a -> RWST r w s m a Source #

class Functor (f :: Type -> Type) where Source #

A type `f` is a Functor if it provides a function `fmap` which, given any types `a` and `b` lets you apply any function from `(a -> b)` to turn an `f a` into an `f b`, preserving the structure of `f`. Furthermore `f` needs to adhere to the following:

Identity
  ``fmap` `id` == `id``
Composition
  ``fmap` (f . g) == `fmap` f . `fmap` g`

Note, that the second law follows from the free theorem of the type `fmap` and the first law, so you need only check that the former condition holds. See these articles by School of Haskell or David Luposchainsky for an explanation.

Minimal complete definition

fmap

Methods

fmap :: (a -> b) -> f a -> f b Source #

`fmap` is used to apply a function of type `(a -> b)` to a value of type `f a`, where f is a functor, to produce a value of type `f b`. Note that for any type constructor with more than one parameter (e.g., `Either`), only the last type parameter can be modified with `fmap` (e.g., `b` in `Either a b`).

Some type constructors with two parameters or more have a ``Bifunctor`` instance that allows both the last and the penultimate parameters to be mapped over.

#### Examples

Expand

Convert from a ``Maybe` Int` to a `Maybe String` using `show`:

    >>> fmap show Nothing
    Nothing
    >>> fmap show (Just 3)
    Just "3"

Convert from an ``Either` Int Int` to an `Either Int String` using `show`:

    >>> fmap show (Left 17)
    Left 17
    >>> fmap show (Right 17)
    Right "17"

Double each element of a list:

    >>> fmap (*2) [1,2,3]
    [2,4,6]

Apply `even` to the second element of a pair:

    >>> fmap even (2,2)
    (2,True)

It may seem surprising that the function is only applied to the last element of the tuple compared to the list example above which applies it to every element in the list. To understand, remember that tuples are type constructors with multiple type parameters: a tuple of 3 elements `(a,b,c)` can also be written `(,,) a b c` and its `Functor` instance is defined for `Functor ((,,) a b)` (i.e., only the third parameter is free to be mapped over with `fmap`).

It explains why `fmap` can be used with tuples containing values of different types as in the following example:

    >>> fmap even ("hello", 1.0, 4)
    ("hello",1.0,True)

(<$) :: a -> f b -> f a infixl 4 Source #

Replace all locations in the input with the same value. The default definition is ``fmap` . `const``, but this may be overridden with a more efficient version.

#### Examples

Expand

Perform a computation with `Maybe` and replace the result with a constant value if it is `Just`:

    >>> 'a' <$ Just 2
    Just 'a'
    >>> 'a' <$ Nothing
    Nothing

#### Instances

Instances details

Functor Strategy Source # |
Instance details Defined in Game.LambdaHack.Client.AI.Strategy Methods fmap :: (a -> b) -> Strategy a -> Strategy b Source # (<$) :: a -> Strategy b -> Strategy a Source #
Functor Delta Source # |
Instance details Defined in Game.LambdaHack.Common.Time Methods fmap :: (a -> b) -> Delta a -> Delta b Source # (<$) :: a -> Delta b -> Delta a Source #
Functor Frequency Source # |
Instance details Defined in Game.LambdaHack.Core.Frequency Methods fmap :: (a -> b) -> Frequency a -> Frequency b Source # (<$) :: a -> Frequency b -> Frequency a Source #
Functor CliImplementation Source # |
Instance details Defined in Implementation.MonadClientImplementation Methods fmap :: (a -> b) -> CliImplementation a -> CliImplementation b Source # (<$) :: a -> CliImplementation b -> CliImplementation a Source #
Functor SerImplementation Source # |
Instance details Defined in Implementation.MonadServerImplementation Methods fmap :: (a -> b) -> SerImplementation a -> SerImplementation b Source # (<$) :: a -> SerImplementation b -> SerImplementation a Source #
Functor Gen |
Instance details Defined in Test.QuickCheck.Gen Methods fmap :: (a -> b) -> Gen a -> Gen b Source # (<$) :: a -> Gen b -> Gen a Source #
Functor Blind |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> Blind a -> Blind b Source # (<$) :: a -> Blind b -> Blind a Source #
Functor Fixed |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> Fixed a -> Fixed b Source # (<$) :: a -> Fixed b -> Fixed a Source #
Functor Large |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> Large a -> Large b Source # (<$) :: a -> Large b -> Large a Source #
Functor Negative |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> Negative a -> Negative b Source # (<$) :: a -> Negative b -> Negative a Source #
Functor NonEmptyList |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> NonEmptyList a -> NonEmptyList b Source # (<$) :: a -> NonEmptyList b -> NonEmptyList a Source #
Functor NonNegative |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> NonNegative a -> NonNegative b Source # (<$) :: a -> NonNegative b -> NonNegative a Source #
Functor NonPositive |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> NonPositive a -> NonPositive b Source # (<$) :: a -> NonPositive b -> NonPositive a Source #
Functor NonZero |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> NonZero a -> NonZero b Source # (<$) :: a -> NonZero b -> NonZero a Source #
Functor OrderedList |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> OrderedList a -> OrderedList b Source # (<$) :: a -> OrderedList b -> OrderedList a Source #
Functor Positive |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> Positive a -> Positive b Source # (<$) :: a -> Positive b -> Positive a Source #
Functor Shrink2 |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> Shrink2 a -> Shrink2 b Source # (<$) :: a -> Shrink2 b -> Shrink2 a Source #
Functor Small |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> Small a -> Small b Source # (<$) :: a -> Small b -> Small a Source #
Functor Smart |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> Smart a -> Smart b Source # (<$) :: a -> Smart b -> Smart a Source #
Functor SortedList |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> SortedList a -> SortedList b Source # (<$) :: a -> SortedList b -> SortedList a Source #
Functor Rose |
Instance details Defined in Test.QuickCheck.Property Methods fmap :: (a -> b) -> Rose a -> Rose b Source # (<$) :: a -> Rose b -> Rose a Source #
Functor KeyMap |
Instance details Defined in Data.Aeson.KeyMap Methods fmap :: (a -> b) -> KeyMap a -> KeyMap b Source # (<$) :: a -> KeyMap b -> KeyMap a Source #
Functor IResult |
Instance details Defined in Data.Aeson.Types.Internal Methods fmap :: (a -> b) -> IResult a -> IResult b Source # (<$) :: a -> IResult b -> IResult a Source #
Functor Parser |
Instance details Defined in Data.Aeson.Types.Internal Methods fmap :: (a -> b) -> Parser a -> Parser b Source # (<$) :: a -> Parser b -> Parser a Source #
Functor Result |
Instance details Defined in Data.Aeson.Types.Internal Methods fmap :: (a -> b) -> Result a -> Result b Source # (<$) :: a -> Result b -> Result a Source #
Functor Async |
Instance details Defined in Control.Concurrent.Async.Internal Methods fmap :: (a -> b) -> Async a -> Async b Source # (<$) :: a -> Async b -> Async a Source #
Functor Concurrently |
Instance details Defined in Control.Concurrent.Async.Internal Methods fmap :: (a -> b) -> Concurrently a -> Concurrently b Source # (<$) :: a -> Concurrently b -> Concurrently a Source #
Functor Complex | Since: base-4.9.0.0
Instance details Defined in Data.Complex Methods fmap :: (a -> b) -> Complex a -> Complex b Source # (<$) :: a -> Complex b -> Complex a Source #
Functor First | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a -> b) -> First a -> First b Source # (<$) :: a -> First b -> First a Source #
Functor Last | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a -> b) -> Last a -> Last b Source # (<$) :: a -> Last b -> Last a Source #
Functor Max | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a -> b) -> Max a -> Max b Source # (<$) :: a -> Max b -> Max a Source #
Functor Min | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a -> b) -> Min a -> Min b Source # (<$) :: a -> Min b -> Min a Source #
Functor ArgDescr | Since: base-4.7.0.0
Instance details Defined in System.Console.GetOpt Methods fmap :: (a -> b) -> ArgDescr a -> ArgDescr b Source # (<$) :: a -> ArgDescr b -> ArgDescr a Source #
Functor ArgOrder | Since: base-4.7.0.0
Instance details Defined in System.Console.GetOpt Methods fmap :: (a -> b) -> ArgOrder a -> ArgOrder b Source # (<$) :: a -> ArgOrder b -> ArgOrder a Source #
Functor OptDescr | Since: base-4.7.0.0
Instance details Defined in System.Console.GetOpt Methods fmap :: (a -> b) -> OptDescr a -> OptDescr b Source # (<$) :: a -> OptDescr b -> OptDescr a Source #
Functor Decoder |
Instance details Defined in Data.Binary.Get.Internal Methods fmap :: (a -> b) -> Decoder a -> Decoder b Source # (<$) :: a -> Decoder b -> Decoder a Source #
Functor Get |
Instance details Defined in Data.Binary.Get.Internal Methods fmap :: (a -> b) -> Get a -> Get b Source # (<$) :: a -> Get b -> Get a Source #
Functor PutM |
Instance details Defined in Data.Binary.Put Methods fmap :: (a -> b) -> PutM a -> PutM b Source # (<$) :: a -> PutM b -> PutM a Source #
Functor Put |
Instance details Defined in Data.ByteString.Builder.Internal Methods fmap :: (a -> b) -> Put a -> Put b Source # (<$) :: a -> Put b -> Put a Source #
Functor SCC | Since: containers-0.5.4
Instance details Defined in Data.Graph Methods fmap :: (a -> b) -> SCC a -> SCC b Source # (<$) :: a -> SCC b -> SCC a Source #
Functor IntMap |
Instance details Defined in Data.IntMap.Internal Methods fmap :: (a -> b) -> IntMap a -> IntMap b Source # (<$) :: a -> IntMap b -> IntMap a Source #
Functor Digit |
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> Digit a -> Digit b Source # (<$) :: a -> Digit b -> Digit a Source #
Functor Elem |
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> Elem a -> Elem b Source # (<$) :: a -> Elem b -> Elem a Source #
Functor FingerTree |
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> FingerTree a -> FingerTree b Source # (<$) :: a -> FingerTree b -> FingerTree a Source #
Functor Node |
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> Node a -> Node b Source # (<$) :: a -> Node b -> Node a Source #
Functor Seq |
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> Seq a -> Seq b Source # (<$) :: a -> Seq b -> Seq a Source #
Functor ViewL |
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> ViewL a -> ViewL b Source # (<$) :: a -> ViewL b -> ViewL a Source #
Functor ViewR |
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> ViewR a -> ViewR b Source # (<$) :: a -> ViewR b -> ViewR a Source #
Functor Tree |
Instance details Defined in Data.Tree Methods fmap :: (a -> b) -> Tree a -> Tree b Source # (<$) :: a -> Tree b -> Tree a Source #
Functor DNonEmpty |
Instance details Defined in Data.DList.DNonEmpty.Internal Methods fmap :: (a -> b) -> DNonEmpty a -> DNonEmpty b Source # (<$) :: a -> DNonEmpty b -> DNonEmpty a Source #
Functor DList |
Instance details Defined in Data.DList.Internal Methods fmap :: (a -> b) -> DList a -> DList b Source # (<$) :: a -> DList b -> DList a Source #
Functor NonEmpty | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods fmap :: (a -> b) -> NonEmpty a -> NonEmpty b Source # (<$) :: a -> NonEmpty b -> NonEmpty a Source #
Functor STM | Since: base-4.3.0.0
Instance details Defined in GHC.Internal.Conc.Sync Methods fmap :: (a -> b) -> STM a -> STM b Source # (<$) :: a -> STM b -> STM a Source #
Functor Identity | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Functor.Identity Methods fmap :: (a -> b) -> Identity a -> Identity b Source # (<$) :: a -> Identity b -> Identity a Source #
Functor First | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods fmap :: (a -> b) -> First a -> First b Source # (<$) :: a -> First b -> First a Source #
Functor Last | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods fmap :: (a -> b) -> Last a -> Last b Source # (<$) :: a -> Last b -> Last a Source #
Functor Down | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Data.Ord Methods fmap :: (a -> b) -> Down a -> Down b Source # (<$) :: a -> Down b -> Down a Source #
Functor Dual | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods fmap :: (a -> b) -> Dual a -> Dual b Source # (<$) :: a -> Dual b -> Dual a Source #
Functor Product | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods fmap :: (a -> b) -> Product a -> Product b Source # (<$) :: a -> Product b -> Product a Source #
Functor Sum | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods fmap :: (a -> b) -> Sum a -> Sum b Source # (<$) :: a -> Sum b -> Sum a Source #
Functor ZipList | Since: base-2.1
Instance details Defined in GHC.Internal.Functor.ZipList Methods fmap :: (a -> b) -> ZipList a -> ZipList b Source # (<$) :: a -> ZipList b -> ZipList a Source #
Functor Par1 | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> Par1 a -> Par1 b Source # (<$) :: a -> Par1 b -> Par1 a Source #
Functor P | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods fmap :: (a -> b) -> P a -> P b Source # (<$) :: a -> P b -> P a Source #
Functor ReadP | Since: base-2.1
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods fmap :: (a -> b) -> ReadP a -> ReadP b Source # (<$) :: a -> ReadP b -> ReadP a Source #
Functor ReadPrec | Since: base-2.1
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadPrec Methods fmap :: (a -> b) -> ReadPrec a -> ReadPrec b Source # (<$) :: a -> ReadPrec b -> ReadPrec a Source #
Functor IO | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods fmap :: (a -> b) -> IO a -> IO b Source # (<$) :: a -> IO b -> IO a Source #
Functor Plucker |
Instance details Defined in Linear.Plucker Methods fmap :: (a -> b) -> Plucker a -> Plucker b Source # (<$) :: a -> Plucker b -> Plucker a Source #
Functor Quaternion |
Instance details Defined in Linear.Quaternion Methods fmap :: (a -> b) -> Quaternion a -> Quaternion b Source # (<$) :: a -> Quaternion b -> Quaternion a Source #
Functor V0 |
Instance details Defined in Linear.V0 Methods fmap :: (a -> b) -> V0 a -> V0 b Source # (<$) :: a -> V0 b -> V0 a Source #
Functor V1 |
Instance details Defined in Linear.V1 Methods fmap :: (a -> b) -> V1 a -> V1 b Source # (<$) :: a -> V1 b -> V1 a Source #
Functor V2 |
Instance details Defined in Linear.V2 Methods fmap :: (a -> b) -> V2 a -> V2 b Source # (<$) :: a -> V2 b -> V2 a Source #
Functor V3 |
Instance details Defined in Linear.V3 Methods fmap :: (a -> b) -> V3 a -> V3 b Source # (<$) :: a -> V3 b -> V3 a Source #
Functor V4 |
Instance details Defined in Linear.V4 Methods fmap :: (a -> b) -> V4 a -> V4 b Source # (<$) :: a -> V4 b -> V4 a Source #
Functor Chunk |
Instance details Defined in Options.Applicative.Help.Chunk Methods fmap :: (a -> b) -> Chunk a -> Chunk b Source # (<$) :: a -> Chunk b -> Chunk a Source #
Functor ComplResult |
Instance details Defined in Options.Applicative.Internal Methods fmap :: (a -> b) -> ComplResult a -> ComplResult b Source # (<$) :: a -> ComplResult b -> ComplResult a Source #
Functor Completion |
Instance details Defined in Options.Applicative.Internal Methods fmap :: (a -> b) -> Completion a -> Completion b Source # (<$) :: a -> Completion b -> Completion a Source #
Functor P |
Instance details Defined in Options.Applicative.Internal Methods fmap :: (a -> b) -> P a -> P b Source # (<$) :: a -> P b -> P a Source #
Functor CReader |
Instance details Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> CReader a -> CReader b Source # (<$) :: a -> CReader b -> CReader a Source #
Functor OptReader |
Instance details Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> OptReader a -> OptReader b Source # (<$) :: a -> OptReader b -> OptReader a Source #
Functor Option |
Instance details Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> Option a -> Option b Source # (<$) :: a -> Option b -> Option a Source #
Functor Parser |
Instance details Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> Parser a -> Parser b Source # (<$) :: a -> Parser b -> Parser a Source #
Functor ParserFailure |
Instance details Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> ParserFailure a -> ParserFailure b Source # (<$) :: a -> ParserFailure b -> ParserFailure a Source #
Functor ParserInfo |
Instance details Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> ParserInfo a -> ParserInfo b Source # (<$) :: a -> ParserInfo b -> ParserInfo a Source #
Functor ParserM |
Instance details Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> ParserM a -> ParserM b Source # (<$) :: a -> ParserM b -> ParserM a Source #
Functor ParserResult |
Instance details Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> ParserResult a -> ParserResult b Source # (<$) :: a -> ParserResult b -> ParserResult a Source #
Functor ReadM |
Instance details Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> ReadM a -> ReadM b Source # (<$) :: a -> ReadM b -> ReadM a Source #
Functor AnnotDetails |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods fmap :: (a -> b) -> AnnotDetails a -> AnnotDetails b Source # (<$) :: a -> AnnotDetails b -> AnnotDetails a Source #
Functor Doc |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods fmap :: (a -> b) -> Doc a -> Doc b Source # (<$) :: a -> Doc b -> Doc a Source #
Functor Span |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods fmap :: (a -> b) -> Span a -> Span b Source # (<$) :: a -> Span b -> Span a Source #
Functor Doc |
Instance details Defined in Prettyprinter.Internal Methods fmap :: (a -> b) -> Doc a -> Doc b Source # (<$) :: a -> Doc b -> Doc a Source #
Functor FlattenResult |
Instance details Defined in Prettyprinter.Internal Methods fmap :: (a -> b) -> FlattenResult a -> FlattenResult b Source # (<$) :: a -> FlattenResult b -> FlattenResult a Source #
Functor SimpleDocStream |
Instance details Defined in Prettyprinter.Internal Methods fmap :: (a -> b) -> SimpleDocStream a -> SimpleDocStream b Source # (<$) :: a -> SimpleDocStream b -> SimpleDocStream a Source #
Functor Array |
Instance details Defined in Data.Primitive.Array Methods fmap :: (a -> b) -> Array a -> Array b Source # (<$) :: a -> Array b -> Array a Source #
Functor SmallArray |
Instance details Defined in Data.Primitive.SmallArray Methods fmap :: (a -> b) -> SmallArray a -> SmallArray b Source # (<$) :: a -> SmallArray b -> SmallArray a Source #
Functor Changeable |
Instance details Defined in SDL.Audio Methods fmap :: (a -> b) -> Changeable a -> Changeable b Source # (<$) :: a -> Changeable b -> Changeable a Source #
Functor V2 |
Instance details Defined in SDL.Internal.Vect Methods fmap :: (a -> b) -> V2 a -> V2 b Source # (<$) :: a -> V2 b -> V2 a Source #
Functor V3 |
Instance details Defined in SDL.Internal.Vect Methods fmap :: (a -> b) -> V3 a -> V3 b Source # (<$) :: a -> V3 b -> V3 a Source #
Functor V4 |
Instance details Defined in SDL.Internal.Vect Methods fmap :: (a -> b) -> V4 a -> V4 b Source # (<$) :: a -> V4 b -> V4 a Source #
Functor Rectangle |
Instance details Defined in SDL.Video.Renderer Methods fmap :: (a -> b) -> Rectangle a -> Rectangle b Source # (<$) :: a -> Rectangle b -> Rectangle a Source #
Functor Maybe |
Instance details Defined in Data.Strict.Maybe Methods fmap :: (a -> b) -> Maybe a -> Maybe b Source # (<$) :: a -> Maybe b -> Maybe a Source #
Functor PprM |
Instance details Defined in Language.Haskell.TH.PprLib Methods fmap :: (a -> b) -> PprM a -> PprM b Source # (<$) :: a -> PprM b -> PprM a Source #
Functor Q |
Instance details Defined in Language.Haskell.TH.Syntax Methods fmap :: (a -> b) -> Q a -> Q b Source # (<$) :: a -> Q b -> Q a Source #
Functor TyVarBndr |
Instance details Defined in Language.Haskell.TH.Syntax Methods fmap :: (a -> b) -> TyVarBndr a -> TyVarBndr b Source # (<$) :: a -> TyVarBndr b -> TyVarBndr a Source #
Functor Vector |
Instance details Defined in Data.Vector Methods fmap :: (a -> b) -> Vector a -> Vector b Source # (<$) :: a -> Vector b -> Vector a Source #
Functor Id |
Instance details Defined in Data.Vector.Fusion.Util Methods fmap :: (a -> b) -> Id a -> Id b Source # (<$) :: a -> Id b -> Id a Source #
Functor Vector |
Instance details Defined in Data.Vector.Strict Methods fmap :: (a -> b) -> Vector a -> Vector b Source # (<$) :: a -> Vector b -> Vector a Source #
Functor Stream |
Instance details Defined in Codec.Compression.Zlib.Stream Methods fmap :: (a -> b) -> Stream a -> Stream b Source # (<$) :: a -> Stream b -> Stream a Source #
Functor Maybe | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods fmap :: (a -> b) -> Maybe a -> Maybe b Source # (<$) :: a -> Maybe b -> Maybe a Source #
Functor Solo | Since: base-4.15
Instance details Defined in GHC.Internal.Base Methods fmap :: (a -> b) -> Solo a -> Solo b Source # (<$) :: a -> Solo b -> Solo a Source #
Functor [] | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods fmap :: (a -> b) -> [a] -> [b] Source # (<$) :: a -> [b] -> [a] Source #
Functor ((:->) a) |
Instance details Defined in Test.QuickCheck.Function Methods fmap :: (a0 -> b) -> (a :-> a0) -> a :-> b Source # (<$) :: a0 -> (a :-> b) -> a :-> a0 Source #
Functor (Fun a) |
Instance details Defined in Test.QuickCheck.Function Methods fmap :: (a0 -> b) -> Fun a a0 -> Fun a b Source # (<$) :: a0 -> Fun a b -> Fun a a0 Source #
Functor (Shrinking s) |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> Shrinking s a -> Shrinking s b Source # (<$) :: a -> Shrinking s b -> Shrinking s a Source #
Functor (PropertyM m) |
Instance details Defined in Test.QuickCheck.Monadic Methods fmap :: (a -> b) -> PropertyM m a -> PropertyM m b Source # (<$) :: a -> PropertyM m b -> PropertyM m a Source #
Functor f => Functor (Co f) |
Instance details Defined in Data.Functor.Rep Methods fmap :: (a -> b) -> Co f a -> Co f b Source # (<$) :: a -> Co f b -> Co f a Source #
Functor (ConcurrentlyE e) |
Instance details Defined in Control.Concurrent.Async.Internal Methods fmap :: (a -> b) -> ConcurrentlyE e a -> ConcurrentlyE e b Source # (<$) :: a -> ConcurrentlyE e b -> ConcurrentlyE e a Source #
Monad m => Functor (WrappedMonad m) | Since: base-2.1
Instance details Defined in Control.Applicative Methods fmap :: (a -> b) -> WrappedMonad m a -> WrappedMonad m b Source # (<$) :: a -> WrappedMonad m b -> WrappedMonad m a Source #
Functor (Arg a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a0 -> b) -> Arg a a0 -> Arg a b Source # (<$) :: a0 -> Arg a b -> Arg a a0 Source #
Functor (SetM s) |
Instance details Defined in Data.Graph Methods fmap :: (a -> b) -> SetM s a -> SetM s b Source # (<$) :: a -> SetM s b -> SetM s a Source #
Functor (Map k) |
Instance details Defined in Data.Map.Internal Methods fmap :: (a -> b) -> Map k a -> Map k b Source # (<$) :: a -> Map k b -> Map k a Source #
Functor (EnumMap k) |
Instance details Defined in Data.EnumMap.Base Methods fmap :: (a -> b) -> EnumMap k a -> EnumMap k b Source # (<$) :: a -> EnumMap k b -> EnumMap k a Source #
Functor f => Functor (Cofree f) |
Instance details Defined in Control.Comonad.Cofree Methods fmap :: (a -> b) -> Cofree f a -> Cofree f b Source # (<$) :: a -> Cofree f b -> Cofree f a Source #
Functor f => Functor (Free f) |
Instance details Defined in Control.Monad.Free Methods fmap :: (a -> b) -> Free f a -> Free f b Source # (<$) :: a -> Free f b -> Free f a Source #
Arrow a => Functor (ArrowMonad a) | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Control.Arrow Methods fmap :: (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b Source # (<$) :: a0 -> ArrowMonad a b -> ArrowMonad a a0 Source #
Functor (Either a) | Since: base-3.0
Instance details Defined in GHC.Internal.Data.Either Methods fmap :: (a0 -> b) -> Either a a0 -> Either a b Source # (<$) :: a0 -> Either a b -> Either a a0 Source #
Functor (StateL s) | Since: base-4.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods fmap :: (a -> b) -> StateL s a -> StateL s b Source # (<$) :: a -> StateL s b -> StateL s a Source #
Functor (StateR s) | Since: base-4.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods fmap :: (a -> b) -> StateR s a -> StateR s b Source # (<$) :: a -> StateR s b -> StateR s a Source #
Functor (U1 :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> U1 a -> U1 b Source # (<$) :: a -> U1 b -> U1 a Source #
Functor (V1 :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> V1 a -> V1 b Source # (<$) :: a -> V1 b -> V1 a Source #
Functor (ST s) | Since: base-2.1
Instance details Defined in GHC.Internal.ST Methods fmap :: (a -> b) -> ST s a -> ST s b Source # (<$) :: a -> ST s b -> ST s a Source #
Functor (Yoneda f) |
Instance details Defined in Data.Functor.Yoneda Methods fmap :: (a -> b) -> Yoneda f a -> Yoneda f b Source # (<$) :: a -> Yoneda f b -> Yoneda f a Source #
Functor f => Functor (Act f) |
Instance details Defined in Data.Key Methods fmap :: (a -> b) -> Act f a -> Act f b Source # (<$) :: a -> Act f b -> Act f a Source #
Functor (StateL s) |
Instance details Defined in Data.Key Methods fmap :: (a -> b) -> StateL s a -> StateL s b Source # (<$) :: a -> StateL s b -> StateL s a Source #
Functor (StateR s) |
Instance details Defined in Data.Key Methods fmap :: (a -> b) -> StateR s a -> StateR s b Source # (<$) :: a -> StateR s b -> StateR s a Source #
Functor f => Functor (Indexing f) |
Instance details Defined in Control.Lens.Internal.Indexed Methods fmap :: (a -> b) -> Indexing f a -> Indexing f b Source # (<$) :: a -> Indexing f b -> Indexing f a Source #
Functor f => Functor (Indexing64 f) |
Instance details Defined in Control.Lens.Internal.Indexed Methods fmap :: (a -> b) -> Indexing64 f a -> Indexing64 f b Source # (<$) :: a -> Indexing64 f b -> Indexing64 f a Source #
Functor (ReifiedFold s) |
Instance details Defined in Control.Lens.Reified Methods fmap :: (a -> b) -> ReifiedFold s a -> ReifiedFold s b Source # (<$) :: a -> ReifiedFold s b -> ReifiedFold s a Source #
Functor (ReifiedGetter s) |
Instance details Defined in Control.Lens.Reified Methods fmap :: (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b Source # (<$) :: a -> ReifiedGetter s b -> ReifiedGetter s a Source #
Functor f => Functor (Point f) |
Instance details Defined in Linear.Affine Methods fmap :: (a -> b) -> Point f a -> Point f b Source # (<$) :: a -> Point f b -> Point f a Source #
Monad m => Functor (ListT m) |
Instance details Defined in Options.Applicative.Internal Methods fmap :: (a -> b) -> ListT m a -> ListT m b Source # (<$) :: a -> ListT m b -> ListT m a Source #
Monad m => Functor (NondetT m) |
Instance details Defined in Options.Applicative.Internal Methods fmap :: (a -> b) -> NondetT m a -> NondetT m b Source # (<$) :: a -> NondetT m b -> NondetT m a Source #
Functor f => Functor (Point f) |
Instance details Defined in SDL.Internal.Vect Methods fmap :: (a -> b) -> Point f a -> Point f b Source # (<$) :: a -> Point f b -> Point f a Source #
Functor (Either a) |
Instance details Defined in Data.Strict.Either Methods fmap :: (a0 -> b) -> Either a a0 -> Either a b Source # (<$) :: a0 -> Either a b -> Either a a0 Source #
Functor (These a) |
Instance details Defined in Data.Strict.These Methods fmap :: (a0 -> b) -> These a a0 -> These a b Source # (<$) :: a0 -> These a b -> These a a0 Source #
Functor (Pair e) |
Instance details Defined in Data.Strict.Tuple Methods fmap :: (a -> b) -> Pair e a -> Pair e b Source # (<$) :: a -> Pair e b -> Pair e a Source #
Functor (IParser t) |
Instance details Defined in Data.Text.Internal.Read Methods fmap :: (a -> b) -> IParser t a -> IParser t b Source # (<$) :: a -> IParser t b -> IParser t a Source #
Functor (These a) |
Instance details Defined in Data.These Methods fmap :: (a0 -> b) -> These a a0 -> These a b Source # (<$) :: a0 -> These a b -> These a a0 Source #
Functor f => Functor (Lift f) |
Instance details Defined in Control.Applicative.Lift Methods fmap :: (a -> b) -> Lift f a -> Lift f b Source # (<$) :: a -> Lift f b -> Lift f a Source #
Functor m => Functor (MaybeT m) |
Instance details Defined in Control.Monad.Trans.Maybe Methods fmap :: (a -> b) -> MaybeT m a -> MaybeT m b Source # (<$) :: a -> MaybeT m b -> MaybeT m a Source #
Functor (HashMap k) |
Instance details Defined in Data.HashMap.Internal Methods fmap :: (a -> b) -> HashMap k a -> HashMap k b Source # (<$) :: a -> HashMap k b -> HashMap k a Source #
Functor ((,) a) | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods fmap :: (a0 -> b) -> (a, a0) -> (a, b) Source # (<$) :: a0 -> (a, b) -> (a, a0) Source #
Arrow a => Functor (WrappedArrow a b) | Since: base-2.1
Instance details Defined in Control.Applicative Methods fmap :: (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 Source # (<$) :: a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 Source #
Bifunctor p => Functor (Fix p) |
Instance details Defined in Data.Bifunctor.Fix Methods fmap :: (a -> b) -> Fix p a -> Fix p b Source # (<$) :: a -> Fix p b -> Fix p a Source #
Bifunctor p => Functor (Join p) |
Instance details Defined in Data.Bifunctor.Join Methods fmap :: (a -> b) -> Join p a -> Join p b Source # (<$) :: a -> Join p b -> Join p a Source #
(Applicative f, Monad f) => Functor (WhenMissing f x) | Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods fmap :: (a -> b) -> WhenMissing f x a -> WhenMissing f x b Source # (<$) :: a -> WhenMissing f x b -> WhenMissing f x a Source #
Functor f => Functor (CofreeF f a) |
Instance details Defined in Control.Comonad.Trans.Cofree Methods fmap :: (a0 -> b) -> CofreeF f a a0 -> CofreeF f a b Source # (<$) :: a0 -> CofreeF f a b -> CofreeF f a a0 Source #
(Functor f, Functor w) => Functor (CofreeT f w) |
Instance details Defined in Control.Comonad.Trans.Cofree Methods fmap :: (a -> b) -> CofreeT f w a -> CofreeT f w b Source # (<$) :: a -> CofreeT f w b -> CofreeT f w a Source #
Functor f => Functor (FreeF f a) |
Instance details Defined in Control.Monad.Trans.Free Methods fmap :: (a0 -> b) -> FreeF f a a0 -> FreeF f a b Source # (<$) :: a0 -> FreeF f a b -> FreeF f a a0 Source #
(Functor f, Functor m) => Functor (FreeT f m) |
Instance details Defined in Control.Monad.Trans.Free Methods fmap :: (a -> b) -> FreeT f m a -> FreeT f m b Source # (<$) :: a -> FreeT f m b -> FreeT f m a Source #
Functor m => Functor (Kleisli m a) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Control.Arrow Methods fmap :: (a0 -> b) -> Kleisli m a a0 -> Kleisli m a b Source # (<$) :: a0 -> Kleisli m a b -> Kleisli m a a0 Source #
Functor (Const m :: Type -> Type) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Functor.Const Methods fmap :: (a -> b) -> Const m a -> Const m b Source # (<$) :: a -> Const m b -> Const m a Source #
Monad m => Functor (StateT s m) | Since: base-4.18.0.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods fmap :: (a -> b) -> StateT s m a -> StateT s m b Source # (<$) :: a -> StateT s m b -> StateT s m a Source #
Functor f => Functor (Ap f) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods fmap :: (a -> b) -> Ap f a -> Ap f b Source # (<$) :: a -> Ap f b -> Ap f a Source #
Functor f => Functor (Alt f) | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods fmap :: (a -> b) -> Alt f a -> Alt f b Source # (<$) :: a -> Alt f b -> Alt f a Source #
(Generic1 f, Functor (Rep1 f)) => Functor (Generically1 f) | Since: base-4.17.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> Generically1 f a -> Generically1 f b Source # (<$) :: a -> Generically1 f b -> Generically1 f a Source #
Functor f => Functor (Rec1 f) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> Rec1 f a -> Rec1 f b Source # (<$) :: a -> Rec1 f b -> Rec1 f a Source #
Functor (URec (Ptr ()) :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> URec (Ptr ()) a -> URec (Ptr ()) b Source # (<$) :: a -> URec (Ptr ()) b -> URec (Ptr ()) a Source #
Functor (URec Char :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> URec Char a -> URec Char b Source # (<$) :: a -> URec Char b -> URec Char a Source #
Functor (URec Double :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> URec Double a -> URec Double b Source # (<$) :: a -> URec Double b -> URec Double a Source #
Functor (URec Float :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> URec Float a -> URec Float b Source # (<$) :: a -> URec Float b -> URec Float a Source #
Functor (URec Int :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> URec Int a -> URec Int b Source # (<$) :: a -> URec Int b -> URec Int a Source #
Functor (URec Word :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> URec Word a -> URec Word b Source # (<$) :: a -> URec Word b -> URec Word a Source #
Functor (Day f g) |
Instance details Defined in Data.Functor.Day Methods fmap :: (a -> b) -> Day f g a -> Day f g b Source # (<$) :: a -> Day f g b -> Day f g a Source #
Functor (Indexed i a) |
Instance details Defined in Control.Lens.Internal.Indexed Methods fmap :: (a0 -> b) -> Indexed i a a0 -> Indexed i a b Source # (<$) :: a0 -> Indexed i a b -> Indexed i a a0 Source #
Functor (ReifiedIndexedFold i s) |
Instance details Defined in Control.Lens.Reified Methods fmap :: (a -> b) -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s b Source # (<$) :: a -> ReifiedIndexedFold i s b -> ReifiedIndexedFold i s a Source #
Functor (ReifiedIndexedGetter i s) |
Instance details Defined in Control.Lens.Reified Methods fmap :: (a -> b) -> ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b Source # (<$) :: a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s a Source #
Functor (V n) |
Instance details Defined in Linear.V Methods fmap :: (a -> b) -> V n a -> V n b Source # (<$) :: a -> V n b -> V n a Source #
Profunctor p => Functor (Coprep p) |
Instance details Defined in Data.Profunctor.Rep Methods fmap :: (a -> b) -> Coprep p a -> Coprep p b Source # (<$) :: a -> Coprep p b -> Coprep p a Source #
Profunctor p => Functor (Prep p) |
Instance details Defined in Data.Profunctor.Rep Methods fmap :: (a -> b) -> Prep p a -> Prep p b Source # (<$) :: a -> Prep p b -> Prep p a Source #
Functor (Tagged s) |
Instance details Defined in Data.Tagged Methods fmap :: (a -> b) -> Tagged s a -> Tagged s b Source # (<$) :: a -> Tagged s b -> Tagged s a Source #
(Functor f, Functor g) => Functor (These1 f g) |
Instance details Defined in Data.Functor.These Methods fmap :: (a -> b) -> These1 f g a -> These1 f g b Source # (<$) :: a -> These1 f g b -> These1 f g a Source #
Functor f => Functor (Backwards f) | Derived instance.
Instance details Defined in Control.Applicative.Backwards Methods fmap :: (a -> b) -> Backwards f a -> Backwards f b Source # (<$) :: a -> Backwards f b -> Backwards f a Source #
Functor m => Functor (AccumT w m) |
Instance details Defined in Control.Monad.Trans.Accum Methods fmap :: (a -> b) -> AccumT w m a -> AccumT w m b Source # (<$) :: a -> AccumT w m b -> AccumT w m a Source #
Functor m => Functor (ExceptT e m) |
Instance details Defined in Control.Monad.Trans.Except Methods fmap :: (a -> b) -> ExceptT e m a -> ExceptT e m b Source # (<$) :: a -> ExceptT e m b -> ExceptT e m a Source #
Functor m => Functor (IdentityT m) |
Instance details Defined in Control.Monad.Trans.Identity Methods fmap :: (a -> b) -> IdentityT m a -> IdentityT m b Source # (<$) :: a -> IdentityT m b -> IdentityT m a Source #
Functor m => Functor (ReaderT r m) |
Instance details Defined in Control.Monad.Trans.Reader Methods fmap :: (a -> b) -> ReaderT r m a -> ReaderT r m b Source # (<$) :: a -> ReaderT r m b -> ReaderT r m a Source #
Functor m => Functor (SelectT r m) |
Instance details Defined in Control.Monad.Trans.Select Methods fmap :: (a -> b) -> SelectT r m a -> SelectT r m b Source # (<$) :: a -> SelectT r m b -> SelectT r m a Source #
Functor m => Functor (StateT s m) |
Instance details Defined in Control.Monad.Trans.State.Lazy Methods fmap :: (a -> b) -> StateT s m a -> StateT s m b Source # (<$) :: a -> StateT s m b -> StateT s m a Source #
Functor m => Functor (StateT s m) |
Instance details Defined in Control.Monad.Trans.State.Strict Methods fmap :: (a -> b) -> StateT s m a -> StateT s m b Source # (<$) :: a -> StateT s m b -> StateT s m a Source #
Functor m => Functor (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.CPS Methods fmap :: (a -> b) -> WriterT w m a -> WriterT w m b Source # (<$) :: a -> WriterT w m b -> WriterT w m a Source #
Functor m => Functor (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods fmap :: (a -> b) -> WriterT w m a -> WriterT w m b Source # (<$) :: a -> WriterT w m b -> WriterT w m a Source #
Functor m => Functor (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods fmap :: (a -> b) -> WriterT w m a -> WriterT w m b Source # (<$) :: a -> WriterT w m b -> WriterT w m a Source #
Functor (Constant a :: Type -> Type) |
Instance details Defined in Data.Functor.Constant Methods fmap :: (a0 -> b) -> Constant a a0 -> Constant a b Source # (<$) :: a0 -> Constant a b -> Constant a a0 Source #
Functor f => Functor (Reverse f) | Derived instance.
Instance details Defined in Data.Functor.Reverse Methods fmap :: (a -> b) -> Reverse f a -> Reverse f b Source # (<$) :: a -> Reverse f b -> Reverse f a Source #
Monad m => Functor (Bundle m v) |
Instance details Defined in Data.Vector.Fusion.Bundle.Monadic Methods fmap :: (a -> b) -> Bundle m v a -> Bundle m v b Source # (<$) :: a -> Bundle m v b -> Bundle m v a Source #
Functor ((,,) a b) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Base Methods fmap :: (a0 -> b0) -> (a, b, a0) -> (a, b, b0) Source # (<$) :: a0 -> (a, b, b0) -> (a, b, a0) Source #
(Functor f, Functor g) => Functor (Product f g) | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods fmap :: (a -> b) -> Product f g a -> Product f g b Source # (<$) :: a -> Product f g b -> Product f g a Source #
(Functor f, Functor g) => Functor (Sum f g) | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Sum Methods fmap :: (a -> b) -> Sum f g a -> Sum f g b Source # (<$) :: a -> Sum f g b -> Sum f g a Source #
Functor f => Functor (WhenMatched f x y) | Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods fmap :: (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b Source # (<$) :: a -> WhenMatched f x y b -> WhenMatched f x y a Source #
(Applicative f, Monad f) => Functor (WhenMissing f k x) | Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods fmap :: (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b Source # (<$) :: a -> WhenMissing f k x b -> WhenMissing f k x a Source #
(Functor f, Functor g) => Functor (f :*: g) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> (f :*: g) a -> (f :*: g) b Source # (<$) :: a -> (f :*: g) b -> (f :*: g) a Source #
(Functor f, Functor g) => Functor (f :+: g) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> (f :+: g) a -> (f :+: g) b Source # (<$) :: a -> (f :+: g) b -> (f :+: g) a Source #
Functor (K1 i c :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> K1 i c a -> K1 i c b Source # (<$) :: a -> K1 i c b -> K1 i c a Source #
Functor (ContT r m) |
Instance details Defined in Control.Monad.Trans.Cont Methods fmap :: (a -> b) -> ContT r m a -> ContT r m b Source # (<$) :: a -> ContT r m b -> ContT r m a Source #
Functor ((,,,) a b c) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Base Methods fmap :: (a0 -> b0) -> (a, b, c, a0) -> (a, b, c, b0) Source # (<$) :: a0 -> (a, b, c, b0) -> (a, b, c, a0) Source #
Functor ((->) r) | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods fmap :: (a -> b) -> (r -> a) -> r -> b Source # (<$) :: a -> (r -> b) -> r -> a Source #
(Functor f, Functor g) => Functor (Compose f g) | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods fmap :: (a -> b) -> Compose f g a -> Compose f g b Source # (<$) :: a -> Compose f g b -> Compose f g a Source #
Functor (Clown f a :: Type -> Type) |
Instance details Defined in Data.Bifunctor.Clown Methods fmap :: (a0 -> b) -> Clown f a a0 -> Clown f a b Source # (<$) :: a0 -> Clown f a b -> Clown f a a0 Source #
Bifunctor p => Functor (Flip p a) |
Instance details Defined in Data.Bifunctor.Flip Methods fmap :: (a0 -> b) -> Flip p a a0 -> Flip p a b Source # (<$) :: a0 -> Flip p a b -> Flip p a a0 Source #
Functor g => Functor (Joker g a) |
Instance details Defined in Data.Bifunctor.Joker Methods fmap :: (a0 -> b) -> Joker g a a0 -> Joker g a b Source # (<$) :: a0 -> Joker g a b -> Joker g a a0 Source #
Bifunctor p => Functor (WrappedBifunctor p a) |
Instance details Defined in Data.Bifunctor.Wrapped Methods fmap :: (a0 -> b) -> WrappedBifunctor p a a0 -> WrappedBifunctor p a b Source # (<$) :: a0 -> WrappedBifunctor p a b -> WrappedBifunctor p a a0 Source #
Functor f => Functor (WhenMatched f k x y) | Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods fmap :: (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b Source # (<$) :: a -> WhenMatched f k x y b -> WhenMatched f k x y a Source #
(Functor f, Functor g) => Functor (f :.: g) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> (f :.: g) a -> (f :.: g) b Source # (<$) :: a -> (f :.: g) b -> (f :.: g) a Source #
Functor f => Functor (M1 i c f) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> M1 i c f a -> M1 i c f b Source # (<$) :: a -> M1 i c f b -> M1 i c f a Source #
Reifies s (ReifiedApplicative f) => Functor (ReflectedApplicative f s) |
Instance details Defined in Data.Reflection Methods fmap :: (a -> b) -> ReflectedApplicative f s a -> ReflectedApplicative f s b Source # (<$) :: a -> ReflectedApplicative f s b -> ReflectedApplicative f s a Source #
Functor m => Functor (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.CPS Methods fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b Source # (<$) :: a -> RWST r w s m b -> RWST r w s m a Source #
Functor m => Functor (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.Lazy Methods fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b Source # (<$) :: a -> RWST r w s m b -> RWST r w s m a Source #
Functor m => Functor (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.Strict Methods fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b Source # (<$) :: a -> RWST r w s m b -> RWST r w s m a Source #
Functor ((,,,,) a b c d) | Since: base-4.18.0.0
Instance details Defined in GHC.Internal.Base Methods fmap :: (a0 -> b0) -> (a, b, c, d, a0) -> (a, b, c, d, b0) Source # (<$) :: a0 -> (a, b, c, d, b0) -> (a, b, c, d, a0) Source #
(Functor (f a), Functor (g a)) => Functor (Product f g a) |
Instance details Defined in Data.Bifunctor.Product Methods fmap :: (a0 -> b) -> Product f g a a0 -> Product f g a b Source # (<$) :: a0 -> Product f g a b -> Product f g a a0 Source #
(Functor (f a), Functor (g a)) => Functor (Sum f g a) |
Instance details Defined in Data.Bifunctor.Sum Methods fmap :: (a0 -> b) -> Sum f g a a0 -> Sum f g a b Source # (<$) :: a0 -> Sum f g a b -> Sum f g a a0 Source #
Functor ((,,,,,) a b c d e) | Since: base-4.18.0.0
Instance details Defined in GHC.Internal.Base Methods fmap :: (a0 -> b0) -> (a, b, c, d, e, a0) -> (a, b, c, d, e, b0) Source # (<$) :: a0 -> (a, b, c, d, e, b0) -> (a, b, c, d, e, a0) Source #
(Functor f, Bifunctor p) => Functor (Tannen f p a) |
Instance details Defined in Data.Bifunctor.Tannen Methods fmap :: (a0 -> b) -> Tannen f p a a0 -> Tannen f p a b Source # (<$) :: a0 -> Tannen f p a b -> Tannen f p a a0 Source #
Profunctor p => Functor (Procompose p q a) |
Instance details Defined in Data.Profunctor.Composition Methods fmap :: (a0 -> b) -> Procompose p q a a0 -> Procompose p q a b Source # (<$) :: a0 -> Procompose p q a b -> Procompose p q a a0 Source #
Profunctor p => Functor (Rift p q a) |
Instance details Defined in Data.Profunctor.Composition Methods fmap :: (a0 -> b) -> Rift p q a a0 -> Rift p q a b Source # (<$) :: a0 -> Rift p q a b -> Rift p q a a0 Source #
Functor ((,,,,,,) a b c d e f) | Since: base-4.18.0.0
Instance details Defined in GHC.Internal.Base Methods fmap :: (a0 -> b0) -> (a, b, c, d, e, f, a0) -> (a, b, c, d, e, f, b0) Source # (<$) :: a0 -> (a, b, c, d, e, f, b0) -> (a, b, c, d, e, f, a0) Source #
(Bifunctor p, Functor g) => Functor (Biff p f g a) |
Instance details Defined in Data.Bifunctor.Biff Methods fmap :: (a0 -> b) -> Biff p f g a a0 -> Biff p f g a b Source # (<$) :: a0 -> Biff p f g a b -> Biff p f g a a0 Source #

class Functor f => Applicative (f :: Type -> Type) where Source #

A functor with application, providing operations to

- embed pure expressions (`pure`), and
- sequence computations and combine their results (`<*>` and `liftA2`).

A minimal complete definition must include implementations of `pure` and of either `<*>` or `liftA2`. If it defines both, then they must behave the same as their default definitions:

    (<*>) = liftA2 id

    liftA2 f x y = f <$> x <*> y

Further, any definition must satisfy the following:

Identity

      pure id <*> v = v

Composition

      pure (.) <*> u <*> v <*> w = u <*> (v <*> w)

Homomorphism

      pure f <*> pure x = pure (f x)

Interchange

      u <*> pure y = pure ($ y) <*> u

The other methods have the following default definitions, which may be overridden with equivalent specialized implementations:

-     u *> v = (id <$ u) <*> v

-     u <* v = liftA2 const u v

As a consequence of these laws, the `Functor` instance for `f` will satisfy

-     fmap f x = pure f <*> x

It may be useful to note that supposing

    forall x y. p (q x y) = f x . g y

it follows from the above that

    liftA2 p (liftA2 q u v) = liftA2 f u . liftA2 g v

If `f` is also a `Monad`, it should satisfy

-     pure = return

-     m1 <*> m2 = m1 >>= (\x1 -> m2 >>= (\x2 -> return (x1 x2)))

-     (*>) = (>>)

(which implies that `pure` and `<*>` satisfy the applicative functor laws).

Minimal complete definition

pure, ((<*>) | liftA2)

Methods

pure :: a -> f a Source #

Lift a value into the Structure.

#### Examples

Expand

    >>> pure 1 :: Maybe Int
    Just 1

    >>> pure 'z' :: [Char]
    "z"

    >>> pure (pure ":D") :: Maybe [String]
    Just [":D"]

(<*>) :: f (a -> b) -> f a -> f b infixl 4 Source #

Sequential application.

A few functors support an implementation of `<*>` that is more efficient than the default one.

#### Example

Expand

Used in combination with ``(<$>)``, ``(<*>)`` can be used to build a record.

    >>> data MyState = MyState {arg1 :: Foo, arg2 :: Bar, arg3 :: Baz}

    >>> produceFoo :: Applicative f => f Foo
    >>> produceBar :: Applicative f => f Bar
    >>> produceBaz :: Applicative f => f Baz

    >>> mkState :: Applicative f => f MyState
    >>> mkState = MyState <$> produceFoo <*> produceBar <*> produceBaz

liftA2 :: (a -> b -> c) -> f a -> f b -> f c Source #

Lift a binary function to actions.

Some functors support an implementation of `liftA2` that is more efficient than the default one. In particular, if `fmap` is an expensive operation, it is likely better to use `liftA2` than to `fmap` over the structure and then use `<*>`.

This became a typeclass method in 4.10.0.0. Prior to that, it was a function defined in terms of `<*>` and `fmap`.

#### Example

Expand

    >>> liftA2 (,) (Just 3) (Just 5)
    Just (3,5)

    >>> liftA2 (+) [1, 2, 3] [4, 5, 6]
    [5,6,7,6,7,8,7,8,9]

(*>) :: f a -> f b -> f b infixl 4 Source #

Sequence actions, discarding the value of the first argument.

#### Examples

Expand

If used in conjunction with the Applicative instance for `Maybe`, you can chain Maybe computations, with a possible "early return" in case of `Nothing`.

    >>> Just 2 *> Just 3
    Just 3

    >>> Nothing *> Just 3
    Nothing

Of course a more interesting use case would be to have effectful computations instead of just returning pure values.

    >>> import Data.Char
    >>> import GHC.Internal.Text.ParserCombinators.ReadP
    >>> let p = string "my name is " *> munch1 isAlpha <* eof
    >>> readP_to_S p "my name is Simon"
    [("Simon","")]

(<*) :: f a -> f b -> f a infixl 4 Source #

Sequence actions, discarding the value of the second argument.

#### Instances

Instances details

Applicative Strategy Source # |
Instance details Defined in Game.LambdaHack.Client.AI.Strategy Methods pure :: a -> Strategy a Source # (<*>) :: Strategy (a -> b) -> Strategy a -> Strategy b Source # liftA2 :: (a -> b -> c) -> Strategy a -> Strategy b -> Strategy c Source # (*>) :: Strategy a -> Strategy b -> Strategy b Source # (<*) :: Strategy a -> Strategy b -> Strategy a Source #
Applicative Frequency Source # |
Instance details Defined in Game.LambdaHack.Core.Frequency Methods pure :: a -> Frequency a Source # (<*>) :: Frequency (a -> b) -> Frequency a -> Frequency b Source # liftA2 :: (a -> b -> c) -> Frequency a -> Frequency b -> Frequency c Source # (*>) :: Frequency a -> Frequency b -> Frequency b Source # (<*) :: Frequency a -> Frequency b -> Frequency a Source #
Applicative CliImplementation Source # |

Instance details

Defined in Implementation.MonadClientImplementation

Methods

pure :: a -> CliImplementation a Source #

(<*>) :: CliImplementation (a -> b) -> CliImplementation a -> CliImplementation b Source #

liftA2 :: (a -> b -> c) -> CliImplementation a -> CliImplementation b -> CliImplementation c Source #

(*>) :: CliImplementation a -> CliImplementation b -> CliImplementation b Source #

(<*) :: CliImplementation a -> CliImplementation b -> CliImplementation a Source #

Applicative SerImplementation Source # |

Instance details

Defined in Implementation.MonadServerImplementation

Methods

pure :: a -> SerImplementation a Source #

(<*>) :: SerImplementation (a -> b) -> SerImplementation a -> SerImplementation b Source #

liftA2 :: (a -> b -> c) -> SerImplementation a -> SerImplementation b -> SerImplementation c Source #

(*>) :: SerImplementation a -> SerImplementation b -> SerImplementation b Source #

(<*) :: SerImplementation a -> SerImplementation b -> SerImplementation a Source #

Applicative Gen |
Instance details Defined in Test.QuickCheck.Gen Methods pure :: a -> Gen a Source # (<*>) :: Gen (a -> b) -> Gen a -> Gen b Source # liftA2 :: (a -> b -> c) -> Gen a -> Gen b -> Gen c Source # (*>) :: Gen a -> Gen b -> Gen b Source # (<*) :: Gen a -> Gen b -> Gen a Source #
Applicative Rose |
Instance details Defined in Test.QuickCheck.Property Methods pure :: a -> Rose a Source # (<*>) :: Rose (a -> b) -> Rose a -> Rose b Source # liftA2 :: (a -> b -> c) -> Rose a -> Rose b -> Rose c Source # (*>) :: Rose a -> Rose b -> Rose b Source # (<*) :: Rose a -> Rose b -> Rose a Source #
Applicative IResult |
Instance details Defined in Data.Aeson.Types.Internal Methods pure :: a -> IResult a Source # (<*>) :: IResult (a -> b) -> IResult a -> IResult b Source # liftA2 :: (a -> b -> c) -> IResult a -> IResult b -> IResult c Source # (*>) :: IResult a -> IResult b -> IResult b Source # (<*) :: IResult a -> IResult b -> IResult a Source #
Applicative Parser |
Instance details Defined in Data.Aeson.Types.Internal Methods pure :: a -> Parser a Source # (<*>) :: Parser (a -> b) -> Parser a -> Parser b Source # liftA2 :: (a -> b -> c) -> Parser a -> Parser b -> Parser c Source # (*>) :: Parser a -> Parser b -> Parser b Source # (<*) :: Parser a -> Parser b -> Parser a Source #
Applicative Result |
Instance details Defined in Data.Aeson.Types.Internal Methods pure :: a -> Result a Source # (<*>) :: Result (a -> b) -> Result a -> Result b Source # liftA2 :: (a -> b -> c) -> Result a -> Result b -> Result c Source # (*>) :: Result a -> Result b -> Result b Source # (<*) :: Result a -> Result b -> Result a Source #
Applicative Concurrently |

Instance details

Defined in Control.Concurrent.Async.Internal

Methods

pure :: a -> Concurrently a Source #

(<*>) :: Concurrently (a -> b) -> Concurrently a -> Concurrently b Source #

liftA2 :: (a -> b -> c) -> Concurrently a -> Concurrently b -> Concurrently c Source #

(*>) :: Concurrently a -> Concurrently b -> Concurrently b Source #

(<*) :: Concurrently a -> Concurrently b -> Concurrently a Source #

Applicative Complex | Since: base-4.9.0.0
Instance details Defined in Data.Complex Methods pure :: a -> Complex a Source # (<*>) :: Complex (a -> b) -> Complex a -> Complex b Source # liftA2 :: (a -> b -> c) -> Complex a -> Complex b -> Complex c Source # (*>) :: Complex a -> Complex b -> Complex b Source # (<*) :: Complex a -> Complex b -> Complex a Source #
Applicative First | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> First a Source # (<*>) :: First (a -> b) -> First a -> First b Source # liftA2 :: (a -> b -> c) -> First a -> First b -> First c Source # (*>) :: First a -> First b -> First b Source # (<*) :: First a -> First b -> First a Source #
Applicative Last | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Last a Source # (<*>) :: Last (a -> b) -> Last a -> Last b Source # liftA2 :: (a -> b -> c) -> Last a -> Last b -> Last c Source # (*>) :: Last a -> Last b -> Last b Source # (<*) :: Last a -> Last b -> Last a Source #
Applicative Max | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Max a Source # (<*>) :: Max (a -> b) -> Max a -> Max b Source # liftA2 :: (a -> b -> c) -> Max a -> Max b -> Max c Source # (*>) :: Max a -> Max b -> Max b Source # (<*) :: Max a -> Max b -> Max a Source #
Applicative Min | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Min a Source # (<*>) :: Min (a -> b) -> Min a -> Min b Source # liftA2 :: (a -> b -> c) -> Min a -> Min b -> Min c Source # (*>) :: Min a -> Min b -> Min b Source # (<*) :: Min a -> Min b -> Min a Source #
Applicative Get |
Instance details Defined in Data.Binary.Get.Internal Methods pure :: a -> Get a Source # (<*>) :: Get (a -> b) -> Get a -> Get b Source # liftA2 :: (a -> b -> c) -> Get a -> Get b -> Get c Source # (*>) :: Get a -> Get b -> Get b Source # (<*) :: Get a -> Get b -> Get a Source #
Applicative PutM |
Instance details Defined in Data.Binary.Put Methods pure :: a -> PutM a Source # (<*>) :: PutM (a -> b) -> PutM a -> PutM b Source # liftA2 :: (a -> b -> c) -> PutM a -> PutM b -> PutM c Source # (*>) :: PutM a -> PutM b -> PutM b Source # (<*) :: PutM a -> PutM b -> PutM a Source #
Applicative Put |
Instance details Defined in Data.ByteString.Builder.Internal Methods pure :: a -> Put a Source # (<*>) :: Put (a -> b) -> Put a -> Put b Source # liftA2 :: (a -> b -> c) -> Put a -> Put b -> Put c Source # (*>) :: Put a -> Put b -> Put b Source # (<*) :: Put a -> Put b -> Put a Source #
Applicative Seq | Since: containers-0.5.4
Instance details Defined in Data.Sequence.Internal Methods pure :: a -> Seq a Source # (<*>) :: Seq (a -> b) -> Seq a -> Seq b Source # liftA2 :: (a -> b -> c) -> Seq a -> Seq b -> Seq c Source # (*>) :: Seq a -> Seq b -> Seq b Source # (<*) :: Seq a -> Seq b -> Seq a Source #
Applicative Tree |
Instance details Defined in Data.Tree Methods pure :: a -> Tree a Source # (<*>) :: Tree (a -> b) -> Tree a -> Tree b Source # liftA2 :: (a -> b -> c) -> Tree a -> Tree b -> Tree c Source # (*>) :: Tree a -> Tree b -> Tree b Source # (<*) :: Tree a -> Tree b -> Tree a Source #
Applicative DNonEmpty |
Instance details Defined in Data.DList.DNonEmpty.Internal Methods pure :: a -> DNonEmpty a Source # (<*>) :: DNonEmpty (a -> b) -> DNonEmpty a -> DNonEmpty b Source # liftA2 :: (a -> b -> c) -> DNonEmpty a -> DNonEmpty b -> DNonEmpty c Source # (*>) :: DNonEmpty a -> DNonEmpty b -> DNonEmpty b Source # (<*) :: DNonEmpty a -> DNonEmpty b -> DNonEmpty a Source #
Applicative DList |
Instance details Defined in Data.DList.Internal Methods pure :: a -> DList a Source # (<*>) :: DList (a -> b) -> DList a -> DList b Source # liftA2 :: (a -> b -> c) -> DList a -> DList b -> DList c Source # (*>) :: DList a -> DList b -> DList b Source # (<*) :: DList a -> DList b -> DList a Source #
Applicative NonEmpty | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods pure :: a -> NonEmpty a Source # (<*>) :: NonEmpty (a -> b) -> NonEmpty a -> NonEmpty b Source # liftA2 :: (a -> b -> c) -> NonEmpty a -> NonEmpty b -> NonEmpty c Source # (*>) :: NonEmpty a -> NonEmpty b -> NonEmpty b Source # (<*) :: NonEmpty a -> NonEmpty b -> NonEmpty a Source #
Applicative STM | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Conc.Sync Methods pure :: a -> STM a Source # (<*>) :: STM (a -> b) -> STM a -> STM b Source # liftA2 :: (a -> b -> c) -> STM a -> STM b -> STM c Source # (*>) :: STM a -> STM b -> STM b Source # (<*) :: STM a -> STM b -> STM a Source #
Applicative Identity | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Functor.Identity Methods pure :: a -> Identity a Source # (<*>) :: Identity (a -> b) -> Identity a -> Identity b Source # liftA2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c Source # (*>) :: Identity a -> Identity b -> Identity b Source # (<*) :: Identity a -> Identity b -> Identity a Source #
Applicative First | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods pure :: a -> First a Source # (<*>) :: First (a -> b) -> First a -> First b Source # liftA2 :: (a -> b -> c) -> First a -> First b -> First c Source # (*>) :: First a -> First b -> First b Source # (<*) :: First a -> First b -> First a Source #
Applicative Last | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods pure :: a -> Last a Source # (<*>) :: Last (a -> b) -> Last a -> Last b Source # liftA2 :: (a -> b -> c) -> Last a -> Last b -> Last c Source # (*>) :: Last a -> Last b -> Last b Source # (<*) :: Last a -> Last b -> Last a Source #
Applicative Down | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Data.Ord Methods pure :: a -> Down a Source # (<*>) :: Down (a -> b) -> Down a -> Down b Source # liftA2 :: (a -> b -> c) -> Down a -> Down b -> Down c Source # (*>) :: Down a -> Down b -> Down b Source # (<*) :: Down a -> Down b -> Down a Source #
Applicative Dual | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods pure :: a -> Dual a Source # (<*>) :: Dual (a -> b) -> Dual a -> Dual b Source # liftA2 :: (a -> b -> c) -> Dual a -> Dual b -> Dual c Source # (*>) :: Dual a -> Dual b -> Dual b Source # (<*) :: Dual a -> Dual b -> Dual a Source #
Applicative Product | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods pure :: a -> Product a Source # (<*>) :: Product (a -> b) -> Product a -> Product b Source # liftA2 :: (a -> b -> c) -> Product a -> Product b -> Product c Source # (*>) :: Product a -> Product b -> Product b Source # (<*) :: Product a -> Product b -> Product a Source #
Applicative Sum | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods pure :: a -> Sum a Source # (<*>) :: Sum (a -> b) -> Sum a -> Sum b Source # liftA2 :: (a -> b -> c) -> Sum a -> Sum b -> Sum c Source # (*>) :: Sum a -> Sum b -> Sum b Source # (<*) :: Sum a -> Sum b -> Sum a Source #

Applicative ZipList

    f <$> ZipList xs1 <*> ... <*> ZipList xsN
        = ZipList (zipWithN f xs1 ... xsN)

where `zipWithN` refers to the `zipWith` function of the appropriate arity (`zipWith`, `zipWith3`, `zipWith4`, ...). For example:

    (\a b c -> stimes c [a, b]) <$> ZipList "abcd" <*> ZipList "567" <*> ZipList [1..]
        = ZipList (zipWith3 (\a b c -> stimes c [a, b]) "abcd" "567" [1..])
        = ZipList {getZipList = ["a5","b6b6","c7c7c7"]}

Since: base-2.1

Instance details Defined in GHC.Internal.Functor.ZipList Methods pure :: a -> ZipList a Source # (<*>) :: ZipList (a -> b) -> ZipList a -> ZipList b Source # liftA2 :: (a -> b -> c) -> ZipList a -> ZipList b -> ZipList c Source # (*>) :: ZipList a -> ZipList b -> ZipList b Source # (<*) :: ZipList a -> ZipList b -> ZipList a Source #
Applicative Par1 | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods pure :: a -> Par1 a Source # (<*>) :: Par1 (a -> b) -> Par1 a -> Par1 b Source # liftA2 :: (a -> b -> c) -> Par1 a -> Par1 b -> Par1 c Source # (*>) :: Par1 a -> Par1 b -> Par1 b Source # (<*) :: Par1 a -> Par1 b -> Par1 a Source #
Applicative P | Since: base-4.5.0.0
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods pure :: a -> P a Source # (<*>) :: P (a -> b) -> P a -> P b Source # liftA2 :: (a -> b -> c) -> P a -> P b -> P c Source # (*>) :: P a -> P b -> P b Source # (<*) :: P a -> P b -> P a Source #
Applicative ReadP | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods pure :: a -> ReadP a Source # (<*>) :: ReadP (a -> b) -> ReadP a -> ReadP b Source # liftA2 :: (a -> b -> c) -> ReadP a -> ReadP b -> ReadP c Source # (*>) :: ReadP a -> ReadP b -> ReadP b Source # (<*) :: ReadP a -> ReadP b -> ReadP a Source #
Applicative ReadPrec | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadPrec Methods pure :: a -> ReadPrec a Source # (<*>) :: ReadPrec (a -> b) -> ReadPrec a -> ReadPrec b Source # liftA2 :: (a -> b -> c) -> ReadPrec a -> ReadPrec b -> ReadPrec c Source # (*>) :: ReadPrec a -> ReadPrec b -> ReadPrec b Source # (<*) :: ReadPrec a -> ReadPrec b -> ReadPrec a Source #
Applicative IO | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods pure :: a -> IO a Source # (<*>) :: IO (a -> b) -> IO a -> IO b Source # liftA2 :: (a -> b -> c) -> IO a -> IO b -> IO c Source # (*>) :: IO a -> IO b -> IO b Source # (<*) :: IO a -> IO b -> IO a Source #
Applicative Plucker |
Instance details Defined in Linear.Plucker Methods pure :: a -> Plucker a Source # (<*>) :: Plucker (a -> b) -> Plucker a -> Plucker b Source # liftA2 :: (a -> b -> c) -> Plucker a -> Plucker b -> Plucker c Source # (*>) :: Plucker a -> Plucker b -> Plucker b Source # (<*) :: Plucker a -> Plucker b -> Plucker a Source #
Applicative Quaternion |
Instance details Defined in Linear.Quaternion Methods pure :: a -> Quaternion a Source # (<*>) :: Quaternion (a -> b) -> Quaternion a -> Quaternion b Source # liftA2 :: (a -> b -> c) -> Quaternion a -> Quaternion b -> Quaternion c Source # (*>) :: Quaternion a -> Quaternion b -> Quaternion b Source # (<*) :: Quaternion a -> Quaternion b -> Quaternion a Source #
Applicative V0 |
Instance details Defined in Linear.V0 Methods pure :: a -> V0 a Source # (<*>) :: V0 (a -> b) -> V0 a -> V0 b Source # liftA2 :: (a -> b -> c) -> V0 a -> V0 b -> V0 c Source # (*>) :: V0 a -> V0 b -> V0 b Source # (<*) :: V0 a -> V0 b -> V0 a Source #
Applicative V1 |
Instance details Defined in Linear.V1 Methods pure :: a -> V1 a Source # (<*>) :: V1 (a -> b) -> V1 a -> V1 b Source # liftA2 :: (a -> b -> c) -> V1 a -> V1 b -> V1 c Source # (*>) :: V1 a -> V1 b -> V1 b Source # (<*) :: V1 a -> V1 b -> V1 a Source #
Applicative V2 |
Instance details Defined in Linear.V2 Methods pure :: a -> V2 a Source # (<*>) :: V2 (a -> b) -> V2 a -> V2 b Source # liftA2 :: (a -> b -> c) -> V2 a -> V2 b -> V2 c Source # (*>) :: V2 a -> V2 b -> V2 b Source # (<*) :: V2 a -> V2 b -> V2 a Source #
Applicative V3 |
Instance details Defined in Linear.V3 Methods pure :: a -> V3 a Source # (<*>) :: V3 (a -> b) -> V3 a -> V3 b Source # liftA2 :: (a -> b -> c) -> V3 a -> V3 b -> V3 c Source # (*>) :: V3 a -> V3 b -> V3 b Source # (<*) :: V3 a -> V3 b -> V3 a Source #
Applicative V4 |
Instance details Defined in Linear.V4 Methods pure :: a -> V4 a Source # (<*>) :: V4 (a -> b) -> V4 a -> V4 b Source # liftA2 :: (a -> b -> c) -> V4 a -> V4 b -> V4 c Source # (*>) :: V4 a -> V4 b -> V4 b Source # (<*) :: V4 a -> V4 b -> V4 a Source #
Applicative Chunk |
Instance details Defined in Options.Applicative.Help.Chunk Methods pure :: a -> Chunk a Source # (<*>) :: Chunk (a -> b) -> Chunk a -> Chunk b Source # liftA2 :: (a -> b -> c) -> Chunk a -> Chunk b -> Chunk c Source # (*>) :: Chunk a -> Chunk b -> Chunk b Source # (<*) :: Chunk a -> Chunk b -> Chunk a Source #
Applicative ComplResult |
Instance details Defined in Options.Applicative.Internal Methods pure :: a -> ComplResult a Source # (<*>) :: ComplResult (a -> b) -> ComplResult a -> ComplResult b Source # liftA2 :: (a -> b -> c) -> ComplResult a -> ComplResult b -> ComplResult c Source # (*>) :: ComplResult a -> ComplResult b -> ComplResult b Source # (<*) :: ComplResult a -> ComplResult b -> ComplResult a Source #
Applicative Completion |
Instance details Defined in Options.Applicative.Internal Methods pure :: a -> Completion a Source # (<*>) :: Completion (a -> b) -> Completion a -> Completion b Source # liftA2 :: (a -> b -> c) -> Completion a -> Completion b -> Completion c Source # (*>) :: Completion a -> Completion b -> Completion b Source # (<*) :: Completion a -> Completion b -> Completion a Source #
Applicative P |
Instance details Defined in Options.Applicative.Internal Methods pure :: a -> P a Source # (<*>) :: P (a -> b) -> P a -> P b Source # liftA2 :: (a -> b -> c) -> P a -> P b -> P c Source # (*>) :: P a -> P b -> P b Source # (<*) :: P a -> P b -> P a Source #
Applicative Parser |
Instance details Defined in Options.Applicative.Types Methods pure :: a -> Parser a Source # (<*>) :: Parser (a -> b) -> Parser a -> Parser b Source # liftA2 :: (a -> b -> c) -> Parser a -> Parser b -> Parser c Source # (*>) :: Parser a -> Parser b -> Parser b Source # (<*) :: Parser a -> Parser b -> Parser a Source #
Applicative ParserM |
Instance details Defined in Options.Applicative.Types Methods pure :: a -> ParserM a Source # (<*>) :: ParserM (a -> b) -> ParserM a -> ParserM b Source # liftA2 :: (a -> b -> c) -> ParserM a -> ParserM b -> ParserM c Source # (*>) :: ParserM a -> ParserM b -> ParserM b Source # (<*) :: ParserM a -> ParserM b -> ParserM a Source #
Applicative ParserResult |
Instance details Defined in Options.Applicative.Types Methods pure :: a -> ParserResult a Source # (<*>) :: ParserResult (a -> b) -> ParserResult a -> ParserResult b Source # liftA2 :: (a -> b -> c) -> ParserResult a -> ParserResult b -> ParserResult c Source # (*>) :: ParserResult a -> ParserResult b -> ParserResult b Source # (<*) :: ParserResult a -> ParserResult b -> ParserResult a Source #
Applicative ReadM |
Instance details Defined in Options.Applicative.Types Methods pure :: a -> ReadM a Source # (<*>) :: ReadM (a -> b) -> ReadM a -> ReadM b Source # liftA2 :: (a -> b -> c) -> ReadM a -> ReadM b -> ReadM c Source # (*>) :: ReadM a -> ReadM b -> ReadM b Source # (<*) :: ReadM a -> ReadM b -> ReadM a Source #
Applicative Array |
Instance details Defined in Data.Primitive.Array Methods pure :: a -> Array a Source # (<*>) :: Array (a -> b) -> Array a -> Array b Source # liftA2 :: (a -> b -> c) -> Array a -> Array b -> Array c Source # (*>) :: Array a -> Array b -> Array b Source # (<*) :: Array a -> Array b -> Array a Source #
Applicative SmallArray |
Instance details Defined in Data.Primitive.SmallArray Methods pure :: a -> SmallArray a Source # (<*>) :: SmallArray (a -> b) -> SmallArray a -> SmallArray b Source # liftA2 :: (a -> b -> c) -> SmallArray a -> SmallArray b -> SmallArray c Source # (*>) :: SmallArray a -> SmallArray b -> SmallArray b Source # (<*) :: SmallArray a -> SmallArray b -> SmallArray a Source #
Applicative V2 |
Instance details Defined in SDL.Internal.Vect Methods pure :: a -> V2 a Source # (<*>) :: V2 (a -> b) -> V2 a -> V2 b Source # liftA2 :: (a -> b -> c) -> V2 a -> V2 b -> V2 c Source # (*>) :: V2 a -> V2 b -> V2 b Source # (<*) :: V2 a -> V2 b -> V2 a Source #
Applicative V3 |
Instance details Defined in SDL.Internal.Vect Methods pure :: a -> V3 a Source # (<*>) :: V3 (a -> b) -> V3 a -> V3 b Source # liftA2 :: (a -> b -> c) -> V3 a -> V3 b -> V3 c Source # (*>) :: V3 a -> V3 b -> V3 b Source # (<*) :: V3 a -> V3 b -> V3 a Source #
Applicative V4 |
Instance details Defined in SDL.Internal.Vect Methods pure :: a -> V4 a Source # (<*>) :: V4 (a -> b) -> V4 a -> V4 b Source # liftA2 :: (a -> b -> c) -> V4 a -> V4 b -> V4 c Source # (*>) :: V4 a -> V4 b -> V4 b Source # (<*) :: V4 a -> V4 b -> V4 a Source #
Applicative PprM |
Instance details Defined in Language.Haskell.TH.PprLib Methods pure :: a -> PprM a Source # (<*>) :: PprM (a -> b) -> PprM a -> PprM b Source # liftA2 :: (a -> b -> c) -> PprM a -> PprM b -> PprM c Source # (*>) :: PprM a -> PprM b -> PprM b Source # (<*) :: PprM a -> PprM b -> PprM a Source #
Applicative Q |
Instance details Defined in Language.Haskell.TH.Syntax Methods pure :: a -> Q a Source # (<*>) :: Q (a -> b) -> Q a -> Q b Source # liftA2 :: (a -> b -> c) -> Q a -> Q b -> Q c Source # (*>) :: Q a -> Q b -> Q b Source # (<*) :: Q a -> Q b -> Q a Source #
Applicative Vector |
Instance details Defined in Data.Vector Methods pure :: a -> Vector a Source # (<*>) :: Vector (a -> b) -> Vector a -> Vector b Source # liftA2 :: (a -> b -> c) -> Vector a -> Vector b -> Vector c Source # (*>) :: Vector a -> Vector b -> Vector b Source # (<*) :: Vector a -> Vector b -> Vector a Source #
Applicative Id |
Instance details Defined in Data.Vector.Fusion.Util Methods pure :: a -> Id a Source # (<*>) :: Id (a -> b) -> Id a -> Id b Source # liftA2 :: (a -> b -> c) -> Id a -> Id b -> Id c Source # (*>) :: Id a -> Id b -> Id b Source # (<*) :: Id a -> Id b -> Id a Source #
Applicative Vector |
Instance details Defined in Data.Vector.Strict Methods pure :: a -> Vector a Source # (<*>) :: Vector (a -> b) -> Vector a -> Vector b Source # liftA2 :: (a -> b -> c) -> Vector a -> Vector b -> Vector c Source # (*>) :: Vector a -> Vector b -> Vector b Source # (<*) :: Vector a -> Vector b -> Vector a Source #
Applicative Stream |
Instance details Defined in Codec.Compression.Zlib.Stream Methods pure :: a -> Stream a Source # (<*>) :: Stream (a -> b) -> Stream a -> Stream b Source # liftA2 :: (a -> b -> c) -> Stream a -> Stream b -> Stream c Source # (*>) :: Stream a -> Stream b -> Stream b Source # (<*) :: Stream a -> Stream b -> Stream a Source #
Applicative Maybe | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods pure :: a -> Maybe a Source # (<*>) :: Maybe (a -> b) -> Maybe a -> Maybe b Source # liftA2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c Source # (*>) :: Maybe a -> Maybe b -> Maybe b Source # (<*) :: Maybe a -> Maybe b -> Maybe a Source #
Applicative Solo | Since: base-4.15
Instance details Defined in GHC.Internal.Base Methods pure :: a -> Solo a Source # (<*>) :: Solo (a -> b) -> Solo a -> Solo b Source # liftA2 :: (a -> b -> c) -> Solo a -> Solo b -> Solo c Source # (*>) :: Solo a -> Solo b -> Solo b Source # (<*) :: Solo a -> Solo b -> Solo a Source #
Applicative [] | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods pure :: a -> [a] Source # (<*>) :: [a -> b] -> [a] -> [b] Source # liftA2 :: (a -> b -> c) -> [a] -> [b] -> [c] Source # (*>) :: [a] -> [b] -> [b] Source # (<*) :: [a] -> [b] -> [a] Source #
Applicative (PropertyM m) |
Instance details Defined in Test.QuickCheck.Monadic Methods pure :: a -> PropertyM m a Source # (<*>) :: PropertyM m (a -> b) -> PropertyM m a -> PropertyM m b Source # liftA2 :: (a -> b -> c) -> PropertyM m a -> PropertyM m b -> PropertyM m c Source # (*>) :: PropertyM m a -> PropertyM m b -> PropertyM m b Source # (<*) :: PropertyM m a -> PropertyM m b -> PropertyM m a Source #
Representable f => Applicative (Co f) |
Instance details Defined in Data.Functor.Rep Methods pure :: a -> Co f a Source # (<*>) :: Co f (a -> b) -> Co f a -> Co f b Source # liftA2 :: (a -> b -> c) -> Co f a -> Co f b -> Co f c Source # (*>) :: Co f a -> Co f b -> Co f b Source # (<*) :: Co f a -> Co f b -> Co f a Source #
Applicative (ConcurrentlyE e) |

Instance details

Defined in Control.Concurrent.Async.Internal

Methods

pure :: a -> ConcurrentlyE e a Source #

(<*>) :: ConcurrentlyE e (a -> b) -> ConcurrentlyE e a -> ConcurrentlyE e b Source #

liftA2 :: (a -> b -> c) -> ConcurrentlyE e a -> ConcurrentlyE e b -> ConcurrentlyE e c Source #

(*>) :: ConcurrentlyE e a -> ConcurrentlyE e b -> ConcurrentlyE e b Source #

(<*) :: ConcurrentlyE e a -> ConcurrentlyE e b -> ConcurrentlyE e a Source #

Monad m => Applicative (WrappedMonad m) | Since: base-2.1

Instance details

Defined in Control.Applicative

Methods

pure :: a -> WrappedMonad m a Source #

(<*>) :: WrappedMonad m (a -> b) -> WrappedMonad m a -> WrappedMonad m b Source #

liftA2 :: (a -> b -> c) -> WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m c Source #

(*>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b Source #

(<*) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m a Source #

Applicative (SetM s) |
Instance details Defined in Data.Graph Methods pure :: a -> SetM s a Source # (<*>) :: SetM s (a -> b) -> SetM s a -> SetM s b Source # liftA2 :: (a -> b -> c) -> SetM s a -> SetM s b -> SetM s c Source # (*>) :: SetM s a -> SetM s b -> SetM s b Source # (<*) :: SetM s a -> SetM s b -> SetM s a Source #
Alternative f => Applicative (Cofree f) |
Instance details Defined in Control.Comonad.Cofree Methods pure :: a -> Cofree f a Source # (<*>) :: Cofree f (a -> b) -> Cofree f a -> Cofree f b Source # liftA2 :: (a -> b -> c) -> Cofree f a -> Cofree f b -> Cofree f c Source # (*>) :: Cofree f a -> Cofree f b -> Cofree f b Source # (<*) :: Cofree f a -> Cofree f b -> Cofree f a Source #
Functor f => Applicative (Free f) |
Instance details Defined in Control.Monad.Free Methods pure :: a -> Free f a Source # (<*>) :: Free f (a -> b) -> Free f a -> Free f b Source # liftA2 :: (a -> b -> c) -> Free f a -> Free f b -> Free f c Source # (*>) :: Free f a -> Free f b -> Free f b Source # (<*) :: Free f a -> Free f b -> Free f a Source #
Arrow a => Applicative (ArrowMonad a) | Since: base-4.6.0.0

Instance details

Defined in GHC.Internal.Control.Arrow

Methods

pure :: a0 -> ArrowMonad a a0 Source #

(<*>) :: ArrowMonad a (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b Source #

liftA2 :: (a0 -> b -> c) -> ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a c Source #

(*>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b Source #

(<*) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a a0 Source #

Applicative (Either e) | Since: base-3.0
Instance details Defined in GHC.Internal.Data.Either Methods pure :: a -> Either e a Source # (<*>) :: Either e (a -> b) -> Either e a -> Either e b Source # liftA2 :: (a -> b -> c) -> Either e a -> Either e b -> Either e c Source # (*>) :: Either e a -> Either e b -> Either e b Source # (<*) :: Either e a -> Either e b -> Either e a Source #
Applicative (StateL s) | Since: base-4.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods pure :: a -> StateL s a Source # (<*>) :: StateL s (a -> b) -> StateL s a -> StateL s b Source # liftA2 :: (a -> b -> c) -> StateL s a -> StateL s b -> StateL s c Source # (*>) :: StateL s a -> StateL s b -> StateL s b Source # (<*) :: StateL s a -> StateL s b -> StateL s a Source #
Applicative (StateR s) | Since: base-4.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods pure :: a -> StateR s a Source # (<*>) :: StateR s (a -> b) -> StateR s a -> StateR s b Source # liftA2 :: (a -> b -> c) -> StateR s a -> StateR s b -> StateR s c Source # (*>) :: StateR s a -> StateR s b -> StateR s b Source # (<*) :: StateR s a -> StateR s b -> StateR s a Source #
Applicative (U1 :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods pure :: a -> U1 a Source # (<*>) :: U1 (a -> b) -> U1 a -> U1 b Source # liftA2 :: (a -> b -> c) -> U1 a -> U1 b -> U1 c Source # (*>) :: U1 a -> U1 b -> U1 b Source # (<*) :: U1 a -> U1 b -> U1 a Source #
Applicative (ST s) | Since: base-4.4.0.0
Instance details Defined in GHC.Internal.ST Methods pure :: a -> ST s a Source # (<*>) :: ST s (a -> b) -> ST s a -> ST s b Source # liftA2 :: (a -> b -> c) -> ST s a -> ST s b -> ST s c Source # (*>) :: ST s a -> ST s b -> ST s b Source # (<*) :: ST s a -> ST s b -> ST s a Source #
Applicative f => Applicative (Yoneda f) |
Instance details Defined in Data.Functor.Yoneda Methods pure :: a -> Yoneda f a Source # (<*>) :: Yoneda f (a -> b) -> Yoneda f a -> Yoneda f b Source # liftA2 :: (a -> b -> c) -> Yoneda f a -> Yoneda f b -> Yoneda f c Source # (*>) :: Yoneda f a -> Yoneda f b -> Yoneda f b Source # (<*) :: Yoneda f a -> Yoneda f b -> Yoneda f a Source #
Applicative (StateL s) |
Instance details Defined in Data.Key Methods pure :: a -> StateL s a Source # (<*>) :: StateL s (a -> b) -> StateL s a -> StateL s b Source # liftA2 :: (a -> b -> c) -> StateL s a -> StateL s b -> StateL s c Source # (*>) :: StateL s a -> StateL s b -> StateL s b Source # (<*) :: StateL s a -> StateL s b -> StateL s a Source #
Applicative (StateR s) |
Instance details Defined in Data.Key Methods pure :: a -> StateR s a Source # (<*>) :: StateR s (a -> b) -> StateR s a -> StateR s b Source # liftA2 :: (a -> b -> c) -> StateR s a -> StateR s b -> StateR s c Source # (*>) :: StateR s a -> StateR s b -> StateR s b Source # (<*) :: StateR s a -> StateR s b -> StateR s a Source #
Applicative f => Applicative (Indexing f) |
Instance details Defined in Control.Lens.Internal.Indexed Methods pure :: a -> Indexing f a Source # (<*>) :: Indexing f (a -> b) -> Indexing f a -> Indexing f b Source # liftA2 :: (a -> b -> c) -> Indexing f a -> Indexing f b -> Indexing f c Source # (*>) :: Indexing f a -> Indexing f b -> Indexing f b Source # (<*) :: Indexing f a -> Indexing f b -> Indexing f a Source #
Applicative f => Applicative (Indexing64 f) |

Instance details

Defined in Control.Lens.Internal.Indexed

Methods

pure :: a -> Indexing64 f a Source #

(<*>) :: Indexing64 f (a -> b) -> Indexing64 f a -> Indexing64 f b Source #

liftA2 :: (a -> b -> c) -> Indexing64 f a -> Indexing64 f b -> Indexing64 f c Source #

(*>) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f b Source #

(<*) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f a Source #

Applicative (ReifiedFold s) |

Instance details

Defined in Control.Lens.Reified

Methods

pure :: a -> ReifiedFold s a Source #

(<*>) :: ReifiedFold s (a -> b) -> ReifiedFold s a -> ReifiedFold s b Source #

liftA2 :: (a -> b -> c) -> ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s c Source #

(*>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b Source #

(<*) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s a Source #

Applicative (ReifiedGetter s) |

Instance details

Defined in Control.Lens.Reified

Methods

pure :: a -> ReifiedGetter s a Source #

(<*>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b Source #

liftA2 :: (a -> b -> c) -> ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s c Source #

(*>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b Source #

(<*) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a Source #

Applicative f => Applicative (Point f) |
Instance details Defined in Linear.Affine Methods pure :: a -> Point f a Source # (<*>) :: Point f (a -> b) -> Point f a -> Point f b Source # liftA2 :: (a -> b -> c) -> Point f a -> Point f b -> Point f c Source # (*>) :: Point f a -> Point f b -> Point f b Source # (<*) :: Point f a -> Point f b -> Point f a Source #
Monad m => Applicative (ListT m) |
Instance details Defined in Options.Applicative.Internal Methods pure :: a -> ListT m a Source # (<*>) :: ListT m (a -> b) -> ListT m a -> ListT m b Source # liftA2 :: (a -> b -> c) -> ListT m a -> ListT m b -> ListT m c Source # (*>) :: ListT m a -> ListT m b -> ListT m b Source # (<*) :: ListT m a -> ListT m b -> ListT m a Source #
Monad m => Applicative (NondetT m) |
Instance details Defined in Options.Applicative.Internal Methods pure :: a -> NondetT m a Source # (<*>) :: NondetT m (a -> b) -> NondetT m a -> NondetT m b Source # liftA2 :: (a -> b -> c) -> NondetT m a -> NondetT m b -> NondetT m c Source # (*>) :: NondetT m a -> NondetT m b -> NondetT m b Source # (<*) :: NondetT m a -> NondetT m b -> NondetT m a Source #
Applicative f => Applicative (Point f) |
Instance details Defined in SDL.Internal.Vect Methods pure :: a -> Point f a Source # (<*>) :: Point f (a -> b) -> Point f a -> Point f b Source # liftA2 :: (a -> b -> c) -> Point f a -> Point f b -> Point f c Source # (*>) :: Point f a -> Point f b -> Point f b Source # (<*) :: Point f a -> Point f b -> Point f a Source #
Semigroup a => Applicative (These a) |
Instance details Defined in Data.Strict.These Methods pure :: a0 -> These a a0 Source # (<*>) :: These a (a0 -> b) -> These a a0 -> These a b Source # liftA2 :: (a0 -> b -> c) -> These a a0 -> These a b -> These a c Source # (*>) :: These a a0 -> These a b -> These a b Source # (<*) :: These a a0 -> These a b -> These a a0 Source #
Applicative (IParser t) |
Instance details Defined in Data.Text.Internal.Read Methods pure :: a -> IParser t a Source # (<*>) :: IParser t (a -> b) -> IParser t a -> IParser t b Source # liftA2 :: (a -> b -> c) -> IParser t a -> IParser t b -> IParser t c Source # (*>) :: IParser t a -> IParser t b -> IParser t b Source # (<*) :: IParser t a -> IParser t b -> IParser t a Source #
Semigroup a => Applicative (These a) |
Instance details Defined in Data.These Methods pure :: a0 -> These a a0 Source # (<*>) :: These a (a0 -> b) -> These a a0 -> These a b Source # liftA2 :: (a0 -> b -> c) -> These a a0 -> These a b -> These a c Source # (*>) :: These a a0 -> These a b -> These a b Source # (<*) :: These a a0 -> These a b -> These a a0 Source #
Applicative f => Applicative (Lift f) | A combination is `Pure` only if both parts are.
Instance details Defined in Control.Applicative.Lift Methods pure :: a -> Lift f a Source # (<*>) :: Lift f (a -> b) -> Lift f a -> Lift f b Source # liftA2 :: (a -> b -> c) -> Lift f a -> Lift f b -> Lift f c Source # (*>) :: Lift f a -> Lift f b -> Lift f b Source # (<*) :: Lift f a -> Lift f b -> Lift f a Source #
(Functor m, Monad m) => Applicative (MaybeT m) |
Instance details Defined in Control.Monad.Trans.Maybe Methods pure :: a -> MaybeT m a Source # (<*>) :: MaybeT m (a -> b) -> MaybeT m a -> MaybeT m b Source # liftA2 :: (a -> b -> c) -> MaybeT m a -> MaybeT m b -> MaybeT m c Source # (*>) :: MaybeT m a -> MaybeT m b -> MaybeT m b Source # (<*) :: MaybeT m a -> MaybeT m b -> MaybeT m a Source #

Monoid a => Applicative ((,) a)

For tuples, the `Monoid` constraint on `a` determines how the first values merge. For example, `String`s concatenate:

    ("hello ", (+15)) <*> ("world!", 2002)
    ("hello world!",2017)

Since: base-2.1

Instance details Defined in GHC.Internal.Base Methods pure :: a0 -> (a, a0) Source # (<*>) :: (a, a0 -> b) -> (a, a0) -> (a, b) Source # liftA2 :: (a0 -> b -> c) -> (a, a0) -> (a, b) -> (a, c) Source # (*>) :: (a, a0) -> (a, b) -> (a, b) Source # (<*) :: (a, a0) -> (a, b) -> (a, a0) Source #
Arrow a => Applicative (WrappedArrow a b) | Since: base-2.1

Instance details

Defined in Control.Applicative

Methods

pure :: a0 -> WrappedArrow a b a0 Source #

(<*>) :: WrappedArrow a b (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 Source #

liftA2 :: (a0 -> b0 -> c) -> WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b c Source #

(*>) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b b0 Source #

(<*) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 Source #

Biapplicative p => Applicative (Fix p) |
Instance details Defined in Data.Bifunctor.Fix Methods pure :: a -> Fix p a Source # (<*>) :: Fix p (a -> b) -> Fix p a -> Fix p b Source # liftA2 :: (a -> b -> c) -> Fix p a -> Fix p b -> Fix p c Source # (*>) :: Fix p a -> Fix p b -> Fix p b Source # (<*) :: Fix p a -> Fix p b -> Fix p a Source #
Biapplicative p => Applicative (Join p) |
Instance details Defined in Data.Bifunctor.Join Methods pure :: a -> Join p a Source # (<*>) :: Join p (a -> b) -> Join p a -> Join p b Source # liftA2 :: (a -> b -> c) -> Join p a -> Join p b -> Join p c Source # (*>) :: Join p a -> Join p b -> Join p b Source # (<*) :: Join p a -> Join p b -> Join p a Source #
(Applicative f, Monad f) => Applicative (WhenMissing f x) | Equivalent to `ReaderT k (ReaderT x (MaybeT f))`. Since: containers-0.5.9

Instance details

Defined in Data.IntMap.Internal

Methods

pure :: a -> WhenMissing f x a Source #

(<*>) :: WhenMissing f x (a -> b) -> WhenMissing f x a -> WhenMissing f x b Source #

liftA2 :: (a -> b -> c) -> WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x c Source #

(*>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b Source #

(<*) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x a Source #

(Alternative f, Applicative w) => Applicative (CofreeT f w) |
Instance details Defined in Control.Comonad.Trans.Cofree Methods pure :: a -> CofreeT f w a Source # (<*>) :: CofreeT f w (a -> b) -> CofreeT f w a -> CofreeT f w b Source # liftA2 :: (a -> b -> c) -> CofreeT f w a -> CofreeT f w b -> CofreeT f w c Source # (*>) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w b Source # (<*) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w a Source #
(Functor f, Monad m) => Applicative (FreeT f m) |
Instance details Defined in Control.Monad.Trans.Free Methods pure :: a -> FreeT f m a Source # (<*>) :: FreeT f m (a -> b) -> FreeT f m a -> FreeT f m b Source # liftA2 :: (a -> b -> c) -> FreeT f m a -> FreeT f m b -> FreeT f m c Source # (*>) :: FreeT f m a -> FreeT f m b -> FreeT f m b Source # (<*) :: FreeT f m a -> FreeT f m b -> FreeT f m a Source #
Applicative m => Applicative (Kleisli m a) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Control.Arrow Methods pure :: a0 -> Kleisli m a a0 Source # (<*>) :: Kleisli m a (a0 -> b) -> Kleisli m a a0 -> Kleisli m a b Source # liftA2 :: (a0 -> b -> c) -> Kleisli m a a0 -> Kleisli m a b -> Kleisli m a c Source # (*>) :: Kleisli m a a0 -> Kleisli m a b -> Kleisli m a b Source # (<*) :: Kleisli m a a0 -> Kleisli m a b -> Kleisli m a a0 Source #
Monoid m => Applicative (Const m :: Type -> Type) | Since: base-2.0.1
Instance details Defined in GHC.Internal.Data.Functor.Const Methods pure :: a -> Const m a Source # (<*>) :: Const m (a -> b) -> Const m a -> Const m b Source # liftA2 :: (a -> b -> c) -> Const m a -> Const m b -> Const m c Source # (*>) :: Const m a -> Const m b -> Const m b Source # (<*) :: Const m a -> Const m b -> Const m a Source #
Monad m => Applicative (StateT s m) | Since: base-4.18.0.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods pure :: a -> StateT s m a Source # (<*>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b Source # liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c Source # (*>) :: StateT s m a -> StateT s m b -> StateT s m b Source # (<*) :: StateT s m a -> StateT s m b -> StateT s m a Source #
Applicative f => Applicative (Ap f) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods pure :: a -> Ap f a Source # (<*>) :: Ap f (a -> b) -> Ap f a -> Ap f b Source # liftA2 :: (a -> b -> c) -> Ap f a -> Ap f b -> Ap f c Source # (*>) :: Ap f a -> Ap f b -> Ap f b Source # (<*) :: Ap f a -> Ap f b -> Ap f a Source #
Applicative f => Applicative (Alt f) | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods pure :: a -> Alt f a Source # (<*>) :: Alt f (a -> b) -> Alt f a -> Alt f b Source # liftA2 :: (a -> b -> c) -> Alt f a -> Alt f b -> Alt f c Source # (*>) :: Alt f a -> Alt f b -> Alt f b Source # (<*) :: Alt f a -> Alt f b -> Alt f a Source #
(Generic1 f, Applicative (Rep1 f)) => Applicative (Generically1 f) | Since: base-4.17.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

pure :: a -> Generically1 f a Source #

(<*>) :: Generically1 f (a -> b) -> Generically1 f a -> Generically1 f b Source #

liftA2 :: (a -> b -> c) -> Generically1 f a -> Generically1 f b -> Generically1 f c Source #

(*>) :: Generically1 f a -> Generically1 f b -> Generically1 f b Source #

(<*) :: Generically1 f a -> Generically1 f b -> Generically1 f a Source #

Applicative f => Applicative (Rec1 f) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods pure :: a -> Rec1 f a Source # (<*>) :: Rec1 f (a -> b) -> Rec1 f a -> Rec1 f b Source # liftA2 :: (a -> b -> c) -> Rec1 f a -> Rec1 f b -> Rec1 f c Source # (*>) :: Rec1 f a -> Rec1 f b -> Rec1 f b Source # (<*) :: Rec1 f a -> Rec1 f b -> Rec1 f a Source #
(Applicative f, Applicative g) => Applicative (Day f g) |
Instance details Defined in Data.Functor.Day Methods pure :: a -> Day f g a Source # (<*>) :: Day f g (a -> b) -> Day f g a -> Day f g b Source # liftA2 :: (a -> b -> c) -> Day f g a -> Day f g b -> Day f g c Source # (*>) :: Day f g a -> Day f g b -> Day f g b Source # (<*) :: Day f g a -> Day f g b -> Day f g a Source #
Applicative (Indexed i a) |
Instance details Defined in Control.Lens.Internal.Indexed Methods pure :: a0 -> Indexed i a a0 Source # (<*>) :: Indexed i a (a0 -> b) -> Indexed i a a0 -> Indexed i a b Source # liftA2 :: (a0 -> b -> c) -> Indexed i a a0 -> Indexed i a b -> Indexed i a c Source # (*>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b Source # (<*) :: Indexed i a a0 -> Indexed i a b -> Indexed i a a0 Source #
Dim n => Applicative (V n) |
Instance details Defined in Linear.V Methods pure :: a -> V n a Source # (<*>) :: V n (a -> b) -> V n a -> V n b Source # liftA2 :: (a -> b -> c) -> V n a -> V n b -> V n c Source # (*>) :: V n a -> V n b -> V n b Source # (<*) :: V n a -> V n b -> V n a Source #
(Applicative (Rep p), Representable p) => Applicative (Prep p) |
Instance details Defined in Data.Profunctor.Rep Methods pure :: a -> Prep p a Source # (<*>) :: Prep p (a -> b) -> Prep p a -> Prep p b Source # liftA2 :: (a -> b -> c) -> Prep p a -> Prep p b -> Prep p c Source # (*>) :: Prep p a -> Prep p b -> Prep p b Source # (<*) :: Prep p a -> Prep p b -> Prep p a Source #
Applicative (Tagged s) |
Instance details Defined in Data.Tagged Methods pure :: a -> Tagged s a Source # (<*>) :: Tagged s (a -> b) -> Tagged s a -> Tagged s b Source # liftA2 :: (a -> b -> c) -> Tagged s a -> Tagged s b -> Tagged s c Source # (*>) :: Tagged s a -> Tagged s b -> Tagged s b Source # (<*) :: Tagged s a -> Tagged s b -> Tagged s a Source #
Applicative f => Applicative (Backwards f) | Apply `f`-actions in the reverse order.
Instance details Defined in Control.Applicative.Backwards Methods pure :: a -> Backwards f a Source # (<*>) :: Backwards f (a -> b) -> Backwards f a -> Backwards f b Source # liftA2 :: (a -> b -> c) -> Backwards f a -> Backwards f b -> Backwards f c Source # (*>) :: Backwards f a -> Backwards f b -> Backwards f b Source # (<*) :: Backwards f a -> Backwards f b -> Backwards f a Source #
(Monoid w, Functor m, Monad m) => Applicative (AccumT w m) |
Instance details Defined in Control.Monad.Trans.Accum Methods pure :: a -> AccumT w m a Source # (<*>) :: AccumT w m (a -> b) -> AccumT w m a -> AccumT w m b Source # liftA2 :: (a -> b -> c) -> AccumT w m a -> AccumT w m b -> AccumT w m c Source # (*>) :: AccumT w m a -> AccumT w m b -> AccumT w m b Source # (<*) :: AccumT w m a -> AccumT w m b -> AccumT w m a Source #
(Functor m, Monad m) => Applicative (ExceptT e m) |
Instance details Defined in Control.Monad.Trans.Except Methods pure :: a -> ExceptT e m a Source # (<*>) :: ExceptT e m (a -> b) -> ExceptT e m a -> ExceptT e m b Source # liftA2 :: (a -> b -> c) -> ExceptT e m a -> ExceptT e m b -> ExceptT e m c Source # (*>) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m b Source # (<*) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m a Source #
Applicative m => Applicative (IdentityT m) |
Instance details Defined in Control.Monad.Trans.Identity Methods pure :: a -> IdentityT m a Source # (<*>) :: IdentityT m (a -> b) -> IdentityT m a -> IdentityT m b Source # liftA2 :: (a -> b -> c) -> IdentityT m a -> IdentityT m b -> IdentityT m c Source # (*>) :: IdentityT m a -> IdentityT m b -> IdentityT m b Source # (<*) :: IdentityT m a -> IdentityT m b -> IdentityT m a Source #
Applicative m => Applicative (ReaderT r m) |
Instance details Defined in Control.Monad.Trans.Reader Methods pure :: a -> ReaderT r m a Source # (<*>) :: ReaderT r m (a -> b) -> ReaderT r m a -> ReaderT r m b Source # liftA2 :: (a -> b -> c) -> ReaderT r m a -> ReaderT r m b -> ReaderT r m c Source # (*>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b Source # (<*) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m a Source #
(Functor m, Monad m) => Applicative (SelectT r m) |
Instance details Defined in Control.Monad.Trans.Select Methods pure :: a -> SelectT r m a Source # (<*>) :: SelectT r m (a -> b) -> SelectT r m a -> SelectT r m b Source # liftA2 :: (a -> b -> c) -> SelectT r m a -> SelectT r m b -> SelectT r m c Source # (*>) :: SelectT r m a -> SelectT r m b -> SelectT r m b Source # (<*) :: SelectT r m a -> SelectT r m b -> SelectT r m a Source #
(Functor m, Monad m) => Applicative (StateT s m) |
Instance details Defined in Control.Monad.Trans.State.Lazy Methods pure :: a -> StateT s m a Source # (<*>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b Source # liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c Source # (*>) :: StateT s m a -> StateT s m b -> StateT s m b Source # (<*) :: StateT s m a -> StateT s m b -> StateT s m a Source #
(Functor m, Monad m) => Applicative (StateT s m) |
Instance details Defined in Control.Monad.Trans.State.Strict Methods pure :: a -> StateT s m a Source # (<*>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b Source # liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c Source # (*>) :: StateT s m a -> StateT s m b -> StateT s m b Source # (<*) :: StateT s m a -> StateT s m b -> StateT s m a Source #
(Functor m, Monad m) => Applicative (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.CPS Methods pure :: a -> WriterT w m a Source # (<*>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b Source # liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c Source # (*>) :: WriterT w m a -> WriterT w m b -> WriterT w m b Source # (<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a Source #
(Monoid w, Applicative m) => Applicative (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods pure :: a -> WriterT w m a Source # (<*>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b Source # liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c Source # (*>) :: WriterT w m a -> WriterT w m b -> WriterT w m b Source # (<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a Source #
(Monoid w, Applicative m) => Applicative (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods pure :: a -> WriterT w m a Source # (<*>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b Source # liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c Source # (*>) :: WriterT w m a -> WriterT w m b -> WriterT w m b Source # (<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a Source #
Monoid a => Applicative (Constant a :: Type -> Type) |
Instance details Defined in Data.Functor.Constant Methods pure :: a0 -> Constant a a0 Source # (<*>) :: Constant a (a0 -> b) -> Constant a a0 -> Constant a b Source # liftA2 :: (a0 -> b -> c) -> Constant a a0 -> Constant a b -> Constant a c Source # (*>) :: Constant a a0 -> Constant a b -> Constant a b Source # (<*) :: Constant a a0 -> Constant a b -> Constant a a0 Source #
Applicative f => Applicative (Reverse f) | Derived instance.
Instance details Defined in Data.Functor.Reverse Methods pure :: a -> Reverse f a Source # (<*>) :: Reverse f (a -> b) -> Reverse f a -> Reverse f b Source # liftA2 :: (a -> b -> c) -> Reverse f a -> Reverse f b -> Reverse f c Source # (*>) :: Reverse f a -> Reverse f b -> Reverse f b Source # (<*) :: Reverse f a -> Reverse f b -> Reverse f a Source #
(Monoid a, Monoid b) => Applicative ((,,) a b) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Base Methods pure :: a0 -> (a, b, a0) Source # (<*>) :: (a, b, a0 -> b0) -> (a, b, a0) -> (a, b, b0) Source # liftA2 :: (a0 -> b0 -> c) -> (a, b, a0) -> (a, b, b0) -> (a, b, c) Source # (*>) :: (a, b, a0) -> (a, b, b0) -> (a, b, b0) Source # (<*) :: (a, b, a0) -> (a, b, b0) -> (a, b, a0) Source #
(Applicative f, Applicative g) => Applicative (Product f g) | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods pure :: a -> Product f g a Source # (<*>) :: Product f g (a -> b) -> Product f g a -> Product f g b Source # liftA2 :: (a -> b -> c) -> Product f g a -> Product f g b -> Product f g c Source # (*>) :: Product f g a -> Product f g b -> Product f g b Source # (<*) :: Product f g a -> Product f g b -> Product f g a Source #
(Monad f, Applicative f) => Applicative (WhenMatched f x y) | Equivalent to `ReaderT Key (ReaderT x (ReaderT y (MaybeT f)))` Since: containers-0.5.9

Instance details

Defined in Data.IntMap.Internal

Methods

pure :: a -> WhenMatched f x y a Source #

(<*>) :: WhenMatched f x y (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b Source #

liftA2 :: (a -> b -> c) -> WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y c Source #

(*>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b Source #

(<*) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y a Source #

(Applicative f, Monad f) => Applicative (WhenMissing f k x) | Equivalent to `ReaderT k (ReaderT x (MaybeT f))` . Since: containers-0.5.9

Instance details

Defined in Data.Map.Internal

Methods

pure :: a -> WhenMissing f k x a Source #

(<*>) :: WhenMissing f k x (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b Source #

liftA2 :: (a -> b -> c) -> WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x c Source #

(*>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b Source #

(<*) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x a Source #

(Applicative f, Applicative g) => Applicative (f :*: g) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods pure :: a -> (f :*: g) a Source # (<*>) :: (f :*: g) (a -> b) -> (f :*: g) a -> (f :*: g) b Source # liftA2 :: (a -> b -> c) -> (f :*: g) a -> (f :*: g) b -> (f :*: g) c Source # (*>) :: (f :*: g) a -> (f :*: g) b -> (f :*: g) b Source # (<*) :: (f :*: g) a -> (f :*: g) b -> (f :*: g) a Source #
Monoid c => Applicative (K1 i c :: Type -> Type) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods pure :: a -> K1 i c a Source # (<*>) :: K1 i c (a -> b) -> K1 i c a -> K1 i c b Source # liftA2 :: (a -> b -> c0) -> K1 i c a -> K1 i c b -> K1 i c c0 Source # (*>) :: K1 i c a -> K1 i c b -> K1 i c b Source # (<*) :: K1 i c a -> K1 i c b -> K1 i c a Source #
Applicative (ContT r m) |
Instance details Defined in Control.Monad.Trans.Cont Methods pure :: a -> ContT r m a Source # (<*>) :: ContT r m (a -> b) -> ContT r m a -> ContT r m b Source # liftA2 :: (a -> b -> c) -> ContT r m a -> ContT r m b -> ContT r m c Source # (*>) :: ContT r m a -> ContT r m b -> ContT r m b Source # (<*) :: ContT r m a -> ContT r m b -> ContT r m a Source #
(Monoid a, Monoid b, Monoid c) => Applicative ((,,,) a b c) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Base Methods pure :: a0 -> (a, b, c, a0) Source # (<*>) :: (a, b, c, a0 -> b0) -> (a, b, c, a0) -> (a, b, c, b0) Source # liftA2 :: (a0 -> b0 -> c0) -> (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, c0) Source # (*>) :: (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, b0) Source # (<*) :: (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, a0) Source #
Applicative ((->) r) | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods pure :: a -> r -> a Source # (<*>) :: (r -> (a -> b)) -> (r -> a) -> r -> b Source # liftA2 :: (a -> b -> c) -> (r -> a) -> (r -> b) -> r -> c Source # (*>) :: (r -> a) -> (r -> b) -> r -> b Source # (<*) :: (r -> a) -> (r -> b) -> r -> a Source #
(Applicative f, Applicative g) => Applicative (Compose f g) | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods pure :: a -> Compose f g a Source # (<*>) :: Compose f g (a -> b) -> Compose f g a -> Compose f g b Source # liftA2 :: (a -> b -> c) -> Compose f g a -> Compose f g b -> Compose f g c Source # (*>) :: Compose f g a -> Compose f g b -> Compose f g b Source # (<*) :: Compose f g a -> Compose f g b -> Compose f g a Source #
(Monad f, Applicative f) => Applicative (WhenMatched f k x y) | Equivalent to `ReaderT k (ReaderT x (ReaderT y (MaybeT f)))` Since: containers-0.5.9

Instance details

Defined in Data.Map.Internal

Methods

pure :: a -> WhenMatched f k x y a Source #

(<*>) :: WhenMatched f k x y (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b Source #

liftA2 :: (a -> b -> c) -> WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y c Source #

(*>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b Source #

(<*) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y a Source #

(Applicative f, Applicative g) => Applicative (f :.: g) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods pure :: a -> (f :.: g) a Source # (<*>) :: (f :.: g) (a -> b) -> (f :.: g) a -> (f :.: g) b Source # liftA2 :: (a -> b -> c) -> (f :.: g) a -> (f :.: g) b -> (f :.: g) c Source # (*>) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) b Source # (<*) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) a Source #
Applicative f => Applicative (M1 i c f) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods pure :: a -> M1 i c f a Source # (<*>) :: M1 i c f (a -> b) -> M1 i c f a -> M1 i c f b Source # liftA2 :: (a -> b -> c0) -> M1 i c f a -> M1 i c f b -> M1 i c f c0 Source # (*>) :: M1 i c f a -> M1 i c f b -> M1 i c f b Source # (<*) :: M1 i c f a -> M1 i c f b -> M1 i c f a Source #
Reifies s (ReifiedApplicative f) => Applicative (ReflectedApplicative f s) |

Instance details

Defined in Data.Reflection

Methods

pure :: a -> ReflectedApplicative f s a Source #

(<*>) :: ReflectedApplicative f s (a -> b) -> ReflectedApplicative f s a -> ReflectedApplicative f s b Source #

liftA2 :: (a -> b -> c) -> ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s c Source #

(*>) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s b Source #

(<*) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s a Source #

(Functor m, Monad m) => Applicative (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.CPS Methods pure :: a -> RWST r w s m a Source # (<*>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b Source # liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c Source # (*>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b Source # (<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a Source #
(Monoid w, Functor m, Monad m) => Applicative (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.Lazy Methods pure :: a -> RWST r w s m a Source # (<*>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b Source # liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c Source # (*>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b Source # (<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a Source #
(Monoid w, Functor m, Monad m) => Applicative (RWST r w s m) |

Instance details

Defined in Control.Monad.Trans.RWS.Strict

Methods

pure :: a -> RWST r w s m a Source #

(<*>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b Source #

liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c Source #

(*>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b Source #

(<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a Source #

class Semigroup a => Monoid a where Source #

The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following:

Right identity
  `x `<>` `mempty` = x`
Left identity
  ``mempty` `<>` x = x`
Associativity
  `x `<>` (y `<>` z) = (x `<>` y) `<>` z` (`Semigroup` law)
Concatenation
  ``mconcat` = `foldr` (`<>`) `mempty``

You can alternatively define `mconcat` instead of `mempty`, in which case the laws are:

Unit
  ``mconcat` (`pure` x) = x`
Multiplication
  ``mconcat` (`join` xss) = `mconcat` (`fmap` `mconcat` xss)`
Subclass
  ``mconcat` (`toList` xs) = `sconcat` xs`

The method names refer to the monoid of lists under concatenation, but there are many other instances.

Some types can be viewed as a monoid in more than one way, e.g. both addition and multiplication on numbers. In such cases we often define `newtype`s and make those instances of `Monoid`, e.g. `Sum` and `Product`.

NOTE: `Semigroup` is a superclass of `Monoid` since base-4.11.0.0.

Minimal complete definition

mempty | mconcat

Methods

mempty :: a Source #

Identity of `mappend`

#### Examples

Expand

    >>> "Hello world" <> mempty
    "Hello world"

    >>> mempty <> [1, 2, 3]
    [1,2,3]

mappend :: a -> a -> a Source #

An associative operation

NOTE: This method is redundant and has the default implementation ``mappend` = (`<>`)` since base-4.11.0.0. Should it be implemented manually, since `mappend` is a synonym for (`<>`), it is expected that the two functions are defined the same way. In a future GHC release `mappend` will be removed from `Monoid`.

mconcat :: [a] -> a Source #

Fold a list using the monoid.

For most types, the default definition for `mconcat` will be used, but the function is included in the class definition so that an optimized version can be provided for specific types.

    >>> mconcat ["Hello", " ", "Haskell", "!"]
    "Hello Haskell!"

#### Instances

Instances details

Monoid KeyMacro Source # |
Instance details Defined in Game.LambdaHack.Client.UI.SessionUI Methods mempty :: KeyMacro Source # mappend :: KeyMacro -> KeyMacro -> KeyMacro Source # mconcat :: [KeyMacro] -> KeyMacro Source #
Monoid ByteArray | Since: base-4.17.0.0
Instance details Defined in Data.Array.Byte Methods mempty :: ByteArray Source # mappend :: ByteArray -> ByteArray -> ByteArray Source # mconcat :: [ByteArray] -> ByteArray Source #
Monoid Builder |
Instance details Defined in Data.ByteString.Builder.Internal Methods mempty :: Builder Source # mappend :: Builder -> Builder -> Builder Source # mconcat :: [Builder] -> Builder Source #
Monoid ByteString |
Instance details Defined in Data.ByteString.Internal.Type Methods mempty :: ByteString Source # mappend :: ByteString -> ByteString -> ByteString Source # mconcat :: [ByteString] -> ByteString Source #
Monoid ByteString |
Instance details Defined in Data.ByteString.Lazy.Internal Methods mempty :: ByteString Source # mappend :: ByteString -> ByteString -> ByteString Source # mconcat :: [ByteString] -> ByteString Source #
Monoid ShortByteString |
Instance details Defined in Data.ByteString.Short.Internal Methods mempty :: ShortByteString Source # mappend :: ShortByteString -> ShortByteString -> ShortByteString Source # mconcat :: [ShortByteString] -> ShortByteString Source #
Monoid IntSet |
Instance details Defined in Data.IntSet.Internal Methods mempty :: IntSet Source # mappend :: IntSet -> IntSet -> IntSet Source # mconcat :: [IntSet] -> IntSet Source #
Monoid All | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods mempty :: All Source # mappend :: All -> All -> All Source # mconcat :: [All] -> All Source #
Monoid Any | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods mempty :: Any Source # mappend :: Any -> Any -> Any Source # mconcat :: [Any] -> Any Source #
Monoid ExceptionContext |
Instance details Defined in GHC.Internal.Exception.Context Methods mempty :: ExceptionContext Source # mappend :: ExceptionContext -> ExceptionContext -> ExceptionContext Source # mconcat :: [ExceptionContext] -> ExceptionContext Source #
Monoid Ordering | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods mempty :: Ordering Source # mappend :: Ordering -> Ordering -> Ordering Source # mconcat :: [Ordering] -> Ordering Source #
Monoid Part |
Instance details Defined in NLP.Miniutter.English Methods mempty :: Part Source # mappend :: Part -> Part -> Part Source # mconcat :: [Part] -> Part Source #
Monoid PrefsMod |
Instance details Defined in Options.Applicative.Builder Methods mempty :: PrefsMod Source # mappend :: PrefsMod -> PrefsMod -> PrefsMod Source # mconcat :: [PrefsMod] -> PrefsMod Source #
Monoid ParserHelp |
Instance details Defined in Options.Applicative.Help.Types Methods mempty :: ParserHelp Source # mappend :: ParserHelp -> ParserHelp -> ParserHelp Source # mconcat :: [ParserHelp] -> ParserHelp Source #
Monoid Completer |
Instance details Defined in Options.Applicative.Types Methods mempty :: Completer Source # mappend :: Completer -> Completer -> Completer Source # mconcat :: [Completer] -> Completer Source #
Monoid ParseError |
Instance details Defined in Options.Applicative.Types Methods mempty :: ParseError Source # mappend :: ParseError -> ParseError -> ParseError Source # mconcat :: [ParseError] -> ParseError Source #
Monoid OsString | "String-Concatenation" for `OsString`. This is not the same as `(</>)`.
Instance details Defined in System.OsString.Internal.Types Methods mempty :: OsString Source # mappend :: OsString -> OsString -> OsString Source # mconcat :: [OsString] -> OsString Source #
Monoid PosixString |
Instance details Defined in System.OsString.Internal.Types Methods mempty :: PosixString Source # mappend :: PosixString -> PosixString -> PosixString Source # mconcat :: [PosixString] -> PosixString Source #
Monoid WindowsString |
Instance details Defined in System.OsString.Internal.Types Methods mempty :: WindowsString Source # mappend :: WindowsString -> WindowsString -> WindowsString Source # mconcat :: [WindowsString] -> WindowsString Source #
Monoid Doc |
Instance details Defined in Text.PrettyPrint.HughesPJ Methods mempty :: Doc Source # mappend :: Doc -> Doc -> Doc Source # mconcat :: [Doc] -> Doc Source #
Monoid Text |
Instance details Defined in Data.Text Methods mempty :: Text Source # mappend :: Text -> Text -> Text Source # mconcat :: [Text] -> Text Source #
Monoid Builder |
Instance details Defined in Data.Text.Internal.Builder Methods mempty :: Builder Source # mappend :: Builder -> Builder -> Builder Source # mconcat :: [Builder] -> Builder Source #
Monoid Text |
Instance details Defined in Data.Text.Lazy Methods mempty :: Text Source # mappend :: Text -> Text -> Text Source # mconcat :: [Text] -> Text Source #
Monoid StrictTextBuilder |
Instance details Defined in Data.Text.Internal.StrictBuilder Methods mempty :: StrictTextBuilder Source # mappend :: StrictTextBuilder -> StrictTextBuilder -> StrictTextBuilder Source # mconcat :: [StrictTextBuilder] -> StrictTextBuilder Source #
Monoid ShortText |
Instance details Defined in Data.Text.Short.Internal Methods mempty :: ShortText Source # mappend :: ShortText -> ShortText -> ShortText Source # mconcat :: [ShortText] -> ShortText Source #
Monoid CalendarDiffDays | Additive
Instance details Defined in Data.Time.Calendar.CalendarDiffDays Methods mempty :: CalendarDiffDays Source # mappend :: CalendarDiffDays -> CalendarDiffDays -> CalendarDiffDays Source # mconcat :: [CalendarDiffDays] -> CalendarDiffDays Source #
Monoid CalendarDiffTime | Additive
Instance details Defined in Data.Time.LocalTime.Internal.CalendarDiffTime Methods mempty :: CalendarDiffTime Source # mappend :: CalendarDiffTime -> CalendarDiffTime -> CalendarDiffTime Source # mconcat :: [CalendarDiffTime] -> CalendarDiffTime Source #
Monoid () | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods mempty :: () Source # mappend :: () -> () -> () Source # mconcat :: [()] -> () Source #
Monoid (KeyMap v) |
Instance details Defined in Data.Aeson.KeyMap Methods mempty :: KeyMap v Source # mappend :: KeyMap v -> KeyMap v -> KeyMap v Source # mconcat :: [KeyMap v] -> KeyMap v Source #
Monoid (IResult a) |
Instance details Defined in Data.Aeson.Types.Internal Methods mempty :: IResult a Source # mappend :: IResult a -> IResult a -> IResult a Source # mconcat :: [IResult a] -> IResult a Source #
Monoid (Parser a) |
Instance details Defined in Data.Aeson.Types.Internal Methods mempty :: Parser a Source # mappend :: Parser a -> Parser a -> Parser a Source # mconcat :: [Parser a] -> Parser a Source #
Monoid (Result a) |
Instance details Defined in Data.Aeson.Types.Internal Methods mempty :: Result a Source # mappend :: Result a -> Result a -> Result a Source # mconcat :: [Result a] -> Result a Source #
(Semigroup a, Monoid a) => Monoid (Concurrently a) | Since: async-2.1.0
Instance details Defined in Control.Concurrent.Async.Internal Methods mempty :: Concurrently a Source # mappend :: Concurrently a -> Concurrently a -> Concurrently a Source # mconcat :: [Concurrently a] -> Concurrently a Source #

Monoid (Comparison a)

``mempty`` on comparisons always returns `EQ`. Without newtypes this equals ``pure` (`pure` EQ)`.

    mempty :: Comparison a
    mempty = Comparison _ _ -> EQ

Instance details Defined in Data.Functor.Contravariant Methods mempty :: Comparison a Source # mappend :: Comparison a -> Comparison a -> Comparison a Source # mconcat :: [Comparison a] -> Comparison a Source #

Monoid (Equivalence a)

``mempty`` on equivalences always returns `True`. Without newtypes this equals ``pure` (`pure` True)`.

    mempty :: Equivalence a
    mempty = Equivalence _ _ -> True

Instance details Defined in Data.Functor.Contravariant Methods mempty :: Equivalence a Source # mappend :: Equivalence a -> Equivalence a -> Equivalence a Source # mconcat :: [Equivalence a] -> Equivalence a Source #

Monoid (Predicate a)

``mempty`` on predicates always returns `True`. Without newtypes this equals ``pure` True`.

    mempty :: Predicate a
    mempty = _ -> True

Instance details Defined in Data.Functor.Contravariant Methods mempty :: Predicate a Source # mappend :: Predicate a -> Predicate a -> Predicate a Source # mconcat :: [Predicate a] -> Predicate a Source #
(Ord a, Bounded a) => Monoid (Max a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mempty :: Max a Source # mappend :: Max a -> Max a -> Max a Source # mconcat :: [Max a] -> Max a Source #
(Ord a, Bounded a) => Monoid (Min a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mempty :: Min a Source # mappend :: Min a -> Min a -> Min a Source # mconcat :: [Min a] -> Min a Source #
Monoid m => Monoid (WrappedMonoid m) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mempty :: WrappedMonoid m Source # mappend :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m Source # mconcat :: [WrappedMonoid m] -> WrappedMonoid m Source #
Monoid (PutM ()) |
Instance details Defined in Data.Binary.Put Methods mempty :: PutM () Source # mappend :: PutM () -> PutM () -> PutM () Source # mconcat :: [PutM ()] -> PutM () Source #
Num a => Monoid (AlphaColour a) |
Instance details Defined in Data.Colour.Internal Methods mempty :: AlphaColour a Source # mappend :: AlphaColour a -> AlphaColour a -> AlphaColour a Source # mconcat :: [AlphaColour a] -> AlphaColour a Source #
Num a => Monoid (Colour a) |
Instance details Defined in Data.Colour.Internal Methods mempty :: Colour a Source # mappend :: Colour a -> Colour a -> Colour a Source # mconcat :: [Colour a] -> Colour a Source #
Monoid (IntMap a) |
Instance details Defined in Data.IntMap.Internal Methods mempty :: IntMap a Source # mappend :: IntMap a -> IntMap a -> IntMap a Source # mconcat :: [IntMap a] -> IntMap a Source #
Monoid (Seq a) |
Instance details Defined in Data.Sequence.Internal Methods mempty :: Seq a Source # mappend :: Seq a -> Seq a -> Seq a Source # mconcat :: [Seq a] -> Seq a Source #
Monoid (MergeSet a) |
Instance details Defined in Data.Set.Internal Methods mempty :: MergeSet a Source # mappend :: MergeSet a -> MergeSet a -> MergeSet a Source # mconcat :: [MergeSet a] -> MergeSet a Source #
Ord a => Monoid (Set a) |
Instance details Defined in Data.Set.Internal Methods mempty :: Set a Source # mappend :: Set a -> Set a -> Set a Source # mconcat :: [Set a] -> Set a Source #
Monoid (DList a) |
Instance details Defined in Data.DList.Internal Methods mempty :: DList a Source # mappend :: DList a -> DList a -> DList a Source # mconcat :: [DList a] -> DList a Source #
Monoid (EnumSet k) |
Instance details Defined in Data.EnumSet Methods mempty :: EnumSet k Source # mappend :: EnumSet k -> EnumSet k -> EnumSet k Source # mconcat :: [EnumSet k] -> EnumSet k Source #
Monoid a => Monoid (STM a) | Since: base-4.17.0.0
Instance details Defined in GHC.Internal.Conc.Sync Methods mempty :: STM a Source # mappend :: STM a -> STM a -> STM a Source # mconcat :: [STM a] -> STM a Source #
Monoid a => Monoid (Identity a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Functor.Identity Methods mempty :: Identity a Source # mappend :: Identity a -> Identity a -> Identity a Source # mconcat :: [Identity a] -> Identity a Source #
Ord a => Monoid (Max a) | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods mempty :: Max a Source # mappend :: Max a -> Max a -> Max a Source # mconcat :: [Max a] -> Max a Source #
Ord a => Monoid (Min a) | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods mempty :: Min a Source # mappend :: Min a -> Min a -> Min a Source # mconcat :: [Min a] -> Min a Source #
Monoid (First a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Monoid Methods mempty :: First a Source # mappend :: First a -> First a -> First a Source # mconcat :: [First a] -> First a Source #
Monoid (Last a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Monoid Methods mempty :: Last a Source # mappend :: Last a -> Last a -> Last a Source # mconcat :: [Last a] -> Last a Source #
Monoid a => Monoid (Down a) | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Data.Ord Methods mempty :: Down a Source # mappend :: Down a -> Down a -> Down a Source # mconcat :: [Down a] -> Down a Source #
Monoid a => Monoid (Dual a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods mempty :: Dual a Source # mappend :: Dual a -> Dual a -> Dual a Source # mconcat :: [Dual a] -> Dual a Source #
Monoid (Endo a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods mempty :: Endo a Source # mappend :: Endo a -> Endo a -> Endo a Source # mconcat :: [Endo a] -> Endo a Source #
Num a => Monoid (Product a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods mempty :: Product a Source # mappend :: Product a -> Product a -> Product a Source # mconcat :: [Product a] -> Product a Source #
Num a => Monoid (Sum a) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods mempty :: Sum a Source # mappend :: Sum a -> Sum a -> Sum a Source # mconcat :: [Sum a] -> Sum a Source #
(Generic a, Monoid (Rep a ())) => Monoid (Generically a) | Since: base-4.17.0.0
Instance details Defined in GHC.Internal.Generics Methods mempty :: Generically a Source # mappend :: Generically a -> Generically a -> Generically a Source # mconcat :: [Generically a] -> Generically a Source #
Monoid p => Monoid (Par1 p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods mempty :: Par1 p Source # mappend :: Par1 p -> Par1 p -> Par1 p Source # mconcat :: [Par1 p] -> Par1 p Source #
Monoid a => Monoid (IO a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods mempty :: IO a Source # mappend :: IO a -> IO a -> IO a Source # mconcat :: [IO a] -> IO a Source #
Monoid a => Monoid (Plucker a) |
Instance details Defined in Linear.Plucker Methods mempty :: Plucker a Source # mappend :: Plucker a -> Plucker a -> Plucker a Source # mconcat :: [Plucker a] -> Plucker a Source #
Monoid a => Monoid (Quaternion a) |
Instance details Defined in Linear.Quaternion Methods mempty :: Quaternion a Source # mappend :: Quaternion a -> Quaternion a -> Quaternion a Source # mconcat :: [Quaternion a] -> Quaternion a Source #
Monoid (V0 a) |
Instance details Defined in Linear.V0 Methods mempty :: V0 a Source # mappend :: V0 a -> V0 a -> V0 a Source # mconcat :: [V0 a] -> V0 a Source #
Monoid a => Monoid (V1 a) |
Instance details Defined in Linear.V1 Methods mempty :: V1 a Source # mappend :: V1 a -> V1 a -> V1 a Source # mconcat :: [V1 a] -> V1 a Source #
Monoid a => Monoid (V2 a) |
Instance details Defined in Linear.V2 Methods mempty :: V2 a Source # mappend :: V2 a -> V2 a -> V2 a Source # mconcat :: [V2 a] -> V2 a Source #
Monoid a => Monoid (V3 a) |
Instance details Defined in Linear.V3 Methods mempty :: V3 a Source # mappend :: V3 a -> V3 a -> V3 a Source # mconcat :: [V3 a] -> V3 a Source #
Monoid a => Monoid (V4 a) |
Instance details Defined in Linear.V4 Methods mempty :: V4 a Source # mappend :: V4 a -> V4 a -> V4 a Source # mconcat :: [V4 a] -> V4 a Source #
Monoid (InfoMod a) |
Instance details Defined in Options.Applicative.Builder Methods mempty :: InfoMod a Source # mappend :: InfoMod a -> InfoMod a -> InfoMod a Source # mconcat :: [InfoMod a] -> InfoMod a Source #
Monoid (DefaultProp a) |
Instance details Defined in Options.Applicative.Builder.Internal Methods mempty :: DefaultProp a Source # mappend :: DefaultProp a -> DefaultProp a -> DefaultProp a Source # mconcat :: [DefaultProp a] -> DefaultProp a Source #
Semigroup a => Monoid (Chunk a) |
Instance details Defined in Options.Applicative.Help.Chunk Methods mempty :: Chunk a Source # mappend :: Chunk a -> Chunk a -> Chunk a Source # mconcat :: [Chunk a] -> Chunk a Source #
Monoid (Doc a) |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods mempty :: Doc a Source # mappend :: Doc a -> Doc a -> Doc a Source # mconcat :: [Doc a] -> Doc a Source #
Monoid (Doc ann) |
Instance details Defined in Prettyprinter.Internal Methods mempty :: Doc ann Source # mappend :: Doc ann -> Doc ann -> Doc ann Source # mconcat :: [Doc ann] -> Doc ann Source #
Monoid (Array a) |
Instance details Defined in Data.Primitive.Array Methods mempty :: Array a Source # mappend :: Array a -> Array a -> Array a Source # mconcat :: [Array a] -> Array a Source #
Monoid (PrimArray a) | Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.PrimArray Methods mempty :: PrimArray a Source # mappend :: PrimArray a -> PrimArray a -> PrimArray a Source # mconcat :: [PrimArray a] -> PrimArray a Source #
Monoid (SmallArray a) |
Instance details Defined in Data.Primitive.SmallArray Methods mempty :: SmallArray a Source # mappend :: SmallArray a -> SmallArray a -> SmallArray a Source # mconcat :: [SmallArray a] -> SmallArray a Source #
Semigroup a => Monoid (Maybe a) |
Instance details Defined in Data.Strict.Maybe Methods mempty :: Maybe a Source # mappend :: Maybe a -> Maybe a -> Maybe a Source # mconcat :: [Maybe a] -> Maybe a Source #
Monoid a => Monoid (Q a) | Since: template-haskell-2.17.0.0
Instance details Defined in Language.Haskell.TH.Syntax Methods mempty :: Q a Source # mappend :: Q a -> Q a -> Q a Source # mconcat :: [Q a] -> Q a Source #
Monoid (Validity k) |
Instance details Defined in Data.HashMap.Internal.Debug Methods mempty :: Validity k Source # mappend :: Validity k -> Validity k -> Validity k Source # mconcat :: [Validity k] -> Validity k Source #

(Hashable a, Eq a) => Monoid (HashSet a)

`mempty` = `empty`

`mappend` = `union`

\(O(n+m)\)

To obtain good performance, the smaller set must be presented as the first argument.

#### Examples

Expand

    >>> mappend (fromList [1,2]) (fromList [2,3])
    fromList [1,2,3]

Instance details Defined in Data.HashSet.Internal Methods mempty :: HashSet a Source # mappend :: HashSet a -> HashSet a -> HashSet a Source # mconcat :: [HashSet a] -> HashSet a Source #
Monoid (Vector a) |
Instance details Defined in Data.Vector Methods mempty :: Vector a Source # mappend :: Vector a -> Vector a -> Vector a Source # mconcat :: [Vector a] -> Vector a Source #
Prim a => Monoid (Vector a) |
Instance details Defined in Data.Vector.Primitive Methods mempty :: Vector a Source # mappend :: Vector a -> Vector a -> Vector a Source # mconcat :: [Vector a] -> Vector a Source #
Storable a => Monoid (Vector a) |
Instance details Defined in Data.Vector.Storable Methods mempty :: Vector a Source # mappend :: Vector a -> Vector a -> Vector a Source # mconcat :: [Vector a] -> Vector a Source #
Monoid (Vector a) |
Instance details Defined in Data.Vector.Strict Methods mempty :: Vector a Source # mappend :: Vector a -> Vector a -> Vector a Source # mconcat :: [Vector a] -> Vector a Source #
Unbox a => Monoid (Vector a) |
Instance details Defined in Data.Vector.Unboxed Methods mempty :: Vector a Source # mappend :: Vector a -> Vector a -> Vector a Source # mconcat :: [Vector a] -> Vector a Source #
Semigroup a => Monoid (Maybe a) | Lift a semigroup into `Maybe` forming a `Monoid` according to http://en.wikipedia.org/wiki/Monoid: "Any semigroup `S` may be turned into a monoid simply by adjoining an element `e` not in `S` and defining `e*e = e` and `e*s = s = s*e` for all `s ∈ S`." Since 4.11.0: constraint on inner `a` value generalised from `Monoid` to `Semigroup`. Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods mempty :: Maybe a Source # mappend :: Maybe a -> Maybe a -> Maybe a Source # mconcat :: [Maybe a] -> Maybe a Source #
Monoid a => Monoid (Solo a) | Since: base-4.15
Instance details Defined in GHC.Internal.Base Methods mempty :: Solo a Source # mappend :: Solo a -> Solo a -> Solo a Source # mconcat :: [Solo a] -> Solo a Source #
Monoid [a] | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods mempty :: [a] Source # mappend :: [a] -> [a] -> [a] Source # mconcat :: [[a]] -> [a] Source #
(Semigroup a, Monoid a) => Monoid (ConcurrentlyE e a) |
Instance details Defined in Control.Concurrent.Async.Internal Methods mempty :: ConcurrentlyE e a Source # mappend :: ConcurrentlyE e a -> ConcurrentlyE e a -> ConcurrentlyE e a Source # mconcat :: [ConcurrentlyE e a] -> ConcurrentlyE e a Source #

Monoid a => Monoid (Op a b)

``mempty` @(Op a b)` without newtypes is `mempty @(b->a)` = `_ -> mempty`.

    mempty :: Op a b
    mempty = Op _ -> mempty

Instance details Defined in Data.Functor.Contravariant Methods mempty :: Op a b Source # mappend :: Op a b -> Op a b -> Op a b Source # mconcat :: [Op a b] -> Op a b Source #
Ord k => Monoid (Map k v) |
Instance details Defined in Data.Map.Internal Methods mempty :: Map k v Source # mappend :: Map k v -> Map k v -> Map k v Source # mconcat :: [Map k v] -> Map k v Source #
Monoid (EnumMap k a) |
Instance details Defined in Data.EnumMap.Base Methods mempty :: EnumMap k a Source # mappend :: EnumMap k a -> EnumMap k a -> EnumMap k a Source # mconcat :: [EnumMap k a] -> EnumMap k a Source #
Monoid (U1 p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods mempty :: U1 p Source # mappend :: U1 p -> U1 p -> U1 p Source # mconcat :: [U1 p] -> U1 p Source #
Monoid a => Monoid (ST s a) | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.ST Methods mempty :: ST s a Source # mappend :: ST s a -> ST s a -> ST s a Source # mconcat :: [ST s a] -> ST s a Source #
Monoid (f a) => Monoid (Indexing f a) |
Instance details Defined in Control.Lens.Internal.Indexed Methods mempty :: Indexing f a Source # mappend :: Indexing f a -> Indexing f a -> Indexing f a Source # mconcat :: [Indexing f a] -> Indexing f a Source #
Monoid (ReifiedFold s a) |
Instance details Defined in Control.Lens.Reified Methods mempty :: ReifiedFold s a Source # mappend :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a Source # mconcat :: [ReifiedFold s a] -> ReifiedFold s a Source #
Monoid (f a) => Monoid (Point f a) |
Instance details Defined in Linear.Affine Methods mempty :: Point f a Source # mappend :: Point f a -> Point f a -> Point f a Source # mconcat :: [Point f a] -> Point f a Source #
Monoid (Mod f a) |
Instance details Defined in Options.Applicative.Builder.Internal Methods mempty :: Mod f a Source # mappend :: Mod f a -> Mod f a -> Mod f a Source # mconcat :: [Mod f a] -> Mod f a Source #
(Monoid a, Monoid b) => Monoid (Pair a b) |
Instance details Defined in Data.Strict.Tuple Methods mempty :: Pair a b Source # mappend :: Pair a b -> Pair a b -> Pair a b Source # mconcat :: [Pair a b] -> Pair a b Source #

(Eq k, Hashable k) => Monoid (HashMap k v)

`mempty` = `empty`

`mappend` = `union`

If a key occurs in both maps, the mapping from the first will be the mapping in the result.

#### Examples

Expand

    >>> mappend (fromList [(1,'a'),(2,'b')]) (fromList [(2,'c'),(3,'d')])
    fromList [(1,'a'),(2,'b'),(3,'d')]

Instance details Defined in Data.HashMap.Internal Methods mempty :: HashMap k v Source # mappend :: HashMap k v -> HashMap k v -> HashMap k v Source # mconcat :: [HashMap k v] -> HashMap k v Source #
(Monoid a, Monoid b) => Monoid (a, b) | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods mempty :: (a, b) Source # mappend :: (a, b) -> (a, b) -> (a, b) Source # mconcat :: [(a, b)] -> (a, b) Source #
Monoid b => Monoid (a -> b) | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods mempty :: a -> b Source # mappend :: (a -> b) -> (a -> b) -> a -> b Source # mconcat :: [a -> b] -> a -> b Source #
Monoid a => Monoid (Const a b) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Functor.Const Methods mempty :: Const a b Source # mappend :: Const a b -> Const a b -> Const a b Source # mconcat :: [Const a b] -> Const a b Source #
(Applicative f, Monoid a) => Monoid (Ap f a) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods mempty :: Ap f a Source # mappend :: Ap f a -> Ap f a -> Ap f a Source # mconcat :: [Ap f a] -> Ap f a Source #
Alternative f => Monoid (Alt f a) | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods mempty :: Alt f a Source # mappend :: Alt f a -> Alt f a -> Alt f a Source # mconcat :: [Alt f a] -> Alt f a Source #
Monoid (f p) => Monoid (Rec1 f p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods mempty :: Rec1 f p Source # mappend :: Rec1 f p -> Rec1 f p -> Rec1 f p Source # mconcat :: [Rec1 f p] -> Rec1 f p Source #
Monoid (ReifiedIndexedFold i s a) |
Instance details Defined in Control.Lens.Reified Methods mempty :: ReifiedIndexedFold i s a Source # mappend :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a Source # mconcat :: [ReifiedIndexedFold i s a] -> ReifiedIndexedFold i s a Source #
(Dim n, Monoid a) => Monoid (V n a) |
Instance details Defined in Linear.V Methods mempty :: V n a Source # mappend :: V n a -> V n a -> V n a Source # mconcat :: [V n a] -> V n a Source #
Reifies s (ReifiedMonoid a) => Monoid (ReflectedMonoid a s) |
Instance details Defined in Data.Reflection Methods mempty :: ReflectedMonoid a s Source # mappend :: ReflectedMonoid a s -> ReflectedMonoid a s -> ReflectedMonoid a s Source # mconcat :: [ReflectedMonoid a s] -> ReflectedMonoid a s Source #
(Semigroup a, Monoid a) => Monoid (Tagged s a) |
Instance details Defined in Data.Tagged Methods mempty :: Tagged s a Source # mappend :: Tagged s a -> Tagged s a -> Tagged s a Source # mconcat :: [Tagged s a] -> Tagged s a Source #
Monoid a => Monoid (Constant a b) |
Instance details Defined in Data.Functor.Constant Methods mempty :: Constant a b Source # mappend :: Constant a b -> Constant a b -> Constant a b Source # mconcat :: [Constant a b] -> Constant a b Source #
(Monoid a, Monoid b, Monoid c) => Monoid (a, b, c) | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods mempty :: (a, b, c) Source # mappend :: (a, b, c) -> (a, b, c) -> (a, b, c) Source # mconcat :: [(a, b, c)] -> (a, b, c) Source #
(Monoid (f a), Monoid (g a)) => Monoid (Product f g a) | Since: base-4.16.0.0
Instance details Defined in Data.Functor.Product Methods mempty :: Product f g a Source # mappend :: Product f g a -> Product f g a -> Product f g a Source # mconcat :: [Product f g a] -> Product f g a Source #
(Monoid (f p), Monoid (g p)) => Monoid ((f :*: g) p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods mempty :: (f :*: g) p Source # mappend :: (f :*: g) p -> (f :*: g) p -> (f :*: g) p Source # mconcat :: [(f :*: g) p] -> (f :*: g) p Source #
Monoid c => Monoid (K1 i c p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods mempty :: K1 i c p Source # mappend :: K1 i c p -> K1 i c p -> K1 i c p Source # mconcat :: [K1 i c p] -> K1 i c p Source #
(Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d) | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods mempty :: (a, b, c, d) Source # mappend :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) Source # mconcat :: [(a, b, c, d)] -> (a, b, c, d) Source #
Monoid (f (g a)) => Monoid (Compose f g a) | Since: base-4.16.0.0
Instance details Defined in Data.Functor.Compose Methods mempty :: Compose f g a Source # mappend :: Compose f g a -> Compose f g a -> Compose f g a Source # mconcat :: [Compose f g a] -> Compose f g a Source #
Monoid (f (g p)) => Monoid ((f :.: g) p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods mempty :: (f :.: g) p Source # mappend :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p Source # mconcat :: [(f :.: g) p] -> (f :.: g) p Source #
Monoid (f p) => Monoid (M1 i c f p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods mempty :: M1 i c f p Source # mappend :: M1 i c f p -> M1 i c f p -> M1 i c f p Source # mconcat :: [M1 i c f p] -> M1 i c f p Source #
(Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) => Monoid (a, b, c, d, e) | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods mempty :: (a, b, c, d, e) Source # mappend :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) Source # mconcat :: [(a, b, c, d, e)] -> (a, b, c, d, e) Source #

class Semigroup a where Source #

The class of semigroups (types with an associative binary operation).

Instances should satisfy the following:

Associativity
  `x `<>` (y `<>` z) = (x `<>` y) `<>` z`

You can alternatively define `sconcat` instead of (`<>`), in which case the laws are:

Unit
  ``sconcat` (`pure` x) = x`
Multiplication
  ``sconcat` (`join` xss) = `sconcat` (`fmap` `sconcat` xss)`

Since: base-4.9.0.0

Minimal complete definition

(<>) | sconcat

Methods

(<>) :: a -> a -> a infixr 6 Source #

An associative operation.

#### Examples

Expand

    >>> [1,2,3] <> [4,5,6]
    [1,2,3,4,5,6]

    >>> Just [1, 2, 3] <> Just [4, 5, 6]
    Just [1,2,3,4,5,6]

    >>> putStr "Hello, " <> putStrLn "World!"
    Hello, World!

#### Instances

Instances details

Semigroup KeyMacro Source # |
Instance details Defined in Game.LambdaHack.Client.UI.SessionUI Methods (<>) :: KeyMacro -> KeyMacro -> KeyMacro Source # sconcat :: NonEmpty KeyMacro -> KeyMacro Source # stimes :: Integral b => b -> KeyMacro -> KeyMacro Source #
Semigroup ByteArray | Since: base-4.17.0.0
Instance details Defined in Data.Array.Byte Methods (<>) :: ByteArray -> ByteArray -> ByteArray Source # sconcat :: NonEmpty ByteArray -> ByteArray Source # stimes :: Integral b => b -> ByteArray -> ByteArray Source #
Semigroup Builder |
Instance details Defined in Data.ByteString.Builder.Internal Methods (<>) :: Builder -> Builder -> Builder Source # sconcat :: NonEmpty Builder -> Builder Source # stimes :: Integral b => b -> Builder -> Builder Source #
Semigroup ByteString |
Instance details Defined in Data.ByteString.Internal.Type Methods (<>) :: ByteString -> ByteString -> ByteString Source # sconcat :: NonEmpty ByteString -> ByteString Source # stimes :: Integral b => b -> ByteString -> ByteString Source #
Semigroup ByteString |
Instance details Defined in Data.ByteString.Lazy.Internal Methods (<>) :: ByteString -> ByteString -> ByteString Source # sconcat :: NonEmpty ByteString -> ByteString Source # stimes :: Integral b => b -> ByteString -> ByteString Source #
Semigroup ShortByteString |
Instance details Defined in Data.ByteString.Short.Internal Methods (<>) :: ShortByteString -> ShortByteString -> ShortByteString Source # sconcat :: NonEmpty ShortByteString -> ShortByteString Source # stimes :: Integral b => b -> ShortByteString -> ShortByteString Source #
Semigroup IntSet | Since: containers-0.5.7
Instance details Defined in Data.IntSet.Internal Methods (<>) :: IntSet -> IntSet -> IntSet Source # sconcat :: NonEmpty IntSet -> IntSet Source # stimes :: Integral b => b -> IntSet -> IntSet Source #
Semigroup Void | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: Void -> Void -> Void Source # sconcat :: NonEmpty Void -> Void Source # stimes :: Integral b => b -> Void -> Void Source #
Semigroup All | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (<>) :: All -> All -> All Source # sconcat :: NonEmpty All -> All Source # stimes :: Integral b => b -> All -> All Source #
Semigroup Any | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (<>) :: Any -> Any -> Any Source # sconcat :: NonEmpty Any -> Any Source # stimes :: Integral b => b -> Any -> Any Source #
Semigroup ExceptionContext |
Instance details Defined in GHC.Internal.Exception.Context Methods (<>) :: ExceptionContext -> ExceptionContext -> ExceptionContext Source # sconcat :: NonEmpty ExceptionContext -> ExceptionContext Source # stimes :: Integral b => b -> ExceptionContext -> ExceptionContext Source #
Semigroup Ordering | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: Ordering -> Ordering -> Ordering Source # sconcat :: NonEmpty Ordering -> Ordering Source # stimes :: Integral b => b -> Ordering -> Ordering Source #
Semigroup Part |
Instance details Defined in NLP.Miniutter.English Methods (<>) :: Part -> Part -> Part Source # sconcat :: NonEmpty Part -> Part Source # stimes :: Integral b => b -> Part -> Part Source #
Semigroup PrefsMod |
Instance details Defined in Options.Applicative.Builder Methods (<>) :: PrefsMod -> PrefsMod -> PrefsMod Source # sconcat :: NonEmpty PrefsMod -> PrefsMod Source # stimes :: Integral b => b -> PrefsMod -> PrefsMod Source #
Semigroup ParserHelp |
Instance details Defined in Options.Applicative.Help.Types Methods (<>) :: ParserHelp -> ParserHelp -> ParserHelp Source # sconcat :: NonEmpty ParserHelp -> ParserHelp Source # stimes :: Integral b => b -> ParserHelp -> ParserHelp Source #
Semigroup Completer |
Instance details Defined in Options.Applicative.Types Methods (<>) :: Completer -> Completer -> Completer Source # sconcat :: NonEmpty Completer -> Completer Source # stimes :: Integral b => b -> Completer -> Completer Source #
Semigroup ParseError |
Instance details Defined in Options.Applicative.Types Methods (<>) :: ParseError -> ParseError -> ParseError Source # sconcat :: NonEmpty ParseError -> ParseError Source # stimes :: Integral b => b -> ParseError -> ParseError Source #
Semigroup OsString |
Instance details Defined in System.OsString.Internal.Types Methods (<>) :: OsString -> OsString -> OsString Source # sconcat :: NonEmpty OsString -> OsString Source # stimes :: Integral b => b -> OsString -> OsString Source #
Semigroup PosixString |
Instance details Defined in System.OsString.Internal.Types Methods (<>) :: PosixString -> PosixString -> PosixString Source # sconcat :: NonEmpty PosixString -> PosixString Source # stimes :: Integral b => b -> PosixString -> PosixString Source #
Semigroup WindowsString |
Instance details Defined in System.OsString.Internal.Types Methods (<>) :: WindowsString -> WindowsString -> WindowsString Source # sconcat :: NonEmpty WindowsString -> WindowsString Source # stimes :: Integral b => b -> WindowsString -> WindowsString Source #
Semigroup Doc |
Instance details Defined in Text.PrettyPrint.HughesPJ Methods (<>) :: Doc -> Doc -> Doc Source # sconcat :: NonEmpty Doc -> Doc Source # stimes :: Integral b => b -> Doc -> Doc Source #
Semigroup Text | Beware: `stimes` will crash if the given number does not fit into an `Int`. Since: text-1.2.2.0
Instance details Defined in Data.Text Methods (<>) :: Text -> Text -> Text Source # sconcat :: NonEmpty Text -> Text Source # stimes :: Integral b => b -> Text -> Text Source #
Semigroup Builder |
Instance details Defined in Data.Text.Internal.Builder Methods (<>) :: Builder -> Builder -> Builder Source # sconcat :: NonEmpty Builder -> Builder Source # stimes :: Integral b => b -> Builder -> Builder Source #
Semigroup Text | Since: text-1.2.2.0
Instance details Defined in Data.Text.Lazy Methods (<>) :: Text -> Text -> Text Source # sconcat :: NonEmpty Text -> Text Source # stimes :: Integral b => b -> Text -> Text Source #
Semigroup StrictTextBuilder | Concatenation of `StrictBuilder` is right-biased: the right builder will be run first. This allows a builder to run tail-recursively when it was accumulated left-to-right.
Instance details Defined in Data.Text.Internal.StrictBuilder Methods (<>) :: StrictTextBuilder -> StrictTextBuilder -> StrictTextBuilder Source # sconcat :: NonEmpty StrictTextBuilder -> StrictTextBuilder Source # stimes :: Integral b => b -> StrictTextBuilder -> StrictTextBuilder Source #
Semigroup ShortText |
Instance details Defined in Data.Text.Short.Internal Methods (<>) :: ShortText -> ShortText -> ShortText Source # sconcat :: NonEmpty ShortText -> ShortText Source # stimes :: Integral b => b -> ShortText -> ShortText Source #
Semigroup CalendarDiffDays | Additive
Instance details Defined in Data.Time.Calendar.CalendarDiffDays Methods (<>) :: CalendarDiffDays -> CalendarDiffDays -> CalendarDiffDays Source # sconcat :: NonEmpty CalendarDiffDays -> CalendarDiffDays Source # stimes :: Integral b => b -> CalendarDiffDays -> CalendarDiffDays Source #
Semigroup CalendarDiffTime | Additive
Instance details Defined in Data.Time.LocalTime.Internal.CalendarDiffTime Methods (<>) :: CalendarDiffTime -> CalendarDiffTime -> CalendarDiffTime Source # sconcat :: NonEmpty CalendarDiffTime -> CalendarDiffTime Source # stimes :: Integral b => b -> CalendarDiffTime -> CalendarDiffTime Source #
Semigroup () | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: () -> () -> () Source # sconcat :: NonEmpty () -> () Source # stimes :: Integral b => b -> () -> () Source #
Semigroup (KeyMap v) |
Instance details Defined in Data.Aeson.KeyMap Methods (<>) :: KeyMap v -> KeyMap v -> KeyMap v Source # sconcat :: NonEmpty (KeyMap v) -> KeyMap v Source # stimes :: Integral b => b -> KeyMap v -> KeyMap v Source #
Semigroup (IResult a) |
Instance details Defined in Data.Aeson.Types.Internal Methods (<>) :: IResult a -> IResult a -> IResult a Source # sconcat :: NonEmpty (IResult a) -> IResult a Source # stimes :: Integral b => b -> IResult a -> IResult a Source #
Semigroup (Parser a) |
Instance details Defined in Data.Aeson.Types.Internal Methods (<>) :: Parser a -> Parser a -> Parser a Source # sconcat :: NonEmpty (Parser a) -> Parser a Source # stimes :: Integral b => b -> Parser a -> Parser a Source #
Semigroup (Result a) |
Instance details Defined in Data.Aeson.Types.Internal Methods (<>) :: Result a -> Result a -> Result a Source # sconcat :: NonEmpty (Result a) -> Result a Source # stimes :: Integral b => b -> Result a -> Result a Source #
Semigroup a => Semigroup (Concurrently a) | Only defined by `async` for `base >= 4.9` Since: async-2.1.0
Instance details Defined in Control.Concurrent.Async.Internal Methods (<>) :: Concurrently a -> Concurrently a -> Concurrently a Source # sconcat :: NonEmpty (Concurrently a) -> Concurrently a Source # stimes :: Integral b => b -> Concurrently a -> Concurrently a Source #
Semigroup (FromMaybe b) |
Instance details Defined in Data.Foldable1 Methods (<>) :: FromMaybe b -> FromMaybe b -> FromMaybe b Source # sconcat :: NonEmpty (FromMaybe b) -> FromMaybe b Source # stimes :: Integral b0 => b0 -> FromMaybe b -> FromMaybe b Source #
Semigroup a => Semigroup (JoinWith a) |
Instance details Defined in Data.Foldable1 Methods (<>) :: JoinWith a -> JoinWith a -> JoinWith a Source # sconcat :: NonEmpty (JoinWith a) -> JoinWith a Source # stimes :: Integral b => b -> JoinWith a -> JoinWith a Source #
Semigroup (NonEmptyDList a) |
Instance details Defined in Data.Foldable1 Methods (<>) :: NonEmptyDList a -> NonEmptyDList a -> NonEmptyDList a Source # sconcat :: NonEmpty (NonEmptyDList a) -> NonEmptyDList a Source # stimes :: Integral b => b -> NonEmptyDList a -> NonEmptyDList a Source #

Semigroup (Comparison a)

`(`<>`)` on comparisons combines results with `(`<>`) @Ordering`. Without newtypes this equals ``liftA2` (`liftA2` (`<>`))`.

    (<>) :: Comparison a -> Comparison a -> Comparison a
    Comparison cmp <> Comparison cmp' = Comparison a a' ->
      cmp a a' <> cmp a a'

Instance details Defined in Data.Functor.Contravariant Methods (<>) :: Comparison a -> Comparison a -> Comparison a Source # sconcat :: NonEmpty (Comparison a) -> Comparison a Source # stimes :: Integral b => b -> Comparison a -> Comparison a Source #

Semigroup (Equivalence a)

`(`<>`)` on equivalences uses logical conjunction `(`&&`)` on the results. Without newtypes this equals ``liftA2` (`liftA2` (&&))`.

    (<>) :: Equivalence a -> Equivalence a -> Equivalence a
    Equivalence equiv <> Equivalence equiv' = Equivalence a b ->
      equiv a b && equiv' a b

Instance details Defined in Data.Functor.Contravariant Methods (<>) :: Equivalence a -> Equivalence a -> Equivalence a Source # sconcat :: NonEmpty (Equivalence a) -> Equivalence a Source # stimes :: Integral b => b -> Equivalence a -> Equivalence a Source #

Semigroup (Predicate a)

`(`<>`)` on predicates uses logical conjunction `(`&&`)` on the results. Without newtypes this equals ``liftA2` (&&)`.

    (<>) :: Predicate a -> Predicate a -> Predicate a
    Predicate pred <> Predicate pred' = Predicate a ->
      pred a && pred' a

Instance details Defined in Data.Functor.Contravariant Methods (<>) :: Predicate a -> Predicate a -> Predicate a Source # sconcat :: NonEmpty (Predicate a) -> Predicate a Source # stimes :: Integral b => b -> Predicate a -> Predicate a Source #
Semigroup (First a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: First a -> First a -> First a Source # sconcat :: NonEmpty (First a) -> First a Source # stimes :: Integral b => b -> First a -> First a Source #
Semigroup (Last a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Last a -> Last a -> Last a Source # sconcat :: NonEmpty (Last a) -> Last a Source # stimes :: Integral b => b -> Last a -> Last a Source #
Ord a => Semigroup (Max a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Max a -> Max a -> Max a Source # sconcat :: NonEmpty (Max a) -> Max a Source # stimes :: Integral b => b -> Max a -> Max a Source #
Ord a => Semigroup (Min a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Min a -> Min a -> Min a Source # sconcat :: NonEmpty (Min a) -> Min a Source # stimes :: Integral b => b -> Min a -> Min a Source #
Monoid m => Semigroup (WrappedMonoid m) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m Source # sconcat :: NonEmpty (WrappedMonoid m) -> WrappedMonoid m Source # stimes :: Integral b => b -> WrappedMonoid m -> WrappedMonoid m Source #
Semigroup (PutM ()) |
Instance details Defined in Data.Binary.Put Methods (<>) :: PutM () -> PutM () -> PutM () Source # sconcat :: NonEmpty (PutM ()) -> PutM () Source # stimes :: Integral b => b -> PutM () -> PutM () Source #
Num a => Semigroup (AlphaColour a) |
Instance details Defined in Data.Colour.Internal Methods (<>) :: AlphaColour a -> AlphaColour a -> AlphaColour a Source # sconcat :: NonEmpty (AlphaColour a) -> AlphaColour a Source # stimes :: Integral b => b -> AlphaColour a -> AlphaColour a Source #
Num a => Semigroup (Colour a) |
Instance details Defined in Data.Colour.Internal Methods (<>) :: Colour a -> Colour a -> Colour a Source # sconcat :: NonEmpty (Colour a) -> Colour a Source # stimes :: Integral b => b -> Colour a -> Colour a Source #
Semigroup (IntMap a) | Since: containers-0.5.7
Instance details Defined in Data.IntMap.Internal Methods (<>) :: IntMap a -> IntMap a -> IntMap a Source # sconcat :: NonEmpty (IntMap a) -> IntMap a Source # stimes :: Integral b => b -> IntMap a -> IntMap a Source #
Semigroup (Seq a) | Since: containers-0.5.7
Instance details Defined in Data.Sequence.Internal Methods (<>) :: Seq a -> Seq a -> Seq a Source # sconcat :: NonEmpty (Seq a) -> Seq a Source # stimes :: Integral b => b -> Seq a -> Seq a Source #
Ord a => Semigroup (Intersection a) |
Instance details Defined in Data.Set.Internal Methods (<>) :: Intersection a -> Intersection a -> Intersection a Source # sconcat :: NonEmpty (Intersection a) -> Intersection a Source # stimes :: Integral b => b -> Intersection a -> Intersection a Source #
Semigroup (MergeSet a) |
Instance details Defined in Data.Set.Internal Methods (<>) :: MergeSet a -> MergeSet a -> MergeSet a Source # sconcat :: NonEmpty (MergeSet a) -> MergeSet a Source # stimes :: Integral b => b -> MergeSet a -> MergeSet a Source #
Ord a => Semigroup (Set a) | Since: containers-0.5.7
Instance details Defined in Data.Set.Internal Methods (<>) :: Set a -> Set a -> Set a Source # sconcat :: NonEmpty (Set a) -> Set a Source # stimes :: Integral b => b -> Set a -> Set a Source #
Semigroup (DNonEmpty a) |
Instance details Defined in Data.DList.DNonEmpty.Internal Methods (<>) :: DNonEmpty a -> DNonEmpty a -> DNonEmpty a Source # sconcat :: NonEmpty (DNonEmpty a) -> DNonEmpty a Source # stimes :: Integral b => b -> DNonEmpty a -> DNonEmpty a Source #
Semigroup (DList a) |
Instance details Defined in Data.DList.Internal Methods (<>) :: DList a -> DList a -> DList a Source # sconcat :: NonEmpty (DList a) -> DList a Source # stimes :: Integral b => b -> DList a -> DList a Source #
Semigroup (EnumSet k) |
Instance details Defined in Data.EnumSet Methods (<>) :: EnumSet k -> EnumSet k -> EnumSet k Source # sconcat :: NonEmpty (EnumSet k) -> EnumSet k Source # stimes :: Integral b => b -> EnumSet k -> EnumSet k Source #
Semigroup (NonEmpty a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: NonEmpty a -> NonEmpty a -> NonEmpty a Source # sconcat :: NonEmpty (NonEmpty a) -> NonEmpty a Source # stimes :: Integral b => b -> NonEmpty a -> NonEmpty a Source #
Semigroup a => Semigroup (STM a) | Since: base-4.17.0.0
Instance details Defined in GHC.Internal.Conc.Sync Methods (<>) :: STM a -> STM a -> STM a Source # sconcat :: NonEmpty (STM a) -> STM a Source # stimes :: Integral b => b -> STM a -> STM a Source #
Semigroup a => Semigroup (Identity a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Functor.Identity Methods (<>) :: Identity a -> Identity a -> Identity a Source # sconcat :: NonEmpty (Identity a) -> Identity a Source # stimes :: Integral b => b -> Identity a -> Identity a Source #
Ord a => Semigroup (Max a) | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods (<>) :: Max a -> Max a -> Max a Source # sconcat :: NonEmpty (Max a) -> Max a Source # stimes :: Integral b => b -> Max a -> Max a Source #
Ord a => Semigroup (Min a) | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods (<>) :: Min a -> Min a -> Min a Source # sconcat :: NonEmpty (Min a) -> Min a Source # stimes :: Integral b => b -> Min a -> Min a Source #
Semigroup (First a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods (<>) :: First a -> First a -> First a Source # sconcat :: NonEmpty (First a) -> First a Source # stimes :: Integral b => b -> First a -> First a Source #
Semigroup (Last a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods (<>) :: Last a -> Last a -> Last a Source # sconcat :: NonEmpty (Last a) -> Last a Source # stimes :: Integral b => b -> Last a -> Last a Source #
Semigroup a => Semigroup (Down a) | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Data.Ord Methods (<>) :: Down a -> Down a -> Down a Source # sconcat :: NonEmpty (Down a) -> Down a Source # stimes :: Integral b => b -> Down a -> Down a Source #
Semigroup a => Semigroup (Dual a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (<>) :: Dual a -> Dual a -> Dual a Source # sconcat :: NonEmpty (Dual a) -> Dual a Source # stimes :: Integral b => b -> Dual a -> Dual a Source #
Semigroup (Endo a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (<>) :: Endo a -> Endo a -> Endo a Source # sconcat :: NonEmpty (Endo a) -> Endo a Source # stimes :: Integral b => b -> Endo a -> Endo a Source #
Num a => Semigroup (Product a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (<>) :: Product a -> Product a -> Product a Source # sconcat :: NonEmpty (Product a) -> Product a Source # stimes :: Integral b => b -> Product a -> Product a Source #
Num a => Semigroup (Sum a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (<>) :: Sum a -> Sum a -> Sum a Source # sconcat :: NonEmpty (Sum a) -> Sum a Source # stimes :: Integral b => b -> Sum a -> Sum a Source #
(Generic a, Semigroup (Rep a ())) => Semigroup (Generically a) | Since: base-4.17.0.0
Instance details Defined in GHC.Internal.Generics Methods (<>) :: Generically a -> Generically a -> Generically a Source # sconcat :: NonEmpty (Generically a) -> Generically a Source # stimes :: Integral b => b -> Generically a -> Generically a Source #
Semigroup p => Semigroup (Par1 p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods (<>) :: Par1 p -> Par1 p -> Par1 p Source # sconcat :: NonEmpty (Par1 p) -> Par1 p Source # stimes :: Integral b => b -> Par1 p -> Par1 p Source #
Semigroup a => Semigroup (IO a) | Since: base-4.10.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: IO a -> IO a -> IO a Source # sconcat :: NonEmpty (IO a) -> IO a Source # stimes :: Integral b => b -> IO a -> IO a Source #
Semigroup a => Semigroup (Plucker a) |
Instance details Defined in Linear.Plucker Methods (<>) :: Plucker a -> Plucker a -> Plucker a Source # sconcat :: NonEmpty (Plucker a) -> Plucker a Source # stimes :: Integral b => b -> Plucker a -> Plucker a Source #
Semigroup a => Semigroup (Quaternion a) |
Instance details Defined in Linear.Quaternion Methods (<>) :: Quaternion a -> Quaternion a -> Quaternion a Source # sconcat :: NonEmpty (Quaternion a) -> Quaternion a Source # stimes :: Integral b => b -> Quaternion a -> Quaternion a Source #
Semigroup (V0 a) |
Instance details Defined in Linear.V0 Methods (<>) :: V0 a -> V0 a -> V0 a Source # sconcat :: NonEmpty (V0 a) -> V0 a Source # stimes :: Integral b => b -> V0 a -> V0 a Source #
Semigroup a => Semigroup (V1 a) |
Instance details Defined in Linear.V1 Methods (<>) :: V1 a -> V1 a -> V1 a Source # sconcat :: NonEmpty (V1 a) -> V1 a Source # stimes :: Integral b => b -> V1 a -> V1 a Source #
Semigroup a => Semigroup (V2 a) |
Instance details Defined in Linear.V2 Methods (<>) :: V2 a -> V2 a -> V2 a Source # sconcat :: NonEmpty (V2 a) -> V2 a Source # stimes :: Integral b => b -> V2 a -> V2 a Source #
Semigroup a => Semigroup (V3 a) |
Instance details Defined in Linear.V3 Methods (<>) :: V3 a -> V3 a -> V3 a Source # sconcat :: NonEmpty (V3 a) -> V3 a Source # stimes :: Integral b => b -> V3 a -> V3 a Source #
Semigroup a => Semigroup (V4 a) |
Instance details Defined in Linear.V4 Methods (<>) :: V4 a -> V4 a -> V4 a Source # sconcat :: NonEmpty (V4 a) -> V4 a Source # stimes :: Integral b => b -> V4 a -> V4 a Source #
Semigroup (InfoMod a) |
Instance details Defined in Options.Applicative.Builder Methods (<>) :: InfoMod a -> InfoMod a -> InfoMod a Source # sconcat :: NonEmpty (InfoMod a) -> InfoMod a Source # stimes :: Integral b => b -> InfoMod a -> InfoMod a Source #
Semigroup (DefaultProp a) |
Instance details Defined in Options.Applicative.Builder.Internal Methods (<>) :: DefaultProp a -> DefaultProp a -> DefaultProp a Source # sconcat :: NonEmpty (DefaultProp a) -> DefaultProp a Source # stimes :: Integral b => b -> DefaultProp a -> DefaultProp a Source #
Semigroup a => Semigroup (Chunk a) |
Instance details Defined in Options.Applicative.Help.Chunk Methods (<>) :: Chunk a -> Chunk a -> Chunk a Source # sconcat :: NonEmpty (Chunk a) -> Chunk a Source # stimes :: Integral b => b -> Chunk a -> Chunk a Source #
Semigroup (Doc a) |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (<>) :: Doc a -> Doc a -> Doc a Source # sconcat :: NonEmpty (Doc a) -> Doc a Source # stimes :: Integral b => b -> Doc a -> Doc a Source #
Semigroup (Doc ann) |
Instance details Defined in Prettyprinter.Internal Methods (<>) :: Doc ann -> Doc ann -> Doc ann Source # sconcat :: NonEmpty (Doc ann) -> Doc ann Source # stimes :: Integral b => b -> Doc ann -> Doc ann Source #
Semigroup (Array a) | Since: primitive-0.6.3.0
Instance details Defined in Data.Primitive.Array Methods (<>) :: Array a -> Array a -> Array a Source # sconcat :: NonEmpty (Array a) -> Array a Source # stimes :: Integral b => b -> Array a -> Array a Source #
Semigroup (PrimArray a) | Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.PrimArray Methods (<>) :: PrimArray a -> PrimArray a -> PrimArray a Source # sconcat :: NonEmpty (PrimArray a) -> PrimArray a Source # stimes :: Integral b => b -> PrimArray a -> PrimArray a Source #
Semigroup (SmallArray a) | Since: primitive-0.6.3.0
Instance details Defined in Data.Primitive.SmallArray Methods (<>) :: SmallArray a -> SmallArray a -> SmallArray a Source # sconcat :: NonEmpty (SmallArray a) -> SmallArray a Source # stimes :: Integral b => b -> SmallArray a -> SmallArray a Source #
Semigroup a => Semigroup (Maybe a) |
Instance details Defined in Data.Strict.Maybe Methods (<>) :: Maybe a -> Maybe a -> Maybe a Source # sconcat :: NonEmpty (Maybe a) -> Maybe a Source # stimes :: Integral b => b -> Maybe a -> Maybe a Source #
Semigroup a => Semigroup (Q a) | Since: template-haskell-2.17.0.0
Instance details Defined in Language.Haskell.TH.Syntax Methods (<>) :: Q a -> Q a -> Q a Source # sconcat :: NonEmpty (Q a) -> Q a Source # stimes :: Integral b => b -> Q a -> Q a Source #
Semigroup (Validity k) |
Instance details Defined in Data.HashMap.Internal.Debug Methods (<>) :: Validity k -> Validity k -> Validity k Source # sconcat :: NonEmpty (Validity k) -> Validity k Source # stimes :: Integral b => b -> Validity k -> Validity k Source #

(Hashable a, Eq a) => Semigroup (HashSet a)

`<>` = `union`

\(O(n+m)\)

To obtain good performance, the smaller set must be presented as the first argument.

#### Examples

Expand

    >>> fromList [1,2] <> fromList [2,3]
    fromList [1,2,3]

Instance details Defined in Data.HashSet.Internal Methods (<>) :: HashSet a -> HashSet a -> HashSet a Source # sconcat :: NonEmpty (HashSet a) -> HashSet a Source # stimes :: Integral b => b -> HashSet a -> HashSet a Source #
Semigroup (Vector a) |
Instance details Defined in Data.Vector Methods (<>) :: Vector a -> Vector a -> Vector a Source # sconcat :: NonEmpty (Vector a) -> Vector a Source # stimes :: Integral b => b -> Vector a -> Vector a Source #
Prim a => Semigroup (Vector a) |
Instance details Defined in Data.Vector.Primitive Methods (<>) :: Vector a -> Vector a -> Vector a Source # sconcat :: NonEmpty (Vector a) -> Vector a Source # stimes :: Integral b => b -> Vector a -> Vector a Source #
Storable a => Semigroup (Vector a) |
Instance details Defined in Data.Vector.Storable Methods (<>) :: Vector a -> Vector a -> Vector a Source # sconcat :: NonEmpty (Vector a) -> Vector a Source # stimes :: Integral b => b -> Vector a -> Vector a Source #
Semigroup (Vector a) |
Instance details Defined in Data.Vector.Strict Methods (<>) :: Vector a -> Vector a -> Vector a Source # sconcat :: NonEmpty (Vector a) -> Vector a Source # stimes :: Integral b => b -> Vector a -> Vector a Source #
Unbox a => Semigroup (Vector a) |
Instance details Defined in Data.Vector.Unboxed Methods (<>) :: Vector a -> Vector a -> Vector a Source # sconcat :: NonEmpty (Vector a) -> Vector a Source # stimes :: Integral b => b -> Vector a -> Vector a Source #
Semigroup a => Semigroup (Maybe a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: Maybe a -> Maybe a -> Maybe a Source # sconcat :: NonEmpty (Maybe a) -> Maybe a Source # stimes :: Integral b => b -> Maybe a -> Maybe a Source #
Semigroup a => Semigroup (Solo a) | Since: base-4.15
Instance details Defined in GHC.Internal.Base Methods (<>) :: Solo a -> Solo a -> Solo a Source # sconcat :: NonEmpty (Solo a) -> Solo a Source # stimes :: Integral b => b -> Solo a -> Solo a Source #
Semigroup [a] | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: [a] -> [a] -> [a] Source # sconcat :: NonEmpty [a] -> [a] Source # stimes :: Integral b => b -> [a] -> [a] Source #
Semigroup a => Semigroup (ConcurrentlyE e a) | Either the combination of the successful results, or the first failure.
Instance details Defined in Control.Concurrent.Async.Internal Methods (<>) :: ConcurrentlyE e a -> ConcurrentlyE e a -> ConcurrentlyE e a Source # sconcat :: NonEmpty (ConcurrentlyE e a) -> ConcurrentlyE e a Source # stimes :: Integral b => b -> ConcurrentlyE e a -> ConcurrentlyE e a Source #

Semigroup a => Semigroup (Op a b)

`(`<>`) @(Op a b)` without newtypes is `(`<>`) @(b->a)` = `liftA2 (`<>`)`. This lifts the `Semigroup` operation `(`<>`)` over the output of `a`.

    (<>) :: Op a b -> Op a b -> Op a b
    Op f <> Op g = Op a -> f a <> g a

Instance details Defined in Data.Functor.Contravariant Methods (<>) :: Op a b -> Op a b -> Op a b Source # sconcat :: NonEmpty (Op a b) -> Op a b Source # stimes :: Integral b0 => b0 -> Op a b -> Op a b Source #
Ord k => Semigroup (Map k v) |
Instance details Defined in Data.Map.Internal Methods (<>) :: Map k v -> Map k v -> Map k v Source # sconcat :: NonEmpty (Map k v) -> Map k v Source # stimes :: Integral b => b -> Map k v -> Map k v Source #
Semigroup (EnumMap k a) |
Instance details Defined in Data.EnumMap.Base Methods (<>) :: EnumMap k a -> EnumMap k a -> EnumMap k a Source # sconcat :: NonEmpty (EnumMap k a) -> EnumMap k a Source # stimes :: Integral b => b -> EnumMap k a -> EnumMap k a Source #
Semigroup (Either a b) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Either Methods (<>) :: Either a b -> Either a b -> Either a b Source # sconcat :: NonEmpty (Either a b) -> Either a b Source # stimes :: Integral b0 => b0 -> Either a b -> Either a b Source #
Semigroup (U1 p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods (<>) :: U1 p -> U1 p -> U1 p Source # sconcat :: NonEmpty (U1 p) -> U1 p Source # stimes :: Integral b => b -> U1 p -> U1 p Source #
Semigroup (V1 p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods (<>) :: V1 p -> V1 p -> V1 p Source # sconcat :: NonEmpty (V1 p) -> V1 p Source # stimes :: Integral b => b -> V1 p -> V1 p Source #
Semigroup a => Semigroup (ST s a) | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.ST Methods (<>) :: ST s a -> ST s a -> ST s a Source # sconcat :: NonEmpty (ST s a) -> ST s a Source # stimes :: Integral b => b -> ST s a -> ST s a Source #
Apply f => Semigroup (Act f a) |
Instance details Defined in Data.Key Methods (<>) :: Act f a -> Act f a -> Act f a Source # sconcat :: NonEmpty (Act f a) -> Act f a Source # stimes :: Integral b => b -> Act f a -> Act f a Source #
Semigroup (f a) => Semigroup (Indexing f a) |
Instance details Defined in Control.Lens.Internal.Indexed Methods (<>) :: Indexing f a -> Indexing f a -> Indexing f a Source # sconcat :: NonEmpty (Indexing f a) -> Indexing f a Source # stimes :: Integral b => b -> Indexing f a -> Indexing f a Source #
Semigroup (ReifiedFold s a) |
Instance details Defined in Control.Lens.Reified Methods (<>) :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a Source # sconcat :: NonEmpty (ReifiedFold s a) -> ReifiedFold s a Source # stimes :: Integral b => b -> ReifiedFold s a -> ReifiedFold s a Source #
Semigroup (f a) => Semigroup (Point f a) |
Instance details Defined in Linear.Affine Methods (<>) :: Point f a -> Point f a -> Point f a Source # sconcat :: NonEmpty (Point f a) -> Point f a Source # stimes :: Integral b => b -> Point f a -> Point f a Source #
Semigroup (Mod f a) | Since: optparse-applicative-0.13.0.0
Instance details Defined in Options.Applicative.Builder.Internal Methods (<>) :: Mod f a -> Mod f a -> Mod f a Source # sconcat :: NonEmpty (Mod f a) -> Mod f a Source # stimes :: Integral b => b -> Mod f a -> Mod f a Source #
Semigroup (Either a b) |
Instance details Defined in Data.Strict.Either Methods (<>) :: Either a b -> Either a b -> Either a b Source # sconcat :: NonEmpty (Either a b) -> Either a b Source # stimes :: Integral b0 => b0 -> Either a b -> Either a b Source #
(Semigroup a, Semigroup b) => Semigroup (These a b) |
Instance details Defined in Data.Strict.These Methods (<>) :: These a b -> These a b -> These a b Source # sconcat :: NonEmpty (These a b) -> These a b Source # stimes :: Integral b0 => b0 -> These a b -> These a b Source #
(Semigroup a, Semigroup b) => Semigroup (Pair a b) |
Instance details Defined in Data.Strict.Tuple Methods (<>) :: Pair a b -> Pair a b -> Pair a b Source # sconcat :: NonEmpty (Pair a b) -> Pair a b Source # stimes :: Integral b0 => b0 -> Pair a b -> Pair a b Source #
(Semigroup a, Semigroup b) => Semigroup (These a b) |
Instance details Defined in Data.These Methods (<>) :: These a b -> These a b -> These a b Source # sconcat :: NonEmpty (These a b) -> These a b Source # stimes :: Integral b0 => b0 -> These a b -> These a b Source #

(Eq k, Hashable k) => Semigroup (HashMap k v)

`<>` = `union`

If a key occurs in both maps, the mapping from the first will be the mapping in the result.

#### Examples

Expand

    >>> fromList [(1,'a'),(2,'b')] <> fromList [(2,'c'),(3,'d')]
    fromList [(1,'a'),(2,'b'),(3,'d')]

Instance details Defined in Data.HashMap.Internal Methods (<>) :: HashMap k v -> HashMap k v -> HashMap k v Source # sconcat :: NonEmpty (HashMap k v) -> HashMap k v Source # stimes :: Integral b => b -> HashMap k v -> HashMap k v Source #
(Semigroup a, Semigroup b) => Semigroup (a, b) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: (a, b) -> (a, b) -> (a, b) Source # sconcat :: NonEmpty (a, b) -> (a, b) Source # stimes :: Integral b0 => b0 -> (a, b) -> (a, b) Source #
Semigroup b => Semigroup (a -> b) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: (a -> b) -> (a -> b) -> a -> b Source # sconcat :: NonEmpty (a -> b) -> a -> b Source # stimes :: Integral b0 => b0 -> (a -> b) -> a -> b Source #
Semigroup a => Semigroup (Const a b) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Functor.Const Methods (<>) :: Const a b -> Const a b -> Const a b Source # sconcat :: NonEmpty (Const a b) -> Const a b Source # stimes :: Integral b0 => b0 -> Const a b -> Const a b Source #
(Applicative f, Semigroup a) => Semigroup (Ap f a) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods (<>) :: Ap f a -> Ap f a -> Ap f a Source # sconcat :: NonEmpty (Ap f a) -> Ap f a Source # stimes :: Integral b => b -> Ap f a -> Ap f a Source #
Alternative f => Semigroup (Alt f a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (<>) :: Alt f a -> Alt f a -> Alt f a Source # sconcat :: NonEmpty (Alt f a) -> Alt f a Source # stimes :: Integral b => b -> Alt f a -> Alt f a Source #
Semigroup (f p) => Semigroup (Rec1 f p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods (<>) :: Rec1 f p -> Rec1 f p -> Rec1 f p Source # sconcat :: NonEmpty (Rec1 f p) -> Rec1 f p Source # stimes :: Integral b => b -> Rec1 f p -> Rec1 f p Source #
Semigroup (ReifiedIndexedFold i s a) |
Instance details Defined in Control.Lens.Reified Methods (<>) :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a Source # sconcat :: NonEmpty (ReifiedIndexedFold i s a) -> ReifiedIndexedFold i s a Source # stimes :: Integral b => b -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a Source #
(Dim n, Semigroup a) => Semigroup (V n a) |
Instance details Defined in Linear.V Methods (<>) :: V n a -> V n a -> V n a Source # sconcat :: NonEmpty (V n a) -> V n a Source # stimes :: Integral b => b -> V n a -> V n a Source #
Reifies s (ReifiedMonoid a) => Semigroup (ReflectedMonoid a s) |
Instance details Defined in Data.Reflection Methods (<>) :: ReflectedMonoid a s -> ReflectedMonoid a s -> ReflectedMonoid a s Source # sconcat :: NonEmpty (ReflectedMonoid a s) -> ReflectedMonoid a s Source # stimes :: Integral b => b -> ReflectedMonoid a s -> ReflectedMonoid a s Source #
Semigroup a => Semigroup (Tagged s a) |
Instance details Defined in Data.Tagged Methods (<>) :: Tagged s a -> Tagged s a -> Tagged s a Source # sconcat :: NonEmpty (Tagged s a) -> Tagged s a Source # stimes :: Integral b => b -> Tagged s a -> Tagged s a Source #
Semigroup a => Semigroup (Constant a b) |
Instance details Defined in Data.Functor.Constant Methods (<>) :: Constant a b -> Constant a b -> Constant a b Source # sconcat :: NonEmpty (Constant a b) -> Constant a b Source # stimes :: Integral b0 => b0 -> Constant a b -> Constant a b Source #
(Semigroup a, Semigroup b, Semigroup c) => Semigroup (a, b, c) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: (a, b, c) -> (a, b, c) -> (a, b, c) Source # sconcat :: NonEmpty (a, b, c) -> (a, b, c) Source # stimes :: Integral b0 => b0 -> (a, b, c) -> (a, b, c) Source #
(Semigroup (f a), Semigroup (g a)) => Semigroup (Product f g a) | Since: base-4.16.0.0
Instance details Defined in Data.Functor.Product Methods (<>) :: Product f g a -> Product f g a -> Product f g a Source # sconcat :: NonEmpty (Product f g a) -> Product f g a Source # stimes :: Integral b => b -> Product f g a -> Product f g a Source #
(Semigroup (f p), Semigroup (g p)) => Semigroup ((f :*: g) p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods (<>) :: (f :*: g) p -> (f :*: g) p -> (f :*: g) p Source # sconcat :: NonEmpty ((f :*: g) p) -> (f :*: g) p Source # stimes :: Integral b => b -> (f :*: g) p -> (f :*: g) p Source #
Semigroup c => Semigroup (K1 i c p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods (<>) :: K1 i c p -> K1 i c p -> K1 i c p Source # sconcat :: NonEmpty (K1 i c p) -> K1 i c p Source # stimes :: Integral b => b -> K1 i c p -> K1 i c p Source #
(Semigroup a, Semigroup b, Semigroup c, Semigroup d) => Semigroup (a, b, c, d) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) Source # sconcat :: NonEmpty (a, b, c, d) -> (a, b, c, d) Source # stimes :: Integral b0 => b0 -> (a, b, c, d) -> (a, b, c, d) Source #
Semigroup (f (g a)) => Semigroup (Compose f g a) | Since: base-4.16.0.0
Instance details Defined in Data.Functor.Compose Methods (<>) :: Compose f g a -> Compose f g a -> Compose f g a Source # sconcat :: NonEmpty (Compose f g a) -> Compose f g a Source # stimes :: Integral b => b -> Compose f g a -> Compose f g a Source #
Semigroup (f (g p)) => Semigroup ((f :.: g) p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods (<>) :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p Source # sconcat :: NonEmpty ((f :.: g) p) -> (f :.: g) p Source # stimes :: Integral b => b -> (f :.: g) p -> (f :.: g) p Source #
Semigroup (f p) => Semigroup (M1 i c f p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods (<>) :: M1 i c f p -> M1 i c f p -> M1 i c f p Source # sconcat :: NonEmpty (M1 i c f p) -> M1 i c f p Source # stimes :: Integral b => b -> M1 i c f p -> M1 i c f p Source #
(Semigroup a, Semigroup b, Semigroup c, Semigroup d, Semigroup e) => Semigroup (a, b, c, d, e) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) Source # sconcat :: NonEmpty (a, b, c, d, e) -> (a, b, c, d, e) Source # stimes :: Integral b0 => b0 -> (a, b, c, d, e) -> (a, b, c, d, e) Source #

all :: Foldable t => (a -> Bool) -> t a -> Bool Source #

Determines whether all elements of the structure satisfy the predicate.

#### Examples

Expand

Basic usage:

    >>> all (> 3) []
    True

    >>> all (> 3) [1,2]
    False

    >>> all (> 3) [1,2,3,4,5]
    False

    >>> all (> 3) [1..]
    False

    >>> all (> 3) [4..]
    * Hangs forever *

error :: HasCallStack => [Char] -> a Source #

`error` stops execution and displays an error message.

class (Functor t, Foldable t) => Traversable (t :: Type -> Type) where Source #

Functors representing data structures that can be transformed to structures of the same shape by performing an `Applicative` (or, therefore, `Monad`) action on each element from left to right.

A more detailed description of what same shape means, the various methods, how traversals are constructed, and example advanced use-cases can be found in the Overview section of Data.Traversable.

For the class laws see the Laws section of Data.Traversable.

Minimal complete definition

traverse | sequenceA

Methods

traverse :: Applicative f => (a -> f b) -> t a -> f (t b) Source #

Map each element of a structure to an action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see `traverse_`.

#### Examples

Expand

Basic usage:

In the first two examples we show each evaluated action mapping to the output structure.

    >>> traverse Just [1,2,3,4]
    Just [1,2,3,4]

    >>> traverse id [Right 1, Right 2, Right 3, Right 4]
    Right [1,2,3,4]

In the next examples, we show that `Nothing` and `Left` values short circuit the created structure.

    >>> traverse (const Nothing) [1,2,3,4]
    Nothing

    >>> traverse (\x -> if odd x then Just x else Nothing)  [1,2,3,4]
    Nothing

    >>> traverse id [Right 1, Right 2, Right 3, Right 4, Left 0]
    Left 0

sequenceA :: Applicative f => t (f a) -> f (t a) Source #

Evaluate each action in the structure from left to right, and collect the results. For a version that ignores the results see `sequenceA_`.

#### Examples

Expand

Basic usage:

For the first two examples we show sequenceA fully evaluating a a structure and collecting the results.

    >>> sequenceA [Just 1, Just 2, Just 3]
    Just [1,2,3]

    >>> sequenceA [Right 1, Right 2, Right 3]
    Right [1,2,3]

The next two example show `Nothing` and `Just` will short circuit the resulting structure if present in the input. For more context, check the `Traversable` instances for `Either` and `Maybe`.

    >>> sequenceA [Just 1, Just 2, Just 3, Nothing]
    Nothing

    >>> sequenceA [Right 1, Right 2, Right 3, Left 4]
    Left 4

mapM :: Monad m => (a -> m b) -> t a -> m (t b) Source #

Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see `mapM_`.

#### Examples

Expand

`mapM` is literally a `traverse` with a type signature restricted to `Monad`. Its implementation may be more efficient due to additional power of `Monad`.

sequence :: Monad m => t (m a) -> m (t a) Source #

Evaluate each monadic action in the structure from left to right, and collect the results. For a version that ignores the results see `sequence_`.

#### Examples

Expand

Basic usage:

The first two examples are instances where the input and and output of `sequence` are isomorphic.

    >>> sequence $ Right [1,2,3,4]
    [Right 1,Right 2,Right 3,Right 4]

    >>> sequence $ [Right 1,Right 2,Right 3,Right 4]
    Right [1,2,3,4]

The following examples demonstrate short circuit behavior for `sequence`.

    >>> sequence $ Left [1,2,3,4]
    Left [1,2,3,4]

    >>> sequence $ [Left 0, Right 1,Right 2,Right 3,Right 4]
    Left 0

#### Instances

Instances details

Traversable Strategy Source # |
Instance details Defined in Game.LambdaHack.Client.AI.Strategy Methods traverse :: Applicative f => (a -> f b) -> Strategy a -> f (Strategy b) Source # sequenceA :: Applicative f => Strategy (f a) -> f (Strategy a) Source # mapM :: Monad m => (a -> m b) -> Strategy a -> m (Strategy b) Source # sequence :: Monad m => Strategy (m a) -> m (Strategy a) Source #
Traversable Frequency Source # |
Instance details Defined in Game.LambdaHack.Core.Frequency Methods traverse :: Applicative f => (a -> f b) -> Frequency a -> f (Frequency b) Source # sequenceA :: Applicative f => Frequency (f a) -> f (Frequency a) Source # mapM :: Monad m => (a -> m b) -> Frequency a -> m (Frequency b) Source # sequence :: Monad m => Frequency (m a) -> m (Frequency a) Source #
Traversable KeyMap |
Instance details Defined in Data.Aeson.KeyMap Methods traverse :: Applicative f => (a -> f b) -> KeyMap a -> f (KeyMap b) Source # sequenceA :: Applicative f => KeyMap (f a) -> f (KeyMap a) Source # mapM :: Monad m => (a -> m b) -> KeyMap a -> m (KeyMap b) Source # sequence :: Monad m => KeyMap (m a) -> m (KeyMap a) Source #
Traversable IResult |
Instance details Defined in Data.Aeson.Types.Internal Methods traverse :: Applicative f => (a -> f b) -> IResult a -> f (IResult b) Source # sequenceA :: Applicative f => IResult (f a) -> f (IResult a) Source # mapM :: Monad m => (a -> m b) -> IResult a -> m (IResult b) Source # sequence :: Monad m => IResult (m a) -> m (IResult a) Source #
Traversable Result |
Instance details Defined in Data.Aeson.Types.Internal Methods traverse :: Applicative f => (a -> f b) -> Result a -> f (Result b) Source # sequenceA :: Applicative f => Result (f a) -> f (Result a) Source # mapM :: Monad m => (a -> m b) -> Result a -> m (Result b) Source # sequence :: Monad m => Result (m a) -> m (Result a) Source #
Traversable Complex | Since: base-4.9.0.0
Instance details Defined in Data.Complex Methods traverse :: Applicative f => (a -> f b) -> Complex a -> f (Complex b) Source # sequenceA :: Applicative f => Complex (f a) -> f (Complex a) Source # mapM :: Monad m => (a -> m b) -> Complex a -> m (Complex b) Source # sequence :: Monad m => Complex (m a) -> m (Complex a) Source #
Traversable First | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> First a -> f (First b) Source # sequenceA :: Applicative f => First (f a) -> f (First a) Source # mapM :: Monad m => (a -> m b) -> First a -> m (First b) Source # sequence :: Monad m => First (m a) -> m (First a) Source #
Traversable Last | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> Last a -> f (Last b) Source # sequenceA :: Applicative f => Last (f a) -> f (Last a) Source # mapM :: Monad m => (a -> m b) -> Last a -> m (Last b) Source # sequence :: Monad m => Last (m a) -> m (Last a) Source #
Traversable Max | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> Max a -> f (Max b) Source # sequenceA :: Applicative f => Max (f a) -> f (Max a) Source # mapM :: Monad m => (a -> m b) -> Max a -> m (Max b) Source # sequence :: Monad m => Max (m a) -> m (Max a) Source #
Traversable Min | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> Min a -> f (Min b) Source # sequenceA :: Applicative f => Min (f a) -> f (Min a) Source # mapM :: Monad m => (a -> m b) -> Min a -> m (Min b) Source # sequence :: Monad m => Min (m a) -> m (Min a) Source #
Traversable SCC | Since: containers-0.5.9
Instance details Defined in Data.Graph Methods traverse :: Applicative f => (a -> f b) -> SCC a -> f (SCC b) Source # sequenceA :: Applicative f => SCC (f a) -> f (SCC a) Source # mapM :: Monad m => (a -> m b) -> SCC a -> m (SCC b) Source # sequence :: Monad m => SCC (m a) -> m (SCC a) Source #
Traversable IntMap | Traverses in order of increasing key.
Instance details Defined in Data.IntMap.Internal Methods traverse :: Applicative f => (a -> f b) -> IntMap a -> f (IntMap b) Source # sequenceA :: Applicative f => IntMap (f a) -> f (IntMap a) Source # mapM :: Monad m => (a -> m b) -> IntMap a -> m (IntMap b) Source # sequence :: Monad m => IntMap (m a) -> m (IntMap a) Source #
Traversable Digit |
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> Digit a -> f (Digit b) Source # sequenceA :: Applicative f => Digit (f a) -> f (Digit a) Source # mapM :: Monad m => (a -> m b) -> Digit a -> m (Digit b) Source # sequence :: Monad m => Digit (m a) -> m (Digit a) Source #
Traversable Elem |
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> Elem a -> f (Elem b) Source # sequenceA :: Applicative f => Elem (f a) -> f (Elem a) Source # mapM :: Monad m => (a -> m b) -> Elem a -> m (Elem b) Source # sequence :: Monad m => Elem (m a) -> m (Elem a) Source #
Traversable FingerTree |
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> FingerTree a -> f (FingerTree b) Source # sequenceA :: Applicative f => FingerTree (f a) -> f (FingerTree a) Source # mapM :: Monad m => (a -> m b) -> FingerTree a -> m (FingerTree b) Source # sequence :: Monad m => FingerTree (m a) -> m (FingerTree a) Source #
Traversable Node |
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> Node a -> f (Node b) Source # sequenceA :: Applicative f => Node (f a) -> f (Node a) Source # mapM :: Monad m => (a -> m b) -> Node a -> m (Node b) Source # sequence :: Monad m => Node (m a) -> m (Node a) Source #
Traversable Seq |
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> Seq a -> f (Seq b) Source # sequenceA :: Applicative f => Seq (f a) -> f (Seq a) Source # mapM :: Monad m => (a -> m b) -> Seq a -> m (Seq b) Source # sequence :: Monad m => Seq (m a) -> m (Seq a) Source #
Traversable ViewL |
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> ViewL a -> f (ViewL b) Source # sequenceA :: Applicative f => ViewL (f a) -> f (ViewL a) Source # mapM :: Monad m => (a -> m b) -> ViewL a -> m (ViewL b) Source # sequence :: Monad m => ViewL (m a) -> m (ViewL a) Source #
Traversable ViewR |
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> ViewR a -> f (ViewR b) Source # sequenceA :: Applicative f => ViewR (f a) -> f (ViewR a) Source # mapM :: Monad m => (a -> m b) -> ViewR a -> m (ViewR b) Source # sequence :: Monad m => ViewR (m a) -> m (ViewR a) Source #
Traversable Tree |
Instance details Defined in Data.Tree Methods traverse :: Applicative f => (a -> f b) -> Tree a -> f (Tree b) Source # sequenceA :: Applicative f => Tree (f a) -> f (Tree a) Source # mapM :: Monad m => (a -> m b) -> Tree a -> m (Tree b) Source # sequence :: Monad m => Tree (m a) -> m (Tree a) Source #
Traversable DList |
Instance details Defined in Data.DList.Internal Methods traverse :: Applicative f => (a -> f b) -> DList a -> f (DList b) Source # sequenceA :: Applicative f => DList (f a) -> f (DList a) Source # mapM :: Monad m => (a -> m b) -> DList a -> m (DList b) Source # sequence :: Monad m => DList (m a) -> m (DList a) Source #
Traversable NonEmpty | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> NonEmpty a -> f (NonEmpty b) Source # sequenceA :: Applicative f => NonEmpty (f a) -> f (NonEmpty a) Source # mapM :: Monad m => (a -> m b) -> NonEmpty a -> m (NonEmpty b) Source # sequence :: Monad m => NonEmpty (m a) -> m (NonEmpty a) Source #
Traversable Identity | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Identity a -> f (Identity b) Source # sequenceA :: Applicative f => Identity (f a) -> f (Identity a) Source # mapM :: Monad m => (a -> m b) -> Identity a -> m (Identity b) Source # sequence :: Monad m => Identity (m a) -> m (Identity a) Source #
Traversable First | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> First a -> f (First b) Source # sequenceA :: Applicative f => First (f a) -> f (First a) Source # mapM :: Monad m => (a -> m b) -> First a -> m (First b) Source # sequence :: Monad m => First (m a) -> m (First a) Source #
Traversable Last | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Last a -> f (Last b) Source # sequenceA :: Applicative f => Last (f a) -> f (Last a) Source # mapM :: Monad m => (a -> m b) -> Last a -> m (Last b) Source # sequence :: Monad m => Last (m a) -> m (Last a) Source #
Traversable Down | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Down a -> f (Down b) Source # sequenceA :: Applicative f => Down (f a) -> f (Down a) Source # mapM :: Monad m => (a -> m b) -> Down a -> m (Down b) Source # sequence :: Monad m => Down (m a) -> m (Down a) Source #
Traversable Dual | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Dual a -> f (Dual b) Source # sequenceA :: Applicative f => Dual (f a) -> f (Dual a) Source # mapM :: Monad m => (a -> m b) -> Dual a -> m (Dual b) Source # sequence :: Monad m => Dual (m a) -> m (Dual a) Source #
Traversable Product | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Product a -> f (Product b) Source # sequenceA :: Applicative f => Product (f a) -> f (Product a) Source # mapM :: Monad m => (a -> m b) -> Product a -> m (Product b) Source # sequence :: Monad m => Product (m a) -> m (Product a) Source #
Traversable Sum | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Sum a -> f (Sum b) Source # sequenceA :: Applicative f => Sum (f a) -> f (Sum a) Source # mapM :: Monad m => (a -> m b) -> Sum a -> m (Sum b) Source # sequence :: Monad m => Sum (m a) -> m (Sum a) Source #
Traversable ZipList | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Functor.ZipList Methods traverse :: Applicative f => (a -> f b) -> ZipList a -> f (ZipList b) Source # sequenceA :: Applicative f => ZipList (f a) -> f (ZipList a) Source # mapM :: Monad m => (a -> m b) -> ZipList a -> m (ZipList b) Source # sequence :: Monad m => ZipList (m a) -> m (ZipList a) Source #
Traversable Par1 | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Par1 a -> f (Par1 b) Source # sequenceA :: Applicative f => Par1 (f a) -> f (Par1 a) Source # mapM :: Monad m => (a -> m b) -> Par1 a -> m (Par1 b) Source # sequence :: Monad m => Par1 (m a) -> m (Par1 a) Source #
Traversable Plucker |
Instance details Defined in Linear.Plucker Methods traverse :: Applicative f => (a -> f b) -> Plucker a -> f (Plucker b) Source # sequenceA :: Applicative f => Plucker (f a) -> f (Plucker a) Source # mapM :: Monad m => (a -> m b) -> Plucker a -> m (Plucker b) Source # sequence :: Monad m => Plucker (m a) -> m (Plucker a) Source #
Traversable Quaternion |
Instance details Defined in Linear.Quaternion Methods traverse :: Applicative f => (a -> f b) -> Quaternion a -> f (Quaternion b) Source # sequenceA :: Applicative f => Quaternion (f a) -> f (Quaternion a) Source # mapM :: Monad m => (a -> m b) -> Quaternion a -> m (Quaternion b) Source # sequence :: Monad m => Quaternion (m a) -> m (Quaternion a) Source #
Traversable V0 |
Instance details Defined in Linear.V0 Methods traverse :: Applicative f => (a -> f b) -> V0 a -> f (V0 b) Source # sequenceA :: Applicative f => V0 (f a) -> f (V0 a) Source # mapM :: Monad m => (a -> m b) -> V0 a -> m (V0 b) Source # sequence :: Monad m => V0 (m a) -> m (V0 a) Source #
Traversable V1 |
Instance details Defined in Linear.V1 Methods traverse :: Applicative f => (a -> f b) -> V1 a -> f (V1 b) Source # sequenceA :: Applicative f => V1 (f a) -> f (V1 a) Source # mapM :: Monad m => (a -> m b) -> V1 a -> m (V1 b) Source # sequence :: Monad m => V1 (m a) -> m (V1 a) Source #
Traversable V2 |
Instance details Defined in Linear.V2 Methods traverse :: Applicative f => (a -> f b) -> V2 a -> f (V2 b) Source # sequenceA :: Applicative f => V2 (f a) -> f (V2 a) Source # mapM :: Monad m => (a -> m b) -> V2 a -> m (V2 b) Source # sequence :: Monad m => V2 (m a) -> m (V2 a) Source #
Traversable V3 |
Instance details Defined in Linear.V3 Methods traverse :: Applicative f => (a -> f b) -> V3 a -> f (V3 b) Source # sequenceA :: Applicative f => V3 (f a) -> f (V3 a) Source # mapM :: Monad m => (a -> m b) -> V3 a -> m (V3 b) Source # sequence :: Monad m => V3 (m a) -> m (V3 a) Source #
Traversable V4 |
Instance details Defined in Linear.V4 Methods traverse :: Applicative f => (a -> f b) -> V4 a -> f (V4 b) Source # sequenceA :: Applicative f => V4 (f a) -> f (V4 a) Source # mapM :: Monad m => (a -> m b) -> V4 a -> m (V4 b) Source # sequence :: Monad m => V4 (m a) -> m (V4 a) Source #
Traversable SimpleDocStream |

Instance details

Defined in Prettyprinter.Internal

Methods

traverse :: Applicative f => (a -> f b) -> SimpleDocStream a -> f (SimpleDocStream b) Source #

sequenceA :: Applicative f => SimpleDocStream (f a) -> f (SimpleDocStream a) Source #

mapM :: Monad m => (a -> m b) -> SimpleDocStream a -> m (SimpleDocStream b) Source #

sequence :: Monad m => SimpleDocStream (m a) -> m (SimpleDocStream a) Source #

Traversable Array |
Instance details Defined in Data.Primitive.Array Methods traverse :: Applicative f => (a -> f b) -> Array a -> f (Array b) Source # sequenceA :: Applicative f => Array (f a) -> f (Array a) Source # mapM :: Monad m => (a -> m b) -> Array a -> m (Array b) Source # sequence :: Monad m => Array (m a) -> m (Array a) Source #
Traversable SmallArray |
Instance details Defined in Data.Primitive.SmallArray Methods traverse :: Applicative f => (a -> f b) -> SmallArray a -> f (SmallArray b) Source # sequenceA :: Applicative f => SmallArray (f a) -> f (SmallArray a) Source # mapM :: Monad m => (a -> m b) -> SmallArray a -> m (SmallArray b) Source # sequence :: Monad m => SmallArray (m a) -> m (SmallArray a) Source #
Traversable Changeable |
Instance details Defined in SDL.Audio Methods traverse :: Applicative f => (a -> f b) -> Changeable a -> f (Changeable b) Source # sequenceA :: Applicative f => Changeable (f a) -> f (Changeable a) Source # mapM :: Monad m => (a -> m b) -> Changeable a -> m (Changeable b) Source # sequence :: Monad m => Changeable (m a) -> m (Changeable a) Source #
Traversable V2 |
Instance details Defined in SDL.Internal.Vect Methods traverse :: Applicative f => (a -> f b) -> V2 a -> f (V2 b) Source # sequenceA :: Applicative f => V2 (f a) -> f (V2 a) Source # mapM :: Monad m => (a -> m b) -> V2 a -> m (V2 b) Source # sequence :: Monad m => V2 (m a) -> m (V2 a) Source #
Traversable V3 |
Instance details Defined in SDL.Internal.Vect Methods traverse :: Applicative f => (a -> f b) -> V3 a -> f (V3 b) Source # sequenceA :: Applicative f => V3 (f a) -> f (V3 a) Source # mapM :: Monad m => (a -> m b) -> V3 a -> m (V3 b) Source # sequence :: Monad m => V3 (m a) -> m (V3 a) Source #
Traversable V4 |
Instance details Defined in SDL.Internal.Vect Methods traverse :: Applicative f => (a -> f b) -> V4 a -> f (V4 b) Source # sequenceA :: Applicative f => V4 (f a) -> f (V4 a) Source # mapM :: Monad m => (a -> m b) -> V4 a -> m (V4 b) Source # sequence :: Monad m => V4 (m a) -> m (V4 a) Source #
Traversable Maybe |
Instance details Defined in Data.Strict.Maybe Methods traverse :: Applicative f => (a -> f b) -> Maybe a -> f (Maybe b) Source # sequenceA :: Applicative f => Maybe (f a) -> f (Maybe a) Source # mapM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b) Source # sequence :: Monad m => Maybe (m a) -> m (Maybe a) Source #
Traversable TyVarBndr |
Instance details Defined in Language.Haskell.TH.Syntax Methods traverse :: Applicative f => (a -> f b) -> TyVarBndr a -> f (TyVarBndr b) Source # sequenceA :: Applicative f => TyVarBndr (f a) -> f (TyVarBndr a) Source # mapM :: Monad m => (a -> m b) -> TyVarBndr a -> m (TyVarBndr b) Source # sequence :: Monad m => TyVarBndr (m a) -> m (TyVarBndr a) Source #
Traversable Vector |
Instance details Defined in Data.Vector Methods traverse :: Applicative f => (a -> f b) -> Vector a -> f (Vector b) Source # sequenceA :: Applicative f => Vector (f a) -> f (Vector a) Source # mapM :: Monad m => (a -> m b) -> Vector a -> m (Vector b) Source # sequence :: Monad m => Vector (m a) -> m (Vector a) Source #
Traversable Vector |
Instance details Defined in Data.Vector.Strict Methods traverse :: Applicative f => (a -> f b) -> Vector a -> f (Vector b) Source # sequenceA :: Applicative f => Vector (f a) -> f (Vector a) Source # mapM :: Monad m => (a -> m b) -> Vector a -> m (Vector b) Source # sequence :: Monad m => Vector (m a) -> m (Vector a) Source #
Traversable Maybe | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Maybe a -> f (Maybe b) Source # sequenceA :: Applicative f => Maybe (f a) -> f (Maybe a) Source # mapM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b) Source # sequence :: Monad m => Maybe (m a) -> m (Maybe a) Source #
Traversable Solo | Since: base-4.15
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Solo a -> f (Solo b) Source # sequenceA :: Applicative f => Solo (f a) -> f (Solo a) Source # mapM :: Monad m => (a -> m b) -> Solo a -> m (Solo b) Source # sequence :: Monad m => Solo (m a) -> m (Solo a) Source #
Traversable [] | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> [a] -> f [b] Source # sequenceA :: Applicative f => [f a] -> f [a] Source # mapM :: Monad m => (a -> m b) -> [a] -> m [b] Source # sequence :: Monad m => [m a] -> m [a] Source #
Traversable (Arg a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a0 -> f b) -> Arg a a0 -> f (Arg a b) Source # sequenceA :: Applicative f => Arg a (f a0) -> f (Arg a a0) Source # mapM :: Monad m => (a0 -> m b) -> Arg a a0 -> m (Arg a b) Source # sequence :: Monad m => Arg a (m a0) -> m (Arg a a0) Source #
Traversable (Map k) | Traverses in order of increasing key.
Instance details Defined in Data.Map.Internal Methods traverse :: Applicative f => (a -> f b) -> Map k a -> f (Map k b) Source # sequenceA :: Applicative f => Map k (f a) -> f (Map k a) Source # mapM :: Monad m => (a -> m b) -> Map k a -> m (Map k b) Source # sequence :: Monad m => Map k (m a) -> m (Map k a) Source #
Traversable (EnumMap k) |
Instance details Defined in Data.EnumMap.Base Methods traverse :: Applicative f => (a -> f b) -> EnumMap k a -> f (EnumMap k b) Source # sequenceA :: Applicative f => EnumMap k (f a) -> f (EnumMap k a) Source # mapM :: Monad m => (a -> m b) -> EnumMap k a -> m (EnumMap k b) Source # sequence :: Monad m => EnumMap k (m a) -> m (EnumMap k a) Source #
Traversable f => Traversable (Cofree f) |
Instance details Defined in Control.Comonad.Cofree Methods traverse :: Applicative f0 => (a -> f0 b) -> Cofree f a -> f0 (Cofree f b) Source # sequenceA :: Applicative f0 => Cofree f (f0 a) -> f0 (Cofree f a) Source # mapM :: Monad m => (a -> m b) -> Cofree f a -> m (Cofree f b) Source # sequence :: Monad m => Cofree f (m a) -> m (Cofree f a) Source #
Traversable f => Traversable (Free f) |
Instance details Defined in Control.Monad.Free Methods traverse :: Applicative f0 => (a -> f0 b) -> Free f a -> f0 (Free f b) Source # sequenceA :: Applicative f0 => Free f (f0 a) -> f0 (Free f a) Source # mapM :: Monad m => (a -> m b) -> Free f a -> m (Free f b) Source # sequence :: Monad m => Free f (m a) -> m (Free f a) Source #
Ix i => Traversable (Array i) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Array i a -> f (Array i b) Source # sequenceA :: Applicative f => Array i (f a) -> f (Array i a) Source # mapM :: Monad m => (a -> m b) -> Array i a -> m (Array i b) Source # sequence :: Monad m => Array i (m a) -> m (Array i a) Source #
Traversable (Either a) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a0 -> f b) -> Either a a0 -> f (Either a b) Source # sequenceA :: Applicative f => Either a (f a0) -> f (Either a a0) Source # mapM :: Monad m => (a0 -> m b) -> Either a a0 -> m (Either a b) Source # sequence :: Monad m => Either a (m a0) -> m (Either a a0) Source #
Traversable (Proxy :: Type -> Type) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Proxy a -> f (Proxy b) Source # sequenceA :: Applicative f => Proxy (f a) -> f (Proxy a) Source # mapM :: Monad m => (a -> m b) -> Proxy a -> m (Proxy b) Source # sequence :: Monad m => Proxy (m a) -> m (Proxy a) Source #
Traversable (U1 :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> U1 a -> f (U1 b) Source # sequenceA :: Applicative f => U1 (f a) -> f (U1 a) Source # mapM :: Monad m => (a -> m b) -> U1 a -> m (U1 b) Source # sequence :: Monad m => U1 (m a) -> m (U1 a) Source #
Traversable (UAddr :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> UAddr a -> f (UAddr b) Source # sequenceA :: Applicative f => UAddr (f a) -> f (UAddr a) Source # mapM :: Monad m => (a -> m b) -> UAddr a -> m (UAddr b) Source # sequence :: Monad m => UAddr (m a) -> m (UAddr a) Source #
Traversable (UChar :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> UChar a -> f (UChar b) Source # sequenceA :: Applicative f => UChar (f a) -> f (UChar a) Source # mapM :: Monad m => (a -> m b) -> UChar a -> m (UChar b) Source # sequence :: Monad m => UChar (m a) -> m (UChar a) Source #
Traversable (UDouble :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> UDouble a -> f (UDouble b) Source # sequenceA :: Applicative f => UDouble (f a) -> f (UDouble a) Source # mapM :: Monad m => (a -> m b) -> UDouble a -> m (UDouble b) Source # sequence :: Monad m => UDouble (m a) -> m (UDouble a) Source #
Traversable (UFloat :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> UFloat a -> f (UFloat b) Source # sequenceA :: Applicative f => UFloat (f a) -> f (UFloat a) Source # mapM :: Monad m => (a -> m b) -> UFloat a -> m (UFloat b) Source # sequence :: Monad m => UFloat (m a) -> m (UFloat a) Source #
Traversable (UInt :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> UInt a -> f (UInt b) Source # sequenceA :: Applicative f => UInt (f a) -> f (UInt a) Source # mapM :: Monad m => (a -> m b) -> UInt a -> m (UInt b) Source # sequence :: Monad m => UInt (m a) -> m (UInt a) Source #
Traversable (UWord :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> UWord a -> f (UWord b) Source # sequenceA :: Applicative f => UWord (f a) -> f (UWord a) Source # mapM :: Monad m => (a -> m b) -> UWord a -> m (UWord b) Source # sequence :: Monad m => UWord (m a) -> m (UWord a) Source #
Traversable (V1 :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> V1 a -> f (V1 b) Source # sequenceA :: Applicative f => V1 (f a) -> f (V1 a) Source # mapM :: Monad m => (a -> m b) -> V1 a -> m (V1 b) Source # sequence :: Monad m => V1 (m a) -> m (V1 a) Source #
Traversable f => Traversable (Yoneda f) |
Instance details Defined in Data.Functor.Yoneda Methods traverse :: Applicative f0 => (a -> f0 b) -> Yoneda f a -> f0 (Yoneda f b) Source # sequenceA :: Applicative f0 => Yoneda f (f0 a) -> f0 (Yoneda f a) Source # mapM :: Monad m => (a -> m b) -> Yoneda f a -> m (Yoneda f b) Source # sequence :: Monad m => Yoneda f (m a) -> m (Yoneda f a) Source #
Traversable f => Traversable (Point f) |
Instance details Defined in Linear.Affine Methods traverse :: Applicative f0 => (a -> f0 b) -> Point f a -> f0 (Point f b) Source # sequenceA :: Applicative f0 => Point f (f0 a) -> f0 (Point f a) Source # mapM :: Monad m => (a -> m b) -> Point f a -> m (Point f b) Source # sequence :: Monad m => Point f (m a) -> m (Point f a) Source #
Traversable f => Traversable (Point f) |
Instance details Defined in SDL.Internal.Vect Methods traverse :: Applicative f0 => (a -> f0 b) -> Point f a -> f0 (Point f b) Source # sequenceA :: Applicative f0 => Point f (f0 a) -> f0 (Point f a) Source # mapM :: Monad m => (a -> m b) -> Point f a -> m (Point f b) Source # sequence :: Monad m => Point f (m a) -> m (Point f a) Source #
Traversable (Either e) |
Instance details Defined in Data.Strict.Either Methods traverse :: Applicative f => (a -> f b) -> Either e a -> f (Either e b) Source # sequenceA :: Applicative f => Either e (f a) -> f (Either e a) Source # mapM :: Monad m => (a -> m b) -> Either e a -> m (Either e b) Source # sequence :: Monad m => Either e (m a) -> m (Either e a) Source #
Traversable (These a) |
Instance details Defined in Data.Strict.These Methods traverse :: Applicative f => (a0 -> f b) -> These a a0 -> f (These a b) Source # sequenceA :: Applicative f => These a (f a0) -> f (These a a0) Source # mapM :: Monad m => (a0 -> m b) -> These a a0 -> m (These a b) Source # sequence :: Monad m => These a (m a0) -> m (These a a0) Source #
Traversable (Pair e) |
Instance details Defined in Data.Strict.Tuple Methods traverse :: Applicative f => (a -> f b) -> Pair e a -> f (Pair e b) Source # sequenceA :: Applicative f => Pair e (f a) -> f (Pair e a) Source # mapM :: Monad m => (a -> m b) -> Pair e a -> m (Pair e b) Source # sequence :: Monad m => Pair e (m a) -> m (Pair e a) Source #
Traversable (These a) |
Instance details Defined in Data.These Methods traverse :: Applicative f => (a0 -> f b) -> These a a0 -> f (These a b) Source # sequenceA :: Applicative f => These a (f a0) -> f (These a a0) Source # mapM :: Monad m => (a0 -> m b) -> These a a0 -> m (These a b) Source # sequence :: Monad m => These a (m a0) -> m (These a a0) Source #
Traversable f => Traversable (Lift f) |
Instance details Defined in Control.Applicative.Lift Methods traverse :: Applicative f0 => (a -> f0 b) -> Lift f a -> f0 (Lift f b) Source # sequenceA :: Applicative f0 => Lift f (f0 a) -> f0 (Lift f a) Source # mapM :: Monad m => (a -> m b) -> Lift f a -> m (Lift f b) Source # sequence :: Monad m => Lift f (m a) -> m (Lift f a) Source #
Traversable f => Traversable (MaybeT f) |
Instance details Defined in Control.Monad.Trans.Maybe Methods traverse :: Applicative f0 => (a -> f0 b) -> MaybeT f a -> f0 (MaybeT f b) Source # sequenceA :: Applicative f0 => MaybeT f (f0 a) -> f0 (MaybeT f a) Source # mapM :: Monad m => (a -> m b) -> MaybeT f a -> m (MaybeT f b) Source # sequence :: Monad m => MaybeT f (m a) -> m (MaybeT f a) Source #
Traversable (HashMap k) |
Instance details Defined in Data.HashMap.Internal Methods traverse :: Applicative f => (a -> f b) -> HashMap k a -> f (HashMap k b) Source # sequenceA :: Applicative f => HashMap k (f a) -> f (HashMap k a) Source # mapM :: Monad m => (a -> m b) -> HashMap k a -> m (HashMap k b) Source # sequence :: Monad m => HashMap k (m a) -> m (HashMap k a) Source #
Traversable ((,) a) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a0 -> f b) -> (a, a0) -> f (a, b) Source # sequenceA :: Applicative f => (a, f a0) -> f (a, a0) Source # mapM :: Monad m => (a0 -> m b) -> (a, a0) -> m (a, b) Source # sequence :: Monad m => (a, m a0) -> m (a, a0) Source #
Bitraversable p => Traversable (Fix p) |
Instance details Defined in Data.Bifunctor.Fix Methods traverse :: Applicative f => (a -> f b) -> Fix p a -> f (Fix p b) Source # sequenceA :: Applicative f => Fix p (f a) -> f (Fix p a) Source # mapM :: Monad m => (a -> m b) -> Fix p a -> m (Fix p b) Source # sequence :: Monad m => Fix p (m a) -> m (Fix p a) Source #
Bitraversable p => Traversable (Join p) |
Instance details Defined in Data.Bifunctor.Join Methods traverse :: Applicative f => (a -> f b) -> Join p a -> f (Join p b) Source # sequenceA :: Applicative f => Join p (f a) -> f (Join p a) Source # mapM :: Monad m => (a -> m b) -> Join p a -> m (Join p b) Source # sequence :: Monad m => Join p (m a) -> m (Join p a) Source #
Traversable f => Traversable (CofreeF f a) |
Instance details Defined in Control.Comonad.Trans.Cofree Methods traverse :: Applicative f0 => (a0 -> f0 b) -> CofreeF f a a0 -> f0 (CofreeF f a b) Source # sequenceA :: Applicative f0 => CofreeF f a (f0 a0) -> f0 (CofreeF f a a0) Source # mapM :: Monad m => (a0 -> m b) -> CofreeF f a a0 -> m (CofreeF f a b) Source # sequence :: Monad m => CofreeF f a (m a0) -> m (CofreeF f a a0) Source #
(Traversable f, Traversable w) => Traversable (CofreeT f w) |
Instance details Defined in Control.Comonad.Trans.Cofree Methods traverse :: Applicative f0 => (a -> f0 b) -> CofreeT f w a -> f0 (CofreeT f w b) Source # sequenceA :: Applicative f0 => CofreeT f w (f0 a) -> f0 (CofreeT f w a) Source # mapM :: Monad m => (a -> m b) -> CofreeT f w a -> m (CofreeT f w b) Source # sequence :: Monad m => CofreeT f w (m a) -> m (CofreeT f w a) Source #
Traversable f => Traversable (FreeF f a) |
Instance details Defined in Control.Monad.Trans.Free Methods traverse :: Applicative f0 => (a0 -> f0 b) -> FreeF f a a0 -> f0 (FreeF f a b) Source # sequenceA :: Applicative f0 => FreeF f a (f0 a0) -> f0 (FreeF f a a0) Source # mapM :: Monad m => (a0 -> m b) -> FreeF f a a0 -> m (FreeF f a b) Source # sequence :: Monad m => FreeF f a (m a0) -> m (FreeF f a a0) Source #
(Monad m, Traversable m, Traversable f) => Traversable (FreeT f m) |
Instance details Defined in Control.Monad.Trans.Free Methods traverse :: Applicative f0 => (a -> f0 b) -> FreeT f m a -> f0 (FreeT f m b) Source # sequenceA :: Applicative f0 => FreeT f m (f0 a) -> f0 (FreeT f m a) Source # mapM :: Monad m0 => (a -> m0 b) -> FreeT f m a -> m0 (FreeT f m b) Source # sequence :: Monad m0 => FreeT f m (m0 a) -> m0 (FreeT f m a) Source #
Traversable (Const m :: Type -> Type) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Const m a -> f (Const m b) Source # sequenceA :: Applicative f => Const m (f a) -> f (Const m a) Source # mapM :: Monad m0 => (a -> m0 b) -> Const m a -> m0 (Const m b) Source # sequence :: Monad m0 => Const m (m0 a) -> m0 (Const m a) Source #
Traversable f => Traversable (Ap f) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> Ap f a -> f0 (Ap f b) Source # sequenceA :: Applicative f0 => Ap f (f0 a) -> f0 (Ap f a) Source # mapM :: Monad m => (a -> m b) -> Ap f a -> m (Ap f b) Source # sequence :: Monad m => Ap f (m a) -> m (Ap f a) Source #
Traversable f => Traversable (Alt f) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> Alt f a -> f0 (Alt f b) Source # sequenceA :: Applicative f0 => Alt f (f0 a) -> f0 (Alt f a) Source # mapM :: Monad m => (a -> m b) -> Alt f a -> m (Alt f b) Source # sequence :: Monad m => Alt f (m a) -> m (Alt f a) Source #
Traversable f => Traversable (Rec1 f) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> Rec1 f a -> f0 (Rec1 f b) Source # sequenceA :: Applicative f0 => Rec1 f (f0 a) -> f0 (Rec1 f a) Source # mapM :: Monad m => (a -> m b) -> Rec1 f a -> m (Rec1 f b) Source # sequence :: Monad m => Rec1 f (m a) -> m (Rec1 f a) Source #
Traversable (V n) |
Instance details Defined in Linear.V Methods traverse :: Applicative f => (a -> f b) -> V n a -> f (V n b) Source # sequenceA :: Applicative f => V n (f a) -> f (V n a) Source # mapM :: Monad m => (a -> m b) -> V n a -> m (V n b) Source # sequence :: Monad m => V n (m a) -> m (V n a) Source #
Traversable (Tagged s) |
Instance details Defined in Data.Tagged Methods traverse :: Applicative f => (a -> f b) -> Tagged s a -> f (Tagged s b) Source # sequenceA :: Applicative f => Tagged s (f a) -> f (Tagged s a) Source # mapM :: Monad m => (a -> m b) -> Tagged s a -> m (Tagged s b) Source # sequence :: Monad m => Tagged s (m a) -> m (Tagged s a) Source #
(Traversable f, Traversable g) => Traversable (These1 f g) |
Instance details Defined in Data.Functor.These Methods traverse :: Applicative f0 => (a -> f0 b) -> These1 f g a -> f0 (These1 f g b) Source # sequenceA :: Applicative f0 => These1 f g (f0 a) -> f0 (These1 f g a) Source # mapM :: Monad m => (a -> m b) -> These1 f g a -> m (These1 f g b) Source # sequence :: Monad m => These1 f g (m a) -> m (These1 f g a) Source #
Traversable f => Traversable (Backwards f) | Derived instance.
Instance details Defined in Control.Applicative.Backwards Methods traverse :: Applicative f0 => (a -> f0 b) -> Backwards f a -> f0 (Backwards f b) Source # sequenceA :: Applicative f0 => Backwards f (f0 a) -> f0 (Backwards f a) Source # mapM :: Monad m => (a -> m b) -> Backwards f a -> m (Backwards f b) Source # sequence :: Monad m => Backwards f (m a) -> m (Backwards f a) Source #
Traversable f => Traversable (ExceptT e f) |
Instance details Defined in Control.Monad.Trans.Except Methods traverse :: Applicative f0 => (a -> f0 b) -> ExceptT e f a -> f0 (ExceptT e f b) Source # sequenceA :: Applicative f0 => ExceptT e f (f0 a) -> f0 (ExceptT e f a) Source # mapM :: Monad m => (a -> m b) -> ExceptT e f a -> m (ExceptT e f b) Source # sequence :: Monad m => ExceptT e f (m a) -> m (ExceptT e f a) Source #
Traversable f => Traversable (IdentityT f) |
Instance details Defined in Control.Monad.Trans.Identity Methods traverse :: Applicative f0 => (a -> f0 b) -> IdentityT f a -> f0 (IdentityT f b) Source # sequenceA :: Applicative f0 => IdentityT f (f0 a) -> f0 (IdentityT f a) Source # mapM :: Monad m => (a -> m b) -> IdentityT f a -> m (IdentityT f b) Source # sequence :: Monad m => IdentityT f (m a) -> m (IdentityT f a) Source #
Traversable f => Traversable (WriterT w f) |
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods traverse :: Applicative f0 => (a -> f0 b) -> WriterT w f a -> f0 (WriterT w f b) Source # sequenceA :: Applicative f0 => WriterT w f (f0 a) -> f0 (WriterT w f a) Source # mapM :: Monad m => (a -> m b) -> WriterT w f a -> m (WriterT w f b) Source # sequence :: Monad m => WriterT w f (m a) -> m (WriterT w f a) Source #
Traversable f => Traversable (WriterT w f) |
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods traverse :: Applicative f0 => (a -> f0 b) -> WriterT w f a -> f0 (WriterT w f b) Source # sequenceA :: Applicative f0 => WriterT w f (f0 a) -> f0 (WriterT w f a) Source # mapM :: Monad m => (a -> m b) -> WriterT w f a -> m (WriterT w f b) Source # sequence :: Monad m => WriterT w f (m a) -> m (WriterT w f a) Source #
Traversable (Constant a :: Type -> Type) |
Instance details Defined in Data.Functor.Constant Methods traverse :: Applicative f => (a0 -> f b) -> Constant a a0 -> f (Constant a b) Source # sequenceA :: Applicative f => Constant a (f a0) -> f (Constant a a0) Source # mapM :: Monad m => (a0 -> m b) -> Constant a a0 -> m (Constant a b) Source # sequence :: Monad m => Constant a (m a0) -> m (Constant a a0) Source #
Traversable f => Traversable (Reverse f) | Traverse from right to left.
Instance details Defined in Data.Functor.Reverse Methods traverse :: Applicative f0 => (a -> f0 b) -> Reverse f a -> f0 (Reverse f b) Source # sequenceA :: Applicative f0 => Reverse f (f0 a) -> f0 (Reverse f a) Source # mapM :: Monad m => (a -> m b) -> Reverse f a -> m (Reverse f b) Source # sequence :: Monad m => Reverse f (m a) -> m (Reverse f a) Source #
(Traversable f, Traversable g) => Traversable (Product f g) | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods traverse :: Applicative f0 => (a -> f0 b) -> Product f g a -> f0 (Product f g b) Source # sequenceA :: Applicative f0 => Product f g (f0 a) -> f0 (Product f g a) Source # mapM :: Monad m => (a -> m b) -> Product f g a -> m (Product f g b) Source # sequence :: Monad m => Product f g (m a) -> m (Product f g a) Source #
(Traversable f, Traversable g) => Traversable (Sum f g) | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Sum Methods traverse :: Applicative f0 => (a -> f0 b) -> Sum f g a -> f0 (Sum f g b) Source # sequenceA :: Applicative f0 => Sum f g (f0 a) -> f0 (Sum f g a) Source # mapM :: Monad m => (a -> m b) -> Sum f g a -> m (Sum f g b) Source # sequence :: Monad m => Sum f g (m a) -> m (Sum f g a) Source #
(Traversable f, Traversable g) => Traversable (f :*: g) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> (f :*: g) a -> f0 ((f :*: g) b) Source # sequenceA :: Applicative f0 => (f :*: g) (f0 a) -> f0 ((f :*: g) a) Source # mapM :: Monad m => (a -> m b) -> (f :*: g) a -> m ((f :*: g) b) Source # sequence :: Monad m => (f :*: g) (m a) -> m ((f :*: g) a) Source #
(Traversable f, Traversable g) => Traversable (f :+: g) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) Source # sequenceA :: Applicative f0 => (f :+: g) (f0 a) -> f0 ((f :+: g) a) Source # mapM :: Monad m => (a -> m b) -> (f :+: g) a -> m ((f :+: g) b) Source # sequence :: Monad m => (f :+: g) (m a) -> m ((f :+: g) a) Source #
Traversable (K1 i c :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> K1 i c a -> f (K1 i c b) Source # sequenceA :: Applicative f => K1 i c (f a) -> f (K1 i c a) Source # mapM :: Monad m => (a -> m b) -> K1 i c a -> m (K1 i c b) Source # sequence :: Monad m => K1 i c (m a) -> m (K1 i c a) Source #
(Traversable f, Traversable g) => Traversable (Compose f g) | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods traverse :: Applicative f0 => (a -> f0 b) -> Compose f g a -> f0 (Compose f g b) Source # sequenceA :: Applicative f0 => Compose f g (f0 a) -> f0 (Compose f g a) Source # mapM :: Monad m => (a -> m b) -> Compose f g a -> m (Compose f g b) Source # sequence :: Monad m => Compose f g (m a) -> m (Compose f g a) Source #
Traversable (Clown f a :: Type -> Type) |
Instance details Defined in Data.Bifunctor.Clown Methods traverse :: Applicative f0 => (a0 -> f0 b) -> Clown f a a0 -> f0 (Clown f a b) Source # sequenceA :: Applicative f0 => Clown f a (f0 a0) -> f0 (Clown f a a0) Source # mapM :: Monad m => (a0 -> m b) -> Clown f a a0 -> m (Clown f a b) Source # sequence :: Monad m => Clown f a (m a0) -> m (Clown f a a0) Source #
Bitraversable p => Traversable (Flip p a) |
Instance details Defined in Data.Bifunctor.Flip Methods traverse :: Applicative f => (a0 -> f b) -> Flip p a a0 -> f (Flip p a b) Source # sequenceA :: Applicative f => Flip p a (f a0) -> f (Flip p a a0) Source # mapM :: Monad m => (a0 -> m b) -> Flip p a a0 -> m (Flip p a b) Source # sequence :: Monad m => Flip p a (m a0) -> m (Flip p a a0) Source #
Traversable g => Traversable (Joker g a) |
Instance details Defined in Data.Bifunctor.Joker Methods traverse :: Applicative f => (a0 -> f b) -> Joker g a a0 -> f (Joker g a b) Source # sequenceA :: Applicative f => Joker g a (f a0) -> f (Joker g a a0) Source # mapM :: Monad m => (a0 -> m b) -> Joker g a a0 -> m (Joker g a b) Source # sequence :: Monad m => Joker g a (m a0) -> m (Joker g a a0) Source #
Bitraversable p => Traversable (WrappedBifunctor p a) |

Instance details

Defined in Data.Bifunctor.Wrapped

Methods

traverse :: Applicative f => (a0 -> f b) -> WrappedBifunctor p a a0 -> f (WrappedBifunctor p a b) Source #

sequenceA :: Applicative f => WrappedBifunctor p a (f a0) -> f (WrappedBifunctor p a a0) Source #

mapM :: Monad m => (a0 -> m b) -> WrappedBifunctor p a a0 -> m (WrappedBifunctor p a b) Source #

sequence :: Monad m => WrappedBifunctor p a (m a0) -> m (WrappedBifunctor p a a0) Source #

(Traversable f, Traversable g) => Traversable (f :.: g) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> (f :.: g) a -> f0 ((f :.: g) b) Source # sequenceA :: Applicative f0 => (f :.: g) (f0 a) -> f0 ((f :.: g) a) Source # mapM :: Monad m => (a -> m b) -> (f :.: g) a -> m ((f :.: g) b) Source # sequence :: Monad m => (f :.: g) (m a) -> m ((f :.: g) a) Source #
Traversable f => Traversable (M1 i c f) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> M1 i c f a -> f0 (M1 i c f b) Source # sequenceA :: Applicative f0 => M1 i c f (f0 a) -> f0 (M1 i c f a) Source # mapM :: Monad m => (a -> m b) -> M1 i c f a -> m (M1 i c f b) Source # sequence :: Monad m => M1 i c f (m a) -> m (M1 i c f a) Source #
(Traversable (f a), Traversable (g a)) => Traversable (Product f g a) |

Instance details

Defined in Data.Bifunctor.Product

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> Product f g a a0 -> f0 (Product f g a b) Source #

sequenceA :: Applicative f0 => Product f g a (f0 a0) -> f0 (Product f g a a0) Source #

mapM :: Monad m => (a0 -> m b) -> Product f g a a0 -> m (Product f g a b) Source #

sequence :: Monad m => Product f g a (m a0) -> m (Product f g a a0) Source #

(Traversable (f a), Traversable (g a)) => Traversable (Sum f g a) |
Instance details Defined in Data.Bifunctor.Sum Methods traverse :: Applicative f0 => (a0 -> f0 b) -> Sum f g a a0 -> f0 (Sum f g a b) Source # sequenceA :: Applicative f0 => Sum f g a (f0 a0) -> f0 (Sum f g a a0) Source # mapM :: Monad m => (a0 -> m b) -> Sum f g a a0 -> m (Sum f g a b) Source # sequence :: Monad m => Sum f g a (m a0) -> m (Sum f g a a0) Source #
(Traversable f, Bitraversable p) => Traversable (Tannen f p a) |
Instance details Defined in Data.Bifunctor.Tannen Methods traverse :: Applicative f0 => (a0 -> f0 b) -> Tannen f p a a0 -> f0 (Tannen f p a b) Source # sequenceA :: Applicative f0 => Tannen f p a (f0 a0) -> f0 (Tannen f p a a0) Source # mapM :: Monad m => (a0 -> m b) -> Tannen f p a a0 -> m (Tannen f p a b) Source # sequence :: Monad m => Tannen f p a (m a0) -> m (Tannen f p a a0) Source #
(Bitraversable p, Traversable g) => Traversable (Biff p f g a) |
Instance details Defined in Data.Bifunctor.Biff Methods traverse :: Applicative f0 => (a0 -> f0 b) -> Biff p f g a a0 -> f0 (Biff p f g a b) Source # sequenceA :: Applicative f0 => Biff p f g a (f0 a0) -> f0 (Biff p f g a a0) Source # mapM :: Monad m => (a0 -> m b) -> Biff p f g a a0 -> m (Biff p f g a b) Source # sequence :: Monad m => Biff p f g a (m a0) -> m (Biff p f g a a0) Source #

cycle :: HasCallStack => [a] -> [a] Source #

`cycle` ties a finite list into a circular one, or equivalently, the infinite repetition of the original list. It is the identity on infinite lists.

#### Examples

Expand

    >>> cycle []
    *** Exception: Prelude.cycle: empty list

    >>> take 10 (cycle [42])
    [42,42,42,42,42,42,42,42,42,42]

    >>> take 10 (cycle [2, 5, 7])
    [2,5,7,2,5,7,2,5,7,2]

    >>> take 1 (cycle (42 : undefined))
    [42]

const :: a -> b -> a Source #

`const x y` always evaluates to `x`, ignoring its second argument.

    const x = \_ -> x

This function might seem useless at first glance, but it can be very useful in a higher order context.

#### Examples

Expand

    >>> const 42 "hello"
    42

    >>> map (const 42) [0..3]
    [42,42,42,42]

seq :: a -> b -> b infixr 0 Source #

The value of ``seq` a b` is bottom if `a` is bottom, and otherwise equal to `b`. In other words, it evaluates the first argument `a` to weak head normal form (WHNF). `seq` is usually introduced to improve performance by avoiding unneeded laziness.

A note on evaluation order: the expression ``seq` a b` does not guarantee that `a` will be evaluated before `b`. The only guarantee given by `seq` is that the both `a` and `b` will be evaluated before `seq` returns a value. In particular, this means that `b` may be evaluated before `a`. If you need to guarantee a specific order of evaluation, you must use the function `pseq` from the "parallel" package.

concat :: Foldable t => t [a] -> [a] Source #

The concatenation of all the elements of a container of lists.

#### Examples

Expand

Basic usage:

    >>> concat (Just [1, 2, 3])
    [1,2,3]

    >>> concat (Left 42)
    []

    >>> concat [[1, 2, 3], [4, 5], [6], []]
    [1,2,3,4,5,6]

filter :: (a -> Bool) -> [a] -> [a] Source #

\(\mathcal{O}(n)\). `filter`, applied to a predicate and a list, returns the list of those elements that satisfy the predicate; i.e.,

    filter p xs = [ x | x <- xs, p x]

#### Examples

Expand

    >>> filter odd [1, 2, 3]
    [1,3]

    >>> filter (\l -> length l > 3) ["Hello", ", ", "World", "!"]
    ["Hello","World"]

    >>> filter (/= 3) [1, 2, 3, 4, 3, 2, 1]
    [1,2,4,2,1]

zip :: [a] -> [b] -> [(a, b)] Source #

\(\mathcal{O}(\min(m,n))\). `zip` takes two lists and returns a list of corresponding pairs.

`zip` is right-lazy:

    >>> zip [] undefined
    []
    >>> zip undefined []
    *** Exception: Prelude.undefined
    ...

`zip` is capable of list fusion, but it is restricted to its first list argument and its resulting list.

#### Examples

Expand

    >>> zip [1, 2, 3] ['a', 'b', 'c']
    [(1,'a'),(2,'b'),(3,'c')]

If one input list is shorter than the other, excess elements of the longer list are discarded, even if one of the lists is infinite:

    >>> zip [1] ['a', 'b']
    [(1,'a')]

    >>> zip [1, 2] ['a']
    [(1,'a')]

    >>> zip [] [1..]
    []

    >>> zip [1..] []
    []

print :: Show a => a -> IO () Source #

The `print` function outputs a value of any printable type to the standard output device. Printable types are those that are instances of class `Show`; `print` converts values to strings for output using the `show` operation and adds a newline.

For example, a program to print the first 20 integers and their powers of 2 could be written as:

    main = print ([(n, 2^n) | n <- [0..19]])

class Num a where Source #

Basic numeric class.

The Haskell Report defines no laws for `Num`. However, `(`+`)` and `(`*`)` are customarily expected to define a ring and have the following properties:

Associativity of `(`+`)`
  `(x + y) + z` = `x + (y + z)`
Commutativity of `(`+`)`
  `x + y` = `y + x`
``fromInteger` 0` is the additive identity
  `x + fromInteger 0` = `x`
`negate` gives the additive inverse
  `x + negate x` = `fromInteger 0`
Associativity of `(`*`)`
  `(x * y) * z` = `x * (y * z)`
``fromInteger` 1` is the multiplicative identity
  `x * fromInteger 1` = `x` and `fromInteger 1 * x` = `x`
Distributivity of `(`*`)` with respect to `(`+`)`
  `a * (b + c)` = `(a * b) + (a * c)` and `(b + c) * a` = `(b * a) + (c * a)`
Coherence with `toInteger`
  if the type also implements `Integral`, then `fromInteger` is a left inverse for `toInteger`, i.e. `fromInteger (toInteger i) == i`

Note that it isn't customarily expected that a type instance of both `Num` and `Ord` implement an ordered ring. Indeed, in `base` only `Integer` and `Rational` do.

Minimal complete definition

(+), (*), abs, signum, fromInteger, (negate | (-))

Methods

(+) :: a -> a -> a infixl 6 Source #

(-) :: a -> a -> a infixl 6 Source #

(*) :: a -> a -> a infixl 7 Source #

negate :: a -> a Source #

Unary negation.

abs :: a -> a Source #

Absolute value.

signum :: a -> a Source #

Sign of a number. The functions `abs` and `signum` should satisfy the law:

    abs x * signum x == x

For real numbers, the `signum` is either `-1` (negative), `0` (zero) or `1` (positive).

fromInteger :: Integer -> a Source #

Conversion from an `Integer`. An integer literal represents the application of the function `fromInteger` to the appropriate value of type `Integer`, so such literals have type `(`Num` a) => a`.

#### Instances

Instances details

Num Dice Source # |
Instance details Defined in Game.LambdaHack.Core.Dice Methods (+) :: Dice -> Dice -> Dice Source # (-) :: Dice -> Dice -> Dice Source # (*) :: Dice -> Dice -> Dice Source # negate :: Dice -> Dice Source # abs :: Dice -> Dice Source # signum :: Dice -> Dice Source # fromInteger :: Integer -> Dice Source #
Num OrdA |
Instance details Defined in Test.QuickCheck.Poly Methods (+) :: OrdA -> OrdA -> OrdA Source # (-) :: OrdA -> OrdA -> OrdA Source # (*) :: OrdA -> OrdA -> OrdA Source # negate :: OrdA -> OrdA Source # abs :: OrdA -> OrdA Source # signum :: OrdA -> OrdA Source # fromInteger :: Integer -> OrdA Source #
Num OrdB |
Instance details Defined in Test.QuickCheck.Poly Methods (+) :: OrdB -> OrdB -> OrdB Source # (-) :: OrdB -> OrdB -> OrdB Source # (*) :: OrdB -> OrdB -> OrdB Source # negate :: OrdB -> OrdB Source # abs :: OrdB -> OrdB Source # signum :: OrdB -> OrdB Source # fromInteger :: Integer -> OrdB Source #
Num OrdC |
Instance details Defined in Test.QuickCheck.Poly Methods (+) :: OrdC -> OrdC -> OrdC Source # (-) :: OrdC -> OrdC -> OrdC Source # (*) :: OrdC -> OrdC -> OrdC Source # negate :: OrdC -> OrdC Source # abs :: OrdC -> OrdC Source # signum :: OrdC -> OrdC Source # fromInteger :: Integer -> OrdC Source #
Num CBool |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CBool -> CBool -> CBool Source # (-) :: CBool -> CBool -> CBool Source # (*) :: CBool -> CBool -> CBool Source # negate :: CBool -> CBool Source # abs :: CBool -> CBool Source # signum :: CBool -> CBool Source # fromInteger :: Integer -> CBool Source #
Num CChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CChar -> CChar -> CChar Source # (-) :: CChar -> CChar -> CChar Source # (*) :: CChar -> CChar -> CChar Source # negate :: CChar -> CChar Source # abs :: CChar -> CChar Source # signum :: CChar -> CChar Source # fromInteger :: Integer -> CChar Source #
Num CClock |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CClock -> CClock -> CClock Source # (-) :: CClock -> CClock -> CClock Source # (*) :: CClock -> CClock -> CClock Source # negate :: CClock -> CClock Source # abs :: CClock -> CClock Source # signum :: CClock -> CClock Source # fromInteger :: Integer -> CClock Source #
Num CDouble |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CDouble -> CDouble -> CDouble Source # (-) :: CDouble -> CDouble -> CDouble Source # (*) :: CDouble -> CDouble -> CDouble Source # negate :: CDouble -> CDouble Source # abs :: CDouble -> CDouble Source # signum :: CDouble -> CDouble Source # fromInteger :: Integer -> CDouble Source #
Num CFloat |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CFloat -> CFloat -> CFloat Source # (-) :: CFloat -> CFloat -> CFloat Source # (*) :: CFloat -> CFloat -> CFloat Source # negate :: CFloat -> CFloat Source # abs :: CFloat -> CFloat Source # signum :: CFloat -> CFloat Source # fromInteger :: Integer -> CFloat Source #
Num CInt |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CInt -> CInt -> CInt Source # (-) :: CInt -> CInt -> CInt Source # (*) :: CInt -> CInt -> CInt Source # negate :: CInt -> CInt Source # abs :: CInt -> CInt Source # signum :: CInt -> CInt Source # fromInteger :: Integer -> CInt Source #
Num CIntMax |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CIntMax -> CIntMax -> CIntMax Source # (-) :: CIntMax -> CIntMax -> CIntMax Source # (*) :: CIntMax -> CIntMax -> CIntMax Source # negate :: CIntMax -> CIntMax Source # abs :: CIntMax -> CIntMax Source # signum :: CIntMax -> CIntMax Source # fromInteger :: Integer -> CIntMax Source #
Num CIntPtr |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CIntPtr -> CIntPtr -> CIntPtr Source # (-) :: CIntPtr -> CIntPtr -> CIntPtr Source # (*) :: CIntPtr -> CIntPtr -> CIntPtr Source # negate :: CIntPtr -> CIntPtr Source # abs :: CIntPtr -> CIntPtr Source # signum :: CIntPtr -> CIntPtr Source # fromInteger :: Integer -> CIntPtr Source #
Num CLLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CLLong -> CLLong -> CLLong Source # (-) :: CLLong -> CLLong -> CLLong Source # (*) :: CLLong -> CLLong -> CLLong Source # negate :: CLLong -> CLLong Source # abs :: CLLong -> CLLong Source # signum :: CLLong -> CLLong Source # fromInteger :: Integer -> CLLong Source #
Num CLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CLong -> CLong -> CLong Source # (-) :: CLong -> CLong -> CLong Source # (*) :: CLong -> CLong -> CLong Source # negate :: CLong -> CLong Source # abs :: CLong -> CLong Source # signum :: CLong -> CLong Source # fromInteger :: Integer -> CLong Source #
Num CPtrdiff |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CPtrdiff -> CPtrdiff -> CPtrdiff Source # (-) :: CPtrdiff -> CPtrdiff -> CPtrdiff Source # (*) :: CPtrdiff -> CPtrdiff -> CPtrdiff Source # negate :: CPtrdiff -> CPtrdiff Source # abs :: CPtrdiff -> CPtrdiff Source # signum :: CPtrdiff -> CPtrdiff Source # fromInteger :: Integer -> CPtrdiff Source #
Num CSChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CSChar -> CSChar -> CSChar Source # (-) :: CSChar -> CSChar -> CSChar Source # (*) :: CSChar -> CSChar -> CSChar Source # negate :: CSChar -> CSChar Source # abs :: CSChar -> CSChar Source # signum :: CSChar -> CSChar Source # fromInteger :: Integer -> CSChar Source #
Num CSUSeconds |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

(+) :: CSUSeconds -> CSUSeconds -> CSUSeconds Source #

(-) :: CSUSeconds -> CSUSeconds -> CSUSeconds Source #

(*) :: CSUSeconds -> CSUSeconds -> CSUSeconds Source #

negate :: CSUSeconds -> CSUSeconds Source #

abs :: CSUSeconds -> CSUSeconds Source #

signum :: CSUSeconds -> CSUSeconds Source #

fromInteger :: Integer -> CSUSeconds Source #

Num CShort |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CShort -> CShort -> CShort Source # (-) :: CShort -> CShort -> CShort Source # (*) :: CShort -> CShort -> CShort Source # negate :: CShort -> CShort Source # abs :: CShort -> CShort Source # signum :: CShort -> CShort Source # fromInteger :: Integer -> CShort Source #
Num CSigAtomic |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

(+) :: CSigAtomic -> CSigAtomic -> CSigAtomic Source #

(-) :: CSigAtomic -> CSigAtomic -> CSigAtomic Source #

(*) :: CSigAtomic -> CSigAtomic -> CSigAtomic Source #

negate :: CSigAtomic -> CSigAtomic Source #

abs :: CSigAtomic -> CSigAtomic Source #

signum :: CSigAtomic -> CSigAtomic Source #

fromInteger :: Integer -> CSigAtomic Source #

Num CSize |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CSize -> CSize -> CSize Source # (-) :: CSize -> CSize -> CSize Source # (*) :: CSize -> CSize -> CSize Source # negate :: CSize -> CSize Source # abs :: CSize -> CSize Source # signum :: CSize -> CSize Source # fromInteger :: Integer -> CSize Source #
Num CTime |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CTime -> CTime -> CTime Source # (-) :: CTime -> CTime -> CTime Source # (*) :: CTime -> CTime -> CTime Source # negate :: CTime -> CTime Source # abs :: CTime -> CTime Source # signum :: CTime -> CTime Source # fromInteger :: Integer -> CTime Source #
Num CUChar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CUChar -> CUChar -> CUChar Source # (-) :: CUChar -> CUChar -> CUChar Source # (*) :: CUChar -> CUChar -> CUChar Source # negate :: CUChar -> CUChar Source # abs :: CUChar -> CUChar Source # signum :: CUChar -> CUChar Source # fromInteger :: Integer -> CUChar Source #
Num CUInt |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CUInt -> CUInt -> CUInt Source # (-) :: CUInt -> CUInt -> CUInt Source # (*) :: CUInt -> CUInt -> CUInt Source # negate :: CUInt -> CUInt Source # abs :: CUInt -> CUInt Source # signum :: CUInt -> CUInt Source # fromInteger :: Integer -> CUInt Source #
Num CUIntMax |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CUIntMax -> CUIntMax -> CUIntMax Source # (-) :: CUIntMax -> CUIntMax -> CUIntMax Source # (*) :: CUIntMax -> CUIntMax -> CUIntMax Source # negate :: CUIntMax -> CUIntMax Source # abs :: CUIntMax -> CUIntMax Source # signum :: CUIntMax -> CUIntMax Source # fromInteger :: Integer -> CUIntMax Source #
Num CUIntPtr |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CUIntPtr -> CUIntPtr -> CUIntPtr Source # (-) :: CUIntPtr -> CUIntPtr -> CUIntPtr Source # (*) :: CUIntPtr -> CUIntPtr -> CUIntPtr Source # negate :: CUIntPtr -> CUIntPtr Source # abs :: CUIntPtr -> CUIntPtr Source # signum :: CUIntPtr -> CUIntPtr Source # fromInteger :: Integer -> CUIntPtr Source #
Num CULLong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CULLong -> CULLong -> CULLong Source # (-) :: CULLong -> CULLong -> CULLong Source # (*) :: CULLong -> CULLong -> CULLong Source # negate :: CULLong -> CULLong Source # abs :: CULLong -> CULLong Source # signum :: CULLong -> CULLong Source # fromInteger :: Integer -> CULLong Source #
Num CULong |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CULong -> CULong -> CULong Source # (-) :: CULong -> CULong -> CULong Source # (*) :: CULong -> CULong -> CULong Source # negate :: CULong -> CULong Source # abs :: CULong -> CULong Source # signum :: CULong -> CULong Source # fromInteger :: Integer -> CULong Source #
Num CUSeconds |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CUSeconds -> CUSeconds -> CUSeconds Source # (-) :: CUSeconds -> CUSeconds -> CUSeconds Source # (*) :: CUSeconds -> CUSeconds -> CUSeconds Source # negate :: CUSeconds -> CUSeconds Source # abs :: CUSeconds -> CUSeconds Source # signum :: CUSeconds -> CUSeconds Source # fromInteger :: Integer -> CUSeconds Source #
Num CUShort |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CUShort -> CUShort -> CUShort Source # (-) :: CUShort -> CUShort -> CUShort Source # (*) :: CUShort -> CUShort -> CUShort Source # negate :: CUShort -> CUShort Source # abs :: CUShort -> CUShort Source # signum :: CUShort -> CUShort Source # fromInteger :: Integer -> CUShort Source #
Num CWchar |
Instance details Defined in GHC.Internal.Foreign.C.Types Methods (+) :: CWchar -> CWchar -> CWchar Source # (-) :: CWchar -> CWchar -> CWchar Source # (*) :: CWchar -> CWchar -> CWchar Source # negate :: CWchar -> CWchar Source # abs :: CWchar -> CWchar Source # signum :: CWchar -> CWchar Source # fromInteger :: Integer -> CWchar Source #
Num Int16 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods (+) :: Int16 -> Int16 -> Int16 Source # (-) :: Int16 -> Int16 -> Int16 Source # (*) :: Int16 -> Int16 -> Int16 Source # negate :: Int16 -> Int16 Source # abs :: Int16 -> Int16 Source # signum :: Int16 -> Int16 Source # fromInteger :: Integer -> Int16 Source #
Num Int32 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods (+) :: Int32 -> Int32 -> Int32 Source # (-) :: Int32 -> Int32 -> Int32 Source # (*) :: Int32 -> Int32 -> Int32 Source # negate :: Int32 -> Int32 Source # abs :: Int32 -> Int32 Source # signum :: Int32 -> Int32 Source # fromInteger :: Integer -> Int32 Source #
Num Int64 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods (+) :: Int64 -> Int64 -> Int64 Source # (-) :: Int64 -> Int64 -> Int64 Source # (*) :: Int64 -> Int64 -> Int64 Source # negate :: Int64 -> Int64 Source # abs :: Int64 -> Int64 Source # signum :: Int64 -> Int64 Source # fromInteger :: Integer -> Int64 Source #
Num Int8 | Since: base-2.1
Instance details Defined in GHC.Internal.Int Methods (+) :: Int8 -> Int8 -> Int8 Source # (-) :: Int8 -> Int8 -> Int8 Source # (*) :: Int8 -> Int8 -> Int8 Source # negate :: Int8 -> Int8 Source # abs :: Int8 -> Int8 Source # signum :: Int8 -> Int8 Source # fromInteger :: Integer -> Int8 Source #
Num Word16 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods (+) :: Word16 -> Word16 -> Word16 Source # (-) :: Word16 -> Word16 -> Word16 Source # (*) :: Word16 -> Word16 -> Word16 Source # negate :: Word16 -> Word16 Source # abs :: Word16 -> Word16 Source # signum :: Word16 -> Word16 Source # fromInteger :: Integer -> Word16 Source #
Num Word32 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods (+) :: Word32 -> Word32 -> Word32 Source # (-) :: Word32 -> Word32 -> Word32 Source # (*) :: Word32 -> Word32 -> Word32 Source # negate :: Word32 -> Word32 Source # abs :: Word32 -> Word32 Source # signum :: Word32 -> Word32 Source # fromInteger :: Integer -> Word32 Source #
Num Word64 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods (+) :: Word64 -> Word64 -> Word64 Source # (-) :: Word64 -> Word64 -> Word64 Source # (*) :: Word64 -> Word64 -> Word64 Source # negate :: Word64 -> Word64 Source # abs :: Word64 -> Word64 Source # signum :: Word64 -> Word64 Source # fromInteger :: Integer -> Word64 Source #
Num Word8 | Since: base-2.1
Instance details Defined in GHC.Internal.Word Methods (+) :: Word8 -> Word8 -> Word8 Source # (-) :: Word8 -> Word8 -> Word8 Source # (*) :: Word8 -> Word8 -> Word8 Source # negate :: Word8 -> Word8 Source # abs :: Word8 -> Word8 Source # signum :: Word8 -> Word8 Source # fromInteger :: Integer -> Word8 Source #
Num Scientific |
Instance details Defined in Data.Scientific Methods (+) :: Scientific -> Scientific -> Scientific Source # (-) :: Scientific -> Scientific -> Scientific Source # (*) :: Scientific -> Scientific -> Scientific Source # negate :: Scientific -> Scientific Source # abs :: Scientific -> Scientific Source # signum :: Scientific -> Scientific Source # fromInteger :: Integer -> Scientific Source #
Num Exp |
Instance details Defined in Data.Reflection Methods (+) :: Exp -> Exp -> Exp Source # (-) :: Exp -> Exp -> Exp Source # (*) :: Exp -> Exp -> Exp Source # negate :: Exp -> Exp Source # abs :: Exp -> Exp Source # signum :: Exp -> Exp Source # fromInteger :: Integer -> Exp Source #
Num Type |
Instance details Defined in Data.Reflection Methods (+) :: Type -> Type -> Type Source # (-) :: Type -> Type -> Type Source # (*) :: Type -> Type -> Type Source # negate :: Type -> Type Source # abs :: Type -> Type Source # signum :: Type -> Type Source # fromInteger :: Integer -> Type Source #
Num I8 |
Instance details Defined in Data.Text.Foreign Methods (+) :: I8 -> I8 -> I8 Source # (-) :: I8 -> I8 -> I8 Source # (*) :: I8 -> I8 -> I8 Source # negate :: I8 -> I8 Source # abs :: I8 -> I8 Source # signum :: I8 -> I8 Source # fromInteger :: Integer -> I8 Source #
Num Size |
Instance details Defined in Data.Text.Internal.Fusion.Size Methods (+) :: Size -> Size -> Size Source # (-) :: Size -> Size -> Size Source # (*) :: Size -> Size -> Size Source # negate :: Size -> Size Source # abs :: Size -> Size Source # signum :: Size -> Size Source # fromInteger :: Integer -> Size Source #
Num B |
Instance details Defined in Data.Text.Short.Internal Methods (+) :: B -> B -> B Source # (-) :: B -> B -> B Source # (*) :: B -> B -> B Source # negate :: B -> B Source # abs :: B -> B Source # signum :: B -> B Source # fromInteger :: Integer -> B Source #
Num DiffTime |
Instance details Defined in Data.Time.Clock.Internal.DiffTime Methods (+) :: DiffTime -> DiffTime -> DiffTime Source # (-) :: DiffTime -> DiffTime -> DiffTime Source # (*) :: DiffTime -> DiffTime -> DiffTime Source # negate :: DiffTime -> DiffTime Source # abs :: DiffTime -> DiffTime Source # signum :: DiffTime -> DiffTime Source # fromInteger :: Integer -> DiffTime Source #
Num NominalDiffTime |

Instance details

Defined in Data.Time.Clock.Internal.NominalDiffTime

Methods

(+) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime Source #

(-) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime Source #

(*) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime Source #

negate :: NominalDiffTime -> NominalDiffTime Source #

abs :: NominalDiffTime -> NominalDiffTime Source #

signum :: NominalDiffTime -> NominalDiffTime Source #

fromInteger :: Integer -> NominalDiffTime Source #

Num Size |
Instance details Defined in Data.Vector.Fusion.Bundle.Size Methods (+) :: Size -> Size -> Size Source # (-) :: Size -> Size -> Size Source # (*) :: Size -> Size -> Size Source # negate :: Size -> Size Source # abs :: Size -> Size Source # signum :: Size -> Size Source # fromInteger :: Integer -> Size Source #
Num Integer | Since: base-2.1
Instance details Defined in GHC.Internal.Num Methods (+) :: Integer -> Integer -> Integer Source # (-) :: Integer -> Integer -> Integer Source # (*) :: Integer -> Integer -> Integer Source # negate :: Integer -> Integer Source # abs :: Integer -> Integer Source # signum :: Integer -> Integer Source # fromInteger :: Integer -> Integer Source #
Num Natural | Note that `Natural`'s `Num` instance isn't a ring: no element but 0 has an additive inverse. It is a semiring though. Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Num Methods (+) :: Natural -> Natural -> Natural Source # (-) :: Natural -> Natural -> Natural Source # (*) :: Natural -> Natural -> Natural Source # negate :: Natural -> Natural Source # abs :: Natural -> Natural Source # signum :: Natural -> Natural Source # fromInteger :: Integer -> Natural Source #

Num Double

This instance implements IEEE 754 standard with all its usual pitfalls about NaN, infinities and negative zero. Neither addition nor multiplication are associative or distributive:

    >>> (0.1 + 0.1) + 0.4 == 0.1 + (0.1 + 0.4)
    False
    >>> (0.1 + 0.2) * 0.3 == 0.1 * 0.3 + 0.2 * 0.3
    False
    >>> (0.1 * 0.1) * 0.3 == 0.1 * (0.1 * 0.3)
    False

Since: base-2.1

Instance details Defined in GHC.Internal.Float Methods (+) :: Double -> Double -> Double Source # (-) :: Double -> Double -> Double Source # (*) :: Double -> Double -> Double Source # negate :: Double -> Double Source # abs :: Double -> Double Source # signum :: Double -> Double Source # fromInteger :: Integer -> Double Source #

Num Float

This instance implements IEEE 754 standard with all its usual pitfalls about NaN, infinities and negative zero. Neither addition nor multiplication are associative or distributive:

    >>> (0.1 + 0.1 :: Float) + 0.5 == 0.1 + (0.1 + 0.5)
    False
    >>> (0.1 + 0.2 :: Float) * 0.9 == 0.1 * 0.9 + 0.2 * 0.9
    False
    >>> (0.1 * 0.1 :: Float) * 0.9 == 0.1 * (0.1 * 0.9)
    False

Since: base-2.1

Instance details Defined in GHC.Internal.Float Methods (+) :: Float -> Float -> Float Source # (-) :: Float -> Float -> Float Source # (*) :: Float -> Float -> Float Source # negate :: Float -> Float Source # abs :: Float -> Float Source # signum :: Float -> Float Source # fromInteger :: Integer -> Float Source #
Num Int | Since: base-2.1
Instance details Defined in GHC.Internal.Num Methods (+) :: Int -> Int -> Int Source # (-) :: Int -> Int -> Int Source # (*) :: Int -> Int -> Int Source # negate :: Int -> Int Source # abs :: Int -> Int Source # signum :: Int -> Int Source # fromInteger :: Integer -> Int Source #
Num Word | Since: base-2.1
Instance details Defined in GHC.Internal.Num Methods (+) :: Word -> Word -> Word Source # (-) :: Word -> Word -> Word Source # (*) :: Word -> Word -> Word Source # negate :: Word -> Word Source # abs :: Word -> Word Source # signum :: Word -> Word Source # fromInteger :: Integer -> Word Source #
Num a => Num (Blind a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods (+) :: Blind a -> Blind a -> Blind a Source # (-) :: Blind a -> Blind a -> Blind a Source # (*) :: Blind a -> Blind a -> Blind a Source # negate :: Blind a -> Blind a Source # abs :: Blind a -> Blind a Source # signum :: Blind a -> Blind a Source # fromInteger :: Integer -> Blind a Source #
Num a => Num (Fixed a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods (+) :: Fixed a -> Fixed a -> Fixed a Source # (-) :: Fixed a -> Fixed a -> Fixed a Source # (*) :: Fixed a -> Fixed a -> Fixed a Source # negate :: Fixed a -> Fixed a Source # abs :: Fixed a -> Fixed a Source # signum :: Fixed a -> Fixed a Source # fromInteger :: Integer -> Fixed a Source #
Num a => Num (Large a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods (+) :: Large a -> Large a -> Large a Source # (-) :: Large a -> Large a -> Large a Source # (*) :: Large a -> Large a -> Large a Source # negate :: Large a -> Large a Source # abs :: Large a -> Large a Source # signum :: Large a -> Large a Source # fromInteger :: Integer -> Large a Source #
Num a => Num (Shrink2 a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods (+) :: Shrink2 a -> Shrink2 a -> Shrink2 a Source # (-) :: Shrink2 a -> Shrink2 a -> Shrink2 a Source # (*) :: Shrink2 a -> Shrink2 a -> Shrink2 a Source # negate :: Shrink2 a -> Shrink2 a Source # abs :: Shrink2 a -> Shrink2 a Source # signum :: Shrink2 a -> Shrink2 a Source # fromInteger :: Integer -> Shrink2 a Source #
Num a => Num (Small a) |
Instance details Defined in Test.QuickCheck.Modifiers Methods (+) :: Small a -> Small a -> Small a Source # (-) :: Small a -> Small a -> Small a Source # (*) :: Small a -> Small a -> Small a Source # negate :: Small a -> Small a Source # abs :: Small a -> Small a Source # signum :: Small a -> Small a Source # fromInteger :: Integer -> Small a Source #
RealFloat a => Num (Complex a) | Since: base-2.1
Instance details Defined in Data.Complex Methods (+) :: Complex a -> Complex a -> Complex a Source # (-) :: Complex a -> Complex a -> Complex a Source # (*) :: Complex a -> Complex a -> Complex a Source # negate :: Complex a -> Complex a Source # abs :: Complex a -> Complex a Source # signum :: Complex a -> Complex a Source # fromInteger :: Integer -> Complex a Source #
Num a => Num (Max a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (+) :: Max a -> Max a -> Max a Source # (-) :: Max a -> Max a -> Max a Source # (*) :: Max a -> Max a -> Max a Source # negate :: Max a -> Max a Source # abs :: Max a -> Max a Source # signum :: Max a -> Max a Source # fromInteger :: Integer -> Max a Source #
Num a => Num (Min a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (+) :: Min a -> Min a -> Min a Source # (-) :: Min a -> Min a -> Min a Source # (*) :: Min a -> Min a -> Min a Source # negate :: Min a -> Min a Source # abs :: Min a -> Min a Source # signum :: Min a -> Min a Source # fromInteger :: Integer -> Min a Source #
Num n => Num (VarInt n) |
Instance details Defined in Data.Bytes.VarInt Methods (+) :: VarInt n -> VarInt n -> VarInt n Source # (-) :: VarInt n -> VarInt n -> VarInt n Source # (*) :: VarInt n -> VarInt n -> VarInt n Source # negate :: VarInt n -> VarInt n Source # abs :: VarInt n -> VarInt n Source # signum :: VarInt n -> VarInt n Source # fromInteger :: Integer -> VarInt n Source #
Num a => Num (Identity a) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Identity

Methods

(+) :: Identity a -> Identity a -> Identity a Source #

(-) :: Identity a -> Identity a -> Identity a Source #

(*) :: Identity a -> Identity a -> Identity a Source #

negate :: Identity a -> Identity a Source #

abs :: Identity a -> Identity a Source #

signum :: Identity a -> Identity a Source #

fromInteger :: Integer -> Identity a Source #

Num a => Num (Down a) | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Data.Ord Methods (+) :: Down a -> Down a -> Down a Source # (-) :: Down a -> Down a -> Down a Source # (*) :: Down a -> Down a -> Down a Source # negate :: Down a -> Down a Source # abs :: Down a -> Down a Source # signum :: Down a -> Down a Source # fromInteger :: Integer -> Down a Source #
Num a => Num (Product a) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (+) :: Product a -> Product a -> Product a Source # (-) :: Product a -> Product a -> Product a Source # (*) :: Product a -> Product a -> Product a Source # negate :: Product a -> Product a Source # abs :: Product a -> Product a Source # signum :: Product a -> Product a Source # fromInteger :: Integer -> Product a Source #
Num a => Num (Sum a) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (+) :: Sum a -> Sum a -> Sum a Source # (-) :: Sum a -> Sum a -> Sum a Source # (*) :: Sum a -> Sum a -> Sum a Source # negate :: Sum a -> Sum a Source # abs :: Sum a -> Sum a Source # signum :: Sum a -> Sum a Source # fromInteger :: Integer -> Sum a Source #
Integral a => Num (Ratio a) | Since: base-2.0.1
Instance details Defined in GHC.Internal.Real Methods (+) :: Ratio a -> Ratio a -> Ratio a Source # (-) :: Ratio a -> Ratio a -> Ratio a Source # (*) :: Ratio a -> Ratio a -> Ratio a Source # negate :: Ratio a -> Ratio a Source # abs :: Ratio a -> Ratio a Source # signum :: Ratio a -> Ratio a Source # fromInteger :: Integer -> Ratio a Source #
Num a => Num (Plucker a) |
Instance details Defined in Linear.Plucker Methods (+) :: Plucker a -> Plucker a -> Plucker a Source # (-) :: Plucker a -> Plucker a -> Plucker a Source # (*) :: Plucker a -> Plucker a -> Plucker a Source # negate :: Plucker a -> Plucker a Source # abs :: Plucker a -> Plucker a Source # signum :: Plucker a -> Plucker a Source # fromInteger :: Integer -> Plucker a Source #
RealFloat a => Num (Quaternion a) |

Instance details

Defined in Linear.Quaternion

Methods

(+) :: Quaternion a -> Quaternion a -> Quaternion a Source #

(-) :: Quaternion a -> Quaternion a -> Quaternion a Source #

(*) :: Quaternion a -> Quaternion a -> Quaternion a Source #

negate :: Quaternion a -> Quaternion a Source #

abs :: Quaternion a -> Quaternion a Source #

signum :: Quaternion a -> Quaternion a Source #

fromInteger :: Integer -> Quaternion a Source #

Num (V0 a) |
Instance details Defined in Linear.V0 Methods (+) :: V0 a -> V0 a -> V0 a Source # (-) :: V0 a -> V0 a -> V0 a Source # (*) :: V0 a -> V0 a -> V0 a Source # negate :: V0 a -> V0 a Source # abs :: V0 a -> V0 a Source # signum :: V0 a -> V0 a Source # fromInteger :: Integer -> V0 a Source #
Num a => Num (V1 a) |
Instance details Defined in Linear.V1 Methods (+) :: V1 a -> V1 a -> V1 a Source # (-) :: V1 a -> V1 a -> V1 a Source # (*) :: V1 a -> V1 a -> V1 a Source # negate :: V1 a -> V1 a Source # abs :: V1 a -> V1 a Source # signum :: V1 a -> V1 a Source # fromInteger :: Integer -> V1 a Source #
Num a => Num (V2 a) |
Instance details Defined in Linear.V2 Methods (+) :: V2 a -> V2 a -> V2 a Source # (-) :: V2 a -> V2 a -> V2 a Source # (*) :: V2 a -> V2 a -> V2 a Source # negate :: V2 a -> V2 a Source # abs :: V2 a -> V2 a Source # signum :: V2 a -> V2 a Source # fromInteger :: Integer -> V2 a Source #
Num a => Num (V3 a) |
Instance details Defined in Linear.V3 Methods (+) :: V3 a -> V3 a -> V3 a Source # (-) :: V3 a -> V3 a -> V3 a Source # (*) :: V3 a -> V3 a -> V3 a Source # negate :: V3 a -> V3 a Source # abs :: V3 a -> V3 a Source # signum :: V3 a -> V3 a Source # fromInteger :: Integer -> V3 a Source #
Num a => Num (V4 a) |
Instance details Defined in Linear.V4 Methods (+) :: V4 a -> V4 a -> V4 a Source # (-) :: V4 a -> V4 a -> V4 a Source # (*) :: V4 a -> V4 a -> V4 a Source # negate :: V4 a -> V4 a Source # abs :: V4 a -> V4 a Source # signum :: V4 a -> V4 a Source # fromInteger :: Integer -> V4 a Source #
Num a => Num (V2 a) |
Instance details Defined in SDL.Internal.Vect Methods (+) :: V2 a -> V2 a -> V2 a Source # (-) :: V2 a -> V2 a -> V2 a Source # (*) :: V2 a -> V2 a -> V2 a Source # negate :: V2 a -> V2 a Source # abs :: V2 a -> V2 a Source # signum :: V2 a -> V2 a Source # fromInteger :: Integer -> V2 a Source #
Num a => Num (V3 a) |
Instance details Defined in SDL.Internal.Vect Methods (+) :: V3 a -> V3 a -> V3 a Source # (-) :: V3 a -> V3 a -> V3 a Source # (*) :: V3 a -> V3 a -> V3 a Source # negate :: V3 a -> V3 a Source # abs :: V3 a -> V3 a Source # signum :: V3 a -> V3 a Source # fromInteger :: Integer -> V3 a Source #
Num a => Num (V4 a) |
Instance details Defined in SDL.Internal.Vect Methods (+) :: V4 a -> V4 a -> V4 a Source # (-) :: V4 a -> V4 a -> V4 a Source # (*) :: V4 a -> V4 a -> V4 a Source # negate :: V4 a -> V4 a Source # abs :: V4 a -> V4 a Source # signum :: V4 a -> V4 a Source # fromInteger :: Integer -> V4 a Source #
Num a => Num (Q a) |
Instance details Defined in Data.Reflection Methods (+) :: Q a -> Q a -> Q a Source # (-) :: Q a -> Q a -> Q a Source # (*) :: Q a -> Q a -> Q a Source # negate :: Q a -> Q a Source # abs :: Q a -> Q a Source # signum :: Q a -> Q a Source # fromInteger :: Integer -> Q a Source #

HasResolution a => Num (Fixed a)

Multiplication is not associative or distributive:

    >>> (0.2 * 0.6 :: Deci) * 0.9 == 0.2 * (0.6 * 0.9)
    False

    >>> (0.1 + 0.1 :: Deci) * 0.5 == 0.1 * 0.5 + 0.1 * 0.5
    False

Since: base-2.1

Instance details Defined in Data.Fixed Methods (+) :: Fixed a -> Fixed a -> Fixed a Source # (-) :: Fixed a -> Fixed a -> Fixed a Source # (*) :: Fixed a -> Fixed a -> Fixed a Source # negate :: Fixed a -> Fixed a Source # abs :: Fixed a -> Fixed a Source # signum :: Fixed a -> Fixed a Source # fromInteger :: Integer -> Fixed a Source #
Num a => Num (Op a b) |
Instance details Defined in Data.Functor.Contravariant Methods (+) :: Op a b -> Op a b -> Op a b Source # (-) :: Op a b -> Op a b -> Op a b Source # (*) :: Op a b -> Op a b -> Op a b Source # negate :: Op a b -> Op a b Source # abs :: Op a b -> Op a b Source # signum :: Op a b -> Op a b Source # fromInteger :: Integer -> Op a b Source #
Num (f a) => Num (Point f a) |
Instance details Defined in Linear.Affine Methods (+) :: Point f a -> Point f a -> Point f a Source # (-) :: Point f a -> Point f a -> Point f a Source # (*) :: Point f a -> Point f a -> Point f a Source # negate :: Point f a -> Point f a Source # abs :: Point f a -> Point f a Source # signum :: Point f a -> Point f a Source # fromInteger :: Integer -> Point f a Source #
Num (f a) => Num (Point f a) |
Instance details Defined in SDL.Internal.Vect Methods (+) :: Point f a -> Point f a -> Point f a Source # (-) :: Point f a -> Point f a -> Point f a Source # (*) :: Point f a -> Point f a -> Point f a Source # negate :: Point f a -> Point f a Source # abs :: Point f a -> Point f a Source # signum :: Point f a -> Point f a Source # fromInteger :: Integer -> Point f a Source #
Num a => Num (Const a b) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Functor.Const Methods (+) :: Const a b -> Const a b -> Const a b Source # (-) :: Const a b -> Const a b -> Const a b Source # (*) :: Const a b -> Const a b -> Const a b Source # negate :: Const a b -> Const a b Source # abs :: Const a b -> Const a b Source # signum :: Const a b -> Const a b Source # fromInteger :: Integer -> Const a b Source #

(Applicative f, Num a) => Num (Ap f a)

Note that even if the underlying `Num` and `Applicative` instances are lawful, for most `Applicative`s, this instance will not be lawful. If you use this instance with the list `Applicative`, the following customary laws will not hold:

Commutativity:

    >>> Ap [10,20] + Ap [1,2]
    Ap {getAp = [11,12,21,22]}
    >>> Ap [1,2] + Ap [10,20]
    Ap {getAp = [11,21,12,22]}

Additive inverse:

    >>> Ap [] + negate (Ap [])
    Ap {getAp = []}
    >>> fromInteger 0 :: Ap [] Int
    Ap {getAp = [0]}

Distributivity:

    >>> Ap [1,2] * (3 + 4)
    Ap {getAp = [7,14]}
    >>> (Ap [1,2] * 3) + (Ap [1,2] * 4)
    Ap {getAp = [7,11,10,14]}

Since: base-4.12.0.0

Instance details Defined in GHC.Internal.Data.Monoid Methods (+) :: Ap f a -> Ap f a -> Ap f a Source # (-) :: Ap f a -> Ap f a -> Ap f a Source # (*) :: Ap f a -> Ap f a -> Ap f a Source # negate :: Ap f a -> Ap f a Source # abs :: Ap f a -> Ap f a Source # signum :: Ap f a -> Ap f a Source # fromInteger :: Integer -> Ap f a Source #
Num (f a) => Num (Alt f a) | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (+) :: Alt f a -> Alt f a -> Alt f a Source # (-) :: Alt f a -> Alt f a -> Alt f a Source # (*) :: Alt f a -> Alt f a -> Alt f a Source # negate :: Alt f a -> Alt f a Source # abs :: Alt f a -> Alt f a Source # signum :: Alt f a -> Alt f a Source # fromInteger :: Integer -> Alt f a Source #
(Dim n, Num a) => Num (V n a) |
Instance details Defined in Linear.V Methods (+) :: V n a -> V n a -> V n a Source # (-) :: V n a -> V n a -> V n a Source # (*) :: V n a -> V n a -> V n a Source # negate :: V n a -> V n a Source # abs :: V n a -> V n a Source # signum :: V n a -> V n a Source # fromInteger :: Integer -> V n a Source #
Num a => Num (Tagged s a) |
Instance details Defined in Data.Tagged Methods (+) :: Tagged s a -> Tagged s a -> Tagged s a Source # (-) :: Tagged s a -> Tagged s a -> Tagged s a Source # (*) :: Tagged s a -> Tagged s a -> Tagged s a Source # negate :: Tagged s a -> Tagged s a Source # abs :: Tagged s a -> Tagged s a Source # signum :: Tagged s a -> Tagged s a Source # fromInteger :: Integer -> Tagged s a Source #
Num (f (g a)) => Num (Compose f g a) | Since: base-4.19.0.0

Instance details

Defined in Data.Functor.Compose

Methods

(+) :: Compose f g a -> Compose f g a -> Compose f g a Source #

(-) :: Compose f g a -> Compose f g a -> Compose f g a Source #

(*) :: Compose f g a -> Compose f g a -> Compose f g a Source #

negate :: Compose f g a -> Compose f g a Source #

abs :: Compose f g a -> Compose f g a Source #

signum :: Compose f g a -> Compose f g a Source #

fromInteger :: Integer -> Compose f g a Source #

class Monad m => MonadFail (m :: Type -> Type) where Source #

When a value is bound in `do`-notation, the pattern on the left hand side of `<-` might not match. In this case, this class provides a function to recover.

A `Monad` without a `MonadFail` instance may only be used in conjunction with pattern that always match, such as newtypes, tuples, data types with only a single data constructor, and irrefutable patterns (`~pat`).

Instances of `MonadFail` should satisfy the following law: `fail s` should be a left zero for `>>=`,

    fail s >>= f  =  fail s

If your `Monad` is also `MonadPlus`, a popular definition is

    fail _ = mzero

`fail s` should be an action that runs in the monad itself, not an exception (except in instances of `MonadIO`). In particular, `fail` should not be implemented in terms of `error`.

Since: base-4.9.0.0

Methods

fail :: String -> m a Source #

#### Instances

Instances details

MonadFail IResult |
Instance details Defined in Data.Aeson.Types.Internal Methods fail :: String -> IResult a Source #
MonadFail Parser |
Instance details Defined in Data.Aeson.Types.Internal Methods fail :: String -> Parser a Source #
MonadFail Result |
Instance details Defined in Data.Aeson.Types.Internal Methods fail :: String -> Result a Source #
MonadFail Get |
Instance details Defined in Data.Binary.Get.Internal Methods fail :: String -> Get a Source #
MonadFail DList |
Instance details Defined in Data.DList.Internal Methods fail :: String -> DList a Source #
MonadFail P | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods fail :: String -> P a Source #
MonadFail ReadP | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods fail :: String -> ReadP a Source #
MonadFail ReadPrec | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadPrec Methods fail :: String -> ReadPrec a Source #
MonadFail IO | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Control.Monad.Fail Methods fail :: String -> IO a Source #
MonadFail ReadM |
Instance details Defined in Options.Applicative.Types Methods fail :: String -> ReadM a Source #
MonadFail Array |
Instance details Defined in Data.Primitive.Array Methods fail :: String -> Array a Source #
MonadFail SmallArray |
Instance details Defined in Data.Primitive.SmallArray Methods fail :: String -> SmallArray a Source #
MonadFail Q |
Instance details Defined in Language.Haskell.TH.Syntax Methods fail :: String -> Q a Source #
MonadFail Vector |
Instance details Defined in Data.Vector Methods fail :: String -> Vector a Source #
MonadFail Vector |
Instance details Defined in Data.Vector.Strict Methods fail :: String -> Vector a Source #
MonadFail Stream |
Instance details Defined in Codec.Compression.Zlib.Stream Methods fail :: String -> Stream a Source #
MonadFail Maybe | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Control.Monad.Fail Methods fail :: String -> Maybe a Source #
MonadFail [] | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Control.Monad.Fail Methods fail :: String -> [a] Source #
Monad m => MonadFail (PropertyM m) |
Instance details Defined in Test.QuickCheck.Monadic Methods fail :: String -> PropertyM m a Source #
Monad m => MonadFail (MaybeT m) |
Instance details Defined in Control.Monad.Trans.Maybe Methods fail :: String -> MaybeT m a Source #
(Functor f, MonadFail m) => MonadFail (FreeT f m) |
Instance details Defined in Control.Monad.Trans.Free Methods fail :: String -> FreeT f m a Source #
MonadFail f => MonadFail (Ap f) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods fail :: String -> Ap f a Source #
(Monoid w, MonadFail m) => MonadFail (AccumT w m) |
Instance details Defined in Control.Monad.Trans.Accum Methods fail :: String -> AccumT w m a Source #
MonadFail m => MonadFail (ExceptT e m) |
Instance details Defined in Control.Monad.Trans.Except Methods fail :: String -> ExceptT e m a Source #
MonadFail m => MonadFail (IdentityT m) |
Instance details Defined in Control.Monad.Trans.Identity Methods fail :: String -> IdentityT m a Source #
MonadFail m => MonadFail (ReaderT r m) |
Instance details Defined in Control.Monad.Trans.Reader Methods fail :: String -> ReaderT r m a Source #
MonadFail m => MonadFail (SelectT r m) |
Instance details Defined in Control.Monad.Trans.Select Methods fail :: String -> SelectT r m a Source #
MonadFail m => MonadFail (StateT s m) |
Instance details Defined in Control.Monad.Trans.State.Lazy Methods fail :: String -> StateT s m a Source #
MonadFail m => MonadFail (StateT s m) |
Instance details Defined in Control.Monad.Trans.State.Strict Methods fail :: String -> StateT s m a Source #
MonadFail m => MonadFail (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.CPS Methods fail :: String -> WriterT w m a Source #
(Monoid w, MonadFail m) => MonadFail (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods fail :: String -> WriterT w m a Source #
(Monoid w, MonadFail m) => MonadFail (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods fail :: String -> WriterT w m a Source #
MonadFail m => MonadFail (Reverse m) |
Instance details Defined in Data.Functor.Reverse Methods fail :: String -> Reverse m a Source #
MonadFail m => MonadFail (ContT r m) |
Instance details Defined in Control.Monad.Trans.Cont Methods fail :: String -> ContT r m a Source #
MonadFail m => MonadFail (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.CPS Methods fail :: String -> RWST r w s m a Source #
(Monoid w, MonadFail m) => MonadFail (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.Lazy Methods fail :: String -> RWST r w s m a Source #
(Monoid w, MonadFail m) => MonadFail (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.Strict Methods fail :: String -> RWST r w s m a Source #

class Fractional a => Floating a where Source #

Trigonometric and hyperbolic functions and related functions.

The Haskell Report defines no laws for `Floating`. However, `(`+`)`, `(`*`)` and `exp` are customarily expected to define an exponential field and have the following properties:

- `exp (a + b)` = `exp a * exp b`
- `exp (fromInteger 0)` = `fromInteger 1`

Minimal complete definition

pi, exp, log, sin, cos, asin, acos, atan, sinh, cosh, asinh, acosh, atanh

Methods

pi :: a Source #

exp :: a -> a Source #

log :: a -> a Source #

sqrt :: a -> a Source #

(**) :: a -> a -> a infixr 8 Source #

logBase :: a -> a -> a Source #

sin :: a -> a Source #

cos :: a -> a Source #

tan :: a -> a Source #

asin :: a -> a Source #

acos :: a -> a Source #

atan :: a -> a Source #

sinh :: a -> a Source #

cosh :: a -> a Source #

tanh :: a -> a Source #

asinh :: a -> a Source #

acosh :: a -> a Source #

atanh :: a -> a Source #

#### Instances

Instances details

Floating CDouble |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

pi :: CDouble Source #

exp :: CDouble -> CDouble Source #

log :: CDouble -> CDouble Source #

sqrt :: CDouble -> CDouble Source #

(**) :: CDouble -> CDouble -> CDouble Source #

logBase :: CDouble -> CDouble -> CDouble Source #

sin :: CDouble -> CDouble Source #

cos :: CDouble -> CDouble Source #

tan :: CDouble -> CDouble Source #

asin :: CDouble -> CDouble Source #

acos :: CDouble -> CDouble Source #

atan :: CDouble -> CDouble Source #

sinh :: CDouble -> CDouble Source #

cosh :: CDouble -> CDouble Source #

tanh :: CDouble -> CDouble Source #

asinh :: CDouble -> CDouble Source #

acosh :: CDouble -> CDouble Source #

atanh :: CDouble -> CDouble Source #

log1p :: CDouble -> CDouble Source #

expm1 :: CDouble -> CDouble Source #

log1pexp :: CDouble -> CDouble Source #

log1mexp :: CDouble -> CDouble Source #

Floating CFloat |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

pi :: CFloat Source #

exp :: CFloat -> CFloat Source #

log :: CFloat -> CFloat Source #

sqrt :: CFloat -> CFloat Source #

(**) :: CFloat -> CFloat -> CFloat Source #

logBase :: CFloat -> CFloat -> CFloat Source #

sin :: CFloat -> CFloat Source #

cos :: CFloat -> CFloat Source #

tan :: CFloat -> CFloat Source #

asin :: CFloat -> CFloat Source #

acos :: CFloat -> CFloat Source #

atan :: CFloat -> CFloat Source #

sinh :: CFloat -> CFloat Source #

cosh :: CFloat -> CFloat Source #

tanh :: CFloat -> CFloat Source #

asinh :: CFloat -> CFloat Source #

acosh :: CFloat -> CFloat Source #

atanh :: CFloat -> CFloat Source #

log1p :: CFloat -> CFloat Source #

expm1 :: CFloat -> CFloat Source #

log1pexp :: CFloat -> CFloat Source #

log1mexp :: CFloat -> CFloat Source #

Floating Double | Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

pi :: Double Source #

exp :: Double -> Double Source #

log :: Double -> Double Source #

sqrt :: Double -> Double Source #

(**) :: Double -> Double -> Double Source #

logBase :: Double -> Double -> Double Source #

sin :: Double -> Double Source #

cos :: Double -> Double Source #

tan :: Double -> Double Source #

asin :: Double -> Double Source #

acos :: Double -> Double Source #

atan :: Double -> Double Source #

sinh :: Double -> Double Source #

cosh :: Double -> Double Source #

tanh :: Double -> Double Source #

asinh :: Double -> Double Source #

acosh :: Double -> Double Source #

atanh :: Double -> Double Source #

log1p :: Double -> Double Source #

expm1 :: Double -> Double Source #

log1pexp :: Double -> Double Source #

log1mexp :: Double -> Double Source #

Floating Float | Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

pi :: Float Source #

exp :: Float -> Float Source #

log :: Float -> Float Source #

sqrt :: Float -> Float Source #

(**) :: Float -> Float -> Float Source #

logBase :: Float -> Float -> Float Source #

sin :: Float -> Float Source #

cos :: Float -> Float Source #

tan :: Float -> Float Source #

asin :: Float -> Float Source #

acos :: Float -> Float Source #

atan :: Float -> Float Source #

sinh :: Float -> Float Source #

cosh :: Float -> Float Source #

tanh :: Float -> Float Source #

asinh :: Float -> Float Source #

acosh :: Float -> Float Source #

atanh :: Float -> Float Source #

log1p :: Float -> Float Source #

expm1 :: Float -> Float Source #

log1pexp :: Float -> Float Source #

log1mexp :: Float -> Float Source #

RealFloat a => Floating (Complex a) | Since: base-2.1

Instance details

Defined in Data.Complex

Methods

pi :: Complex a Source #

exp :: Complex a -> Complex a Source #

log :: Complex a -> Complex a Source #

sqrt :: Complex a -> Complex a Source #

(**) :: Complex a -> Complex a -> Complex a Source #

logBase :: Complex a -> Complex a -> Complex a Source #

sin :: Complex a -> Complex a Source #

cos :: Complex a -> Complex a Source #

tan :: Complex a -> Complex a Source #

asin :: Complex a -> Complex a Source #

acos :: Complex a -> Complex a Source #

atan :: Complex a -> Complex a Source #

sinh :: Complex a -> Complex a Source #

cosh :: Complex a -> Complex a Source #

tanh :: Complex a -> Complex a Source #

asinh :: Complex a -> Complex a Source #

acosh :: Complex a -> Complex a Source #

atanh :: Complex a -> Complex a Source #

log1p :: Complex a -> Complex a Source #

expm1 :: Complex a -> Complex a Source #

log1pexp :: Complex a -> Complex a Source #

log1mexp :: Complex a -> Complex a Source #

Floating a => Floating (Identity a) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Identity

Methods

pi :: Identity a Source #

exp :: Identity a -> Identity a Source #

log :: Identity a -> Identity a Source #

sqrt :: Identity a -> Identity a Source #

(**) :: Identity a -> Identity a -> Identity a Source #

logBase :: Identity a -> Identity a -> Identity a Source #

sin :: Identity a -> Identity a Source #

cos :: Identity a -> Identity a Source #

tan :: Identity a -> Identity a Source #

asin :: Identity a -> Identity a Source #

acos :: Identity a -> Identity a Source #

atan :: Identity a -> Identity a Source #

sinh :: Identity a -> Identity a Source #

cosh :: Identity a -> Identity a Source #

tanh :: Identity a -> Identity a Source #

asinh :: Identity a -> Identity a Source #

acosh :: Identity a -> Identity a Source #

atanh :: Identity a -> Identity a Source #

log1p :: Identity a -> Identity a Source #

expm1 :: Identity a -> Identity a Source #

log1pexp :: Identity a -> Identity a Source #

log1mexp :: Identity a -> Identity a Source #

Floating a => Floating (Down a) | Since: base-4.14.0.0

Instance details

Defined in GHC.Internal.Data.Ord

Methods

pi :: Down a Source #

exp :: Down a -> Down a Source #

log :: Down a -> Down a Source #

sqrt :: Down a -> Down a Source #

(**) :: Down a -> Down a -> Down a Source #

logBase :: Down a -> Down a -> Down a Source #

sin :: Down a -> Down a Source #

cos :: Down a -> Down a Source #

tan :: Down a -> Down a Source #

asin :: Down a -> Down a Source #

acos :: Down a -> Down a Source #

atan :: Down a -> Down a Source #

sinh :: Down a -> Down a Source #

cosh :: Down a -> Down a Source #

tanh :: Down a -> Down a Source #

asinh :: Down a -> Down a Source #

acosh :: Down a -> Down a Source #

atanh :: Down a -> Down a Source #

log1p :: Down a -> Down a Source #

expm1 :: Down a -> Down a Source #

log1pexp :: Down a -> Down a Source #

log1mexp :: Down a -> Down a Source #

Floating a => Floating (Plucker a) |

Instance details

Defined in Linear.Plucker

Methods

pi :: Plucker a Source #

exp :: Plucker a -> Plucker a Source #

log :: Plucker a -> Plucker a Source #

sqrt :: Plucker a -> Plucker a Source #

(**) :: Plucker a -> Plucker a -> Plucker a Source #

logBase :: Plucker a -> Plucker a -> Plucker a Source #

sin :: Plucker a -> Plucker a Source #

cos :: Plucker a -> Plucker a Source #

tan :: Plucker a -> Plucker a Source #

asin :: Plucker a -> Plucker a Source #

acos :: Plucker a -> Plucker a Source #

atan :: Plucker a -> Plucker a Source #

sinh :: Plucker a -> Plucker a Source #

cosh :: Plucker a -> Plucker a Source #

tanh :: Plucker a -> Plucker a Source #

asinh :: Plucker a -> Plucker a Source #

acosh :: Plucker a -> Plucker a Source #

atanh :: Plucker a -> Plucker a Source #

log1p :: Plucker a -> Plucker a Source #

expm1 :: Plucker a -> Plucker a Source #

log1pexp :: Plucker a -> Plucker a Source #

log1mexp :: Plucker a -> Plucker a Source #

RealFloat a => Floating (Quaternion a) |

Instance details

Defined in Linear.Quaternion

Methods

pi :: Quaternion a Source #

exp :: Quaternion a -> Quaternion a Source #

log :: Quaternion a -> Quaternion a Source #

sqrt :: Quaternion a -> Quaternion a Source #

(**) :: Quaternion a -> Quaternion a -> Quaternion a Source #

logBase :: Quaternion a -> Quaternion a -> Quaternion a Source #

sin :: Quaternion a -> Quaternion a Source #

cos :: Quaternion a -> Quaternion a Source #

tan :: Quaternion a -> Quaternion a Source #

asin :: Quaternion a -> Quaternion a Source #

acos :: Quaternion a -> Quaternion a Source #

atan :: Quaternion a -> Quaternion a Source #

sinh :: Quaternion a -> Quaternion a Source #

cosh :: Quaternion a -> Quaternion a Source #

tanh :: Quaternion a -> Quaternion a Source #

asinh :: Quaternion a -> Quaternion a Source #

acosh :: Quaternion a -> Quaternion a Source #

atanh :: Quaternion a -> Quaternion a Source #

log1p :: Quaternion a -> Quaternion a Source #

expm1 :: Quaternion a -> Quaternion a Source #

log1pexp :: Quaternion a -> Quaternion a Source #

log1mexp :: Quaternion a -> Quaternion a Source #

Floating (V0 a) |

Instance details

Defined in Linear.V0

Methods

pi :: V0 a Source #

exp :: V0 a -> V0 a Source #

log :: V0 a -> V0 a Source #

sqrt :: V0 a -> V0 a Source #

(**) :: V0 a -> V0 a -> V0 a Source #

logBase :: V0 a -> V0 a -> V0 a Source #

sin :: V0 a -> V0 a Source #

cos :: V0 a -> V0 a Source #

tan :: V0 a -> V0 a Source #

asin :: V0 a -> V0 a Source #

acos :: V0 a -> V0 a Source #

atan :: V0 a -> V0 a Source #

sinh :: V0 a -> V0 a Source #

cosh :: V0 a -> V0 a Source #

tanh :: V0 a -> V0 a Source #

asinh :: V0 a -> V0 a Source #

acosh :: V0 a -> V0 a Source #

atanh :: V0 a -> V0 a Source #

log1p :: V0 a -> V0 a Source #

expm1 :: V0 a -> V0 a Source #

log1pexp :: V0 a -> V0 a Source #

log1mexp :: V0 a -> V0 a Source #

Floating a => Floating (V1 a) |

Instance details

Defined in Linear.V1

Methods

pi :: V1 a Source #

exp :: V1 a -> V1 a Source #

log :: V1 a -> V1 a Source #

sqrt :: V1 a -> V1 a Source #

(**) :: V1 a -> V1 a -> V1 a Source #

logBase :: V1 a -> V1 a -> V1 a Source #

sin :: V1 a -> V1 a Source #

cos :: V1 a -> V1 a Source #

tan :: V1 a -> V1 a Source #

asin :: V1 a -> V1 a Source #

acos :: V1 a -> V1 a Source #

atan :: V1 a -> V1 a Source #

sinh :: V1 a -> V1 a Source #

cosh :: V1 a -> V1 a Source #

tanh :: V1 a -> V1 a Source #

asinh :: V1 a -> V1 a Source #

acosh :: V1 a -> V1 a Source #

atanh :: V1 a -> V1 a Source #

log1p :: V1 a -> V1 a Source #

expm1 :: V1 a -> V1 a Source #

log1pexp :: V1 a -> V1 a Source #

log1mexp :: V1 a -> V1 a Source #

Floating a => Floating (V2 a) |

Instance details

Defined in Linear.V2

Methods

pi :: V2 a Source #

exp :: V2 a -> V2 a Source #

log :: V2 a -> V2 a Source #

sqrt :: V2 a -> V2 a Source #

(**) :: V2 a -> V2 a -> V2 a Source #

logBase :: V2 a -> V2 a -> V2 a Source #

sin :: V2 a -> V2 a Source #

cos :: V2 a -> V2 a Source #

tan :: V2 a -> V2 a Source #

asin :: V2 a -> V2 a Source #

acos :: V2 a -> V2 a Source #

atan :: V2 a -> V2 a Source #

sinh :: V2 a -> V2 a Source #

cosh :: V2 a -> V2 a Source #

tanh :: V2 a -> V2 a Source #

asinh :: V2 a -> V2 a Source #

acosh :: V2 a -> V2 a Source #

atanh :: V2 a -> V2 a Source #

log1p :: V2 a -> V2 a Source #

expm1 :: V2 a -> V2 a Source #

log1pexp :: V2 a -> V2 a Source #

log1mexp :: V2 a -> V2 a Source #

Floating a => Floating (V3 a) |

Instance details

Defined in Linear.V3

Methods

pi :: V3 a Source #

exp :: V3 a -> V3 a Source #

log :: V3 a -> V3 a Source #

sqrt :: V3 a -> V3 a Source #

(**) :: V3 a -> V3 a -> V3 a Source #

logBase :: V3 a -> V3 a -> V3 a Source #

sin :: V3 a -> V3 a Source #

cos :: V3 a -> V3 a Source #

tan :: V3 a -> V3 a Source #

asin :: V3 a -> V3 a Source #

acos :: V3 a -> V3 a Source #

atan :: V3 a -> V3 a Source #

sinh :: V3 a -> V3 a Source #

cosh :: V3 a -> V3 a Source #

tanh :: V3 a -> V3 a Source #

asinh :: V3 a -> V3 a Source #

acosh :: V3 a -> V3 a Source #

atanh :: V3 a -> V3 a Source #

log1p :: V3 a -> V3 a Source #

expm1 :: V3 a -> V3 a Source #

log1pexp :: V3 a -> V3 a Source #

log1mexp :: V3 a -> V3 a Source #

Floating a => Floating (V4 a) |

Instance details

Defined in Linear.V4

Methods

pi :: V4 a Source #

exp :: V4 a -> V4 a Source #

log :: V4 a -> V4 a Source #

sqrt :: V4 a -> V4 a Source #

(**) :: V4 a -> V4 a -> V4 a Source #

logBase :: V4 a -> V4 a -> V4 a Source #

sin :: V4 a -> V4 a Source #

cos :: V4 a -> V4 a Source #

tan :: V4 a -> V4 a Source #

asin :: V4 a -> V4 a Source #

acos :: V4 a -> V4 a Source #

atan :: V4 a -> V4 a Source #

sinh :: V4 a -> V4 a Source #

cosh :: V4 a -> V4 a Source #

tanh :: V4 a -> V4 a Source #

asinh :: V4 a -> V4 a Source #

acosh :: V4 a -> V4 a Source #

atanh :: V4 a -> V4 a Source #

log1p :: V4 a -> V4 a Source #

expm1 :: V4 a -> V4 a Source #

log1pexp :: V4 a -> V4 a Source #

log1mexp :: V4 a -> V4 a Source #

Floating a => Floating (V2 a) |

Instance details

Defined in SDL.Internal.Vect

Methods

pi :: V2 a Source #

exp :: V2 a -> V2 a Source #

log :: V2 a -> V2 a Source #

sqrt :: V2 a -> V2 a Source #

(**) :: V2 a -> V2 a -> V2 a Source #

logBase :: V2 a -> V2 a -> V2 a Source #

sin :: V2 a -> V2 a Source #

cos :: V2 a -> V2 a Source #

tan :: V2 a -> V2 a Source #

asin :: V2 a -> V2 a Source #

acos :: V2 a -> V2 a Source #

atan :: V2 a -> V2 a Source #

sinh :: V2 a -> V2 a Source #

cosh :: V2 a -> V2 a Source #

tanh :: V2 a -> V2 a Source #

asinh :: V2 a -> V2 a Source #

acosh :: V2 a -> V2 a Source #

atanh :: V2 a -> V2 a Source #

log1p :: V2 a -> V2 a Source #

expm1 :: V2 a -> V2 a Source #

log1pexp :: V2 a -> V2 a Source #

log1mexp :: V2 a -> V2 a Source #

Floating a => Floating (V3 a) |

Instance details

Defined in SDL.Internal.Vect

Methods

pi :: V3 a Source #

exp :: V3 a -> V3 a Source #

log :: V3 a -> V3 a Source #

sqrt :: V3 a -> V3 a Source #

(**) :: V3 a -> V3 a -> V3 a Source #

logBase :: V3 a -> V3 a -> V3 a Source #

sin :: V3 a -> V3 a Source #

cos :: V3 a -> V3 a Source #

tan :: V3 a -> V3 a Source #

asin :: V3 a -> V3 a Source #

acos :: V3 a -> V3 a Source #

atan :: V3 a -> V3 a Source #

sinh :: V3 a -> V3 a Source #

cosh :: V3 a -> V3 a Source #

tanh :: V3 a -> V3 a Source #

asinh :: V3 a -> V3 a Source #

acosh :: V3 a -> V3 a Source #

atanh :: V3 a -> V3 a Source #

log1p :: V3 a -> V3 a Source #

expm1 :: V3 a -> V3 a Source #

log1pexp :: V3 a -> V3 a Source #

log1mexp :: V3 a -> V3 a Source #

Floating a => Floating (V4 a) |

Instance details

Defined in SDL.Internal.Vect

Methods

pi :: V4 a Source #

exp :: V4 a -> V4 a Source #

log :: V4 a -> V4 a Source #

sqrt :: V4 a -> V4 a Source #

(**) :: V4 a -> V4 a -> V4 a Source #

logBase :: V4 a -> V4 a -> V4 a Source #

sin :: V4 a -> V4 a Source #

cos :: V4 a -> V4 a Source #

tan :: V4 a -> V4 a Source #

asin :: V4 a -> V4 a Source #

acos :: V4 a -> V4 a Source #

atan :: V4 a -> V4 a Source #

sinh :: V4 a -> V4 a Source #

cosh :: V4 a -> V4 a Source #

tanh :: V4 a -> V4 a Source #

asinh :: V4 a -> V4 a Source #

acosh :: V4 a -> V4 a Source #

atanh :: V4 a -> V4 a Source #

log1p :: V4 a -> V4 a Source #

expm1 :: V4 a -> V4 a Source #

log1pexp :: V4 a -> V4 a Source #

log1mexp :: V4 a -> V4 a Source #

Floating a => Floating (Op a b) |

Instance details

Defined in Data.Functor.Contravariant

Methods

pi :: Op a b Source #

exp :: Op a b -> Op a b Source #

log :: Op a b -> Op a b Source #

sqrt :: Op a b -> Op a b Source #

(**) :: Op a b -> Op a b -> Op a b Source #

logBase :: Op a b -> Op a b -> Op a b Source #

sin :: Op a b -> Op a b Source #

cos :: Op a b -> Op a b Source #

tan :: Op a b -> Op a b Source #

asin :: Op a b -> Op a b Source #

acos :: Op a b -> Op a b Source #

atan :: Op a b -> Op a b Source #

sinh :: Op a b -> Op a b Source #

cosh :: Op a b -> Op a b Source #

tanh :: Op a b -> Op a b Source #

asinh :: Op a b -> Op a b Source #

acosh :: Op a b -> Op a b Source #

atanh :: Op a b -> Op a b Source #

log1p :: Op a b -> Op a b Source #

expm1 :: Op a b -> Op a b Source #

log1pexp :: Op a b -> Op a b Source #

log1mexp :: Op a b -> Op a b Source #

Floating a => Floating (Const a b) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

pi :: Const a b Source #

exp :: Const a b -> Const a b Source #

log :: Const a b -> Const a b Source #

sqrt :: Const a b -> Const a b Source #

(**) :: Const a b -> Const a b -> Const a b Source #

logBase :: Const a b -> Const a b -> Const a b Source #

sin :: Const a b -> Const a b Source #

cos :: Const a b -> Const a b Source #

tan :: Const a b -> Const a b Source #

asin :: Const a b -> Const a b Source #

acos :: Const a b -> Const a b Source #

atan :: Const a b -> Const a b Source #

sinh :: Const a b -> Const a b Source #

cosh :: Const a b -> Const a b Source #

tanh :: Const a b -> Const a b Source #

asinh :: Const a b -> Const a b Source #

acosh :: Const a b -> Const a b Source #

atanh :: Const a b -> Const a b Source #

log1p :: Const a b -> Const a b Source #

expm1 :: Const a b -> Const a b Source #

log1pexp :: Const a b -> Const a b Source #

log1mexp :: Const a b -> Const a b Source #

(Dim n, Floating a) => Floating (V n a) |

Instance details

Defined in Linear.V

Methods

pi :: V n a Source #

exp :: V n a -> V n a Source #

log :: V n a -> V n a Source #

sqrt :: V n a -> V n a Source #

(**) :: V n a -> V n a -> V n a Source #

logBase :: V n a -> V n a -> V n a Source #

sin :: V n a -> V n a Source #

cos :: V n a -> V n a Source #

tan :: V n a -> V n a Source #

asin :: V n a -> V n a Source #

acos :: V n a -> V n a Source #

atan :: V n a -> V n a Source #

sinh :: V n a -> V n a Source #

cosh :: V n a -> V n a Source #

tanh :: V n a -> V n a Source #

asinh :: V n a -> V n a Source #

acosh :: V n a -> V n a Source #

atanh :: V n a -> V n a Source #

log1p :: V n a -> V n a Source #

expm1 :: V n a -> V n a Source #

log1pexp :: V n a -> V n a Source #

log1mexp :: V n a -> V n a Source #

Floating a => Floating (Tagged s a) |

Instance details

Defined in Data.Tagged

Methods

pi :: Tagged s a Source #

exp :: Tagged s a -> Tagged s a Source #

log :: Tagged s a -> Tagged s a Source #

sqrt :: Tagged s a -> Tagged s a Source #

(**) :: Tagged s a -> Tagged s a -> Tagged s a Source #

logBase :: Tagged s a -> Tagged s a -> Tagged s a Source #

sin :: Tagged s a -> Tagged s a Source #

cos :: Tagged s a -> Tagged s a Source #

tan :: Tagged s a -> Tagged s a Source #

asin :: Tagged s a -> Tagged s a Source #

acos :: Tagged s a -> Tagged s a Source #

atan :: Tagged s a -> Tagged s a Source #

sinh :: Tagged s a -> Tagged s a Source #

cosh :: Tagged s a -> Tagged s a Source #

tanh :: Tagged s a -> Tagged s a Source #

asinh :: Tagged s a -> Tagged s a Source #

acosh :: Tagged s a -> Tagged s a Source #

atanh :: Tagged s a -> Tagged s a Source #

log1p :: Tagged s a -> Tagged s a Source #

expm1 :: Tagged s a -> Tagged s a Source #

log1pexp :: Tagged s a -> Tagged s a Source #

log1mexp :: Tagged s a -> Tagged s a Source #

Floating (f (g a)) => Floating (Compose f g a) | Since: base-4.20.0.0

Instance details

Defined in Data.Functor.Compose

Methods

pi :: Compose f g a Source #

exp :: Compose f g a -> Compose f g a Source #

log :: Compose f g a -> Compose f g a Source #

sqrt :: Compose f g a -> Compose f g a Source #

(**) :: Compose f g a -> Compose f g a -> Compose f g a Source #

logBase :: Compose f g a -> Compose f g a -> Compose f g a Source #

sin :: Compose f g a -> Compose f g a Source #

cos :: Compose f g a -> Compose f g a Source #

tan :: Compose f g a -> Compose f g a Source #

asin :: Compose f g a -> Compose f g a Source #

acos :: Compose f g a -> Compose f g a Source #

atan :: Compose f g a -> Compose f g a Source #

sinh :: Compose f g a -> Compose f g a Source #

cosh :: Compose f g a -> Compose f g a Source #

tanh :: Compose f g a -> Compose f g a Source #

asinh :: Compose f g a -> Compose f g a Source #

acosh :: Compose f g a -> Compose f g a Source #

atanh :: Compose f g a -> Compose f g a Source #

log1p :: Compose f g a -> Compose f g a Source #

expm1 :: Compose f g a -> Compose f g a Source #

log1pexp :: Compose f g a -> Compose f g a Source #

log1mexp :: Compose f g a -> Compose f g a Source #

class (RealFrac a, Floating a) => RealFloat a where Source #

Efficient, machine-independent access to the components of a floating-point number.

Minimal complete definition

floatRadix, floatDigits, floatRange, decodeFloat, encodeFloat, isNaN, isInfinite, isDenormalized, isNegativeZero, isIEEE

Methods

floatRadix :: a -> Integer Source #

a constant function, returning the radix of the representation (often `2`)

floatDigits :: a -> Int Source #

a constant function, returning the number of digits of `floatRadix` in the significand

floatRange :: a -> (Int, Int) Source #

a constant function, returning the lowest and highest values the exponent may assume

decodeFloat :: a -> (Integer, Int) Source #

The function `decodeFloat` applied to a real floating-point number returns the significand expressed as an `Integer` and an appropriately scaled exponent (an `Int`). If ``decodeFloat` x` yields `(m,n)`, then `x` is equal in value to `m*b^^n`, where `b` is the floating-point radix, and furthermore, either `m` and `n` are both zero or else `b^(d-1) <= `abs` m < b^d`, where `d` is the value of ``floatDigits` x`. In particular, ``decodeFloat` 0 = (0,0)`. If the type contains a negative zero, also ``decodeFloat` (-0.0) = (0,0)`. The result of ``decodeFloat` x` is unspecified if either of ``isNaN` x` or ``isInfinite` x` is `True`.

encodeFloat :: Integer -> Int -> a Source #

`encodeFloat` performs the inverse of `decodeFloat` in the sense that for finite `x` with the exception of `-0.0`, ``uncurry` `encodeFloat` (`decodeFloat` x) = x`. ``encodeFloat` m n` is one of the two closest representable floating-point numbers to `m*b^^n` (or `±Infinity` if overflow occurs); usually the closer, but if `m` contains too many bits, the result may be rounded in the wrong direction.

exponent :: a -> Int Source #

`exponent` corresponds to the second component of `decodeFloat`. ``exponent` 0 = 0` and for finite nonzero `x`, ``exponent` x = snd (`decodeFloat` x) + `floatDigits` x`. If `x` is a finite floating-point number, it is equal in value to ``significand` x * b ^^ `exponent` x`, where `b` is the floating-point radix. The behaviour is unspecified on infinite or `NaN` values.

significand :: a -> a Source #

The first component of `decodeFloat`, scaled to lie in the open interval (`-1`,`1`), either `0.0` or of absolute value `>= 1/b`, where `b` is the floating-point radix. The behaviour is unspecified on infinite or `NaN` values.

scaleFloat :: Int -> a -> a Source #

multiplies a floating-point number by an integer power of the radix

isNaN :: a -> Bool Source #

`True` if the argument is an IEEE "not-a-number" (NaN) value

isInfinite :: a -> Bool Source #

`True` if the argument is an IEEE infinity or negative infinity

isDenormalized :: a -> Bool Source #

`True` if the argument is too small to be represented in normalized format

isNegativeZero :: a -> Bool Source #

`True` if the argument is an IEEE negative zero

isIEEE :: a -> Bool Source #

`True` if the argument is an IEEE floating point number

atan2 :: a -> a -> a Source #

a version of arctangent taking two real floating-point arguments. For real floating `x` and `y`, ``atan2` y x` computes the angle (from the positive x-axis) of the vector from the origin to the point `(x,y)`. ``atan2` y x` returns a value in the range [`-pi`, `pi`]. It follows the Common Lisp semantics for the origin when signed zeroes are supported. ``atan2` y 1`, with `y` in a type that is `RealFloat`, should return the same value as ``atan` y`. A default definition of `atan2` is provided, but implementors can provide a more accurate implementation.

#### Instances

Instances details

RealFloat CDouble |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

floatRadix :: CDouble -> Integer Source #

floatDigits :: CDouble -> Int Source #

floatRange :: CDouble -> (Int, Int) Source #

decodeFloat :: CDouble -> (Integer, Int) Source #

encodeFloat :: Integer -> Int -> CDouble Source #

exponent :: CDouble -> Int Source #

significand :: CDouble -> CDouble Source #

scaleFloat :: Int -> CDouble -> CDouble Source #

isNaN :: CDouble -> Bool Source #

isInfinite :: CDouble -> Bool Source #

isDenormalized :: CDouble -> Bool Source #

isNegativeZero :: CDouble -> Bool Source #

isIEEE :: CDouble -> Bool Source #

atan2 :: CDouble -> CDouble -> CDouble Source #

RealFloat CFloat |

Instance details

Defined in GHC.Internal.Foreign.C.Types

Methods

floatRadix :: CFloat -> Integer Source #

floatDigits :: CFloat -> Int Source #

floatRange :: CFloat -> (Int, Int) Source #

decodeFloat :: CFloat -> (Integer, Int) Source #

encodeFloat :: Integer -> Int -> CFloat Source #

exponent :: CFloat -> Int Source #

significand :: CFloat -> CFloat Source #

scaleFloat :: Int -> CFloat -> CFloat Source #

isNaN :: CFloat -> Bool Source #

isInfinite :: CFloat -> Bool Source #

isDenormalized :: CFloat -> Bool Source #

isNegativeZero :: CFloat -> Bool Source #

isIEEE :: CFloat -> Bool Source #

atan2 :: CFloat -> CFloat -> CFloat Source #

RealFloat Double | Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

floatRadix :: Double -> Integer Source #

floatDigits :: Double -> Int Source #

floatRange :: Double -> (Int, Int) Source #

decodeFloat :: Double -> (Integer, Int) Source #

encodeFloat :: Integer -> Int -> Double Source #

exponent :: Double -> Int Source #

significand :: Double -> Double Source #

scaleFloat :: Int -> Double -> Double Source #

isNaN :: Double -> Bool Source #

isInfinite :: Double -> Bool Source #

isDenormalized :: Double -> Bool Source #

isNegativeZero :: Double -> Bool Source #

isIEEE :: Double -> Bool Source #

atan2 :: Double -> Double -> Double Source #

RealFloat Float | Since: base-2.1

Instance details

Defined in GHC.Internal.Float

Methods

floatRadix :: Float -> Integer Source #

floatDigits :: Float -> Int Source #

floatRange :: Float -> (Int, Int) Source #

decodeFloat :: Float -> (Integer, Int) Source #

encodeFloat :: Integer -> Int -> Float Source #

exponent :: Float -> Int Source #

significand :: Float -> Float Source #

scaleFloat :: Int -> Float -> Float Source #

isNaN :: Float -> Bool Source #

isInfinite :: Float -> Bool Source #

isDenormalized :: Float -> Bool Source #

isNegativeZero :: Float -> Bool Source #

isIEEE :: Float -> Bool Source #

atan2 :: Float -> Float -> Float Source #

RealFloat a => RealFloat (Identity a) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Identity

Methods

floatRadix :: Identity a -> Integer Source #

floatDigits :: Identity a -> Int Source #

floatRange :: Identity a -> (Int, Int) Source #

decodeFloat :: Identity a -> (Integer, Int) Source #

encodeFloat :: Integer -> Int -> Identity a Source #

exponent :: Identity a -> Int Source #

significand :: Identity a -> Identity a Source #

scaleFloat :: Int -> Identity a -> Identity a Source #

isNaN :: Identity a -> Bool Source #

isInfinite :: Identity a -> Bool Source #

isDenormalized :: Identity a -> Bool Source #

isNegativeZero :: Identity a -> Bool Source #

isIEEE :: Identity a -> Bool Source #

atan2 :: Identity a -> Identity a -> Identity a Source #

RealFloat a => RealFloat (Down a) | Since: base-4.14.0.0

Instance details

Defined in GHC.Internal.Data.Ord

Methods

floatRadix :: Down a -> Integer Source #

floatDigits :: Down a -> Int Source #

floatRange :: Down a -> (Int, Int) Source #

decodeFloat :: Down a -> (Integer, Int) Source #

encodeFloat :: Integer -> Int -> Down a Source #

exponent :: Down a -> Int Source #

significand :: Down a -> Down a Source #

scaleFloat :: Int -> Down a -> Down a Source #

isNaN :: Down a -> Bool Source #

isInfinite :: Down a -> Bool Source #

isDenormalized :: Down a -> Bool Source #

isNegativeZero :: Down a -> Bool Source #

isIEEE :: Down a -> Bool Source #

atan2 :: Down a -> Down a -> Down a Source #

RealFloat a => RealFloat (Const a b) | Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Functor.Const

Methods

floatRadix :: Const a b -> Integer Source #

floatDigits :: Const a b -> Int Source #

floatRange :: Const a b -> (Int, Int) Source #

decodeFloat :: Const a b -> (Integer, Int) Source #

encodeFloat :: Integer -> Int -> Const a b Source #

exponent :: Const a b -> Int Source #

significand :: Const a b -> Const a b Source #

scaleFloat :: Int -> Const a b -> Const a b Source #

isNaN :: Const a b -> Bool Source #

isInfinite :: Const a b -> Bool Source #

isDenormalized :: Const a b -> Bool Source #

isNegativeZero :: Const a b -> Bool Source #

isIEEE :: Const a b -> Bool Source #

atan2 :: Const a b -> Const a b -> Const a b Source #

RealFloat a => RealFloat (Tagged s a) |

Instance details

Defined in Data.Tagged

Methods

floatRadix :: Tagged s a -> Integer Source #

floatDigits :: Tagged s a -> Int Source #

floatRange :: Tagged s a -> (Int, Int) Source #

decodeFloat :: Tagged s a -> (Integer, Int) Source #

encodeFloat :: Integer -> Int -> Tagged s a Source #

exponent :: Tagged s a -> Int Source #

significand :: Tagged s a -> Tagged s a Source #

scaleFloat :: Int -> Tagged s a -> Tagged s a Source #

isNaN :: Tagged s a -> Bool Source #

isInfinite :: Tagged s a -> Bool Source #

isDenormalized :: Tagged s a -> Bool Source #

isNegativeZero :: Tagged s a -> Bool Source #

isIEEE :: Tagged s a -> Bool Source #

atan2 :: Tagged s a -> Tagged s a -> Tagged s a Source #

RealFloat (f (g a)) => RealFloat (Compose f g a) | Since: base-4.20.0.0

Instance details

Defined in Data.Functor.Compose

Methods

floatRadix :: Compose f g a -> Integer Source #

floatDigits :: Compose f g a -> Int Source #

floatRange :: Compose f g a -> (Int, Int) Source #

decodeFloat :: Compose f g a -> (Integer, Int) Source #

encodeFloat :: Integer -> Int -> Compose f g a Source #

exponent :: Compose f g a -> Int Source #

significand :: Compose f g a -> Compose f g a Source #

scaleFloat :: Int -> Compose f g a -> Compose f g a Source #

isNaN :: Compose f g a -> Bool Source #

isInfinite :: Compose f g a -> Bool Source #

isDenormalized :: Compose f g a -> Bool Source #

isNegativeZero :: Compose f g a -> Bool Source #

isIEEE :: Compose f g a -> Bool Source #

atan2 :: Compose f g a -> Compose f g a -> Compose f g a Source #

data Either a b Source #

The `Either` type represents values with two possibilities: a value of type ``Either` a b` is either ``Left` a` or ``Right` b`.

The `Either` type is sometimes used to represent a value which is either correct or an error; by convention, the `Left` constructor is used to hold an error value and the `Right` constructor is used to hold a correct value (mnemonic: "right" also means "correct").

#### Examples

Expand

The type ``Either` `String` `Int`` is the type of values which can be either a `String` or an `Int`. The `Left` constructor can be used only on `String`s, and the `Right` constructor can be used only on `Int`s:

    >>> let s = Left "foo" :: Either String Int
    >>> s
    Left "foo"
    >>> let n = Right 3 :: Either String Int
    >>> n
    Right 3
    >>> :type s
    s :: Either String Int
    >>> :type n
    n :: Either String Int

The `fmap` from our `Functor` instance will ignore `Left` values, but will apply the supplied function to values contained in a `Right`:

    >>> let s = Left "foo" :: Either String Int
    >>> let n = Right 3 :: Either String Int
    >>> fmap (*2) s
    Left "foo"
    >>> fmap (*2) n
    Right 6

The `Monad` instance for `Either` allows us to chain together multiple actions which may fail, and fail overall if any of the individual steps failed. First we'll write a function that can either parse an `Int` from a `Char`, or fail.

    >>> import Data.Char ( digitToInt, isDigit )
    >>> :{
        let parseEither :: Char -> Either String Int
            parseEither c
              | isDigit c = Right (digitToInt c)
              | otherwise = Left "parse error"
    >>> :}

The following should work, since both `'1'` and `'2'` can be parsed as `Int`s.

    >>> :{
        let parseMultiple :: Either String Int
            parseMultiple = do
              x <- parseEither '1'
              y <- parseEither '2'
              return (x + y)
    >>> :}

    >>> parseMultiple
    Right 3

But the following should fail overall, since the first operation where we attempt to parse `'m'` as an `Int` will fail:

    >>> :{
        let parseMultiple :: Either String Int
            parseMultiple = do
              x <- parseEither 'm'
              y <- parseEither '2'
              return (x + y)
    >>> :}

    >>> parseMultiple
    Left "parse error"

Constructors

Left a |
Right b |

#### Instances

Instances details

Arbitrary2 Either |
Instance details Defined in Test.QuickCheck.Arbitrary Methods liftArbitrary2 :: Gen a -> Gen b -> Gen (Either a b) Source # liftShrink2 :: (a -> [a]) -> (b -> [b]) -> Either a b -> [Either a b] Source #
Bifoldable Either | Since: base-4.10.0.0
Instance details Defined in Data.Bifoldable Methods bifold :: Monoid m => Either m m -> m Source # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Either a b -> m Source # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Either a b -> c Source # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Either a b -> c Source #
Bifoldable1 Either |
Instance details Defined in Data.Bifoldable1 Methods bifold1 :: Semigroup m => Either m m -> m Source # bifoldMap1 :: Semigroup m => (a -> m) -> (b -> m) -> Either a b -> m Source #
Bifunctor Either | Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> Either a c -> Either b d Source # first :: (a -> b) -> Either a c -> Either b c Source # second :: (b -> c) -> Either a b -> Either a c Source #
Bitraversable Either | Since: base-4.10.0.0
Instance details Defined in Data.Bitraversable Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Either a b -> f (Either c d) Source #
Eq2 Either | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Either a c -> Either b d -> Bool Source #
Ord2 Either | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Either a c -> Either b d -> Ordering Source #
Read2 Either | Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (Either a b) Source #

liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Either a b] Source #

liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Either a b) Source #

liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Either a b] Source #

Show2 Either | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Either a b -> ShowS Source # liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Either a b] -> ShowS Source #
NFData2 Either | Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf2 :: (a -> ()) -> (b -> ()) -> Either a b -> () Source #
Hashable2 Either |
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt2 :: (Int -> a -> Int) -> (Int -> b -> Int) -> Int -> Either a b -> Int Source #
Generic1 (Either a :: Type -> Type) |

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep1 (Either a :: Type -> Type) | Since: base-4.6.0.0

Instance details

Defined in GHC.Internal.Generics

type Rep1 (Either a :: Type -> Type) = D1 ('MetaData "Either" "GHC.Internal.Data.Either" "ghc-internal" 'False) (C1 ('MetaCons "Left" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Right" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1))

Methods

from1 :: Either a a0 -> Rep1 (Either a) a0 Source #

to1 :: Rep1 (Either a) a0 -> Either a a0 Source #

(Lift a, Lift b) => Lift (Either a b :: Type) |
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Quote m => Either a b -> m Exp Source # liftTyped :: forall (m :: Type -> Type). Quote m => Either a b -> Code m (Either a b) Source #
Arbitrary a => Arbitrary1 (Either a) |
Instance details Defined in Test.QuickCheck.Arbitrary Methods liftArbitrary :: Gen a0 -> Gen (Either a a0) Source # liftShrink :: (a0 -> [a0]) -> Either a a0 -> [Either a a0] Source #
Eq a => Eq1 (Either a) | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftEq :: (a0 -> b -> Bool) -> Either a a0 -> Either a b -> Bool Source #
Ord a => Ord1 (Either a) | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftCompare :: (a0 -> b -> Ordering) -> Either a a0 -> Either a b -> Ordering Source #
Read a => Read1 (Either a) | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (Either a a0) Source # liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [Either a a0] Source # liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (Either a a0) Source # liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [Either a a0] Source #
Show a => Show1 (Either a) | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> Either a a0 -> ShowS Source # liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [Either a a0] -> ShowS Source #
NFData a => NFData1 (Either a) | Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a0 -> ()) -> Either a a0 -> () Source #
Applicative (Either e) | Since: base-3.0
Instance details Defined in GHC.Internal.Data.Either Methods pure :: a -> Either e a Source # (<*>) :: Either e (a -> b) -> Either e a -> Either e b Source # liftA2 :: (a -> b -> c) -> Either e a -> Either e b -> Either e c Source # (*>) :: Either e a -> Either e b -> Either e b Source # (<*) :: Either e a -> Either e b -> Either e a Source #
Functor (Either a) | Since: base-3.0
Instance details Defined in GHC.Internal.Data.Either Methods fmap :: (a0 -> b) -> Either a a0 -> Either a b Source # (<$) :: a0 -> Either a b -> Either a a0 Source #
Monad (Either e) | Since: base-4.4.0.0
Instance details Defined in GHC.Internal.Data.Either Methods (>>=) :: Either e a -> (a -> Either e b) -> Either e b Source # (>>) :: Either e a -> Either e b -> Either e b Source # return :: a -> Either e a Source #
Foldable (Either a) | Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => Either a m -> m Source #

foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m Source #

foldMap' :: Monoid m => (a0 -> m) -> Either a a0 -> m Source #

foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b Source #

foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b Source #

foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b Source #

foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b Source #

foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 Source #

foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 Source #

toList :: Either a a0 -> [a0] Source #

null :: Either a a0 -> Bool Source #

length :: Either a a0 -> Int Source #

elem :: Eq a0 => a0 -> Either a a0 -> Bool Source #

maximum :: Ord a0 => Either a a0 -> a0 Source #

minimum :: Ord a0 => Either a a0 -> a0 Source #

sum :: Num a0 => Either a a0 -> a0 Source #

product :: Num a0 => Either a a0 -> a0 Source #

Traversable (Either a) | Since: base-4.7.0.0
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a0 -> f b) -> Either a a0 -> f (Either a b) Source # sequenceA :: Applicative f => Either a (f a0) -> f (Either a a0) Source # mapM :: Monad m => (a0 -> m b) -> Either a a0 -> m (Either a b) Source # sequence :: Monad m => Either a (m a0) -> m (Either a a0) Source #
Hashable a => Hashable1 (Either a) |
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a0 -> Int) -> Int -> Either a a0 -> Int Source #
(Arbitrary a, Arbitrary b) => Arbitrary (Either a b) |
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen (Either a b) Source # shrink :: Either a b -> [Either a b] Source #
(CoArbitrary a, CoArbitrary b) => CoArbitrary (Either a b) |
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Either a b -> Gen b0 -> Gen b0 Source #
(Function a, Function b) => Function (Either a b) |
Instance details Defined in Test.QuickCheck.Function Methods function :: (Either a b -> b0) -> Either a b :-> b0 Source #
(Binary a, Binary b) => Binary (Either a b) |
Instance details Defined in Data.Binary.Class Methods put :: Either a b -> Put Source # get :: Get (Either a b) Source # putList :: [Either a b] -> Put Source #
(NFData a, NFData b) => NFData (Either a b) |
Instance details Defined in Control.DeepSeq Methods rnf :: Either a b -> () Source #
Semigroup (Either a b) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Either Methods (<>) :: Either a b -> Either a b -> Either a b Source # sconcat :: NonEmpty (Either a b) -> Either a b Source # stimes :: Integral b0 => b0 -> Either a b -> Either a b Source #
Generic (Either a b) |

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep (Either a b) | Since: base-4.6.0.0

Instance details

Defined in GHC.Internal.Generics

type Rep (Either a b) = D1 ('MetaData "Either" "GHC.Internal.Data.Either" "ghc-internal" 'False) (C1 ('MetaCons "Left" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Right" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 b)))

Methods

from :: Either a b -> Rep (Either a b) x Source #

to :: Rep (Either a b) x -> Either a b Source #

(Read a, Read b) => Read (Either a b) | Since: base-3.0
Instance details Defined in GHC.Internal.Data.Either Methods readsPrec :: Int -> ReadS (Either a b) Source # readList :: ReadS [Either a b] Source # readPrec :: ReadPrec (Either a b) Source # readListPrec :: ReadPrec [Either a b] Source #
(Show a, Show b) => Show (Either a b) | Since: base-3.0
Instance details Defined in GHC.Internal.Data.Either Methods showsPrec :: Int -> Either a b -> ShowS Source # show :: Either a b -> String Source # showList :: [Either a b] -> ShowS Source #
(Eq a, Eq b) => Eq (Either a b) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Either Methods (==) :: Either a b -> Either a b -> Bool Source # (/=) :: Either a b -> Either a b -> Bool Source #
(Ord a, Ord b) => Ord (Either a b) | Since: base-2.1

Instance details

Defined in GHC.Internal.Data.Either

Methods

compare :: Either a b -> Either a b -> Ordering Source #

(<) :: Either a b -> Either a b -> Bool Source #

(<=) :: Either a b -> Either a b -> Bool Source #

(>) :: Either a b -> Either a b -> Bool Source #

(>=) :: Either a b -> Either a b -> Bool Source #

max :: Either a b -> Either a b -> Either a b Source #

min :: Either a b -> Either a b -> Either a b Source #

(Hashable a, Hashable b) => Hashable (Either a b) |
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Either a b -> Int Source # hash :: Either a b -> Int Source #
type Rep1 (Either a :: Type -> Type) | Since: base-4.6.0.0

Instance details

Defined in GHC.Internal.Generics

type Rep1 (Either a :: Type -> Type) = D1 ('MetaData "Either" "GHC.Internal.Data.Either" "ghc-internal" 'False) (C1 ('MetaCons "Left" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Right" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1))

type Rep (Either a b) | Since: base-4.6.0.0

Instance details

Defined in GHC.Internal.Generics

type Rep (Either a b) = D1 ('MetaData "Either" "GHC.Internal.Data.Either" "ghc-internal" 'False) (C1 ('MetaCons "Left" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Right" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 b)))

(^) :: (Num a, Integral b) => a -> b -> a infixr 8 Source #

raise a number to a non-negative integral power

(&&) :: Bool -> Bool -> Bool infixr 3 Source #

Boolean "and", lazy in the second argument

(||) :: Bool -> Bool -> Bool infixr 2 Source #

Boolean "or", lazy in the second argument

not :: Bool -> Bool Source #

Boolean "not"

fst :: (a, b) -> a Source #

Extract the first component of a pair.

snd :: (a, b) -> b Source #

Extract the second component of a pair.

curry :: ((a, b) -> c) -> a -> b -> c Source #

Convert an uncurried function to a curried function.

#### Examples

Expand

    >>> curry fst 1 2
    1

uncurry :: (a -> b -> c) -> (a, b) -> c Source #

`uncurry` converts a curried function to a function on pairs.

#### Examples

Expand

    >>> uncurry (+) (1,2)
    3

    >>> uncurry ($) (show, 1)
    "1"

    >>> map (uncurry max) [(1,2), (3,4), (6,8)]
    [2,4,8]

errorWithoutStackTrace :: [Char] -> a Source #

A variant of `error` that does not produce a stack trace.

Since: base-4.9.0.0

undefined :: HasCallStack => a Source #

A special case of `error`. It is expected that compilers will recognize this and insert error messages which are more appropriate to the context in which `undefined` appears.

(=<<) :: Monad m => (a -> m b) -> m a -> m b infixr 1 Source #

Same as `>>=`, but with the arguments interchanged.

    as >>= f == f =<< as

id :: a -> a Source #

Identity function.

    id x = x

This function might seem useless at first glance, but it can be very useful in a higher order context.

#### Examples

Expand

    >>> length $ filter id [True, True, False, True]
    3

    >>> Just (Just 3) >>= id
    Just 3

    >>> foldr id 0 [(^3), (*5), (+2)]
    1000

(.) :: (b -> c) -> (a -> b) -> a -> c infixr 9 Source #

Right to left function composition.

    (f . g) x = f (g x)

    f . id = f = id . f

#### Examples

Expand

    >>> map ((*2) . length) [[], [0, 1, 2], [0]]
    [0,6,2]

    >>> foldr (.) id [(+1), (*3), (^3)] 2
    25

    >>> let (...) = (.).(.) in ((*2)...(+)) 5 10
    30

flip :: (a -> b -> c) -> b -> a -> c Source #

``flip` f` takes its (first) two arguments in the reverse order of `f`.

    flip f x y = f y x

    flip . flip = id

#### Examples

Expand

    >>> flip (++) "hello" "world"
    "worldhello"

    >>> let (.>) = flip (.) in (+1) .> show $ 5
    "6"

($!) :: (a -> b) -> a -> b infixr 0 Source #

Strict (call-by-value) application operator. It takes a function and an argument, evaluates the argument to weak head normal form (WHNF), then calls the function with that value.

until :: (a -> Bool) -> (a -> a) -> a -> a Source #

``until` p f` yields the result of applying `f` until `p` holds.

asTypeOf :: a -> a -> a Source #

`asTypeOf` is a type-restricted version of `const`. It is usually used as an infix operator, and its typing forces its first argument (which is usually overloaded) to have the same type as the second.

subtract :: Num a => a -> a -> a Source #

the same as ``flip` (`-`)`.

Because `-` is treated specially in the Haskell grammar, `(-` e`)` is not a section, but an application of prefix negation. However, `(`subtract`` exp`)` is equivalent to the disallowed section.

maybe :: b -> (a -> b) -> Maybe a -> b Source #

The `maybe` function takes a default value, a function, and a `Maybe` value. If the `Maybe` value is `Nothing`, the function returns the default value. Otherwise, it applies the function to the value inside the `Just` and returns the result.

#### Examples

Expand

Basic usage:

    >>> maybe False odd (Just 3)
    True

    >>> maybe False odd Nothing
    False

Read an integer from a string using `readMaybe`. If we succeed, return twice the integer; that is, apply `(*2)` to it. If instead we fail to parse an integer, return `0` by default:

    >>> import GHC.Internal.Text.Read ( readMaybe )
    >>> maybe 0 (*2) (readMaybe "5")
    10
    >>> maybe 0 (*2) (readMaybe "")
    0

Apply `show` to a `Maybe Int`. If we have `Just n`, we want to show the underlying `Int` `n`. But if we have `Nothing`, we return the empty string instead of (for example) "Nothing":

    >>> maybe "" show (Just 5)
    "5"
    >>> maybe "" show Nothing
    ""

head :: HasCallStack => [a] -> a Source #

\(\mathcal{O}(1)\). Extract the first element of a list, which must be non-empty.

To disable the warning about partiality put `{-# OPTIONS_GHC -Wno-x-partial -Wno-unrecognised-warning-flags #-}` at the top of the file. To disable it throughout a package put the same options into `ghc-options` section of Cabal file. To disable it in GHCi put `:set -Wno-x-partial -Wno-unrecognised-warning-flags` into `~/.ghci` config file. See also the migration guide.

##### Examples

Expand

    >>> head [1, 2, 3]
    1

    >>> head [1..]
    1

    >>> head []
    *** Exception: Prelude.head: empty list

tail :: HasCallStack => [a] -> [a] Source #

\(\mathcal{O}(1)\). Extract the elements after the head of a list, which must be non-empty.

To disable the warning about partiality put `{-# OPTIONS_GHC -Wno-x-partial -Wno-unrecognised-warning-flags #-}` at the top of the file. To disable it throughout a package put the same options into `ghc-options` section of Cabal file. To disable it in GHCi put `:set -Wno-x-partial -Wno-unrecognised-warning-flags` into `~/.ghci` config file. See also the migration guide.

#### Examples

Expand

    >>> tail [1, 2, 3]
    [2,3]

    >>> tail [1]
    []

    >>> tail []
    *** Exception: Prelude.tail: empty list

last :: HasCallStack => [a] -> a Source #

\(\mathcal{O}(n)\). Extract the last element of a list, which must be finite and non-empty.

WARNING: This function is partial. Consider using `unsnoc` instead.

#### Examples

Expand

    >>> last [1, 2, 3]
    3

    >>> last [1..]
    * Hangs forever *

    >>> last []
    *** Exception: Prelude.last: empty list

init :: HasCallStack => [a] -> [a] Source #

\(\mathcal{O}(n)\). Return all the elements of a list except the last one. The list must be non-empty.

WARNING: This function is partial. Consider using `unsnoc` instead.

#### Examples

Expand

    >>> init [1, 2, 3]
    [1,2]

    >>> init [1]
    []

    >>> init []
    *** Exception: Prelude.init: empty list

scanl :: (b -> a -> b) -> b -> [a] -> [b] Source #

\(\mathcal{O}(n)\). `scanl` is similar to `foldl`, but returns a list of successive reduced values from the left:

    scanl f z [x1, x2, ...] == [z, z `f` x1, (z `f` x1) `f` x2, ...]

Note that

    last (scanl f z xs) == foldl f z xs

#### Examples

Expand

    >>> scanl (+) 0 [1..4]
    [0,1,3,6,10]

    >>> scanl (+) 42 []
    [42]

    >>> scanl (-) 100 [1..4]
    [100,99,97,94,90]

    >>> scanl (\reversedString nextChar -> nextChar : reversedString) "foo" ['a', 'b', 'c', 'd']
    ["foo","afoo","bafoo","cbafoo","dcbafoo"]

    >>> take 10 (scanl (+) 0 [1..])
    [0,1,3,6,10,15,21,28,36,45]

    >>> take 1 (scanl undefined 'a' undefined)
    "a"

scanl1 :: (a -> a -> a) -> [a] -> [a] Source #

\(\mathcal{O}(n)\). `scanl1` is a variant of `scanl` that has no starting value argument:

    scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]

#### Examples

Expand

    >>> scanl1 (+) [1..4]
    [1,3,6,10]

    >>> scanl1 (+) []
    []

    >>> scanl1 (-) [1..4]
    [1,-1,-4,-8]

    >>> scanl1 (&&) [True, False, True, True]
    [True,False,False,False]

    >>> scanl1 (||) [False, False, True, True]
    [False,False,True,True]

    >>> take 10 (scanl1 (+) [1..])
    [1,3,6,10,15,21,28,36,45,55]

    >>> take 1 (scanl1 undefined ('a' : undefined))
    "a"

scanr :: (a -> b -> b) -> b -> [a] -> [b] Source #

\(\mathcal{O}(n)\). `scanr` is the right-to-left dual of `scanl`. Note that the order of parameters on the accumulating function are reversed compared to `scanl`. Also note that

    head (scanr f z xs) == foldr f z xs.

#### Examples

Expand

    >>> scanr (+) 0 [1..4]
    [10,9,7,4,0]

    >>> scanr (+) 42 []
    [42]

    >>> scanr (-) 100 [1..4]
    [98,-97,99,-96,100]

    >>> scanr (\nextChar reversedString -> nextChar : reversedString) "foo" ['a', 'b', 'c', 'd']
    ["abcdfoo","bcdfoo","cdfoo","dfoo","foo"]

    >>> force $ scanr (+) 0 [1..]
    *** Exception: stack overflow

scanr1 :: (a -> a -> a) -> [a] -> [a] Source #

\(\mathcal{O}(n)\). `scanr1` is a variant of `scanr` that has no starting value argument.

#### Examples

Expand

    >>> scanr1 (+) [1..4]
    [10,9,7,4]

    >>> scanr1 (+) []
    []

    >>> scanr1 (-) [1..4]
    [-2,3,-1,4]

    >>> scanr1 (&&) [True, False, True, True]
    [False,False,True,True]

    >>> scanr1 (||) [True, True, False, False]
    [True,True,False,False]

    >>> force $ scanr1 (+) [1..]
    *** Exception: stack overflow

iterate :: (a -> a) -> a -> [a] Source #

`iterate` `f x` returns an infinite list of repeated applications of `f` to `x`:

    iterate f x == [x, f x, f (f x), ...]

#### Laziness

Expand

Note that `iterate` is lazy, potentially leading to thunk build-up if the consumer doesn't force each iterate. See `iterate'` for a strict variant of this function.

    >>> take 1 $ iterate undefined 42
    [42]

#### Examples

Expand

    >>> take 10 $ iterate not True
    [True,False,True,False,True,False,True,False,True,False]

    >>> take 10 $ iterate (+3) 42
    [42,45,48,51,54,57,60,63,66,69]

`iterate id == `repeat``:

    >>> take 10 $ iterate id 1
    [1,1,1,1,1,1,1,1,1,1]

repeat :: a -> [a] Source #

`repeat` `x` is an infinite list, with `x` the value of every element.

#### Examples

Expand

    >>> take 10 $ repeat 17
    [17,17,17,17,17,17,17,17,17, 17]

    >>> repeat undefined
    [*** Exception: Prelude.undefined

replicate :: Int -> a -> [a] Source #

`replicate` `n x` is a list of length `n` with `x` the value of every element. It is an instance of the more general `genericReplicate`, in which `n` may be of any integral type.

#### Examples

Expand

    >>> replicate 0 True
    []

    >>> replicate (-1) True
    []

    >>> replicate 4 True
    [True,True,True,True]

takeWhile :: (a -> Bool) -> [a] -> [a] Source #

`takeWhile`, applied to a predicate `p` and a list `xs`, returns the longest prefix (possibly empty) of `xs` of elements that satisfy `p`.

#### Laziness

Expand

    >>> takeWhile (const False) undefined
    *** Exception: Prelude.undefined

    >>> takeWhile (const False) (undefined : undefined)
    []

    >>> take 1 (takeWhile (const True) (1 : undefined))
    [1]

#### Examples

Expand

    >>> takeWhile (< 3) [1,2,3,4,1,2,3,4]
    [1,2]

    >>> takeWhile (< 9) [1,2,3]
    [1,2,3]

    >>> takeWhile (< 0) [1,2,3]
    []

dropWhile :: (a -> Bool) -> [a] -> [a] Source #

`dropWhile` `p xs` returns the suffix remaining after `takeWhile` `p xs`.

#### Examples

Expand

    >>> dropWhile (< 3) [1,2,3,4,5,1,2,3]
    [3,4,5,1,2,3]

    >>> dropWhile (< 9) [1,2,3]
    []

    >>> dropWhile (< 0) [1,2,3]
    [1,2,3]

take :: Int -> [a] -> [a] Source #

`take` `n`, applied to a list `xs`, returns the prefix of `xs` of length `n`, or `xs` itself if `n >= `length` xs`.

It is an instance of the more general `genericTake`, in which `n` may be of any integral type.

#### Laziness

Expand

    >>> take 0 undefined
    []
    >>> take 2 (1 : 2 : undefined)
    [1,2]

#### Examples

Expand

    >>> take 5 "Hello World!"
    "Hello"

    >>> take 3 [1,2,3,4,5]
    [1,2,3]

    >>> take 3 [1,2]
    [1,2]

    >>> take 3 []
    []

    >>> take (-1) [1,2]
    []

    >>> take 0 [1,2]
    []

drop :: Int -> [a] -> [a] Source #

`drop` `n xs` returns the suffix of `xs` after the first `n` elements, or `[]` if `n >= `length` xs`.

It is an instance of the more general `genericDrop`, in which `n` may be of any integral type.

#### Examples

Expand

    >>> drop 6 "Hello World!"
    "World!"

    >>> drop 3 [1,2,3,4,5]
    [4,5]

    >>> drop 3 [1,2]
    []

    >>> drop 3 []
    []

    >>> drop (-1) [1,2]
    [1,2]

    >>> drop 0 [1,2]
    [1,2]

splitAt :: Int -> [a] -> ([a], [a]) Source #

`splitAt` `n xs` returns a tuple where first element is `xs` prefix of length `n` and second element is the remainder of the list:

`splitAt` is an instance of the more general `genericSplitAt`, in which `n` may be of any integral type.

#### Laziness

Expand

It is equivalent to `(`take` n xs, `drop` n xs)` unless `n` is `_|_`: `splitAt _|_ xs = _|_`, not `(_|_, _|_)`).

The first component of the tuple is produced lazily:

    >>> fst (splitAt 0 undefined)
    []

    >>> take 1 (fst (splitAt 10 (1 : undefined)))
    [1]

#### Examples

Expand

    >>> splitAt 6 "Hello World!"
    ("Hello ","World!")

    >>> splitAt 3 [1,2,3,4,5]
    ([1,2,3],[4,5])

    >>> splitAt 1 [1,2,3]
    ([1],[2,3])

    >>> splitAt 3 [1,2,3]
    ([1,2,3],[])

    >>> splitAt 4 [1,2,3]
    ([1,2,3],[])

    >>> splitAt 0 [1,2,3]
    ([],[1,2,3])

    >>> splitAt (-1) [1,2,3]
    ([],[1,2,3])

span :: (a -> Bool) -> [a] -> ([a], [a]) Source #

`span`, applied to a predicate `p` and a list `xs`, returns a tuple where first element is the longest prefix (possibly empty) of `xs` of elements that satisfy `p` and second element is the remainder of the list:

`span` `p xs` is equivalent to `(`takeWhile` p xs, `dropWhile` p xs)`, even if `p` is `_|_`.

#### Laziness

Expand

    >>> span undefined []
    ([],[])
    >>> fst (span (const False) undefined)
    *** Exception: Prelude.undefined
    >>> fst (span (const False) (undefined : undefined))
    []
    >>> take 1 (fst (span (const True) (1 : undefined)))
    [1]

`span` produces the first component of the tuple lazily:

    >>> take 10 (fst (span (const True) [1..]))
    [1,2,3,4,5,6,7,8,9,10]

#### Examples

Expand

    >>> span (< 3) [1,2,3,4,1,2,3,4]
    ([1,2],[3,4,1,2,3,4])

    >>> span (< 9) [1,2,3]
    ([1,2,3],[])

    >>> span (< 0) [1,2,3]
    ([],[1,2,3])

break :: (a -> Bool) -> [a] -> ([a], [a]) Source #

`break`, applied to a predicate `p` and a list `xs`, returns a tuple where first element is longest prefix (possibly empty) of `xs` of elements that do not satisfy `p` and second element is the remainder of the list:

`break` `p` is equivalent to ``span` (`not` . p)` and consequently to `(`takeWhile` (`not` . p) xs, `dropWhile` (`not` . p) xs)`, even if `p` is `_|_`.

#### Laziness

Expand

    >>> break undefined []
    ([],[])

    >>> fst (break (const True) undefined)
    *** Exception: Prelude.undefined

    >>> fst (break (const True) (undefined : undefined))
    []

    >>> take 1 (fst (break (const False) (1 : undefined)))
    [1]

`break` produces the first component of the tuple lazily:

    >>> take 10 (fst (break (const False) [1..]))
    [1,2,3,4,5,6,7,8,9,10]

#### Examples

Expand

    >>> break (> 3) [1,2,3,4,1,2,3,4]
    ([1,2,3],[4,1,2,3,4])

    >>> break (< 9) [1,2,3]
    ([],[1,2,3])

    >>> break (> 9) [1,2,3]
    ([1,2,3],[])

reverse :: [a] -> [a] Source #

\(\mathcal{O}(n)\). `reverse` `xs` returns the elements of `xs` in reverse order. `xs` must be finite.

#### Laziness

Expand

`reverse` is lazy in its elements.

    >>> head (reverse [undefined, 1])
    1

    >>> reverse (1 : 2 : undefined)
    *** Exception: Prelude.undefined

#### Examples

Expand

    >>> reverse []
    []

    >>> reverse [42]
    [42]

    >>> reverse [2,5,7]
    [7,5,2]

    >>> reverse [1..]
    * Hangs forever *

and :: Foldable t => t Bool -> Bool Source #

`and` returns the conjunction of a container of Bools. For the result to be `True`, the container must be finite; `False`, however, results from a `False` value finitely far from the left end.

#### Examples

Expand

Basic usage:

    >>> and []
    True

    >>> and [True]
    True

    >>> and [False]
    False

    >>> and [True, True, False]
    False

    >>> and (False : repeat True) -- Infinite list [False,True,True,True,...
    False

    >>> and (repeat True)
    * Hangs forever *

or :: Foldable t => t Bool -> Bool Source #

`or` returns the disjunction of a container of Bools. For the result to be `False`, the container must be finite; `True`, however, results from a `True` value finitely far from the left end.

#### Examples

Expand

Basic usage:

    >>> or []
    False

    >>> or [True]
    True

    >>> or [False]
    False

    >>> or [True, True, False]
    True

    >>> or (True : repeat False) -- Infinite list [True,False,False,False,...
    True

    >>> or (repeat False)
    * Hangs forever *

any :: Foldable t => (a -> Bool) -> t a -> Bool Source #

Determines whether any element of the structure satisfies the predicate.

#### Examples

Expand

Basic usage:

    >>> any (> 3) []
    False

    >>> any (> 3) [1,2]
    False

    >>> any (> 3) [1,2,3,4,5]
    True

    >>> any (> 3) [1..]
    True

    >>> any (> 3) [0, -1..]
    * Hangs forever *

notElem :: (Foldable t, Eq a) => a -> t a -> Bool infix 4 Source #

`notElem` is the negation of `elem`.

#### Examples

Expand

Basic usage:

    >>> 3 `notElem` []
    True

    >>> 3 `notElem` [1,2]
    True

    >>> 3 `notElem` [1,2,3,4,5]
    False

For infinite structures, `notElem` terminates if the value exists at a finite distance from the left side of the structure:

    >>> 3 `notElem` [1..]
    False

    >>> 3 `notElem` ([4..] ++ [3])
    * Hangs forever *

lookup :: Eq a => a -> [(a, b)] -> Maybe b Source #

\(\mathcal{O}(n)\). `lookup` `key assocs` looks up a key in an association list. For the result to be `Nothing`, the list must be finite.

#### Examples

Expand

    >>> lookup 2 []
    Nothing

    >>> lookup 2 [(1, "first")]
    Nothing

    >>> lookup 2 [(1, "first"), (2, "second"), (3, "third")]
    Just "second"

concatMap :: Foldable t => (a -> [b]) -> t a -> [b] Source #

Map a function over all the elements of a container and concatenate the resulting lists.

#### Examples

Expand

Basic usage:

    >>> concatMap (take 3) [[1..], [10..], [100..], [1000..]]
    [1,2,3,10,11,12,100,101,102,1000,1001,1002]

    >>> concatMap (take 3) (Just [1..])
    [1,2,3]

(!!) :: HasCallStack => [a] -> Int -> a infixl 9 Source #

List index (subscript) operator, starting from 0. It is an instance of the more general `genericIndex`, which takes an index of any integral type.

WARNING: This function is partial, and should only be used if you are sure that the indexing will not fail. Otherwise, use `!?`.

WARNING: This function takes linear time in the index.

#### Examples

Expand

    >>> ['a', 'b', 'c'] !! 0
    'a'

    >>> ['a', 'b', 'c'] !! 2
    'c'

    >>> ['a', 'b', 'c'] !! 3
    *** Exception: Prelude.!!: index too large

    >>> ['a', 'b', 'c'] !! (-1)
    *** Exception: Prelude.!!: negative index

zip3 :: [a] -> [b] -> [c] -> [(a, b, c)] Source #

`zip3` takes three lists and returns a list of triples, analogous to `zip`. It is capable of list fusion, but it is restricted to its first list argument and its resulting list.

zipWith :: (a -> b -> c) -> [a] -> [b] -> [c] Source #

\(\mathcal{O}(\min(m,n))\). `zipWith` generalises `zip` by zipping with the function given as the first argument, instead of a tupling function.

    zipWith (,) xs ys == zip xs ys
    zipWith f [x1,x2,x3..] [y1,y2,y3..] == [f x1 y1, f x2 y2, f x3 y3..]

`zipWith` is right-lazy:

    >>> let f = undefined
    >>> zipWith f [] undefined
    []

`zipWith` is capable of list fusion, but it is restricted to its first list argument and its resulting list.

#### Examples

Expand

``zipWith` `(+)`` can be applied to two lists to produce the list of corresponding sums:

    >>> zipWith (+) [1, 2, 3] [4, 5, 6]
    [5,7,9]

    >>> zipWith (++) ["hello ", "foo"] ["world!", "bar"]
    ["hello world!","foobar"]

zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d] Source #

\(\mathcal{O}(\min(l,m,n))\). The `zipWith3` function takes a function which combines three elements, as well as three lists and returns a list of the function applied to corresponding elements, analogous to `zipWith`. It is capable of list fusion, but it is restricted to its first list argument and its resulting list.

    zipWith3 (,,) xs ys zs == zip3 xs ys zs
    zipWith3 f [x1,x2,x3..] [y1,y2,y3..] [z1,z2,z3..] == [f x1 y1 z1, f x2 y2 z2, f x3 y3 z3..]

#### Examples

Expand

    >>> zipWith3 (\x y z -> [x, y, z]) "123" "abc" "xyz"
    ["1ax","2by","3cz"]

    >>> zipWith3 (\x y z -> (x * y) + z) [1, 2, 3] [4, 5, 6] [7, 8, 9]
    [11,18,27]

unzip :: [(a, b)] -> ([a], [b]) Source #

`unzip` transforms a list of pairs into a list of first components and a list of second components.

#### Examples

Expand

    >>> unzip []
    ([],[])

    >>> unzip [(1, 'a'), (2, 'b')]
    ([1,2],"ab")

unzip3 :: [(a, b, c)] -> ([a], [b], [c]) Source #

The `unzip3` function takes a list of triples and returns three lists of the respective components, analogous to `unzip`.

#### Examples

Expand

    >>> unzip3 []
    ([],[],[])

    >>> unzip3 [(1, 'a', True), (2, 'b', False)]
    ([1,2],"ab",[True,False])

type ShowS = String -> String Source #

The `shows` functions return a function that prepends the output `String` to an existing `String`. This allows constant-time concatenation of results using function composition.

shows :: Show a => a -> ShowS Source #

equivalent to `showsPrec` with a precedence of 0.

showChar :: Char -> ShowS Source #

utility function converting a `Char` to a show function that simply prepends the character unchanged.

showString :: String -> ShowS Source #

utility function converting a `String` to a show function that simply prepends the string unchanged.

showParen :: Bool -> ShowS -> ShowS Source #

utility function that surrounds the inner show function with parentheses when the `Bool` parameter is `True`.

even :: Integral a => a -> Bool Source #

odd :: Integral a => a -> Bool Source #

(^^) :: (Fractional a, Integral b) => a -> b -> a infixr 8 Source #

raise a number to an integral power

gcd :: Integral a => a -> a -> a Source #

``gcd` x y` is the non-negative factor of both `x` and `y` of which every common factor of `x` and `y` is also a factor; for example ``gcd` 4 2 = 2`, ``gcd` (-4) 6 = 2`, ``gcd` 0 4` = `4`. ``gcd` 0 0` = `0`. (That is, the common divisor that is "greatest" in the divisibility preordering.)

Note: Since for signed fixed-width integer types, ``abs` `minBound` < 0`, the result may be negative if one of the arguments is ``minBound`` (and necessarily is if the other is `0` or ``minBound``) for such types.

lcm :: Integral a => a -> a -> a Source #

``lcm` x y` is the smallest positive integer that both `x` and `y` divide.

(<$>) :: Functor f => (a -> b) -> f a -> f b infixl 4 Source #

An infix synonym for `fmap`.

The name of this operator is an allusion to `$`. Note the similarities between their types:

     ($)  ::              (a -> b) ->   a ->   b
    (<$>) :: Functor f => (a -> b) -> f a -> f b

Whereas `$` is function application, `<$>` is function application lifted over a `Functor`.

#### Examples

Expand

Convert from a ``Maybe` `Int`` to a ``Maybe` `String`` using `show`:

    >>> show <$> Nothing
    Nothing

    >>> show <$> Just 3
    Just "3"

Convert from an ``Either` `Int` `Int`` to an ``Either` `Int`` `String` using `show`:

    >>> show <$> Left 17
    Left 17

    >>> show <$> Right 17
    Right "17"

Double each element of a list:

    >>> (*2) <$> [1,2,3]
    [2,4,6]

Apply `even` to the second element of a pair:

    >>> even <$> (2,2)
    (2,True)

type ReadS a = String -> [(a, String)] Source #

A parser for a type `a`, represented as a function that takes a `String` and returns a list of possible parses as `(a,`String`)` pairs.

Note that this kind of backtracking parser is very inefficient; reading a large structure may be quite slow (cf `ReadP`).

lex :: ReadS String Source #

The `lex` function reads a single lexeme from the input, discarding initial white space, and returning the characters that constitute the lexeme. If the input string contains only white space, `lex` returns a single successful `lexeme' consisting of the empty string. (Thus ``lex` "" = [("","")]`.) If there is no legal lexeme at the beginning of the input string, `lex` fails (i.e. returns `[]`).

This lexer is not completely faithful to the Haskell lexical syntax in the following respects:

- Qualified names are not handled properly
- Octal and hexadecimal numerics are not recognized as a single token
- Comments are not treated properly

readParen :: Bool -> ReadS a -> ReadS a Source #

``readParen` `True` p` parses what `p` parses, but surrounded with parentheses.

``readParen` `False` p` parses what `p` parses, but optionally surrounded with parentheses.

either :: (a -> c) -> (b -> c) -> Either a b -> c Source #

Case analysis for the `Either` type. If the value is ``Left` a`, apply the first function to `a`; if it is ``Right` b`, apply the second function to `b`.

#### Examples

Expand

We create two values of type ``Either` `String` `Int``, one using the `Left` constructor and another using the `Right` constructor. Then we apply "either" the `length` function (if we have a `String`) or the "times-two" function (if we have an `Int`):

    >>> let s = Left "foo" :: Either String Int
    >>> let n = Right 3 :: Either String Int
    >>> either length (*2) s
    3
    >>> either length (*2) n
    6

reads :: Read a => ReadS a Source #

equivalent to `readsPrec` with a precedence of 0.

read :: Read a => String -> a Source #

The `read` function reads input from a string, which must be completely consumed by the input process. `read` fails with an `error` if the parse is unsuccessful, and it is therefore discouraged from being used in real applications. Use `readMaybe` or `readEither` for safe alternatives.

    >>> read "123" :: Int
    123

    >>> read "hello" :: Int
    *** Exception: Prelude.read: no parse

sequence_ :: (Foldable t, Monad m) => t (m a) -> m () Source #

Evaluate each monadic action in the structure from left to right, and ignore the results. For a version that doesn't ignore the results see `sequence`.

`sequence_` is just like `sequenceA_`, but specialised to monadic actions.

lines :: String -> [String] Source #

Splits the argument into a list of lines stripped of their terminating `\n` characters. The `\n` terminator is optional in a final non-empty line of the argument string.

When the argument string is empty, or ends in a `\n` character, it can be recovered by passing the result of `lines` to the `unlines` function. Otherwise, `unlines` appends the missing terminating `\n`. This makes `unlines . lines` idempotent:

    (unlines . lines) . (unlines . lines) = (unlines . lines)

#### Examples

Expand

    >>> lines ""           -- empty input contains no lines
    []

    >>> lines "\n"         -- single empty line
    [""]

    >>> lines "one"        -- single unterminated line
    ["one"]

    >>> lines "one\n"      -- single non-empty line
    ["one"]

    >>> lines "one\n\n"    -- second line is empty
    ["one",""]

    >>> lines "one\ntwo"   -- second line is unterminated
    ["one","two"]

    >>> lines "one\ntwo\n" -- two non-empty lines
    ["one","two"]

unlines :: [String] -> String Source #

Appends a `\n` character to each input string, then concatenates the results. Equivalent to ``foldMap` (s -> s `++` "\n")`.

#### Examples

Expand

    >>> unlines ["Hello", "World", "!"]
    "Hello\nWorld\n!\n"

Note that ``unlines` `.` `lines` `/=` `id`` when the input is not `\n`-terminated:

    >>> unlines . lines $ "foo\nbar"
    "foo\nbar\n"

words :: String -> [String] Source #

`words` breaks a string up into a list of words, which were delimited by white space (as defined by `isSpace`). This function trims any white spaces at the beginning and at the end.

#### Examples

Expand

    >>> words "Lorem ipsum\ndolor"
    ["Lorem","ipsum","dolor"]

    >>> words " foo bar "
    ["foo","bar"]

unwords :: [String] -> String Source #

`unwords` joins words with separating spaces (U+0020 SPACE).

`unwords` is neither left nor right inverse of `words`:

    >>> words (unwords [" "])
    []
    >>> unwords (words "foo\nbar")
    "foo bar"

#### Examples

Expand

    >>> unwords ["Lorem", "ipsum", "dolor"]
    "Lorem ipsum dolor"

    >>> unwords ["foo", "bar", "", "baz"]
    "foo bar  baz"

type IOError = IOException Source #

The Haskell 2010 type for exceptions in the `IO` monad. Any I/O operation may raise an `IOError` instead of returning a result. For a more general type of exception, including also those that arise in pure code, see `Exception`.

In Haskell 2010, this is an opaque type.

userError :: String -> IOError Source #

Construct an `IOError` value with a string describing the error. The `fail` method of the `IO` instance of the `Monad` class raises a `userError`, thus:

    instance Monad IO where
      ...
      fail s = ioError (userError s)

type FilePath = String Source #

File and directory names are values of type `String`, whose precise meaning is operating system dependent. Files can be opened, yielding a handle which can then be used to operate on the contents of that file.

ioError :: IOError -> IO a Source #

Raise an `IOError` in the `IO` monad.

putChar :: Char -> IO () Source #

Write a character to the standard output device (same as `hPutChar` `stdout`).

putStr :: String -> IO () Source #

Write a string to the standard output device (same as `hPutStr` `stdout`).

putStrLn :: String -> IO () Source #

The same as `putStr`, but adds a newline character.

getChar :: IO Char Source #

Read a character from the standard input device (same as `hGetChar` `stdin`).

getLine :: IO String Source #

Read a line from the standard input device (same as `hGetLine` `stdin`).

getContents :: IO String Source #

The `getContents` operation returns all user input as a single string, which is read lazily as it is needed (same as `hGetContents` `stdin`).

interact :: (String -> String) -> IO () Source #

The `interact` function takes a function of type `String->String` as its argument. The entire input from the standard input device is passed to this function as its argument, and the resulting string is output on the standard output device.

writeFile :: FilePath -> String -> IO () Source #

The computation `writeFile` `file str` function writes the string `str`, to the file `file`.

readLn :: Read a => IO a Source #

The `readLn` function combines `getLine` and `readIO`.

readIO :: Read a => String -> IO a Source #

The `readIO` function is similar to `read` except that it signals parse failure to the `IO` monad instead of terminating the program.

void :: Functor f => f a -> f () Source #

``void` value` discards or ignores the result of evaluation, such as the return value of an `IO` action.

#### Examples

Expand

Replace the contents of a ``Maybe` `Int`` with unit:

    >>> void Nothing
    Nothing

    >>> void (Just 3)
    Just ()

Replace the contents of an ``Either` `Int` `Int`` with unit, resulting in an ``Either` `Int` `()``:

    >>> void (Left 8675309)
    Left 8675309

    >>> void (Right 8675309)
    Right ()

Replace every element of a list with unit:

    >>> void [1,2,3]
    [(),(),()]

Replace the second element of a pair with unit:

    >>> void (1,2)
    (1,())

Discard the result of an `IO` action:

    >>> mapM print [1,2]
    1
    2
    [(),()]

    >>> void $ mapM print [1,2]
    1
    2

join :: Monad m => m (m a) -> m a Source #

The `join` function is the conventional monad join operator. It is used to remove one level of monadic structure, projecting its bound argument into the outer level.

'``join` bss`' can be understood as the `do` expression

    do bs <- bss
       bs

#### Examples

Expand

    >>> join [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
    [1,2,3,4,5,6,7,8,9]

    >>> join (Just (Just 3))
    Just 3

A common use of `join` is to run an `IO` computation returned from an `STM` transaction, since `STM` transactions can't perform `IO` directly. Recall that

    atomically :: STM a -> IO a

is used to run `STM` transactions atomically. So, by specializing the types of `atomically` and `join` to

    atomically :: STM (IO b) -> IO (IO b)
    join       :: IO (IO b)  -> IO b

we can compose them as

    join . atomically :: STM (IO b) -> IO b

to run an `STM` transaction and the `IO` action it returns.

class Applicative m => Monad (m :: Type -> Type) where Source #

The `Monad` class defines the basic operations over a monad, a concept from a branch of mathematics known as category theory. From the perspective of a Haskell programmer, however, it is best to think of a monad as an abstract datatype of actions. Haskell's `do` expressions provide a convenient syntax for writing monadic expressions.

Instances of `Monad` should satisfy the following:

Left identity
  ``return` a `>>=` k = k a`
Right identity
  `m `>>=` `return` = m`
Associativity
  `m `>>=` (\x -> k x `>>=` h) = (m `>>=` k) `>>=` h`

Furthermore, the `Monad` and `Applicative` operations should relate as follows:

-     pure = return

-     m1 <*> m2 = m1 >>= (\x1 -> m2 >>= (\x2 -> return (x1 x2)))

The above laws imply:

-     fmap f xs  =  xs >>= return . f

-     (>>) = (*>)

and that `pure` and (`<*>`) satisfy the applicative functor laws.

The instances of `Monad` for `List`, `Maybe` and `IO` defined in the Prelude satisfy these laws.

Minimal complete definition

(>>=)

Methods

(>>=) :: m a -> (a -> m b) -> m b infixl 1 Source #

Sequentially compose two actions, passing any value produced by the first as an argument to the second.

'`as `>>=` bs`' can be understood as the `do` expression

    do a <- as
       bs a

An alternative name for this function is 'bind', but some people may refer to it as 'flatMap', which results from it being equivialent to

    \x f -> join (fmap f x) :: Monad m => m a -> (a -> m b) -> m b

which can be seen as mapping a value with `Monad m => m a -> m (m b)` and then 'flattening' `m (m b)` to `m b` using `join`.

(>>) :: m a -> m b -> m b infixl 1 Source #

Sequentially compose two actions, discarding any value produced by the first, like sequencing operators (such as the semicolon) in imperative languages.

'`as `>>` bs`' can be understood as the `do` expression

    do as
       bs

or in terms of ``(>>=)`` as

    as >>= const bs

return :: a -> m a Source #

Inject a value into the monadic type. This function should not be different from its default implementation as `pure`. The justification for the existence of this function is merely historic.

#### Instances

Instances details

Monad Strategy Source # |
Instance details Defined in Game.LambdaHack.Client.AI.Strategy Methods (>>=) :: Strategy a -> (a -> Strategy b) -> Strategy b Source # (>>) :: Strategy a -> Strategy b -> Strategy b Source # return :: a -> Strategy a Source #
Monad Frequency Source # |
Instance details Defined in Game.LambdaHack.Core.Frequency Methods (>>=) :: Frequency a -> (a -> Frequency b) -> Frequency b Source # (>>) :: Frequency a -> Frequency b -> Frequency b Source # return :: a -> Frequency a Source #
Monad CliImplementation Source # |
Instance details Defined in Implementation.MonadClientImplementation Methods (>>=) :: CliImplementation a -> (a -> CliImplementation b) -> CliImplementation b Source # (>>) :: CliImplementation a -> CliImplementation b -> CliImplementation b Source # return :: a -> CliImplementation a Source #
Monad SerImplementation Source # |
Instance details Defined in Implementation.MonadServerImplementation Methods (>>=) :: SerImplementation a -> (a -> SerImplementation b) -> SerImplementation b Source # (>>) :: SerImplementation a -> SerImplementation b -> SerImplementation b Source # return :: a -> SerImplementation a Source #
Monad Gen |
Instance details Defined in Test.QuickCheck.Gen Methods (>>=) :: Gen a -> (a -> Gen b) -> Gen b Source # (>>) :: Gen a -> Gen b -> Gen b Source # return :: a -> Gen a Source #
Monad Rose |
Instance details Defined in Test.QuickCheck.Property Methods (>>=) :: Rose a -> (a -> Rose b) -> Rose b Source # (>>) :: Rose a -> Rose b -> Rose b Source # return :: a -> Rose a Source #
Monad IResult |
Instance details Defined in Data.Aeson.Types.Internal Methods (>>=) :: IResult a -> (a -> IResult b) -> IResult b Source # (>>) :: IResult a -> IResult b -> IResult b Source # return :: a -> IResult a Source #
Monad Parser |
Instance details Defined in Data.Aeson.Types.Internal Methods (>>=) :: Parser a -> (a -> Parser b) -> Parser b Source # (>>) :: Parser a -> Parser b -> Parser b Source # return :: a -> Parser a Source #
Monad Result |
Instance details Defined in Data.Aeson.Types.Internal Methods (>>=) :: Result a -> (a -> Result b) -> Result b Source # (>>) :: Result a -> Result b -> Result b Source # return :: a -> Result a Source #
Monad Complex | Since: base-4.9.0.0
Instance details Defined in Data.Complex Methods (>>=) :: Complex a -> (a -> Complex b) -> Complex b Source # (>>) :: Complex a -> Complex b -> Complex b Source # return :: a -> Complex a Source #
Monad First | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (>>=) :: First a -> (a -> First b) -> First b Source # (>>) :: First a -> First b -> First b Source # return :: a -> First a Source #
Monad Last | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (>>=) :: Last a -> (a -> Last b) -> Last b Source # (>>) :: Last a -> Last b -> Last b Source # return :: a -> Last a Source #
Monad Max | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (>>=) :: Max a -> (a -> Max b) -> Max b Source # (>>) :: Max a -> Max b -> Max b Source # return :: a -> Max a Source #
Monad Min | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (>>=) :: Min a -> (a -> Min b) -> Min b Source # (>>) :: Min a -> Min b -> Min b Source # return :: a -> Min a Source #
Monad Get |
Instance details Defined in Data.Binary.Get.Internal Methods (>>=) :: Get a -> (a -> Get b) -> Get b Source # (>>) :: Get a -> Get b -> Get b Source # return :: a -> Get a Source #
Monad PutM |
Instance details Defined in Data.Binary.Put Methods (>>=) :: PutM a -> (a -> PutM b) -> PutM b Source # (>>) :: PutM a -> PutM b -> PutM b Source # return :: a -> PutM a Source #
Monad Put |
Instance details Defined in Data.ByteString.Builder.Internal Methods (>>=) :: Put a -> (a -> Put b) -> Put b Source # (>>) :: Put a -> Put b -> Put b Source # return :: a -> Put a Source #
Monad Seq |
Instance details Defined in Data.Sequence.Internal Methods (>>=) :: Seq a -> (a -> Seq b) -> Seq b Source # (>>) :: Seq a -> Seq b -> Seq b Source # return :: a -> Seq a Source #
Monad Tree |
Instance details Defined in Data.Tree Methods (>>=) :: Tree a -> (a -> Tree b) -> Tree b Source # (>>) :: Tree a -> Tree b -> Tree b Source # return :: a -> Tree a Source #
Monad DNonEmpty |
Instance details Defined in Data.DList.DNonEmpty.Internal Methods (>>=) :: DNonEmpty a -> (a -> DNonEmpty b) -> DNonEmpty b Source # (>>) :: DNonEmpty a -> DNonEmpty b -> DNonEmpty b Source # return :: a -> DNonEmpty a Source #
Monad DList |
Instance details Defined in Data.DList.Internal Methods (>>=) :: DList a -> (a -> DList b) -> DList b Source # (>>) :: DList a -> DList b -> DList b Source # return :: a -> DList a Source #
Monad NonEmpty | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (>>=) :: NonEmpty a -> (a -> NonEmpty b) -> NonEmpty b Source # (>>) :: NonEmpty a -> NonEmpty b -> NonEmpty b Source # return :: a -> NonEmpty a Source #
Monad STM | Since: base-4.3.0.0
Instance details Defined in GHC.Internal.Conc.Sync Methods (>>=) :: STM a -> (a -> STM b) -> STM b Source # (>>) :: STM a -> STM b -> STM b Source # return :: a -> STM a Source #
Monad Identity | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Functor.Identity Methods (>>=) :: Identity a -> (a -> Identity b) -> Identity b Source # (>>) :: Identity a -> Identity b -> Identity b Source # return :: a -> Identity a Source #
Monad First | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods (>>=) :: First a -> (a -> First b) -> First b Source # (>>) :: First a -> First b -> First b Source # return :: a -> First a Source #
Monad Last | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods (>>=) :: Last a -> (a -> Last b) -> Last b Source # (>>) :: Last a -> Last b -> Last b Source # return :: a -> Last a Source #
Monad Down | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Data.Ord Methods (>>=) :: Down a -> (a -> Down b) -> Down b Source # (>>) :: Down a -> Down b -> Down b Source # return :: a -> Down a Source #
Monad Dual | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (>>=) :: Dual a -> (a -> Dual b) -> Dual b Source # (>>) :: Dual a -> Dual b -> Dual b Source # return :: a -> Dual a Source #
Monad Product | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (>>=) :: Product a -> (a -> Product b) -> Product b Source # (>>) :: Product a -> Product b -> Product b Source # return :: a -> Product a Source #
Monad Sum | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (>>=) :: Sum a -> (a -> Sum b) -> Sum b Source # (>>) :: Sum a -> Sum b -> Sum b Source # return :: a -> Sum a Source #
Monad Par1 | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (>>=) :: Par1 a -> (a -> Par1 b) -> Par1 b Source # (>>) :: Par1 a -> Par1 b -> Par1 b Source # return :: a -> Par1 a Source #
Monad P | Since: base-2.1
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods (>>=) :: P a -> (a -> P b) -> P b Source # (>>) :: P a -> P b -> P b Source # return :: a -> P a Source #
Monad ReadP | Since: base-2.1
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods (>>=) :: ReadP a -> (a -> ReadP b) -> ReadP b Source # (>>) :: ReadP a -> ReadP b -> ReadP b Source # return :: a -> ReadP a Source #
Monad ReadPrec | Since: base-2.1
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadPrec Methods (>>=) :: ReadPrec a -> (a -> ReadPrec b) -> ReadPrec b Source # (>>) :: ReadPrec a -> ReadPrec b -> ReadPrec b Source # return :: a -> ReadPrec a Source #
Monad IO | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods (>>=) :: IO a -> (a -> IO b) -> IO b Source # (>>) :: IO a -> IO b -> IO b Source # return :: a -> IO a Source #
Monad Plucker |
Instance details Defined in Linear.Plucker Methods (>>=) :: Plucker a -> (a -> Plucker b) -> Plucker b Source # (>>) :: Plucker a -> Plucker b -> Plucker b Source # return :: a -> Plucker a Source #
Monad Quaternion |
Instance details Defined in Linear.Quaternion Methods (>>=) :: Quaternion a -> (a -> Quaternion b) -> Quaternion b Source # (>>) :: Quaternion a -> Quaternion b -> Quaternion b Source # return :: a -> Quaternion a Source #
Monad V0 |
Instance details Defined in Linear.V0 Methods (>>=) :: V0 a -> (a -> V0 b) -> V0 b Source # (>>) :: V0 a -> V0 b -> V0 b Source # return :: a -> V0 a Source #
Monad V1 |
Instance details Defined in Linear.V1 Methods (>>=) :: V1 a -> (a -> V1 b) -> V1 b Source # (>>) :: V1 a -> V1 b -> V1 b Source # return :: a -> V1 a Source #
Monad V2 |
Instance details Defined in Linear.V2 Methods (>>=) :: V2 a -> (a -> V2 b) -> V2 b Source # (>>) :: V2 a -> V2 b -> V2 b Source # return :: a -> V2 a Source #
Monad V3 |
Instance details Defined in Linear.V3 Methods (>>=) :: V3 a -> (a -> V3 b) -> V3 b Source # (>>) :: V3 a -> V3 b -> V3 b Source # return :: a -> V3 a Source #
Monad V4 |
Instance details Defined in Linear.V4 Methods (>>=) :: V4 a -> (a -> V4 b) -> V4 b Source # (>>) :: V4 a -> V4 b -> V4 b Source # return :: a -> V4 a Source #
Monad Chunk |
Instance details Defined in Options.Applicative.Help.Chunk Methods (>>=) :: Chunk a -> (a -> Chunk b) -> Chunk b Source # (>>) :: Chunk a -> Chunk b -> Chunk b Source # return :: a -> Chunk a Source #
Monad ComplResult |
Instance details Defined in Options.Applicative.Internal Methods (>>=) :: ComplResult a -> (a -> ComplResult b) -> ComplResult b Source # (>>) :: ComplResult a -> ComplResult b -> ComplResult b Source # return :: a -> ComplResult a Source #
Monad Completion |
Instance details Defined in Options.Applicative.Internal Methods (>>=) :: Completion a -> (a -> Completion b) -> Completion b Source # (>>) :: Completion a -> Completion b -> Completion b Source # return :: a -> Completion a Source #
Monad P |
Instance details Defined in Options.Applicative.Internal Methods (>>=) :: P a -> (a -> P b) -> P b Source # (>>) :: P a -> P b -> P b Source # return :: a -> P a Source #
Monad ParserM |
Instance details Defined in Options.Applicative.Types Methods (>>=) :: ParserM a -> (a -> ParserM b) -> ParserM b Source # (>>) :: ParserM a -> ParserM b -> ParserM b Source # return :: a -> ParserM a Source #
Monad ParserResult |
Instance details Defined in Options.Applicative.Types Methods (>>=) :: ParserResult a -> (a -> ParserResult b) -> ParserResult b Source # (>>) :: ParserResult a -> ParserResult b -> ParserResult b Source # return :: a -> ParserResult a Source #
Monad ReadM |
Instance details Defined in Options.Applicative.Types Methods (>>=) :: ReadM a -> (a -> ReadM b) -> ReadM b Source # (>>) :: ReadM a -> ReadM b -> ReadM b Source # return :: a -> ReadM a Source #
Monad Array |
Instance details Defined in Data.Primitive.Array Methods (>>=) :: Array a -> (a -> Array b) -> Array b Source # (>>) :: Array a -> Array b -> Array b Source # return :: a -> Array a Source #
Monad SmallArray |
Instance details Defined in Data.Primitive.SmallArray Methods (>>=) :: SmallArray a -> (a -> SmallArray b) -> SmallArray b Source # (>>) :: SmallArray a -> SmallArray b -> SmallArray b Source # return :: a -> SmallArray a Source #
Monad V2 |
Instance details Defined in SDL.Internal.Vect Methods (>>=) :: V2 a -> (a -> V2 b) -> V2 b Source # (>>) :: V2 a -> V2 b -> V2 b Source # return :: a -> V2 a Source #
Monad V3 |
Instance details Defined in SDL.Internal.Vect Methods (>>=) :: V3 a -> (a -> V3 b) -> V3 b Source # (>>) :: V3 a -> V3 b -> V3 b Source # return :: a -> V3 a Source #
Monad V4 |
Instance details Defined in SDL.Internal.Vect Methods (>>=) :: V4 a -> (a -> V4 b) -> V4 b Source # (>>) :: V4 a -> V4 b -> V4 b Source # return :: a -> V4 a Source #
Monad PprM |
Instance details Defined in Language.Haskell.TH.PprLib Methods (>>=) :: PprM a -> (a -> PprM b) -> PprM b Source # (>>) :: PprM a -> PprM b -> PprM b Source # return :: a -> PprM a Source #
Monad Q |
Instance details Defined in Language.Haskell.TH.Syntax Methods (>>=) :: Q a -> (a -> Q b) -> Q b Source # (>>) :: Q a -> Q b -> Q b Source # return :: a -> Q a Source #
Monad Vector |
Instance details Defined in Data.Vector Methods (>>=) :: Vector a -> (a -> Vector b) -> Vector b Source # (>>) :: Vector a -> Vector b -> Vector b Source # return :: a -> Vector a Source #
Monad Id |
Instance details Defined in Data.Vector.Fusion.Util Methods (>>=) :: Id a -> (a -> Id b) -> Id b Source # (>>) :: Id a -> Id b -> Id b Source # return :: a -> Id a Source #
Monad Vector |
Instance details Defined in Data.Vector.Strict Methods (>>=) :: Vector a -> (a -> Vector b) -> Vector b Source # (>>) :: Vector a -> Vector b -> Vector b Source # return :: a -> Vector a Source #
Monad Stream |
Instance details Defined in Codec.Compression.Zlib.Stream Methods (>>=) :: Stream a -> (a -> Stream b) -> Stream b Source # (>>) :: Stream a -> Stream b -> Stream b Source # return :: a -> Stream a Source #
Monad Maybe | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods (>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b Source # (>>) :: Maybe a -> Maybe b -> Maybe b Source # return :: a -> Maybe a Source #
Monad Solo | Since: base-4.15
Instance details Defined in GHC.Internal.Base Methods (>>=) :: Solo a -> (a -> Solo b) -> Solo b Source # (>>) :: Solo a -> Solo b -> Solo b Source # return :: a -> Solo a Source #
Monad [] | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods (>>=) :: [a] -> (a -> [b]) -> [b] Source # (>>) :: [a] -> [b] -> [b] Source # return :: a -> [a] Source #
Monad m => Monad (PropertyM m) |
Instance details Defined in Test.QuickCheck.Monadic Methods (>>=) :: PropertyM m a -> (a -> PropertyM m b) -> PropertyM m b Source # (>>) :: PropertyM m a -> PropertyM m b -> PropertyM m b Source # return :: a -> PropertyM m a Source #
Representable f => Monad (Co f) |
Instance details Defined in Data.Functor.Rep Methods (>>=) :: Co f a -> (a -> Co f b) -> Co f b Source # (>>) :: Co f a -> Co f b -> Co f b Source # return :: a -> Co f a Source #
Monad m => Monad (WrappedMonad m) | Since: base-4.7.0.0
Instance details Defined in Control.Applicative Methods (>>=) :: WrappedMonad m a -> (a -> WrappedMonad m b) -> WrappedMonad m b Source # (>>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b Source # return :: a -> WrappedMonad m a Source #
Monad (SetM s) |
Instance details Defined in Data.Graph Methods (>>=) :: SetM s a -> (a -> SetM s b) -> SetM s b Source # (>>) :: SetM s a -> SetM s b -> SetM s b Source # return :: a -> SetM s a Source #
Alternative f => Monad (Cofree f) |
Instance details Defined in Control.Comonad.Cofree Methods (>>=) :: Cofree f a -> (a -> Cofree f b) -> Cofree f b Source # (>>) :: Cofree f a -> Cofree f b -> Cofree f b Source # return :: a -> Cofree f a Source #
Functor f => Monad (Free f) |
Instance details Defined in Control.Monad.Free Methods (>>=) :: Free f a -> (a -> Free f b) -> Free f b Source # (>>) :: Free f a -> Free f b -> Free f b Source # return :: a -> Free f a Source #
ArrowApply a => Monad (ArrowMonad a) | Since: base-2.1
Instance details Defined in GHC.Internal.Control.Arrow Methods (>>=) :: ArrowMonad a a0 -> (a0 -> ArrowMonad a b) -> ArrowMonad a b Source # (>>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b Source # return :: a0 -> ArrowMonad a a0 Source #
Monad (Either e) | Since: base-4.4.0.0
Instance details Defined in GHC.Internal.Data.Either Methods (>>=) :: Either e a -> (a -> Either e b) -> Either e b Source # (>>) :: Either e a -> Either e b -> Either e b Source # return :: a -> Either e a Source #
Monad (U1 :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (>>=) :: U1 a -> (a -> U1 b) -> U1 b Source # (>>) :: U1 a -> U1 b -> U1 b Source # return :: a -> U1 a Source #
Monad (ST s) | Since: base-2.1
Instance details Defined in GHC.Internal.ST Methods (>>=) :: ST s a -> (a -> ST s b) -> ST s b Source # (>>) :: ST s a -> ST s b -> ST s b Source # return :: a -> ST s a Source #
Monad m => Monad (Yoneda m) |
Instance details Defined in Data.Functor.Yoneda Methods (>>=) :: Yoneda m a -> (a -> Yoneda m b) -> Yoneda m b Source # (>>) :: Yoneda m a -> Yoneda m b -> Yoneda m b Source # return :: a -> Yoneda m a Source #
Monad (ReifiedFold s) |
Instance details Defined in Control.Lens.Reified Methods (>>=) :: ReifiedFold s a -> (a -> ReifiedFold s b) -> ReifiedFold s b Source # (>>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b Source # return :: a -> ReifiedFold s a Source #
Monad (ReifiedGetter s) |
Instance details Defined in Control.Lens.Reified Methods (>>=) :: ReifiedGetter s a -> (a -> ReifiedGetter s b) -> ReifiedGetter s b Source # (>>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b Source # return :: a -> ReifiedGetter s a Source #
Monad f => Monad (Point f) |
Instance details Defined in Linear.Affine Methods (>>=) :: Point f a -> (a -> Point f b) -> Point f b Source # (>>) :: Point f a -> Point f b -> Point f b Source # return :: a -> Point f a Source #
Monad m => Monad (ListT m) |
Instance details Defined in Options.Applicative.Internal Methods (>>=) :: ListT m a -> (a -> ListT m b) -> ListT m b Source # (>>) :: ListT m a -> ListT m b -> ListT m b Source # return :: a -> ListT m a Source #
Monad m => Monad (NondetT m) |
Instance details Defined in Options.Applicative.Internal Methods (>>=) :: NondetT m a -> (a -> NondetT m b) -> NondetT m b Source # (>>) :: NondetT m a -> NondetT m b -> NondetT m b Source # return :: a -> NondetT m a Source #
Monad f => Monad (Point f) |
Instance details Defined in SDL.Internal.Vect Methods (>>=) :: Point f a -> (a -> Point f b) -> Point f b Source # (>>) :: Point f a -> Point f b -> Point f b Source # return :: a -> Point f a Source #
Semigroup a => Monad (These a) |
Instance details Defined in Data.Strict.These Methods (>>=) :: These a a0 -> (a0 -> These a b) -> These a b Source # (>>) :: These a a0 -> These a b -> These a b Source # return :: a0 -> These a a0 Source #
Monad (IParser t) |
Instance details Defined in Data.Text.Internal.Read Methods (>>=) :: IParser t a -> (a -> IParser t b) -> IParser t b Source # (>>) :: IParser t a -> IParser t b -> IParser t b Source # return :: a -> IParser t a Source #
Semigroup a => Monad (These a) |
Instance details Defined in Data.These Methods (>>=) :: These a a0 -> (a0 -> These a b) -> These a b Source # (>>) :: These a a0 -> These a b -> These a b Source # return :: a0 -> These a a0 Source #
Monad m => Monad (MaybeT m) |
Instance details Defined in Control.Monad.Trans.Maybe Methods (>>=) :: MaybeT m a -> (a -> MaybeT m b) -> MaybeT m b Source # (>>) :: MaybeT m a -> MaybeT m b -> MaybeT m b Source # return :: a -> MaybeT m a Source #
Monoid a => Monad ((,) a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (>>=) :: (a, a0) -> (a0 -> (a, b)) -> (a, b) Source # (>>) :: (a, a0) -> (a, b) -> (a, b) Source # return :: a0 -> (a, a0) Source #
(Applicative f, Monad f) => Monad (WhenMissing f x) | Equivalent to `ReaderT k (ReaderT x (MaybeT f))`. Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods (>>=) :: WhenMissing f x a -> (a -> WhenMissing f x b) -> WhenMissing f x b Source # (>>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b Source # return :: a -> WhenMissing f x a Source #
(Alternative f, Monad w) => Monad (CofreeT f w) |
Instance details Defined in Control.Comonad.Trans.Cofree Methods (>>=) :: CofreeT f w a -> (a -> CofreeT f w b) -> CofreeT f w b Source # (>>) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w b Source # return :: a -> CofreeT f w a Source #
(Functor f, Monad m) => Monad (FreeT f m) |
Instance details Defined in Control.Monad.Trans.Free Methods (>>=) :: FreeT f m a -> (a -> FreeT f m b) -> FreeT f m b Source # (>>) :: FreeT f m a -> FreeT f m b -> FreeT f m b Source # return :: a -> FreeT f m a Source #
Monad m => Monad (Kleisli m a) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Control.Arrow Methods (>>=) :: Kleisli m a a0 -> (a0 -> Kleisli m a b) -> Kleisli m a b Source # (>>) :: Kleisli m a a0 -> Kleisli m a b -> Kleisli m a b Source # return :: a0 -> Kleisli m a a0 Source #
Monad m => Monad (StateT s m) | Since: base-4.18.0.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods (>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b Source # (>>) :: StateT s m a -> StateT s m b -> StateT s m b Source # return :: a -> StateT s m a Source #
Monad f => Monad (Ap f) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods (>>=) :: Ap f a -> (a -> Ap f b) -> Ap f b Source # (>>) :: Ap f a -> Ap f b -> Ap f b Source # return :: a -> Ap f a Source #
Monad f => Monad (Alt f) | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (>>=) :: Alt f a -> (a -> Alt f b) -> Alt f b Source # (>>) :: Alt f a -> Alt f b -> Alt f b Source # return :: a -> Alt f a Source #
Monad f => Monad (Rec1 f) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (>>=) :: Rec1 f a -> (a -> Rec1 f b) -> Rec1 f b Source # (>>) :: Rec1 f a -> Rec1 f b -> Rec1 f b Source # return :: a -> Rec1 f a Source #
Monad (Indexed i a) |
Instance details Defined in Control.Lens.Internal.Indexed Methods (>>=) :: Indexed i a a0 -> (a0 -> Indexed i a b) -> Indexed i a b Source # (>>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b Source # return :: a0 -> Indexed i a a0 Source #
Dim n => Monad (V n) |
Instance details Defined in Linear.V Methods (>>=) :: V n a -> (a -> V n b) -> V n b Source # (>>) :: V n a -> V n b -> V n b Source # return :: a -> V n a Source #
(Monad (Rep p), Representable p) => Monad (Prep p) |
Instance details Defined in Data.Profunctor.Rep Methods (>>=) :: Prep p a -> (a -> Prep p b) -> Prep p b Source # (>>) :: Prep p a -> Prep p b -> Prep p b Source # return :: a -> Prep p a Source #
Monad (Tagged s) |
Instance details Defined in Data.Tagged Methods (>>=) :: Tagged s a -> (a -> Tagged s b) -> Tagged s b Source # (>>) :: Tagged s a -> Tagged s b -> Tagged s b Source # return :: a -> Tagged s a Source #
(Monoid w, Functor m, Monad m) => Monad (AccumT w m) |
Instance details Defined in Control.Monad.Trans.Accum Methods (>>=) :: AccumT w m a -> (a -> AccumT w m b) -> AccumT w m b Source # (>>) :: AccumT w m a -> AccumT w m b -> AccumT w m b Source # return :: a -> AccumT w m a Source #
Monad m => Monad (ExceptT e m) |
Instance details Defined in Control.Monad.Trans.Except Methods (>>=) :: ExceptT e m a -> (a -> ExceptT e m b) -> ExceptT e m b Source # (>>) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m b Source # return :: a -> ExceptT e m a Source #
Monad m => Monad (IdentityT m) |
Instance details Defined in Control.Monad.Trans.Identity Methods (>>=) :: IdentityT m a -> (a -> IdentityT m b) -> IdentityT m b Source # (>>) :: IdentityT m a -> IdentityT m b -> IdentityT m b Source # return :: a -> IdentityT m a Source #
Monad m => Monad (ReaderT r m) |
Instance details Defined in Control.Monad.Trans.Reader Methods (>>=) :: ReaderT r m a -> (a -> ReaderT r m b) -> ReaderT r m b Source # (>>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b Source # return :: a -> ReaderT r m a Source #
Monad m => Monad (SelectT r m) |
Instance details Defined in Control.Monad.Trans.Select Methods (>>=) :: SelectT r m a -> (a -> SelectT r m b) -> SelectT r m b Source # (>>) :: SelectT r m a -> SelectT r m b -> SelectT r m b Source # return :: a -> SelectT r m a Source #
Monad m => Monad (StateT s m) |
Instance details Defined in Control.Monad.Trans.State.Lazy Methods (>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b Source # (>>) :: StateT s m a -> StateT s m b -> StateT s m b Source # return :: a -> StateT s m a Source #
Monad m => Monad (StateT s m) |
Instance details Defined in Control.Monad.Trans.State.Strict Methods (>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b Source # (>>) :: StateT s m a -> StateT s m b -> StateT s m b Source # return :: a -> StateT s m a Source #
Monad m => Monad (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.CPS Methods (>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b Source # (>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b Source # return :: a -> WriterT w m a Source #
(Monoid w, Monad m) => Monad (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods (>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b Source # (>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b Source # return :: a -> WriterT w m a Source #
(Monoid w, Monad m) => Monad (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods (>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b Source # (>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b Source # return :: a -> WriterT w m a Source #
Monad m => Monad (Reverse m) | Derived instance.
Instance details Defined in Data.Functor.Reverse Methods (>>=) :: Reverse m a -> (a -> Reverse m b) -> Reverse m b Source # (>>) :: Reverse m a -> Reverse m b -> Reverse m b Source # return :: a -> Reverse m a Source #
(Monoid a, Monoid b) => Monad ((,,) a b) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Base Methods (>>=) :: (a, b, a0) -> (a0 -> (a, b, b0)) -> (a, b, b0) Source # (>>) :: (a, b, a0) -> (a, b, b0) -> (a, b, b0) Source # return :: a0 -> (a, b, a0) Source #
(Monad f, Monad g) => Monad (Product f g) | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods (>>=) :: Product f g a -> (a -> Product f g b) -> Product f g b Source # (>>) :: Product f g a -> Product f g b -> Product f g b Source # return :: a -> Product f g a Source #
(Monad f, Applicative f) => Monad (WhenMatched f x y) | Equivalent to `ReaderT Key (ReaderT x (ReaderT y (MaybeT f)))` Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods (>>=) :: WhenMatched f x y a -> (a -> WhenMatched f x y b) -> WhenMatched f x y b Source # (>>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b Source # return :: a -> WhenMatched f x y a Source #
(Applicative f, Monad f) => Monad (WhenMissing f k x) | Equivalent to `ReaderT k (ReaderT x (MaybeT f))` . Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods (>>=) :: WhenMissing f k x a -> (a -> WhenMissing f k x b) -> WhenMissing f k x b Source # (>>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b Source # return :: a -> WhenMissing f k x a Source #
(Monad f, Monad g) => Monad (f :*: g) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (>>=) :: (f :*: g) a -> (a -> (f :*: g) b) -> (f :*: g) b Source # (>>) :: (f :*: g) a -> (f :*: g) b -> (f :*: g) b Source # return :: a -> (f :*: g) a Source #
Monad (ContT r m) |
Instance details Defined in Control.Monad.Trans.Cont Methods (>>=) :: ContT r m a -> (a -> ContT r m b) -> ContT r m b Source # (>>) :: ContT r m a -> ContT r m b -> ContT r m b Source # return :: a -> ContT r m a Source #
(Monoid a, Monoid b, Monoid c) => Monad ((,,,) a b c) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Base Methods (>>=) :: (a, b, c, a0) -> (a0 -> (a, b, c, b0)) -> (a, b, c, b0) Source # (>>) :: (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, b0) Source # return :: a0 -> (a, b, c, a0) Source #
Monad ((->) r) | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods (>>=) :: (r -> a) -> (a -> r -> b) -> r -> b Source # (>>) :: (r -> a) -> (r -> b) -> r -> b Source # return :: a -> r -> a Source #
(Monad f, Applicative f) => Monad (WhenMatched f k x y) | Equivalent to `ReaderT k (ReaderT x (ReaderT y (MaybeT f)))` Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods (>>=) :: WhenMatched f k x y a -> (a -> WhenMatched f k x y b) -> WhenMatched f k x y b Source # (>>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b Source # return :: a -> WhenMatched f k x y a Source #
Monad f => Monad (M1 i c f) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods (>>=) :: M1 i c f a -> (a -> M1 i c f b) -> M1 i c f b Source # (>>) :: M1 i c f a -> M1 i c f b -> M1 i c f b Source # return :: a -> M1 i c f a Source #
Monad m => Monad (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.CPS Methods (>>=) :: RWST r w s m a -> (a -> RWST r w s m b) -> RWST r w s m b Source # (>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b Source # return :: a -> RWST r w s m a Source #
(Monoid w, Monad m) => Monad (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.Lazy Methods (>>=) :: RWST r w s m a -> (a -> RWST r w s m b) -> RWST r w s m b Source # (>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b Source # return :: a -> RWST r w s m a Source #
(Monoid w, Monad m) => Monad (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.Strict Methods (>>=) :: RWST r w s m a -> (a -> RWST r w s m b) -> RWST r w s m b Source # (>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b Source # return :: a -> RWST r w s m a Source #

class Functor (f :: Type -> Type) where Source #

A type `f` is a Functor if it provides a function `fmap` which, given any types `a` and `b` lets you apply any function from `(a -> b)` to turn an `f a` into an `f b`, preserving the structure of `f`. Furthermore `f` needs to adhere to the following:

Identity
  ``fmap` `id` == `id``
Composition
  ``fmap` (f . g) == `fmap` f . `fmap` g`

Note, that the second law follows from the free theorem of the type `fmap` and the first law, so you need only check that the former condition holds. See these articles by School of Haskell or David Luposchainsky for an explanation.

Minimal complete definition

fmap

Methods

fmap :: (a -> b) -> f a -> f b Source #

`fmap` is used to apply a function of type `(a -> b)` to a value of type `f a`, where f is a functor, to produce a value of type `f b`. Note that for any type constructor with more than one parameter (e.g., `Either`), only the last type parameter can be modified with `fmap` (e.g., `b` in `Either a b`).

Some type constructors with two parameters or more have a ``Bifunctor`` instance that allows both the last and the penultimate parameters to be mapped over.

#### Examples

Expand

Convert from a ``Maybe` Int` to a `Maybe String` using `show`:

    >>> fmap show Nothing
    Nothing
    >>> fmap show (Just 3)
    Just "3"

Convert from an ``Either` Int Int` to an `Either Int String` using `show`:

    >>> fmap show (Left 17)
    Left 17
    >>> fmap show (Right 17)
    Right "17"

Double each element of a list:

    >>> fmap (*2) [1,2,3]
    [2,4,6]

Apply `even` to the second element of a pair:

    >>> fmap even (2,2)
    (2,True)

It may seem surprising that the function is only applied to the last element of the tuple compared to the list example above which applies it to every element in the list. To understand, remember that tuples are type constructors with multiple type parameters: a tuple of 3 elements `(a,b,c)` can also be written `(,,) a b c` and its `Functor` instance is defined for `Functor ((,,) a b)` (i.e., only the third parameter is free to be mapped over with `fmap`).

It explains why `fmap` can be used with tuples containing values of different types as in the following example:

    >>> fmap even ("hello", 1.0, 4)
    ("hello",1.0,True)

(<$) :: a -> f b -> f a infixl 4 Source #

Replace all locations in the input with the same value. The default definition is ``fmap` . `const``, but this may be overridden with a more efficient version.

#### Examples

Expand

Perform a computation with `Maybe` and replace the result with a constant value if it is `Just`:

    >>> 'a' <$ Just 2
    Just 'a'
    >>> 'a' <$ Nothing
    Nothing

#### Instances

Instances details

Functor Strategy Source # |
Instance details Defined in Game.LambdaHack.Client.AI.Strategy Methods fmap :: (a -> b) -> Strategy a -> Strategy b Source # (<$) :: a -> Strategy b -> Strategy a Source #
Functor Delta Source # |
Instance details Defined in Game.LambdaHack.Common.Time Methods fmap :: (a -> b) -> Delta a -> Delta b Source # (<$) :: a -> Delta b -> Delta a Source #
Functor Frequency Source # |
Instance details Defined in Game.LambdaHack.Core.Frequency Methods fmap :: (a -> b) -> Frequency a -> Frequency b Source # (<$) :: a -> Frequency b -> Frequency a Source #
Functor CliImplementation Source # |
Instance details Defined in Implementation.MonadClientImplementation Methods fmap :: (a -> b) -> CliImplementation a -> CliImplementation b Source # (<$) :: a -> CliImplementation b -> CliImplementation a Source #
Functor SerImplementation Source # |
Instance details Defined in Implementation.MonadServerImplementation Methods fmap :: (a -> b) -> SerImplementation a -> SerImplementation b Source # (<$) :: a -> SerImplementation b -> SerImplementation a Source #
Functor Gen |
Instance details Defined in Test.QuickCheck.Gen Methods fmap :: (a -> b) -> Gen a -> Gen b Source # (<$) :: a -> Gen b -> Gen a Source #
Functor Blind |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> Blind a -> Blind b Source # (<$) :: a -> Blind b -> Blind a Source #
Functor Fixed |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> Fixed a -> Fixed b Source # (<$) :: a -> Fixed b -> Fixed a Source #
Functor Large |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> Large a -> Large b Source # (<$) :: a -> Large b -> Large a Source #
Functor Negative |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> Negative a -> Negative b Source # (<$) :: a -> Negative b -> Negative a Source #
Functor NonEmptyList |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> NonEmptyList a -> NonEmptyList b Source # (<$) :: a -> NonEmptyList b -> NonEmptyList a Source #
Functor NonNegative |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> NonNegative a -> NonNegative b Source # (<$) :: a -> NonNegative b -> NonNegative a Source #
Functor NonPositive |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> NonPositive a -> NonPositive b Source # (<$) :: a -> NonPositive b -> NonPositive a Source #
Functor NonZero |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> NonZero a -> NonZero b Source # (<$) :: a -> NonZero b -> NonZero a Source #
Functor OrderedList |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> OrderedList a -> OrderedList b Source # (<$) :: a -> OrderedList b -> OrderedList a Source #
Functor Positive |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> Positive a -> Positive b Source # (<$) :: a -> Positive b -> Positive a Source #
Functor Shrink2 |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> Shrink2 a -> Shrink2 b Source # (<$) :: a -> Shrink2 b -> Shrink2 a Source #
Functor Small |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> Small a -> Small b Source # (<$) :: a -> Small b -> Small a Source #
Functor Smart |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> Smart a -> Smart b Source # (<$) :: a -> Smart b -> Smart a Source #
Functor SortedList |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> SortedList a -> SortedList b Source # (<$) :: a -> SortedList b -> SortedList a Source #
Functor Rose |
Instance details Defined in Test.QuickCheck.Property Methods fmap :: (a -> b) -> Rose a -> Rose b Source # (<$) :: a -> Rose b -> Rose a Source #
Functor KeyMap |
Instance details Defined in Data.Aeson.KeyMap Methods fmap :: (a -> b) -> KeyMap a -> KeyMap b Source # (<$) :: a -> KeyMap b -> KeyMap a Source #
Functor IResult |
Instance details Defined in Data.Aeson.Types.Internal Methods fmap :: (a -> b) -> IResult a -> IResult b Source # (<$) :: a -> IResult b -> IResult a Source #
Functor Parser |
Instance details Defined in Data.Aeson.Types.Internal Methods fmap :: (a -> b) -> Parser a -> Parser b Source # (<$) :: a -> Parser b -> Parser a Source #
Functor Result |
Instance details Defined in Data.Aeson.Types.Internal Methods fmap :: (a -> b) -> Result a -> Result b Source # (<$) :: a -> Result b -> Result a Source #
Functor Async |
Instance details Defined in Control.Concurrent.Async.Internal Methods fmap :: (a -> b) -> Async a -> Async b Source # (<$) :: a -> Async b -> Async a Source #
Functor Concurrently |
Instance details Defined in Control.Concurrent.Async.Internal Methods fmap :: (a -> b) -> Concurrently a -> Concurrently b Source # (<$) :: a -> Concurrently b -> Concurrently a Source #
Functor Complex | Since: base-4.9.0.0
Instance details Defined in Data.Complex Methods fmap :: (a -> b) -> Complex a -> Complex b Source # (<$) :: a -> Complex b -> Complex a Source #
Functor First | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a -> b) -> First a -> First b Source # (<$) :: a -> First b -> First a Source #
Functor Last | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a -> b) -> Last a -> Last b Source # (<$) :: a -> Last b -> Last a Source #
Functor Max | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a -> b) -> Max a -> Max b Source # (<$) :: a -> Max b -> Max a Source #
Functor Min | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a -> b) -> Min a -> Min b Source # (<$) :: a -> Min b -> Min a Source #
Functor ArgDescr | Since: base-4.7.0.0
Instance details Defined in System.Console.GetOpt Methods fmap :: (a -> b) -> ArgDescr a -> ArgDescr b Source # (<$) :: a -> ArgDescr b -> ArgDescr a Source #
Functor ArgOrder | Since: base-4.7.0.0
Instance details Defined in System.Console.GetOpt Methods fmap :: (a -> b) -> ArgOrder a -> ArgOrder b Source # (<$) :: a -> ArgOrder b -> ArgOrder a Source #
Functor OptDescr | Since: base-4.7.0.0
Instance details Defined in System.Console.GetOpt Methods fmap :: (a -> b) -> OptDescr a -> OptDescr b Source # (<$) :: a -> OptDescr b -> OptDescr a Source #
Functor Decoder |
Instance details Defined in Data.Binary.Get.Internal Methods fmap :: (a -> b) -> Decoder a -> Decoder b Source # (<$) :: a -> Decoder b -> Decoder a Source #
Functor Get |
Instance details Defined in Data.Binary.Get.Internal Methods fmap :: (a -> b) -> Get a -> Get b Source # (<$) :: a -> Get b -> Get a Source #
Functor PutM |
Instance details Defined in Data.Binary.Put Methods fmap :: (a -> b) -> PutM a -> PutM b Source # (<$) :: a -> PutM b -> PutM a Source #
Functor Put |
Instance details Defined in Data.ByteString.Builder.Internal Methods fmap :: (a -> b) -> Put a -> Put b Source # (<$) :: a -> Put b -> Put a Source #
Functor SCC | Since: containers-0.5.4
Instance details Defined in Data.Graph Methods fmap :: (a -> b) -> SCC a -> SCC b Source # (<$) :: a -> SCC b -> SCC a Source #
Functor IntMap |
Instance details Defined in Data.IntMap.Internal Methods fmap :: (a -> b) -> IntMap a -> IntMap b Source # (<$) :: a -> IntMap b -> IntMap a Source #
Functor Digit |
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> Digit a -> Digit b Source # (<$) :: a -> Digit b -> Digit a Source #
Functor Elem |
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> Elem a -> Elem b Source # (<$) :: a -> Elem b -> Elem a Source #
Functor FingerTree |
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> FingerTree a -> FingerTree b Source # (<$) :: a -> FingerTree b -> FingerTree a Source #
Functor Node |
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> Node a -> Node b Source # (<$) :: a -> Node b -> Node a Source #
Functor Seq |
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> Seq a -> Seq b Source # (<$) :: a -> Seq b -> Seq a Source #
Functor ViewL |
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> ViewL a -> ViewL b Source # (<$) :: a -> ViewL b -> ViewL a Source #
Functor ViewR |
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> ViewR a -> ViewR b Source # (<$) :: a -> ViewR b -> ViewR a Source #
Functor Tree |
Instance details Defined in Data.Tree Methods fmap :: (a -> b) -> Tree a -> Tree b Source # (<$) :: a -> Tree b -> Tree a Source #
Functor DNonEmpty |
Instance details Defined in Data.DList.DNonEmpty.Internal Methods fmap :: (a -> b) -> DNonEmpty a -> DNonEmpty b Source # (<$) :: a -> DNonEmpty b -> DNonEmpty a Source #
Functor DList |
Instance details Defined in Data.DList.Internal Methods fmap :: (a -> b) -> DList a -> DList b Source # (<$) :: a -> DList b -> DList a Source #
Functor NonEmpty | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods fmap :: (a -> b) -> NonEmpty a -> NonEmpty b Source # (<$) :: a -> NonEmpty b -> NonEmpty a Source #
Functor STM | Since: base-4.3.0.0
Instance details Defined in GHC.Internal.Conc.Sync Methods fmap :: (a -> b) -> STM a -> STM b Source # (<$) :: a -> STM b -> STM a Source #
Functor Identity | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Functor.Identity Methods fmap :: (a -> b) -> Identity a -> Identity b Source # (<$) :: a -> Identity b -> Identity a Source #
Functor First | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods fmap :: (a -> b) -> First a -> First b Source # (<$) :: a -> First b -> First a Source #
Functor Last | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods fmap :: (a -> b) -> Last a -> Last b Source # (<$) :: a -> Last b -> Last a Source #
Functor Down | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Data.Ord Methods fmap :: (a -> b) -> Down a -> Down b Source # (<$) :: a -> Down b -> Down a Source #
Functor Dual | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods fmap :: (a -> b) -> Dual a -> Dual b Source # (<$) :: a -> Dual b -> Dual a Source #
Functor Product | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods fmap :: (a -> b) -> Product a -> Product b Source # (<$) :: a -> Product b -> Product a Source #
Functor Sum | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods fmap :: (a -> b) -> Sum a -> Sum b Source # (<$) :: a -> Sum b -> Sum a Source #
Functor ZipList | Since: base-2.1
Instance details Defined in GHC.Internal.Functor.ZipList Methods fmap :: (a -> b) -> ZipList a -> ZipList b Source # (<$) :: a -> ZipList b -> ZipList a Source #
Functor Par1 | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> Par1 a -> Par1 b Source # (<$) :: a -> Par1 b -> Par1 a Source #
Functor P | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods fmap :: (a -> b) -> P a -> P b Source # (<$) :: a -> P b -> P a Source #
Functor ReadP | Since: base-2.1
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods fmap :: (a -> b) -> ReadP a -> ReadP b Source # (<$) :: a -> ReadP b -> ReadP a Source #
Functor ReadPrec | Since: base-2.1
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadPrec Methods fmap :: (a -> b) -> ReadPrec a -> ReadPrec b Source # (<$) :: a -> ReadPrec b -> ReadPrec a Source #
Functor IO | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods fmap :: (a -> b) -> IO a -> IO b Source # (<$) :: a -> IO b -> IO a Source #
Functor Plucker |
Instance details Defined in Linear.Plucker Methods fmap :: (a -> b) -> Plucker a -> Plucker b Source # (<$) :: a -> Plucker b -> Plucker a Source #
Functor Quaternion |
Instance details Defined in Linear.Quaternion Methods fmap :: (a -> b) -> Quaternion a -> Quaternion b Source # (<$) :: a -> Quaternion b -> Quaternion a Source #
Functor V0 |
Instance details Defined in Linear.V0 Methods fmap :: (a -> b) -> V0 a -> V0 b Source # (<$) :: a -> V0 b -> V0 a Source #
Functor V1 |
Instance details Defined in Linear.V1 Methods fmap :: (a -> b) -> V1 a -> V1 b Source # (<$) :: a -> V1 b -> V1 a Source #
Functor V2 |
Instance details Defined in Linear.V2 Methods fmap :: (a -> b) -> V2 a -> V2 b Source # (<$) :: a -> V2 b -> V2 a Source #
Functor V3 |
Instance details Defined in Linear.V3 Methods fmap :: (a -> b) -> V3 a -> V3 b Source # (<$) :: a -> V3 b -> V3 a Source #
Functor V4 |
Instance details Defined in Linear.V4 Methods fmap :: (a -> b) -> V4 a -> V4 b Source # (<$) :: a -> V4 b -> V4 a Source #
Functor Chunk |
Instance details Defined in Options.Applicative.Help.Chunk Methods fmap :: (a -> b) -> Chunk a -> Chunk b Source # (<$) :: a -> Chunk b -> Chunk a Source #
Functor ComplResult |
Instance details Defined in Options.Applicative.Internal Methods fmap :: (a -> b) -> ComplResult a -> ComplResult b Source # (<$) :: a -> ComplResult b -> ComplResult a Source #
Functor Completion |
Instance details Defined in Options.Applicative.Internal Methods fmap :: (a -> b) -> Completion a -> Completion b Source # (<$) :: a -> Completion b -> Completion a Source #
Functor P |
Instance details Defined in Options.Applicative.Internal Methods fmap :: (a -> b) -> P a -> P b Source # (<$) :: a -> P b -> P a Source #
Functor CReader |
Instance details Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> CReader a -> CReader b Source # (<$) :: a -> CReader b -> CReader a Source #
Functor OptReader |
Instance details Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> OptReader a -> OptReader b Source # (<$) :: a -> OptReader b -> OptReader a Source #
Functor Option |
Instance details Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> Option a -> Option b Source # (<$) :: a -> Option b -> Option a Source #
Functor Parser |
Instance details Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> Parser a -> Parser b Source # (<$) :: a -> Parser b -> Parser a Source #
Functor ParserFailure |
Instance details Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> ParserFailure a -> ParserFailure b Source # (<$) :: a -> ParserFailure b -> ParserFailure a Source #
Functor ParserInfo |
Instance details Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> ParserInfo a -> ParserInfo b Source # (<$) :: a -> ParserInfo b -> ParserInfo a Source #
Functor ParserM |
Instance details Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> ParserM a -> ParserM b Source # (<$) :: a -> ParserM b -> ParserM a Source #
Functor ParserResult |
Instance details Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> ParserResult a -> ParserResult b Source # (<$) :: a -> ParserResult b -> ParserResult a Source #
Functor ReadM |
Instance details Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> ReadM a -> ReadM b Source # (<$) :: a -> ReadM b -> ReadM a Source #
Functor AnnotDetails |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods fmap :: (a -> b) -> AnnotDetails a -> AnnotDetails b Source # (<$) :: a -> AnnotDetails b -> AnnotDetails a Source #
Functor Doc |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods fmap :: (a -> b) -> Doc a -> Doc b Source # (<$) :: a -> Doc b -> Doc a Source #
Functor Span |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods fmap :: (a -> b) -> Span a -> Span b Source # (<$) :: a -> Span b -> Span a Source #
Functor Doc |
Instance details Defined in Prettyprinter.Internal Methods fmap :: (a -> b) -> Doc a -> Doc b Source # (<$) :: a -> Doc b -> Doc a Source #
Functor FlattenResult |
Instance details Defined in Prettyprinter.Internal Methods fmap :: (a -> b) -> FlattenResult a -> FlattenResult b Source # (<$) :: a -> FlattenResult b -> FlattenResult a Source #
Functor SimpleDocStream |
Instance details Defined in Prettyprinter.Internal Methods fmap :: (a -> b) -> SimpleDocStream a -> SimpleDocStream b Source # (<$) :: a -> SimpleDocStream b -> SimpleDocStream a Source #
Functor Array |
Instance details Defined in Data.Primitive.Array Methods fmap :: (a -> b) -> Array a -> Array b Source # (<$) :: a -> Array b -> Array a Source #
Functor SmallArray |
Instance details Defined in Data.Primitive.SmallArray Methods fmap :: (a -> b) -> SmallArray a -> SmallArray b Source # (<$) :: a -> SmallArray b -> SmallArray a Source #
Functor Changeable |
Instance details Defined in SDL.Audio Methods fmap :: (a -> b) -> Changeable a -> Changeable b Source # (<$) :: a -> Changeable b -> Changeable a Source #
Functor V2 |
Instance details Defined in SDL.Internal.Vect Methods fmap :: (a -> b) -> V2 a -> V2 b Source # (<$) :: a -> V2 b -> V2 a Source #
Functor V3 |
Instance details Defined in SDL.Internal.Vect Methods fmap :: (a -> b) -> V3 a -> V3 b Source # (<$) :: a -> V3 b -> V3 a Source #
Functor V4 |
Instance details Defined in SDL.Internal.Vect Methods fmap :: (a -> b) -> V4 a -> V4 b Source # (<$) :: a -> V4 b -> V4 a Source #
Functor Rectangle |
Instance details Defined in SDL.Video.Renderer Methods fmap :: (a -> b) -> Rectangle a -> Rectangle b Source # (<$) :: a -> Rectangle b -> Rectangle a Source #
Functor Maybe |
Instance details Defined in Data.Strict.Maybe Methods fmap :: (a -> b) -> Maybe a -> Maybe b Source # (<$) :: a -> Maybe b -> Maybe a Source #
Functor PprM |
Instance details Defined in Language.Haskell.TH.PprLib Methods fmap :: (a -> b) -> PprM a -> PprM b Source # (<$) :: a -> PprM b -> PprM a Source #
Functor Q |
Instance details Defined in Language.Haskell.TH.Syntax Methods fmap :: (a -> b) -> Q a -> Q b Source # (<$) :: a -> Q b -> Q a Source #
Functor TyVarBndr |
Instance details Defined in Language.Haskell.TH.Syntax Methods fmap :: (a -> b) -> TyVarBndr a -> TyVarBndr b Source # (<$) :: a -> TyVarBndr b -> TyVarBndr a Source #
Functor Vector |
Instance details Defined in Data.Vector Methods fmap :: (a -> b) -> Vector a -> Vector b Source # (<$) :: a -> Vector b -> Vector a Source #
Functor Id |
Instance details Defined in Data.Vector.Fusion.Util Methods fmap :: (a -> b) -> Id a -> Id b Source # (<$) :: a -> Id b -> Id a Source #
Functor Vector |
Instance details Defined in Data.Vector.Strict Methods fmap :: (a -> b) -> Vector a -> Vector b Source # (<$) :: a -> Vector b -> Vector a Source #
Functor Stream |
Instance details Defined in Codec.Compression.Zlib.Stream Methods fmap :: (a -> b) -> Stream a -> Stream b Source # (<$) :: a -> Stream b -> Stream a Source #
Functor Maybe | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods fmap :: (a -> b) -> Maybe a -> Maybe b Source # (<$) :: a -> Maybe b -> Maybe a Source #
Functor Solo | Since: base-4.15
Instance details Defined in GHC.Internal.Base Methods fmap :: (a -> b) -> Solo a -> Solo b Source # (<$) :: a -> Solo b -> Solo a Source #
Functor [] | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods fmap :: (a -> b) -> [a] -> [b] Source # (<$) :: a -> [b] -> [a] Source #
Functor ((:->) a) |
Instance details Defined in Test.QuickCheck.Function Methods fmap :: (a0 -> b) -> (a :-> a0) -> a :-> b Source # (<$) :: a0 -> (a :-> b) -> a :-> a0 Source #
Functor (Fun a) |
Instance details Defined in Test.QuickCheck.Function Methods fmap :: (a0 -> b) -> Fun a a0 -> Fun a b Source # (<$) :: a0 -> Fun a b -> Fun a a0 Source #
Functor (Shrinking s) |
Instance details Defined in Test.QuickCheck.Modifiers Methods fmap :: (a -> b) -> Shrinking s a -> Shrinking s b Source # (<$) :: a -> Shrinking s b -> Shrinking s a Source #
Functor (PropertyM m) |
Instance details Defined in Test.QuickCheck.Monadic Methods fmap :: (a -> b) -> PropertyM m a -> PropertyM m b Source # (<$) :: a -> PropertyM m b -> PropertyM m a Source #
Functor f => Functor (Co f) |
Instance details Defined in Data.Functor.Rep Methods fmap :: (a -> b) -> Co f a -> Co f b Source # (<$) :: a -> Co f b -> Co f a Source #
Functor (ConcurrentlyE e) |
Instance details Defined in Control.Concurrent.Async.Internal Methods fmap :: (a -> b) -> ConcurrentlyE e a -> ConcurrentlyE e b Source # (<$) :: a -> ConcurrentlyE e b -> ConcurrentlyE e a Source #
Monad m => Functor (WrappedMonad m) | Since: base-2.1
Instance details Defined in Control.Applicative Methods fmap :: (a -> b) -> WrappedMonad m a -> WrappedMonad m b Source # (<$) :: a -> WrappedMonad m b -> WrappedMonad m a Source #
Functor (Arg a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a0 -> b) -> Arg a a0 -> Arg a b Source # (<$) :: a0 -> Arg a b -> Arg a a0 Source #
Functor (SetM s) |
Instance details Defined in Data.Graph Methods fmap :: (a -> b) -> SetM s a -> SetM s b Source # (<$) :: a -> SetM s b -> SetM s a Source #
Functor (Map k) |
Instance details Defined in Data.Map.Internal Methods fmap :: (a -> b) -> Map k a -> Map k b Source # (<$) :: a -> Map k b -> Map k a Source #
Functor (EnumMap k) |
Instance details Defined in Data.EnumMap.Base Methods fmap :: (a -> b) -> EnumMap k a -> EnumMap k b Source # (<$) :: a -> EnumMap k b -> EnumMap k a Source #
Functor f => Functor (Cofree f) |
Instance details Defined in Control.Comonad.Cofree Methods fmap :: (a -> b) -> Cofree f a -> Cofree f b Source # (<$) :: a -> Cofree f b -> Cofree f a Source #
Functor f => Functor (Free f) |
Instance details Defined in Control.Monad.Free Methods fmap :: (a -> b) -> Free f a -> Free f b Source # (<$) :: a -> Free f b -> Free f a Source #
Arrow a => Functor (ArrowMonad a) | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Control.Arrow Methods fmap :: (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b Source # (<$) :: a0 -> ArrowMonad a b -> ArrowMonad a a0 Source #
Functor (Either a) | Since: base-3.0
Instance details Defined in GHC.Internal.Data.Either Methods fmap :: (a0 -> b) -> Either a a0 -> Either a b Source # (<$) :: a0 -> Either a b -> Either a a0 Source #
Functor (StateL s) | Since: base-4.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods fmap :: (a -> b) -> StateL s a -> StateL s b Source # (<$) :: a -> StateL s b -> StateL s a Source #
Functor (StateR s) | Since: base-4.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods fmap :: (a -> b) -> StateR s a -> StateR s b Source # (<$) :: a -> StateR s b -> StateR s a Source #
Functor (U1 :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> U1 a -> U1 b Source # (<$) :: a -> U1 b -> U1 a Source #
Functor (V1 :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> V1 a -> V1 b Source # (<$) :: a -> V1 b -> V1 a Source #
Functor (ST s) | Since: base-2.1
Instance details Defined in GHC.Internal.ST Methods fmap :: (a -> b) -> ST s a -> ST s b Source # (<$) :: a -> ST s b -> ST s a Source #
Functor (Yoneda f) |
Instance details Defined in Data.Functor.Yoneda Methods fmap :: (a -> b) -> Yoneda f a -> Yoneda f b Source # (<$) :: a -> Yoneda f b -> Yoneda f a Source #
Functor f => Functor (Act f) |
Instance details Defined in Data.Key Methods fmap :: (a -> b) -> Act f a -> Act f b Source # (<$) :: a -> Act f b -> Act f a Source #
Functor (StateL s) |
Instance details Defined in Data.Key Methods fmap :: (a -> b) -> StateL s a -> StateL s b Source # (<$) :: a -> StateL s b -> StateL s a Source #
Functor (StateR s) |
Instance details Defined in Data.Key Methods fmap :: (a -> b) -> StateR s a -> StateR s b Source # (<$) :: a -> StateR s b -> StateR s a Source #
Functor f => Functor (Indexing f) |
Instance details Defined in Control.Lens.Internal.Indexed Methods fmap :: (a -> b) -> Indexing f a -> Indexing f b Source # (<$) :: a -> Indexing f b -> Indexing f a Source #
Functor f => Functor (Indexing64 f) |
Instance details Defined in Control.Lens.Internal.Indexed Methods fmap :: (a -> b) -> Indexing64 f a -> Indexing64 f b Source # (<$) :: a -> Indexing64 f b -> Indexing64 f a Source #
Functor (ReifiedFold s) |
Instance details Defined in Control.Lens.Reified Methods fmap :: (a -> b) -> ReifiedFold s a -> ReifiedFold s b Source # (<$) :: a -> ReifiedFold s b -> ReifiedFold s a Source #
Functor (ReifiedGetter s) |
Instance details Defined in Control.Lens.Reified Methods fmap :: (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b Source # (<$) :: a -> ReifiedGetter s b -> ReifiedGetter s a Source #
Functor f => Functor (Point f) |
Instance details Defined in Linear.Affine Methods fmap :: (a -> b) -> Point f a -> Point f b Source # (<$) :: a -> Point f b -> Point f a Source #
Monad m => Functor (ListT m) |
Instance details Defined in Options.Applicative.Internal Methods fmap :: (a -> b) -> ListT m a -> ListT m b Source # (<$) :: a -> ListT m b -> ListT m a Source #
Monad m => Functor (NondetT m) |
Instance details Defined in Options.Applicative.Internal Methods fmap :: (a -> b) -> NondetT m a -> NondetT m b Source # (<$) :: a -> NondetT m b -> NondetT m a Source #
Functor f => Functor (Point f) |
Instance details Defined in SDL.Internal.Vect Methods fmap :: (a -> b) -> Point f a -> Point f b Source # (<$) :: a -> Point f b -> Point f a Source #
Functor (Either a) |
Instance details Defined in Data.Strict.Either Methods fmap :: (a0 -> b) -> Either a a0 -> Either a b Source # (<$) :: a0 -> Either a b -> Either a a0 Source #
Functor (These a) |
Instance details Defined in Data.Strict.These Methods fmap :: (a0 -> b) -> These a a0 -> These a b Source # (<$) :: a0 -> These a b -> These a a0 Source #
Functor (Pair e) |
Instance details Defined in Data.Strict.Tuple Methods fmap :: (a -> b) -> Pair e a -> Pair e b Source # (<$) :: a -> Pair e b -> Pair e a Source #
Functor (IParser t) |
Instance details Defined in Data.Text.Internal.Read Methods fmap :: (a -> b) -> IParser t a -> IParser t b Source # (<$) :: a -> IParser t b -> IParser t a Source #
Functor (These a) |
Instance details Defined in Data.These Methods fmap :: (a0 -> b) -> These a a0 -> These a b Source # (<$) :: a0 -> These a b -> These a a0 Source #
Functor f => Functor (Lift f) |
Instance details Defined in Control.Applicative.Lift Methods fmap :: (a -> b) -> Lift f a -> Lift f b Source # (<$) :: a -> Lift f b -> Lift f a Source #
Functor m => Functor (MaybeT m) |
Instance details Defined in Control.Monad.Trans.Maybe Methods fmap :: (a -> b) -> MaybeT m a -> MaybeT m b Source # (<$) :: a -> MaybeT m b -> MaybeT m a Source #
Functor (HashMap k) |
Instance details Defined in Data.HashMap.Internal Methods fmap :: (a -> b) -> HashMap k a -> HashMap k b Source # (<$) :: a -> HashMap k b -> HashMap k a Source #
Functor ((,) a) | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods fmap :: (a0 -> b) -> (a, a0) -> (a, b) Source # (<$) :: a0 -> (a, b) -> (a, a0) Source #
Arrow a => Functor (WrappedArrow a b) | Since: base-2.1
Instance details Defined in Control.Applicative Methods fmap :: (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 Source # (<$) :: a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 Source #
Bifunctor p => Functor (Fix p) |
Instance details Defined in Data.Bifunctor.Fix Methods fmap :: (a -> b) -> Fix p a -> Fix p b Source # (<$) :: a -> Fix p b -> Fix p a Source #
Bifunctor p => Functor (Join p) |
Instance details Defined in Data.Bifunctor.Join Methods fmap :: (a -> b) -> Join p a -> Join p b Source # (<$) :: a -> Join p b -> Join p a Source #
(Applicative f, Monad f) => Functor (WhenMissing f x) | Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods fmap :: (a -> b) -> WhenMissing f x a -> WhenMissing f x b Source # (<$) :: a -> WhenMissing f x b -> WhenMissing f x a Source #
Functor f => Functor (CofreeF f a) |
Instance details Defined in Control.Comonad.Trans.Cofree Methods fmap :: (a0 -> b) -> CofreeF f a a0 -> CofreeF f a b Source # (<$) :: a0 -> CofreeF f a b -> CofreeF f a a0 Source #
(Functor f, Functor w) => Functor (CofreeT f w) |
Instance details Defined in Control.Comonad.Trans.Cofree Methods fmap :: (a -> b) -> CofreeT f w a -> CofreeT f w b Source # (<$) :: a -> CofreeT f w b -> CofreeT f w a Source #
Functor f => Functor (FreeF f a) |
Instance details Defined in Control.Monad.Trans.Free Methods fmap :: (a0 -> b) -> FreeF f a a0 -> FreeF f a b Source # (<$) :: a0 -> FreeF f a b -> FreeF f a a0 Source #
(Functor f, Functor m) => Functor (FreeT f m) |
Instance details Defined in Control.Monad.Trans.Free Methods fmap :: (a -> b) -> FreeT f m a -> FreeT f m b Source # (<$) :: a -> FreeT f m b -> FreeT f m a Source #
Functor m => Functor (Kleisli m a) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Control.Arrow Methods fmap :: (a0 -> b) -> Kleisli m a a0 -> Kleisli m a b Source # (<$) :: a0 -> Kleisli m a b -> Kleisli m a a0 Source #
Functor (Const m :: Type -> Type) | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Functor.Const Methods fmap :: (a -> b) -> Const m a -> Const m b Source # (<$) :: a -> Const m b -> Const m a Source #
Monad m => Functor (StateT s m) | Since: base-4.18.0.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods fmap :: (a -> b) -> StateT s m a -> StateT s m b Source # (<$) :: a -> StateT s m b -> StateT s m a Source #
Functor f => Functor (Ap f) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods fmap :: (a -> b) -> Ap f a -> Ap f b Source # (<$) :: a -> Ap f b -> Ap f a Source #
Functor f => Functor (Alt f) | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods fmap :: (a -> b) -> Alt f a -> Alt f b Source # (<$) :: a -> Alt f b -> Alt f a Source #
(Generic1 f, Functor (Rep1 f)) => Functor (Generically1 f) | Since: base-4.17.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> Generically1 f a -> Generically1 f b Source # (<$) :: a -> Generically1 f b -> Generically1 f a Source #
Functor f => Functor (Rec1 f) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> Rec1 f a -> Rec1 f b Source # (<$) :: a -> Rec1 f b -> Rec1 f a Source #
Functor (URec (Ptr ()) :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> URec (Ptr ()) a -> URec (Ptr ()) b Source # (<$) :: a -> URec (Ptr ()) b -> URec (Ptr ()) a Source #
Functor (URec Char :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> URec Char a -> URec Char b Source # (<$) :: a -> URec Char b -> URec Char a Source #
Functor (URec Double :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> URec Double a -> URec Double b Source # (<$) :: a -> URec Double b -> URec Double a Source #
Functor (URec Float :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> URec Float a -> URec Float b Source # (<$) :: a -> URec Float b -> URec Float a Source #
Functor (URec Int :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> URec Int a -> URec Int b Source # (<$) :: a -> URec Int b -> URec Int a Source #
Functor (URec Word :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> URec Word a -> URec Word b Source # (<$) :: a -> URec Word b -> URec Word a Source #
Functor (Day f g) |
Instance details Defined in Data.Functor.Day Methods fmap :: (a -> b) -> Day f g a -> Day f g b Source # (<$) :: a -> Day f g b -> Day f g a Source #
Functor (Indexed i a) |
Instance details Defined in Control.Lens.Internal.Indexed Methods fmap :: (a0 -> b) -> Indexed i a a0 -> Indexed i a b Source # (<$) :: a0 -> Indexed i a b -> Indexed i a a0 Source #
Functor (ReifiedIndexedFold i s) |
Instance details Defined in Control.Lens.Reified Methods fmap :: (a -> b) -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s b Source # (<$) :: a -> ReifiedIndexedFold i s b -> ReifiedIndexedFold i s a Source #
Functor (ReifiedIndexedGetter i s) |
Instance details Defined in Control.Lens.Reified Methods fmap :: (a -> b) -> ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b Source # (<$) :: a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s a Source #
Functor (V n) |
Instance details Defined in Linear.V Methods fmap :: (a -> b) -> V n a -> V n b Source # (<$) :: a -> V n b -> V n a Source #
Profunctor p => Functor (Coprep p) |
Instance details Defined in Data.Profunctor.Rep Methods fmap :: (a -> b) -> Coprep p a -> Coprep p b Source # (<$) :: a -> Coprep p b -> Coprep p a Source #
Profunctor p => Functor (Prep p) |
Instance details Defined in Data.Profunctor.Rep Methods fmap :: (a -> b) -> Prep p a -> Prep p b Source # (<$) :: a -> Prep p b -> Prep p a Source #
Functor (Tagged s) |
Instance details Defined in Data.Tagged Methods fmap :: (a -> b) -> Tagged s a -> Tagged s b Source # (<$) :: a -> Tagged s b -> Tagged s a Source #
(Functor f, Functor g) => Functor (These1 f g) |
Instance details Defined in Data.Functor.These Methods fmap :: (a -> b) -> These1 f g a -> These1 f g b Source # (<$) :: a -> These1 f g b -> These1 f g a Source #
Functor f => Functor (Backwards f) | Derived instance.
Instance details Defined in Control.Applicative.Backwards Methods fmap :: (a -> b) -> Backwards f a -> Backwards f b Source # (<$) :: a -> Backwards f b -> Backwards f a Source #
Functor m => Functor (AccumT w m) |
Instance details Defined in Control.Monad.Trans.Accum Methods fmap :: (a -> b) -> AccumT w m a -> AccumT w m b Source # (<$) :: a -> AccumT w m b -> AccumT w m a Source #
Functor m => Functor (ExceptT e m) |
Instance details Defined in Control.Monad.Trans.Except Methods fmap :: (a -> b) -> ExceptT e m a -> ExceptT e m b Source # (<$) :: a -> ExceptT e m b -> ExceptT e m a Source #
Functor m => Functor (IdentityT m) |
Instance details Defined in Control.Monad.Trans.Identity Methods fmap :: (a -> b) -> IdentityT m a -> IdentityT m b Source # (<$) :: a -> IdentityT m b -> IdentityT m a Source #
Functor m => Functor (ReaderT r m) |
Instance details Defined in Control.Monad.Trans.Reader Methods fmap :: (a -> b) -> ReaderT r m a -> ReaderT r m b Source # (<$) :: a -> ReaderT r m b -> ReaderT r m a Source #
Functor m => Functor (SelectT r m) |
Instance details Defined in Control.Monad.Trans.Select Methods fmap :: (a -> b) -> SelectT r m a -> SelectT r m b Source # (<$) :: a -> SelectT r m b -> SelectT r m a Source #
Functor m => Functor (StateT s m) |
Instance details Defined in Control.Monad.Trans.State.Lazy Methods fmap :: (a -> b) -> StateT s m a -> StateT s m b Source # (<$) :: a -> StateT s m b -> StateT s m a Source #
Functor m => Functor (StateT s m) |
Instance details Defined in Control.Monad.Trans.State.Strict Methods fmap :: (a -> b) -> StateT s m a -> StateT s m b Source # (<$) :: a -> StateT s m b -> StateT s m a Source #
Functor m => Functor (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.CPS Methods fmap :: (a -> b) -> WriterT w m a -> WriterT w m b Source # (<$) :: a -> WriterT w m b -> WriterT w m a Source #
Functor m => Functor (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods fmap :: (a -> b) -> WriterT w m a -> WriterT w m b Source # (<$) :: a -> WriterT w m b -> WriterT w m a Source #
Functor m => Functor (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods fmap :: (a -> b) -> WriterT w m a -> WriterT w m b Source # (<$) :: a -> WriterT w m b -> WriterT w m a Source #
Functor (Constant a :: Type -> Type) |
Instance details Defined in Data.Functor.Constant Methods fmap :: (a0 -> b) -> Constant a a0 -> Constant a b Source # (<$) :: a0 -> Constant a b -> Constant a a0 Source #
Functor f => Functor (Reverse f) | Derived instance.
Instance details Defined in Data.Functor.Reverse Methods fmap :: (a -> b) -> Reverse f a -> Reverse f b Source # (<$) :: a -> Reverse f b -> Reverse f a Source #
Monad m => Functor (Bundle m v) |
Instance details Defined in Data.Vector.Fusion.Bundle.Monadic Methods fmap :: (a -> b) -> Bundle m v a -> Bundle m v b Source # (<$) :: a -> Bundle m v b -> Bundle m v a Source #
Functor ((,,) a b) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Base Methods fmap :: (a0 -> b0) -> (a, b, a0) -> (a, b, b0) Source # (<$) :: a0 -> (a, b, b0) -> (a, b, a0) Source #
(Functor f, Functor g) => Functor (Product f g) | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods fmap :: (a -> b) -> Product f g a -> Product f g b Source # (<$) :: a -> Product f g b -> Product f g a Source #
(Functor f, Functor g) => Functor (Sum f g) | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Sum Methods fmap :: (a -> b) -> Sum f g a -> Sum f g b Source # (<$) :: a -> Sum f g b -> Sum f g a Source #
Functor f => Functor (WhenMatched f x y) | Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods fmap :: (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b Source # (<$) :: a -> WhenMatched f x y b -> WhenMatched f x y a Source #
(Applicative f, Monad f) => Functor (WhenMissing f k x) | Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods fmap :: (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b Source # (<$) :: a -> WhenMissing f k x b -> WhenMissing f k x a Source #
(Functor f, Functor g) => Functor (f :*: g) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> (f :*: g) a -> (f :*: g) b Source # (<$) :: a -> (f :*: g) b -> (f :*: g) a Source #
(Functor f, Functor g) => Functor (f :+: g) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> (f :+: g) a -> (f :+: g) b Source # (<$) :: a -> (f :+: g) b -> (f :+: g) a Source #
Functor (K1 i c :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> K1 i c a -> K1 i c b Source # (<$) :: a -> K1 i c b -> K1 i c a Source #
Functor (ContT r m) |
Instance details Defined in Control.Monad.Trans.Cont Methods fmap :: (a -> b) -> ContT r m a -> ContT r m b Source # (<$) :: a -> ContT r m b -> ContT r m a Source #
Functor ((,,,) a b c) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Base Methods fmap :: (a0 -> b0) -> (a, b, c, a0) -> (a, b, c, b0) Source # (<$) :: a0 -> (a, b, c, b0) -> (a, b, c, a0) Source #
Functor ((->) r) | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods fmap :: (a -> b) -> (r -> a) -> r -> b Source # (<$) :: a -> (r -> b) -> r -> a Source #
(Functor f, Functor g) => Functor (Compose f g) | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods fmap :: (a -> b) -> Compose f g a -> Compose f g b Source # (<$) :: a -> Compose f g b -> Compose f g a Source #
Functor (Clown f a :: Type -> Type) |
Instance details Defined in Data.Bifunctor.Clown Methods fmap :: (a0 -> b) -> Clown f a a0 -> Clown f a b Source # (<$) :: a0 -> Clown f a b -> Clown f a a0 Source #
Bifunctor p => Functor (Flip p a) |
Instance details Defined in Data.Bifunctor.Flip Methods fmap :: (a0 -> b) -> Flip p a a0 -> Flip p a b Source # (<$) :: a0 -> Flip p a b -> Flip p a a0 Source #
Functor g => Functor (Joker g a) |
Instance details Defined in Data.Bifunctor.Joker Methods fmap :: (a0 -> b) -> Joker g a a0 -> Joker g a b Source # (<$) :: a0 -> Joker g a b -> Joker g a a0 Source #
Bifunctor p => Functor (WrappedBifunctor p a) |
Instance details Defined in Data.Bifunctor.Wrapped Methods fmap :: (a0 -> b) -> WrappedBifunctor p a a0 -> WrappedBifunctor p a b Source # (<$) :: a0 -> WrappedBifunctor p a b -> WrappedBifunctor p a a0 Source #
Functor f => Functor (WhenMatched f k x y) | Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods fmap :: (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b Source # (<$) :: a -> WhenMatched f k x y b -> WhenMatched f k x y a Source #
(Functor f, Functor g) => Functor (f :.: g) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> (f :.: g) a -> (f :.: g) b Source # (<$) :: a -> (f :.: g) b -> (f :.: g) a Source #
Functor f => Functor (M1 i c f) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods fmap :: (a -> b) -> M1 i c f a -> M1 i c f b Source # (<$) :: a -> M1 i c f b -> M1 i c f a Source #
Reifies s (ReifiedApplicative f) => Functor (ReflectedApplicative f s) |
Instance details Defined in Data.Reflection Methods fmap :: (a -> b) -> ReflectedApplicative f s a -> ReflectedApplicative f s b Source # (<$) :: a -> ReflectedApplicative f s b -> ReflectedApplicative f s a Source #
Functor m => Functor (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.CPS Methods fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b Source # (<$) :: a -> RWST r w s m b -> RWST r w s m a Source #
Functor m => Functor (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.Lazy Methods fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b Source # (<$) :: a -> RWST r w s m b -> RWST r w s m a Source #
Functor m => Functor (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.Strict Methods fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b Source # (<$) :: a -> RWST r w s m b -> RWST r w s m a Source #
Functor ((,,,,) a b c d) | Since: base-4.18.0.0
Instance details Defined in GHC.Internal.Base Methods fmap :: (a0 -> b0) -> (a, b, c, d, a0) -> (a, b, c, d, b0) Source # (<$) :: a0 -> (a, b, c, d, b0) -> (a, b, c, d, a0) Source #
(Functor (f a), Functor (g a)) => Functor (Product f g a) |
Instance details Defined in Data.Bifunctor.Product Methods fmap :: (a0 -> b) -> Product f g a a0 -> Product f g a b Source # (<$) :: a0 -> Product f g a b -> Product f g a a0 Source #
(Functor (f a), Functor (g a)) => Functor (Sum f g a) |
Instance details Defined in Data.Bifunctor.Sum Methods fmap :: (a0 -> b) -> Sum f g a a0 -> Sum f g a b Source # (<$) :: a0 -> Sum f g a b -> Sum f g a a0 Source #
Functor ((,,,,,) a b c d e) | Since: base-4.18.0.0
Instance details Defined in GHC.Internal.Base Methods fmap :: (a0 -> b0) -> (a, b, c, d, e, a0) -> (a, b, c, d, e, b0) Source # (<$) :: a0 -> (a, b, c, d, e, b0) -> (a, b, c, d, e, a0) Source #
(Functor f, Bifunctor p) => Functor (Tannen f p a) |
Instance details Defined in Data.Bifunctor.Tannen Methods fmap :: (a0 -> b) -> Tannen f p a a0 -> Tannen f p a b Source # (<$) :: a0 -> Tannen f p a b -> Tannen f p a a0 Source #
Profunctor p => Functor (Procompose p q a) |
Instance details Defined in Data.Profunctor.Composition Methods fmap :: (a0 -> b) -> Procompose p q a a0 -> Procompose p q a b Source # (<$) :: a0 -> Procompose p q a b -> Procompose p q a a0 Source #
Profunctor p => Functor (Rift p q a) |
Instance details Defined in Data.Profunctor.Composition Methods fmap :: (a0 -> b) -> Rift p q a a0 -> Rift p q a b Source # (<$) :: a0 -> Rift p q a b -> Rift p q a a0 Source #
Functor ((,,,,,,) a b c d e f) | Since: base-4.18.0.0
Instance details Defined in GHC.Internal.Base Methods fmap :: (a0 -> b0) -> (a, b, c, d, e, f, a0) -> (a, b, c, d, e, f, b0) Source # (<$) :: a0 -> (a, b, c, d, e, f, b0) -> (a, b, c, d, e, f, a0) Source #
(Bifunctor p, Functor g) => Functor (Biff p f g a) |
Instance details Defined in Data.Bifunctor.Biff Methods fmap :: (a0 -> b) -> Biff p f g a a0 -> Biff p f g a b Source # (<$) :: a0 -> Biff p f g a b -> Biff p f g a a0 Source #

class Monad m => MonadFail (m :: Type -> Type) where Source #

When a value is bound in `do`-notation, the pattern on the left hand side of `<-` might not match. In this case, this class provides a function to recover.

A `Monad` without a `MonadFail` instance may only be used in conjunction with pattern that always match, such as newtypes, tuples, data types with only a single data constructor, and irrefutable patterns (`~pat`).

Instances of `MonadFail` should satisfy the following law: `fail s` should be a left zero for `>>=`,

    fail s >>= f  =  fail s

If your `Monad` is also `MonadPlus`, a popular definition is

    fail _ = mzero

`fail s` should be an action that runs in the monad itself, not an exception (except in instances of `MonadIO`). In particular, `fail` should not be implemented in terms of `error`.

Since: base-4.9.0.0

Methods

fail :: String -> m a Source #

#### Instances

Instances details

MonadFail IResult |
Instance details Defined in Data.Aeson.Types.Internal Methods fail :: String -> IResult a Source #
MonadFail Parser |
Instance details Defined in Data.Aeson.Types.Internal Methods fail :: String -> Parser a Source #
MonadFail Result |
Instance details Defined in Data.Aeson.Types.Internal Methods fail :: String -> Result a Source #
MonadFail Get |
Instance details Defined in Data.Binary.Get.Internal Methods fail :: String -> Get a Source #
MonadFail DList |
Instance details Defined in Data.DList.Internal Methods fail :: String -> DList a Source #
MonadFail P | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods fail :: String -> P a Source #
MonadFail ReadP | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods fail :: String -> ReadP a Source #
MonadFail ReadPrec | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadPrec Methods fail :: String -> ReadPrec a Source #
MonadFail IO | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Control.Monad.Fail Methods fail :: String -> IO a Source #
MonadFail ReadM |
Instance details Defined in Options.Applicative.Types Methods fail :: String -> ReadM a Source #
MonadFail Array |
Instance details Defined in Data.Primitive.Array Methods fail :: String -> Array a Source #
MonadFail SmallArray |
Instance details Defined in Data.Primitive.SmallArray Methods fail :: String -> SmallArray a Source #
MonadFail Q |
Instance details Defined in Language.Haskell.TH.Syntax Methods fail :: String -> Q a Source #
MonadFail Vector |
Instance details Defined in Data.Vector Methods fail :: String -> Vector a Source #
MonadFail Vector |
Instance details Defined in Data.Vector.Strict Methods fail :: String -> Vector a Source #
MonadFail Stream |
Instance details Defined in Codec.Compression.Zlib.Stream Methods fail :: String -> Stream a Source #
MonadFail Maybe | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Control.Monad.Fail Methods fail :: String -> Maybe a Source #
MonadFail [] | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Control.Monad.Fail Methods fail :: String -> [a] Source #
Monad m => MonadFail (PropertyM m) |
Instance details Defined in Test.QuickCheck.Monadic Methods fail :: String -> PropertyM m a Source #
Monad m => MonadFail (MaybeT m) |
Instance details Defined in Control.Monad.Trans.Maybe Methods fail :: String -> MaybeT m a Source #
(Functor f, MonadFail m) => MonadFail (FreeT f m) |
Instance details Defined in Control.Monad.Trans.Free Methods fail :: String -> FreeT f m a Source #
MonadFail f => MonadFail (Ap f) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods fail :: String -> Ap f a Source #
(Monoid w, MonadFail m) => MonadFail (AccumT w m) |
Instance details Defined in Control.Monad.Trans.Accum Methods fail :: String -> AccumT w m a Source #
MonadFail m => MonadFail (ExceptT e m) |
Instance details Defined in Control.Monad.Trans.Except Methods fail :: String -> ExceptT e m a Source #
MonadFail m => MonadFail (IdentityT m) |
Instance details Defined in Control.Monad.Trans.Identity Methods fail :: String -> IdentityT m a Source #
MonadFail m => MonadFail (ReaderT r m) |
Instance details Defined in Control.Monad.Trans.Reader Methods fail :: String -> ReaderT r m a Source #
MonadFail m => MonadFail (SelectT r m) |
Instance details Defined in Control.Monad.Trans.Select Methods fail :: String -> SelectT r m a Source #
MonadFail m => MonadFail (StateT s m) |
Instance details Defined in Control.Monad.Trans.State.Lazy Methods fail :: String -> StateT s m a Source #
MonadFail m => MonadFail (StateT s m) |
Instance details Defined in Control.Monad.Trans.State.Strict Methods fail :: String -> StateT s m a Source #
MonadFail m => MonadFail (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.CPS Methods fail :: String -> WriterT w m a Source #
(Monoid w, MonadFail m) => MonadFail (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods fail :: String -> WriterT w m a Source #
(Monoid w, MonadFail m) => MonadFail (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods fail :: String -> WriterT w m a Source #
MonadFail m => MonadFail (Reverse m) |
Instance details Defined in Data.Functor.Reverse Methods fail :: String -> Reverse m a Source #
MonadFail m => MonadFail (ContT r m) |
Instance details Defined in Control.Monad.Trans.Cont Methods fail :: String -> ContT r m a Source #
MonadFail m => MonadFail (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.CPS Methods fail :: String -> RWST r w s m a Source #
(Monoid w, MonadFail m) => MonadFail (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.Lazy Methods fail :: String -> RWST r w s m a Source #
(Monoid w, MonadFail m) => MonadFail (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.Strict Methods fail :: String -> RWST r w s m a Source #

guard :: Alternative f => Bool -> f () Source #

Conditional failure of `Alternative` computations. Defined by

    guard True  = pure ()
    guard False = empty

#### Examples

Expand

Common uses of `guard` include conditionally signalling an error in an error monad and conditionally rejecting the current choice in an `Alternative`-based parser.

As an example of signalling an error in the error monad `Maybe`, consider a safe division function `safeDiv x y` that returns `Nothing` when the denominator `y` is zero and ``Just` (x `div` y)` otherwise. For example:

    >>> safeDiv 4 0
    Nothing

    >>> safeDiv 4 2
    Just 2

A definition of `safeDiv` using guards, but not `guard`:

    safeDiv :: Int -> Int -> Maybe Int
    safeDiv x y | y /= 0    = Just (x `div` y)
                | otherwise = Nothing

A definition of `safeDiv` using `guard` and `Monad` `do`-notation:

    safeDiv :: Int -> Int -> Maybe Int
    safeDiv x y = do
      guard (y /= 0)
      return (x `div` y)

class (Alternative m, Monad m) => MonadPlus (m :: Type -> Type) where Source #

Monads that also support choice and failure.

Minimal complete definition

Nothing

Methods

mzero :: m a Source #

The identity of `mplus`. It should also satisfy the equations

    mzero >>= f  =  mzero
    v >> mzero   =  mzero

The default definition is

    mzero = empty

mplus :: m a -> m a -> m a Source #

An associative operation. The default definition is

    mplus = (<|>)

#### Instances

Instances details

MonadPlus Strategy Source # |
Instance details Defined in Game.LambdaHack.Client.AI.Strategy Methods mzero :: Strategy a Source # mplus :: Strategy a -> Strategy a -> Strategy a Source #
MonadPlus Frequency Source # |
Instance details Defined in Game.LambdaHack.Core.Frequency Methods mzero :: Frequency a Source # mplus :: Frequency a -> Frequency a -> Frequency a Source #
MonadPlus IResult |
Instance details Defined in Data.Aeson.Types.Internal Methods mzero :: IResult a Source # mplus :: IResult a -> IResult a -> IResult a Source #
MonadPlus Parser |
Instance details Defined in Data.Aeson.Types.Internal Methods mzero :: Parser a Source # mplus :: Parser a -> Parser a -> Parser a Source #
MonadPlus Result |
Instance details Defined in Data.Aeson.Types.Internal Methods mzero :: Result a Source # mplus :: Result a -> Result a -> Result a Source #
MonadPlus Get | Since: binary-0.7.1.0
Instance details Defined in Data.Binary.Get.Internal Methods mzero :: Get a Source # mplus :: Get a -> Get a -> Get a Source #
MonadPlus Seq |
Instance details Defined in Data.Sequence.Internal Methods mzero :: Seq a Source # mplus :: Seq a -> Seq a -> Seq a Source #
MonadPlus DList |
Instance details Defined in Data.DList.Internal Methods mzero :: DList a Source # mplus :: DList a -> DList a -> DList a Source #
MonadPlus STM | Takes the first non-`retry`ing `STM` action. Since: base-4.3.0.0
Instance details Defined in GHC.Internal.Conc.Sync Methods mzero :: STM a Source # mplus :: STM a -> STM a -> STM a Source #
MonadPlus P | Since: base-2.1
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods mzero :: P a Source # mplus :: P a -> P a -> P a Source #
MonadPlus ReadP | Since: base-2.1
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadP Methods mzero :: ReadP a Source # mplus :: ReadP a -> ReadP a -> ReadP a Source #
MonadPlus ReadPrec | Since: base-2.1
Instance details Defined in GHC.Internal.Text.ParserCombinators.ReadPrec Methods mzero :: ReadPrec a Source # mplus :: ReadPrec a -> ReadPrec a -> ReadPrec a Source #
MonadPlus IO | Takes the first non-throwing `IO` action's result. `mzero` throws an exception. Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods mzero :: IO a Source # mplus :: IO a -> IO a -> IO a Source #
MonadPlus Chunk |
Instance details Defined in Options.Applicative.Help.Chunk Methods mzero :: Chunk a Source # mplus :: Chunk a -> Chunk a -> Chunk a Source #
MonadPlus Completion |
Instance details Defined in Options.Applicative.Internal Methods mzero :: Completion a Source # mplus :: Completion a -> Completion a -> Completion a Source #
MonadPlus P |
Instance details Defined in Options.Applicative.Internal Methods mzero :: P a Source # mplus :: P a -> P a -> P a Source #
MonadPlus ReadM |
Instance details Defined in Options.Applicative.Types Methods mzero :: ReadM a Source # mplus :: ReadM a -> ReadM a -> ReadM a Source #
MonadPlus Array |
Instance details Defined in Data.Primitive.Array Methods mzero :: Array a Source # mplus :: Array a -> Array a -> Array a Source #
MonadPlus SmallArray |
Instance details Defined in Data.Primitive.SmallArray Methods mzero :: SmallArray a Source # mplus :: SmallArray a -> SmallArray a -> SmallArray a Source #
MonadPlus Vector |
Instance details Defined in Data.Vector Methods mzero :: Vector a Source # mplus :: Vector a -> Vector a -> Vector a Source #
MonadPlus Vector |
Instance details Defined in Data.Vector.Strict Methods mzero :: Vector a Source # mplus :: Vector a -> Vector a -> Vector a Source #
MonadPlus Maybe | Picks the leftmost `Just` value, or, alternatively, `Nothing`. Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods mzero :: Maybe a Source # mplus :: Maybe a -> Maybe a -> Maybe a Source #
MonadPlus [] | Combines lists by concatenation, starting from the empty list. Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods mzero :: [a] Source # mplus :: [a] -> [a] -> [a] Source #
MonadPlus v => MonadPlus (Free v) |
Instance details Defined in Control.Monad.Free Methods mzero :: Free v a Source # mplus :: Free v a -> Free v a -> Free v a Source #
(ArrowApply a, ArrowPlus a) => MonadPlus (ArrowMonad a) | Since: base-4.6.0.0
Instance details Defined in GHC.Internal.Control.Arrow Methods mzero :: ArrowMonad a a0 Source # mplus :: ArrowMonad a a0 -> ArrowMonad a a0 -> ArrowMonad a a0 Source #
MonadPlus (U1 :: Type -> Type) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods mzero :: U1 a Source # mplus :: U1 a -> U1 a -> U1 a Source #
MonadPlus m => MonadPlus (Yoneda m) |
Instance details Defined in Data.Functor.Yoneda Methods mzero :: Yoneda m a Source # mplus :: Yoneda m a -> Yoneda m a -> Yoneda m a Source #
MonadPlus (ReifiedFold s) |
Instance details Defined in Control.Lens.Reified Methods mzero :: ReifiedFold s a Source # mplus :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a Source #
Monad m => MonadPlus (ListT m) |
Instance details Defined in Options.Applicative.Internal Methods mzero :: ListT m a Source # mplus :: ListT m a -> ListT m a -> ListT m a Source #
Monad m => MonadPlus (NondetT m) |
Instance details Defined in Options.Applicative.Internal Methods mzero :: NondetT m a Source # mplus :: NondetT m a -> NondetT m a -> NondetT m a Source #
Monad m => MonadPlus (MaybeT m) |
Instance details Defined in Control.Monad.Trans.Maybe Methods mzero :: MaybeT m a Source # mplus :: MaybeT m a -> MaybeT m a -> MaybeT m a Source #
(Functor f, MonadPlus m) => MonadPlus (FreeT f m) |
Instance details Defined in Control.Monad.Trans.Free Methods mzero :: FreeT f m a Source # mplus :: FreeT f m a -> FreeT f m a -> FreeT f m a Source #
MonadPlus m => MonadPlus (Kleisli m a) | Since: base-4.14.0.0
Instance details Defined in GHC.Internal.Control.Arrow Methods mzero :: Kleisli m a a0 Source # mplus :: Kleisli m a a0 -> Kleisli m a a0 -> Kleisli m a a0 Source #
MonadPlus f => MonadPlus (Ap f) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods mzero :: Ap f a Source # mplus :: Ap f a -> Ap f a -> Ap f a Source #
MonadPlus f => MonadPlus (Alt f) | Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods mzero :: Alt f a Source # mplus :: Alt f a -> Alt f a -> Alt f a Source #
MonadPlus f => MonadPlus (Rec1 f) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods mzero :: Rec1 f a Source # mplus :: Rec1 f a -> Rec1 f a -> Rec1 f a Source #
(Monoid w, Functor m, MonadPlus m) => MonadPlus (AccumT w m) |
Instance details Defined in Control.Monad.Trans.Accum Methods mzero :: AccumT w m a Source # mplus :: AccumT w m a -> AccumT w m a -> AccumT w m a Source #
(Monad m, Monoid e) => MonadPlus (ExceptT e m) |
Instance details Defined in Control.Monad.Trans.Except Methods mzero :: ExceptT e m a Source # mplus :: ExceptT e m a -> ExceptT e m a -> ExceptT e m a Source #
MonadPlus m => MonadPlus (IdentityT m) |
Instance details Defined in Control.Monad.Trans.Identity Methods mzero :: IdentityT m a Source # mplus :: IdentityT m a -> IdentityT m a -> IdentityT m a Source #
MonadPlus m => MonadPlus (ReaderT r m) |
Instance details Defined in Control.Monad.Trans.Reader Methods mzero :: ReaderT r m a Source # mplus :: ReaderT r m a -> ReaderT r m a -> ReaderT r m a Source #
MonadPlus m => MonadPlus (SelectT r m) |
Instance details Defined in Control.Monad.Trans.Select Methods mzero :: SelectT r m a Source # mplus :: SelectT r m a -> SelectT r m a -> SelectT r m a Source #
MonadPlus m => MonadPlus (StateT s m) |
Instance details Defined in Control.Monad.Trans.State.Lazy Methods mzero :: StateT s m a Source # mplus :: StateT s m a -> StateT s m a -> StateT s m a Source #
MonadPlus m => MonadPlus (StateT s m) |
Instance details Defined in Control.Monad.Trans.State.Strict Methods mzero :: StateT s m a Source # mplus :: StateT s m a -> StateT s m a -> StateT s m a Source #
(Functor m, MonadPlus m) => MonadPlus (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.CPS Methods mzero :: WriterT w m a Source # mplus :: WriterT w m a -> WriterT w m a -> WriterT w m a Source #
(Monoid w, MonadPlus m) => MonadPlus (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods mzero :: WriterT w m a Source # mplus :: WriterT w m a -> WriterT w m a -> WriterT w m a Source #
(Monoid w, MonadPlus m) => MonadPlus (WriterT w m) |
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods mzero :: WriterT w m a Source # mplus :: WriterT w m a -> WriterT w m a -> WriterT w m a Source #
MonadPlus m => MonadPlus (Reverse m) | Derived instance.
Instance details Defined in Data.Functor.Reverse Methods mzero :: Reverse m a Source # mplus :: Reverse m a -> Reverse m a -> Reverse m a Source #
(MonadPlus f, MonadPlus g) => MonadPlus (Product f g) | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods mzero :: Product f g a Source # mplus :: Product f g a -> Product f g a -> Product f g a Source #
(MonadPlus f, MonadPlus g) => MonadPlus (f :*: g) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods mzero :: (f :*: g) a Source # mplus :: (f :*: g) a -> (f :*: g) a -> (f :*: g) a Source #
MonadPlus f => MonadPlus (M1 i c f) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Generics Methods mzero :: M1 i c f a Source # mplus :: M1 i c f a -> M1 i c f a -> M1 i c f a Source #
(Functor m, MonadPlus m) => MonadPlus (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.CPS Methods mzero :: RWST r w s m a Source # mplus :: RWST r w s m a -> RWST r w s m a -> RWST r w s m a Source #
(Monoid w, MonadPlus m) => MonadPlus (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.Lazy Methods mzero :: RWST r w s m a Source # mplus :: RWST r w s m a -> RWST r w s m a -> RWST r w s m a Source #
(Monoid w, MonadPlus m) => MonadPlus (RWST r w s m) |
Instance details Defined in Control.Monad.Trans.RWS.Strict Methods mzero :: RWST r w s m a Source # mplus :: RWST r w s m a -> RWST r w s m a -> RWST r w s m a Source #

(=<<) :: Monad m => (a -> m b) -> m a -> m b infixr 1 Source #

Same as `>>=`, but with the arguments interchanged.

    as >>= f == f =<< as

when :: Applicative f => Bool -> f () -> f () Source #

Conditional execution of `Applicative` expressions. For example,

#### Examples

Expand

    when debug (putStrLn "Debugging")

will output the string `Debugging` if the Boolean value `debug` is `True`, and otherwise do nothing.

    >>> putStr "pi:" >> when False (print 3.14159)
    pi:

sequence :: (Traversable t, Monad m) => t (m a) -> m (t a) Source #

Evaluate each monadic action in the structure from left to right, and collect the results. For a version that ignores the results see `sequence_`.

#### Examples

Expand

Basic usage:

The first two examples are instances where the input and and output of `sequence` are isomorphic.

    >>> sequence $ Right [1,2,3,4]
    [Right 1,Right 2,Right 3,Right 4]

    >>> sequence $ [Right 1,Right 2,Right 3,Right 4]
    Right [1,2,3,4]

The following examples demonstrate short circuit behavior for `sequence`.

    >>> sequence $ Left [1,2,3,4]
    Left [1,2,3,4]

    >>> sequence $ [Left 0, Right 1,Right 2,Right 3,Right 4]
    Left 0

mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b) Source #

Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see `mapM_`.

#### Examples

Expand

`mapM` is literally a `traverse` with a type signature restricted to `Monad`. Its implementation may be more efficient due to additional power of `Monad`.

liftM :: Monad m => (a1 -> r) -> m a1 -> m r Source #

Promote a function to a monad. This is equivalent to `fmap` but specialised to Monads.

liftM2 :: Monad m => (a1 -> a2 -> r) -> m a1 -> m a2 -> m r Source #

Promote a function to a monad, scanning the monadic arguments from left to right.

#### Examples

Expand

    >>> liftM2 (+) [0,1] [0,2]
    [0,2,1,3]

    >>> liftM2 (+) (Just 1) Nothing
    Nothing

    >>> liftM2 (+) (+ 3) (* 2) 5
    18

liftM3 :: Monad m => (a1 -> a2 -> a3 -> r) -> m a1 -> m a2 -> m a3 -> m r Source #

Promote a function to a monad, scanning the monadic arguments from left to right (cf. `liftM2`).

liftM4 :: Monad m => (a1 -> a2 -> a3 -> a4 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m r Source #

Promote a function to a monad, scanning the monadic arguments from left to right (cf. `liftM2`).

liftM5 :: Monad m => (a1 -> a2 -> a3 -> a4 -> a5 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r Source #

Promote a function to a monad, scanning the monadic arguments from left to right (cf. `liftM2`).

ap :: Monad m => m (a -> b) -> m a -> m b Source #

In many situations, the `liftM` operations can be replaced by uses of `ap`, which promotes function application.

    return f `ap` x1 `ap` ... `ap` xn

is equivalent to

    liftM<n> f x1 x2 ... xn

#### Examples

Expand

    >>> pure (\x y z -> x + y * z) `ap` Just 1 `ap` Just 5 `ap` Just 10
    Just 51

sequence_ :: (Foldable t, Monad m) => t (m a) -> m () Source #

Evaluate each monadic action in the structure from left to right, and ignore the results. For a version that doesn't ignore the results see `sequence`.

`sequence_` is just like `sequenceA_`, but specialised to monadic actions.

msum :: (Foldable t, MonadPlus m) => t (m a) -> m a Source #

The sum of a collection of actions using `(<|>)`, generalizing `concat`.

`msum` is just like `asum`, but specialised to `MonadPlus`.

#### Examples

Expand

Basic usage, using the `MonadPlus` instance for `Maybe`:

    >>> msum [Just "Hello", Nothing, Just "World"]
    Just "Hello"

forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m (t b) Source #

`forM` is `mapM` with its arguments flipped. For a version that ignores the results see `forM_`.

filterM :: Applicative m => (a -> m Bool) -> [a] -> m [a] Source #

This generalizes the list-based `filter` function.

    runIdentity (filterM (Identity . p) xs) == filter p xs

#### Examples

Expand

    >>> filterM (\x -> do
          putStrLn ("Keep: " ++ show x ++ "?")
          answer <- getLine
          pure (answer == "y"))
        [1, 2, 3]
    Keep: 1?
    y
    Keep: 2?
    n
    Keep: 3?
    y
    [1,3]

    >>> filterM (\x -> do
          putStr (show x)
          x' <- readLn
          pure (x == x'))
        [1, 2, 3]
    12
    22
    33
    [2,3]

(>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c infixr 1 Source #

Left-to-right composition of `Kleisli` arrows.

'`(bs `>=>` cs) a`' can be understood as the `do` expression

    do b <- bs a
       cs b

or in terms of ``(>>=)`` as

    bs a >>= cs

(<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c infixr 1 Source #

Right-to-left composition of Kleisli arrows. `(`>=>`)`, with the arguments flipped.

Note how this operator resembles function composition `(`.`)`:

    (.)   ::            (b ->   c) -> (a ->   b) -> a ->   c
    (<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c

forever :: Applicative f => f a -> f b Source #

Repeat an action indefinitely.

#### Examples

Expand

A common use of `forever` is to process input from network sockets, `Handle`s, and channels (e.g. `MVar` and `Chan`).

For example, here is how we might implement an echo server, using `forever` both to listen for client connections on a network socket and to echo client input on client connection handles:

    echoServer :: Socket -> IO ()
    echoServer socket = forever $ do
      client <- accept socket
      forkFinally (echo client) (\_ -> hClose client)
      where
        echo :: Handle -> IO ()
        echo client = forever $
          hGetLine client >>= hPutStrLn client

Note that "forever" isn't necessarily non-terminating. If the action is in a ``MonadPlus`` and short-circuits after some number of iterations. then ``forever`` actually returns `mzero`, effectively short-circuiting its caller.

mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c]) Source #

The `mapAndUnzipM` function maps its first argument over a list, returning the result as a pair of lists. This function is mainly used with complicated data structures or a state monad.

zipWithM :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m [c] Source #

The `zipWithM` function generalizes `zipWith` to arbitrary applicative functors.

zipWithM_ :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m () Source #

`zipWithM_` is the extension of `zipWithM` which ignores the final result.

foldM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b Source #

The `foldM` function is analogous to `foldl`, except that its result is encapsulated in a monad. Note that `foldM` works from left-to-right over the list arguments. This could be an issue where `(`>>`)` and the `folded function' are not commutative.

    foldM f a1 [x1, x2, ..., xm]

    ==

    do
      a2 <- f a1 x1
      a3 <- f a2 x2
      ...
      f am xm

If right-to-left evaluation is required, the input list should be reversed.

Note: `foldM` is the same as `foldlM`

foldM_ :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m () Source #

Like `foldM`, but discards the result.

replicateM :: Applicative m => Int -> m a -> m [a] Source #

``replicateM` n act` performs the action `act` `n` times, and then returns the list of results.

    replicateM n (pure x) == replicate n x

#### Examples

Expand

    >>> replicateM 3 getLine
    hi
    heya
    hiya
    ["hi","heya","hiya"]

    >>> import Control.Monad.State
    >>> runState (replicateM 3 $ state $ \s -> (s, s + 1)) 1
    ([1,2,3],4)

replicateM_ :: Applicative m => Int -> m a -> m () Source #

Like `replicateM`, but discards the result.

#### Examples

Expand

    >>> replicateM_ 3 (putStr "a")
    aaa

unless :: Applicative f => Bool -> f () -> f () Source #

The reverse of `when`.

#### Examples

Expand

    >>> do x <- getLine
           unless (x == "hi") (putStrLn "hi!")
    comingupwithexamplesisdifficult
    hi!

    >>> unless (pi > exp 1) Nothing
    Just ()

(<$!>) :: Monad m => (a -> b) -> m a -> m b infixl 4 Source #

Strict version of `<$>`.

Since: base-4.8.0.0

mfilter :: MonadPlus m => (a -> Bool) -> m a -> m a Source #

Direct `MonadPlus` equivalent of `filter`.

#### Examples

Expand

The `filter` function is just `mfilter` specialized to the list monad:

    filter = ( mfilter :: (a -> Bool) -> [a] -> [a] )

An example using `mfilter` with the `Maybe` monad:

    >>> mfilter odd (Just 1)
    Just 1
    >>> mfilter odd (Just 2)
    Nothing

sort :: Ord a => [a] -> [a] Source #

The `sort` function implements a stable sorting algorithm. It is a special case of `sortBy`, which allows the programmer to supply their own comparison function.

Elements are arranged from lowest to highest, keeping duplicates in the order they appeared in the input.

The argument must be finite.

#### Examples

Expand

    >>> sort [1,6,4,3,2,5]
    [1,2,3,4,5,6]

    >>> sort "haskell"
    "aehklls"

    >>> import Data.Semigroup(Arg(..))
    >>> sort [Arg ":)" 0, Arg ":D" 0, Arg ":)" 1, Arg ":3" 0, Arg ":D" 1]
    [Arg ":)" 0,Arg ":)" 1,Arg ":3" 0,Arg ":D" 0,Arg ":D" 1]

delete :: Eq a => a -> [a] -> [a] Source #

\(\mathcal{O}(n)\). `delete` `x` removes the first occurrence of `x` from its list argument.

It is a special case of `deleteBy`, which allows the programmer to supply their own equality test.

#### Examples

Expand

    >>> delete 'a' "banana"
    "bnana"

    >>> delete "not" ["haskell", "is", "not", "awesome"]
    ["haskell","is","awesome"]

data List a Source #

The builtin linked list type.

In Haskell, lists are one of the most important data types as they are often used analogous to loops in imperative programming languages. These lists are singly linked, which makes them unsuited for operations that require \(\mathcal{O}(1)\) access. Instead, they are intended to be traversed.

You can use `List a` or `[a]` in type signatures:

    length :: [a] -> Int

or

    length :: List a -> Int

They are fully equivalent, and `List a` will be normalised to `[a]`.

#### Usage

Lists are constructed recursively using the right-associative constructor operator (or cons) `(:) :: a -> [a] -> [a]`, which prepends an element to a list, and the empty list `[]`.

    (1 : 2 : 3 : []) == (1 : (2 : (3 : []))) == [1, 2, 3]

Lists can also be constructed using list literals of the form `[x_1, x_2, ..., x_n]` which are syntactic sugar and, unless `-XOverloadedLists` is enabled, are translated into uses of `(:)` and `[]`

`String` literals, like `"I 💜 hs"`, are translated into Lists of characters, `['I', ' ', '💜', ' ', 'h', 's']`.

#### Implementation

Expand

Internally and in memory, all the above are represented like this, with arrows being pointers to locations in memory.

    ╭───┬───┬──╮   ╭───┬───┬──╮   ╭───┬───┬──╮   ╭────╮
    │(:)│   │ ─┼──>│(:)│   │ ─┼──>│(:)│   │ ─┼──>│ [] │
    ╰───┴─┼─┴──╯   ╰───┴─┼─┴──╯   ╰───┴─┼─┴──╯   ╰────╯
          v              v              v
          1              2              3

#### Examples

Expand

    >>> ['H', 'a', 's', 'k', 'e', 'l', 'l']
    "Haskell"

    >>> 1 : [4, 1, 5, 9]
    [1,4,1,5,9]

    >>> [] : [] : []
    [[],[]]

Since: ghc-prim-0.10.0

#### Instances

Instances details

Arbitrary1 [] |
Instance details Defined in Test.QuickCheck.Arbitrary Methods liftArbitrary :: Gen a -> Gen [a] Source # liftShrink :: (a -> [a]) -> [a] -> [[a]] Source #
MonadZip [] | Since: base-4.3.1.0
Instance details Defined in Control.Monad.Zip Methods mzip :: [a] -> [b] -> [(a, b)] Source # mzipWith :: (a -> b -> c) -> [a] -> [b] -> [c] Source # munzip :: [(a, b)] -> ([a], [b]) Source #
Eq1 [] | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftEq :: (a -> b -> Bool) -> [a] -> [b] -> Bool Source #
Ord1 [] | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftCompare :: (a -> b -> Ordering) -> [a] -> [b] -> Ordering Source #
Read1 [] | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS [a] Source # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [[a]] Source # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [a] Source # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [[a]] Source #
Show1 [] | Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> [a] -> ShowS Source # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [[a]] -> ShowS Source #
NFData1 [] | Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> [a] -> () Source #
Alternative [] | Combines lists by concatenation, starting from the empty list. Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods empty :: [a] Source # (<|>) :: [a] -> [a] -> [a] Source # some :: [a] -> [[a]] Source # many :: [a] -> [[a]] Source #
Applicative [] | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods pure :: a -> [a] Source # (<*>) :: [a -> b] -> [a] -> [b] Source # liftA2 :: (a -> b -> c) -> [a] -> [b] -> [c] Source # (*>) :: [a] -> [b] -> [b] Source # (<*) :: [a] -> [b] -> [a] Source #
Functor [] | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods fmap :: (a -> b) -> [a] -> [b] Source # (<$) :: a -> [b] -> [a] Source #
Monad [] | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods (>>=) :: [a] -> (a -> [b]) -> [b] Source # (>>) :: [a] -> [b] -> [b] Source # return :: a -> [a] Source #
MonadPlus [] | Combines lists by concatenation, starting from the empty list. Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods mzero :: [a] Source # mplus :: [a] -> [a] -> [a] Source #
MonadFail [] | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Control.Monad.Fail Methods fail :: String -> [a] Source #
Foldable [] | Since: base-2.1

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

fold :: Monoid m => [m] -> m Source #

foldMap :: Monoid m => (a -> m) -> [a] -> m Source #

foldMap' :: Monoid m => (a -> m) -> [a] -> m Source #

foldr :: (a -> b -> b) -> b -> [a] -> b Source #

foldr' :: (a -> b -> b) -> b -> [a] -> b Source #

foldl :: (b -> a -> b) -> b -> [a] -> b Source #

foldl' :: (b -> a -> b) -> b -> [a] -> b Source #

foldr1 :: (a -> a -> a) -> [a] -> a Source #

foldl1 :: (a -> a -> a) -> [a] -> a Source #

toList :: [a] -> [a] Source #

null :: [a] -> Bool Source #

length :: [a] -> Int Source #

elem :: Eq a => a -> [a] -> Bool Source #

maximum :: Ord a => [a] -> a Source #

minimum :: Ord a => [a] -> a Source #

sum :: Num a => [a] -> a Source #

product :: Num a => [a] -> a Source #

Traversable [] | Since: base-2.1
Instance details Defined in GHC.Internal.Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> [a] -> f [b] Source # sequenceA :: Applicative f => [f a] -> f [a] Source # mapM :: Monad m => (a -> m b) -> [a] -> m [b] Source # sequence :: Monad m => [m a] -> m [a] Source #
Hashable1 [] |
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> [a] -> Int Source #
Adjustable [] |
Instance details Defined in Data.Key Methods adjust :: (a -> a) -> Key [] -> [a] -> [a] Source # replace :: Key [] -> a -> [a] -> [a] Source #
FoldableWithKey [] |
Instance details Defined in Data.Key Methods toKeyedList :: [a] -> [(Key [], a)] Source # foldMapWithKey :: Monoid m => (Key [] -> a -> m) -> [a] -> m Source # foldrWithKey :: (Key [] -> a -> b -> b) -> b -> [a] -> b Source # foldlWithKey :: (b -> Key [] -> a -> b) -> b -> [a] -> b Source #
Indexable [] |
Instance details Defined in Data.Key Methods index :: [a] -> Key [] -> a Source #
Keyed [] |
Instance details Defined in Data.Key Methods mapWithKey :: (Key [] -> a -> b) -> [a] -> [b] Source #
Lookup [] |
Instance details Defined in Data.Key Methods lookup :: Key [] -> [a] -> Maybe a Source #
TraversableWithKey [] |
Instance details Defined in Data.Key Methods traverseWithKey :: Applicative f => (Key [] -> a -> f b) -> [a] -> f [b] Source # mapWithKeyM :: Monad m => (Key [] -> a -> m b) -> [a] -> m [b] Source #
Zip [] |
Instance details Defined in Data.Key Methods zipWith :: (a -> b -> c) -> [a] -> [b] -> [c] Source # zip :: [a] -> [b] -> [(a, b)] Source # zap :: [a -> b] -> [a] -> [b] Source #
ZipWithKey [] |
Instance details Defined in Data.Key Methods zipWithKey :: (Key [] -> a -> b -> c) -> [a] -> [b] -> [c] Source # zapWithKey :: [Key [] -> a -> b] -> [a] -> [b] Source #
Affine [] |

Instance details

Defined in Linear.Affine

Associated Types

type Diff [] |
Instance details Defined in Linear.Affine type Diff [] = []

Methods

(.-.) :: Num a => [a] -> [a] -> Diff [] a

(.+^) :: Num a => [a] -> Diff [] a -> [a]

(.-^) :: Num a => [a] -> Diff [] a -> [a]

Generic1 [] |

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep1 [] | Since: base-4.6.0.0

Instance details

Defined in GHC.Internal.Generics

type Rep1 [] = D1 ('MetaData "List" "GHC.Types" "ghc-prim" 'False) (C1 ('MetaCons "[]" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons ":" ('InfixI 'RightAssociative 5) 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 [])))

Methods

from1 :: [a] -> Rep1 [] a Source #

to1 :: Rep1 [] a -> [a] Source #

Sieve ReifiedFold [] |
Instance details Defined in Control.Lens.Reified Methods sieve :: ReifiedFold a b -> a -> [b]
From Text String | Uses `unpack`.
Instance details Defined in Witch.Instances Methods from :: Text -> String Source #
From Text String | Uses `unpack`.
Instance details Defined in Witch.Instances Methods from :: Text -> String Source #
From Latin1L String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: Latin1L -> String Source #
From Latin1S String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: Latin1S -> String Source #
From String Text | Uses `pack`. Some `Char` values cannot be represented in `Text` and will be replaced with `'\xFFFD'`.
Instance details Defined in Witch.Instances Methods from :: String -> Text Source #
From String Text | Uses `pack`. Some `Char` values cannot be represented in `Text` and will be replaced with `'\xFFFD'`.
Instance details Defined in Witch.Instances Methods from :: String -> Text Source #
From String Utf16BL | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf16BL Source #
From String Utf16BS | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf16BS Source #
From String Utf16LL | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf16LL Source #
From String Utf16LS | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf16LS Source #
From String Utf32BL | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf32BL Source #
From String Utf32BS | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf32BS Source #
From String Utf32LL | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf32LL Source #
From String Utf32LS | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf32LS Source #
From String Utf8L | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf8L Source #
From String Utf8S | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: String -> Utf8S Source #
TryFrom Utf16BL String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf16BL -> Either (TryFromException Utf16BL String) String Source #
TryFrom Utf16BS String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf16BS -> Either (TryFromException Utf16BS String) String Source #
TryFrom Utf16LL String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf16LL -> Either (TryFromException Utf16LL String) String Source #
TryFrom Utf16LS String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf16LS -> Either (TryFromException Utf16LS String) String Source #
TryFrom Utf32BL String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf32BL -> Either (TryFromException Utf32BL String) String Source #
TryFrom Utf32BS String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf32BS -> Either (TryFromException Utf32BS String) String Source #
TryFrom Utf32LL String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf32LL -> Either (TryFromException Utf32LL String) String Source #
TryFrom Utf32LS String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf32LS -> Either (TryFromException Utf32LS String) String Source #
TryFrom Utf8L String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf8L -> Either (TryFromException Utf8L String) String Source #
TryFrom Utf8S String | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf8S -> Either (TryFromException Utf8S String) String Source #
TryFrom String Latin1L | Uses `pack` when each character `isLatin1`.
Instance details Defined in Witch.Instances Methods tryFrom :: String -> Either (TryFromException String Latin1L) Latin1L Source #
TryFrom String Latin1S | Uses `pack` when each character `isLatin1`.
Instance details Defined in Witch.Instances Methods tryFrom :: String -> Either (TryFromException String Latin1S) Latin1S Source #
KnownSymbol n => Reifies (n :: Symbol) String |
Instance details Defined in Data.Reflection Methods reflect :: proxy n -> String
Lift a => Lift ([a] :: Type) |
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Quote m => [a] -> m Exp Source # liftTyped :: forall (m :: Type -> Type). Quote m => [a] -> Code m [a] Source #
From ByteString [Word8] | Uses `unpack`.
Instance details Defined in Witch.Instances Methods from :: ByteString -> [Word8] Source #
From ByteString [Word8] | Uses `unpack`.
Instance details Defined in Witch.Instances Methods from :: ByteString -> [Word8] Source #
From ShortByteString [Word8] | Uses `unpack`.
Instance details Defined in Witch.Instances Methods from :: ShortByteString -> [Word8] Source #
From IntSet [Int] | Uses `toAscList`.
Instance details Defined in Witch.Instances Methods from :: IntSet -> [Int] Source #
Arbitrary a => Arbitrary [a] |
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen [a] Source # shrink :: [a] -> [[a]] Source #
CoArbitrary a => CoArbitrary [a] |
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: [a] -> Gen b -> Gen b Source #
Function a => Function [a] |
Instance details Defined in Test.QuickCheck.Function Methods function :: ([a] -> b) -> [a] :-> b Source #
IsChar c => PrintfArg [c] | Since: base-2.1
Instance details Defined in Text.Printf Methods formatArg :: [c] -> FieldFormatter Source # parseFormat :: [c] -> ModifierParser Source #
IsChar c => PrintfType [c] | Since: base-2.1
Instance details Defined in Text.Printf Methods spr :: String -> [UPrintf] -> [c]
Binary a => Binary [a] |
Instance details Defined in Data.Binary.Class Methods put :: [a] -> Put Source # get :: Get [a] Source # putList :: [[a]] -> Put Source #
NFData a => NFData [a] |
Instance details Defined in Control.DeepSeq Methods rnf :: [a] -> () Source #
Monoid [a] | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods mempty :: [a] Source # mappend :: [a] -> [a] -> [a] Source # mconcat :: [[a]] -> [a] Source #
Semigroup [a] | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: [a] -> [a] -> [a] Source # sconcat :: NonEmpty [a] -> [a] Source # stimes :: Integral b => b -> [a] -> [a] Source #
a ~ Char => IsString [a] | `(a ~ Char)` context was introduced in `4.9.0.0` Since: base-2.1
Instance details Defined in GHC.Internal.Data.String Methods fromString :: String -> [a] Source #
Generic [a] |

Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep [a] | Since: base-4.6.0.0

Instance details

Defined in GHC.Internal.Generics

type Rep [a] = D1 ('MetaData "List" "GHC.Types" "ghc-prim" 'False) (C1 ('MetaCons "[]" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons ":" ('InfixI 'RightAssociative 5) 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [a])))

Methods

from :: [a] -> Rep [a] x Source #

to :: Rep [a] x -> [a] Source #

IsList [a] | Since: base-4.7.0.0

Instance details

Defined in GHC.Internal.IsList

Associated Types

type Item [a] |
Instance details Defined in GHC.Internal.IsList type Item [a] = a

Methods

fromList :: [Item [a]] -> [a] Source #

fromListN :: Int -> [Item [a]] -> [a] Source #

toList :: [a] -> [Item [a]] Source #

Read a => Read [a] | Since: base-2.1
Instance details Defined in GHC.Internal.Read Methods readsPrec :: Int -> ReadS [a] Source # readList :: ReadS [[a]] Source # readPrec :: ReadPrec [a] Source # readListPrec :: ReadPrec [[a]] Source #
Show a => Show [a] | Since: base-2.1
Instance details Defined in GHC.Internal.Show Methods showsPrec :: Int -> [a] -> ShowS Source # show :: [a] -> String Source # showList :: [[a]] -> ShowS Source #
Eq a => Eq [a] |
Instance details Defined in GHC.Classes Methods (==) :: [a] -> [a] -> Bool Source # (/=) :: [a] -> [a] -> Bool Source #
Ord a => Ord [a] |
Instance details Defined in GHC.Classes Methods compare :: [a] -> [a] -> Ordering Source # (<) :: [a] -> [a] -> Bool Source # (<=) :: [a] -> [a] -> Bool Source # (>) :: [a] -> [a] -> Bool Source # (>=) :: [a] -> [a] -> Bool Source # max :: [a] -> [a] -> [a] Source # min :: [a] -> [a] -> [a] Source #
Hashable a => Hashable [a] |
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> [a] -> Int Source # hash :: [a] -> Int Source #
Ixed [a] |
Instance details Defined in Control.Lens.At Methods ix :: Index [a] -> Traversal' [a] (IxValue [a])
Pretty a => Pretty [a] |
Instance details Defined in Prettyprinter.Internal Methods pretty :: [a] -> Doc ann # prettyList :: [[a]] -> Doc ann #
Ppr a => Ppr [a] |
Instance details Defined in Language.Haskell.TH.Ppr Methods ppr :: [a] -> Doc Source # ppr_list :: [[a]] -> Doc Source #
TypeSubstitution a => TypeSubstitution [a] |
Instance details Defined in Language.Haskell.TH.Datatype Methods applySubstitution :: Map Name Type -> [a] -> [a] freeVariables :: [a] -> [Name]
From [Word8] ByteString | Uses `pack`.
Instance details Defined in Witch.Instances Methods from :: [Word8] -> ByteString Source #
From [Word8] ByteString | Uses `pack`.
Instance details Defined in Witch.Instances Methods from :: [Word8] -> ByteString Source #
From [Word8] ShortByteString | Uses `pack`.
Instance details Defined in Witch.Instances Methods from :: [Word8] -> ShortByteString Source #
From [Int] IntSet | Uses `fromList`.
Instance details Defined in Witch.Instances Methods from :: [Int] -> IntSet Source #
FoldableWithIndex i f => FoldableWithIndex [i] (Cofree f) |
Instance details Defined in Control.Comonad.Cofree Methods ifoldMap :: Monoid m => ([i] -> a -> m) -> Cofree f a -> m ifoldMap' :: Monoid m => ([i] -> a -> m) -> Cofree f a -> m ifoldr :: ([i] -> a -> b -> b) -> b -> Cofree f a -> b ifoldl :: ([i] -> b -> a -> b) -> b -> Cofree f a -> b ifoldr' :: ([i] -> a -> b -> b) -> b -> Cofree f a -> b ifoldl' :: ([i] -> b -> a -> b) -> b -> Cofree f a -> b
FoldableWithIndex i f => FoldableWithIndex [i] (Free f) |
Instance details Defined in Control.Monad.Free Methods ifoldMap :: Monoid m => ([i] -> a -> m) -> Free f a -> m ifoldMap' :: Monoid m => ([i] -> a -> m) -> Free f a -> m ifoldr :: ([i] -> a -> b -> b) -> b -> Free f a -> b ifoldl :: ([i] -> b -> a -> b) -> b -> Free f a -> b ifoldr' :: ([i] -> a -> b -> b) -> b -> Free f a -> b ifoldl' :: ([i] -> b -> a -> b) -> b -> Free f a -> b
FunctorWithIndex i f => FunctorWithIndex [i] (Cofree f) |
Instance details Defined in Control.Comonad.Cofree Methods imap :: ([i] -> a -> b) -> Cofree f a -> Cofree f b
FunctorWithIndex i f => FunctorWithIndex [i] (Free f) |
Instance details Defined in Control.Monad.Free Methods imap :: ([i] -> a -> b) -> Free f a -> Free f b
TraversableWithIndex i f => TraversableWithIndex [i] (Cofree f) |
Instance details Defined in Control.Comonad.Cofree Methods itraverse :: Applicative f0 => ([i] -> a -> f0 b) -> Cofree f a -> f0 (Cofree f b)
TraversableWithIndex i f => TraversableWithIndex [i] (Free f) |
Instance details Defined in Control.Monad.Free Methods itraverse :: Applicative f0 => ([i] -> a -> f0 b) -> Free f a -> f0 (Free f b)
From (IntMap v) [(Int, v)] | Uses `toAscList`.
Instance details Defined in Witch.Instances Methods from :: IntMap v -> [(Int, v)] Source #
From (Seq a) [a] | Uses `toList`.
Instance details Defined in Witch.Instances Methods from :: Seq a -> [a] Source #
From (Set a) [a] | Uses `toAscList`.
Instance details Defined in Witch.Instances Methods from :: Set a -> [a] Source #
From (NonEmpty a) [a] | Uses `toList`.
Instance details Defined in Witch.Instances Methods from :: NonEmpty a -> [a] Source #
From [(Int, v)] (IntMap v) | Uses `fromList`. If there are duplicate keys, later values will overwrite earlier ones.
Instance details Defined in Witch.Instances Methods from :: [(Int, v)] -> IntMap v Source #
From [a] (Seq a) | Uses `fromList`.
Instance details Defined in Witch.Instances Methods from :: [a] -> Seq a Source #
Ord a => From [a] (Set a) | Uses `fromList`.
Instance details Defined in Witch.Instances Methods from :: [a] -> Set a Source #
TryFrom [a] (NonEmpty a) | Uses `nonEmpty`.
Instance details Defined in Witch.Instances Methods tryFrom :: [a] -> Either (TryFromException [a] (NonEmpty a)) (NonEmpty a) Source #
Ord k => From [(k, v)] (Map k v) | Uses `fromList`. If there are duplicate keys, later values will overwrite earlier ones.
Instance details Defined in Witch.Instances Methods from :: [(k, v)] -> Map k v Source #
Sieve (ReifiedIndexedFold i) (Compose [] ((,) i)) |
Instance details Defined in Control.Lens.Reified Methods sieve :: ReifiedIndexedFold i a b -> a -> Compose [] ((,) i) b
From (Map k v) [(k, v)] | Uses `toAscList`.
Instance details Defined in Witch.Instances Methods from :: Map k v -> [(k, v)] Source #
type Key [] |
Instance details Defined in Data.Key type Key [] = Int
type Diff [] |
Instance details Defined in Linear.Affine type Diff [] = []
type Rep1 [] | Since: base-4.6.0.0

Instance details

Defined in GHC.Internal.Generics

type Rep1 [] = D1 ('MetaData "List" "GHC.Types" "ghc-prim" 'False) (C1 ('MetaCons "[]" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons ":" ('InfixI 'RightAssociative 5) 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 [])))

type Rep [a] | Since: base-4.6.0.0

Instance details

Defined in GHC.Internal.Generics

type Rep [a] = D1 ('MetaData "List" "GHC.Types" "ghc-prim" 'False) (C1 ('MetaCons "[]" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons ":" ('InfixI 'RightAssociative 5) 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [a])))

type Item [a] |
Instance details Defined in GHC.Internal.IsList type Item [a] = a
type Index [a] |
Instance details Defined in Control.Lens.At type Index [a] = Int
type IxValue [a] |
Instance details Defined in Control.Lens.At type IxValue [a] = a

(++) :: [a] -> [a] -> [a] infixr 5 Source #

`(++)` appends two lists, i.e.,

    [x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn]
    [x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]

If the first list is not finite, the result is the first list.

#### Performance considerations

Expand

This function takes linear time in the number of elements of the first list. Thus it is better to associate repeated applications of `(++)` to the right (which is the default behaviour): `xs ++ (ys ++ zs)` or simply `xs ++ ys ++ zs`, but not `(xs ++ ys) ++ zs`. For the same reason `concat` `=` `foldr` `(++)` `[]` has linear performance, while `foldl` `(++)` `[]` is prone to quadratic slowdown

#### Examples

Expand

    >>> [1, 2, 3] ++ [4, 5, 6]
    [1,2,3,4,5,6]

    >>> [] ++ [1, 2, 3]
    [1,2,3]

    >>> [3, 2, 1] ++ []
    [3,2,1]

foldr :: Foldable t => (a -> b -> b) -> b -> t a -> b Source #

Right-associative fold of a structure, lazy in the accumulator.

In the case of lists, `foldr`, when applied to a binary operator, a starting value (typically the right-identity of the operator), and a list, reduces the list using the binary operator, from right to left:

    foldr f z [x1, x2, ..., xn] == x1 `f` (x2 `f` ... (xn `f` z)...)

Note that since the head of the resulting expression is produced by an application of the operator to the first element of the list, given an operator lazy in its right argument, `foldr` can produce a terminating expression from an unbounded list.

For a general `Foldable` structure this should be semantically identical to,

    foldr f z = foldr f z . toList

#### Examples

Expand

Basic usage:

    >>> foldr (||) False [False, True, False]
    True

    >>> foldr (||) False []
    False

    >>> foldr (\c acc -> acc ++ [c]) "foo" ['a', 'b', 'c', 'd']
    "foodcba"

##### Infinite structures

⚠️ Applying `foldr` to infinite structures usually doesn't terminate.

It may still terminate under one of the following conditions:

- the folding function is short-circuiting
- the folding function is lazy on its second argument

###### Short-circuiting

`(`||`)` short-circuits on `True` values, so the following terminates because there is a `True` value finitely far from the left side:

    >>> foldr (||) False (True : repeat False)
    True

But the following doesn't terminate:

    >>> foldr (||) False (repeat False ++ [True])
    * Hangs forever *

###### Laziness in the second argument

Applying `foldr` to infinite structures terminates when the operator is lazy in its second argument (the initial accumulator is never used in this case, and so could be left `undefined`, but `[]` is more clear):

    >>> take 5 $ foldr (\i acc -> i : fmap (+3) acc) [] (repeat 1)
    [1,4,7,10,13]

foldl' :: Foldable t => (b -> a -> b) -> b -> t a -> b Source #

Left-associative fold of a structure but with strict application of the operator.

This ensures that each step of the fold is forced to Weak Head Normal Form before being applied, avoiding the collection of thunks that would otherwise occur. This is often what you want to strictly reduce a finite structure to a single strict result (e.g. `sum`).

For a general `Foldable` structure this should be semantically identical to,

    foldl' f z = foldl' f z . toList

Since: base-4.6.0.0

product :: (Foldable t, Num a) => t a -> a Source #

The `product` function computes the product of the numbers of a structure.

#### Examples

Expand

Basic usage:

    >>> product []
    1

    >>> product [42]
    42

    >>> product [1..10]
    3628800

    >>> product [4.1, 2.0, 1.7]
    13.939999999999998

    >>> product [1..]
    * Hangs forever *

Since: base-4.8.0.0

foldr1 :: Foldable t => (a -> a -> a) -> t a -> a Source #

A variant of `foldr` that has no base case, and thus may only be applied to non-empty structures.

This function is non-total and will raise a runtime exception if the structure happens to be empty.

#### Examples

Expand

Basic usage:

    >>> foldr1 (+) [1..4]
    10

    >>> foldr1 (+) []
    Exception: Prelude.foldr1: empty list

    >>> foldr1 (+) Nothing
    *** Exception: foldr1: empty structure

    >>> foldr1 (-) [1..4]
    -2

    >>> foldr1 (&&) [True, False, True, True]
    False

    >>> foldr1 (||) [False, False, True, True]
    True

    >>> foldr1 (+) [1..]
    * Hangs forever *

maximum :: (Foldable t, Ord a) => t a -> a Source #

The largest element of a non-empty structure.

This function is non-total and will raise a runtime exception if the structure happens to be empty. A structure that supports random access and maintains its elements in order should provide a specialised implementation to return the maximum in faster than linear time.

#### Examples

Expand

Basic usage:

    >>> maximum [1..10]
    10

    >>> maximum []
    *** Exception: Prelude.maximum: empty list

    >>> maximum Nothing
    *** Exception: maximum: empty structure

WARNING: This function is partial for possibly-empty structures like lists.

Since: base-4.8.0.0

minimum :: (Foldable t, Ord a) => t a -> a Source #

The least element of a non-empty structure.

This function is non-total and will raise a runtime exception if the structure happens to be empty. A structure that supports random access and maintains its elements in order should provide a specialised implementation to return the minimum in faster than linear time.

#### Examples

Expand

Basic usage:

    >>> minimum [1..10]
    1

    >>> minimum []
    *** Exception: Prelude.minimum: empty list

    >>> minimum Nothing
    *** Exception: minimum: empty structure

WARNING: This function is partial for possibly-empty structures like lists.

Since: base-4.8.0.0

elem :: (Foldable t, Eq a) => a -> t a -> Bool infix 4 Source #

Does the element occur in the structure?

Note: `elem` is often used in infix form.

#### Examples

Expand

Basic usage:

    >>> 3 `elem` []
    False

    >>> 3 `elem` [1,2]
    False

    >>> 3 `elem` [1,2,3,4,5]
    True

For infinite structures, the default implementation of `elem` terminates if the sought-after value exists at a finite distance from the left side of the structure:

    >>> 3 `elem` [1..]
    True

    >>> 3 `elem` ([4..] ++ [3])
    * Hangs forever *

Since: base-4.8.0.0

map :: (a -> b) -> [a] -> [b] Source #

\(\mathcal{O}(n)\). `map` `f xs` is the list obtained by applying `f` to each element of `xs`, i.e.,

    map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
    map f [x1, x2, ...] == [f x1, f x2, ...]

this means that `map id == id`

#### Examples

Expand

    >>> map (+1) [1, 2, 3]
    [2,3,4]

    >>> map id [1, 2, 3]
    [1,2,3]

    >>> map (\n -> 3 * n + 1) [1, 2, 3]
    [4,7,10]

(!?) :: [a] -> Int -> Maybe a infixl 9 Source #

List index (subscript) operator, starting from 0. Returns `Nothing` if the index is out of bounds

This is the total variant of the partial `!!` operator.

WARNING: This function takes linear time in the index.

#### Examples

Expand

    >>> ['a', 'b', 'c'] !? 0
    Just 'a'

    >>> ['a', 'b', 'c'] !? 2
    Just 'c'

    >>> ['a', 'b', 'c'] !? 3
    Nothing

    >>> ['a', 'b', 'c'] !? (-1)
    Nothing

all :: Foldable t => (a -> Bool) -> t a -> Bool Source #

Determines whether all elements of the structure satisfy the predicate.

#### Examples

Expand

Basic usage:

    >>> all (> 3) []
    True

    >>> all (> 3) [1,2]
    False

    >>> all (> 3) [1,2,3,4,5]
    False

    >>> all (> 3) [1..]
    False

    >>> all (> 3) [4..]
    * Hangs forever *

unfoldr :: (b -> Maybe (a, b)) -> b -> [a] Source #

The `unfoldr` function is a `dual' to `foldr`: while `foldr` reduces a list to a summary value, `unfoldr` builds a list from a seed value. The function takes the element and returns `Nothing` if it is done producing the list or returns `Just` `(a,b)`, in which case, `a` is a prepended to the list and `b` is used as the next element in a recursive call. For example,

    iterate f == unfoldr (\x -> Just (x, f x))

In some cases, `unfoldr` can undo a `foldr` operation:

    unfoldr f' (foldr f z xs) == xs

if the following holds:

    f' (f x y) = Just (x,y)
    f' z       = Nothing

#### Laziness

Expand

    >>> take 1 (unfoldr (\x -> Just (x, undefined)) 'a')
    "a"

#### Examples

Expand

    >>> unfoldr (\b -> if b == 0 then Nothing else Just (b, b-1)) 10
    [10,9,8,7,6,5,4,3,2,1]

    >>> take 10 $ unfoldr (\(x, y) -> Just (x, (y, x + y))) (0, 1)
    [0,1,1,2,3,5,8,13,21,54]

sortOn :: Ord b => (a -> b) -> [a] -> [a] Source #

Sort a list by comparing the results of a key function applied to each element. ``sortOn` f` is equivalent to ``sortBy` (`comparing` f)`, but has the performance advantage of only evaluating `f` once for each element in the input list. This is called the decorate-sort-undecorate paradigm, or Schwartzian transform.

Elements are arranged from lowest to highest, keeping duplicates in the order they appeared in the input.

The argument must be finite.

#### Examples

Expand

    >>> sortOn fst [(2, "world"), (4, "!"), (1, "Hello")]
    [(1,"Hello"),(2,"world"),(4,"!")]

    >>> sortOn length ["jim", "creed", "pam", "michael", "dwight", "kevin"]
    ["jim","pam","creed","kevin","dwight","michael"]

#### Performance notes

Expand

This function minimises the projections performed, by materialising the projections in an intermediate list.

For trivial projections, you should prefer using `sortBy` with `comparing`, for example:

    >>> sortBy (comparing fst) [(3, 1), (2, 2), (1, 3)]
    [(1,3),(2,2),(3,1)]

Or, for the exact same API as `sortOn`, you can use `sortBy . comparing`:

    >>> (sortBy . comparing) fst [(3, 1), (2, 2), (1, 3)]
    [(1,3),(2,2),(3,1)]

Since: base-4.8.0.0

transpose :: [[a]] -> [[a]] Source #

The `transpose` function transposes the rows and columns of its argument.

#### Laziness

Expand

`transpose` is lazy in its elements

    >>> take 1 (transpose ['a' : undefined, 'b' : undefined])
    ["ab"]

#### Examples

Expand

    >>> transpose [[1,2,3],[4,5,6]]
    [[1,4],[2,5],[3,6]]

If some of the rows are shorter than the following rows, their elements are skipped:

    >>> transpose [[10,11],[20],[],[30,31,32]]
    [[10,20,30],[11,31],[32]]

For this reason the outer list must be finite; otherwise `transpose` hangs:

    >>> transpose (repeat [])
    * Hangs forever *

sortBy :: (a -> a -> Ordering) -> [a] -> [a] Source #

The `sortBy` function is the non-overloaded version of `sort`. The argument must be finite.

The supplied comparison relation is supposed to be reflexive and antisymmetric, otherwise, e. g., for `_ _ -> GT`, the ordered list simply does not exist. The relation is also expected to be transitive: if it is not then `sortBy` might fail to find an ordered permutation, even if it exists.

#### Examples

Expand

    >>> sortBy (\(a,_) (b,_) -> compare a b) [(2, "world"), (4, "!"), (1, "Hello")]
    [(1,"Hello"),(2,"world"),(4,"!")]

cycle :: HasCallStack => [a] -> [a] Source #

`cycle` ties a finite list into a circular one, or equivalently, the infinite repetition of the original list. It is the identity on infinite lists.

#### Examples

Expand

    >>> cycle []
    *** Exception: Prelude.cycle: empty list

    >>> take 10 (cycle [42])
    [42,42,42,42,42,42,42,42,42,42]

    >>> take 10 (cycle [2, 5, 7])
    [2,5,7,2,5,7,2,5,7,2]

    >>> take 1 (cycle (42 : undefined))
    [42]

concat :: Foldable t => t [a] -> [a] Source #

The concatenation of all the elements of a container of lists.

#### Examples

Expand

Basic usage:

    >>> concat (Just [1, 2, 3])
    [1,2,3]

    >>> concat (Left 42)
    []

    >>> concat [[1, 2, 3], [4, 5], [6], []]
    [1,2,3,4,5,6]

filter :: (a -> Bool) -> [a] -> [a] Source #

\(\mathcal{O}(n)\). `filter`, applied to a predicate and a list, returns the list of those elements that satisfy the predicate; i.e.,

    filter p xs = [ x | x <- xs, p x]

#### Examples

Expand

    >>> filter odd [1, 2, 3]
    [1,3]

    >>> filter (\l -> length l > 3) ["Hello", ", ", "World", "!"]
    ["Hello","World"]

    >>> filter (/= 3) [1, 2, 3, 4, 3, 2, 1]
    [1,2,4,2,1]

zip :: [a] -> [b] -> [(a, b)] Source #

\(\mathcal{O}(\min(m,n))\). `zip` takes two lists and returns a list of corresponding pairs.

`zip` is right-lazy:

    >>> zip [] undefined
    []
    >>> zip undefined []
    *** Exception: Prelude.undefined
    ...

`zip` is capable of list fusion, but it is restricted to its first list argument and its resulting list.

#### Examples

Expand

    >>> zip [1, 2, 3] ['a', 'b', 'c']
    [(1,'a'),(2,'b'),(3,'c')]

If one input list is shorter than the other, excess elements of the longer list are discarded, even if one of the lists is infinite:

    >>> zip [1] ['a', 'b']
    [(1,'a')]

    >>> zip [1, 2] ['a']
    [(1,'a')]

    >>> zip [] [1..]
    []

    >>> zip [1..] []
    []

head :: HasCallStack => [a] -> a Source #

\(\mathcal{O}(1)\). Extract the first element of a list, which must be non-empty.

To disable the warning about partiality put `{-# OPTIONS_GHC -Wno-x-partial -Wno-unrecognised-warning-flags #-}` at the top of the file. To disable it throughout a package put the same options into `ghc-options` section of Cabal file. To disable it in GHCi put `:set -Wno-x-partial -Wno-unrecognised-warning-flags` into `~/.ghci` config file. See also the migration guide.

##### Examples

Expand

    >>> head [1, 2, 3]
    1

    >>> head [1..]
    1

    >>> head []
    *** Exception: Prelude.head: empty list

uncons :: [a] -> Maybe (a, [a]) Source #

\(\mathcal{O}(1)\). Decompose a list into its `head` and `tail`.

- If the list is empty, returns `Nothing`.
- If the list is non-empty, returns ``Just` (x, xs)`, where `x` is the `head` of the list and `xs` its `tail`.

#### Examples

Expand

    >>> uncons []
    Nothing

    >>> uncons [1]
    Just (1,[])

    >>> uncons [1, 2, 3]
    Just (1,[2,3])

Since: base-4.8.0.0

unsnoc :: [a] -> Maybe ([a], a) Source #

\(\mathcal{O}(n)\). Decompose a list into `init` and `last`.

- If the list is empty, returns `Nothing`.
- If the list is non-empty, returns ``Just` (xs, x)`, where `xs` is the `init`ial part of the list and `x` is its `last` element.

`unsnoc` is dual to `uncons`: for a finite list `xs`

    unsnoc xs = (\(hd, tl) -> (reverse tl, hd)) <$> uncons (reverse xs)

#### Examples

Expand

    >>> unsnoc []
    Nothing

    >>> unsnoc [1]
    Just ([],1)

    >>> unsnoc [1, 2, 3]
    Just ([1,2],3)

#### Laziness

Expand

    >>> fst <$> unsnoc [undefined]
    Just []

    >>> head . fst <$> unsnoc (1 : undefined)
    Just *** Exception: Prelude.undefined

    >>> head . fst <$> unsnoc (1 : 2 : undefined)
    Just 1

Since: base-4.19.0.0

tail :: HasCallStack => [a] -> [a] Source #

\(\mathcal{O}(1)\). Extract the elements after the head of a list, which must be non-empty.

To disable the warning about partiality put `{-# OPTIONS_GHC -Wno-x-partial -Wno-unrecognised-warning-flags #-}` at the top of the file. To disable it throughout a package put the same options into `ghc-options` section of Cabal file. To disable it in GHCi put `:set -Wno-x-partial -Wno-unrecognised-warning-flags` into `~/.ghci` config file. See also the migration guide.

#### Examples

Expand

    >>> tail [1, 2, 3]
    [2,3]

    >>> tail [1]
    []

    >>> tail []
    *** Exception: Prelude.tail: empty list

last :: HasCallStack => [a] -> a Source #

\(\mathcal{O}(n)\). Extract the last element of a list, which must be finite and non-empty.

WARNING: This function is partial. Consider using `unsnoc` instead.

#### Examples

Expand

    >>> last [1, 2, 3]
    3

    >>> last [1..]
    * Hangs forever *

    >>> last []
    *** Exception: Prelude.last: empty list

init :: HasCallStack => [a] -> [a] Source #

\(\mathcal{O}(n)\). Return all the elements of a list except the last one. The list must be non-empty.

WARNING: This function is partial. Consider using `unsnoc` instead.

#### Examples

Expand

    >>> init [1, 2, 3]
    [1,2]

    >>> init [1]
    []

    >>> init []
    *** Exception: Prelude.init: empty list

foldl1' :: HasCallStack => (a -> a -> a) -> [a] -> a Source #

A strict version of `foldl1`.

scanl :: (b -> a -> b) -> b -> [a] -> [b] Source #

\(\mathcal{O}(n)\). `scanl` is similar to `foldl`, but returns a list of successive reduced values from the left:

    scanl f z [x1, x2, ...] == [z, z `f` x1, (z `f` x1) `f` x2, ...]

Note that

    last (scanl f z xs) == foldl f z xs

#### Examples

Expand

    >>> scanl (+) 0 [1..4]
    [0,1,3,6,10]

    >>> scanl (+) 42 []
    [42]

    >>> scanl (-) 100 [1..4]
    [100,99,97,94,90]

    >>> scanl (\reversedString nextChar -> nextChar : reversedString) "foo" ['a', 'b', 'c', 'd']
    ["foo","afoo","bafoo","cbafoo","dcbafoo"]

    >>> take 10 (scanl (+) 0 [1..])
    [0,1,3,6,10,15,21,28,36,45]

    >>> take 1 (scanl undefined 'a' undefined)
    "a"

scanl1 :: (a -> a -> a) -> [a] -> [a] Source #

\(\mathcal{O}(n)\). `scanl1` is a variant of `scanl` that has no starting value argument:

    scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]

#### Examples

Expand

    >>> scanl1 (+) [1..4]
    [1,3,6,10]

    >>> scanl1 (+) []
    []

    >>> scanl1 (-) [1..4]
    [1,-1,-4,-8]

    >>> scanl1 (&&) [True, False, True, True]
    [True,False,False,False]

    >>> scanl1 (||) [False, False, True, True]
    [False,False,True,True]

    >>> take 10 (scanl1 (+) [1..])
    [1,3,6,10,15,21,28,36,45,55]

    >>> take 1 (scanl1 undefined ('a' : undefined))
    "a"

scanl' :: (b -> a -> b) -> b -> [a] -> [b] Source #

\(\mathcal{O}(n)\). A strict version of `scanl`.

scanr :: (a -> b -> b) -> b -> [a] -> [b] Source #

\(\mathcal{O}(n)\). `scanr` is the right-to-left dual of `scanl`. Note that the order of parameters on the accumulating function are reversed compared to `scanl`. Also note that

    head (scanr f z xs) == foldr f z xs.

#### Examples

Expand

    >>> scanr (+) 0 [1..4]
    [10,9,7,4,0]

    >>> scanr (+) 42 []
    [42]

    >>> scanr (-) 100 [1..4]
    [98,-97,99,-96,100]

    >>> scanr (\nextChar reversedString -> nextChar : reversedString) "foo" ['a', 'b', 'c', 'd']
    ["abcdfoo","bcdfoo","cdfoo","dfoo","foo"]

    >>> force $ scanr (+) 0 [1..]
    *** Exception: stack overflow

scanr1 :: (a -> a -> a) -> [a] -> [a] Source #

\(\mathcal{O}(n)\). `scanr1` is a variant of `scanr` that has no starting value argument.

#### Examples

Expand

    >>> scanr1 (+) [1..4]
    [10,9,7,4]

    >>> scanr1 (+) []
    []

    >>> scanr1 (-) [1..4]
    [-2,3,-1,4]

    >>> scanr1 (&&) [True, False, True, True]
    [False,False,True,True]

    >>> scanr1 (||) [True, True, False, False]
    [True,True,False,False]

    >>> force $ scanr1 (+) [1..]
    *** Exception: stack overflow

iterate :: (a -> a) -> a -> [a] Source #

`iterate` `f x` returns an infinite list of repeated applications of `f` to `x`:

    iterate f x == [x, f x, f (f x), ...]

#### Laziness

Expand

Note that `iterate` is lazy, potentially leading to thunk build-up if the consumer doesn't force each iterate. See `iterate'` for a strict variant of this function.

    >>> take 1 $ iterate undefined 42
    [42]

#### Examples

Expand

    >>> take 10 $ iterate not True
    [True,False,True,False,True,False,True,False,True,False]

    >>> take 10 $ iterate (+3) 42
    [42,45,48,51,54,57,60,63,66,69]

`iterate id == `repeat``:

    >>> take 10 $ iterate id 1
    [1,1,1,1,1,1,1,1,1,1]

iterate' :: (a -> a) -> a -> [a] Source #

`iterate'` is the strict version of `iterate`.

It forces the result of each application of the function to weak head normal form (WHNF) before proceeding.

    >>> take 1 $ iterate' undefined 42
    *** Exception: Prelude.undefined

repeat :: a -> [a] Source #

`repeat` `x` is an infinite list, with `x` the value of every element.

#### Examples

Expand

    >>> take 10 $ repeat 17
    [17,17,17,17,17,17,17,17,17, 17]

    >>> repeat undefined
    [*** Exception: Prelude.undefined

replicate :: Int -> a -> [a] Source #

`replicate` `n x` is a list of length `n` with `x` the value of every element. It is an instance of the more general `genericReplicate`, in which `n` may be of any integral type.

#### Examples

Expand

    >>> replicate 0 True
    []

    >>> replicate (-1) True
    []

    >>> replicate 4 True
    [True,True,True,True]

takeWhile :: (a -> Bool) -> [a] -> [a] Source #

`takeWhile`, applied to a predicate `p` and a list `xs`, returns the longest prefix (possibly empty) of `xs` of elements that satisfy `p`.

#### Laziness

Expand

    >>> takeWhile (const False) undefined
    *** Exception: Prelude.undefined

    >>> takeWhile (const False) (undefined : undefined)
    []

    >>> take 1 (takeWhile (const True) (1 : undefined))
    [1]

#### Examples

Expand

    >>> takeWhile (< 3) [1,2,3,4,1,2,3,4]
    [1,2]

    >>> takeWhile (< 9) [1,2,3]
    [1,2,3]

    >>> takeWhile (< 0) [1,2,3]
    []

dropWhile :: (a -> Bool) -> [a] -> [a] Source #

`dropWhile` `p xs` returns the suffix remaining after `takeWhile` `p xs`.

#### Examples

Expand

    >>> dropWhile (< 3) [1,2,3,4,5,1,2,3]
    [3,4,5,1,2,3]

    >>> dropWhile (< 9) [1,2,3]
    []

    >>> dropWhile (< 0) [1,2,3]
    [1,2,3]

take :: Int -> [a] -> [a] Source #

`take` `n`, applied to a list `xs`, returns the prefix of `xs` of length `n`, or `xs` itself if `n >= `length` xs`.

It is an instance of the more general `genericTake`, in which `n` may be of any integral type.

#### Laziness

Expand

    >>> take 0 undefined
    []
    >>> take 2 (1 : 2 : undefined)
    [1,2]

#### Examples

Expand

    >>> take 5 "Hello World!"
    "Hello"

    >>> take 3 [1,2,3,4,5]
    [1,2,3]

    >>> take 3 [1,2]
    [1,2]

    >>> take 3 []
    []

    >>> take (-1) [1,2]
    []

    >>> take 0 [1,2]
    []

drop :: Int -> [a] -> [a] Source #

`drop` `n xs` returns the suffix of `xs` after the first `n` elements, or `[]` if `n >= `length` xs`.

It is an instance of the more general `genericDrop`, in which `n` may be of any integral type.

#### Examples

Expand

    >>> drop 6 "Hello World!"
    "World!"

    >>> drop 3 [1,2,3,4,5]
    [4,5]

    >>> drop 3 [1,2]
    []

    >>> drop 3 []
    []

    >>> drop (-1) [1,2]
    [1,2]

    >>> drop 0 [1,2]
    [1,2]

splitAt :: Int -> [a] -> ([a], [a]) Source #

`splitAt` `n xs` returns a tuple where first element is `xs` prefix of length `n` and second element is the remainder of the list:

`splitAt` is an instance of the more general `genericSplitAt`, in which `n` may be of any integral type.

#### Laziness

Expand

It is equivalent to `(`take` n xs, `drop` n xs)` unless `n` is `_|_`: `splitAt _|_ xs = _|_`, not `(_|_, _|_)`).

The first component of the tuple is produced lazily:

    >>> fst (splitAt 0 undefined)
    []

    >>> take 1 (fst (splitAt 10 (1 : undefined)))
    [1]

#### Examples

Expand

    >>> splitAt 6 "Hello World!"
    ("Hello ","World!")

    >>> splitAt 3 [1,2,3,4,5]
    ([1,2,3],[4,5])

    >>> splitAt 1 [1,2,3]
    ([1],[2,3])

    >>> splitAt 3 [1,2,3]
    ([1,2,3],[])

    >>> splitAt 4 [1,2,3]
    ([1,2,3],[])

    >>> splitAt 0 [1,2,3]
    ([],[1,2,3])

    >>> splitAt (-1) [1,2,3]
    ([],[1,2,3])

span :: (a -> Bool) -> [a] -> ([a], [a]) Source #

`span`, applied to a predicate `p` and a list `xs`, returns a tuple where first element is the longest prefix (possibly empty) of `xs` of elements that satisfy `p` and second element is the remainder of the list:

`span` `p xs` is equivalent to `(`takeWhile` p xs, `dropWhile` p xs)`, even if `p` is `_|_`.

#### Laziness

Expand

    >>> span undefined []
    ([],[])
    >>> fst (span (const False) undefined)
    *** Exception: Prelude.undefined
    >>> fst (span (const False) (undefined : undefined))
    []
    >>> take 1 (fst (span (const True) (1 : undefined)))
    [1]

`span` produces the first component of the tuple lazily:

    >>> take 10 (fst (span (const True) [1..]))
    [1,2,3,4,5,6,7,8,9,10]

#### Examples

Expand

    >>> span (< 3) [1,2,3,4,1,2,3,4]
    ([1,2],[3,4,1,2,3,4])

    >>> span (< 9) [1,2,3]
    ([1,2,3],[])

    >>> span (< 0) [1,2,3]
    ([],[1,2,3])

break :: (a -> Bool) -> [a] -> ([a], [a]) Source #

`break`, applied to a predicate `p` and a list `xs`, returns a tuple where first element is longest prefix (possibly empty) of `xs` of elements that do not satisfy `p` and second element is the remainder of the list:

`break` `p` is equivalent to ``span` (`not` . p)` and consequently to `(`takeWhile` (`not` . p) xs, `dropWhile` (`not` . p) xs)`, even if `p` is `_|_`.

#### Laziness

Expand

    >>> break undefined []
    ([],[])

    >>> fst (break (const True) undefined)
    *** Exception: Prelude.undefined

    >>> fst (break (const True) (undefined : undefined))
    []

    >>> take 1 (fst (break (const False) (1 : undefined)))
    [1]

`break` produces the first component of the tuple lazily:

    >>> take 10 (fst (break (const False) [1..]))
    [1,2,3,4,5,6,7,8,9,10]

#### Examples

Expand

    >>> break (> 3) [1,2,3,4,1,2,3,4]
    ([1,2,3],[4,1,2,3,4])

    >>> break (< 9) [1,2,3]
    ([],[1,2,3])

    >>> break (> 9) [1,2,3]
    ([1,2,3],[])

reverse :: [a] -> [a] Source #

\(\mathcal{O}(n)\). `reverse` `xs` returns the elements of `xs` in reverse order. `xs` must be finite.

#### Laziness

Expand

`reverse` is lazy in its elements.

    >>> head (reverse [undefined, 1])
    1

    >>> reverse (1 : 2 : undefined)
    *** Exception: Prelude.undefined

#### Examples

Expand

    >>> reverse []
    []

    >>> reverse [42]
    [42]

    >>> reverse [2,5,7]
    [7,5,2]

    >>> reverse [1..]
    * Hangs forever *

and :: Foldable t => t Bool -> Bool Source #

`and` returns the conjunction of a container of Bools. For the result to be `True`, the container must be finite; `False`, however, results from a `False` value finitely far from the left end.

#### Examples

Expand

Basic usage:

    >>> and []
    True

    >>> and [True]
    True

    >>> and [False]
    False

    >>> and [True, True, False]
    False

    >>> and (False : repeat True) -- Infinite list [False,True,True,True,...
    False

    >>> and (repeat True)
    * Hangs forever *

or :: Foldable t => t Bool -> Bool Source #

`or` returns the disjunction of a container of Bools. For the result to be `False`, the container must be finite; `True`, however, results from a `True` value finitely far from the left end.

#### Examples

Expand

Basic usage:

    >>> or []
    False

    >>> or [True]
    True

    >>> or [False]
    False

    >>> or [True, True, False]
    True

    >>> or (True : repeat False) -- Infinite list [True,False,False,False,...
    True

    >>> or (repeat False)
    * Hangs forever *

any :: Foldable t => (a -> Bool) -> t a -> Bool Source #

Determines whether any element of the structure satisfies the predicate.

#### Examples

Expand

Basic usage:

    >>> any (> 3) []
    False

    >>> any (> 3) [1,2]
    False

    >>> any (> 3) [1,2,3,4,5]
    True

    >>> any (> 3) [1..]
    True

    >>> any (> 3) [0, -1..]
    * Hangs forever *

notElem :: (Foldable t, Eq a) => a -> t a -> Bool infix 4 Source #

`notElem` is the negation of `elem`.

#### Examples

Expand

Basic usage:

    >>> 3 `notElem` []
    True

    >>> 3 `notElem` [1,2]
    True

    >>> 3 `notElem` [1,2,3,4,5]
    False

For infinite structures, `notElem` terminates if the value exists at a finite distance from the left side of the structure:

    >>> 3 `notElem` [1..]
    False

    >>> 3 `notElem` ([4..] ++ [3])
    * Hangs forever *

lookup :: Eq a => a -> [(a, b)] -> Maybe b Source #

\(\mathcal{O}(n)\). `lookup` `key assocs` looks up a key in an association list. For the result to be `Nothing`, the list must be finite.

#### Examples

Expand

    >>> lookup 2 []
    Nothing

    >>> lookup 2 [(1, "first")]
    Nothing

    >>> lookup 2 [(1, "first"), (2, "second"), (3, "third")]
    Just "second"

concatMap :: Foldable t => (a -> [b]) -> t a -> [b] Source #

Map a function over all the elements of a container and concatenate the resulting lists.

#### Examples

Expand

Basic usage:

    >>> concatMap (take 3) [[1..], [10..], [100..], [1000..]]
    [1,2,3,10,11,12,100,101,102,1000,1001,1002]

    >>> concatMap (take 3) (Just [1..])
    [1,2,3]

(!!) :: HasCallStack => [a] -> Int -> a infixl 9 Source #

List index (subscript) operator, starting from 0. It is an instance of the more general `genericIndex`, which takes an index of any integral type.

WARNING: This function is partial, and should only be used if you are sure that the indexing will not fail. Otherwise, use `!?`.

WARNING: This function takes linear time in the index.

#### Examples

Expand

    >>> ['a', 'b', 'c'] !! 0
    'a'

    >>> ['a', 'b', 'c'] !! 2
    'c'

    >>> ['a', 'b', 'c'] !! 3
    *** Exception: Prelude.!!: index too large

    >>> ['a', 'b', 'c'] !! (-1)
    *** Exception: Prelude.!!: negative index

zip3 :: [a] -> [b] -> [c] -> [(a, b, c)] Source #

`zip3` takes three lists and returns a list of triples, analogous to `zip`. It is capable of list fusion, but it is restricted to its first list argument and its resulting list.

zipWith :: (a -> b -> c) -> [a] -> [b] -> [c] Source #

\(\mathcal{O}(\min(m,n))\). `zipWith` generalises `zip` by zipping with the function given as the first argument, instead of a tupling function.

    zipWith (,) xs ys == zip xs ys
    zipWith f [x1,x2,x3..] [y1,y2,y3..] == [f x1 y1, f x2 y2, f x3 y3..]

`zipWith` is right-lazy:

    >>> let f = undefined
    >>> zipWith f [] undefined
    []

`zipWith` is capable of list fusion, but it is restricted to its first list argument and its resulting list.

#### Examples

Expand

``zipWith` `(+)`` can be applied to two lists to produce the list of corresponding sums:

    >>> zipWith (+) [1, 2, 3] [4, 5, 6]
    [5,7,9]

    >>> zipWith (++) ["hello ", "foo"] ["world!", "bar"]
    ["hello world!","foobar"]

zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d] Source #

\(\mathcal{O}(\min(l,m,n))\). The `zipWith3` function takes a function which combines three elements, as well as three lists and returns a list of the function applied to corresponding elements, analogous to `zipWith`. It is capable of list fusion, but it is restricted to its first list argument and its resulting list.

    zipWith3 (,,) xs ys zs == zip3 xs ys zs
    zipWith3 f [x1,x2,x3..] [y1,y2,y3..] [z1,z2,z3..] == [f x1 y1 z1, f x2 y2 z2, f x3 y3 z3..]

#### Examples

Expand

    >>> zipWith3 (\x y z -> [x, y, z]) "123" "abc" "xyz"
    ["1ax","2by","3cz"]

    >>> zipWith3 (\x y z -> (x * y) + z) [1, 2, 3] [4, 5, 6] [7, 8, 9]
    [11,18,27]

unzip :: [(a, b)] -> ([a], [b]) Source #

`unzip` transforms a list of pairs into a list of first components and a list of second components.

#### Examples

Expand

    >>> unzip []
    ([],[])

    >>> unzip [(1, 'a'), (2, 'b')]
    ([1,2],"ab")

unzip3 :: [(a, b, c)] -> ([a], [b], [c]) Source #

The `unzip3` function takes a list of triples and returns three lists of the respective components, analogous to `unzip`.

#### Examples

Expand

    >>> unzip3 []
    ([],[],[])

    >>> unzip3 [(1, 'a', True), (2, 'b', False)]
    ([1,2],"ab",[True,False])

maximumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a Source #

The largest element of a non-empty structure with respect to the given comparison function.

#### Examples

Expand

Basic usage:

    >>> maximumBy (compare `on` length) ["Hello", "World", "!", "Longest", "bar"]
    "Longest"

WARNING: This function is partial for possibly-empty structures like lists.

minimumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a Source #

The least element of a non-empty structure with respect to the given comparison function.

#### Examples

Expand

Basic usage:

    >>> minimumBy (compare `on` length) ["Hello", "World", "!", "Longest", "bar"]
    "!"

WARNING: This function is partial for possibly-empty structures like lists.

find :: Foldable t => (a -> Bool) -> t a -> Maybe a Source #

The `find` function takes a predicate and a structure and returns the leftmost element of the structure matching the predicate, or `Nothing` if there is no such element.

#### Examples

Expand

Basic usage:

    >>> find (> 42) [0, 5..]
    Just 45

    >>> find (> 12) [1..7]
    Nothing

dropWhileEnd :: (a -> Bool) -> [a] -> [a] Source #

The `dropWhileEnd` function drops the largest suffix of a list in which the given predicate holds for all elements.

#### Laziness

Expand

This function is lazy in spine, but strict in elements, which makes it different from `reverse` `.` `dropWhile` `p` `.` `reverse`, which is strict in spine, but lazy in elements. For instance:

    >>> take 1 (dropWhileEnd (< 0) (1 : undefined))
    [1]

    >>> take 1 (reverse $ dropWhile (< 0) $ reverse (1 : undefined))
    *** Exception: Prelude.undefined

but on the other hand

    >>> last (dropWhileEnd (< 0) [undefined, 1])
    *** Exception: Prelude.undefined

    >>> last (reverse $ dropWhile (< 0) $ reverse [undefined, 1])
    1

#### Examples

Expand

    >>> dropWhileEnd isSpace "foo\n"
    "foo"

    >>> dropWhileEnd isSpace "foo bar"
    "foo bar"
    >>> dropWhileEnd (> 10) [1..20]
    [1,2,3,4,5,6,7,8,9,10]

Since: base-4.5.0.0

stripPrefix :: Eq a => [a] -> [a] -> Maybe [a] Source #

\(\mathcal{O}(\min(m,n))\). The `stripPrefix` function drops the given prefix from a list. It returns `Nothing` if the list did not start with the prefix given, or `Just` the list after the prefix, if it does.

##### Examples

Expand

    >>> stripPrefix "foo" "foobar"
    Just "bar"

    >>> stripPrefix "foo" "foo"
    Just ""

    >>> stripPrefix "foo" "barfoo"
    Nothing

    >>> stripPrefix "foo" "barfoobaz"
    Nothing

elemIndex :: Eq a => a -> [a] -> Maybe Int Source #

The `elemIndex` function returns the index of the first element in the given list which is equal (by `==`) to the query element, or `Nothing` if there is no such element. For the result to be `Nothing`, the list must be finite.

#### Examples

Expand

    >>> elemIndex 4 [0..]
    Just 4

    >>> elemIndex 'o' "haskell"
    Nothing

    >>> elemIndex 0 [1..]
    * hangs forever *

elemIndices :: Eq a => a -> [a] -> [Int] Source #

The `elemIndices` function extends `elemIndex`, by returning the indices of all elements equal to the query element, in ascending order.

#### Examples

Expand

    >>> elemIndices 'o' "Hello World"
    [4,7]

    >>> elemIndices 1 [1, 2, 3, 1, 2, 3]
    [0,3]

findIndex :: (a -> Bool) -> [a] -> Maybe Int Source #

The `findIndex` function takes a predicate and a list and returns the index of the first element in the list satisfying the predicate, or `Nothing` if there is no such element. For the result to be `Nothing`, the list must be finite.

#### Examples

Expand

    >>> findIndex isSpace "Hello World!"
    Just 5

    >>> findIndex odd [0, 2, 4, 6]
    Nothing

    >>> findIndex even [1..]
    Just 1

    >>> findIndex odd [0, 2 ..]
    * hangs forever *

findIndices :: (a -> Bool) -> [a] -> [Int] Source #

The `findIndices` function extends `findIndex`, by returning the indices of all elements satisfying the predicate, in ascending order.

#### Examples

Expand

    >>> findIndices (`elem` "aeiou") "Hello World!"
    [1,4,7]

    >>> findIndices (\l -> length l > 3) ["a", "bcde", "fgh", "ijklmnop"]
    [1,3]

isPrefixOf :: Eq a => [a] -> [a] -> Bool Source #

\(\mathcal{O}(\min(m,n))\). The `isPrefixOf` function takes two lists and returns `True` iff the first list is a prefix of the second.

#### Examples

Expand

    >>> "Hello" `isPrefixOf` "Hello World!"
    True

    >>> "Hello" `isPrefixOf` "Wello Horld!"
    False

For the result to be `True`, the first list must be finite; `False`, however, results from any mismatch:

    >>> [0..] `isPrefixOf` [1..]
    False

    >>> [0..] `isPrefixOf` [0..99]
    False

    >>> [0..99] `isPrefixOf` [0..]
    True

    >>> [0..] `isPrefixOf` [0..]
    * Hangs forever *

`isPrefixOf` shortcuts when the first argument is empty:

    >>> isPrefixOf [] undefined
    True

isSuffixOf :: Eq a => [a] -> [a] -> Bool Source #

The `isSuffixOf` function takes two lists and returns `True` iff the first list is a suffix of the second.

#### Examples

Expand

    >>> "ld!" `isSuffixOf` "Hello World!"
    True

    >>> "World" `isSuffixOf` "Hello World!"
    False

The second list must be finite; however the first list may be infinite:

    >>> [0..] `isSuffixOf` [0..99]
    False

    >>> [0..99] `isSuffixOf` [0..]
    * Hangs forever *

isInfixOf :: Eq a => [a] -> [a] -> Bool Source #

The `isInfixOf` function takes two lists and returns `True` iff the first list is contained, wholly and intact, anywhere within the second.

#### Examples

Expand

    >>> isInfixOf "Haskell" "I really like Haskell."
    True

    >>> isInfixOf "Ial" "I really like Haskell."
    False

For the result to be `True`, the first list must be finite; for the result to be `False`, the second list must be finite:

    >>> [20..50] `isInfixOf` [0..]
    True

    >>> [0..] `isInfixOf` [20..50]
    False

    >>> [0..] `isInfixOf` [0..]
    * Hangs forever *

nub :: Eq a => [a] -> [a] Source #

\(\mathcal{O}(n^2)\). The `nub` function removes duplicate elements from a list. In particular, it keeps only the first occurrence of each element. (The name `nub` means `essence'.) It is a special case of `nubBy`, which allows the programmer to supply their own equality test.

If there exists `instance Ord a`, it's faster to use `nubOrd` from the `containers` package (link to the latest online documentation), which takes only \(\mathcal{O}(n \log d)\) time where `d` is the number of distinct elements in the list.

Another approach to speed up `nub` is to use `map` `Data.List.NonEmpty.``head` . `Data.List.NonEmpty.``group` . `sort`, which takes \(\mathcal{O}(n \log n)\) time, requires `instance Ord a` and doesn't preserve the order.

#### Examples

Expand

    >>> nub [1,2,3,4,3,2,1,2,4,3,5]
    [1,2,3,4,5]

    >>> nub "hello, world!"
    "helo, wrd!"

nubBy :: (a -> a -> Bool) -> [a] -> [a] Source #

The `nubBy` function behaves just like `nub`, except it uses a user-supplied equality predicate instead of the overloaded `(==)` function.

#### Examples

Expand

    >>> nubBy (\x y -> mod x 3 == mod y 3) [1,2,4,5,6]
    [1,2,6]

    >>> nubBy (/=) [2, 7, 1, 8, 2, 8, 1, 8, 2, 8]
    [2,2,2]

    >>> nubBy (>) [1, 2, 3, 2, 1, 5, 4, 5, 3, 2]
    [1,2,3,5,5]

deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a] Source #

\(\mathcal{O}(n)\). The `deleteBy` function behaves like `delete`, but takes a user-supplied equality predicate.

#### Examples

Expand

    >>> deleteBy (<=) 4 [1..10]
    [1,2,3,5,6,7,8,9,10]

    >>> deleteBy (/=) 5 [5, 5, 4, 3, 5, 2]
    [5,5,3,5,2]

(\\) :: Eq a => [a] -> [a] -> [a] infix 5 Source #

The `\\` function is list difference (non-associative). In the result of `xs` `\\` `ys`, the first occurrence of each element of `ys` in turn (if any) has been removed from `xs`. Thus `(xs ++ ys) \\ xs == ys`.

It is a special case of `deleteFirstsBy`, which allows the programmer to supply their own equality test.

#### Examples

Expand

    >>> "Hello World!" \\ "ell W"
    "Hoorld!"

The second list must be finite, but the first may be infinite.

    >>> take 5 ([0..] \\ [2..4])
    [0,1,5,6,7]

    >>> take 5 ([0..] \\ [2..])
    * Hangs forever *

union :: Eq a => [a] -> [a] -> [a] Source #

The `union` function returns the list union of the two lists. It is a special case of `unionBy`, which allows the programmer to supply their own equality test.

#### Examples

Expand

    >>> "dog" `union` "cow"
    "dogcw"

If equal elements are present in both lists, an element from the first list will be used. If the second list contains equal elements, only the first one will be retained:

    >>> import Data.Semigroup(Arg(..))
    >>> union [Arg () "dog"] [Arg () "cow"]
    [Arg () "dog"]
    >>> union [] [Arg () "dog", Arg () "cow"]
    [Arg () "dog"]

However if the first list contains duplicates, so will the result:

    >>> "coot" `union` "duck"
    "cootduk"
    >>> "duck" `union` "coot"
    "duckot"

`union` is productive even if both arguments are infinite.

    >>> [0, 2 ..] `union` [1, 3 ..]
    [0,2,4,6,8,10,12..

unionBy :: (a -> a -> Bool) -> [a] -> [a] -> [a] Source #

The `unionBy` function is the non-overloaded version of `union`. Both arguments may be infinite.

#### Examples

Expand

    >>> unionBy (>) [3, 4, 5] [1, 2, 3, 4, 5, 6]
    [3,4,5,4,5,6]

    >>> import Data.Semigroup (Arg(..))
    >>> unionBy (/=) [Arg () "Saul"] [Arg () "Kim"]
    [Arg () "Saul", Arg () "Kim"]

intersect :: Eq a => [a] -> [a] -> [a] Source #

The `intersect` function takes the list intersection of two lists. It is a special case of `intersectBy`, which allows the programmer to supply their own equality test.

##### Examples

Expand

    >>> [1,2,3,4] `intersect` [2,4,6,8]
    [2,4]

If equal elements are present in both lists, an element from the first list will be used, and all duplicates from the second list quashed:

    >>> import Data.Semigroup
    >>> intersect [Arg () "dog"] [Arg () "cow", Arg () "cat"]
    [Arg () "dog"]

However if the first list contains duplicates, so will the result.

    >>> "coot" `intersect` "heron"
    "oo"
    >>> "heron" `intersect` "coot"
    "o"

If the second list is infinite, `intersect` either hangs or returns its first argument in full. Otherwise if the first list is infinite, `intersect` might be productive:

    >>> intersect [100..] [0..]
    [100,101,102,103...
    >>> intersect [0] [1..]
    * Hangs forever *
    >>> intersect [1..] [0]
    * Hangs forever *
    >>> intersect (cycle [1..3]) [2]
    [2,2,2,2...

intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a] Source #

The `intersectBy` function is the non-overloaded version of `intersect`. It is productive for infinite arguments only if the first one is a subset of the second.

intersperse :: a -> [a] -> [a] Source #

\(\mathcal{O}(n)\). The `intersperse` function takes an element and a list and `intersperses' that element between the elements of the list.

#### Laziness

Expand

`intersperse` has the following properties

    >>> take 1 (intersperse undefined ('a' : undefined))
    "a"

    >>> take 2 (intersperse ',' ('a' : undefined))
    "a*** Exception: Prelude.undefined

#### Examples

Expand

    >>> intersperse ',' "abcde"
    "a,b,c,d,e"

    >>> intersperse 1 [3, 4, 5]
    [3,1,4,1,5]

intercalate :: [a] -> [[a]] -> [a] Source #

`intercalate` `xs xss` is equivalent to `(`concat` (`intersperse` xs xss))`. It inserts the list `xs` in between the lists in `xss` and concatenates the result.

#### Laziness

Expand

`intercalate` has the following properties:

    >>> take 5 (intercalate undefined ("Lorem" : undefined))
    "Lorem"

    >>> take 6 (intercalate ", " ("Lorem" : undefined))
    "Lorem*** Exception: Prelude.undefined

#### Examples

Expand

    >>> intercalate ", " ["Lorem", "ipsum", "dolor"]
    "Lorem, ipsum, dolor"

    >>> intercalate [0, 1] [[2, 3], [4, 5, 6], []]
    [2,3,0,1,4,5,6,0,1]

    >>> intercalate [1, 2, 3] [[], []]
    [1,2,3]

partition :: (a -> Bool) -> [a] -> ([a], [a]) Source #

The `partition` function takes a predicate and a list, and returns the pair of lists of elements which do and do not satisfy the predicate, respectively; i.e.,

    partition p xs == (filter p xs, filter (not . p) xs)

#### Examples

Expand

    >>> partition (`elem` "aeiou") "Hello World!"
    ("eoo","Hll Wrld!")

    >>> partition even [1..10]
    ([2,4,6,8,10],[1,3,5,7,9])

    >>> partition (< 5) [1..10]
    ([1,2,3,4],[5,6,7,8,9,10])

insert :: Ord a => a -> [a] -> [a] Source #

\(\mathcal{O}(n)\). The `insert` function takes an element and a list and inserts the element into the list at the first position where it is less than or equal to the next element. In particular, if the list is sorted before the call, the result will also be sorted. It is a special case of `insertBy`, which allows the programmer to supply their own comparison function.

#### Examples

Expand

    >>> insert (-1) [1, 2, 3]
    [-1,1,2,3]

    >>> insert 'd' "abcefg"
    "abcdefg"

    >>> insert 4 [1, 2, 3, 5, 6, 7]
    [1,2,3,4,5,6,7]

insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a] Source #

\(\mathcal{O}(n)\). The non-overloaded version of `insert`.

#### Examples

Expand

    >>> insertBy (\x y -> compare (length x) (length y)) [1, 2] [[1], [1, 2, 3], [1, 2, 3, 4]]
    [[1],[1,2],[1,2,3],[1,2,3,4]]

genericLength :: Num i => [a] -> i Source #

\(\mathcal{O}(n)\). The `genericLength` function is an overloaded version of `length`. In particular, instead of returning an `Int`, it returns any type which is an instance of `Num`. It is, however, less efficient than `length`.

#### Examples

Expand

    >>> genericLength [1, 2, 3] :: Int
    3
    >>> genericLength [1, 2, 3] :: Float
    3.0

Users should take care to pick a return type that is wide enough to contain the full length of the list. If the width is insufficient, the overflow behaviour will depend on the `(+)` implementation in the selected `Num` instance. The following example overflows because the actual list length of 200 lies outside of the `Int8` range of `-128..127`.

    >>> genericLength [1..200] :: Int8
    -56

genericTake :: Integral i => i -> [a] -> [a] Source #

The `genericTake` function is an overloaded version of `take`, which accepts any `Integral` value as the number of elements to take.

genericDrop :: Integral i => i -> [a] -> [a] Source #

The `genericDrop` function is an overloaded version of `drop`, which accepts any `Integral` value as the number of elements to drop.

genericSplitAt :: Integral i => i -> [a] -> ([a], [a]) Source #

The `genericSplitAt` function is an overloaded version of `splitAt`, which accepts any `Integral` value as the position at which to split.

genericIndex :: Integral i => [a] -> i -> a Source #

The `genericIndex` function is an overloaded version of `!!`, which accepts any `Integral` value as the index.

genericReplicate :: Integral i => i -> a -> [a] Source #

The `genericReplicate` function is an overloaded version of `replicate`, which accepts any `Integral` value as the number of repetitions to make.

zip4 :: [a] -> [b] -> [c] -> [d] -> [(a, b, c, d)] Source #

The `zip4` function takes four lists and returns a list of quadruples, analogous to `zip`. It is capable of list fusion, but it is restricted to its first list argument and its resulting list.

zip5 :: [a] -> [b] -> [c] -> [d] -> [e] -> [(a, b, c, d, e)] Source #

The `zip5` function takes five lists and returns a list of five-tuples, analogous to `zip`. It is capable of list fusion, but it is restricted to its first list argument and its resulting list.

zip6 :: [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [(a, b, c, d, e, f)] Source #

The `zip6` function takes six lists and returns a list of six-tuples, analogous to `zip`. It is capable of list fusion, but it is restricted to its first list argument and its resulting list.

zip7 :: [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [(a, b, c, d, e, f, g)] Source #

The `zip7` function takes seven lists and returns a list of seven-tuples, analogous to `zip`. It is capable of list fusion, but it is restricted to its first list argument and its resulting list.

zipWith4 :: (a -> b -> c -> d -> e) -> [a] -> [b] -> [c] -> [d] -> [e] Source #

The `zipWith4` function takes a function which combines four elements, as well as four lists and returns a list of their point-wise combination, analogous to `zipWith`. It is capable of list fusion, but it is restricted to its first list argument and its resulting list.

zipWith5 :: (a -> b -> c -> d -> e -> f) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] Source #

The `zipWith5` function takes a function which combines five elements, as well as five lists and returns a list of their point-wise combination, analogous to `zipWith`. It is capable of list fusion, but it is restricted to its first list argument and its resulting list.

zipWith6 :: (a -> b -> c -> d -> e -> f -> g) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] Source #

The `zipWith6` function takes a function which combines six elements, as well as six lists and returns a list of their point-wise combination, analogous to `zipWith`. It is capable of list fusion, but it is restricted to its first list argument and its resulting list.

zipWith7 :: (a -> b -> c -> d -> e -> f -> g -> h) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [h] Source #

The `zipWith7` function takes a function which combines seven elements, as well as seven lists and returns a list of their point-wise combination, analogous to `zipWith`. It is capable of list fusion, but it is restricted to its first list argument and its resulting list.

unzip4 :: [(a, b, c, d)] -> ([a], [b], [c], [d]) Source #

The `unzip4` function takes a list of quadruples and returns four lists, analogous to `unzip`.

unzip5 :: [(a, b, c, d, e)] -> ([a], [b], [c], [d], [e]) Source #

The `unzip5` function takes a list of five-tuples and returns five lists, analogous to `unzip`.

unzip6 :: [(a, b, c, d, e, f)] -> ([a], [b], [c], [d], [e], [f]) Source #

The `unzip6` function takes a list of six-tuples and returns six lists, analogous to `unzip`.

unzip7 :: [(a, b, c, d, e, f, g)] -> ([a], [b], [c], [d], [e], [f], [g]) Source #

The `unzip7` function takes a list of seven-tuples and returns seven lists, analogous to `unzip`.

deleteFirstsBy :: (a -> a -> Bool) -> [a] -> [a] -> [a] Source #

The `deleteFirstsBy` function takes a predicate and two lists and returns the first list with the first occurrence of each element of the second list removed. This is the non-overloaded version of `(\\)`.

    (\\) == deleteFirstsBy (==)

The second list must be finite, but the first may be infinite.

#### Examples

Expand

    >>> deleteFirstsBy (>) [1..10] [3, 4, 5]
    [4,5,6,7,8,9,10]

    >>> deleteFirstsBy (/=) [1..10] [1, 3, 5]
    [4,5,6,7,8,9,10]

group :: Eq a => [a] -> [[a]] Source #

The `group` function takes a list and returns a list of lists such that the concatenation of the result is equal to the argument. Moreover, each sublist in the result is non-empty, all elements are equal to the first one, and consecutive equal elements of the input end up in the same element of the output list.

`group` is a special case of `groupBy`, which allows the programmer to supply their own equality test.

It's often preferable to use `Data.List.NonEmpty.``group`, which provides type-level guarantees of non-emptiness of inner lists. A common idiom to squash repeating elements `map` `head` `.` `group` is better served by `map` `Data.List.NonEmpty.``head` `.` `Data.List.NonEmpty.``group` because it avoids partial functions.

#### Examples

Expand

    >>> group "Mississippi"
    ["M","i","ss","i","ss","i","pp","i"]

    >>> group [1, 1, 1, 2, 2, 3, 4, 5, 5]
    [[1,1,1],[2,2],[3],[4],[5,5]]

groupBy :: (a -> a -> Bool) -> [a] -> [[a]] Source #

The `groupBy` function is the non-overloaded version of `group`.

When a supplied relation is not transitive, it is important to remember that equality is checked against the first element in the group, not against the nearest neighbour:

    >>> groupBy (\a b -> b - a < 5) [0..19]
    [[0,1,2,3,4],[5,6,7,8,9],[10,11,12,13,14],[15,16,17,18,19]]

It's often preferable to use `Data.List.NonEmpty.``groupBy`, which provides type-level guarantees of non-emptiness of inner lists.

#### Examples

Expand

    >>> groupBy (/=) [1, 1, 1, 2, 3, 1, 4, 4, 5]
    [[1],[1],[1,2,3],[1,4,4,5]]

    >>> groupBy (>) [1, 3, 5, 1, 4, 2, 6, 5, 4]
    [[1],[3],[5,1,4,2],[6,5,4]]

    >>> groupBy (const not) [True, False, True, False, False, False, True]
    [[True,False],[True,False,False,False],[True]]

inits :: [a] -> [[a]] Source #

The `inits` function returns all initial segments of the argument, shortest first.

`inits` is semantically equivalent to ``map` `reverse` . `scanl` (`flip` (:)) []`, but under the hood uses a queue to amortize costs of `reverse`.

#### Laziness

Expand

Note that `inits` has the following strictness property: `inits (xs ++ _|_) = inits xs ++ _|_`

In particular, `inits _|_ = [] : _|_`

#### Examples

Expand

    >>> inits "abc"
    ["","a","ab","abc"]

    >>> inits []
    [[]]

inits is productive on infinite lists:

    >>> take 5 $ inits [1..]
    [[],[1],[1,2],[1,2,3],[1,2,3,4]]

tails :: [a] -> [[a]] Source #

\(\mathcal{O}(n)\). The `tails` function returns all final segments of the argument, longest first.

#### Laziness

Expand

Note that `tails` has the following strictness property: `tails _|_ = _|_ : _|_`

    >>> tails undefined
    [*** Exception: Prelude.undefined

    >>> drop 1 (tails [undefined, 1, 2])
    [[1, 2], [2], []]

#### Examples

Expand

    >>> tails "abc"
    ["abc","bc","c",""]

    >>> tails [1, 2, 3]
    [[1,2,3],[2,3],[3],[]]

    >>> tails []
    [[]]

subsequences :: [a] -> [[a]] Source #

The `subsequences` function returns the list of all subsequences of the argument.

#### Laziness

Expand

`subsequences` does not look ahead unless it must:

    >>> take 1 (subsequences undefined)
    [[]]
    >>> take 2 (subsequences ('a' : undefined))
    ["","a"]

#### Examples

Expand

    >>> subsequences "abc"
    ["","a","b","ab","c","ac","bc","abc"]

This function is productive on infinite inputs:

    >>> take 8 $ subsequences ['a'..]
    ["","a","b","ab","c","ac","bc","abc"]

permutations :: [a] -> [[a]] Source #

The `permutations` function returns the list of all permutations of the argument.

Note that the order of permutations is not lexicographic. It satisfies the following property:

    map (take n) (take (product [1..n]) (permutations ([1..n] ++ undefined))) == permutations [1..n]

#### Laziness

Expand

The `permutations` function is maximally lazy: for each `n`, the value of ``permutations` xs` starts with those permutations that permute ``take` n xs` and keep ``drop` n xs`.

#### Examples

Expand

    >>> permutations "abc"
    ["abc","bac","cba","bca","cab","acb"]

    >>> permutations [1, 2]
    [[1,2],[2,1]]

    >>> permutations []
    [[]]

This function is productive on infinite inputs:

    >>> take 6 $ map (take 3) $ permutations ['a'..]
    ["abc","bac","cba","bca","cab","acb"]

singleton :: a -> [a] Source #

Construct a list from a single element.

#### Examples

Expand

    >>> singleton True
    [True]

    >>> singleton [1, 2, 3]
    [[1,2,3]]

    >>> singleton 'c'
    "c"

Since: base-4.15.0.0

lines :: String -> [String] Source #

Splits the argument into a list of lines stripped of their terminating `\n` characters. The `\n` terminator is optional in a final non-empty line of the argument string.

When the argument string is empty, or ends in a `\n` character, it can be recovered by passing the result of `lines` to the `unlines` function. Otherwise, `unlines` appends the missing terminating `\n`. This makes `unlines . lines` idempotent:

    (unlines . lines) . (unlines . lines) = (unlines . lines)

#### Examples

Expand

    >>> lines ""           -- empty input contains no lines
    []

    >>> lines "\n"         -- single empty line
    [""]

    >>> lines "one"        -- single unterminated line
    ["one"]

    >>> lines "one\n"      -- single non-empty line
    ["one"]

    >>> lines "one\n\n"    -- second line is empty
    ["one",""]

    >>> lines "one\ntwo"   -- second line is unterminated
    ["one","two"]

    >>> lines "one\ntwo\n" -- two non-empty lines
    ["one","two"]

unlines :: [String] -> String Source #

Appends a `\n` character to each input string, then concatenates the results. Equivalent to ``foldMap` (s -> s `++` "\n")`.

#### Examples

Expand

    >>> unlines ["Hello", "World", "!"]
    "Hello\nWorld\n!\n"

Note that ``unlines` `.` `lines` `/=` `id`` when the input is not `\n`-terminated:

    >>> unlines . lines $ "foo\nbar"
    "foo\nbar\n"

words :: String -> [String] Source #

`words` breaks a string up into a list of words, which were delimited by white space (as defined by `isSpace`). This function trims any white spaces at the beginning and at the end.

#### Examples

Expand

    >>> words "Lorem ipsum\ndolor"
    ["Lorem","ipsum","dolor"]

    >>> words " foo bar "
    ["foo","bar"]

unwords :: [String] -> String Source #

`unwords` joins words with separating spaces (U+0020 SPACE).

`unwords` is neither left nor right inverse of `words`:

    >>> words (unwords [" "])
    []
    >>> unwords (words "foo\nbar")
    "foo bar"

#### Examples

Expand

    >>> unwords ["Lorem", "ipsum", "dolor"]
    "Lorem ipsum dolor"

    >>> unwords ["foo", "bar", "", "baz"]
    "foo bar  baz"

mapAccumL :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b) Source #

The `mapAccumL` function behaves like a combination of `fmap` and `foldl`; it applies a function to each element of a structure, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new structure.

#### Examples

Expand

Basic usage:

    >>> mapAccumL (\a b -> (a + b, a)) 0 [1..10]
    (55,[0,1,3,6,10,15,21,28,36,45])

    >>> mapAccumL (\a b -> (a <> show b, a)) "0" [1..5]
    ("012345",["0","01","012","0123","01234"])

mapAccumR :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b) Source #

The `mapAccumR` function behaves like a combination of `fmap` and `foldr`; it applies a function to each element of a structure, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new structure.

#### Examples

Expand

Basic usage:

    >>> mapAccumR (\a b -> (a + b, a)) 0 [1..10]
    (55,[54,52,49,45,40,34,27,19,10,0])

    >>> mapAccumR (\a b -> (a <> show b, a)) "0" [1..5]
    ("054321",["05432","0543","054","05","0"])

isSubsequenceOf :: Eq a => [a] -> [a] -> Bool Source #

The `isSubsequenceOf` function takes two lists and returns `True` if all the elements of the first list occur, in order, in the second. The elements do not have to occur consecutively.

``isSubsequenceOf` x y` is equivalent to `x ``elem`` (`subsequences` y)`.

Note: `isSubsequenceOf` is often used in infix form.

#### Examples

Expand

    >>> "GHC" `isSubsequenceOf` "The Glorious Haskell Compiler"
    True

    >>> ['a','d'..'z'] `isSubsequenceOf` ['a'..'z']
    True

    >>> [1..10] `isSubsequenceOf` [10,9..0]
    False

For the result to be `True`, the first list must be finite; for the result to be `False`, the second list must be finite:

    >>> [0,2..10] `isSubsequenceOf` [0..]
    True

    >>> [0..] `isSubsequenceOf` [0,2..10]
    False

    >>> [0,2..] `isSubsequenceOf` [0..]
    * Hangs forever*

Since: base-4.8.0.0

inits1 :: [a] -> [NonEmpty a] Source #

The `inits1` function returns all non-empty initial segments of the argument, shortest first.

#### Laziness

Expand

Note that `inits1` has the following strictness property: `inits1 (xs ++ _|_) = inits1 xs ++ _|_`

In particular, `inits1 _|_ = _|_`

#### Examples

Expand

    >>> inits1 "abc"
    ['a' :| "",'a' :| "b",'a' :| "bc"]

    >>> inits1 []
    []

inits1 is productive on infinite lists:

    >>> take 3 $ inits1 [1..]
    [1 :| [],1 :| [2],1 :| [2,3]]

Since: base-compat-4.21.0.0

tails1 :: [a] -> [NonEmpty a] Source #

\(\mathcal{O}(n)\). The `tails1` function returns all non-empty final segments of the argument, longest first.

#### Laziness

Expand

Note that `tails1` has the following strictness property: `tails1 _|_ = _|_`

    >>> tails1 undefined
    *** Exception: Prelude.undefined

    >>> drop 1 (tails1 [undefined, 1, 2])
    [1 :| [2],2 :| []]

#### Examples

Expand

    >>> tails1 "abc"
    ['a' :| "bc",'b' :| "c",'c' :| ""]

    >>> tails1 [1, 2, 3]
    [1 :| [2,3],2 :| [3],3 :| []]

    >>> tails1 []
    []

Since: base-compat-4.21.0.0

compareLength :: [a] -> Int -> Ordering Source #

Use `compareLength` `xs` `n` as a safer and faster alternative to `compare` (`length` `xs`) `n`. Similarly, it's better to write `compareLength xs 10 == LT` instead of `length xs < 10`.

While `length` would force and traverse the entire spine of `xs` (which could even diverge if `xs` is infinite), `compareLength` traverses at most `n` elements to determine its result.

    >>> compareLength [] 0
    EQ
    >>> compareLength [] 1
    LT
    >>> compareLength ['a'] 1
    EQ
    >>> compareLength ['a', 'b'] 1
    GT
    >>> compareLength [0..] 100
    GT
    >>> compareLength undefined (-1)
    GT
    >>> compareLength ('a' : undefined) 0
    GT

Since: base-compat-4.21.0.0

module Data.Maybe

class Semigroup a where Source #

The class of semigroups (types with an associative binary operation).

Instances should satisfy the following:

Associativity
  `x `<>` (y `<>` z) = (x `<>` y) `<>` z`

You can alternatively define `sconcat` instead of (`<>`), in which case the laws are:

Unit
  ``sconcat` (`pure` x) = x`
Multiplication
  ``sconcat` (`join` xss) = `sconcat` (`fmap` `sconcat` xss)`

Since: base-4.9.0.0

Minimal complete definition

(<>) | sconcat

Methods

(<>) :: a -> a -> a infixr 6 Source #

An associative operation.

#### Examples

Expand

    >>> [1,2,3] <> [4,5,6]
    [1,2,3,4,5,6]

    >>> Just [1, 2, 3] <> Just [4, 5, 6]
    Just [1,2,3,4,5,6]

    >>> putStr "Hello, " <> putStrLn "World!"
    Hello, World!

#### Instances

Instances details

Semigroup KeyMacro Source # |
Instance details Defined in Game.LambdaHack.Client.UI.SessionUI Methods (<>) :: KeyMacro -> KeyMacro -> KeyMacro Source # sconcat :: NonEmpty KeyMacro -> KeyMacro Source # stimes :: Integral b => b -> KeyMacro -> KeyMacro Source #
Semigroup ByteArray | Since: base-4.17.0.0
Instance details Defined in Data.Array.Byte Methods (<>) :: ByteArray -> ByteArray -> ByteArray Source # sconcat :: NonEmpty ByteArray -> ByteArray Source # stimes :: Integral b => b -> ByteArray -> ByteArray Source #
Semigroup Builder |
Instance details Defined in Data.ByteString.Builder.Internal Methods (<>) :: Builder -> Builder -> Builder Source # sconcat :: NonEmpty Builder -> Builder Source # stimes :: Integral b => b -> Builder -> Builder Source #
Semigroup ByteString |
Instance details Defined in Data.ByteString.Internal.Type Methods (<>) :: ByteString -> ByteString -> ByteString Source # sconcat :: NonEmpty ByteString -> ByteString Source # stimes :: Integral b => b -> ByteString -> ByteString Source #
Semigroup ByteString |
Instance details Defined in Data.ByteString.Lazy.Internal Methods (<>) :: ByteString -> ByteString -> ByteString Source # sconcat :: NonEmpty ByteString -> ByteString Source # stimes :: Integral b => b -> ByteString -> ByteString Source #
Semigroup ShortByteString |
Instance details Defined in Data.ByteString.Short.Internal Methods (<>) :: ShortByteString -> ShortByteString -> ShortByteString Source # sconcat :: NonEmpty ShortByteString -> ShortByteString Source # stimes :: Integral b => b -> ShortByteString -> ShortByteString Source #
Semigroup IntSet | Since: containers-0.5.7
Instance details Defined in Data.IntSet.Internal Methods (<>) :: IntSet -> IntSet -> IntSet Source # sconcat :: NonEmpty IntSet -> IntSet Source # stimes :: Integral b => b -> IntSet -> IntSet Source #
Semigroup Void | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: Void -> Void -> Void Source # sconcat :: NonEmpty Void -> Void Source # stimes :: Integral b => b -> Void -> Void Source #
Semigroup All | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (<>) :: All -> All -> All Source # sconcat :: NonEmpty All -> All Source # stimes :: Integral b => b -> All -> All Source #
Semigroup Any | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (<>) :: Any -> Any -> Any Source # sconcat :: NonEmpty Any -> Any Source # stimes :: Integral b => b -> Any -> Any Source #
Semigroup ExceptionContext |
Instance details Defined in GHC.Internal.Exception.Context Methods (<>) :: ExceptionContext -> ExceptionContext -> ExceptionContext Source # sconcat :: NonEmpty ExceptionContext -> ExceptionContext Source # stimes :: Integral b => b -> ExceptionContext -> ExceptionContext Source #
Semigroup Ordering | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: Ordering -> Ordering -> Ordering Source # sconcat :: NonEmpty Ordering -> Ordering Source # stimes :: Integral b => b -> Ordering -> Ordering Source #
Semigroup Part |
Instance details Defined in NLP.Miniutter.English Methods (<>) :: Part -> Part -> Part Source # sconcat :: NonEmpty Part -> Part Source # stimes :: Integral b => b -> Part -> Part Source #
Semigroup PrefsMod |
Instance details Defined in Options.Applicative.Builder Methods (<>) :: PrefsMod -> PrefsMod -> PrefsMod Source # sconcat :: NonEmpty PrefsMod -> PrefsMod Source # stimes :: Integral b => b -> PrefsMod -> PrefsMod Source #
Semigroup ParserHelp |
Instance details Defined in Options.Applicative.Help.Types Methods (<>) :: ParserHelp -> ParserHelp -> ParserHelp Source # sconcat :: NonEmpty ParserHelp -> ParserHelp Source # stimes :: Integral b => b -> ParserHelp -> ParserHelp Source #
Semigroup Completer |
Instance details Defined in Options.Applicative.Types Methods (<>) :: Completer -> Completer -> Completer Source # sconcat :: NonEmpty Completer -> Completer Source # stimes :: Integral b => b -> Completer -> Completer Source #
Semigroup ParseError |
Instance details Defined in Options.Applicative.Types Methods (<>) :: ParseError -> ParseError -> ParseError Source # sconcat :: NonEmpty ParseError -> ParseError Source # stimes :: Integral b => b -> ParseError -> ParseError Source #
Semigroup OsString |
Instance details Defined in System.OsString.Internal.Types Methods (<>) :: OsString -> OsString -> OsString Source # sconcat :: NonEmpty OsString -> OsString Source # stimes :: Integral b => b -> OsString -> OsString Source #
Semigroup PosixString |
Instance details Defined in System.OsString.Internal.Types Methods (<>) :: PosixString -> PosixString -> PosixString Source # sconcat :: NonEmpty PosixString -> PosixString Source # stimes :: Integral b => b -> PosixString -> PosixString Source #
Semigroup WindowsString |
Instance details Defined in System.OsString.Internal.Types Methods (<>) :: WindowsString -> WindowsString -> WindowsString Source # sconcat :: NonEmpty WindowsString -> WindowsString Source # stimes :: Integral b => b -> WindowsString -> WindowsString Source #
Semigroup Doc |
Instance details Defined in Text.PrettyPrint.HughesPJ Methods (<>) :: Doc -> Doc -> Doc Source # sconcat :: NonEmpty Doc -> Doc Source # stimes :: Integral b => b -> Doc -> Doc Source #
Semigroup Text | Beware: `stimes` will crash if the given number does not fit into an `Int`. Since: text-1.2.2.0
Instance details Defined in Data.Text Methods (<>) :: Text -> Text -> Text Source # sconcat :: NonEmpty Text -> Text Source # stimes :: Integral b => b -> Text -> Text Source #
Semigroup Builder |
Instance details Defined in Data.Text.Internal.Builder Methods (<>) :: Builder -> Builder -> Builder Source # sconcat :: NonEmpty Builder -> Builder Source # stimes :: Integral b => b -> Builder -> Builder Source #
Semigroup Text | Since: text-1.2.2.0
Instance details Defined in Data.Text.Lazy Methods (<>) :: Text -> Text -> Text Source # sconcat :: NonEmpty Text -> Text Source # stimes :: Integral b => b -> Text -> Text Source #
Semigroup StrictTextBuilder | Concatenation of `StrictBuilder` is right-biased: the right builder will be run first. This allows a builder to run tail-recursively when it was accumulated left-to-right.
Instance details Defined in Data.Text.Internal.StrictBuilder Methods (<>) :: StrictTextBuilder -> StrictTextBuilder -> StrictTextBuilder Source # sconcat :: NonEmpty StrictTextBuilder -> StrictTextBuilder Source # stimes :: Integral b => b -> StrictTextBuilder -> StrictTextBuilder Source #
Semigroup ShortText |
Instance details Defined in Data.Text.Short.Internal Methods (<>) :: ShortText -> ShortText -> ShortText Source # sconcat :: NonEmpty ShortText -> ShortText Source # stimes :: Integral b => b -> ShortText -> ShortText Source #
Semigroup CalendarDiffDays | Additive
Instance details Defined in Data.Time.Calendar.CalendarDiffDays Methods (<>) :: CalendarDiffDays -> CalendarDiffDays -> CalendarDiffDays Source # sconcat :: NonEmpty CalendarDiffDays -> CalendarDiffDays Source # stimes :: Integral b => b -> CalendarDiffDays -> CalendarDiffDays Source #
Semigroup CalendarDiffTime | Additive
Instance details Defined in Data.Time.LocalTime.Internal.CalendarDiffTime Methods (<>) :: CalendarDiffTime -> CalendarDiffTime -> CalendarDiffTime Source # sconcat :: NonEmpty CalendarDiffTime -> CalendarDiffTime Source # stimes :: Integral b => b -> CalendarDiffTime -> CalendarDiffTime Source #
Semigroup () | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: () -> () -> () Source # sconcat :: NonEmpty () -> () Source # stimes :: Integral b => b -> () -> () Source #
Semigroup (KeyMap v) |
Instance details Defined in Data.Aeson.KeyMap Methods (<>) :: KeyMap v -> KeyMap v -> KeyMap v Source # sconcat :: NonEmpty (KeyMap v) -> KeyMap v Source # stimes :: Integral b => b -> KeyMap v -> KeyMap v Source #
Semigroup (IResult a) |
Instance details Defined in Data.Aeson.Types.Internal Methods (<>) :: IResult a -> IResult a -> IResult a Source # sconcat :: NonEmpty (IResult a) -> IResult a Source # stimes :: Integral b => b -> IResult a -> IResult a Source #
Semigroup (Parser a) |
Instance details Defined in Data.Aeson.Types.Internal Methods (<>) :: Parser a -> Parser a -> Parser a Source # sconcat :: NonEmpty (Parser a) -> Parser a Source # stimes :: Integral b => b -> Parser a -> Parser a Source #
Semigroup (Result a) |
Instance details Defined in Data.Aeson.Types.Internal Methods (<>) :: Result a -> Result a -> Result a Source # sconcat :: NonEmpty (Result a) -> Result a Source # stimes :: Integral b => b -> Result a -> Result a Source #
Semigroup a => Semigroup (Concurrently a) | Only defined by `async` for `base >= 4.9` Since: async-2.1.0
Instance details Defined in Control.Concurrent.Async.Internal Methods (<>) :: Concurrently a -> Concurrently a -> Concurrently a Source # sconcat :: NonEmpty (Concurrently a) -> Concurrently a Source # stimes :: Integral b => b -> Concurrently a -> Concurrently a Source #
Semigroup (FromMaybe b) |
Instance details Defined in Data.Foldable1 Methods (<>) :: FromMaybe b -> FromMaybe b -> FromMaybe b Source # sconcat :: NonEmpty (FromMaybe b) -> FromMaybe b Source # stimes :: Integral b0 => b0 -> FromMaybe b -> FromMaybe b Source #
Semigroup a => Semigroup (JoinWith a) |
Instance details Defined in Data.Foldable1 Methods (<>) :: JoinWith a -> JoinWith a -> JoinWith a Source # sconcat :: NonEmpty (JoinWith a) -> JoinWith a Source # stimes :: Integral b => b -> JoinWith a -> JoinWith a Source #
Semigroup (NonEmptyDList a) |
Instance details Defined in Data.Foldable1 Methods (<>) :: NonEmptyDList a -> NonEmptyDList a -> NonEmptyDList a Source # sconcat :: NonEmpty (NonEmptyDList a) -> NonEmptyDList a Source # stimes :: Integral b => b -> NonEmptyDList a -> NonEmptyDList a Source #

Semigroup (Comparison a)

`(`<>`)` on comparisons combines results with `(`<>`) @Ordering`. Without newtypes this equals ``liftA2` (`liftA2` (`<>`))`.

    (<>) :: Comparison a -> Comparison a -> Comparison a
    Comparison cmp <> Comparison cmp' = Comparison a a' ->
      cmp a a' <> cmp a a'

Instance details Defined in Data.Functor.Contravariant Methods (<>) :: Comparison a -> Comparison a -> Comparison a Source # sconcat :: NonEmpty (Comparison a) -> Comparison a Source # stimes :: Integral b => b -> Comparison a -> Comparison a Source #

Semigroup (Equivalence a)

`(`<>`)` on equivalences uses logical conjunction `(`&&`)` on the results. Without newtypes this equals ``liftA2` (`liftA2` (&&))`.

    (<>) :: Equivalence a -> Equivalence a -> Equivalence a
    Equivalence equiv <> Equivalence equiv' = Equivalence a b ->
      equiv a b && equiv' a b

Instance details Defined in Data.Functor.Contravariant Methods (<>) :: Equivalence a -> Equivalence a -> Equivalence a Source # sconcat :: NonEmpty (Equivalence a) -> Equivalence a Source # stimes :: Integral b => b -> Equivalence a -> Equivalence a Source #

Semigroup (Predicate a)

`(`<>`)` on predicates uses logical conjunction `(`&&`)` on the results. Without newtypes this equals ``liftA2` (&&)`.

    (<>) :: Predicate a -> Predicate a -> Predicate a
    Predicate pred <> Predicate pred' = Predicate a ->
      pred a && pred' a

Instance details Defined in Data.Functor.Contravariant Methods (<>) :: Predicate a -> Predicate a -> Predicate a Source # sconcat :: NonEmpty (Predicate a) -> Predicate a Source # stimes :: Integral b => b -> Predicate a -> Predicate a Source #
Semigroup (First a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: First a -> First a -> First a Source # sconcat :: NonEmpty (First a) -> First a Source # stimes :: Integral b => b -> First a -> First a Source #
Semigroup (Last a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Last a -> Last a -> Last a Source # sconcat :: NonEmpty (Last a) -> Last a Source # stimes :: Integral b => b -> Last a -> Last a Source #
Ord a => Semigroup (Max a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Max a -> Max a -> Max a Source # sconcat :: NonEmpty (Max a) -> Max a Source # stimes :: Integral b => b -> Max a -> Max a Source #
Ord a => Semigroup (Min a) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Min a -> Min a -> Min a Source # sconcat :: NonEmpty (Min a) -> Min a Source # stimes :: Integral b => b -> Min a -> Min a Source #
Monoid m => Semigroup (WrappedMonoid m) | Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m Source # sconcat :: NonEmpty (WrappedMonoid m) -> WrappedMonoid m Source # stimes :: Integral b => b -> WrappedMonoid m -> WrappedMonoid m Source #
Semigroup (PutM ()) |
Instance details Defined in Data.Binary.Put Methods (<>) :: PutM () -> PutM () -> PutM () Source # sconcat :: NonEmpty (PutM ()) -> PutM () Source # stimes :: Integral b => b -> PutM () -> PutM () Source #
Num a => Semigroup (AlphaColour a) |
Instance details Defined in Data.Colour.Internal Methods (<>) :: AlphaColour a -> AlphaColour a -> AlphaColour a Source # sconcat :: NonEmpty (AlphaColour a) -> AlphaColour a Source # stimes :: Integral b => b -> AlphaColour a -> AlphaColour a Source #
Num a => Semigroup (Colour a) |
Instance details Defined in Data.Colour.Internal Methods (<>) :: Colour a -> Colour a -> Colour a Source # sconcat :: NonEmpty (Colour a) -> Colour a Source # stimes :: Integral b => b -> Colour a -> Colour a Source #
Semigroup (IntMap a) | Since: containers-0.5.7
Instance details Defined in Data.IntMap.Internal Methods (<>) :: IntMap a -> IntMap a -> IntMap a Source # sconcat :: NonEmpty (IntMap a) -> IntMap a Source # stimes :: Integral b => b -> IntMap a -> IntMap a Source #
Semigroup (Seq a) | Since: containers-0.5.7
Instance details Defined in Data.Sequence.Internal Methods (<>) :: Seq a -> Seq a -> Seq a Source # sconcat :: NonEmpty (Seq a) -> Seq a Source # stimes :: Integral b => b -> Seq a -> Seq a Source #
Ord a => Semigroup (Intersection a) |
Instance details Defined in Data.Set.Internal Methods (<>) :: Intersection a -> Intersection a -> Intersection a Source # sconcat :: NonEmpty (Intersection a) -> Intersection a Source # stimes :: Integral b => b -> Intersection a -> Intersection a Source #
Semigroup (MergeSet a) |
Instance details Defined in Data.Set.Internal Methods (<>) :: MergeSet a -> MergeSet a -> MergeSet a Source # sconcat :: NonEmpty (MergeSet a) -> MergeSet a Source # stimes :: Integral b => b -> MergeSet a -> MergeSet a Source #
Ord a => Semigroup (Set a) | Since: containers-0.5.7
Instance details Defined in Data.Set.Internal Methods (<>) :: Set a -> Set a -> Set a Source # sconcat :: NonEmpty (Set a) -> Set a Source # stimes :: Integral b => b -> Set a -> Set a Source #
Semigroup (DNonEmpty a) |
Instance details Defined in Data.DList.DNonEmpty.Internal Methods (<>) :: DNonEmpty a -> DNonEmpty a -> DNonEmpty a Source # sconcat :: NonEmpty (DNonEmpty a) -> DNonEmpty a Source # stimes :: Integral b => b -> DNonEmpty a -> DNonEmpty a Source #
Semigroup (DList a) |
Instance details Defined in Data.DList.Internal Methods (<>) :: DList a -> DList a -> DList a Source # sconcat :: NonEmpty (DList a) -> DList a Source # stimes :: Integral b => b -> DList a -> DList a Source #
Semigroup (EnumSet k) |
Instance details Defined in Data.EnumSet Methods (<>) :: EnumSet k -> EnumSet k -> EnumSet k Source # sconcat :: NonEmpty (EnumSet k) -> EnumSet k Source # stimes :: Integral b => b -> EnumSet k -> EnumSet k Source #
Semigroup (NonEmpty a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: NonEmpty a -> NonEmpty a -> NonEmpty a Source # sconcat :: NonEmpty (NonEmpty a) -> NonEmpty a Source # stimes :: Integral b => b -> NonEmpty a -> NonEmpty a Source #
Semigroup a => Semigroup (STM a) | Since: base-4.17.0.0
Instance details Defined in GHC.Internal.Conc.Sync Methods (<>) :: STM a -> STM a -> STM a Source # sconcat :: NonEmpty (STM a) -> STM a Source # stimes :: Integral b => b -> STM a -> STM a Source #
Semigroup a => Semigroup (Identity a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Functor.Identity Methods (<>) :: Identity a -> Identity a -> Identity a Source # sconcat :: NonEmpty (Identity a) -> Identity a Source # stimes :: Integral b => b -> Identity a -> Identity a Source #
Ord a => Semigroup (Max a) | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods (<>) :: Max a -> Max a -> Max a Source # sconcat :: NonEmpty (Max a) -> Max a Source # stimes :: Integral b => b -> Max a -> Max a Source #
Ord a => Semigroup (Min a) | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods (<>) :: Min a -> Min a -> Min a Source # sconcat :: NonEmpty (Min a) -> Min a Source # stimes :: Integral b => b -> Min a -> Min a Source #
Semigroup (First a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods (<>) :: First a -> First a -> First a Source # sconcat :: NonEmpty (First a) -> First a Source # stimes :: Integral b => b -> First a -> First a Source #
Semigroup (Last a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods (<>) :: Last a -> Last a -> Last a Source # sconcat :: NonEmpty (Last a) -> Last a Source # stimes :: Integral b => b -> Last a -> Last a Source #
Semigroup a => Semigroup (Down a) | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Data.Ord Methods (<>) :: Down a -> Down a -> Down a Source # sconcat :: NonEmpty (Down a) -> Down a Source # stimes :: Integral b => b -> Down a -> Down a Source #
Semigroup a => Semigroup (Dual a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (<>) :: Dual a -> Dual a -> Dual a Source # sconcat :: NonEmpty (Dual a) -> Dual a Source # stimes :: Integral b => b -> Dual a -> Dual a Source #
Semigroup (Endo a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (<>) :: Endo a -> Endo a -> Endo a Source # sconcat :: NonEmpty (Endo a) -> Endo a Source # stimes :: Integral b => b -> Endo a -> Endo a Source #
Num a => Semigroup (Product a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (<>) :: Product a -> Product a -> Product a Source # sconcat :: NonEmpty (Product a) -> Product a Source # stimes :: Integral b => b -> Product a -> Product a Source #
Num a => Semigroup (Sum a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (<>) :: Sum a -> Sum a -> Sum a Source # sconcat :: NonEmpty (Sum a) -> Sum a Source # stimes :: Integral b => b -> Sum a -> Sum a Source #
(Generic a, Semigroup (Rep a ())) => Semigroup (Generically a) | Since: base-4.17.0.0
Instance details Defined in GHC.Internal.Generics Methods (<>) :: Generically a -> Generically a -> Generically a Source # sconcat :: NonEmpty (Generically a) -> Generically a Source # stimes :: Integral b => b -> Generically a -> Generically a Source #
Semigroup p => Semigroup (Par1 p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods (<>) :: Par1 p -> Par1 p -> Par1 p Source # sconcat :: NonEmpty (Par1 p) -> Par1 p Source # stimes :: Integral b => b -> Par1 p -> Par1 p Source #
Semigroup a => Semigroup (IO a) | Since: base-4.10.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: IO a -> IO a -> IO a Source # sconcat :: NonEmpty (IO a) -> IO a Source # stimes :: Integral b => b -> IO a -> IO a Source #
Semigroup a => Semigroup (Plucker a) |
Instance details Defined in Linear.Plucker Methods (<>) :: Plucker a -> Plucker a -> Plucker a Source # sconcat :: NonEmpty (Plucker a) -> Plucker a Source # stimes :: Integral b => b -> Plucker a -> Plucker a Source #
Semigroup a => Semigroup (Quaternion a) |
Instance details Defined in Linear.Quaternion Methods (<>) :: Quaternion a -> Quaternion a -> Quaternion a Source # sconcat :: NonEmpty (Quaternion a) -> Quaternion a Source # stimes :: Integral b => b -> Quaternion a -> Quaternion a Source #
Semigroup (V0 a) |
Instance details Defined in Linear.V0 Methods (<>) :: V0 a -> V0 a -> V0 a Source # sconcat :: NonEmpty (V0 a) -> V0 a Source # stimes :: Integral b => b -> V0 a -> V0 a Source #
Semigroup a => Semigroup (V1 a) |
Instance details Defined in Linear.V1 Methods (<>) :: V1 a -> V1 a -> V1 a Source # sconcat :: NonEmpty (V1 a) -> V1 a Source # stimes :: Integral b => b -> V1 a -> V1 a Source #
Semigroup a => Semigroup (V2 a) |
Instance details Defined in Linear.V2 Methods (<>) :: V2 a -> V2 a -> V2 a Source # sconcat :: NonEmpty (V2 a) -> V2 a Source # stimes :: Integral b => b -> V2 a -> V2 a Source #
Semigroup a => Semigroup (V3 a) |
Instance details Defined in Linear.V3 Methods (<>) :: V3 a -> V3 a -> V3 a Source # sconcat :: NonEmpty (V3 a) -> V3 a Source # stimes :: Integral b => b -> V3 a -> V3 a Source #
Semigroup a => Semigroup (V4 a) |
Instance details Defined in Linear.V4 Methods (<>) :: V4 a -> V4 a -> V4 a Source # sconcat :: NonEmpty (V4 a) -> V4 a Source # stimes :: Integral b => b -> V4 a -> V4 a Source #
Semigroup (InfoMod a) |
Instance details Defined in Options.Applicative.Builder Methods (<>) :: InfoMod a -> InfoMod a -> InfoMod a Source # sconcat :: NonEmpty (InfoMod a) -> InfoMod a Source # stimes :: Integral b => b -> InfoMod a -> InfoMod a Source #
Semigroup (DefaultProp a) |
Instance details Defined in Options.Applicative.Builder.Internal Methods (<>) :: DefaultProp a -> DefaultProp a -> DefaultProp a Source # sconcat :: NonEmpty (DefaultProp a) -> DefaultProp a Source # stimes :: Integral b => b -> DefaultProp a -> DefaultProp a Source #
Semigroup a => Semigroup (Chunk a) |
Instance details Defined in Options.Applicative.Help.Chunk Methods (<>) :: Chunk a -> Chunk a -> Chunk a Source # sconcat :: NonEmpty (Chunk a) -> Chunk a Source # stimes :: Integral b => b -> Chunk a -> Chunk a Source #
Semigroup (Doc a) |
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (<>) :: Doc a -> Doc a -> Doc a Source # sconcat :: NonEmpty (Doc a) -> Doc a Source # stimes :: Integral b => b -> Doc a -> Doc a Source #
Semigroup (Doc ann) |
Instance details Defined in Prettyprinter.Internal Methods (<>) :: Doc ann -> Doc ann -> Doc ann Source # sconcat :: NonEmpty (Doc ann) -> Doc ann Source # stimes :: Integral b => b -> Doc ann -> Doc ann Source #
Semigroup (Array a) | Since: primitive-0.6.3.0
Instance details Defined in Data.Primitive.Array Methods (<>) :: Array a -> Array a -> Array a Source # sconcat :: NonEmpty (Array a) -> Array a Source # stimes :: Integral b => b -> Array a -> Array a Source #
Semigroup (PrimArray a) | Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.PrimArray Methods (<>) :: PrimArray a -> PrimArray a -> PrimArray a Source # sconcat :: NonEmpty (PrimArray a) -> PrimArray a Source # stimes :: Integral b => b -> PrimArray a -> PrimArray a Source #
Semigroup (SmallArray a) | Since: primitive-0.6.3.0
Instance details Defined in Data.Primitive.SmallArray Methods (<>) :: SmallArray a -> SmallArray a -> SmallArray a Source # sconcat :: NonEmpty (SmallArray a) -> SmallArray a Source # stimes :: Integral b => b -> SmallArray a -> SmallArray a Source #
Semigroup a => Semigroup (Maybe a) |
Instance details Defined in Data.Strict.Maybe Methods (<>) :: Maybe a -> Maybe a -> Maybe a Source # sconcat :: NonEmpty (Maybe a) -> Maybe a Source # stimes :: Integral b => b -> Maybe a -> Maybe a Source #
Semigroup a => Semigroup (Q a) | Since: template-haskell-2.17.0.0
Instance details Defined in Language.Haskell.TH.Syntax Methods (<>) :: Q a -> Q a -> Q a Source # sconcat :: NonEmpty (Q a) -> Q a Source # stimes :: Integral b => b -> Q a -> Q a Source #
Semigroup (Validity k) |
Instance details Defined in Data.HashMap.Internal.Debug Methods (<>) :: Validity k -> Validity k -> Validity k Source # sconcat :: NonEmpty (Validity k) -> Validity k Source # stimes :: Integral b => b -> Validity k -> Validity k Source #

(Hashable a, Eq a) => Semigroup (HashSet a)

`<>` = `union`

\(O(n+m)\)

To obtain good performance, the smaller set must be presented as the first argument.

#### Examples

Expand

    >>> fromList [1,2] <> fromList [2,3]
    fromList [1,2,3]

Instance details Defined in Data.HashSet.Internal Methods (<>) :: HashSet a -> HashSet a -> HashSet a Source # sconcat :: NonEmpty (HashSet a) -> HashSet a Source # stimes :: Integral b => b -> HashSet a -> HashSet a Source #
Semigroup (Vector a) |
Instance details Defined in Data.Vector Methods (<>) :: Vector a -> Vector a -> Vector a Source # sconcat :: NonEmpty (Vector a) -> Vector a Source # stimes :: Integral b => b -> Vector a -> Vector a Source #
Prim a => Semigroup (Vector a) |
Instance details Defined in Data.Vector.Primitive Methods (<>) :: Vector a -> Vector a -> Vector a Source # sconcat :: NonEmpty (Vector a) -> Vector a Source # stimes :: Integral b => b -> Vector a -> Vector a Source #
Storable a => Semigroup (Vector a) |
Instance details Defined in Data.Vector.Storable Methods (<>) :: Vector a -> Vector a -> Vector a Source # sconcat :: NonEmpty (Vector a) -> Vector a Source # stimes :: Integral b => b -> Vector a -> Vector a Source #
Semigroup (Vector a) |
Instance details Defined in Data.Vector.Strict Methods (<>) :: Vector a -> Vector a -> Vector a Source # sconcat :: NonEmpty (Vector a) -> Vector a Source # stimes :: Integral b => b -> Vector a -> Vector a Source #
Unbox a => Semigroup (Vector a) |
Instance details Defined in Data.Vector.Unboxed Methods (<>) :: Vector a -> Vector a -> Vector a Source # sconcat :: NonEmpty (Vector a) -> Vector a Source # stimes :: Integral b => b -> Vector a -> Vector a Source #
Semigroup a => Semigroup (Maybe a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: Maybe a -> Maybe a -> Maybe a Source # sconcat :: NonEmpty (Maybe a) -> Maybe a Source # stimes :: Integral b => b -> Maybe a -> Maybe a Source #
Semigroup a => Semigroup (Solo a) | Since: base-4.15
Instance details Defined in GHC.Internal.Base Methods (<>) :: Solo a -> Solo a -> Solo a Source # sconcat :: NonEmpty (Solo a) -> Solo a Source # stimes :: Integral b => b -> Solo a -> Solo a Source #
Semigroup [a] | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: [a] -> [a] -> [a] Source # sconcat :: NonEmpty [a] -> [a] Source # stimes :: Integral b => b -> [a] -> [a] Source #
Semigroup a => Semigroup (ConcurrentlyE e a) | Either the combination of the successful results, or the first failure.
Instance details Defined in Control.Concurrent.Async.Internal Methods (<>) :: ConcurrentlyE e a -> ConcurrentlyE e a -> ConcurrentlyE e a Source # sconcat :: NonEmpty (ConcurrentlyE e a) -> ConcurrentlyE e a Source # stimes :: Integral b => b -> ConcurrentlyE e a -> ConcurrentlyE e a Source #

Semigroup a => Semigroup (Op a b)

`(`<>`) @(Op a b)` without newtypes is `(`<>`) @(b->a)` = `liftA2 (`<>`)`. This lifts the `Semigroup` operation `(`<>`)` over the output of `a`.

    (<>) :: Op a b -> Op a b -> Op a b
    Op f <> Op g = Op a -> f a <> g a

Instance details Defined in Data.Functor.Contravariant Methods (<>) :: Op a b -> Op a b -> Op a b Source # sconcat :: NonEmpty (Op a b) -> Op a b Source # stimes :: Integral b0 => b0 -> Op a b -> Op a b Source #
Ord k => Semigroup (Map k v) |
Instance details Defined in Data.Map.Internal Methods (<>) :: Map k v -> Map k v -> Map k v Source # sconcat :: NonEmpty (Map k v) -> Map k v Source # stimes :: Integral b => b -> Map k v -> Map k v Source #
Semigroup (EnumMap k a) |
Instance details Defined in Data.EnumMap.Base Methods (<>) :: EnumMap k a -> EnumMap k a -> EnumMap k a Source # sconcat :: NonEmpty (EnumMap k a) -> EnumMap k a Source # stimes :: Integral b => b -> EnumMap k a -> EnumMap k a Source #
Semigroup (Either a b) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Either Methods (<>) :: Either a b -> Either a b -> Either a b Source # sconcat :: NonEmpty (Either a b) -> Either a b Source # stimes :: Integral b0 => b0 -> Either a b -> Either a b Source #
Semigroup (U1 p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods (<>) :: U1 p -> U1 p -> U1 p Source # sconcat :: NonEmpty (U1 p) -> U1 p Source # stimes :: Integral b => b -> U1 p -> U1 p Source #
Semigroup (V1 p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods (<>) :: V1 p -> V1 p -> V1 p Source # sconcat :: NonEmpty (V1 p) -> V1 p Source # stimes :: Integral b => b -> V1 p -> V1 p Source #
Semigroup a => Semigroup (ST s a) | Since: base-4.11.0.0
Instance details Defined in GHC.Internal.ST Methods (<>) :: ST s a -> ST s a -> ST s a Source # sconcat :: NonEmpty (ST s a) -> ST s a Source # stimes :: Integral b => b -> ST s a -> ST s a Source #
Apply f => Semigroup (Act f a) |
Instance details Defined in Data.Key Methods (<>) :: Act f a -> Act f a -> Act f a Source # sconcat :: NonEmpty (Act f a) -> Act f a Source # stimes :: Integral b => b -> Act f a -> Act f a Source #
Semigroup (f a) => Semigroup (Indexing f a) |
Instance details Defined in Control.Lens.Internal.Indexed Methods (<>) :: Indexing f a -> Indexing f a -> Indexing f a Source # sconcat :: NonEmpty (Indexing f a) -> Indexing f a Source # stimes :: Integral b => b -> Indexing f a -> Indexing f a Source #
Semigroup (ReifiedFold s a) |
Instance details Defined in Control.Lens.Reified Methods (<>) :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a Source # sconcat :: NonEmpty (ReifiedFold s a) -> ReifiedFold s a Source # stimes :: Integral b => b -> ReifiedFold s a -> ReifiedFold s a Source #
Semigroup (f a) => Semigroup (Point f a) |
Instance details Defined in Linear.Affine Methods (<>) :: Point f a -> Point f a -> Point f a Source # sconcat :: NonEmpty (Point f a) -> Point f a Source # stimes :: Integral b => b -> Point f a -> Point f a Source #
Semigroup (Mod f a) | Since: optparse-applicative-0.13.0.0
Instance details Defined in Options.Applicative.Builder.Internal Methods (<>) :: Mod f a -> Mod f a -> Mod f a Source # sconcat :: NonEmpty (Mod f a) -> Mod f a Source # stimes :: Integral b => b -> Mod f a -> Mod f a Source #
Semigroup (Either a b) |
Instance details Defined in Data.Strict.Either Methods (<>) :: Either a b -> Either a b -> Either a b Source # sconcat :: NonEmpty (Either a b) -> Either a b Source # stimes :: Integral b0 => b0 -> Either a b -> Either a b Source #
(Semigroup a, Semigroup b) => Semigroup (These a b) |
Instance details Defined in Data.Strict.These Methods (<>) :: These a b -> These a b -> These a b Source # sconcat :: NonEmpty (These a b) -> These a b Source # stimes :: Integral b0 => b0 -> These a b -> These a b Source #
(Semigroup a, Semigroup b) => Semigroup (Pair a b) |
Instance details Defined in Data.Strict.Tuple Methods (<>) :: Pair a b -> Pair a b -> Pair a b Source # sconcat :: NonEmpty (Pair a b) -> Pair a b Source # stimes :: Integral b0 => b0 -> Pair a b -> Pair a b Source #
(Semigroup a, Semigroup b) => Semigroup (These a b) |
Instance details Defined in Data.These Methods (<>) :: These a b -> These a b -> These a b Source # sconcat :: NonEmpty (These a b) -> These a b Source # stimes :: Integral b0 => b0 -> These a b -> These a b Source #

(Eq k, Hashable k) => Semigroup (HashMap k v)

`<>` = `union`

If a key occurs in both maps, the mapping from the first will be the mapping in the result.

#### Examples

Expand

    >>> fromList [(1,'a'),(2,'b')] <> fromList [(2,'c'),(3,'d')]
    fromList [(1,'a'),(2,'b'),(3,'d')]

Instance details Defined in Data.HashMap.Internal Methods (<>) :: HashMap k v -> HashMap k v -> HashMap k v Source # sconcat :: NonEmpty (HashMap k v) -> HashMap k v Source # stimes :: Integral b => b -> HashMap k v -> HashMap k v Source #
(Semigroup a, Semigroup b) => Semigroup (a, b) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: (a, b) -> (a, b) -> (a, b) Source # sconcat :: NonEmpty (a, b) -> (a, b) Source # stimes :: Integral b0 => b0 -> (a, b) -> (a, b) Source #
Semigroup b => Semigroup (a -> b) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: (a -> b) -> (a -> b) -> a -> b Source # sconcat :: NonEmpty (a -> b) -> a -> b Source # stimes :: Integral b0 => b0 -> (a -> b) -> a -> b Source #
Semigroup a => Semigroup (Const a b) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Functor.Const Methods (<>) :: Const a b -> Const a b -> Const a b Source # sconcat :: NonEmpty (Const a b) -> Const a b Source # stimes :: Integral b0 => b0 -> Const a b -> Const a b Source #
(Applicative f, Semigroup a) => Semigroup (Ap f a) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Data.Monoid Methods (<>) :: Ap f a -> Ap f a -> Ap f a Source # sconcat :: NonEmpty (Ap f a) -> Ap f a Source # stimes :: Integral b => b -> Ap f a -> Ap f a Source #
Alternative f => Semigroup (Alt f a) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Data.Semigroup.Internal Methods (<>) :: Alt f a -> Alt f a -> Alt f a Source # sconcat :: NonEmpty (Alt f a) -> Alt f a Source # stimes :: Integral b => b -> Alt f a -> Alt f a Source #
Semigroup (f p) => Semigroup (Rec1 f p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods (<>) :: Rec1 f p -> Rec1 f p -> Rec1 f p Source # sconcat :: NonEmpty (Rec1 f p) -> Rec1 f p Source # stimes :: Integral b => b -> Rec1 f p -> Rec1 f p Source #
Semigroup (ReifiedIndexedFold i s a) |
Instance details Defined in Control.Lens.Reified Methods (<>) :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a Source # sconcat :: NonEmpty (ReifiedIndexedFold i s a) -> ReifiedIndexedFold i s a Source # stimes :: Integral b => b -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a Source #
(Dim n, Semigroup a) => Semigroup (V n a) |
Instance details Defined in Linear.V Methods (<>) :: V n a -> V n a -> V n a Source # sconcat :: NonEmpty (V n a) -> V n a Source # stimes :: Integral b => b -> V n a -> V n a Source #
Reifies s (ReifiedMonoid a) => Semigroup (ReflectedMonoid a s) |
Instance details Defined in Data.Reflection Methods (<>) :: ReflectedMonoid a s -> ReflectedMonoid a s -> ReflectedMonoid a s Source # sconcat :: NonEmpty (ReflectedMonoid a s) -> ReflectedMonoid a s Source # stimes :: Integral b => b -> ReflectedMonoid a s -> ReflectedMonoid a s Source #
Semigroup a => Semigroup (Tagged s a) |
Instance details Defined in Data.Tagged Methods (<>) :: Tagged s a -> Tagged s a -> Tagged s a Source # sconcat :: NonEmpty (Tagged s a) -> Tagged s a Source # stimes :: Integral b => b -> Tagged s a -> Tagged s a Source #
Semigroup a => Semigroup (Constant a b) |
Instance details Defined in Data.Functor.Constant Methods (<>) :: Constant a b -> Constant a b -> Constant a b Source # sconcat :: NonEmpty (Constant a b) -> Constant a b Source # stimes :: Integral b0 => b0 -> Constant a b -> Constant a b Source #
(Semigroup a, Semigroup b, Semigroup c) => Semigroup (a, b, c) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: (a, b, c) -> (a, b, c) -> (a, b, c) Source # sconcat :: NonEmpty (a, b, c) -> (a, b, c) Source # stimes :: Integral b0 => b0 -> (a, b, c) -> (a, b, c) Source #
(Semigroup (f a), Semigroup (g a)) => Semigroup (Product f g a) | Since: base-4.16.0.0
Instance details Defined in Data.Functor.Product Methods (<>) :: Product f g a -> Product f g a -> Product f g a Source # sconcat :: NonEmpty (Product f g a) -> Product f g a Source # stimes :: Integral b => b -> Product f g a -> Product f g a Source #
(Semigroup (f p), Semigroup (g p)) => Semigroup ((f :*: g) p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods (<>) :: (f :*: g) p -> (f :*: g) p -> (f :*: g) p Source # sconcat :: NonEmpty ((f :*: g) p) -> (f :*: g) p Source # stimes :: Integral b => b -> (f :*: g) p -> (f :*: g) p Source #
Semigroup c => Semigroup (K1 i c p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods (<>) :: K1 i c p -> K1 i c p -> K1 i c p Source # sconcat :: NonEmpty (K1 i c p) -> K1 i c p Source # stimes :: Integral b => b -> K1 i c p -> K1 i c p Source #
(Semigroup a, Semigroup b, Semigroup c, Semigroup d) => Semigroup (a, b, c, d) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) Source # sconcat :: NonEmpty (a, b, c, d) -> (a, b, c, d) Source # stimes :: Integral b0 => b0 -> (a, b, c, d) -> (a, b, c, d) Source #
Semigroup (f (g a)) => Semigroup (Compose f g a) | Since: base-4.16.0.0
Instance details Defined in Data.Functor.Compose Methods (<>) :: Compose f g a -> Compose f g a -> Compose f g a Source # sconcat :: NonEmpty (Compose f g a) -> Compose f g a Source # stimes :: Integral b => b -> Compose f g a -> Compose f g a Source #
Semigroup (f (g p)) => Semigroup ((f :.: g) p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods (<>) :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p Source # sconcat :: NonEmpty ((f :.: g) p) -> (f :.: g) p Source # stimes :: Integral b => b -> (f :.: g) p -> (f :.: g) p Source #
Semigroup (f p) => Semigroup (M1 i c f p) | Since: base-4.12.0.0
Instance details Defined in GHC.Internal.Generics Methods (<>) :: M1 i c f p -> M1 i c f p -> M1 i c f p Source # sconcat :: NonEmpty (M1 i c f p) -> M1 i c f p Source # stimes :: Integral b => b -> M1 i c f p -> M1 i c f p Source #
(Semigroup a, Semigroup b, Semigroup c, Semigroup d, Semigroup e) => Semigroup (a, b, c, d, e) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) Source # sconcat :: NonEmpty (a, b, c, d, e) -> (a, b, c, d, e) Source # stimes :: Integral b0 => b0 -> (a, b, c, d, e) -> (a, b, c, d, e) Source #

assert :: Bool -> a -> a Source #

If the first argument evaluates to `True`, then the result is the second argument. Otherwise an `AssertionFailed` exception is raised, containing a `String` with the source file and line number of the call to `assert`.

Assertions can normally be turned on or off with a compiler flag (for GHC, assertions are normally on unless optimisation is turned on with `-O` or the `-fignore-asserts` option is given). When assertions are turned off, the first argument to `assert` is ignored, and the second argument is returned as the result.

blame :: Show v => Bool -> v -> Bool infix 1 Source #

If the condition fails, display the value blamed for the failure. Used as in

    assert (age < 120 `blame` age) $ savings / (120 - age)

showFailure :: Show v => String -> v -> String infix 2 Source #

A helper function for `error`. To be used as in

    case xs of
      0 : _ -> error $ "insignificant zero" `showFailure` xs

Fixing the first argument to `String` instead of anything Showable prevents warnings about defaulting, even when `OverloadedStrings` extension is enabled.

swith :: String -> v -> (String, v) infix 2 Source #

Syntactic sugar for the pair operation, to be used for `blame` as in

    assert (age < 120 `blame` "age too high" `swith` age) $ savings / (120 - age)

Fixing the first component of the pair to `String` prevents warnings about defaulting, even when `OverloadedStrings` extension is enabled.

allB :: Show v => (v -> Bool) -> [v] -> Bool Source #

Like `all`, but if the predicate fails, blame all the list elements and especially those for which it fails. To be used as in

    assert (allB (<= height) [yf, y1, y2])

data Text Source #

A space efficient, packed, unboxed Unicode text type.

#### Instances

Instances details

PrintfArg Text | Since: text-1.2.2.0
Instance details Defined in Data.Text Methods formatArg :: Text -> FieldFormatter Source # parseFormat :: Text -> ModifierParser Source #
Binary Text | Since: text-1.2.1.0
Instance details Defined in Data.Text Methods put :: Text -> Put Source # get :: Get Text Source # putList :: [Text] -> Put Source #
NFData Text |
Instance details Defined in Data.Text Methods rnf :: Text -> () Source #
Monoid Text |
Instance details Defined in Data.Text Methods mempty :: Text Source # mappend :: Text -> Text -> Text Source # mconcat :: [Text] -> Text Source #
Semigroup Text | Beware: `stimes` will crash if the given number does not fit into an `Int`. Since: text-1.2.2.0
Instance details Defined in Data.Text Methods (<>) :: Text -> Text -> Text Source # sconcat :: NonEmpty Text -> Text Source # stimes :: Integral b => b -> Text -> Text Source #

Data Text

This instance preserves data abstraction at the cost of inefficiency. We omit reflection services for the sake of data abstraction.

This instance was created by copying the updated behavior of `Data.Set.``Set` and `Data.Map.``Map`. If you feel a mistake has been made, please feel free to submit improvements.

The original discussion is archived here: could we get a Data instance for Data.Text.Text?

The followup discussion that changed the behavior of `Set` and `Map` is archived here: Proposal: Allow gunfold for Data.Map, ...

Instance details

Defined in Data.Text

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Text -> c Text Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Text Source #

toConstr :: Text -> Constr Source #

dataTypeOf :: Text -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Text) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Text) Source #

gmapT :: (forall b. Data b => b -> b) -> Text -> Text Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Text -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Text -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Text -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Text -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Text -> m Text Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Text -> m Text Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Text -> m Text Source #

IsString Text

Performs replacement on invalid scalar values:

    >>> :set -XOverloadedStrings
    >>> "\55555" :: Text
    "\65533"

Instance details Defined in Data.Text Methods fromString :: String -> Text Source #

IsList Text

Performs replacement on invalid scalar values:

    >>> :set -XOverloadedLists
    >>> ['\55555'] :: Text
    "\65533"

Since: text-1.2.0.0

Instance details

Defined in Data.Text

Associated Types

type Item Text |
Instance details Defined in Data.Text type Item Text = Char

Methods

fromList :: [Item Text] -> Text Source #

fromListN :: Int -> [Item Text] -> Text Source #

toList :: Text -> [Item Text] Source #

Read Text |
Instance details Defined in Data.Text Methods readsPrec :: Int -> ReadS Text Source # readList :: ReadS [Text] Source # readPrec :: ReadPrec Text Source # readListPrec :: ReadPrec [Text] Source #
Show Text |
Instance details Defined in Data.Text.Show Methods showsPrec :: Int -> Text -> ShowS Source # show :: Text -> String Source # showList :: [Text] -> ShowS Source #
Eq Text |
Instance details Defined in Data.Text Methods (==) :: Text -> Text -> Bool Source # (/=) :: Text -> Text -> Bool Source #
Ord Text |
Instance details Defined in Data.Text Methods compare :: Text -> Text -> Ordering Source # (<) :: Text -> Text -> Bool Source # (<=) :: Text -> Text -> Bool Source # (>) :: Text -> Text -> Bool Source # (>=) :: Text -> Text -> Bool Source # max :: Text -> Text -> Text Source # min :: Text -> Text -> Text Source #
Hashable Text |
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Text -> Int Source # hash :: Text -> Int Source #
Ixed Text |
Instance details Defined in Control.Lens.At Methods ix :: Index Text -> Traversal' Text (IxValue Text)
Pretty Text |
Instance details Defined in Prettyprinter.Internal Methods pretty :: Text -> Doc ann # prettyList :: [Text] -> Doc ann #
Lift Text | Since: text-1.2.4.0
Instance details Defined in Data.Text Methods lift :: Quote m => Text -> m Exp Source # liftTyped :: forall (m :: Type -> Type). Quote m => Text -> Code m Text Source #
From Text Text | Uses `fromStrict`.
Instance details Defined in Witch.Instances Methods from :: Text -> Text Source #
From Text Utf16BL | Converts via `ByteString`.
Instance details Defined in Witch.Instances Methods from :: Text -> Utf16BL Source #
From Text Utf16BS | Uses `encodeUtf16BE`.
Instance details Defined in Witch.Instances Methods from :: Text -> Utf16BS Source #
From Text Utf16LL | Converts via `ByteString`.
Instance details Defined in Witch.Instances Methods from :: Text -> Utf16LL Source #
From Text Utf16LS | Uses `encodeUtf16LE`.
Instance details Defined in Witch.Instances Methods from :: Text -> Utf16LS Source #
From Text Utf32BL | Converts via `ByteString`.
Instance details Defined in Witch.Instances Methods from :: Text -> Utf32BL Source #
From Text Utf32BS | Uses `encodeUtf32BE`.
Instance details Defined in Witch.Instances Methods from :: Text -> Utf32BS Source #
From Text Utf32LL | Converts via `ByteString`.
Instance details Defined in Witch.Instances Methods from :: Text -> Utf32LL Source #
From Text Utf32LS | Uses `encodeUtf32LE`.
Instance details Defined in Witch.Instances Methods from :: Text -> Utf32LS Source #
From Text Utf8L | Converts via `ByteString`.
Instance details Defined in Witch.Instances Methods from :: Text -> Utf8L Source #
From Text Utf8S | Uses `encodeUtf8`.
Instance details Defined in Witch.Instances Methods from :: Text -> Utf8S Source #
From Text String | Uses `unpack`.
Instance details Defined in Witch.Instances Methods from :: Text -> String Source #
From Text Text | Uses `toStrict`.
Instance details Defined in Witch.Instances Methods from :: Text -> Text Source #
From Latin1L Text | Converts via `Text`.
Instance details Defined in Witch.Instances Methods from :: Latin1L -> Text Source #
From Latin1S Text | Uses `decodeLatin1`.
Instance details Defined in Witch.Instances Methods from :: Latin1S -> Text Source #
From String Text | Uses `pack`. Some `Char` values cannot be represented in `Text` and will be replaced with `'\xFFFD'`.
Instance details Defined in Witch.Instances Methods from :: String -> Text Source #
TryFrom Text Latin1L | Converts via `String`.
Instance details Defined in Witch.Instances Methods tryFrom :: Text -> Either (TryFromException Text Latin1L) Latin1L Source #
TryFrom Text Latin1S | Converts via `String`.
Instance details Defined in Witch.Instances Methods tryFrom :: Text -> Either (TryFromException Text Latin1S) Latin1S Source #
TryFrom Utf16BL Text | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf16BL -> Either (TryFromException Utf16BL Text) Text Source #
TryFrom Utf16BS Text | Uses `decodeUtf16BE`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf16BS -> Either (TryFromException Utf16BS Text) Text Source #
TryFrom Utf16LL Text | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf16LL -> Either (TryFromException Utf16LL Text) Text Source #
TryFrom Utf16LS Text | Uses `decodeUtf16LE`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf16LS -> Either (TryFromException Utf16LS Text) Text Source #
TryFrom Utf32BL Text | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf32BL -> Either (TryFromException Utf32BL Text) Text Source #
TryFrom Utf32BS Text | Uses `decodeUtf32BE`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf32BS -> Either (TryFromException Utf32BS Text) Text Source #
TryFrom Utf32LL Text | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf32LL -> Either (TryFromException Utf32LL Text) Text Source #
TryFrom Utf32LS Text | Uses `decodeUtf32LE`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf32LS -> Either (TryFromException Utf32LS Text) Text Source #
TryFrom Utf8L Text | Converts via `Text`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf8L -> Either (TryFromException Utf8L Text) Text Source #
TryFrom Utf8S Text | Uses `decodeUtf8'`.
Instance details Defined in Witch.Instances Methods tryFrom :: Utf8S -> Either (TryFromException Utf8S Text) Text Source #
type Item Text |
Instance details Defined in Data.Text type Item Text = Char
type Index Text |
Instance details Defined in Control.Lens.At type Index Text = Int
type IxValue Text |
Instance details Defined in Control.Lens.At type IxValue Text = Char

(<+>) :: Text -> Text -> Text #

tshow :: Show a => a -> Text Source #

Show and pack the result.

divUp :: Integral a => a -> a -> a infixl 7 Source #

Integer division, rounding up.

sum :: Num a => [a] -> a Source #

(<$$>) :: (Functor f, Functor g) => (a -> b) -> f (g a) -> f (g b) infixl 4 Source #

partitionM :: Applicative m => (a -> m Bool) -> [a] -> m ([a], [a]) Source #

length :: [a] -> Int Source #

A version specialized to lists to avoid errors such as taking length of `Maybe [a]` instead of `[a]`. Such errors are hard to detect, because the type of elements of the list is not constrained.

null :: [a] -> Bool Source #

A version specialized to lists to avoid errors such as taking null of `Maybe [a]` instead of `[a]`. Such errors are hard to detect, because the type of elements of the list is not constrained.

comparing :: Ord a => (b -> a) -> b -> b -> Ordering Source #

    comparing p x y = compare (p x) (p y)

Useful combinator for use in conjunction with the `xxxBy` family of functions from Data.List, for example:

      ... sortBy (comparing fst) ...

into :: forall target source. From source target => source -> target Source #

This is the same as `from` except that the type variables are in the opposite order.

    -- Avoid this:
    from x :: t

    -- Prefer this:
    into @t x

fromIntegralWrap :: (Integral a, Num b) => a -> b Source #

Re-exported `fromIntegral`, but please give it explicit type to make it obvious if wrapping, etc., may occur. Use `toIntegralCrash` instead, if possible, because it fails instead of wrapping, etc. In general, it may wrap or otherwise lose information.

toIntegralCrash :: (Integral a, Integral b, Bits a, Bits b) => a -> b Source #

Re-exported `toIntegralSized`, but please give it explicit type to make it obvious if wrapping, etc., may occur and to trigger optimization. In general, it may crash.

intToDouble :: Int -> Double Source #

int64ToDouble :: Int64 -> Double Source #

mapM_ :: (Foldable t, Monad m) => (a -> m ()) -> t a -> m () Source #

This has a more specific type (unit result) than normally, to catch errors.

forM_ :: (Foldable t, Monad m) => t a -> (a -> m ()) -> m () Source #

This has a more specific type (unit result) than normally, to catch errors.

vectorUnboxedUnsafeIndex :: Unbox a => Vector a -> Int -> a Source #

unsafeShiftL :: Bits a => a -> Int -> a Source #

unsafeShiftR :: Bits a => a -> Int -> a Source #

(***) :: Arrow a => a b c -> a b' c' -> a (b, b') (c, c') infixr 3 Source #

Split the input between the two argument arrows and combine their output. Note that this is in general not a functor.

The default definition may be overridden with a more efficient version if desired.

(&&&) :: Arrow a => a b c -> a b c' -> a b (c, c') infixr 3 Source #

Fanout: send the input to both argument arrows and combine their output.

The default definition may be overridden with a more efficient version if desired.

first :: Arrow a => a b c -> a (b, d) (c, d) Source #

Send the first component of the input through the argument arrow, and copy the rest unchanged to the output.

second :: Arrow a => a b c -> a (d, b) (d, c) Source #

A mirror image of `first`.

The default definition may be overridden with a more efficient version if desired.

# Orphan instances

Binary NominalDiffTime Source # |
Instance details Methods put :: NominalDiffTime -> Put Source # get :: Get NominalDiffTime Source # putList :: [NominalDiffTime] -> Put Source #
NFData Part Source # |
Instance details Methods rnf :: Part -> () Source #
NFData Person Source # |
Instance details Methods rnf :: Person -> () Source #
NFData Polarity Source # |
Instance details Methods rnf :: Polarity -> () Source #
(Enum k, Binary k) => Binary (EnumSet k) Source # |
Instance details Methods put :: EnumSet k -> Put Source # get :: Get (EnumSet k) Source # putList :: [EnumSet k] -> Put Source #
(Enum k, Hashable k) => Hashable (EnumSet k) Source # |
Instance details Methods hashWithSalt :: Int -> EnumSet k -> Int Source # hash :: EnumSet k -> Int Source #
Enum k => Adjustable (EnumMap k) Source # |
Instance details Methods adjust :: (a -> a) -> Key (EnumMap k) -> EnumMap k a -> EnumMap k a Source # replace :: Key (EnumMap k) -> a -> EnumMap k a -> EnumMap k a Source #
Enum k => FoldableWithKey (EnumMap k) Source # |
Instance details Methods toKeyedList :: EnumMap k a -> [(Key (EnumMap k), a)] Source # foldMapWithKey :: Monoid m => (Key (EnumMap k) -> a -> m) -> EnumMap k a -> m Source # foldrWithKey :: (Key (EnumMap k) -> a -> b -> b) -> b -> EnumMap k a -> b Source # foldlWithKey :: (b -> Key (EnumMap k) -> a -> b) -> b -> EnumMap k a -> b Source #
Enum k => Indexable (EnumMap k) Source # |
Instance details Methods index :: EnumMap k a -> Key (EnumMap k) -> a Source #
Enum k => Keyed (EnumMap k) Source # |
Instance details Methods mapWithKey :: (Key (EnumMap k) -> a -> b) -> EnumMap k a -> EnumMap k b Source #
Enum k => Lookup (EnumMap k) Source # |
Instance details Methods lookup :: Key (EnumMap k) -> EnumMap k a -> Maybe a Source #
Enum k => TraversableWithKey (EnumMap k) Source # |
Instance details Methods traverseWithKey :: Applicative f => (Key (EnumMap k) -> a -> f b) -> EnumMap k a -> f (EnumMap k b) Source # mapWithKeyM :: Monad m => (Key (EnumMap k) -> a -> m b) -> EnumMap k a -> m (EnumMap k b) Source #
Zip (EnumMap k) Source # |
Instance details Methods zipWith :: (a -> b -> c) -> EnumMap k a -> EnumMap k b -> EnumMap k c Source # zip :: EnumMap k a -> EnumMap k b -> EnumMap k (a, b) Source # zap :: EnumMap k (a -> b) -> EnumMap k a -> EnumMap k b Source #
Enum k => ZipWithKey (EnumMap k) Source # |
Instance details Methods zipWithKey :: (Key (EnumMap k) -> a -> b -> c) -> EnumMap k a -> EnumMap k b -> EnumMap k c Source # zapWithKey :: EnumMap k (Key (EnumMap k) -> a -> b) -> EnumMap k a -> EnumMap k b Source #
(Enum k, Binary k, Binary e) => Binary (EnumMap k e) Source # |
Instance details Methods put :: EnumMap k e -> Put Source # get :: Get (EnumMap k e) Source # putList :: [EnumMap k e] -> Put Source #
(Hashable k, Eq k, Binary k, Binary v) => Binary (HashMap k v) Source # |
Instance details Methods put :: HashMap k v -> Put Source # get :: Get (HashMap k v) Source # putList :: [HashMap k v] -> Put Source #
(Enum k, Hashable k, Hashable e) => Hashable (EnumMap k e) Source # |
Instance details Methods hashWithSalt :: Int -> EnumMap k e -> Int Source # hash :: EnumMap k e -> Int Source #