yesod-paginator-1.1.2.1: A pagination approach for yesod

Yesod.Paginator.Prelude

Synopsis

# Documentation

(++) :: [a] -> [a] -> [a] infixr 5 #

Append 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.

seq :: forall (r :: RuntimeRep) a (b :: TYPE r). a -> b -> b infixr 0 #

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.

filter :: (a -> Bool) -> [a] -> [a] #

$$\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]
>>> filter odd [1, 2, 3]
[1,3]


zip :: [a] -> [b] -> [(a, b)] #

$$\mathcal{O}(\min(m,n))$$. zip takes two lists and returns a list of corresponding pairs.

zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]

If one input list is short, excess elements of the longer list are discarded:

zip [1] ['a', 'b'] = [(1, 'a')]
zip [1, 2] ['a'] = [(1, 'a')]

zip is right-lazy:

zip [] _|_ = []
zip _|_ [] = _|_

zip is capable of list fusion, but it is restricted to its first list argument and its resulting list.

print :: Show a => a -> IO () #

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]])

fst :: (a, b) -> a #

Extract the first component of a pair.

snd :: (a, b) -> b #

Extract the second component of a pair.

otherwise is defined as the value True. It helps to make guards more readable. eg.

 f x | x < 0     = ...
| otherwise = ...

map :: (a -> b) -> [a] -> [b] #

$$\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, ...]
>>> map (+1) [1, 2, 3]


($) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b infixr 0 # Application operator. This operator is redundant, since ordinary application (f x) means the same as (f$ x). However, $ has low, right-associative binding precedence, so it sometimes allows parentheses to be omitted; for example: f$ g $h x = f (g (h x)) It is also useful in higher-order situations, such as map ($ 0) xs, or zipWith ($) fs xs. Note that ($) is levity-polymorphic in its result type, so that foo $True where foo :: Bool -> Int# is well-typed. fromIntegral :: (Integral a, Num b) => a -> b # general coercion from integral types realToFrac :: (Real a, Fractional b) => a -> b # general coercion to fractional types guard :: Alternative f => Bool -> f () # Conditional failure of Alternative computations. Defined by guard True = pure () guard False = empty  #### Examples Expand Common uses of guard include conditionally signaling an error in an error monad and conditionally rejecting the current choice in an Alternative-based parser. As an example of signaling 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)  join :: Monad m => m (m a) -> m a # 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 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 Bounded a where # 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 # maxBound :: a # #### Instances Instances details  Since: base-2.1 Instance detailsDefined in GHC.Enum Methods Since: base-2.1 Instance detailsDefined in GHC.Enum Methods Since: base-2.1 Instance detailsDefined in GHC.Enum Methods Since: base-2.1 Instance detailsDefined in GHC.Enum Methods Since: base-2.1 Instance detailsDefined in GHC.Enum Methods Since: base-4.10.0.0 Instance detailsDefined in GHC.Enum Methods Since: base-4.10.0.0 Instance detailsDefined in GHC.Enum Methods Bounded () Since: base-2.1 Instance detailsDefined in GHC.Enum MethodsminBound :: () #maxBound :: () # Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods Bounded UTF32_Invalid Instance detailsDefined in Basement.String.Encoding.UTF32 MethodsminBound :: UTF32_Invalid #maxBound :: UTF32_Invalid # Instance detailsDefined in Basement.String Methods Instance detailsDefined in Data.IP.Addr Methods Instance detailsDefined in Data.IP.Addr Methods Instance detailsDefined in Database.Persist.Types.Base Methods Instance detailsDefined in Text.Shakespeare Methods Instance detailsDefined in Codec.Compression.Zlib.Stream Methods Instance detailsDefined in Codec.Compression.Zlib.Stream Methods Instance detailsDefined in Codec.Compression.Zlib.Stream Methods Bounded a => Bounded (Solo a) Instance detailsDefined in Data.Tuple.Solo Methods SizeValid n => Bounded (Bits n) Instance detailsDefined in Basement.Bits Methods (Bounded a, Bounded b) => Bounded (a, b) Since: base-2.1 Instance detailsDefined in GHC.Enum MethodsminBound :: (a, b) #maxBound :: (a, b) # (Bounded a, Bounded b) => Bounded (Pair a b) Instance detailsDefined in Data.Strict.Tuple MethodsminBound :: Pair a b #maxBound :: Pair a b # (Bounded a, Bounded b, Bounded c) => Bounded (a, b, c) Since: base-2.1 Instance detailsDefined in GHC.Enum MethodsminBound :: (a, b, c) #maxBound :: (a, b, c) # Bounded b => Bounded (Tagged s b) Instance detailsDefined in Data.Tagged MethodsminBound :: Tagged s b #maxBound :: Tagged s b # (Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (a, b, c, d) Since: base-2.1 Instance detailsDefined in GHC.Enum MethodsminBound :: (a, b, c, d) #maxBound :: (a, b, c, d) # (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (a, b, c, d, e) Since: base-2.1 Instance detailsDefined in GHC.Enum MethodsminBound :: (a, b, c, d, e) #maxBound :: (a, b, c, d, e) # (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f) => Bounded (a, b, c, d, e, f) Since: base-2.1 Instance detailsDefined in GHC.Enum MethodsminBound :: (a, b, c, d, e, f) #maxBound :: (a, b, c, d, e, f) # (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 detailsDefined in GHC.Enum MethodsminBound :: (a, b, c, d, e, f, g) #maxBound :: (a, b, c, d, e, f, g) # (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 detailsDefined in GHC.Enum MethodsminBound :: (a, b, c, d, e, f, g, h) #maxBound :: (a, b, c, d, e, f, g, h) # (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 detailsDefined in GHC.Enum MethodsminBound :: (a, b, c, d, e, f, g, h, i) #maxBound :: (a, b, c, d, e, f, g, h, i) # (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 detailsDefined in GHC.Enum MethodsminBound :: (a, b, c, d, e, f, g, h, i, j) #maxBound :: (a, b, c, d, e, f, g, h, i, j) # (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 detailsDefined in GHC.Enum MethodsminBound :: (a, b, c, d, e, f, g, h, i, j, k) #maxBound :: (a, b, c, d, e, f, g, h, i, j, k) # (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 detailsDefined in GHC.Enum MethodsminBound :: (a, b, c, d, e, f, g, h, i, j, k, l) #maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l) # (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 detailsDefined in GHC.Enum MethodsminBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m) #maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m) # (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 detailsDefined in GHC.Enum MethodsminBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) #maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # (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 detailsDefined in GHC.Enum MethodsminBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # class Enum a where # 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 Methods succ :: a -> a # the successor of a value. For numeric types, succ adds 1. pred :: a -> a # the predecessor of a value. For numeric types, pred subtracts 1. toEnum :: Int -> a # Convert from an Int. fromEnum :: a -> Int # 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] # Used in Haskell's translation of [n..] with [n..] = enumFrom n, a possible implementation being enumFrom n = n : enumFrom (succ n). For example: • enumFrom 4 :: [Integer] = [4,5,6,7,...] • enumFrom 6 :: [Int] = [6,7,8,9,...,maxBound :: Int] enumFromThen :: a -> a -> [a] # 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 For example: • enumFromThen 4 6 :: [Integer] = [4,6,8,10...] • enumFromThen 6 2 :: [Int] = [6,2,-2,-6,...,minBound :: Int] enumFromTo :: a -> a -> [a] # 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 = []. For example: • enumFromTo 6 10 :: [Int] = [6,7,8,9,10] • enumFromTo 42 1 :: [Integer] = [] enumFromThenTo :: a -> a -> a -> [a] # 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 = [] For example: • enumFromThenTo 4 2 -6 :: [Integer] = [4,2,0,-2,-4,-6] • enumFromThenTo 6 8 2 :: [Int] = [] #### Instances Instances details  Since: base-2.1 Instance detailsDefined in GHC.Enum Methodssucc :: Bool -> Bool #pred :: Bool -> Bool #toEnum :: Int -> Bool #fromEnum :: Bool -> Int #enumFrom :: Bool -> [Bool] #enumFromThen :: Bool -> Bool -> [Bool] #enumFromTo :: Bool -> Bool -> [Bool] #enumFromThenTo :: Bool -> Bool -> Bool -> [Bool] # Since: base-2.1 Instance detailsDefined in GHC.Enum Methodssucc :: Char -> Char #pred :: Char -> Char #toEnum :: Int -> Char #fromEnum :: Char -> Int #enumFrom :: Char -> [Char] #enumFromThen :: Char -> Char -> [Char] #enumFromTo :: Char -> Char -> [Char] #enumFromThenTo :: Char -> Char -> Char -> [Char] # Since: base-2.1 Instance detailsDefined in GHC.Enum Methodssucc :: Int -> Int #pred :: Int -> Int #toEnum :: Int -> Int #fromEnum :: Int -> Int #enumFrom :: Int -> [Int] #enumFromThen :: Int -> Int -> [Int] #enumFromTo :: Int -> Int -> [Int] #enumFromThenTo :: Int -> Int -> Int -> [Int] # Since: base-2.1 Instance detailsDefined in GHC.Enum MethodsenumFrom :: Integer -> [Integer] #enumFromThen :: Integer -> Integer -> [Integer] #enumFromTo :: Integer -> Integer -> [Integer] #enumFromThenTo :: Integer -> Integer -> Integer -> [Integer] # Since: base-4.8.0.0 Instance detailsDefined in GHC.Enum MethodsenumFrom :: Natural -> [Natural] #enumFromThen :: Natural -> Natural -> [Natural] #enumFromTo :: Natural -> Natural -> [Natural] #enumFromThenTo :: Natural -> Natural -> Natural -> [Natural] # Since: base-2.1 Instance detailsDefined in GHC.Enum MethodsenumFrom :: Ordering -> [Ordering] #enumFromTo :: Ordering -> Ordering -> [Ordering] # Since: base-2.1 Instance detailsDefined in GHC.Enum Methodssucc :: Word -> Word #pred :: Word -> Word #toEnum :: Int -> Word #fromEnum :: Word -> Int #enumFrom :: Word -> [Word] #enumFromThen :: Word -> Word -> [Word] #enumFromTo :: Word -> Word -> [Word] #enumFromThenTo :: Word -> Word -> Word -> [Word] # Since: base-4.10.0.0 Instance detailsDefined in GHC.Enum MethodsenumFrom :: VecCount -> [VecCount] #enumFromTo :: VecCount -> VecCount -> [VecCount] # Since: base-4.10.0.0 Instance detailsDefined in GHC.Enum MethodsenumFrom :: VecElem -> [VecElem] #enumFromThen :: VecElem -> VecElem -> [VecElem] #enumFromTo :: VecElem -> VecElem -> [VecElem] #enumFromThenTo :: VecElem -> VecElem -> VecElem -> [VecElem] # Enum () Since: base-2.1 Instance detailsDefined in GHC.Enum Methodssucc :: () -> () #pred :: () -> () #toEnum :: Int -> () #fromEnum :: () -> Int #enumFrom :: () -> [()] #enumFromThen :: () -> () -> [()] #enumFromTo :: () -> () -> [()] #enumFromThenTo :: () -> () -> () -> [()] # Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods Enum UTF32_Invalid Instance detailsDefined in Basement.String.Encoding.UTF32 Methodssucc :: UTF32_Invalid -> UTF32_Invalid #pred :: UTF32_Invalid -> UTF32_Invalid #toEnum :: Int -> UTF32_Invalid #fromEnum :: UTF32_Invalid -> Int #enumFrom :: UTF32_Invalid -> [UTF32_Invalid] #enumFromThen :: UTF32_Invalid -> UTF32_Invalid -> [UTF32_Invalid] #enumFromTo :: UTF32_Invalid -> UTF32_Invalid -> [UTF32_Invalid] #enumFromThenTo :: UTF32_Invalid -> UTF32_Invalid -> UTF32_Invalid -> [UTF32_Invalid] # Instance detailsDefined in Basement.String MethodsenumFrom :: Encoding -> [Encoding] #enumFromTo :: Encoding -> Encoding -> [Encoding] # Instance detailsDefined in Crypto.Error.Types Methods Instance detailsDefined in Data.IP.Addr Methodssucc :: IP -> IP #pred :: IP -> IP #toEnum :: Int -> IP #fromEnum :: IP -> Int #enumFrom :: IP -> [IP] #enumFromThen :: IP -> IP -> [IP] #enumFromTo :: IP -> IP -> [IP] #enumFromThenTo :: IP -> IP -> IP -> [IP] # Instance detailsDefined in Data.IP.Addr Methodssucc :: IPv4 -> IPv4 #pred :: IPv4 -> IPv4 #toEnum :: Int -> IPv4 #fromEnum :: IPv4 -> Int #enumFrom :: IPv4 -> [IPv4] #enumFromThen :: IPv4 -> IPv4 -> [IPv4] #enumFromTo :: IPv4 -> IPv4 -> [IPv4] #enumFromThenTo :: IPv4 -> IPv4 -> IPv4 -> [IPv4] # Instance detailsDefined in Data.IP.Addr Methodssucc :: IPv6 -> IPv6 #pred :: IPv6 -> IPv6 #toEnum :: Int -> IPv6 #fromEnum :: IPv6 -> Int #enumFrom :: IPv6 -> [IPv6] #enumFromThen :: IPv6 -> IPv6 -> [IPv6] #enumFromTo :: IPv6 -> IPv6 -> [IPv6] #enumFromThenTo :: IPv6 -> IPv6 -> IPv6 -> [IPv6] # Instance detailsDefined in Database.Persist.Types.Base MethodsenumFrom :: Checkmark -> [Checkmark] # Instance detailsDefined in Text.Shakespeare MethodsenumFrom :: VarType -> [VarType] #enumFromThen :: VarType -> VarType -> [VarType] #enumFromTo :: VarType -> VarType -> [VarType] #enumFromThenTo :: VarType -> VarType -> VarType -> [VarType] # Instance detailsDefined in Data.Time.Calendar.Days Methodssucc :: Day -> Day #pred :: Day -> Day #toEnum :: Int -> Day #fromEnum :: Day -> Int #enumFrom :: Day -> [Day] #enumFromThen :: Day -> Day -> [Day] #enumFromTo :: Day -> Day -> [Day] #enumFromThenTo :: Day -> Day -> Day -> [Day] # Instance detailsDefined in Codec.Compression.Zlib.Stream MethodstoEnum :: Int -> Format #enumFrom :: Format -> [Format] #enumFromThen :: Format -> Format -> [Format] #enumFromTo :: Format -> Format -> [Format] #enumFromThenTo :: Format -> Format -> Format -> [Format] # Instance detailsDefined in Codec.Compression.Zlib.Stream MethodstoEnum :: Int -> Method #enumFrom :: Method -> [Method] #enumFromThen :: Method -> Method -> [Method] #enumFromTo :: Method -> Method -> [Method] #enumFromThenTo :: Method -> Method -> Method -> [Method] # Instance detailsDefined in Codec.Compression.Zlib.Stream Source # Instance detailsDefined in Yesod.Paginator.Pages Methods Source # Instance detailsDefined in Yesod.Paginator.Pages MethodsenumFrom :: PerPage -> [PerPage] #enumFromThen :: PerPage -> PerPage -> [PerPage] #enumFromTo :: PerPage -> PerPage -> [PerPage] #enumFromThenTo :: PerPage -> PerPage -> PerPage -> [PerPage] # Source # Instance detailsDefined in Yesod.Paginator.Pages Methods Integral a => Enum (Ratio a) Since: base-2.0.1 Instance detailsDefined in GHC.Real Methodssucc :: Ratio a -> Ratio a #pred :: Ratio a -> Ratio a #toEnum :: Int -> Ratio a #fromEnum :: Ratio a -> Int #enumFrom :: Ratio a -> [Ratio a] #enumFromThen :: Ratio a -> Ratio a -> [Ratio a] #enumFromTo :: Ratio a -> Ratio a -> [Ratio a] #enumFromThenTo :: Ratio a -> Ratio a -> Ratio a -> [Ratio a] # Enum a => Enum (Solo a) Instance detailsDefined in Data.Tuple.Solo Methodssucc :: Solo a -> Solo a #pred :: Solo a -> Solo a #toEnum :: Int -> Solo a #fromEnum :: Solo a -> Int #enumFrom :: Solo a -> [Solo a] #enumFromThen :: Solo a -> Solo a -> [Solo a] #enumFromTo :: Solo a -> Solo a -> [Solo a] #enumFromThenTo :: Solo a -> Solo a -> Solo a -> [Solo a] # SizeValid n => Enum (Bits n) Instance detailsDefined in Basement.Bits Methodssucc :: Bits n -> Bits n #pred :: Bits n -> Bits n #toEnum :: Int -> Bits n #fromEnum :: Bits n -> Int #enumFrom :: Bits n -> [Bits n] #enumFromThen :: Bits n -> Bits n -> [Bits n] #enumFromTo :: Bits n -> Bits n -> [Bits n] #enumFromThenTo :: Bits n -> Bits n -> Bits n -> [Bits n] # Enum (Offset ty) Instance detailsDefined in Basement.Types.OffsetSize Methodssucc :: Offset ty -> Offset ty #pred :: Offset ty -> Offset ty #toEnum :: Int -> Offset ty #fromEnum :: Offset ty -> Int #enumFrom :: Offset ty -> [Offset ty] #enumFromThen :: Offset ty -> Offset ty -> [Offset ty] #enumFromTo :: Offset ty -> Offset ty -> [Offset ty] #enumFromThenTo :: Offset ty -> Offset ty -> Offset ty -> [Offset ty] # Enum (CountOf ty) Instance detailsDefined in Basement.Types.OffsetSize Methodssucc :: CountOf ty -> CountOf ty #pred :: CountOf ty -> CountOf ty #toEnum :: Int -> CountOf ty #fromEnum :: CountOf ty -> Int #enumFrom :: CountOf ty -> [CountOf ty] #enumFromThen :: CountOf ty -> CountOf ty -> [CountOf ty] #enumFromTo :: CountOf ty -> CountOf ty -> [CountOf ty] #enumFromThenTo :: CountOf ty -> CountOf ty -> CountOf ty -> [CountOf ty] # Enum a => Enum (Tagged s a) Instance detailsDefined in Data.Tagged Methodssucc :: Tagged s a -> Tagged s a #pred :: Tagged s a -> Tagged s a #toEnum :: Int -> Tagged s a #fromEnum :: Tagged s a -> Int #enumFrom :: Tagged s a -> [Tagged s a] #enumFromThen :: Tagged s a -> Tagged s a -> [Tagged s a] #enumFromTo :: Tagged s a -> Tagged s a -> [Tagged s a] #enumFromThenTo :: Tagged s a -> Tagged s a -> Tagged s a -> [Tagged s a] # class Eq a where # 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, == is customarily expected to implement an equivalence relationship where two values comparing equal are indistinguishable by "public" functions, with a "public" function being one not allowing to see implementation details. For example, for a type representing non-normalised natural numbers modulo 100, a "public" function doesn't make the difference between 1 and 201. It is expected to have the following properties: Reflexivity x == x = True Symmetry x == y = y == x Transitivity if x == y && y == z = True, then x == z = True Substitutivity if x == y = True and f is a "public" function whose return type is an instance of Eq, then f x == f y = True Negation x /= y = not (x == y) Minimal complete definition: either == or /=. Minimal complete definition Methods (==) :: a -> a -> Bool infix 4 # (/=) :: a -> a -> Bool infix 4 # #### Instances Instances details  Instance detailsDefined in GHC.Classes Methods(==) :: Bool -> Bool -> Bool #(/=) :: Bool -> Bool -> Bool # Instance detailsDefined in GHC.Classes Methods(==) :: Char -> Char -> Bool #(/=) :: Char -> Char -> Bool # 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 detailsDefined in GHC.Classes Methods(==) :: Double -> Double -> Bool #(/=) :: Double -> Double -> Bool # 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 substitutivity:>>> 0 == (-0 :: Float) True >>> recip 0 == recip (-0 :: Float) False  Instance detailsDefined in GHC.Classes Methods(==) :: Float -> Float -> Bool #(/=) :: Float -> Float -> Bool # Instance detailsDefined in GHC.Classes Methods(==) :: Int -> Int -> Bool #(/=) :: Int -> Int -> Bool # Instance detailsDefined in GHC.Integer.Type Methods(==) :: Integer -> Integer -> Bool #(/=) :: Integer -> Integer -> Bool # Since: base-4.8.0.0 Instance detailsDefined in GHC.Natural Methods(==) :: Natural -> Natural -> Bool #(/=) :: Natural -> Natural -> Bool # Instance detailsDefined in GHC.Classes Methods Instance detailsDefined in GHC.Classes Methods(==) :: Word -> Word -> Bool #(/=) :: Word -> Word -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Exp -> Exp -> Bool #(/=) :: Exp -> Exp -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Match -> Match -> Bool #(/=) :: Match -> Match -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Clause -> Clause -> Bool #(/=) :: Clause -> Clause -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Pat -> Pat -> Bool #(/=) :: Pat -> Pat -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Type -> Type -> Bool #(/=) :: Type -> Type -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Dec -> Dec -> Bool #(/=) :: Dec -> Dec -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Name -> Name -> Bool #(/=) :: Name -> Name -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: FunDep -> FunDep -> Bool #(/=) :: FunDep -> FunDep -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Overlap -> Overlap -> Bool #(/=) :: Overlap -> Overlap -> Bool # Eq () Instance detailsDefined in GHC.Classes Methods(==) :: () -> () -> Bool #(/=) :: () -> () -> Bool # Instance detailsDefined in GHC.Classes Methods(==) :: TyCon -> TyCon -> Bool #(/=) :: TyCon -> TyCon -> Bool # Instance detailsDefined in GHC.Classes Methods(==) :: Module -> Module -> Bool #(/=) :: Module -> Module -> Bool # Instance detailsDefined in GHC.Classes Methods(==) :: TrName -> TrName -> Bool #(/=) :: TrName -> TrName -> Bool # Since: base-2.1 Instance detailsDefined in Data.Version Methods(==) :: Version -> Version -> Bool #(/=) :: Version -> Version -> Bool # Instance detailsDefined in System.Random.Internal Methods(==) :: StdGen -> StdGen -> Bool #(/=) :: StdGen -> StdGen -> Bool # Scientific numbers can be safely compared for equality. No magnitude 10^e is calculated so there's no risk of a blowup in space or time when comparing scientific numbers coming from untrusted sources. Instance detailsDefined in Data.Scientific Methods Instance detailsDefined in Data.Time.Clock.Internal.UTCTime Methods(==) :: UTCTime -> UTCTime -> Bool #(/=) :: UTCTime -> UTCTime -> Bool # Instance detailsDefined in Data.Aeson.Types.Internal Methods Instance detailsDefined in Data.Aeson.Types.Internal Methods(==) :: Value -> Value -> Bool #(/=) :: Value -> Value -> Bool # Instance detailsDefined in Data.Aeson.Types.Internal Methods Instance detailsDefined in Data.Aeson.Types.Internal Methods Instance detailsDefined in Data.Attoparsec.Internal.Types Methods(==) :: Pos -> Pos -> Bool #(/=) :: Pos -> Pos -> Bool # Instance detailsDefined in Data.Attoparsec.Internal.Types Methods(==) :: More -> More -> Bool #(/=) :: More -> More -> Bool # Since: base-4.3.0.0 Instance detailsDefined in GHC.Exts Methods Since: base-4.2.0.0 Instance detailsDefined in GHC.IO.Exception Methods Since: base-4.2.0.0 Instance detailsDefined in GHC.IO.Exception Methods Instance detailsDefined in GHC.IO.Exception Methods Since: base-4.1.0.0 Instance detailsDefined in GHC.IO.Exception Methods Since: base-4.3.0.0 Instance detailsDefined in GHC.IO Methods Since: base-4.1.0.0 Instance detailsDefined in GHC.IO.Exception Methods Since: base-3.0 Instance detailsDefined in GHC.Exception.Type Methods Since: base-4.6.0.0 Instance detailsDefined in GHC.Generics Methods(==) :: Fixity -> Fixity -> Bool #(/=) :: Fixity -> Fixity -> Bool # Since: base-4.6.0.0 Instance detailsDefined in GHC.Generics Methods Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods Since: base-4.9.0.0 Instance detailsDefined in GHC.Stack.Types Methods(==) :: SrcLoc -> SrcLoc -> Bool #(/=) :: SrcLoc -> SrcLoc -> Bool # Eq ASCII7_Invalid Instance detailsDefined in Basement.String.Encoding.ASCII7 Methods(==) :: ASCII7_Invalid -> ASCII7_Invalid -> Bool #(/=) :: ASCII7_Invalid -> ASCII7_Invalid -> Bool # Eq ISO_8859_1_Invalid Instance detailsDefined in Basement.String.Encoding.ISO_8859_1 Methods(==) :: ISO_8859_1_Invalid -> ISO_8859_1_Invalid -> Bool #(/=) :: ISO_8859_1_Invalid -> ISO_8859_1_Invalid -> Bool # Eq UTF16_Invalid Instance detailsDefined in Basement.String.Encoding.UTF16 Methods(==) :: UTF16_Invalid -> UTF16_Invalid -> Bool #(/=) :: UTF16_Invalid -> UTF16_Invalid -> Bool # Eq UTF32_Invalid Instance detailsDefined in Basement.String.Encoding.UTF32 Methods(==) :: UTF32_Invalid -> UTF32_Invalid -> Bool #(/=) :: UTF32_Invalid -> UTF32_Invalid -> Bool # Instance detailsDefined in Basement.String Methods Instance detailsDefined in Basement.UTF8.Base Methods(==) :: String -> String -> Bool #(/=) :: String -> String -> Bool # Instance detailsDefined in Basement.Types.OffsetSize Methods Instance detailsDefined in Codec.Compression.Zlib.Stream Methods Instance detailsDefined in Crypto.Error.Types Methods Instance detailsDefined in GHC.Integer.Type Methods(==) :: BigNat -> BigNat -> Bool #(/=) :: BigNat -> BigNat -> Bool # Instance detailsDefined in Data.IP.Range Methods(==) :: IPRange -> IPRange -> Bool #(/=) :: IPRange -> IPRange -> Bool # Equality over IP addresses. Correctly compare IPv4 and IPv4-embedded-in-IPv6 addresses.>>> (read "2001:db8:00:00:00:00:00:01" :: IP) == (read "2001:db8:00:00:00:00:00:01" :: IP) True >>> (read "2001:db8:00:00:00:00:00:01" :: IP) == (read "2001:db8:00:00:00:00:00:05" :: IP) False >>> (read "127.0.0.1" :: IP) == (read "127.0.0.1" :: IP) True >>> (read "127.0.0.1" :: IP) == (read "10.0.0.1" :: IP) False >>> (read "::ffff:127.0.0.1" :: IP) == (read "127.0.0.1" :: IP) True >>> (read "::ffff:127.0.0.1" :: IP) == (read "127.0.0.9" :: IP) False >>> (read "::ffff:127.0.0.1" :: IP) >= (read "127.0.0.1" :: IP) True >>> (read "::ffff:127.0.0.1" :: IP) <= (read "127.0.0.1" :: IP) True  Instance detailsDefined in Data.IP.Addr Methods(==) :: IP -> IP -> Bool #(/=) :: IP -> IP -> Bool # Instance detailsDefined in Data.IP.Addr Methods(==) :: IPv4 -> IPv4 -> Bool #(/=) :: IPv4 -> IPv4 -> Bool # Instance detailsDefined in Data.IP.Addr Methods(==) :: IPv6 -> IPv6 -> Bool #(/=) :: IPv6 -> IPv6 -> Bool # Instance detailsDefined in Control.Monad.Logger Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Loc -> Loc -> Bool #(/=) :: Loc -> Loc -> Bool # Instance detailsDefined in Network.Socket.Info Methods Instance detailsDefined in Network.Socket.Info Methods Instance detailsDefined in Network.Socket.Info Methods Instance detailsDefined in Network.URI Methods(==) :: URI -> URI -> Bool #(/=) :: URI -> URI -> Bool # Instance detailsDefined in Network.URI Methods(==) :: URIAuth -> URIAuth -> Bool #(/=) :: URIAuth -> URIAuth -> Bool # Eq SelfEmbed Instance detailsDefined in Database.Persist.Types.Base Methods(==) :: SelfEmbed -> SelfEmbed -> Bool #(/=) :: SelfEmbed -> SelfEmbed -> Bool # Instance detailsDefined in Database.Persist.Class.PersistField Methods Instance detailsDefined in Database.Persist.Types.Base Methods Instance detailsDefined in Database.Persist.Types.Base Methods Instance detailsDefined in Database.Persist.Types.Base Methods Instance detailsDefined in Database.Persist.Types.Base Methods Instance detailsDefined in Database.Persist.Types.Base Methods Instance detailsDefined in Database.Persist.Types.Base Methods Instance detailsDefined in Database.Persist.Types.Base Methods Instance detailsDefined in Database.Persist.Types.Base Methods Instance detailsDefined in Database.Persist.Types.Base Methods Instance detailsDefined in Database.Persist.Types.Base Methods Instance detailsDefined in Database.Persist.Types.Base Methods Instance detailsDefined in Database.Persist.Types.Base Methods Instance detailsDefined in Database.Persist.Types.Base Methods Instance detailsDefined in Database.Persist.Types.Base Methods Instance detailsDefined in Database.Persist.Types.Base Methods Instance detailsDefined in Database.Persist.Types.Base Methods(==) :: SqlType -> SqlType -> Bool #(/=) :: SqlType -> SqlType -> Bool # Instance detailsDefined in Database.Persist.Types.Base Methods Instance detailsDefined in Database.Persist.PersistValue Methods Instance detailsDefined in Database.Persist.PersistValue Methods Instance detailsDefined in Database.Persist.Names Methods Instance detailsDefined in Database.Persist.Names Methods Instance detailsDefined in Database.Persist.Names Methods Instance detailsDefined in Database.Persist.Names Methods Instance detailsDefined in Database.Persist.Names Methods Instance detailsDefined in Database.Persist.Names Methods Instance detailsDefined in Text.PrettyPrint.HughesPJ Methods(==) :: Doc -> Doc -> Bool #(/=) :: Doc -> Doc -> Bool # Instance detailsDefined in Text.PrettyPrint.Annotated.HughesPJ Methods Instance detailsDefined in Text.PrettyPrint.Annotated.HughesPJ Methods(==) :: Style -> Style -> Bool #(/=) :: Style -> Style -> Bool # Instance detailsDefined in Text.PrettyPrint.Annotated.HughesPJ Methods(==) :: Mode -> Mode -> Bool #(/=) :: Mode -> Mode -> Bool # Since: primitive-0.6.3.0 Instance detailsDefined in Data.Primitive.ByteArray Methods Eq Content Instance detailsDefined in Text.Internal.Css Methods(==) :: Content -> Content -> Bool #(/=) :: Content -> Content -> Bool # Instance detailsDefined in Text.Shakespeare Methods(==) :: VarType -> VarType -> Bool #(/=) :: VarType -> VarType -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: ModName -> ModName -> Bool #(/=) :: ModName -> ModName -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: PkgName -> PkgName -> Bool #(/=) :: PkgName -> PkgName -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Module -> Module -> Bool #(/=) :: Module -> Module -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: OccName -> OccName -> Bool #(/=) :: OccName -> OccName -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Info -> Info -> Bool #(/=) :: Info -> Info -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Fixity -> Fixity -> Bool #(/=) :: Fixity -> Fixity -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Lit -> Lit -> Bool #(/=) :: Lit -> Lit -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Bytes -> Bytes -> Bool #(/=) :: Bytes -> Bytes -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Body -> Body -> Bool #(/=) :: Body -> Body -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Guard -> Guard -> Bool #(/=) :: Guard -> Guard -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Stmt -> Stmt -> Bool #(/=) :: Stmt -> Stmt -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Range -> Range -> Bool #(/=) :: Range -> Range -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Foreign -> Foreign -> Bool #(/=) :: Foreign -> Foreign -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Safety -> Safety -> Bool #(/=) :: Safety -> Safety -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Pragma -> Pragma -> Bool #(/=) :: Pragma -> Pragma -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Inline -> Inline -> Bool #(/=) :: Inline -> Inline -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Phases -> Phases -> Bool #(/=) :: Phases -> Phases -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Con -> Con -> Bool #(/=) :: Con -> Con -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Bang -> Bang -> Bool #(/=) :: Bang -> Bang -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: TyLit -> TyLit -> Bool #(/=) :: TyLit -> TyLit -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(==) :: Role -> Role -> Bool #(/=) :: Role -> Role -> Bool # Instance detailsDefined in Language.Haskell.TH.Syntax Methods Instance detailsDefined in Data.Text.Short.Internal Methods Instance detailsDefined in Language.Haskell.TH.Datatype Methods Instance detailsDefined in Language.Haskell.TH.Datatype Methods Instance detailsDefined in Language.Haskell.TH.Datatype Methods Instance detailsDefined in Language.Haskell.TH.Datatype Methods Instance detailsDefined in Language.Haskell.TH.Datatype Methods Instance detailsDefined in Language.Haskell.TH.Datatype Methods Instance detailsDefined in Language.Haskell.TH.Datatype Methods Instance detailsDefined in Language.Haskell.TH.Datatype.TyVarBndr Methods Instance detailsDefined in Data.Time.LocalTime.Internal.LocalTime Methods Instance detailsDefined in Data.Time.Clock.Internal.UniversalTime Methods Instance detailsDefined in Data.Time.Calendar.Days Methods(==) :: Day -> Day -> Bool #(/=) :: Day -> Day -> Bool # Instance detailsDefined in UnliftIO.Internals.Async Methods Eq UnpackedUUID Instance detailsDefined in Data.UUID.Types.Internal Methods(==) :: UnpackedUUID -> UnpackedUUID -> Bool #(/=) :: UnpackedUUID -> UnpackedUUID -> Bool # Instance detailsDefined in Data.UUID.Types.Internal Methods(==) :: UUID -> UUID -> Bool #(/=) :: UUID -> UUID -> Bool # Instance detailsDefined in Yesod.Core.Types Methods Instance detailsDefined in Yesod.Core.Types Methods Instance detailsDefined in Yesod.Core.Types Methods Instance detailsDefined in Yesod.Core.Types Methods(==) :: Header -> Header -> Bool #(/=) :: Header -> Header -> Bool # Eq DictionaryHash Instance detailsDefined in Codec.Compression.Zlib.Stream Methods(==) :: DictionaryHash -> DictionaryHash -> Bool #(/=) :: DictionaryHash -> DictionaryHash -> Bool # Instance detailsDefined in Codec.Compression.Zlib.Stream Methods(==) :: Format -> Format -> Bool #(/=) :: Format -> Format -> Bool # Instance detailsDefined in Codec.Compression.Zlib.Stream Methods(==) :: Method -> Method -> Bool #(/=) :: Method -> Method -> Bool # Instance detailsDefined in Codec.Compression.Zlib.Stream Methods Instance detailsDefined in Codec.Compression.Zlib.Stream Methods Instance detailsDefined in Codec.Compression.Zlib.Stream Methods Source # Instance detailsDefined in Yesod.Paginator.Pages Methods Source # Instance detailsDefined in Yesod.Paginator.Pages Methods(==) :: PerPage -> PerPage -> Bool #(/=) :: PerPage -> PerPage -> Bool # Source # Instance detailsDefined in Yesod.Paginator.Pages Methods Source # Instance detailsDefined in Yesod.Paginator.PaginationConfig Methods Eq Content Instance detailsDefined in Text.Shakespeare Methods(==) :: Content -> Content -> Bool #(/=) :: Content -> Content -> Bool # Eq Etag Instance detailsDefined in Yesod.Core.Handler Methods(==) :: Etag -> Etag -> Bool #(/=) :: Etag -> Etag -> Bool # Eq B Instance detailsDefined in Data.Text.Short.Internal Methods(==) :: B -> B -> Bool #(/=) :: B -> B -> Bool # Eq a => Eq [a] Instance detailsDefined in GHC.Classes Methods(==) :: [a] -> [a] -> Bool #(/=) :: [a] -> [a] -> Bool # Eq a => Eq (Maybe a) Since: base-2.1 Instance detailsDefined in GHC.Maybe Methods(==) :: Maybe a -> Maybe a -> Bool #(/=) :: Maybe a -> Maybe a -> Bool # Eq a => Eq (Ratio a) Since: base-2.1 Instance detailsDefined in GHC.Real Methods(==) :: Ratio a -> Ratio a -> Bool #(/=) :: Ratio a -> Ratio a -> Bool # Eq p => Eq (Par1 p) Since: base-4.7.0.0 Instance detailsDefined in GHC.Generics Methods(==) :: Par1 p -> Par1 p -> Bool #(/=) :: Par1 p -> Par1 p -> Bool # Eq a => Eq (Solo a) Instance detailsDefined in Data.Tuple.Solo Methods(==) :: Solo a -> Solo a -> Bool #(/=) :: Solo a -> Solo a -> Bool # Eq a => Eq (IResult a) Instance detailsDefined in Data.Aeson.Types.Internal Methods(==) :: IResult a -> IResult a -> Bool #(/=) :: IResult a -> IResult a -> Bool # Eq a => Eq (Result a) Instance detailsDefined in Data.Aeson.Types.Internal Methods(==) :: Result a -> Result a -> Bool #(/=) :: Result a -> Result a -> Bool # Eq v => Eq (KeyMap v) Instance detailsDefined in Data.Aeson.KeyMap Methods(==) :: KeyMap v -> KeyMap v -> Bool #(/=) :: KeyMap v -> KeyMap v -> Bool # Eq a => Eq (NonEmpty a) Since: base-4.9.0.0 Instance detailsDefined in GHC.Base Methods(==) :: NonEmpty a -> NonEmpty a -> Bool #(/=) :: NonEmpty a -> NonEmpty a -> Bool # (PrimType ty, Eq ty) => Eq (UArray ty) Instance detailsDefined in Basement.UArray.Base Methods(==) :: UArray ty -> UArray ty -> Bool #(/=) :: UArray ty -> UArray ty -> Bool # Eq (Bits n) Instance detailsDefined in Basement.Bits Methods(==) :: Bits n -> Bits n -> Bool #(/=) :: Bits n -> Bits n -> Bool # (PrimType ty, Eq ty) => Eq (Block ty) Instance detailsDefined in Basement.Block.Base Methods(==) :: Block ty -> Block ty -> Bool #(/=) :: Block ty -> Block ty -> Bool # Eq a => Eq (NonEmpty a) Instance detailsDefined in Basement.NonEmpty Methods(==) :: NonEmpty a -> NonEmpty a -> Bool #(/=) :: NonEmpty a -> NonEmpty a -> Bool # Eq (Offset ty) Instance detailsDefined in Basement.Types.OffsetSize Methods(==) :: Offset ty -> Offset ty -> Bool #(/=) :: Offset ty -> Offset ty -> Bool # Eq (CountOf ty) Instance detailsDefined in Basement.Types.OffsetSize Methods(==) :: CountOf ty -> CountOf ty -> Bool #(/=) :: CountOf ty -> CountOf ty -> Bool # Eq (Zn64 n) Instance detailsDefined in Basement.Bounded Methods(==) :: Zn64 n -> Zn64 n -> Bool #(/=) :: Zn64 n -> Zn64 n -> Bool # Eq (Zn n) Instance detailsDefined in Basement.Bounded Methods(==) :: Zn n -> Zn n -> Bool #(/=) :: Zn n -> Zn n -> Bool # Eq a => Eq (Flush a) Instance detailsDefined in Data.Conduit.Internal.Conduit Methods(==) :: Flush a -> Flush a -> Bool #(/=) :: Flush a -> Flush a -> Bool # Eq a => Eq (CryptoFailable a) Instance detailsDefined in Crypto.Error.Types Methods(==) :: CryptoFailable a -> CryptoFailable a -> Bool #(/=) :: CryptoFailable a -> CryptoFailable a -> Bool # Eq1 f => Eq (Fix f) Instance detailsDefined in Data.Fix Methods(==) :: Fix f -> Fix f -> Bool #(/=) :: Fix f -> Fix f -> Bool # (Functor f, Eq1 f) => Eq (Mu f) Instance detailsDefined in Data.Fix Methods(==) :: Mu f -> Mu f -> Bool #(/=) :: Mu f -> Mu f -> Bool # (Functor f, Eq1 f) => Eq (Nu f) Instance detailsDefined in Data.Fix Methods(==) :: Nu f -> Nu f -> Bool #(/=) :: Nu f -> Nu f -> Bool # Eq a => Eq (DNonEmpty a) Instance detailsDefined in Data.DList.DNonEmpty.Internal Methods(==) :: DNonEmpty a -> DNonEmpty a -> Bool #(/=) :: DNonEmpty a -> DNonEmpty a -> Bool # Eq a => Eq (DList a) Instance detailsDefined in Data.DList.Internal Methods(==) :: DList a -> DList a -> Bool #(/=) :: DList a -> DList a -> Bool # Eq a => Eq (Hashed a) Uses precomputed hash to detect inequality faster Instance detailsDefined in Data.Hashable.Class Methods(==) :: Hashed a -> Hashed a -> Bool #(/=) :: Hashed a -> Hashed a -> Bool # Eq a => Eq (AddrRange a) Instance detailsDefined in Data.IP.Range Methods(==) :: AddrRange a -> AddrRange a -> Bool #(/=) :: AddrRange a -> AddrRange a -> Bool # Eq mono => Eq (NonNull mono) Instance detailsDefined in Data.NonNull Methods(==) :: NonNull mono -> NonNull mono -> Bool #(/=) :: NonNull mono -> NonNull mono -> Bool # (Eq (Key record), Eq record) => Eq (Entity record) Instance detailsDefined in Database.Persist.Class.PersistEntity Methods(==) :: Entity record -> Entity record -> Bool #(/=) :: Entity record -> Entity record -> Bool # Eq (Doc a) Instance detailsDefined in Text.PrettyPrint.Annotated.HughesPJ Methods(==) :: Doc a -> Doc a -> Bool #(/=) :: Doc a -> Doc a -> Bool # Eq a => Eq (AnnotDetails a) Instance detailsDefined in Text.PrettyPrint.Annotated.HughesPJ Methods(==) :: AnnotDetails a -> AnnotDetails a -> Bool #(/=) :: AnnotDetails a -> AnnotDetails a -> Bool # Eq a => Eq (Span a) Instance detailsDefined in Text.PrettyPrint.Annotated.HughesPJ Methods(==) :: Span a -> Span a -> Bool #(/=) :: Span a -> Span a -> Bool # (Eq a, Prim a) => Eq (PrimArray a) Since: primitive-0.6.4.0 Instance detailsDefined in Data.Primitive.PrimArray Methods(==) :: PrimArray a -> PrimArray a -> Bool #(/=) :: PrimArray a -> PrimArray a -> Bool # Instance detailsDefined in Data.Primitive.ByteArray Methods Eq a => Eq (SmallArray a) Instance detailsDefined in Data.Primitive.SmallArray Methods(==) :: SmallArray a -> SmallArray a -> Bool #(/=) :: SmallArray a -> SmallArray a -> Bool # Eq a => Eq (Array a) Instance detailsDefined in Data.Primitive.Array Methods(==) :: Array a -> Array a -> Bool #(/=) :: Array a -> Array a -> Bool # Eq g => Eq (AtomicGen g) Instance detailsDefined in System.Random.Stateful Methods(==) :: AtomicGen g -> AtomicGen g -> Bool #(/=) :: AtomicGen g -> AtomicGen g -> Bool # Eq g => Eq (IOGen g) Instance detailsDefined in System.Random.Stateful Methods(==) :: IOGen g -> IOGen g -> Bool #(/=) :: IOGen g -> IOGen g -> Bool # Eq g => Eq (STGen g) Instance detailsDefined in System.Random.Stateful Methods(==) :: STGen g -> STGen g -> Bool #(/=) :: STGen g -> STGen g -> Bool # Eq g => Eq (TGen g) Instance detailsDefined in System.Random.Stateful Methods(==) :: TGen g -> TGen g -> Bool #(/=) :: TGen g -> TGen g -> Bool # Eq g => Eq (StateGen g) Instance detailsDefined in System.Random.Internal Methods(==) :: StateGen g -> StateGen g -> Bool #(/=) :: StateGen g -> StateGen g -> Bool # Eq a => Eq (Maybe a) Instance detailsDefined in Data.Strict.Maybe Methods(==) :: Maybe a -> Maybe a -> Bool #(/=) :: Maybe a -> Maybe a -> Bool # Eq a => Eq (HashSet a) Note that, in the presence of hash collisions, equal HashSets may behave differently, i.e. substitutivity 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 substitutivity can be observed with any function that depends on the key ordering, such as folds and traversals. Instance detailsDefined in Data.HashSet.Internal Methods(==) :: HashSet a -> HashSet a -> Bool #(/=) :: HashSet a -> HashSet a -> Bool # (Storable a, Eq a) => Eq (Vector a) Instance detailsDefined in Data.Vector.Storable Methods(==) :: Vector a -> Vector a -> Bool #(/=) :: Vector a -> Vector a -> Bool # (Prim a, Eq a) => Eq (Vector a) Instance detailsDefined in Data.Vector.Primitive Methods(==) :: Vector a -> Vector a -> Bool #(/=) :: Vector a -> Vector a -> Bool # Eq a => Eq (Vector a) Instance detailsDefined in Data.Vector Methods(==) :: Vector a -> Vector a -> Bool #(/=) :: Vector a -> Vector a -> Bool # Eq url => Eq (Location url) Instance detailsDefined in Yesod.Core.Types Methods(==) :: Location url -> Location url -> Bool #(/=) :: Location url -> Location url -> Bool # Eq url => Eq (Script url) Instance detailsDefined in Yesod.Core.Types Methods(==) :: Script url -> Script url -> Bool #(/=) :: Script url -> Script url -> Bool # Eq url => Eq (Stylesheet url) Instance detailsDefined in Yesod.Core.Types Methods(==) :: Stylesheet url -> Stylesheet url -> Bool #(/=) :: Stylesheet url -> Stylesheet url -> Bool # Instance detailsDefined in Yesod.Core.Internal.LiteApp Methods Instance detailsDefined in Yesod.Core.Types Methods Instance detailsDefined in Yesod.Core.Types Methods Eq a => Eq (Pages a) Source # Instance detailsDefined in Yesod.Paginator.Pages Methods(==) :: Pages a -> Pages a -> Bool #(/=) :: Pages a -> Pages a -> Bool # Eq a => Eq (Page a) Source # Instance detailsDefined in Yesod.Paginator.Pages Methods(==) :: Page a -> Page a -> Bool #(/=) :: Page a -> Page a -> Bool # (Eq a, Eq b) => Eq (Either a b) Since: base-2.1 Instance detailsDefined in Data.Either Methods(==) :: Either a b -> Either a b -> Bool #(/=) :: Either a b -> Either a b -> Bool # Eq (V1 p) Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods(==) :: V1 p -> V1 p -> Bool #(/=) :: V1 p -> V1 p -> Bool # Eq (U1 p) Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods(==) :: U1 p -> U1 p -> Bool #(/=) :: U1 p -> U1 p -> Bool # (Eq a, Eq b) => Eq (a, b) Instance detailsDefined in GHC.Classes Methods(==) :: (a, b) -> (a, b) -> Bool #(/=) :: (a, b) -> (a, b) -> Bool # (Eq k, Eq v) => Eq (HashMap k v) Note that, in the presence of hash collisions, equal HashMaps may behave differently, i.e. substitutivity 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 substitutivity can be observed with any function that depends on the key ordering, such as folds and traversals. Instance detailsDefined in Data.HashMap.Internal Methods(==) :: HashMap k v -> HashMap k v -> Bool #(/=) :: HashMap k v -> HashMap k v -> Bool # (Eq1 m, Eq a) => Eq (MaybeT m a) Instance detailsDefined in Control.Monad.Trans.Maybe Methods(==) :: MaybeT m a -> MaybeT m a -> Bool #(/=) :: MaybeT m a -> MaybeT m a -> Bool # (Eq1 m, Eq a) => Eq (ListT m a) Instance detailsDefined in Control.Monad.Trans.List Methods(==) :: ListT m a -> ListT m a -> Bool #(/=) :: ListT m a -> ListT m a -> Bool # Eq (MutablePrimArray s a) Instance detailsDefined in Data.Primitive.PrimArray Methods(==) :: MutablePrimArray s a -> MutablePrimArray s a -> Bool #(/=) :: MutablePrimArray s a -> MutablePrimArray s a -> Bool # Eq (SmallMutableArray s a) Instance detailsDefined in Data.Primitive.SmallArray Methods(==) :: SmallMutableArray s a -> SmallMutableArray s a -> Bool #(/=) :: SmallMutableArray s a -> SmallMutableArray s a -> Bool # Eq (MutableArray s a) Instance detailsDefined in Data.Primitive.Array Methods(==) :: MutableArray s a -> MutableArray s a -> Bool #(/=) :: MutableArray s a -> MutableArray s a -> Bool # (Eq a, Eq b) => Eq (These a b) Instance detailsDefined in Data.These Methods(==) :: These a b -> These a b -> Bool #(/=) :: These a b -> These a b -> Bool # (Eq a, Eq b) => Eq (Pair a b) Instance detailsDefined in Data.Strict.Tuple Methods(==) :: Pair a b -> Pair a b -> Bool #(/=) :: Pair a b -> Pair a b -> Bool # (Eq a, Eq b) => Eq (These a b) Instance detailsDefined in Data.Strict.These Methods(==) :: These a b -> These a b -> Bool #(/=) :: These a b -> These a b -> Bool # (Eq a, Eq b) => Eq (Either a b) Instance detailsDefined in Data.Strict.Either Methods(==) :: Either a b -> Either a b -> Bool #(/=) :: Either a b -> Either a b -> Bool # (Eq k, Eq v) => Eq (Leaf k v) Instance detailsDefined in Data.HashMap.Internal Methods(==) :: Leaf k v -> Leaf k v -> Bool #(/=) :: Leaf k v -> Leaf k v -> Bool # Eq (f p) => Eq (Rec1 f p) Since: base-4.7.0.0 Instance detailsDefined in GHC.Generics Methods(==) :: Rec1 f p -> Rec1 f p -> Bool #(/=) :: Rec1 f p -> Rec1 f p -> Bool # Eq (URec (Ptr ()) p) Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods(==) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool #(/=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # Eq (URec Char p) Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods(==) :: URec Char p -> URec Char p -> Bool #(/=) :: URec Char p -> URec Char p -> Bool # Eq (URec Double p) Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods(==) :: URec Double p -> URec Double p -> Bool #(/=) :: URec Double p -> URec Double p -> Bool # Eq (URec Float p) Instance detailsDefined in GHC.Generics Methods(==) :: URec Float p -> URec Float p -> Bool #(/=) :: URec Float p -> URec Float p -> Bool # Eq (URec Int p) Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods(==) :: URec Int p -> URec Int p -> Bool #(/=) :: URec Int p -> URec Int p -> Bool # Eq (URec Word p) Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods(==) :: URec Word p -> URec Word p -> Bool #(/=) :: URec Word p -> URec Word p -> Bool # (Eq a, Eq b, Eq c) => Eq (a, b, c) Instance detailsDefined in GHC.Classes Methods(==) :: (a, b, c) -> (a, b, c) -> Bool #(/=) :: (a, b, c) -> (a, b, c) -> Bool # (Eq1 f, Eq a) => Eq (IdentityT f a) Instance detailsDefined in Control.Monad.Trans.Identity Methods(==) :: IdentityT f a -> IdentityT f a -> Bool #(/=) :: IdentityT f a -> IdentityT f a -> Bool # (Eq w, Eq1 m, Eq a) => Eq (WriterT w m a) Instance detailsDefined in Control.Monad.Trans.Writer.Strict Methods(==) :: WriterT w m a -> WriterT w m a -> Bool #(/=) :: WriterT w m a -> WriterT w m a -> Bool # (Eq w, Eq1 m, Eq a) => Eq (WriterT w m a) Instance detailsDefined in Control.Monad.Trans.Writer.Lazy Methods(==) :: WriterT w m a -> WriterT w m a -> Bool #(/=) :: WriterT w m a -> WriterT w m a -> Bool # (Eq e, Eq1 m, Eq a) => Eq (ExceptT e m a) Instance detailsDefined in Control.Monad.Trans.Except Methods(==) :: ExceptT e m a -> ExceptT e m a -> Bool #(/=) :: ExceptT e m a -> ExceptT e m a -> Bool # (Eq e, Eq1 m, Eq a) => Eq (ErrorT e m a) Instance detailsDefined in Control.Monad.Trans.Error Methods(==) :: ErrorT e m a -> ErrorT e m a -> Bool #(/=) :: ErrorT e m a -> ErrorT e m a -> Bool # Eq b => Eq (Tagged s b) Instance detailsDefined in Data.Tagged Methods(==) :: Tagged s b -> Tagged s b -> Bool #(/=) :: Tagged s b -> Tagged s b -> Bool # (Eq1 f, Eq1 g, Eq a) => Eq (These1 f g a) Instance detailsDefined in Data.Functor.These Methods(==) :: These1 f g a -> These1 f g a -> Bool #(/=) :: These1 f g a -> These1 f g a -> Bool # Eq c => Eq (K1 i c p) Since: base-4.7.0.0 Instance detailsDefined in GHC.Generics Methods(==) :: K1 i c p -> K1 i c p -> Bool #(/=) :: K1 i c p -> K1 i c p -> Bool # (Eq (f p), Eq (g p)) => Eq ((f :+: g) p) Since: base-4.7.0.0 Instance detailsDefined in GHC.Generics Methods(==) :: (f :+: g) p -> (f :+: g) p -> Bool #(/=) :: (f :+: g) p -> (f :+: g) p -> Bool # (Eq (f p), Eq (g p)) => Eq ((f :*: g) p) Since: base-4.7.0.0 Instance detailsDefined in GHC.Generics Methods(==) :: (f :*: g) p -> (f :*: g) p -> Bool #(/=) :: (f :*: g) p -> (f :*: g) p -> Bool # (Eq a, Eq b, Eq c, Eq d) => Eq (a, b, c, d) Instance detailsDefined in GHC.Classes Methods(==) :: (a, b, c, d) -> (a, b, c, d) -> Bool #(/=) :: (a, b, c, d) -> (a, b, c, d) -> Bool # Eq (f p) => Eq (M1 i c f p) Since: base-4.7.0.0 Instance detailsDefined in GHC.Generics Methods(==) :: M1 i c f p -> M1 i c f p -> Bool #(/=) :: M1 i c f p -> M1 i c f p -> Bool # Eq (f (g p)) => Eq ((f :.: g) p) Since: base-4.7.0.0 Instance detailsDefined in GHC.Generics Methods(==) :: (f :.: g) p -> (f :.: g) p -> Bool #(/=) :: (f :.: g) p -> (f :.: g) p -> Bool # (Eq a, Eq b, Eq c, Eq d, Eq e) => Eq (a, b, c, d, e) Instance detailsDefined in GHC.Classes Methods(==) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool #(/=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # Eq (p b a) => Eq (Flip p a b) Instance detailsDefined in Data.Bifunctor.Flip Methods(==) :: Flip p a b -> Flip p a b -> Bool #(/=) :: Flip p a b -> Flip p a b -> Bool # (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f) => Eq (a, b, c, d, e, f) Instance detailsDefined in GHC.Classes Methods(==) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool #(/=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # (Eq (p a b), Eq (q a b)) => Eq (Sum p q a b) Instance detailsDefined in Data.Bifunctor.Sum Methods(==) :: Sum p q a b -> Sum p q a b -> Bool #(/=) :: Sum p q a b -> Sum p q a b -> Bool # (Eq (f a b), Eq (g a b)) => Eq (Product f g a b) Instance detailsDefined in Data.Bifunctor.Product Methods(==) :: Product f g a b -> Product f g a b -> Bool #(/=) :: Product f g a b -> Product f g a b -> Bool # (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g) => Eq (a, b, c, d, e, f, g) Instance detailsDefined in GHC.Classes Methods(==) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool #(/=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # Eq (f (p a b)) => Eq (Tannen f p a b) Instance detailsDefined in Data.Bifunctor.Tannen Methods(==) :: Tannen f p a b -> Tannen f p a b -> Bool #(/=) :: Tannen f p a b -> Tannen f p a b -> Bool # (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 detailsDefined in GHC.Classes Methods(==) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool #(/=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # (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 detailsDefined in GHC.Classes Methods(==) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool #(/=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # Eq (p (f a) (g b)) => Eq (Biff p f g a b) Instance detailsDefined in Data.Bifunctor.Biff Methods(==) :: Biff p f g a b -> Biff p f g a b -> Bool #(/=) :: Biff p f g a b -> Biff p f g a b -> Bool # (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 detailsDefined 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 #(/=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # (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 detailsDefined 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 #(/=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # (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 detailsDefined 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 #(/=) :: (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 # (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 detailsDefined 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 #(/=) :: (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 # (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 detailsDefined 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 #(/=) :: (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 # (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 detailsDefined 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 #(/=) :: (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 # class Fractional a => Floating a where # 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 Methods pi :: a # exp :: a -> a # log :: a -> a # sqrt :: a -> a # (**) :: a -> a -> a infixr 8 # 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 # #### Instances Instances details  Since: base-2.1 Instance detailsDefined in GHC.Float Methodsexp :: Double -> Double #log :: Double -> Double #(**) :: Double -> Double -> Double #sin :: Double -> Double #cos :: Double -> Double #tan :: Double -> Double # Since: base-2.1 Instance detailsDefined in GHC.Float Methodspi :: Float #exp :: Float -> Float #log :: Float -> Float #sqrt :: Float -> Float #(**) :: Float -> Float -> Float #logBase :: Float -> Float -> Float #sin :: Float -> Float #cos :: Float -> Float #tan :: Float -> Float #asin :: Float -> Float #acos :: Float -> Float #atan :: Float -> Float #sinh :: Float -> Float #cosh :: Float -> Float #tanh :: Float -> Float #asinh :: Float -> Float #acosh :: Float -> Float #atanh :: Float -> Float #log1p :: Float -> Float #expm1 :: Float -> Float # Floating a => Floating (Tagged s a) Instance detailsDefined in Data.Tagged Methodspi :: Tagged s a #exp :: Tagged s a -> Tagged s a #log :: Tagged s a -> Tagged s a #sqrt :: Tagged s a -> Tagged s a #(**) :: Tagged s a -> Tagged s a -> Tagged s a #logBase :: Tagged s a -> Tagged s a -> Tagged s a #sin :: Tagged s a -> Tagged s a #cos :: Tagged s a -> Tagged s a #tan :: Tagged s a -> Tagged s a #asin :: Tagged s a -> Tagged s a #acos :: Tagged s a -> Tagged s a #atan :: Tagged s a -> Tagged s a #sinh :: Tagged s a -> Tagged s a #cosh :: Tagged s a -> Tagged s a #tanh :: Tagged s a -> Tagged s a #asinh :: Tagged s a -> Tagged s a #acosh :: Tagged s a -> Tagged s a #atanh :: Tagged s a -> Tagged s a #log1p :: Tagged s a -> Tagged s a #expm1 :: Tagged s a -> Tagged s a #log1pexp :: Tagged s a -> Tagged s a #log1mexp :: Tagged s a -> Tagged s a # class Num a => Fractional a where # 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 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 # Fractional division. recip :: a -> a # Reciprocal fraction. fromRational :: Rational -> a # 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  WARNING: recip and / will throw an error when their outputs are repeating decimals.These methods also compute Integer magnitudes (10^e). If these methods are applied to arguments which have huge exponents this could fill up all space and crash your program! So don't apply these methods to scientific numbers coming from untrusted sources.fromRational will throw an error when the input Rational is a repeating decimal. Consider using fromRationalRepetend for these rationals which will detect the repetition and indicate where it starts. Instance detailsDefined in Data.Scientific Methods Integral a => Fractional (Ratio a) Since: base-2.0.1 Instance detailsDefined in GHC.Real Methods(/) :: Ratio a -> Ratio a -> Ratio a #recip :: Ratio a -> Ratio a # Fractional a => Fractional (Tagged s a) Instance detailsDefined in Data.Tagged Methods(/) :: Tagged s a -> Tagged s a -> Tagged s a #recip :: Tagged s a -> Tagged s a #fromRational :: Rational -> Tagged s a # class (Real a, Enum a) => Integral a where # 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. Minimal complete definition Methods quot :: a -> a -> a infixl 7 # integer division truncated toward zero rem :: a -> a -> a infixl 7 # integer remainder, satisfying (x quot y)*y + (x rem y) == x div :: a -> a -> a infixl 7 # integer division truncated toward negative infinity mod :: a -> a -> a infixl 7 # integer modulus, satisfying (x div y)*y + (x mod y) == x quotRem :: a -> a -> (a, a) # simultaneous quot and rem divMod :: a -> a -> (a, a) # simultaneous div and mod toInteger :: a -> Integer # conversion to Integer #### Instances Instances details  Since: base-2.0.1 Instance detailsDefined in GHC.Real Methodsquot :: Int -> Int -> Int #rem :: Int -> Int -> Int #div :: Int -> Int -> Int #mod :: Int -> Int -> Int #quotRem :: Int -> Int -> (Int, Int) #divMod :: Int -> Int -> (Int, Int) # Since: base-2.0.1 Instance detailsDefined in GHC.Real MethodsquotRem :: Integer -> Integer -> (Integer, Integer) #divMod :: Integer -> Integer -> (Integer, Integer) # Since: base-4.8.0.0 Instance detailsDefined in GHC.Real MethodsquotRem :: Natural -> Natural -> (Natural, Natural) #divMod :: Natural -> Natural -> (Natural, Natural) # Since: base-2.1 Instance detailsDefined in GHC.Real Methodsquot :: Word -> Word -> Word #rem :: Word -> Word -> Word #div :: Word -> Word -> Word #mod :: Word -> Word -> Word #quotRem :: Word -> Word -> (Word, Word) #divMod :: Word -> Word -> (Word, Word) # Source # Instance detailsDefined in Yesod.Paginator.Pages Methods Source # Instance detailsDefined in Yesod.Paginator.Pages MethodsquotRem :: PerPage -> PerPage -> (PerPage, PerPage) #divMod :: PerPage -> PerPage -> (PerPage, PerPage) # Source # Instance detailsDefined in Yesod.Paginator.Pages Methods Integral a => Integral (Tagged s a) Instance detailsDefined in Data.Tagged Methodsquot :: Tagged s a -> Tagged s a -> Tagged s a #rem :: Tagged s a -> Tagged s a -> Tagged s a #div :: Tagged s a -> Tagged s a -> Tagged s a #mod :: Tagged s a -> Tagged s a -> Tagged s a #quotRem :: Tagged s a -> Tagged s a -> (Tagged s a, Tagged s a) #divMod :: Tagged s a -> Tagged s a -> (Tagged s a, Tagged s a) #toInteger :: Tagged s a -> Integer # class Applicative m => Monad (m :: Type -> Type) where # 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 lists, Maybe and IO defined in the Prelude satisfy these laws. Minimal complete definition (>>=) Methods (>>=) :: m a -> (a -> m b) -> m b infixl 1 # 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  (>>) :: m a -> m b -> m b infixl 1 # 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  return :: a -> m a # Inject a value into the monadic type. #### Instances Instances details  Monad [] Since: base-2.1 Instance detailsDefined in GHC.Base Methods(>>=) :: [a] -> (a -> [b]) -> [b] #(>>) :: [a] -> [b] -> [b] #return :: a -> [a] # Since: base-2.1 Instance detailsDefined in GHC.Base Methods(>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b #(>>) :: Maybe a -> Maybe b -> Maybe b #return :: a -> Maybe a # Since: base-2.1 Instance detailsDefined in GHC.Base Methods(>>=) :: IO a -> (a -> IO b) -> IO b #(>>) :: IO a -> IO b -> IO b #return :: a -> IO a # Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods(>>=) :: Par1 a -> (a -> Par1 b) -> Par1 b #(>>) :: Par1 a -> Par1 b -> Par1 b #return :: a -> Par1 a # Instance detailsDefined in Language.Haskell.TH.Syntax Methods(>>=) :: Q a -> (a -> Q b) -> Q b #(>>) :: Q a -> Q b -> Q b #return :: a -> Q a # Instance detailsDefined in Data.Tuple.Solo Methods(>>=) :: Solo a -> (a -> Solo b) -> Solo b #(>>) :: Solo a -> Solo b -> Solo b #return :: a -> Solo a # Instance detailsDefined in Data.Aeson.Types.Internal Methods(>>=) :: IResult a -> (a -> IResult b) -> IResult b #(>>) :: IResult a -> IResult b -> IResult b #return :: a -> IResult a # Instance detailsDefined in Data.Aeson.Types.Internal Methods(>>=) :: Result a -> (a -> Result b) -> Result b #(>>) :: Result a -> Result b -> Result b #return :: a -> Result a # Instance detailsDefined in Data.Aeson.Types.Internal Methods(>>=) :: Parser a -> (a -> Parser b) -> Parser b #(>>) :: Parser a -> Parser b -> Parser b #return :: a -> Parser a # Since: base-2.1 Instance detailsDefined in Text.ParserCombinators.ReadPrec Methods(>>=) :: ReadPrec a -> (a -> ReadPrec b) -> ReadPrec b #(>>) :: ReadPrec a -> ReadPrec b -> ReadPrec b #return :: a -> ReadPrec a # Since: base-2.1 Instance detailsDefined in Text.ParserCombinators.ReadP Methods(>>=) :: ReadP a -> (a -> ReadP b) -> ReadP b #(>>) :: ReadP a -> ReadP b -> ReadP b #return :: a -> ReadP a # Since: base-4.9.0.0 Instance detailsDefined in GHC.Base Methods(>>=) :: NonEmpty a -> (a -> NonEmpty b) -> NonEmpty b #(>>) :: NonEmpty a -> NonEmpty b -> NonEmpty b #return :: a -> NonEmpty a # Instance detailsDefined in Text.Blaze.Internal Methods(>>=) :: MarkupM a -> (a -> MarkupM b) -> MarkupM b #(>>) :: MarkupM a -> MarkupM b -> MarkupM b #return :: a -> MarkupM a # Instance detailsDefined in Crypto.Error.Types Methods(>>=) :: CryptoFailable a -> (a -> CryptoFailable b) -> CryptoFailable b #return :: a -> CryptoFailable a # Instance detailsDefined in Data.DList.DNonEmpty.Internal Methods(>>=) :: DNonEmpty a -> (a -> DNonEmpty b) -> DNonEmpty b #(>>) :: DNonEmpty a -> DNonEmpty b -> DNonEmpty b #return :: a -> DNonEmpty a # Instance detailsDefined in Data.DList.Internal Methods(>>=) :: DList a -> (a -> DList b) -> DList b #(>>) :: DList a -> DList b -> DList b #return :: a -> DList a # Instance detailsDefined in Data.Primitive.SmallArray Methods(>>=) :: SmallArray a -> (a -> SmallArray b) -> SmallArray b #(>>) :: SmallArray a -> SmallArray b -> SmallArray b #return :: a -> SmallArray a # Instance detailsDefined in Data.Primitive.Array Methods(>>=) :: Array a -> (a -> Array b) -> Array b #(>>) :: Array a -> Array b -> Array b #return :: a -> Array a # Instance detailsDefined in Data.Vector Methods(>>=) :: Vector a -> (a -> Vector b) -> Vector b #(>>) :: Vector a -> Vector b -> Vector b #return :: a -> Vector a # Monad Stream Instance detailsDefined in Codec.Compression.Zlib.Stream Methods(>>=) :: Stream a -> (a -> Stream b) -> Stream b #(>>) :: Stream a -> Stream b -> Stream b #return :: a -> Stream a # Since: base-2.1 Instance detailsDefined in Text.ParserCombinators.ReadP Methods(>>=) :: P a -> (a -> P b) -> P b #(>>) :: P a -> P b -> P b #return :: a -> P a # Monad (Either e) Since: base-4.4.0.0 Instance detailsDefined in Data.Either Methods(>>=) :: Either e a -> (a -> Either e b) -> Either e b #(>>) :: Either e a -> Either e b -> Either e b #return :: a -> Either e a # Monad (U1 :: Type -> Type) Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods(>>=) :: U1 a -> (a -> U1 b) -> U1 b #(>>) :: U1 a -> U1 b -> U1 b #return :: a -> U1 a # Monoid a => Monad ((,) a) Since: base-4.9.0.0 Instance detailsDefined in GHC.Base Methods(>>=) :: (a, a0) -> (a0 -> (a, b)) -> (a, b) #(>>) :: (a, a0) -> (a, b) -> (a, b) #return :: a0 -> (a, a0) # Monad (Parser i) Instance detailsDefined in Data.Attoparsec.Internal.Types Methods(>>=) :: Parser i a -> (a -> Parser i b) -> Parser i b #(>>) :: Parser i a -> Parser i b -> Parser i b #return :: a -> Parser i a # Monad m => Monad (MaybeT m) Instance detailsDefined in Control.Monad.Trans.Maybe Methods(>>=) :: MaybeT m a -> (a -> MaybeT m b) -> MaybeT m b #(>>) :: MaybeT m a -> MaybeT m b -> MaybeT m b #return :: a -> MaybeT m a # Monad m => Monad (ResourceT m) Instance detailsDefined in Control.Monad.Trans.Resource.Internal Methods(>>=) :: ResourceT m a -> (a -> ResourceT m b) -> ResourceT m b #(>>) :: ResourceT m a -> ResourceT m b -> ResourceT m b #return :: a -> ResourceT m a # Monad m => Monad (ListT m) Instance detailsDefined in Control.Monad.Trans.List Methods(>>=) :: ListT m a -> (a -> ListT m b) -> ListT m b #(>>) :: ListT m a -> ListT m b -> ListT m b #return :: a -> ListT m a # Monad m => Monad (NoLoggingT m) Instance detailsDefined in Control.Monad.Logger Methods(>>=) :: NoLoggingT m a -> (a -> NoLoggingT m b) -> NoLoggingT m b #(>>) :: NoLoggingT m a -> NoLoggingT m b -> NoLoggingT m b #return :: a -> NoLoggingT m a # Monad m => Monad (WriterLoggingT m) Instance detailsDefined in Control.Monad.Logger Methods(>>=) :: WriterLoggingT m a -> (a -> WriterLoggingT m b) -> WriterLoggingT m b #(>>) :: WriterLoggingT m a -> WriterLoggingT m b -> WriterLoggingT m b #return :: a -> WriterLoggingT m a # Monad m => Monad (LoggingT m) Instance detailsDefined in Control.Monad.Logger Methods(>>=) :: LoggingT m a -> (a -> LoggingT m b) -> LoggingT m b #(>>) :: LoggingT m a -> LoggingT m b -> LoggingT m b #return :: a -> LoggingT m a # Monad f => Monad (WrappedPoly f) Instance detailsDefined in Data.MonoTraversable Methods(>>=) :: WrappedPoly f a -> (a -> WrappedPoly f b) -> WrappedPoly f b #(>>) :: WrappedPoly f a -> WrappedPoly f b -> WrappedPoly f b #return :: a -> WrappedPoly f a # Semigroup a => Monad (These a) Instance detailsDefined in Data.These Methods(>>=) :: These a a0 -> (a0 -> These a b) -> These a b #(>>) :: These a a0 -> These a b -> These a b #return :: a0 -> These a a0 # Semigroup a => Monad (These a) Instance detailsDefined in Data.Strict.These Methods(>>=) :: These a a0 -> (a0 -> These a b) -> These a b #(>>) :: These a a0 -> These a b -> These a b #return :: a0 -> These a a0 # Monad (HandlerFor site) Instance detailsDefined in Yesod.Core.Types Methods(>>=) :: HandlerFor site a -> (a -> HandlerFor site b) -> HandlerFor site b #(>>) :: HandlerFor site a -> HandlerFor site b -> HandlerFor site b #return :: a -> HandlerFor site a # Monad (WidgetFor site) Instance detailsDefined in Yesod.Core.Types Methods(>>=) :: WidgetFor site a -> (a -> WidgetFor site b) -> WidgetFor site b #(>>) :: WidgetFor site a -> WidgetFor site b -> WidgetFor site b #return :: a -> WidgetFor site a # Monad f => Monad (Rec1 f) Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods(>>=) :: Rec1 f a -> (a -> Rec1 f b) -> Rec1 f b #(>>) :: Rec1 f a -> Rec1 f b -> Rec1 f b #return :: a -> Rec1 f a # (Monoid a, Monoid b) => Monad ((,,) a b) Since: base-4.14.0.0 Instance detailsDefined in GHC.Base Methods(>>=) :: (a, b, a0) -> (a0 -> (a, b, b0)) -> (a, b, b0) #(>>) :: (a, b, a0) -> (a, b, b0) -> (a, b, b0) #return :: a0 -> (a, b, a0) # Monad m => Monad (IdentityT m) Instance detailsDefined in Control.Monad.Trans.Identity Methods(>>=) :: IdentityT m a -> (a -> IdentityT m b) -> IdentityT m b #(>>) :: IdentityT m a -> IdentityT m b -> IdentityT m b #return :: a -> IdentityT m a # (Monoid w, Monad m) => Monad (WriterT w m) Instance detailsDefined in Control.Monad.Trans.Writer.Strict Methods(>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b #(>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b #return :: a -> WriterT w m a # (Monoid w, Monad m) => Monad (WriterT w m) Instance detailsDefined in Control.Monad.Trans.Writer.Lazy Methods(>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b #(>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b #return :: a -> WriterT w m a # Monad m => Monad (StateT s m) Instance detailsDefined in Control.Monad.Trans.State.Strict Methods(>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b #(>>) :: StateT s m a -> StateT s m b -> StateT s m b #return :: a -> StateT s m a # Monad m => Monad (StateT s m) Instance detailsDefined in Control.Monad.Trans.State.Lazy Methods(>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b #(>>) :: StateT s m a -> StateT s m b -> StateT s m b #return :: a -> StateT s m a # Monad m => Monad (ReaderT r m) Instance detailsDefined in Control.Monad.Trans.Reader Methods(>>=) :: ReaderT r m a -> (a -> ReaderT r m b) -> ReaderT r m b #(>>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b #return :: a -> ReaderT r m a # Monad m => Monad (ExceptT e m) Instance detailsDefined in Control.Monad.Trans.Except Methods(>>=) :: ExceptT e m a -> (a -> ExceptT e m b) -> ExceptT e m b #(>>) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m b #return :: a -> ExceptT e m a # (Monad m, Error e) => Monad (ErrorT e m) Instance detailsDefined in Control.Monad.Trans.Error Methods(>>=) :: ErrorT e m a -> (a -> ErrorT e m b) -> ErrorT e m b #(>>) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m b #return :: a -> ErrorT e m a # Monad (Tagged s) Instance detailsDefined in Data.Tagged Methods(>>=) :: Tagged s a -> (a -> Tagged s b) -> Tagged s b #(>>) :: Tagged s a -> Tagged s b -> Tagged s b #return :: a -> Tagged s a # Monad (SubHandlerFor child master) Instance detailsDefined in Yesod.Core.Types Methods(>>=) :: SubHandlerFor child master a -> (a -> SubHandlerFor child master b) -> SubHandlerFor child master b #(>>) :: SubHandlerFor child master a -> SubHandlerFor child master b -> SubHandlerFor child master b #return :: a -> SubHandlerFor child master a # Monad ((->) r :: Type -> Type) Since: base-2.1 Instance detailsDefined in GHC.Base Methods(>>=) :: (r -> a) -> (a -> r -> b) -> r -> b #(>>) :: (r -> a) -> (r -> b) -> r -> b #return :: a -> r -> a # (Monad f, Monad g) => Monad (f :*: g) Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods(>>=) :: (f :*: g) a -> (a -> (f :*: g) b) -> (f :*: g) b #(>>) :: (f :*: g) a -> (f :*: g) b -> (f :*: g) b #return :: a -> (f :*: g) a # (Monoid a, Monoid b, Monoid c) => Monad ((,,,) a b c) Since: base-4.14.0.0 Instance detailsDefined in GHC.Base Methods(>>=) :: (a, b, c, a0) -> (a0 -> (a, b, c, b0)) -> (a, b, c, b0) #(>>) :: (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, b0) #return :: a0 -> (a, b, c, a0) # Monad (ConduitT i o m) Instance detailsDefined in Data.Conduit.Internal.Conduit Methods(>>=) :: ConduitT i o m a -> (a -> ConduitT i o m b) -> ConduitT i o m b #(>>) :: ConduitT i o m a -> ConduitT i o m b -> ConduitT i o m b #return :: a -> ConduitT i o m a # Monad f => Monad (M1 i c f) Since: base-4.9.0.0 Instance detailsDefined in GHC.Generics Methods(>>=) :: M1 i c f a -> (a -> M1 i c f b) -> M1 i c f b #(>>) :: M1 i c f a -> M1 i c f b -> M1 i c f b #return :: a -> M1 i c f a # (Monoid w, Monad m) => Monad (RWST r w s m) Instance detailsDefined 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 #(>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b #return :: a -> RWST r w s m a # (Monoid w, Monad m) => Monad (RWST r w s m) Instance detailsDefined 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 #(>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b #return :: a -> RWST r w s m a # Monad state => Monad (Builder collection mutCollection step state err) Instance detailsDefined in Basement.MutableBuilder Methods(>>=) :: Builder collection mutCollection step state err a -> (a -> Builder collection mutCollection step state err b) -> Builder collection mutCollection step state err b #(>>) :: Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err b #return :: a -> Builder collection mutCollection step state err a # Monad m => Monad (Pipe l i o u m) Instance detailsDefined in Data.Conduit.Internal.Pipe Methods(>>=) :: Pipe l i o u m a -> (a -> Pipe l i o u m b) -> Pipe l i o u m b #(>>) :: Pipe l i o u m a -> Pipe l i o u m b -> Pipe l i o u m b #return :: a -> Pipe l i o u m a # class Functor (f :: Type -> Type) where # 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. Minimal complete definition fmap Methods fmap :: (a -> b) -> f a -> f b # Using ApplicativeDo: 'fmap f as' can be understood as the do expression do a <- as pure (f a)  with an inferred Functor constraint. (<$) :: a -> f b -> f a infixl 4 #

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.