hedgehog-1.0.5: Release with confidence.

Hedgehog.Internal.Prelude

Description

Mostly for compatibility across different base Prelude changes.

Synopsis

# Documentation

class Semigroup a where #

The class of semigroups (types with an associative binary operation).

Instances should satisfy the following:

Associativity
x <> (y <> z) = (x <> y) <> z

Since: base-4.9.0.0

Minimal complete definition

(<>)

Methods

(<>) :: a -> a -> a infixr 6 #

An associative operation.

>>> [1,2,3] <> [4,5,6]
[1,2,3,4,5,6]


sconcat :: NonEmpty a -> a #

Reduce a non-empty list with <>

The default definition should be sufficient, but this can be overridden for efficiency.

>>> import Data.List.NonEmpty
>>> sconcat $"Hello" :| [" ", "Haskell", "!"] "Hello Haskell!"  stimes :: Integral b => b -> a -> a # Repeat a value n times. Given that this works on a Semigroup it is allowed to fail if you request 0 or fewer repetitions, and the default definition will do so. By making this a member of the class, idempotent semigroups and monoids can upgrade this to execute in $$\mathcal{O}(1)$$ by picking stimes = stimesIdempotent or stimes = stimesIdempotentMonoid respectively. >>> stimes 4 [1] [1,1,1,1]  #### Instances Instances details  Since: base-4.9.0.0 Instance detailsDefined in GHC.Base Methodsstimes :: Integral b => b -> Ordering -> Ordering # Since: base-4.9.0.0 Instance detailsDefined in GHC.Base Methods(<>) :: () -> () -> () #sconcat :: NonEmpty () -> () #stimes :: Integral b => b -> () -> () # Since: base-4.9.0.0 Instance detailsDefined in Data.Void Methods(<>) :: Void -> Void -> Void #stimes :: Integral b => b -> Void -> Void # Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup.Internal Methods(<>) :: All -> All -> All #stimes :: Integral b => b -> All -> All # Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup.Internal Methods(<>) :: Any -> Any -> Any #stimes :: Integral b => b -> Any -> Any # Instance detailsDefined in Data.ByteString.Short.Internal Methodsstimes :: Integral b => b -> ShortByteString -> ShortByteString # Instance detailsDefined in Data.ByteString.Internal Methodsstimes :: Integral b => b -> ByteString -> ByteString # Instance detailsDefined in Data.ByteString.Builder.Internal Methodsstimes :: Integral b => b -> Builder -> Builder # Since: containers-0.5.7 Instance detailsDefined in Data.IntSet.Internal Methods(<>) :: IntSet -> IntSet -> IntSet #stimes :: Integral b => b -> IntSet -> IntSet # Instance detailsDefined in Text.PrettyPrint.HughesPJ Methods(<>) :: Doc -> Doc -> Doc #stimes :: Integral b => b -> Doc -> Doc # Source # Instance detailsDefined in Hedgehog.Internal.Property Methodsstimes :: Integral b => b -> LabelName -> LabelName # Source # Instance detailsDefined in Hedgehog.Internal.Property Methodsstimes :: Integral b => b -> CoverCount -> CoverCount # Source # Instance detailsDefined in Hedgehog.Internal.Property Methods(<>) :: Cover -> Cover -> Cover #stimes :: Integral b => b -> Cover -> Cover # Source # Instance detailsDefined in Hedgehog.Internal.Property Methodsstimes :: Integral b => b -> Journal -> Journal # Source # Instance detailsDefined in Hedgehog.Internal.Property Methodsstimes :: Integral b => b -> GroupName -> GroupName # Source # Instance detailsDefined in Hedgehog.Internal.Property Methodsstimes :: Integral b => b -> PropertyName -> PropertyName # Source # Instance detailsDefined in Hedgehog.Internal.Report Methods(<>) :: Style -> Style -> Style #stimes :: Integral b => b -> Style -> Style # Source # Instance detailsDefined in Hedgehog.Internal.Report Methodsstimes :: Integral b => b -> Summary -> Summary # Semigroup [a] Since: base-4.9.0.0 Instance detailsDefined in GHC.Base Methods(<>) :: [a] -> [a] -> [a] #sconcat :: NonEmpty [a] -> [a] #stimes :: Integral b => b -> [a] -> [a] # Semigroup a => Semigroup (Maybe a) Since: base-4.9.0.0 Instance detailsDefined in GHC.Base Methods(<>) :: Maybe a -> Maybe a -> Maybe a #sconcat :: NonEmpty (Maybe a) -> Maybe a #stimes :: Integral b => b -> Maybe a -> Maybe a # Semigroup a => Semigroup (IO a) Since: base-4.10.0.0 Instance detailsDefined in GHC.Base Methods(<>) :: IO a -> IO a -> IO a #sconcat :: NonEmpty (IO a) -> IO a #stimes :: Integral b => b -> IO a -> IO a # Semigroup p => Semigroup (Par1 p) Since: base-4.12.0.0 Instance detailsDefined in GHC.Generics Methods(<>) :: Par1 p -> Par1 p -> Par1 p #sconcat :: NonEmpty (Par1 p) -> Par1 p #stimes :: Integral b => b -> Par1 p -> Par1 p # Only defined by async for base >= 4.9Since: async-2.1.0 Instance detailsDefined in Control.Concurrent.Async Methods(<>) :: Concurrently a -> Concurrently a -> Concurrently a #stimes :: Integral b => b -> Concurrently a -> Concurrently a # Ord a => Semigroup (Min a) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup Methods(<>) :: Min a -> Min a -> Min a #sconcat :: NonEmpty (Min a) -> Min a #stimes :: Integral b => b -> Min a -> Min a # Ord a => Semigroup (Max a) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup Methods(<>) :: Max a -> Max a -> Max a #sconcat :: NonEmpty (Max a) -> Max a #stimes :: Integral b => b -> Max a -> Max a # Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup Methods(<>) :: First a -> First a -> First a #sconcat :: NonEmpty (First a) -> First a #stimes :: Integral b => b -> First a -> First a # Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup Methods(<>) :: Last a -> Last a -> Last a #sconcat :: NonEmpty (Last a) -> Last a #stimes :: Integral b => b -> Last a -> Last a # Monoid m => Semigroup (WrappedMonoid m) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup Methods(<>) :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m #stimes :: Integral b => b -> WrappedMonoid m -> WrappedMonoid m # Semigroup a => Semigroup (Option a) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup Methods(<>) :: Option a -> Option a -> Option a #sconcat :: NonEmpty (Option a) -> Option a #stimes :: Integral b => b -> Option a -> Option a # Semigroup a => Semigroup (Identity a) Since: base-4.9.0.0 Instance detailsDefined in Data.Functor.Identity Methods(<>) :: Identity a -> Identity a -> Identity a #sconcat :: NonEmpty (Identity a) -> Identity a #stimes :: Integral b => b -> Identity a -> Identity a # Since: base-4.9.0.0 Instance detailsDefined in Data.Monoid Methods(<>) :: First a -> First a -> First a #sconcat :: NonEmpty (First a) -> First a #stimes :: Integral b => b -> First a -> First a # Since: base-4.9.0.0 Instance detailsDefined in Data.Monoid Methods(<>) :: Last a -> Last a -> Last a #sconcat :: NonEmpty (Last a) -> Last a #stimes :: Integral b => b -> Last a -> Last a # Semigroup a => Semigroup (Dual a) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup.Internal Methods(<>) :: Dual a -> Dual a -> Dual a #sconcat :: NonEmpty (Dual a) -> Dual a #stimes :: Integral b => b -> Dual a -> Dual a # Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup.Internal Methods(<>) :: Endo a -> Endo a -> Endo a #sconcat :: NonEmpty (Endo a) -> Endo a #stimes :: Integral b => b -> Endo a -> Endo a # Num a => Semigroup (Sum a) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup.Internal Methods(<>) :: Sum a -> Sum a -> Sum a #sconcat :: NonEmpty (Sum a) -> Sum a #stimes :: Integral b => b -> Sum a -> Sum a # Num a => Semigroup (Product a) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup.Internal Methods(<>) :: Product a -> Product a -> Product a #sconcat :: NonEmpty (Product a) -> Product a #stimes :: Integral b => b -> Product a -> Product a # Semigroup a => Semigroup (Down a) Since: base-4.11.0.0 Instance detailsDefined in Data.Ord Methods(<>) :: Down a -> Down a -> Down a #sconcat :: NonEmpty (Down a) -> Down a #stimes :: Integral b => b -> Down a -> Down a # Since: base-4.9.0.0 Instance detailsDefined in GHC.Base Methods(<>) :: NonEmpty a -> NonEmpty a -> NonEmpty a #sconcat :: NonEmpty (NonEmpty a) -> NonEmpty a #stimes :: Integral b => b -> NonEmpty a -> NonEmpty a # Num a => Semigroup (Colour a) Instance detailsDefined in Data.Colour.Internal Methods(<>) :: Colour a -> Colour a -> Colour a #sconcat :: NonEmpty (Colour a) -> Colour a #stimes :: Integral b => b -> Colour a -> Colour a # Num a => Semigroup (AlphaColour a) AlphaColour forms a monoid with over and transparent. Instance detailsDefined in Data.Colour.Internal Methods(<>) :: AlphaColour a -> AlphaColour a -> AlphaColour a #stimes :: Integral b => b -> AlphaColour a -> AlphaColour a # Since: containers-0.5.7 Instance detailsDefined in Data.IntMap.Internal Methods(<>) :: IntMap a -> IntMap a -> IntMap a #sconcat :: NonEmpty (IntMap a) -> IntMap a #stimes :: Integral b => b -> IntMap a -> IntMap a # Semigroup (Seq a) Since: containers-0.5.7 Instance detailsDefined in Data.Sequence.Internal Methods(<>) :: Seq a -> Seq a -> Seq a #sconcat :: NonEmpty (Seq a) -> Seq a #stimes :: Integral b => b -> Seq a -> Seq a # Ord a => Semigroup (Set a) Since: containers-0.5.7 Instance detailsDefined in Data.Set.Internal Methods(<>) :: Set a -> Set a -> Set a #sconcat :: NonEmpty (Set a) -> Set a #stimes :: Integral b => b -> Set a -> Set a # Semigroup (Doc a) Instance detailsDefined in Text.PrettyPrint.Annotated.HughesPJ Methods(<>) :: Doc a -> Doc a -> Doc a #sconcat :: NonEmpty (Doc a) -> Doc a #stimes :: Integral b => b -> Doc a -> Doc a # Semigroup (Doc a) Instance detailsDefined in Text.PrettyPrint.Annotated.WL Methods(<>) :: Doc a -> Doc a -> Doc a #sconcat :: NonEmpty (Doc a) -> Doc a #stimes :: Integral b => b -> Doc a -> Doc a # Semigroup (MergeSet a) Instance detailsDefined in Data.Set.Internal Methods(<>) :: MergeSet a -> MergeSet a -> MergeSet a #sconcat :: NonEmpty (MergeSet a) -> MergeSet a #stimes :: Integral b => b -> MergeSet a -> MergeSet a # Semigroup a => Semigroup (Coverage a) Source # Instance detailsDefined in Hedgehog.Internal.Property Methods(<>) :: Coverage a -> Coverage a -> Coverage a #sconcat :: NonEmpty (Coverage a) -> Coverage a #stimes :: Integral b => b -> Coverage a -> Coverage a # Semigroup a => Semigroup (Label a) Source # This semigroup is right biased. The name, location and percentage from the rightmost Label will be kept. This shouldn't be a problem since the library doesn't allow setting multiple classes with the same ClassifierName. Instance detailsDefined in Hedgehog.Internal.Property Methods(<>) :: Label a -> Label a -> Label a #sconcat :: NonEmpty (Label a) -> Label a #stimes :: Integral b => b -> Label a -> Label a # Semigroup a => Semigroup (Pos a) Source # Instance detailsDefined in Hedgehog.Internal.Discovery Methods(<>) :: Pos a -> Pos a -> Pos a #sconcat :: NonEmpty (Pos a) -> Pos a #stimes :: Integral b => b -> Pos a -> Pos a # Semigroup b => Semigroup (a -> b) Since: base-4.9.0.0 Instance detailsDefined in GHC.Base Methods(<>) :: (a -> b) -> (a -> b) -> a -> b #sconcat :: NonEmpty (a -> b) -> a -> b #stimes :: Integral b0 => b0 -> (a -> b) -> a -> b # Semigroup (Either a b) Since: base-4.9.0.0 Instance detailsDefined in Data.Either Methods(<>) :: Either a b -> Either a b -> Either a b #sconcat :: NonEmpty (Either a b) -> Either a b #stimes :: Integral b0 => b0 -> Either a b -> Either a b # Semigroup (V1 p) Since: base-4.12.0.0 Instance detailsDefined in GHC.Generics Methods(<>) :: V1 p -> V1 p -> V1 p #sconcat :: NonEmpty (V1 p) -> V1 p #stimes :: Integral b => b -> V1 p -> V1 p # Semigroup (U1 p) Since: base-4.12.0.0 Instance detailsDefined in GHC.Generics Methods(<>) :: U1 p -> U1 p -> U1 p #sconcat :: NonEmpty (U1 p) -> U1 p #stimes :: Integral b => b -> U1 p -> U1 p # (Semigroup a, Semigroup b) => Semigroup (a, b) Since: base-4.9.0.0 Instance detailsDefined in GHC.Base Methods(<>) :: (a, b) -> (a, b) -> (a, b) #sconcat :: NonEmpty (a, b) -> (a, b) #stimes :: Integral b0 => b0 -> (a, b) -> (a, b) # Semigroup a => Semigroup (ST s a) Since: base-4.11.0.0 Instance detailsDefined in GHC.ST Methods(<>) :: ST s a -> ST s a -> ST s a #sconcat :: NonEmpty (ST s a) -> ST s a #stimes :: Integral b => b -> ST s a -> ST s a # Since: base-4.9.0.0 Instance detailsDefined in Data.Proxy Methods(<>) :: Proxy s -> Proxy s -> Proxy s #sconcat :: NonEmpty (Proxy s) -> Proxy s #stimes :: Integral b => b -> Proxy s -> Proxy s # Ord k => Semigroup (Map k v) Instance detailsDefined in Data.Map.Internal Methods(<>) :: Map k v -> Map k v -> Map k v #sconcat :: NonEmpty (Map k v) -> Map k v #stimes :: Integral b => b -> Map k v -> Map k v # (MonadBaseControl IO m, Semigroup a) => Semigroup (Concurrently m a) Instance detailsDefined in Control.Concurrent.Async.Lifted Methods(<>) :: Concurrently m a -> Concurrently m a -> Concurrently m a #sconcat :: NonEmpty (Concurrently m a) -> Concurrently m a #stimes :: Integral b => b -> Concurrently m a -> Concurrently m a # (Monad m, Semigroup a) => Semigroup (GenT m a) Source # Instance detailsDefined in Hedgehog.Internal.Gen Methods(<>) :: GenT m a -> GenT m a -> GenT m a #sconcat :: NonEmpty (GenT m a) -> GenT m a #stimes :: Integral b => b -> GenT m a -> GenT m a # Semigroup (f p) => Semigroup (Rec1 f p) Since: base-4.12.0.0 Instance detailsDefined in GHC.Generics Methods(<>) :: Rec1 f p -> Rec1 f p -> Rec1 f p #sconcat :: NonEmpty (Rec1 f p) -> Rec1 f p #stimes :: Integral b => b -> Rec1 f p -> Rec1 f p # (Semigroup a, Semigroup b, Semigroup c) => Semigroup (a, b, c) Since: base-4.9.0.0 Instance detailsDefined in GHC.Base Methods(<>) :: (a, b, c) -> (a, b, c) -> (a, b, c) #sconcat :: NonEmpty (a, b, c) -> (a, b, c) #stimes :: Integral b0 => b0 -> (a, b, c) -> (a, b, c) # Semigroup a => Semigroup (Const a b) Since: base-4.9.0.0 Instance detailsDefined in Data.Functor.Const Methods(<>) :: Const a b -> Const a b -> Const a b #sconcat :: NonEmpty (Const a b) -> Const a b #stimes :: Integral b0 => b0 -> Const a b -> Const a b # (Applicative f, Semigroup a) => Semigroup (Ap f a) Since: base-4.12.0.0 Instance detailsDefined in Data.Monoid Methods(<>) :: Ap f a -> Ap f a -> Ap f a #sconcat :: NonEmpty (Ap f a) -> Ap f a #stimes :: Integral b => b -> Ap f a -> Ap f a # Alternative f => Semigroup (Alt f a) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup.Internal Methods(<>) :: Alt f a -> Alt f a -> Alt f a #sconcat :: NonEmpty (Alt f a) -> Alt f a #stimes :: Integral b => b -> Alt f a -> Alt f a # Semigroup c => Semigroup (K1 i c p) Since: base-4.12.0.0 Instance detailsDefined in GHC.Generics Methods(<>) :: K1 i c p -> K1 i c p -> K1 i c p #sconcat :: NonEmpty (K1 i c p) -> K1 i c p #stimes :: Integral b => b -> K1 i c p -> K1 i c p # (Semigroup (f p), Semigroup (g p)) => Semigroup ((f :*: g) p) Since: base-4.12.0.0 Instance detailsDefined in GHC.Generics Methods(<>) :: (f :*: g) p -> (f :*: g) p -> (f :*: g) p #sconcat :: NonEmpty ((f :*: g) p) -> (f :*: g) p #stimes :: Integral b => b -> (f :*: g) p -> (f :*: g) p # (Semigroup a, Semigroup b, Semigroup c, Semigroup d) => Semigroup (a, b, c, d) Since: base-4.9.0.0 Instance detailsDefined in GHC.Base Methods(<>) :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) #sconcat :: NonEmpty (a, b, c, d) -> (a, b, c, d) #stimes :: Integral b0 => b0 -> (a, b, c, d) -> (a, b, c, d) # Semigroup (f p) => Semigroup (M1 i c f p) Since: base-4.12.0.0 Instance detailsDefined in GHC.Generics Methods(<>) :: M1 i c f p -> M1 i c f p -> M1 i c f p #sconcat :: NonEmpty (M1 i c f p) -> M1 i c f p #stimes :: Integral b => b -> M1 i c f p -> M1 i c f p # Semigroup (f (g p)) => Semigroup ((f :.: g) p) Since: base-4.12.0.0 Instance detailsDefined in GHC.Generics Methods(<>) :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p #sconcat :: NonEmpty ((f :.: g) p) -> (f :.: g) p #stimes :: Integral b => b -> (f :.: g) p -> (f :.: g) p # (Semigroup a, Semigroup b, Semigroup c, Semigroup d, Semigroup e) => Semigroup (a, b, c, d, e) Since: base-4.9.0.0 Instance detailsDefined in GHC.Base Methods(<>) :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) #sconcat :: NonEmpty (a, b, c, d, e) -> (a, b, c, d, e) #stimes :: Integral b0 => b0 -> (a, b, c, d, e) -> (a, b, c, d, e) # class Monad m => MonadFail (m :: Type -> Type) # 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  Since: base-4.9.0.0 Minimal complete definition fail #### Instances Instances details  Since: base-4.9.0.0 Instance detailsDefined in Control.Monad.Fail Methodsfail :: String -> [a] # Since: base-4.9.0.0 Instance detailsDefined in Control.Monad.Fail Methodsfail :: String -> Maybe a # Since: base-4.9.0.0 Instance detailsDefined in Control.Monad.Fail Methodsfail :: String -> IO a # Instance detailsDefined in Language.Haskell.TH.Syntax Methodsfail :: String -> Q a # Since: base-4.9.0.0 Instance detailsDefined in Text.ParserCombinators.ReadPrec Methodsfail :: String -> ReadPrec a # Since: base-4.9.0.0 Instance detailsDefined in Text.ParserCombinators.ReadP Methodsfail :: String -> ReadP a # Since: base-4.9.0.0 Instance detailsDefined in Text.ParserCombinators.ReadP Methodsfail :: String -> P a # MonadFail (ST s) Since: base-4.11.0.0 Instance detailsDefined in GHC.ST Methodsfail :: String -> ST s a # MonadFail (ST s) Since: base-4.10 Instance detailsDefined in Control.Monad.ST.Lazy.Imp Methodsfail :: String -> ST s a # Monad m => MonadFail (MaybeT m) Instance detailsDefined in Control.Monad.Trans.Maybe Methodsfail :: String -> MaybeT m a # Monad m => MonadFail (ListT m) Instance detailsDefined in Control.Monad.Trans.List Methodsfail :: String -> ListT m a # MonadFail m => MonadFail (ResourceT m) Since: resourcet-1.2.2 Instance detailsDefined in Control.Monad.Trans.Resource.Internal Methodsfail :: String -> ResourceT m a # Monad m => MonadFail (GenT m) Source # Instance detailsDefined in Hedgehog.Internal.Gen Methodsfail :: String -> GenT m a # Monad m => MonadFail (TestT m) Source # Instance detailsDefined in Hedgehog.Internal.Property Methodsfail :: String -> TestT m a # Monad m => MonadFail (PropertyT m) Source # Instance detailsDefined in Hedgehog.Internal.Property Methodsfail :: String -> PropertyT m a # MonadFail f => MonadFail (Ap f) Since: base-4.12.0.0 Instance detailsDefined in Data.Monoid Methodsfail :: String -> Ap f a # MonadFail m => MonadFail (ExceptT e m) Instance detailsDefined in Control.Monad.Trans.Except Methodsfail :: String -> ExceptT e m a # (Monoid w, MonadFail m) => MonadFail (WriterT w m) Instance detailsDefined in Control.Monad.Trans.Writer.Lazy Methodsfail :: String -> WriterT w m a # MonadFail m => MonadFail (StateT s m) Instance detailsDefined in Control.Monad.Trans.State.Lazy Methodsfail :: String -> StateT s m a # MonadFail m => MonadFail (ReaderT r m) Instance detailsDefined in Control.Monad.Trans.Reader Methodsfail :: String -> ReaderT r m a # (Monad m, Error e) => MonadFail (ErrorT e m) Instance detailsDefined in Control.Monad.Trans.Error Methodsfail :: String -> ErrorT e m a # MonadFail m => MonadFail (IdentityT m) Instance detailsDefined in Control.Monad.Trans.Identity Methodsfail :: String -> IdentityT m a # MonadFail m => MonadFail (StateT s m) Instance detailsDefined in Control.Monad.Trans.State.Strict Methodsfail :: String -> StateT s m a # (Monoid w, MonadFail m) => MonadFail (WriterT w m) Instance detailsDefined in Control.Monad.Trans.Writer.Strict Methodsfail :: String -> WriterT w m a # (Monoid w, MonadFail m) => MonadFail (AccumT w m) Instance detailsDefined in Control.Monad.Trans.Accum Methodsfail :: String -> AccumT w m a # MonadFail m => MonadFail (WriterT w m) Instance detailsDefined in Control.Monad.Trans.Writer.CPS Methodsfail :: String -> WriterT w m a # MonadFail m => MonadFail (SelectT r m) Instance detailsDefined in Control.Monad.Trans.Select Methodsfail :: String -> SelectT r m a # MonadFail m => MonadFail (ContT r m) Instance detailsDefined in Control.Monad.Trans.Cont Methodsfail :: String -> ContT r m a # (Monoid w, MonadFail m) => MonadFail (RWST r w s m) Instance detailsDefined in Control.Monad.Trans.RWS.Lazy Methodsfail :: String -> RWST r w s m a # (Monoid w, MonadFail m) => MonadFail (RWST r w s m) Instance detailsDefined in Control.Monad.Trans.RWS.Strict Methodsfail :: String -> RWST r w s m a # MonadFail m => MonadFail (RWST r w s m) Instance detailsDefined in Control.Monad.Trans.RWS.CPS Methodsfail :: String -> RWST r w s m a # (++) :: [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. 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. 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 = ... ($) :: 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

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.Int Methods Since: base-2.1 Instance detailsDefined in GHC.Int Methods Since: base-2.1 Instance detailsDefined in GHC.Int Methods Since: base-2.1 Instance detailsDefined in GHC.Int 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.Word Methods Since: base-2.1 Instance detailsDefined in GHC.Word Methods Since: base-2.1 Instance detailsDefined in GHC.Word Methods Since: base-2.1 Instance detailsDefined in GHC.Word 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 :: () # Instance detailsDefined in System.Console.ANSI.Types Methods Instance detailsDefined in System.Console.ANSI.Types Methods Instance detailsDefined in System.Console.ANSI.Types Methods Instance detailsDefined in System.Console.ANSI.Types Methods Instance detailsDefined in System.Console.ANSI.Types Methods Instance detailsDefined in System.Console.ANSI.Types Methods Since: base-2.1 Instance detailsDefined in Data.Semigroup.Internal Methods Since: base-2.1 Instance detailsDefined in Data.Semigroup.Internal 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.Generics Methods Since: base-2.1 Instance detailsDefined in GHC.Unicode Methods Instance detailsDefined in GHC.LanguageExtensions.Type Methods Bounded a => Bounded (Min a) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup MethodsminBound :: Min a #maxBound :: Min a # Bounded a => Bounded (Max a) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup MethodsminBound :: Max a #maxBound :: Max a # Bounded a => Bounded (First a) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup Methods Bounded a => Bounded (Last a) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup Methods Bounded m => Bounded (WrappedMonoid m) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup Methods Bounded a => Bounded (Identity a) Since: base-4.9.0.0 Instance detailsDefined in Data.Functor.Identity Methods Bounded a => Bounded (Dual a) Since: base-2.1 Instance detailsDefined in Data.Semigroup.Internal Methods Bounded a => Bounded (Sum a) Since: base-2.1 Instance detailsDefined in Data.Semigroup.Internal MethodsminBound :: Sum a #maxBound :: Sum a # Bounded a => Bounded (Product a) Since: base-2.1 Instance detailsDefined in Data.Semigroup.Internal Methods Bounded a => Bounded (Down a) Since: base-4.14.0.0 Instance detailsDefined in Data.Ord Methods (Bounded a, Bounded b) => Bounded (a, b) Since: base-2.1 Instance detailsDefined in GHC.Enum MethodsminBound :: (a, b) #maxBound :: (a, b) # Bounded (Proxy t) Since: base-4.7.0.0 Instance detailsDefined in Data.Proxy Methods (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 a => Bounded (Const a b) Since: base-4.9.0.0 Instance detailsDefined in Data.Functor.Const MethodsminBound :: Const a b #maxBound :: Const a b # (Applicative f, Bounded a) => Bounded (Ap f a) Since: base-4.12.0.0 Instance detailsDefined in Data.Monoid MethodsminBound :: Ap f a #maxBound :: Ap f a # (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
| 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

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 # Since: base-2.1 Instance detailsDefined in GHC.Int Methods(==) :: Int8 -> Int8 -> Bool #(/=) :: Int8 -> Int8 -> Bool # Since: base-2.1 Instance detailsDefined in GHC.Int Methods(==) :: Int16 -> Int16 -> Bool #(/=) :: Int16 -> Int16 -> Bool # Since: base-2.1 Instance detailsDefined in GHC.Int Methods(==) :: Int32 -> Int32 -> Bool #(/=) :: Int32 -> Int32 -> Bool # Since: base-2.1 Instance detailsDefined in GHC.Int Methods(==) :: Int64 -> Int64 -> Bool #(/=) :: Int64 -> Int64 -> 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 # Since: base-2.1 Instance detailsDefined in GHC.Word Methods(==) :: Word8 -> Word8 -> Bool #(/=) :: Word8 -> Word8 -> Bool # Since: base-2.1 Instance detailsDefined in GHC.Word Methods(==) :: Word16 -> Word16 -> Bool #(/=) :: Word16 -> Word16 -> Bool # Since: base-2.1 Instance detailsDefined in GHC.Word Methods(==) :: Word32 -> Word32 -> Bool #(/=) :: Word32 -> Word32 -> Bool # Since: base-2.1 Instance detailsDefined in GHC.Word Methods(==) :: Word64 -> Word64 -> Bool #(/=) :: Word64 -> Word64 -> Bool # Instance detailsDefined in Data.Typeable.Internal Methods 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 # Instance detailsDefined in System.Console.ANSI.Types Methods(==) :: Color -> Color -> Bool #(/=) :: Color -> Color -> Bool # Instance detailsDefined in System.Console.ANSI.Types Methods Instance detailsDefined in System.Console.ANSI.Types Methods Instance detailsDefined in System.Console.ANSI.Types Methods Instance detailsDefined in System.Console.ANSI.Types Methods Instance detailsDefined in System.Console.ANSI.Types Methods Instance detailsDefined in System.Console.ANSI.Types Methods(==) :: SGR -> SGR -> Bool #(/=) :: SGR -> SGR -> Bool # Since: base-4.1.0.0 Instance detailsDefined in GHC.IO.Handle.Types Methods(==) :: Handle -> Handle -> Bool #(/=) :: Handle -> Handle -> Bool # Since: base-4.2.0.0 Instance detailsDefined in GHC.Conc.Sync Methods Instance detailsDefined in Control.Concurrent.Async Methods Since: base-4.8.0.0 Instance detailsDefined in Data.Void Methods(==) :: Void -> Void -> Bool #(/=) :: Void -> Void -> Bool # Since: base-4.3.0.0 Instance detailsDefined in GHC.Exts Methods Since: base-2.1 Instance detailsDefined in Data.Version Methods(==) :: Version -> Version -> Bool #(/=) :: Version -> Version -> Bool # Since: base-4.1.0.0 Instance detailsDefined in GHC.IO.Handle Methods Since: base-4.3.0.0 Instance detailsDefined in GHC.Conc.Sync Methods Since: base-4.3.0.0 Instance detailsDefined in GHC.Conc.Sync 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.2.0.0 Instance detailsDefined in GHC.IO.Handle.Types Methods Since: base-4.2.0.0 Instance detailsDefined in GHC.IO.Handle.Types Methods(==) :: Newline -> Newline -> Bool #(/=) :: Newline -> Newline -> Bool # Since: base-4.2.0.0 Instance detailsDefined in GHC.IO.Handle.Types 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-2.1 Instance detailsDefined in Data.Semigroup.Internal Methods(==) :: All -> All -> Bool #(/=) :: All -> All -> Bool # Since: base-2.1 Instance detailsDefined in Data.Semigroup.Internal Methods(==) :: Any -> Any -> Bool #(/=) :: Any -> Any -> Bool # 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-2.1 Instance detailsDefined in GHC.Unicode Methods Since: base-4.9.0.0 Instance detailsDefined in GHC.Stack.Types Methods(==) :: SrcLoc -> SrcLoc -> Bool #(/=) :: SrcLoc -> SrcLoc -> Bool # Instance detailsDefined in Data.ByteString.Short.Internal Methods Instance detailsDefined in Data.ByteString.Internal Methods Instance detailsDefined in System.Console.Regions Methods Instance detailsDefined in System.Console.Regions Methods Instance detailsDefined in System.Console.Concurrent.Internal Methods Instance detailsDefined in System.Console.Concurrent.Internal Methods Instance detailsDefined in System.Console.Concurrent.Internal Methods(==) :: AtEnd -> AtEnd -> Bool #(/=) :: AtEnd -> AtEnd -> Bool # Instance detailsDefined in Data.IntSet.Internal Methods(==) :: IntSet -> IntSet -> Bool #(/=) :: IntSet -> IntSet -> Bool # Instance detailsDefined in GHC.LanguageExtensions.Type Methods Instance detailsDefined in GHC.ForeignSrcLang.Type Methods Instance detailsDefined in GHC.Integer.Type Methods(==) :: BigNat -> BigNat -> Bool #(/=) :: BigNat -> BigNat -> Bool # 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 # Instance detailsDefined in Text.Show.Value Methods(==) :: Value -> Value -> Bool #(/=) :: Value -> Value -> Bool # Instance detailsDefined in System.Random.Internal Methods(==) :: StdGen -> StdGen -> Bool #(/=) :: StdGen -> StdGen -> 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(==) :: Loc -> Loc -> Bool #(/=) :: Loc -> Loc -> Bool # 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.Time.LocalTime.Internal.LocalTime Methods Instance detailsDefined in Data.Time.Clock.Internal.UniversalTime Methods Instance detailsDefined in Data.Time.Clock.Internal.UTCTime Methods(==) :: UTCTime -> UTCTime -> Bool #(/=) :: UTCTime -> UTCTime -> Bool # Instance detailsDefined in Data.Time.Clock.Internal.NominalDiffTime Methods Instance detailsDefined in Data.Time.Calendar.Days Methods(==) :: Day -> Day -> Bool #(/=) :: Day -> Day -> Bool # Source # Instance detailsDefined in Hedgehog.Internal.Config Methods Source # Instance detailsDefined in Hedgehog.Internal.Config Methods Source # Instance detailsDefined in Hedgehog.Internal.Config Methods Source # Instance detailsDefined in Hedgehog.Internal.Queue Methods Source # Instance detailsDefined in Hedgehog.Internal.Range Methods(==) :: Size -> Size -> Bool #(/=) :: Size -> Size -> Bool # Eq LineUpdate Instance detailsDefined in System.Console.Regions Methods(==) :: LineUpdate -> LineUpdate -> Bool #(/=) :: LineUpdate -> LineUpdate -> Bool # Source # Instance detailsDefined in Hedgehog.Internal.Seed Methods(==) :: Seed -> Seed -> Bool #(/=) :: Seed -> Seed -> Bool # Source # Instance detailsDefined in Hedgehog.Internal.Show Methods Source # Instance detailsDefined in Hedgehog.Internal.Show Methods Source # Instance detailsDefined in Hedgehog.Internal.Source Methods(==) :: Span -> Span -> Bool #(/=) :: Span -> Span -> Bool # Source # Instance detailsDefined in Hedgehog.Internal.Source Methods Source # Instance detailsDefined in Hedgehog.Internal.Source Methods(==) :: LineNo -> LineNo -> Bool #(/=) :: LineNo -> LineNo -> Bool # Eq CodePoint Instance detailsDefined in Data.Text.Encoding Methods(==) :: CodePoint -> CodePoint -> Bool #(/=) :: CodePoint -> CodePoint -> Bool # Eq DecoderState Instance detailsDefined in Data.Text.Encoding Methods(==) :: DecoderState -> DecoderState -> Bool #(/=) :: DecoderState -> DecoderState -> Bool # Source # Instance detailsDefined in Hedgehog.Internal.Property Methods Source # Instance detailsDefined in Hedgehog.Internal.Property Methods Source # Instance detailsDefined in Hedgehog.Internal.Property Methods Source # Instance detailsDefined in Hedgehog.Internal.Property Methods(==) :: Cover -> Cover -> Bool #(/=) :: Cover -> Cover -> Bool # Source # Instance detailsDefined in Hedgehog.Internal.Property Methods(==) :: Diff -> Diff -> Bool #(/=) :: Diff -> Diff -> Bool # Source # Instance detailsDefined in Hedgehog.Internal.Property Methods(==) :: Failure -> Failure -> Bool #(/=) :: Failure -> Failure -> Bool # Source # Instance detailsDefined in Hedgehog.Internal.Property Methods(==) :: Journal -> Journal -> Bool #(/=) :: Journal -> Journal -> Bool # Source # Instance detailsDefined in Hedgehog.Internal.Property Methods(==) :: Log -> Log -> Bool #(/=) :: Log -> Log -> Bool # Source # Instance detailsDefined in Hedgehog.Internal.Property Methods Source # Instance detailsDefined in Hedgehog.Internal.Property Methods Source # Instance detailsDefined in Hedgehog.Internal.Property Methods Source # Instance detailsDefined in Hedgehog.Internal.Property Methods Source # Instance detailsDefined in Hedgehog.Internal.Property Methods Source # Instance detailsDefined in Hedgehog.Internal.Property Methods Source # Instance detailsDefined in Hedgehog.Internal.Property Methods Source # Instance detailsDefined in Hedgehog.Internal.Property Methods Source # Instance detailsDefined in Hedgehog.Internal.Property Methods Source # Instance detailsDefined in Hedgehog.Internal.Property Methods Source # Instance detailsDefined in Hedgehog.Internal.Property Methods Source # Instance detailsDefined in Hedgehog.Internal.Property Methods Source # Instance detailsDefined in Hedgehog.Internal.Property Methods Source # Instance detailsDefined in Hedgehog.Internal.State Methods Source # Instance detailsDefined in Hedgehog.Internal.State Methods(==) :: Name -> Name -> Bool #(/=) :: Name -> Name -> Bool # Source # Instance detailsDefined in Hedgehog.Internal.Discovery Methods Source # Instance detailsDefined in Hedgehog.Internal.Discovery Methods Source # Instance detailsDefined in Hedgehog.Internal.Report Methods(==) :: Markup -> Markup -> Bool #(/=) :: Markup -> Markup -> Bool # Source # Instance detailsDefined in Hedgehog.Internal.Report Methods(==) :: Style -> Style -> Bool #(/=) :: Style -> Style -> Bool # Source # Instance detailsDefined in Hedgehog.Internal.Report Methods(==) :: Result -> Result -> Bool #(/=) :: Result -> Result -> Bool # Source # Instance detailsDefined in Hedgehog.Internal.Report Methods Source # Instance detailsDefined in Hedgehog.Internal.Report Methods Source # Instance detailsDefined in Hedgehog.Internal.Report Methods Source # Instance detailsDefined in Hedgehog.Internal.Runner Methods 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 (Ptr a) Since: base-2.1 Instance detailsDefined in GHC.Ptr Methods(==) :: Ptr a -> Ptr a -> Bool #(/=) :: Ptr a -> Ptr a -> Bool # Eq (FunPtr a) Instance detailsDefined in GHC.Ptr Methods(==) :: FunPtr a -> FunPtr a -> Bool #(/=) :: FunPtr a -> FunPtr 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 (Async a) Instance detailsDefined in Control.Concurrent.Async Methods(==) :: Async a -> Async a -> Bool #(/=) :: Async a -> Async a -> Bool # Eq a => Eq (Complex a) Since: base-2.1 Instance detailsDefined in Data.Complex Methods(==) :: Complex a -> Complex a -> Bool #(/=) :: Complex a -> Complex a -> Bool # Eq a => Eq (Min a) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup Methods(==) :: Min a -> Min a -> Bool #(/=) :: Min a -> Min a -> Bool # Eq a => Eq (Max a) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup Methods(==) :: Max a -> Max a -> Bool #(/=) :: Max a -> Max a -> Bool # Eq a => Eq (First a) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup Methods(==) :: First a -> First a -> Bool #(/=) :: First a -> First a -> Bool # Eq a => Eq (Last a) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup Methods(==) :: Last a -> Last a -> Bool #(/=) :: Last a -> Last a -> Bool # Eq m => Eq (WrappedMonoid m) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup Methods(==) :: WrappedMonoid m -> WrappedMonoid m -> Bool #(/=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # Eq a => Eq (Option a) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup Methods(==) :: Option a -> Option a -> Bool #(/=) :: Option a -> Option a -> Bool # Eq a => Eq (ZipList a) Since: base-4.7.0.0 Instance detailsDefined in Control.Applicative Methods(==) :: ZipList a -> ZipList a -> Bool #(/=) :: ZipList a -> ZipList a -> Bool # Eq a => Eq (Identity a) Since: base-4.8.0.0 Instance detailsDefined in Data.Functor.Identity Methods(==) :: Identity a -> Identity a -> Bool #(/=) :: Identity a -> Identity a -> Bool # Eq (TVar a) Since: base-4.8.0.0 Instance detailsDefined in GHC.Conc.Sync Methods(==) :: TVar a -> TVar a -> Bool #(/=) :: TVar a -> TVar a -> Bool # Eq (IORef a) Pointer equality.Since: base-4.0.0.0 Instance detailsDefined in GHC.IORef Methods(==) :: IORef a -> IORef a -> Bool #(/=) :: IORef a -> IORef a -> Bool # Eq a => Eq (First a) Since: base-2.1 Instance detailsDefined in Data.Monoid Methods(==) :: First a -> First a -> Bool #(/=) :: First a -> First a -> Bool # Eq a => Eq (Last a) Since: base-2.1 Instance detailsDefined in Data.Monoid Methods(==) :: Last a -> Last a -> Bool #(/=) :: Last a -> Last a -> Bool # Eq a => Eq (Dual a) Since: base-2.1 Instance detailsDefined in Data.Semigroup.Internal Methods(==) :: Dual a -> Dual a -> Bool #(/=) :: Dual a -> Dual a -> Bool # Eq a => Eq (Sum a) Since: base-2.1 Instance detailsDefined in Data.Semigroup.Internal Methods(==) :: Sum a -> Sum a -> Bool #(/=) :: Sum a -> Sum a -> Bool # Eq a => Eq (Product a) Since: base-2.1 Instance detailsDefined in Data.Semigroup.Internal Methods(==) :: Product a -> Product a -> Bool #(/=) :: Product a -> Product a -> Bool # Eq a => Eq (Down a) Since: base-4.6.0.0 Instance detailsDefined in Data.Ord Methods(==) :: Down a -> Down a -> Bool #(/=) :: Down a -> Down a -> Bool # Eq (MVar a) Since: base-4.1.0.0 Instance detailsDefined in GHC.MVar Methods(==) :: MVar a -> MVar a -> Bool #(/=) :: MVar a -> MVar a -> 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 # Eq a => Eq (Colour a) Instance detailsDefined in Data.Colour.Internal Methods(==) :: Colour a -> Colour a -> Bool #(/=) :: Colour a -> Colour a -> Bool # Eq a => Eq (AlphaColour a) Instance detailsDefined in Data.Colour.Internal Methods(==) :: AlphaColour a -> AlphaColour a -> Bool #(/=) :: AlphaColour a -> AlphaColour a -> Bool # Eq a => Eq (IntMap a) Instance detailsDefined in Data.IntMap.Internal Methods(==) :: IntMap a -> IntMap a -> Bool #(/=) :: IntMap a -> IntMap a -> Bool # Eq a => Eq (Tree a) Instance detailsDefined in Data.Tree Methods(==) :: Tree a -> Tree a -> Bool #(/=) :: Tree a -> Tree a -> Bool # Eq a => Eq (Seq a) Instance detailsDefined in Data.Sequence.Internal Methods(==) :: Seq a -> Seq a -> Bool #(/=) :: Seq a -> Seq a -> Bool # Eq a => Eq (ViewL a) Instance detailsDefined in Data.Sequence.Internal Methods(==) :: ViewL a -> ViewL a -> Bool #(/=) :: ViewL a -> ViewL a -> Bool # Eq a => Eq (ViewR a) Instance detailsDefined in Data.Sequence.Internal Methods(==) :: ViewR a -> ViewR a -> Bool #(/=) :: ViewR a -> ViewR a -> Bool # Eq a => Eq (Set a) Instance detailsDefined in Data.Set.Internal Methods(==) :: Set a -> Set a -> Bool #(/=) :: Set a -> Set 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 (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 g => Eq (StateGen g) Instance detailsDefined in System.Random.Internal Methods(==) :: StateGen g -> StateGen g -> Bool #(/=) :: StateGen g -> StateGen g -> Bool # Eq (TMVar a) Instance detailsDefined in Control.Concurrent.STM.TMVar Methods(==) :: TMVar a -> TMVar a -> Bool #(/=) :: TMVar a -> TMVar a -> Bool # Eq a => Eq (Window a) Instance detailsDefined in System.Console.Terminal.Common Methods(==) :: Window a -> Window a -> Bool #(/=) :: Window a -> Window a -> Bool # Eq a => Eq (Opaque a) Source # Instance detailsDefined in Hedgehog.Internal.Opaque Methods(==) :: Opaque a -> Opaque a -> Bool #(/=) :: Opaque a -> Opaque a -> Bool # Eq a => Eq (Coverage a) Source # Instance detailsDefined in Hedgehog.Internal.Property Methods(==) :: Coverage a -> Coverage a -> Bool #(/=) :: Coverage a -> Coverage a -> Bool # Eq a => Eq (Label a) Source # Instance detailsDefined in Hedgehog.Internal.Property Methods(==) :: Label a -> Label a -> Bool #(/=) :: Label a -> Label a -> Bool # Eq a => Eq (Concrete a) Source # Instance detailsDefined in Hedgehog.Internal.State Methods(==) :: Concrete a -> Concrete a -> Bool #(/=) :: Concrete a -> Concrete a -> Bool # Eq (Symbolic a) Source # Instance detailsDefined in Hedgehog.Internal.State Methods(==) :: Symbolic a -> Symbolic a -> Bool #(/=) :: Symbolic a -> Symbolic a -> Bool # Eq a => Eq (Pos a) Source # Instance detailsDefined in Hedgehog.Internal.Discovery Methods(==) :: Pos a -> Pos a -> Bool #(/=) :: Pos a -> Pos 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 (TypeRep a) Since: base-2.1 Instance detailsDefined in Data.Typeable.Internal Methods(==) :: TypeRep a -> TypeRep a -> Bool #(/=) :: TypeRep a -> TypeRep a -> Bool # (Eq a, Eq b) => Eq (a, b) Instance detailsDefined in GHC.Classes Methods(==) :: (a, b) -> (a, b) -> Bool #(/=) :: (a, b) -> (a, b) -> Bool # (Ix i, Eq e) => Eq (Array i e) Since: base-2.1 Instance detailsDefined in GHC.Arr Methods(==) :: Array i e -> Array i e -> Bool #(/=) :: Array i e -> Array i e -> Bool # Eq (Fixed a) Since: base-2.1 Instance detailsDefined in Data.Fixed Methods(==) :: Fixed a -> Fixed a -> Bool #(/=) :: Fixed a -> Fixed a -> Bool # Eq a => Eq (Arg a b) Since: base-4.9.0.0 Instance detailsDefined in Data.Semigroup Methods(==) :: Arg a b -> Arg a b -> Bool #(/=) :: Arg a b -> Arg a b -> Bool # Eq (Proxy s) Since: base-4.7.0.0 Instance detailsDefined in Data.Proxy Methods(==) :: Proxy s -> Proxy s -> Bool #(/=) :: Proxy s -> Proxy s -> Bool # Eq (STRef s a) Pointer equality.Since: base-2.1 Instance detailsDefined in GHC.STRef Methods(==) :: STRef s a -> STRef s a -> Bool #(/=) :: STRef s a -> STRef s a -> Bool # (Eq k, Eq a) => Eq (Map k a) Instance detailsDefined in Data.Map.Internal Methods(==) :: Map k a -> Map k a -> Bool #(/=) :: Map k a -> Map k a -> 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 a, Eq1 m) => Eq (NodeT m a) Source # Instance detailsDefined in Hedgehog.Internal.Tree Methods(==) :: NodeT m a -> NodeT m a -> Bool #(/=) :: NodeT m a -> NodeT m a -> Bool # (Eq1 m, Eq a) => Eq (TreeT m a) Source # Instance detailsDefined in Hedgehog.Internal.Tree Methods(==) :: TreeT m a -> TreeT m a -> Bool #(/=) :: TreeT m a -> TreeT m a -> Bool # (Eq a, Eq1 v) => Eq (Var a v) Source # Instance detailsDefined in Hedgehog.Internal.State Methods(==) :: Var a v -> Var a v -> Bool #(/=) :: Var a v -> Var a 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 # Eq (STArray s i e) Since: base-2.1 Instance detailsDefined in GHC.Arr Methods(==) :: STArray s i e -> STArray s i e -> Bool #(/=) :: STArray s i e -> STArray s i e -> Bool # Eq a => Eq (Const a b) Since: base-4.9.0.0 Instance detailsDefined in Data.Functor.Const Methods(==) :: Const a b -> Const a b -> Bool #(/=) :: Const a b -> Const a b -> Bool # Eq (f a) => Eq (Ap f a) Since: base-4.12.0.0 Instance detailsDefined in Data.Monoid Methods(==) :: Ap f a -> Ap f a -> Bool #(/=) :: Ap f a -> Ap f a -> Bool # Eq (f a) => Eq (Alt f a) Since: base-4.8.0.0 Instance detailsDefined in Data.Semigroup.Internal Methods(==) :: Alt f a -> Alt f a -> Bool #(/=) :: Alt f a -> Alt f 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 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 (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 # (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 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 # (Eq1 f, Eq1 g, Eq a) => Eq (Product f g a) Since: base-4.9.0.0 Instance detailsDefined in Data.Functor.Product Methods(==) :: Product f g a -> Product f g a -> Bool #(/=) :: Product f g a -> Product f g a -> Bool # (Eq1 f, Eq1 g, Eq a) => Eq (Sum f g a) Since: base-4.9.0.0 Instance detailsDefined in Data.Functor.Sum Methods(==) :: Sum f g a -> Sum f g a -> Bool #(/=) :: Sum f g a -> Sum f g a -> 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 # (Eq1 f, Eq1 g, Eq a) => Eq (Compose f g a) Since: base-4.9.0.0 Instance detailsDefined in Data.Functor.Compose Methods(==) :: Compose f g a -> Compose f g a -> Bool #(/=) :: Compose f g a -> Compose f g a -> 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 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 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 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 # RealFloat a => Floating (Complex a) Since: base-2.1 Instance detailsDefined in Data.Complex Methodspi :: Complex a #exp :: Complex a -> Complex a #log :: Complex a -> Complex a #sqrt :: Complex a -> Complex a #(**) :: Complex a -> Complex a -> Complex a #logBase :: Complex a -> Complex a -> Complex a #sin :: Complex a -> Complex a #cos :: Complex a -> Complex a #tan :: Complex a -> Complex a #asin :: Complex a -> Complex a #acos :: Complex a -> Complex a #atan :: Complex a -> Complex a #sinh :: Complex a -> Complex a #cosh :: Complex a -> Complex a #tanh :: Complex a -> Complex a #asinh :: Complex a -> Complex a #acosh :: Complex a -> Complex a #atanh :: Complex a -> Complex a #log1p :: Complex a -> Complex a #expm1 :: Complex a -> Complex a #log1pexp :: Complex a -> Complex a #log1mexp :: Complex a -> Complex a # Floating a => Floating (Identity a) Since: base-4.9.0.0 Instance detailsDefined in Data.Functor.Identity Methodspi :: Identity a #exp :: Identity a -> Identity a #log :: Identity a -> Identity a #sqrt :: Identity a -> Identity a #(**) :: Identity a -> Identity a -> Identity a #logBase :: Identity a -> Identity a -> Identity a #sin :: Identity a -> Identity a #cos :: Identity a -> Identity a #tan :: Identity a -> Identity a #asin :: Identity a -> Identity a #acos :: Identity a -> Identity a #atan :: Identity a -> Identity a #sinh :: Identity a -> Identity a #cosh :: Identity a -> Identity a #tanh :: Identity a -> Identity a #asinh :: Identity a -> Identity a #acosh :: Identity a -> Identity a #atanh :: Identity a -> Identity a #log1p :: Identity a -> Identity a #expm1 :: Identity a -> Identity a #log1pexp :: Identity a -> Identity a #log1mexp :: Identity a -> Identity a # Floating a => Floating (Down a) Since: base-4.14.0.0 Instance detailsDefined in Data.Ord Methodspi :: Down a #exp :: Down a -> Down a #log :: Down a -> Down a #sqrt :: Down a -> Down a #(**) :: Down a -> Down a -> Down a #logBase :: Down a -> Down a -> Down a #sin :: Down a -> Down a #cos :: Down a -> Down a #tan :: Down a -> Down a #asin :: Down a -> Down a #acos :: Down a -> Down a #atan :: Down a -> Down a #sinh :: Down a -> Down a #cosh :: Down a -> Down a #tanh :: Down a -> Down a #asinh :: Down a -> Down a #acosh :: Down a -> Down a #atanh :: Down a -> Down a #log1p :: Down a -> Down a #expm1 :: Down a -> Down a #log1pexp :: Down a -> Down a #log1mexp :: Down a -> Down a # Floating a => Floating (Const a b) Since: base-4.9.0.0 Instance detailsDefined in Data.Functor.Const Methodspi :: Const a b #exp :: Const a b -> Const a b #log :: Const a b -> Const a b #sqrt :: Const a b -> Const a b #(**) :: Const a b -> Const a b -> Const a b #logBase :: Const a b -> Const a b -> Const a b #sin :: Const a b -> Const a b #cos :: Const a b -> Const a b #tan :: Const a b -> Const a b #asin :: Const a b -> Const a b #acos :: Const a b -> Const a b #atan :: Const a b -> Const a b #sinh :: Const a b -> Const a b #cosh :: Const a b -> Const a b #tanh :: Const a b -> Const a b #asinh :: Const a b -> Const a b #acosh :: Const a b -> Const a b #atanh :: Const a b -> Const a b #log1p :: Const a b -> Const a b #expm1 :: Const a b -> Const a b #log1pexp :: Const a b -> Const a b #log1mexp :: Const a b -> Const a b #

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
 Instance detailsDefined in Data.Time.Clock.Internal.NominalDiffTime Methods Source # Instance detailsDefined in Hedgehog.Internal.Property 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 # RealFloat a => Fractional (Complex a) Since: base-2.1 Instance detailsDefined in Data.Complex Methods(/) :: Complex a -> Complex a -> Complex a #recip :: Complex a -> Complex a # Fractional a => Fractional (Identity a) Since: base-4.9.0.0 Instance detailsDefined in Data.Functor.Identity Methods(/) :: Identity a -> Identity a -> Identity a #recip :: Identity a -> Identity a #