Safe Haskell	None
Language	Haskell2010

Lorentz.Prelude

Description

Commonly used parts of regular Prelude.

Synopsis

($) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
(.) :: (b -> c) -> (a -> b) -> a -> c
(&) :: a -> (a -> b) -> b
type ($) (f :: k1 -> k) (a :: k1) = f a
class Eq a
class Eq a => Ord a
class Bounded a where
- minBound :: a
- maxBound :: a
class Semigroup a where
- (<>) :: a -> a -> a
- sconcat :: NonEmpty a -> a
- stimes :: Integral b => b -> a -> a
class Semigroup a => Monoid a where
- mempty :: a
- mappend :: a -> a -> a
- mconcat :: [a] -> a
class Generic a
data Text
data Either a b
- = Left a
- | Right b
data Maybe a
- = Nothing
- | Just a
data Proxy (t :: k) = Proxy
fromString :: IsString a => String -> a
undefined :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => a
error :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => Text -> a
(!) :: WithParam p fn fn' => fn -> Param p -> fn'

Documentation

($) :: 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.

(.) :: (b -> c) -> (a -> b) -> a -> c infixr 9 #

Function composition.

(&) :: a -> (a -> b) -> b infixl 1 #

& is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator $, which allows & to be nested in $.

>>> 5 & (+1) & show
"6"

Since: base-4.8.0.0

type ($) (f :: k1 -> k) (a :: k1) = f a infixr 2 #

Infix application.

f :: Either String $ Maybe Int
=
f :: Either String (Maybe Int)

class Eq a #

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

(==) | (/=)

Instances

Instances details

Eq Bool
Instance details Defined in GHC.Classes Methods (==) :: Bool -> Bool -> Bool # (/=) :: Bool -> Bool -> Bool #
Eq Char
Instance details Defined in GHC.Classes Methods (==) :: Char -> Char -> Bool # (/=) :: Char -> Char -> Bool #
Eq Double	Note that due to the presence of `NaN`, `Double`'s `Eq` instance does not satisfy reflexivity. `>>>` `0/0 == (0/0 :: Double)`False Also note that `Double`'s `Eq` instance does not satisfy substitutivity: `>>>` `0 == (-0 :: Double)`True `>>>` `recip 0 == recip (-0 :: Double)`False
Instance details Defined in GHC.Classes Methods (==) :: Double -> Double -> Bool # (/=) :: Double -> Double -> Bool #
Eq Float	Note that due to the presence of `NaN`, `Float`'s `Eq` instance does not satisfy reflexivity. `>>>` `0/0 == (0/0 :: Float)`False Also note that `Float`'s `Eq` instance does not satisfy substitutivity: `>>>` `0 == (-0 :: Float)`True `>>>` `recip 0 == recip (-0 :: Float)`False
Instance details Defined in GHC.Classes Methods (==) :: Float -> Float -> Bool # (/=) :: Float -> Float -> Bool #
Eq Int
Instance details Defined in GHC.Classes Methods (==) :: Int -> Int -> Bool # (/=) :: Int -> Int -> Bool #
Eq Int8	Since: base-2.1
Instance details Defined in GHC.Int Methods (==) :: Int8 -> Int8 -> Bool # (/=) :: Int8 -> Int8 -> Bool #
Eq Int16	Since: base-2.1
Instance details Defined in GHC.Int Methods (==) :: Int16 -> Int16 -> Bool # (/=) :: Int16 -> Int16 -> Bool #
Eq Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods (==) :: Int32 -> Int32 -> Bool # (/=) :: Int32 -> Int32 -> Bool #
Eq Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods (==) :: Int64 -> Int64 -> Bool # (/=) :: Int64 -> Int64 -> Bool #
Eq Integer
Instance details Defined in GHC.Integer.Type Methods (==) :: Integer -> Integer -> Bool # (/=) :: Integer -> Integer -> Bool #
Eq Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Natural Methods (==) :: Natural -> Natural -> Bool # (/=) :: Natural -> Natural -> Bool #
Eq Ordering
Instance details Defined in GHC.Classes Methods (==) :: Ordering -> Ordering -> Bool # (/=) :: Ordering -> Ordering -> Bool #
Eq Word
Instance details Defined in GHC.Classes Methods (==) :: Word -> Word -> Bool # (/=) :: Word -> Word -> Bool #
Eq Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods (==) :: Word8 -> Word8 -> Bool # (/=) :: Word8 -> Word8 -> Bool #
Eq Word16	Since: base-2.1
Instance details Defined in GHC.Word Methods (==) :: Word16 -> Word16 -> Bool # (/=) :: Word16 -> Word16 -> Bool #
Eq Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods (==) :: Word32 -> Word32 -> Bool # (/=) :: Word32 -> Word32 -> Bool #
Eq Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods (==) :: Word64 -> Word64 -> Bool # (/=) :: Word64 -> Word64 -> Bool #
Eq SomeTypeRep
Instance details Defined in Data.Typeable.Internal Methods (==) :: SomeTypeRep -> SomeTypeRep -> Bool # (/=) :: SomeTypeRep -> SomeTypeRep -> Bool #
Eq Exp
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Exp -> Exp -> Bool # (/=) :: Exp -> Exp -> Bool #
Eq Match
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Match -> Match -> Bool # (/=) :: Match -> Match -> Bool #
Eq Clause
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Clause -> Clause -> Bool # (/=) :: Clause -> Clause -> Bool #
Eq Pat
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Pat -> Pat -> Bool # (/=) :: Pat -> Pat -> Bool #
Eq Type
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Type -> Type -> Bool # (/=) :: Type -> Type -> Bool #
Eq Dec
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Dec -> Dec -> Bool # (/=) :: Dec -> Dec -> Bool #
Eq Name
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Name -> Name -> Bool # (/=) :: Name -> Name -> Bool #
Eq FunDep
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: FunDep -> FunDep -> Bool # (/=) :: FunDep -> FunDep -> Bool #
Eq InjectivityAnn
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: InjectivityAnn -> InjectivityAnn -> Bool # (/=) :: InjectivityAnn -> InjectivityAnn -> Bool #
Eq Overlap
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Overlap -> Overlap -> Bool # (/=) :: Overlap -> Overlap -> Bool #
Eq ()
Instance details Defined in GHC.Classes Methods (==) :: () -> () -> Bool # (/=) :: () -> () -> Bool #
Eq TyCon
Instance details Defined in GHC.Classes Methods (==) :: TyCon -> TyCon -> Bool # (/=) :: TyCon -> TyCon -> Bool #
Eq Module
Instance details Defined in GHC.Classes Methods (==) :: Module -> Module -> Bool # (/=) :: Module -> Module -> Bool #
Eq TrName
Instance details Defined in GHC.Classes Methods (==) :: TrName -> TrName -> Bool # (/=) :: TrName -> TrName -> Bool #
Eq Doc
Instance details Defined in Text.PrettyPrint.HughesPJ Methods (==) :: Doc -> Doc -> Bool # (/=) :: Doc -> Doc -> Bool #
Eq Version	Since: base-2.1
Instance details Defined in Data.Version Methods (==) :: Version -> Version -> Bool # (/=) :: Version -> Version -> Bool #
Eq ByteString
Instance details Defined in Data.ByteString.Internal Methods (==) :: ByteString -> ByteString -> Bool # (/=) :: ByteString -> ByteString -> Bool #
Eq ShortByteString
Instance details Defined in Data.ByteString.Short.Internal Methods (==) :: ShortByteString -> ShortByteString -> Bool # (/=) :: ShortByteString -> ShortByteString -> Bool #
Eq ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods (==) :: ByteString -> ByteString -> Bool # (/=) :: ByteString -> ByteString -> Bool #
Eq ThreadId	Since: base-4.2.0.0
Instance details Defined in GHC.Conc.Sync Methods (==) :: ThreadId -> ThreadId -> Bool # (/=) :: ThreadId -> ThreadId -> Bool #
Eq Language
Instance details Defined in Language.Haskell.Extension Methods (==) :: Language -> Language -> Bool # (/=) :: Language -> Language -> Bool #
Eq Extension
Instance details Defined in Language.Haskell.Extension Methods (==) :: Extension -> Extension -> Bool # (/=) :: Extension -> Extension -> Bool #
Eq KnownExtension
Instance details Defined in Language.Haskell.Extension Methods (==) :: KnownExtension -> KnownExtension -> Bool # (/=) :: KnownExtension -> KnownExtension -> Bool #
Eq CabalSpecVersion
Instance details Defined in Distribution.CabalSpecVersion Methods (==) :: CabalSpecVersion -> CabalSpecVersion -> Bool # (/=) :: CabalSpecVersion -> CabalSpecVersion -> Bool #
Eq HasElif
Instance details Defined in Distribution.CabalSpecVersion Methods (==) :: HasElif -> HasElif -> Bool # (/=) :: HasElif -> HasElif -> Bool #
Eq HasCommonStanzas
Instance details Defined in Distribution.CabalSpecVersion Methods (==) :: HasCommonStanzas -> HasCommonStanzas -> Bool # (/=) :: HasCommonStanzas -> HasCommonStanzas -> Bool #
Eq PWarnType
Instance details Defined in Distribution.Parsec.Warning Methods (==) :: PWarnType -> PWarnType -> Bool # (/=) :: PWarnType -> PWarnType -> Bool #
Eq Position
Instance details Defined in Distribution.Parsec.Position Methods (==) :: Position -> Position -> Bool # (/=) :: Position -> Position -> Bool #
Eq Structure
Instance details Defined in Distribution.Utils.Structured Methods (==) :: Structure -> Structure -> Bool # (/=) :: Structure -> Structure -> Bool #
Eq Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods (==) :: Any -> Any -> Bool # (/=) :: Any -> Any -> Bool #
Eq All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods (==) :: All -> All -> Bool # (/=) :: All -> All -> Bool #
Eq StdGen
Instance details Defined in System.Random.Internal Methods (==) :: StdGen -> StdGen -> Bool # (/=) :: StdGen -> StdGen -> Bool #
Eq Builder
Instance details Defined in Data.Text.Internal.Builder Methods (==) :: Builder -> Builder -> Bool # (/=) :: Builder -> Builder -> Bool #
Eq Scientific	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 details Defined in Data.Scientific Methods (==) :: Scientific -> Scientific -> Bool # (/=) :: Scientific -> Scientific -> Bool #
Eq UTCTime
Instance details Defined in Data.Time.Clock.Internal.UTCTime Methods (==) :: UTCTime -> UTCTime -> Bool # (/=) :: UTCTime -> UTCTime -> Bool #
Eq JSONPathElement
Instance details Defined in Data.Aeson.Types.Internal Methods (==) :: JSONPathElement -> JSONPathElement -> Bool # (/=) :: JSONPathElement -> JSONPathElement -> Bool #
Eq Value
Instance details Defined in Data.Aeson.Types.Internal Methods (==) :: Value -> Value -> Bool # (/=) :: Value -> Value -> Bool #
Eq DotNetTime
Instance details Defined in Data.Aeson.Types.Internal Methods (==) :: DotNetTime -> DotNetTime -> Bool # (/=) :: DotNetTime -> DotNetTime -> Bool #
Eq SumEncoding
Instance details Defined in Data.Aeson.Types.Internal Methods (==) :: SumEncoding -> SumEncoding -> Bool # (/=) :: SumEncoding -> SumEncoding -> Bool #
Eq Handle	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Handle.Types Methods (==) :: Handle -> Handle -> Bool # (/=) :: Handle -> Handle -> Bool #
Eq Pos
Instance details Defined in Data.Attoparsec.Internal.Types Methods (==) :: Pos -> Pos -> Bool # (/=) :: Pos -> Pos -> Bool #
Eq More
Instance details Defined in Data.Attoparsec.Internal.Types Methods (==) :: More -> More -> Bool # (/=) :: More -> More -> Bool #
Eq Void	Since: base-4.8.0.0
Instance details Defined in Data.Void Methods (==) :: Void -> Void -> Bool # (/=) :: Void -> Void -> Bool #
Eq SpecConstrAnnotation	Since: base-4.3.0.0
Instance details Defined in GHC.Exts Methods (==) :: SpecConstrAnnotation -> SpecConstrAnnotation -> Bool # (/=) :: SpecConstrAnnotation -> SpecConstrAnnotation -> Bool #
Eq Constr	Equality of constructors Since: base-4.0.0.0
Instance details Defined in Data.Data Methods (==) :: Constr -> Constr -> Bool # (/=) :: Constr -> Constr -> Bool #
Eq DataRep	Since: base-4.0.0.0
Instance details Defined in Data.Data Methods (==) :: DataRep -> DataRep -> Bool # (/=) :: DataRep -> DataRep -> Bool #
Eq ConstrRep	Since: base-4.0.0.0
Instance details Defined in Data.Data Methods (==) :: ConstrRep -> ConstrRep -> Bool # (/=) :: ConstrRep -> ConstrRep -> Bool #
Eq Fixity	Since: base-4.0.0.0
Instance details Defined in Data.Data Methods (==) :: Fixity -> Fixity -> Bool # (/=) :: Fixity -> Fixity -> Bool #
Eq BlockReason	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods (==) :: BlockReason -> BlockReason -> Bool # (/=) :: BlockReason -> BlockReason -> Bool #
Eq ThreadStatus	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods (==) :: ThreadStatus -> ThreadStatus -> Bool # (/=) :: ThreadStatus -> ThreadStatus -> Bool #
Eq AsyncException	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Exception Methods (==) :: AsyncException -> AsyncException -> Bool # (/=) :: AsyncException -> AsyncException -> Bool #
Eq ArrayException	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Exception Methods (==) :: ArrayException -> ArrayException -> Bool # (/=) :: ArrayException -> ArrayException -> Bool #
Eq ExitCode
Instance details Defined in GHC.IO.Exception Methods (==) :: ExitCode -> ExitCode -> Bool # (/=) :: ExitCode -> ExitCode -> Bool #
Eq IOErrorType	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods (==) :: IOErrorType -> IOErrorType -> Bool # (/=) :: IOErrorType -> IOErrorType -> Bool #
Eq BufferMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Handle.Types Methods (==) :: BufferMode -> BufferMode -> Bool # (/=) :: BufferMode -> BufferMode -> Bool #
Eq Newline	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Handle.Types Methods (==) :: Newline -> Newline -> Bool # (/=) :: Newline -> Newline -> Bool #
Eq NewlineMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Handle.Types Methods (==) :: NewlineMode -> NewlineMode -> Bool # (/=) :: NewlineMode -> NewlineMode -> Bool #
Eq MaskingState	Since: base-4.3.0.0
Instance details Defined in GHC.IO Methods (==) :: MaskingState -> MaskingState -> Bool # (/=) :: MaskingState -> MaskingState -> Bool #
Eq IOException	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods (==) :: IOException -> IOException -> Bool # (/=) :: IOException -> IOException -> Bool #
Eq ErrorCall	Since: base-4.7.0.0
Instance details Defined in GHC.Exception Methods (==) :: ErrorCall -> ErrorCall -> Bool # (/=) :: ErrorCall -> ErrorCall -> Bool #
Eq ArithException	Since: base-3.0
Instance details Defined in GHC.Exception.Type Methods (==) :: ArithException -> ArithException -> Bool # (/=) :: ArithException -> ArithException -> Bool #
Eq Fixity	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Methods (==) :: Fixity -> Fixity -> Bool # (/=) :: Fixity -> Fixity -> Bool #
Eq Associativity	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Methods (==) :: Associativity -> Associativity -> Bool # (/=) :: Associativity -> Associativity -> Bool #
Eq SourceUnpackedness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (/=) :: SourceUnpackedness -> SourceUnpackedness -> Bool #
Eq SourceStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: SourceStrictness -> SourceStrictness -> Bool # (/=) :: SourceStrictness -> SourceStrictness -> Bool #
Eq DecidedStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: DecidedStrictness -> DecidedStrictness -> Bool # (/=) :: DecidedStrictness -> DecidedStrictness -> Bool #
Eq SomeSymbol	Since: base-4.7.0.0
Instance details Defined in GHC.TypeLits Methods (==) :: SomeSymbol -> SomeSymbol -> Bool # (/=) :: SomeSymbol -> SomeSymbol -> Bool #
Eq SomeNat	Since: base-4.7.0.0
Instance details Defined in GHC.TypeNats Methods (==) :: SomeNat -> SomeNat -> Bool # (/=) :: SomeNat -> SomeNat -> Bool #
Eq CChar
Instance details Defined in Foreign.C.Types Methods (==) :: CChar -> CChar -> Bool # (/=) :: CChar -> CChar -> Bool #
Eq CSChar
Instance details Defined in Foreign.C.Types Methods (==) :: CSChar -> CSChar -> Bool # (/=) :: CSChar -> CSChar -> Bool #
Eq CUChar
Instance details Defined in Foreign.C.Types Methods (==) :: CUChar -> CUChar -> Bool # (/=) :: CUChar -> CUChar -> Bool #
Eq CShort
Instance details Defined in Foreign.C.Types Methods (==) :: CShort -> CShort -> Bool # (/=) :: CShort -> CShort -> Bool #
Eq CUShort
Instance details Defined in Foreign.C.Types Methods (==) :: CUShort -> CUShort -> Bool # (/=) :: CUShort -> CUShort -> Bool #
Eq CInt
Instance details Defined in Foreign.C.Types Methods (==) :: CInt -> CInt -> Bool # (/=) :: CInt -> CInt -> Bool #
Eq CUInt
Instance details Defined in Foreign.C.Types Methods (==) :: CUInt -> CUInt -> Bool # (/=) :: CUInt -> CUInt -> Bool #
Eq CLong
Instance details Defined in Foreign.C.Types Methods (==) :: CLong -> CLong -> Bool # (/=) :: CLong -> CLong -> Bool #
Eq CULong
Instance details Defined in Foreign.C.Types Methods (==) :: CULong -> CULong -> Bool # (/=) :: CULong -> CULong -> Bool #
Eq CLLong
Instance details Defined in Foreign.C.Types Methods (==) :: CLLong -> CLLong -> Bool # (/=) :: CLLong -> CLLong -> Bool #
Eq CULLong
Instance details Defined in Foreign.C.Types Methods (==) :: CULLong -> CULLong -> Bool # (/=) :: CULLong -> CULLong -> Bool #
Eq CBool
Instance details Defined in Foreign.C.Types Methods (==) :: CBool -> CBool -> Bool # (/=) :: CBool -> CBool -> Bool #
Eq CFloat
Instance details Defined in Foreign.C.Types Methods (==) :: CFloat -> CFloat -> Bool # (/=) :: CFloat -> CFloat -> Bool #
Eq CDouble
Instance details Defined in Foreign.C.Types Methods (==) :: CDouble -> CDouble -> Bool # (/=) :: CDouble -> CDouble -> Bool #
Eq CPtrdiff
Instance details Defined in Foreign.C.Types Methods (==) :: CPtrdiff -> CPtrdiff -> Bool # (/=) :: CPtrdiff -> CPtrdiff -> Bool #
Eq CSize
Instance details Defined in Foreign.C.Types Methods (==) :: CSize -> CSize -> Bool # (/=) :: CSize -> CSize -> Bool #
Eq CWchar
Instance details Defined in Foreign.C.Types Methods (==) :: CWchar -> CWchar -> Bool # (/=) :: CWchar -> CWchar -> Bool #
Eq CSigAtomic
Instance details Defined in Foreign.C.Types Methods (==) :: CSigAtomic -> CSigAtomic -> Bool # (/=) :: CSigAtomic -> CSigAtomic -> Bool #
Eq CClock
Instance details Defined in Foreign.C.Types Methods (==) :: CClock -> CClock -> Bool # (/=) :: CClock -> CClock -> Bool #
Eq CTime
Instance details Defined in Foreign.C.Types Methods (==) :: CTime -> CTime -> Bool # (/=) :: CTime -> CTime -> Bool #
Eq CUSeconds
Instance details Defined in Foreign.C.Types Methods (==) :: CUSeconds -> CUSeconds -> Bool # (/=) :: CUSeconds -> CUSeconds -> Bool #
Eq CSUSeconds
Instance details Defined in Foreign.C.Types Methods (==) :: CSUSeconds -> CSUSeconds -> Bool # (/=) :: CSUSeconds -> CSUSeconds -> Bool #
Eq CIntPtr
Instance details Defined in Foreign.C.Types Methods (==) :: CIntPtr -> CIntPtr -> Bool # (/=) :: CIntPtr -> CIntPtr -> Bool #
Eq CUIntPtr
Instance details Defined in Foreign.C.Types Methods (==) :: CUIntPtr -> CUIntPtr -> Bool # (/=) :: CUIntPtr -> CUIntPtr -> Bool #
Eq CIntMax
Instance details Defined in Foreign.C.Types Methods (==) :: CIntMax -> CIntMax -> Bool # (/=) :: CIntMax -> CIntMax -> Bool #
Eq CUIntMax
Instance details Defined in Foreign.C.Types Methods (==) :: CUIntMax -> CUIntMax -> Bool # (/=) :: CUIntMax -> CUIntMax -> Bool #
Eq WordPtr
Instance details Defined in Foreign.Ptr Methods (==) :: WordPtr -> WordPtr -> Bool # (/=) :: WordPtr -> WordPtr -> Bool #
Eq IntPtr
Instance details Defined in Foreign.Ptr Methods (==) :: IntPtr -> IntPtr -> Bool # (/=) :: IntPtr -> IntPtr -> Bool #
Eq IOMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.IOMode Methods (==) :: IOMode -> IOMode -> Bool # (/=) :: IOMode -> IOMode -> Bool #
Eq GeneralCategory	Since: base-2.1
Instance details Defined in GHC.Unicode Methods (==) :: GeneralCategory -> GeneralCategory -> Bool # (/=) :: GeneralCategory -> GeneralCategory -> Bool #
Eq SrcLoc	Since: base-4.9.0.0
Instance details Defined in GHC.Stack.Types Methods (==) :: SrcLoc -> SrcLoc -> Bool # (/=) :: SrcLoc -> SrcLoc -> Bool #
Eq Alphabet
Instance details Defined in Data.ByteString.Base58.Internal Methods (==) :: Alphabet -> Alphabet -> Bool # (/=) :: Alphabet -> Alphabet -> Bool #
Eq ASCII7_Invalid
Instance details Defined in Basement.String.Encoding.ASCII7 Methods (==) :: ASCII7_Invalid -> ASCII7_Invalid -> Bool # (/=) :: ASCII7_Invalid -> ASCII7_Invalid -> Bool #
Eq ISO_8859_1_Invalid
Instance details Defined 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 details Defined in Basement.String.Encoding.UTF16 Methods (==) :: UTF16_Invalid -> UTF16_Invalid -> Bool # (/=) :: UTF16_Invalid -> UTF16_Invalid -> Bool #
Eq UTF32_Invalid
Instance details Defined in Basement.String.Encoding.UTF32 Methods (==) :: UTF32_Invalid -> UTF32_Invalid -> Bool # (/=) :: UTF32_Invalid -> UTF32_Invalid -> Bool #
Eq Encoding
Instance details Defined in Basement.String Methods (==) :: Encoding -> Encoding -> Bool # (/=) :: Encoding -> Encoding -> Bool #
Eq String
Instance details Defined in Basement.UTF8.Base Methods (==) :: String -> String -> Bool # (/=) :: String -> String -> Bool #
Eq AsciiString
Instance details Defined in Basement.Types.AsciiString Methods (==) :: AsciiString -> AsciiString -> Bool # (/=) :: AsciiString -> AsciiString -> Bool #
Eq FileSize
Instance details Defined in Basement.Types.OffsetSize Methods (==) :: FileSize -> FileSize -> Bool # (/=) :: FileSize -> FileSize -> Bool #
Eq Char7
Instance details Defined in Basement.Types.Char7 Methods (==) :: Char7 -> Char7 -> Bool # (/=) :: Char7 -> Char7 -> Bool #
Eq F2Poly
Instance details Defined in Data.Bit.F2Poly Methods (==) :: F2Poly -> F2Poly -> Bool # (/=) :: F2Poly -> F2Poly -> Bool #
Eq Bit
Instance details Defined in Data.Bit.Internal Methods (==) :: Bit -> Bit -> Bool # (/=) :: Bit -> Bit -> Bool #
Eq Clock
Instance details Defined in System.Clock Methods (==) :: Clock -> Clock -> Bool # (/=) :: Clock -> Clock -> Bool #
Eq TimeSpec
Instance details Defined in System.Clock Methods (==) :: TimeSpec -> TimeSpec -> Bool # (/=) :: TimeSpec -> TimeSpec -> Bool #
Eq IntSet
Instance details Defined in Data.IntSet.Internal Methods (==) :: IntSet -> IntSet -> Bool # (/=) :: IntSet -> IntSet -> Bool #
Eq Signature
Instance details Defined in Crypto.PubKey.ECC.ECDSA Methods (==) :: Signature -> Signature -> Bool # (/=) :: Signature -> Signature -> Bool #
Eq PrivateKey
Instance details Defined in Crypto.PubKey.ECC.ECDSA Methods (==) :: PrivateKey -> PrivateKey -> Bool # (/=) :: PrivateKey -> PrivateKey -> Bool #
Eq PublicKey
Instance details Defined in Crypto.PubKey.ECC.ECDSA Methods (==) :: PublicKey -> PublicKey -> Bool # (/=) :: PublicKey -> PublicKey -> Bool #
Eq KeyPair
Instance details Defined in Crypto.PubKey.ECC.ECDSA Methods (==) :: KeyPair -> KeyPair -> Bool # (/=) :: KeyPair -> KeyPair -> Bool #
Eq SecretKey
Instance details Defined in Crypto.PubKey.Ed25519 Methods (==) :: SecretKey -> SecretKey -> Bool # (/=) :: SecretKey -> SecretKey -> Bool #
Eq PublicKey
Instance details Defined in Crypto.PubKey.Ed25519 Methods (==) :: PublicKey -> PublicKey -> Bool # (/=) :: PublicKey -> PublicKey -> Bool #
Eq Signature
Instance details Defined in Crypto.PubKey.Ed25519 Methods (==) :: Signature -> Signature -> Bool # (/=) :: Signature -> Signature -> Bool #
Eq CryptoError
Instance details Defined in Crypto.Error.Types Methods (==) :: CryptoError -> CryptoError -> Bool # (/=) :: CryptoError -> CryptoError -> Bool #
Eq DiffTime
Instance details Defined in Data.Time.Clock.Internal.DiffTime Methods (==) :: DiffTime -> DiffTime -> Bool # (/=) :: DiffTime -> DiffTime -> Bool #
Eq NominalDiffTime
Instance details Defined in Data.Time.Clock.Internal.NominalDiffTime Methods (==) :: NominalDiffTime -> NominalDiffTime -> Bool # (/=) :: NominalDiffTime -> NominalDiffTime -> Bool #
Eq ConstructorInfo
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: ConstructorInfo -> ConstructorInfo -> Bool # (/=) :: ConstructorInfo -> ConstructorInfo -> Bool #
Eq DatatypeVariant
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: DatatypeVariant -> DatatypeVariant -> Bool # (/=) :: DatatypeVariant -> DatatypeVariant -> Bool #
Eq Extension
Instance details Defined in GHC.LanguageExtensions.Type Methods (==) :: Extension -> Extension -> Bool # (/=) :: Extension -> Extension -> Bool #
Eq ForeignSrcLang
Instance details Defined in GHC.ForeignSrcLang.Type Methods (==) :: ForeignSrcLang -> ForeignSrcLang -> Bool # (/=) :: ForeignSrcLang -> ForeignSrcLang -> Bool #
Eq BigNat
Instance details Defined in GHC.Integer.Type Methods (==) :: BigNat -> BigNat -> Bool # (/=) :: BigNat -> BigNat -> Bool #
Eq RuleBndr
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: RuleBndr -> RuleBndr -> Bool # (/=) :: RuleBndr -> RuleBndr -> Bool #
Eq Phases
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Phases -> Phases -> Bool # (/=) :: Phases -> Phases -> Bool #
Eq RuleMatch
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: RuleMatch -> RuleMatch -> Bool # (/=) :: RuleMatch -> RuleMatch -> Bool #
Eq Inline
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Inline -> Inline -> Bool # (/=) :: Inline -> Inline -> Bool #
Eq Pragma
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Pragma -> Pragma -> Bool # (/=) :: Pragma -> Pragma -> Bool #
Eq DerivClause
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: DerivClause -> DerivClause -> Bool # (/=) :: DerivClause -> DerivClause -> Bool #
Eq DerivStrategy
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: DerivStrategy -> DerivStrategy -> Bool # (/=) :: DerivStrategy -> DerivStrategy -> Bool #
Eq TySynEqn
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: TySynEqn -> TySynEqn -> Bool # (/=) :: TySynEqn -> TySynEqn -> Bool #
Eq Fixity
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Fixity -> Fixity -> Bool # (/=) :: Fixity -> Fixity -> Bool #
Eq Info
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Info -> Info -> Bool # (/=) :: Info -> Info -> Bool #
Eq Con
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Con -> Con -> Bool # (/=) :: Con -> Con -> Bool #
Eq TyVarBndr
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: TyVarBndr -> TyVarBndr -> Bool # (/=) :: TyVarBndr -> TyVarBndr -> Bool #
Eq DefName
Instance details Defined in Control.Lens.Internal.FieldTH Methods (==) :: DefName -> DefName -> Bool # (/=) :: DefName -> DefName -> Bool #
Eq Pos
Instance details Defined in Text.Megaparsec.Pos Methods (==) :: Pos -> Pos -> Bool # (/=) :: Pos -> Pos -> Bool #
Eq InvalidPosException
Instance details Defined in Text.Megaparsec.Pos Methods (==) :: InvalidPosException -> InvalidPosException -> Bool # (/=) :: InvalidPosException -> InvalidPosException -> Bool #
Eq SourcePos
Instance details Defined in Text.Megaparsec.Pos Methods (==) :: SourcePos -> SourcePos -> Bool # (/=) :: SourcePos -> SourcePos -> Bool #
Eq Backtracking
Instance details Defined in Options.Applicative.Types Methods (==) :: Backtracking -> Backtracking -> Bool # (/=) :: Backtracking -> Backtracking -> Bool #
Eq ParserPrefs
Instance details Defined in Options.Applicative.Types Methods (==) :: ParserPrefs -> ParserPrefs -> Bool # (/=) :: ParserPrefs -> ParserPrefs -> Bool #
Eq OptName
Instance details Defined in Options.Applicative.Types Methods (==) :: OptName -> OptName -> Bool # (/=) :: OptName -> OptName -> Bool #
Eq OptVisibility
Instance details Defined in Options.Applicative.Types Methods (==) :: OptVisibility -> OptVisibility -> Bool # (/=) :: OptVisibility -> OptVisibility -> Bool #
Eq ArgPolicy
Instance details Defined in Options.Applicative.Types Methods (==) :: ArgPolicy -> ArgPolicy -> Bool # (/=) :: ArgPolicy -> ArgPolicy -> Bool #
Eq ArgumentReachability
Instance details Defined in Options.Applicative.Types Methods (==) :: ArgumentReachability -> ArgumentReachability -> Bool # (/=) :: ArgumentReachability -> ArgumentReachability -> Bool #
Eq AltNodeType
Instance details Defined in Options.Applicative.Types Methods (==) :: AltNodeType -> AltNodeType -> Bool # (/=) :: AltNodeType -> AltNodeType -> Bool #
Eq TextDetails
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: TextDetails -> TextDetails -> Bool # (/=) :: TextDetails -> TextDetails -> Bool #
Eq Style
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: Style -> Style -> Bool # (/=) :: Style -> Style -> Bool #
Eq Mode
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: Mode -> Mode -> Bool # (/=) :: Mode -> Mode -> Bool #
Eq ByteArray	Since: primitive-0.6.3.0
Instance details Defined in Data.Primitive.ByteArray Methods (==) :: ByteArray -> ByteArray -> Bool # (/=) :: ByteArray -> ByteArray -> Bool #
Eq UnicodeException
Instance details Defined in Data.Text.Encoding.Error Methods (==) :: UnicodeException -> UnicodeException -> Bool # (/=) :: UnicodeException -> UnicodeException -> Bool #
Eq Mod2
Instance details Defined in Data.Semiring Methods (==) :: Mod2 -> Mod2 -> Bool # (/=) :: Mod2 -> Mod2 -> Bool #
Eq DependencyType
Instance details Defined in Test.Tasty.Core Methods (==) :: DependencyType -> DependencyType -> Bool # (/=) :: DependencyType -> DependencyType -> Bool #
Eq Expr
Instance details Defined in Test.Tasty.Patterns.Types Methods (==) :: Expr -> Expr -> Bool # (/=) :: Expr -> Expr -> Bool #
Eq ModName
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: ModName -> ModName -> Bool # (/=) :: ModName -> ModName -> Bool #
Eq PkgName
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: PkgName -> PkgName -> Bool # (/=) :: PkgName -> PkgName -> Bool #
Eq Module
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Module -> Module -> Bool # (/=) :: Module -> Module -> Bool #
Eq OccName
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: OccName -> OccName -> Bool # (/=) :: OccName -> OccName -> Bool #
Eq NameFlavour
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: NameFlavour -> NameFlavour -> Bool # (/=) :: NameFlavour -> NameFlavour -> Bool #
Eq NameSpace
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: NameSpace -> NameSpace -> Bool # (/=) :: NameSpace -> NameSpace -> Bool #
Eq Loc
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Loc -> Loc -> Bool # (/=) :: Loc -> Loc -> Bool #
Eq ModuleInfo
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: ModuleInfo -> ModuleInfo -> Bool # (/=) :: ModuleInfo -> ModuleInfo -> Bool #
Eq FixityDirection
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: FixityDirection -> FixityDirection -> Bool # (/=) :: FixityDirection -> FixityDirection -> Bool #
Eq Lit
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Lit -> Lit -> Bool # (/=) :: Lit -> Lit -> Bool #
Eq Bytes
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Bytes -> Bytes -> Bool # (/=) :: Bytes -> Bytes -> Bool #
Eq Body
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Body -> Body -> Bool # (/=) :: Body -> Body -> Bool #
Eq Guard
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Guard -> Guard -> Bool # (/=) :: Guard -> Guard -> Bool #
Eq Stmt
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Stmt -> Stmt -> Bool # (/=) :: Stmt -> Stmt -> Bool #
Eq Range
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Range -> Range -> Bool # (/=) :: Range -> Range -> Bool #
Eq TypeFamilyHead
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (/=) :: TypeFamilyHead -> TypeFamilyHead -> Bool #
Eq Foreign
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Foreign -> Foreign -> Bool # (/=) :: Foreign -> Foreign -> Bool #
Eq Callconv
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Callconv -> Callconv -> Bool # (/=) :: Callconv -> Callconv -> Bool #
Eq Safety
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Safety -> Safety -> Bool # (/=) :: Safety -> Safety -> Bool #
Eq AnnTarget
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: AnnTarget -> AnnTarget -> Bool # (/=) :: AnnTarget -> AnnTarget -> Bool #
Eq SourceUnpackedness
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (/=) :: SourceUnpackedness -> SourceUnpackedness -> Bool #
Eq SourceStrictness
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: SourceStrictness -> SourceStrictness -> Bool # (/=) :: SourceStrictness -> SourceStrictness -> Bool #
Eq DecidedStrictness
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: DecidedStrictness -> DecidedStrictness -> Bool # (/=) :: DecidedStrictness -> DecidedStrictness -> Bool #
Eq Bang
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Bang -> Bang -> Bool # (/=) :: Bang -> Bang -> Bool #
Eq PatSynDir
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: PatSynDir -> PatSynDir -> Bool # (/=) :: PatSynDir -> PatSynDir -> Bool #
Eq PatSynArgs
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: PatSynArgs -> PatSynArgs -> Bool # (/=) :: PatSynArgs -> PatSynArgs -> Bool #
Eq FamilyResultSig
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: FamilyResultSig -> FamilyResultSig -> Bool # (/=) :: FamilyResultSig -> FamilyResultSig -> Bool #
Eq TyLit
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: TyLit -> TyLit -> Bool # (/=) :: TyLit -> TyLit -> Bool #
Eq Role
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Role -> Role -> Bool # (/=) :: Role -> Role -> Bool #
Eq AnnLookup
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: AnnLookup -> AnnLookup -> Bool # (/=) :: AnnLookup -> AnnLookup -> Bool #
Eq DatatypeInfo
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: DatatypeInfo -> DatatypeInfo -> Bool # (/=) :: DatatypeInfo -> DatatypeInfo -> Bool #
Eq ConstructorVariant
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: ConstructorVariant -> ConstructorVariant -> Bool # (/=) :: ConstructorVariant -> ConstructorVariant -> Bool #
Eq FieldStrictness
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: FieldStrictness -> FieldStrictness -> Bool # (/=) :: FieldStrictness -> FieldStrictness -> Bool #
Eq Unpackedness
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: Unpackedness -> Unpackedness -> Bool # (/=) :: Unpackedness -> Unpackedness -> Bool #
Eq Strictness
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: Strictness -> Strictness -> Bool # (/=) :: Strictness -> Strictness -> Bool #
Eq Specificity
Instance details Defined in Language.Haskell.TH.Datatype.TyVarBndr Methods (==) :: Specificity -> Specificity -> Bool # (/=) :: Specificity -> Specificity -> Bool #
Eq DTypeArg
Instance details Defined in Language.Haskell.TH.Desugar.Core Methods (==) :: DTypeArg -> DTypeArg -> Bool # (/=) :: DTypeArg -> DTypeArg -> Bool #
Eq DFunArgs
Instance details Defined in Language.Haskell.TH.Desugar.Core Methods (==) :: DFunArgs -> DFunArgs -> Bool # (/=) :: DFunArgs -> DFunArgs -> Bool #
Eq DVisFunArg
Instance details Defined in Language.Haskell.TH.Desugar.Core Methods (==) :: DVisFunArg -> DVisFunArg -> Bool # (/=) :: DVisFunArg -> DVisFunArg -> Bool #
Eq DExp
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DExp -> DExp -> Bool # (/=) :: DExp -> DExp -> Bool #
Eq DPat
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DPat -> DPat -> Bool # (/=) :: DPat -> DPat -> Bool #
Eq DType
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DType -> DType -> Bool # (/=) :: DType -> DType -> Bool #
Eq DTyVarBndr
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DTyVarBndr -> DTyVarBndr -> Bool # (/=) :: DTyVarBndr -> DTyVarBndr -> Bool #
Eq DMatch
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DMatch -> DMatch -> Bool # (/=) :: DMatch -> DMatch -> Bool #
Eq DClause
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DClause -> DClause -> Bool # (/=) :: DClause -> DClause -> Bool #
Eq DLetDec
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DLetDec -> DLetDec -> Bool # (/=) :: DLetDec -> DLetDec -> Bool #
Eq NewOrData
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: NewOrData -> NewOrData -> Bool # (/=) :: NewOrData -> NewOrData -> Bool #
Eq DDec
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DDec -> DDec -> Bool # (/=) :: DDec -> DDec -> Bool #
Eq DPatSynDir
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DPatSynDir -> DPatSynDir -> Bool # (/=) :: DPatSynDir -> DPatSynDir -> Bool #
Eq DTypeFamilyHead
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DTypeFamilyHead -> DTypeFamilyHead -> Bool # (/=) :: DTypeFamilyHead -> DTypeFamilyHead -> Bool #
Eq DFamilyResultSig
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DFamilyResultSig -> DFamilyResultSig -> Bool # (/=) :: DFamilyResultSig -> DFamilyResultSig -> Bool #
Eq DCon
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DCon -> DCon -> Bool # (/=) :: DCon -> DCon -> Bool #
Eq DConFields
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DConFields -> DConFields -> Bool # (/=) :: DConFields -> DConFields -> Bool #
Eq DForeign
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DForeign -> DForeign -> Bool # (/=) :: DForeign -> DForeign -> Bool #
Eq DPragma
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DPragma -> DPragma -> Bool # (/=) :: DPragma -> DPragma -> Bool #
Eq DRuleBndr
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DRuleBndr -> DRuleBndr -> Bool # (/=) :: DRuleBndr -> DRuleBndr -> Bool #
Eq DTySynEqn
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DTySynEqn -> DTySynEqn -> Bool # (/=) :: DTySynEqn -> DTySynEqn -> Bool #
Eq DInfo
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DInfo -> DInfo -> Bool # (/=) :: DInfo -> DInfo -> Bool #
Eq DDerivClause
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DDerivClause -> DDerivClause -> Bool # (/=) :: DDerivClause -> DDerivClause -> Bool #
Eq DDerivStrategy
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: DDerivStrategy -> DDerivStrategy -> Bool # (/=) :: DDerivStrategy -> DDerivStrategy -> Bool #
Eq ForallVisFlag
Instance details Defined in Language.Haskell.TH.Desugar.Util Methods (==) :: ForallVisFlag -> ForallVisFlag -> Bool # (/=) :: ForallVisFlag -> ForallVisFlag -> Bool #
Eq FunArgs
Instance details Defined in Language.Haskell.TH.Desugar.Util Methods (==) :: FunArgs -> FunArgs -> Bool # (/=) :: FunArgs -> FunArgs -> Bool #
Eq VisFunArg
Instance details Defined in Language.Haskell.TH.Desugar.Util Methods (==) :: VisFunArg -> VisFunArg -> Bool # (/=) :: VisFunArg -> VisFunArg -> Bool #
Eq TypeArg
Instance details Defined in Language.Haskell.TH.Desugar.Util Methods (==) :: TypeArg -> TypeArg -> Bool # (/=) :: TypeArg -> TypeArg -> Bool #
Eq LocalTime
Instance details Defined in Data.Time.LocalTime.Internal.LocalTime Methods (==) :: LocalTime -> LocalTime -> Bool # (/=) :: LocalTime -> LocalTime -> Bool #
Eq TimeOfDay
Instance details Defined in Data.Time.LocalTime.Internal.TimeOfDay Methods (==) :: TimeOfDay -> TimeOfDay -> Bool # (/=) :: TimeOfDay -> TimeOfDay -> Bool #
Eq TimeZone
Instance details Defined in Data.Time.LocalTime.Internal.TimeZone Methods (==) :: TimeZone -> TimeZone -> Bool # (/=) :: TimeZone -> TimeZone -> Bool #
Eq UniversalTime
Instance details Defined in Data.Time.Clock.Internal.UniversalTime Methods (==) :: UniversalTime -> UniversalTime -> Bool # (/=) :: UniversalTime -> UniversalTime -> Bool #
Eq AbsoluteTime
Instance details Defined in Data.Time.Clock.Internal.AbsoluteTime Methods (==) :: AbsoluteTime -> AbsoluteTime -> Bool # (/=) :: AbsoluteTime -> AbsoluteTime -> Bool #
Eq DayOfWeek
Instance details Defined in Data.Time.Calendar.Week Methods (==) :: DayOfWeek -> DayOfWeek -> Bool # (/=) :: DayOfWeek -> DayOfWeek -> Bool #
Eq Day
Instance details Defined in Data.Time.Calendar.Days Methods (==) :: Day -> Day -> Bool # (/=) :: Day -> Day -> Bool #
Eq Undefined
Instance details Defined in Universum.Debug Methods (==) :: Undefined -> Undefined -> Bool # (/=) :: Undefined -> Undefined -> Bool #
Eq UnpackedUUID
Instance details Defined in Data.UUID.Types.Internal Methods (==) :: UnpackedUUID -> UnpackedUUID -> Bool # (/=) :: UnpackedUUID -> UnpackedUUID -> Bool #
Eq UUID
Instance details Defined in Data.UUID.Types.Internal Methods (==) :: UUID -> UUID -> Bool # (/=) :: UUID -> UUID -> Bool #
Eq MText
Instance details Defined in Morley.Michelson.Text Methods (==) :: MText -> MText -> Bool # (/=) :: MText -> MText -> Bool #
Eq SomeAnnotatedValue
Instance details Defined in Morley.Michelson.Typed.AnnotatedValue Methods (==) :: SomeAnnotatedValue -> SomeAnnotatedValue -> Bool # (/=) :: SomeAnnotatedValue -> SomeAnnotatedValue -> Bool #
Eq AnnConvergeError
Instance details Defined in Morley.Michelson.Typed.Annotation Methods (==) :: AnnConvergeError -> AnnConvergeError -> Bool # (/=) :: AnnConvergeError -> AnnConvergeError -> Bool #
Eq MutezArithErrorType
Instance details Defined in Morley.Michelson.Typed.Arith Methods (==) :: MutezArithErrorType -> MutezArithErrorType -> Bool # (/=) :: MutezArithErrorType -> MutezArithErrorType -> Bool #
Eq ShiftArithErrorType
Instance details Defined in Morley.Michelson.Typed.Arith Methods (==) :: ShiftArithErrorType -> ShiftArithErrorType -> Bool # (/=) :: ShiftArithErrorType -> ShiftArithErrorType -> Bool #
Eq ArmCoord
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods (==) :: ArmCoord -> ArmCoord -> Bool # (/=) :: ArmCoord -> ArmCoord -> Bool #
Eq EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods (==) :: EpAddress -> EpAddress -> Bool # (/=) :: EpAddress -> EpAddress -> Bool #
Eq ParamEpError
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods (==) :: ParamEpError -> ParamEpError -> Bool # (/=) :: ParamEpError -> ParamEpError -> Bool #
Eq ParseEpAddressError
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods (==) :: ParseEpAddressError -> ParseEpAddressError -> Bool # (/=) :: ParseEpAddressError -> ParseEpAddressError -> Bool #
Eq DStorageType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Methods (==) :: DStorageType -> DStorageType -> Bool # (/=) :: DStorageType -> DStorageType -> Bool #
Eq DType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Methods (==) :: DType -> DType -> Bool # (/=) :: DType -> DType -> Bool #
Eq BadTypeForScope
Instance details Defined in Morley.Michelson.Typed.Scope Methods (==) :: BadTypeForScope -> BadTypeForScope -> Bool # (/=) :: BadTypeForScope -> BadTypeForScope -> Bool #
Eq T
Instance details Defined in Morley.Michelson.Typed.T Methods (==) :: T -> T -> Bool # (/=) :: T -> T -> Bool #
Eq SetDelegate
Instance details Defined in Morley.Michelson.Typed.Value Methods (==) :: SetDelegate -> SetDelegate -> Bool # (/=) :: SetDelegate -> SetDelegate -> Bool #
Eq ViewsSetError
Instance details Defined in Morley.Michelson.Typed.View Methods (==) :: ViewsSetError -> ViewsSetError -> Bool # (/=) :: ViewsSetError -> ViewsSetError -> Bool #
Eq EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods (==) :: EpName -> EpName -> Bool # (/=) :: EpName -> EpName -> Bool #
Eq EpNameFromRefAnnError
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods (==) :: EpNameFromRefAnnError -> EpNameFromRefAnnError -> Bool # (/=) :: EpNameFromRefAnnError -> EpNameFromRefAnnError -> Bool #
Eq OpSize
Instance details Defined in Morley.Michelson.Untyped.OpSize Methods (==) :: OpSize -> OpSize -> Bool # (/=) :: OpSize -> OpSize -> Bool #
Eq ViewName
Instance details Defined in Morley.Michelson.Untyped.View Methods (==) :: ViewName -> ViewName -> Bool # (/=) :: ViewName -> ViewName -> Bool #
Eq Address
Instance details Defined in Morley.Tezos.Address Methods (==) :: Address -> Address -> Bool # (/=) :: Address -> Address -> Bool #
Eq Bls12381Fr
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods (==) :: Bls12381Fr -> Bls12381Fr -> Bool # (/=) :: Bls12381Fr -> Bls12381Fr -> Bool #
Eq Bls12381G1
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods (==) :: Bls12381G1 -> Bls12381G1 -> Bool # (/=) :: Bls12381G1 -> Bls12381G1 -> Bool #
Eq Bls12381G2
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods (==) :: Bls12381G2 -> Bls12381G2 -> Bool # (/=) :: Bls12381G2 -> Bls12381G2 -> Bool #
Eq ChainId
Instance details Defined in Morley.Tezos.Core Methods (==) :: ChainId -> ChainId -> Bool # (/=) :: ChainId -> ChainId -> Bool #
Eq Chest
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: Chest -> Chest -> Bool # (/=) :: Chest -> Chest -> Bool #
Eq ChestKey
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: ChestKey -> ChestKey -> Bool # (/=) :: ChestKey -> ChestKey -> Bool #
Eq KeyHash
Instance details Defined in Morley.Tezos.Crypto Methods (==) :: KeyHash -> KeyHash -> Bool # (/=) :: KeyHash -> KeyHash -> Bool #
Eq Mutez
Instance details Defined in Morley.Tezos.Core Methods (==) :: Mutez -> Mutez -> Bool # (/=) :: Mutez -> Mutez -> Bool #
Eq PublicKey
Instance details Defined in Morley.Tezos.Crypto Methods (==) :: PublicKey -> PublicKey -> Bool # (/=) :: PublicKey -> PublicKey -> Bool #
Eq Signature
Instance details Defined in Morley.Tezos.Crypto Methods (==) :: Signature -> Signature -> Bool # (/=) :: Signature -> Signature -> Bool #
Eq Timestamp
Instance details Defined in Morley.Tezos.Core Methods (==) :: Timestamp -> Timestamp -> Bool # (/=) :: Timestamp -> Timestamp -> Bool #
Eq AnnotationSet
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods (==) :: AnnotationSet -> AnnotationSet -> Bool # (/=) :: AnnotationSet -> AnnotationSet -> Bool #
Eq EntriesOrder
Instance details Defined in Morley.Michelson.Untyped.Contract Methods (==) :: EntriesOrder -> EntriesOrder -> Bool # (/=) :: EntriesOrder -> EntriesOrder -> Bool #
Eq PrintComment
Instance details Defined in Morley.Michelson.Untyped.Ext Methods (==) :: PrintComment -> PrintComment -> Bool # (/=) :: PrintComment -> PrintComment -> Bool #
Eq StackFn
Instance details Defined in Morley.Michelson.Untyped.Ext Methods (==) :: StackFn -> StackFn -> Bool # (/=) :: StackFn -> StackFn -> Bool #
Eq StackRef
Instance details Defined in Morley.Michelson.Untyped.Ext Methods (==) :: StackRef -> StackRef -> Bool # (/=) :: StackRef -> StackRef -> Bool #
Eq StackTypePattern
Instance details Defined in Morley.Michelson.Untyped.Ext Methods (==) :: StackTypePattern -> StackTypePattern -> Bool # (/=) :: StackTypePattern -> StackTypePattern -> Bool #
Eq TyVar
Instance details Defined in Morley.Michelson.Untyped.Ext Methods (==) :: TyVar -> TyVar -> Bool # (/=) :: TyVar -> TyVar -> Bool #
Eq Var
Instance details Defined in Morley.Michelson.Untyped.Ext Methods (==) :: Var -> Var -> Bool # (/=) :: Var -> Var -> Bool #
Eq ExpandedOp
Instance details Defined in Morley.Michelson.Untyped.Instr Methods (==) :: ExpandedOp -> ExpandedOp -> Bool # (/=) :: ExpandedOp -> ExpandedOp -> Bool #
Eq ParameterType
Instance details Defined in Morley.Michelson.Untyped.Type Methods (==) :: ParameterType -> ParameterType -> Bool # (/=) :: ParameterType -> ParameterType -> Bool #
Eq T
Instance details Defined in Morley.Michelson.Untyped.Type Methods (==) :: T -> T -> Bool # (/=) :: T -> T -> Bool #
Eq Ty
Instance details Defined in Morley.Michelson.Untyped.Type Methods (==) :: Ty -> Ty -> Bool # (/=) :: Ty -> Ty -> Bool #
Eq InternalByteString
Instance details Defined in Morley.Michelson.Untyped.Value Methods (==) :: InternalByteString -> InternalByteString -> Bool # (/=) :: InternalByteString -> InternalByteString -> Bool #
Eq BadViewNameError
Instance details Defined in Morley.Michelson.Untyped.View Methods (==) :: BadViewNameError -> BadViewNameError -> Bool # (/=) :: BadViewNameError -> BadViewNameError -> Bool #
Eq ContractHash
Instance details Defined in Morley.Tezos.Address Methods (==) :: ContractHash -> ContractHash -> Bool # (/=) :: ContractHash -> ContractHash -> Bool #
Eq GlobalCounter
Instance details Defined in Morley.Tezos.Address Methods (==) :: GlobalCounter -> GlobalCounter -> Bool # (/=) :: GlobalCounter -> GlobalCounter -> Bool #
Eq ParseAddressError
Instance details Defined in Morley.Tezos.Address Methods (==) :: ParseAddressError -> ParseAddressError -> Bool # (/=) :: ParseAddressError -> ParseAddressError -> Bool #
Eq ParseAddressRawError
Instance details Defined in Morley.Tezos.Address Methods (==) :: ParseAddressRawError -> ParseAddressRawError -> Bool # (/=) :: ParseAddressRawError -> ParseAddressRawError -> Bool #
Eq ParseContractAddressError
Instance details Defined in Morley.Tezos.Address Methods (==) :: ParseContractAddressError -> ParseContractAddressError -> Bool # (/=) :: ParseContractAddressError -> ParseContractAddressError -> Bool #
Eq CryptoParseError
Instance details Defined in Morley.Tezos.Crypto.Util Methods (==) :: CryptoParseError -> CryptoParseError -> Bool # (/=) :: CryptoParseError -> CryptoParseError -> Bool #
Eq ParseChainIdError
Instance details Defined in Morley.Tezos.Core Methods (==) :: ParseChainIdError -> ParseChainIdError -> Bool # (/=) :: ParseChainIdError -> ParseChainIdError -> Bool #
Eq KeyHashTag
Instance details Defined in Morley.Tezos.Crypto Methods (==) :: KeyHashTag -> KeyHashTag -> Bool # (/=) :: KeyHashTag -> KeyHashTag -> Bool #
Eq SecretKey
Instance details Defined in Morley.Tezos.Crypto Methods (==) :: SecretKey -> SecretKey -> Bool # (/=) :: SecretKey -> SecretKey -> Bool #
Eq OpeningResult
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: OpeningResult -> OpeningResult -> Bool # (/=) :: OpeningResult -> OpeningResult -> Bool #
Eq TLTime
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: TLTime -> TLTime -> Bool # (/=) :: TLTime -> TLTime -> Bool #
Eq ParseSignatureRawError
Instance details Defined in Morley.Tezos.Crypto Methods (==) :: ParseSignatureRawError -> ParseSignatureRawError -> Bool # (/=) :: ParseSignatureRawError -> ParseSignatureRawError -> Bool #
Eq PublicKey
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Methods (==) :: PublicKey -> PublicKey -> Bool # (/=) :: PublicKey -> PublicKey -> Bool #
Eq PublicKey
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Methods (==) :: PublicKey -> PublicKey -> Bool # (/=) :: PublicKey -> PublicKey -> Bool #
Eq PublicKey
Instance details Defined in Morley.Tezos.Crypto.P256 Methods (==) :: PublicKey -> PublicKey -> Bool # (/=) :: PublicKey -> PublicKey -> Bool #
Eq SecretKey
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Methods (==) :: SecretKey -> SecretKey -> Bool # (/=) :: SecretKey -> SecretKey -> Bool #
Eq SecretKey
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Methods (==) :: SecretKey -> SecretKey -> Bool # (/=) :: SecretKey -> SecretKey -> Bool #
Eq SecretKey
Instance details Defined in Morley.Tezos.Crypto.P256 Methods (==) :: SecretKey -> SecretKey -> Bool # (/=) :: SecretKey -> SecretKey -> Bool #
Eq Signature
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Methods (==) :: Signature -> Signature -> Bool # (/=) :: Signature -> Signature -> Bool #
Eq Signature
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Methods (==) :: Signature -> Signature -> Bool # (/=) :: Signature -> Signature -> Bool #
Eq Signature
Instance details Defined in Morley.Tezos.Crypto.P256 Methods (==) :: Signature -> Signature -> Bool # (/=) :: Signature -> Signature -> Bool #
Eq DocItemPos
Instance details Defined in Morley.Michelson.Doc Methods (==) :: DocItemPos -> DocItemPos -> Bool # (/=) :: DocItemPos -> DocItemPos -> Bool #
Eq SomeDocDefinitionItem
Instance details Defined in Morley.Michelson.Doc Methods (==) :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> Bool # (/=) :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> Bool #
Eq UntypingOptions
Instance details Defined in Morley.Michelson.Typed.Convert Methods (==) :: UntypingOptions -> UntypingOptions -> Bool # (/=) :: UntypingOptions -> UntypingOptions -> Bool #
Eq Ciphertext
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: Ciphertext -> Ciphertext -> Bool # (/=) :: Ciphertext -> Ciphertext -> Bool #
Eq Locked
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: Locked -> Locked -> Bool # (/=) :: Locked -> Locked -> Bool #
Eq Nonce
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: Nonce -> Nonce -> Bool # (/=) :: Nonce -> Nonce -> Bool #
Eq Proof
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: Proof -> Proof -> Bool # (/=) :: Proof -> Proof -> Bool #
Eq PublicModulus
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: PublicModulus -> PublicModulus -> Bool # (/=) :: PublicModulus -> PublicModulus -> Bool #
Eq Unlocked
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods (==) :: Unlocked -> Unlocked -> Bool # (/=) :: Unlocked -> Unlocked -> Bool #
Eq InstrCallStack
Instance details Defined in Morley.Michelson.ErrorPos Methods (==) :: InstrCallStack -> InstrCallStack -> Bool # (/=) :: InstrCallStack -> InstrCallStack -> Bool #
Eq DeserializationError
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods (==) :: DeserializationError -> DeserializationError -> Bool # (/=) :: DeserializationError -> DeserializationError -> Bool #
Eq DocItemId
Instance details Defined in Morley.Michelson.Doc Methods (==) :: DocItemId -> DocItemId -> Bool # (/=) :: DocItemId -> DocItemId -> Bool #
Eq Expression
Instance details Defined in Morley.Micheline.Expression Methods (==) :: Expression -> Expression -> Bool # (/=) :: Expression -> Expression -> Bool #
Eq TezosMutez
Instance details Defined in Morley.Micheline.Json Methods (==) :: TezosMutez -> TezosMutez -> Bool # (/=) :: TezosMutez -> TezosMutez -> Bool #
Eq LetName
Instance details Defined in Morley.Michelson.ErrorPos Methods (==) :: LetName -> LetName -> Bool # (/=) :: LetName -> LetName -> Bool #
Eq Pos
Instance details Defined in Morley.Michelson.ErrorPos Methods (==) :: Pos -> Pos -> Bool # (/=) :: Pos -> Pos -> Bool #
Eq SrcPos
Instance details Defined in Morley.Michelson.ErrorPos Methods (==) :: SrcPos -> SrcPos -> Bool # (/=) :: SrcPos -> SrcPos -> Bool #
Eq ExtError
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods (==) :: ExtError -> ExtError -> Bool # (/=) :: ExtError -> ExtError -> Bool #
Eq StackSize
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods (==) :: StackSize -> StackSize -> Bool # (/=) :: StackSize -> StackSize -> Bool #
Eq TCError
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods (==) :: TCError -> TCError -> Bool # (/=) :: TCError -> TCError -> Bool #
Eq TCTypeError
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods (==) :: TCTypeError -> TCTypeError -> Bool # (/=) :: TCTypeError -> TCTypeError -> Bool #
Eq TopLevelType
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods (==) :: TopLevelType -> TopLevelType -> Bool # (/=) :: TopLevelType -> TopLevelType -> Bool #
Eq TypeContext
Instance details Defined in Morley.Michelson.TypeCheck.Error Methods (==) :: TypeContext -> TypeContext -> Bool # (/=) :: TypeContext -> TypeContext -> Bool #
Eq SomeHST
Instance details Defined in Morley.Michelson.TypeCheck.Types Methods (==) :: SomeHST -> SomeHST -> Bool # (/=) :: SomeHST -> SomeHST -> Bool #
Eq TypeCheckedOp
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheckedOp Methods (==) :: TypeCheckedOp -> TypeCheckedOp -> Bool # (/=) :: TypeCheckedOp -> TypeCheckedOp -> Bool #
Eq IllTypedInstr
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheckedOp Methods (==) :: IllTypedInstr -> IllTypedInstr -> Bool # (/=) :: IllTypedInstr -> IllTypedInstr -> Bool #
Eq HexJSONByteString
Instance details Defined in Morley.Util.ByteString Methods (==) :: HexJSONByteString -> HexJSONByteString -> Bool # (/=) :: HexJSONByteString -> HexJSONByteString -> Bool #
Eq EpCallingStep Source #
Instance details Defined in Lorentz.Entrypoints.Core Methods (==) :: EpCallingStep -> EpCallingStep -> Bool # (/=) :: EpCallingStep -> EpCallingStep -> Bool #
Eq ViewInterfaceMatchError Source #
Instance details Defined in Lorentz.ViewBase Methods (==) :: ViewInterfaceMatchError -> ViewInterfaceMatchError -> Bool # (/=) :: ViewInterfaceMatchError -> ViewInterfaceMatchError -> Bool #
Eq FromExpressionError
Instance details Defined in Morley.Micheline.Class Methods (==) :: FromExpressionError -> FromExpressionError -> Bool # (/=) :: FromExpressionError -> FromExpressionError -> Bool #
Eq Annotation
Instance details Defined in Morley.Micheline.Expression Methods (==) :: Annotation -> Annotation -> Bool # (/=) :: Annotation -> Annotation -> Bool #
Eq MichelinePrimAp
Instance details Defined in Morley.Micheline.Expression Methods (==) :: MichelinePrimAp -> MichelinePrimAp -> Bool # (/=) :: MichelinePrimAp -> MichelinePrimAp -> Bool #
Eq MichelinePrimitive
Instance details Defined in Morley.Micheline.Expression Methods (==) :: MichelinePrimitive -> MichelinePrimitive -> Bool # (/=) :: MichelinePrimitive -> MichelinePrimitive -> Bool #
Eq CustomParserException
Instance details Defined in Morley.Michelson.Parser.Error Methods (==) :: CustomParserException -> CustomParserException -> Bool # (/=) :: CustomParserException -> CustomParserException -> Bool #
Eq ParserException
Instance details Defined in Morley.Michelson.Parser.Error Methods (==) :: ParserException -> ParserException -> Bool # (/=) :: ParserException -> ParserException -> Bool #
Eq StringLiteralParserException
Instance details Defined in Morley.Michelson.Parser.Error Methods (==) :: StringLiteralParserException -> StringLiteralParserException -> Bool # (/=) :: StringLiteralParserException -> StringLiteralParserException -> Bool #
Eq MichelsonSource
Instance details Defined in Morley.Michelson.Parser.Types Methods (==) :: MichelsonSource -> MichelsonSource -> Bool # (/=) :: MichelsonSource -> MichelsonSource -> Bool #
Eq ParsedOp
Instance details Defined in Morley.Michelson.Macro Methods (==) :: ParsedOp -> ParsedOp -> Bool # (/=) :: ParsedOp -> ParsedOp -> Bool #
Eq LetEnv
Instance details Defined in Morley.Michelson.Parser.Types Methods (==) :: LetEnv -> LetEnv -> Bool # (/=) :: LetEnv -> LetEnv -> Bool #
Eq SomeParamType
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheck Methods (==) :: SomeParamType -> SomeParamType -> Bool # (/=) :: SomeParamType -> SomeParamType -> Bool #
Eq LetMacro
Instance details Defined in Morley.Michelson.Macro Methods (==) :: LetMacro -> LetMacro -> Bool # (/=) :: LetMacro -> LetMacro -> Bool #
Eq ParserOptions
Instance details Defined in Morley.Michelson.Parser.Types Methods (==) :: ParserOptions -> ParserOptions -> Bool # (/=) :: ParserOptions -> ParserOptions -> Bool #
Eq CadrStruct
Instance details Defined in Morley.Michelson.Macro Methods (==) :: CadrStruct -> CadrStruct -> Bool # (/=) :: CadrStruct -> CadrStruct -> Bool #
Eq Macro
Instance details Defined in Morley.Michelson.Macro Methods (==) :: Macro -> Macro -> Bool # (/=) :: Macro -> Macro -> Bool #
Eq PairStruct
Instance details Defined in Morley.Michelson.Macro Methods (==) :: PairStruct -> PairStruct -> Bool # (/=) :: PairStruct -> PairStruct -> Bool #
Eq UnpairStruct
Instance details Defined in Morley.Michelson.Macro Methods (==) :: UnpairStruct -> UnpairStruct -> Bool # (/=) :: UnpairStruct -> UnpairStruct -> Bool #
Eq Positive
Instance details Defined in Morley.Util.Positive Methods (==) :: Positive -> Positive -> Bool # (/=) :: Positive -> Positive -> Bool #
Eq Never Source #
Instance details Defined in Lorentz.Value Methods (==) :: Never -> Never -> Bool # (/=) :: Never -> Never -> Bool #
Eq OpenChest Source #
Instance details Defined in Lorentz.Value Methods (==) :: OpenChest -> OpenChest -> Bool # (/=) :: OpenChest -> OpenChest -> Bool #
Eq ZSNil Source #
Instance details Defined in Lorentz.Zip Methods (==) :: ZSNil -> ZSNil -> Bool # (/=) :: ZSNil -> ZSNil -> Bool #
Eq DViewDesc Source #
Instance details Defined in Lorentz.Doc Methods (==) :: DViewDesc -> DViewDesc -> Bool # (/=) :: DViewDesc -> DViewDesc -> Bool #
Eq DHashAlgorithm Source #
Instance details Defined in Lorentz.Bytes Methods (==) :: DHashAlgorithm -> DHashAlgorithm -> Bool # (/=) :: DHashAlgorithm -> DHashAlgorithm -> Bool #
Eq UnpackError
Instance details Defined in Morley.Util.Binary Methods (==) :: UnpackError -> UnpackError -> Bool # (/=) :: UnpackError -> UnpackError -> Bool #
Eq DThrows Source #
Instance details Defined in Lorentz.Errors Methods (==) :: DThrows -> DThrows -> Bool # (/=) :: DThrows -> DThrows -> Bool #
Eq DError Source #
Instance details Defined in Lorentz.Errors Methods (==) :: DError -> DError -> Bool # (/=) :: DError -> DError -> Bool #
Eq SomeError Source #
Instance details Defined in Lorentz.Errors Methods (==) :: SomeError -> SomeError -> Bool # (/=) :: SomeError -> SomeError -> Bool #
Eq Transformation
Instance details Defined in Morley.Util.Interpolate.Internal Methods (==) :: Transformation -> Transformation -> Bool # (/=) :: Transformation -> Transformation -> Bool #
Eq BimapException
Instance details Defined in Data.Bimap Methods (==) :: BimapException -> BimapException -> Bool # (/=) :: BimapException -> BimapException -> Bool #
Eq AnalyzerRes
Instance details Defined in Morley.Michelson.Analyzer Methods (==) :: AnalyzerRes -> AnalyzerRes -> Bool # (/=) :: AnalyzerRes -> AnalyzerRes -> Bool #
Eq ExtConversionError Source #
Instance details Defined in Lorentz.Extensible Methods (==) :: ExtConversionError -> ExtConversionError -> Bool # (/=) :: ExtConversionError -> ExtConversionError -> Bool #
Eq DDescribeErrorTagMap Source #
Instance details Defined in Lorentz.Errors.Numeric.Doc Methods (==) :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Bool # (/=) :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Bool #
Eq ParamBuildingStep Source #
Instance details Defined in Lorentz.Entrypoints.Doc Methods (==) :: ParamBuildingStep -> ParamBuildingStep -> Bool # (/=) :: ParamBuildingStep -> ParamBuildingStep -> Bool #
Eq ParamBuildingDesc Source #
Instance details Defined in Lorentz.Entrypoints.Doc Methods (==) :: ParamBuildingDesc -> ParamBuildingDesc -> Bool # (/=) :: ParamBuildingDesc -> ParamBuildingDesc -> Bool #
Eq ParamBuilder Source #
Instance details Defined in Lorentz.Entrypoints.Doc Methods (==) :: ParamBuilder -> ParamBuilder -> Bool # (/=) :: ParamBuilder -> ParamBuilder -> Bool #
Eq EntrypointLookupError Source #
Instance details Defined in Lorentz.UParam Methods (==) :: EntrypointLookupError -> EntrypointLookupError -> Bool # (/=) :: EntrypointLookupError -> EntrypointLookupError -> Bool #
Eq MichelsonFailed
Instance details Defined in Morley.Michelson.Interpret Methods (==) :: MichelsonFailed -> MichelsonFailed -> Bool # (/=) :: MichelsonFailed -> MichelsonFailed -> Bool #
Eq MichelsonFailureWithStack
Instance details Defined in Morley.Michelson.Interpret Methods (==) :: MichelsonFailureWithStack -> MichelsonFailureWithStack -> Bool # (/=) :: MichelsonFailureWithStack -> MichelsonFailureWithStack -> Bool #
Eq MorleyLogs
Instance details Defined in Morley.Michelson.Interpret Methods (==) :: MorleyLogs -> MorleyLogs -> Bool # (/=) :: MorleyLogs -> MorleyLogs -> Bool #
Eq RemainingSteps
Instance details Defined in Morley.Michelson.Interpret Methods (==) :: RemainingSteps -> RemainingSteps -> Bool # (/=) :: RemainingSteps -> RemainingSteps -> Bool #
Eq BigMapCounter
Instance details Defined in Morley.Michelson.Runtime.GState Methods (==) :: BigMapCounter -> BigMapCounter -> Bool # (/=) :: BigMapCounter -> BigMapCounter -> Bool #
Eq AddressState
Instance details Defined in Morley.Michelson.Runtime.GState Methods (==) :: AddressState -> AddressState -> Bool # (/=) :: AddressState -> AddressState -> Bool #
Eq VotingPowers
Instance details Defined in Morley.Michelson.Runtime.GState Methods (==) :: VotingPowers -> VotingPowers -> Bool # (/=) :: VotingPowers -> VotingPowers -> Bool #
Eq OperationHash
Instance details Defined in Morley.Michelson.Typed.Operation Methods (==) :: OperationHash -> OperationHash -> Bool # (/=) :: OperationHash -> OperationHash -> Bool #
Eq ContractState
Instance details Defined in Morley.Michelson.Runtime.GState Methods (==) :: ContractState -> ContractState -> Bool # (/=) :: ContractState -> ContractState -> Bool #
Eq GState
Instance details Defined in Morley.Michelson.Runtime.GState Methods (==) :: GState -> GState -> Bool # (/=) :: GState -> GState -> Bool #
Class () (Eq a)
Instance details Defined in Data.Constraint Methods cls :: Eq a :- () #
() :=> (Eq Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Bool #
() :=> (Eq Double)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Double #
() :=> (Eq Float)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Float #
() :=> (Eq Int)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Int #
() :=> (Eq Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Integer #
() :=> (Eq Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Natural #
() :=> (Eq Word)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Word #
() :=> (Eq ())
Instance details Defined in Data.Constraint Methods ins :: () :- Eq () #
() :=> (Eq (Dict a))
Instance details Defined in Data.Constraint Methods ins :: () :- Eq (Dict a) #
() :=> (Eq (a :- b))
Instance details Defined in Data.Constraint Methods ins :: () :- Eq (a :- b) #
Eq a => Eq [a]
Instance details Defined in GHC.Classes Methods (==) :: [a] -> [a] -> Bool # (/=) :: [a] -> [a] -> Bool #
Eq a => Eq (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Maybe Methods (==) :: Maybe a -> Maybe a -> Bool # (/=) :: Maybe a -> Maybe a -> Bool #
Eq a => Eq (Ratio a)	Since: base-2.1
Instance details Defined in GHC.Real Methods (==) :: Ratio a -> Ratio a -> Bool # (/=) :: Ratio a -> Ratio a -> Bool #
Eq (Ptr a)	Since: base-2.1
Instance details Defined in GHC.Ptr Methods (==) :: Ptr a -> Ptr a -> Bool # (/=) :: Ptr a -> Ptr a -> Bool #
Eq (FunPtr a)
Instance details Defined 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 details Defined in GHC.Generics Methods (==) :: Par1 p -> Par1 p -> Bool # (/=) :: Par1 p -> Par1 p -> Bool #
Eq a => Eq (First a)	Since: base-4.9.0.0
Instance details Defined 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 details Defined in Data.Semigroup Methods (==) :: Last a -> Last a -> Bool # (/=) :: Last a -> Last a -> Bool #
Eq (MVar a)	Since: base-4.1.0.0
Instance details Defined in GHC.MVar Methods (==) :: MVar a -> MVar a -> Bool # (/=) :: MVar a -> MVar a -> Bool #
Eq a => Eq (First' a)
Instance details Defined in Distribution.Compat.Semigroup Methods (==) :: First' a -> First' a -> Bool # (/=) :: First' a -> First' a -> Bool #
Eq a => Eq (Last' a)
Instance details Defined in Distribution.Compat.Semigroup Methods (==) :: Last' a -> Last' a -> Bool # (/=) :: Last' a -> Last' a -> Bool #
Eq a => Eq (Option' a)
Instance details Defined in Distribution.Compat.Semigroup Methods (==) :: Option' a -> Option' a -> Bool # (/=) :: Option' a -> Option' a -> Bool #
Eq a => Eq (Set a)
Instance details Defined in Data.Set.Internal Methods (==) :: Set a -> Set a -> Bool # (/=) :: Set a -> Set a -> Bool #
Eq vertex => Eq (SCC vertex)	Since: containers-0.5.9
Instance details Defined in Data.Graph Methods (==) :: SCC vertex -> SCC vertex -> Bool # (/=) :: SCC vertex -> SCC vertex -> Bool #
Eq a => Eq (NonEmpty a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (==) :: NonEmpty a -> NonEmpty a -> Bool # (/=) :: NonEmpty a -> NonEmpty a -> Bool #
Eq a => Eq (Identity a)	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods (==) :: Identity a -> Identity a -> Bool # (/=) :: Identity a -> Identity a -> Bool #
Eq a => Eq (IResult a)
Instance details Defined in Data.Aeson.Types.Internal Methods (==) :: IResult a -> IResult a -> Bool # (/=) :: IResult a -> IResult a -> Bool #
Eq a => Eq (Result a)
Instance details Defined in Data.Aeson.Types.Internal Methods (==) :: Result a -> Result a -> Bool # (/=) :: Result a -> Result a -> Bool #
Eq (ForeignPtr a)	Since: base-2.1
Instance details Defined in GHC.ForeignPtr Methods (==) :: ForeignPtr a -> ForeignPtr a -> Bool # (/=) :: ForeignPtr a -> ForeignPtr a -> Bool #
Eq a => Eq (Complex a)	Since: base-2.1
Instance details Defined 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 details Defined 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 details Defined in Data.Semigroup Methods (==) :: Max a -> Max a -> Bool # (/=) :: Max a -> Max a -> Bool #
Eq m => Eq (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined 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 details Defined 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 details Defined in Control.Applicative Methods (==) :: ZipList a -> ZipList a -> Bool # (/=) :: ZipList a -> ZipList a -> Bool #
Eq (TVar a)	Since: base-4.8.0.0
Instance details Defined 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 details Defined in GHC.IORef Methods (==) :: IORef a -> IORef a -> Bool # (/=) :: IORef a -> IORef a -> Bool #
Eq a => Eq (First a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods (==) :: First a -> First a -> Bool # (/=) :: First a -> First a -> Bool #
Eq a => Eq (Last a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods (==) :: Last a -> Last a -> Bool # (/=) :: Last a -> Last a -> Bool #
Eq a => Eq (Dual a)	Since: base-2.1
Instance details Defined 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 details Defined 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 details Defined 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 details Defined in Data.Ord Methods (==) :: Down a -> Down a -> Bool # (/=) :: Down a -> Down a -> Bool #
Eq a => Eq (Array a)
Instance details Defined in Basement.BoxedArray Methods (==) :: Array a -> Array a -> Bool # (/=) :: Array a -> Array a -> Bool #
(PrimType ty, Eq ty) => Eq (UArray ty)
Instance details Defined in Basement.UArray.Base Methods (==) :: UArray ty -> UArray ty -> Bool # (/=) :: UArray ty -> UArray ty -> Bool #
(PrimType ty, Eq ty) => Eq (Block ty)
Instance details Defined in Basement.Block.Base Methods (==) :: Block ty -> Block ty -> Bool # (/=) :: Block ty -> Block ty -> Bool #
Eq a => Eq (NonEmpty a)
Instance details Defined in Basement.NonEmpty Methods (==) :: NonEmpty a -> NonEmpty a -> Bool # (/=) :: NonEmpty a -> NonEmpty a -> Bool #
Eq (Offset ty)
Instance details Defined in Basement.Types.OffsetSize Methods (==) :: Offset ty -> Offset ty -> Bool # (/=) :: Offset ty -> Offset ty -> Bool #
Eq (CountOf ty)
Instance details Defined in Basement.Types.OffsetSize Methods (==) :: CountOf ty -> CountOf ty -> Bool # (/=) :: CountOf ty -> CountOf ty -> Bool #
Eq (Zn64 n)
Instance details Defined in Basement.Bounded Methods (==) :: Zn64 n -> Zn64 n -> Bool # (/=) :: Zn64 n -> Zn64 n -> Bool #
Eq (Zn n)
Instance details Defined in Basement.Bounded Methods (==) :: Zn n -> Zn n -> Bool # (/=) :: Zn n -> Zn n -> Bool #
Eq a => Eq (Colour a)
Instance details Defined in Data.Colour.Internal Methods (==) :: Colour a -> Colour a -> Bool # (/=) :: Colour a -> Colour a -> Bool #
Eq a => Eq (AlphaColour a)
Instance details Defined in Data.Colour.Internal Methods (==) :: AlphaColour a -> AlphaColour a -> Bool # (/=) :: AlphaColour a -> AlphaColour a -> Bool #
Eq (Dict a)
Instance details Defined in Data.Constraint Methods (==) :: Dict a -> Dict a -> Bool # (/=) :: Dict a -> Dict a -> Bool #
Eq a => Eq (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods (==) :: IntMap a -> IntMap a -> Bool # (/=) :: IntMap a -> IntMap a -> Bool #
Eq a => Eq (Tree a)
Instance details Defined in Data.Tree Methods (==) :: Tree a -> Tree a -> Bool # (/=) :: Tree a -> Tree a -> Bool #
Eq a => Eq (Seq a)
Instance details Defined in Data.Sequence.Internal Methods (==) :: Seq a -> Seq a -> Bool # (/=) :: Seq a -> Seq a -> Bool #
Eq a => Eq (ViewL a)
Instance details Defined in Data.Sequence.Internal Methods (==) :: ViewL a -> ViewL a -> Bool # (/=) :: ViewL a -> ViewL a -> Bool #
Eq a => Eq (ViewR a)
Instance details Defined in Data.Sequence.Internal Methods (==) :: ViewR a -> ViewR a -> Bool # (/=) :: ViewR a -> ViewR a -> Bool #
Eq (Digest a)
Instance details Defined in Crypto.Hash.Types Methods (==) :: Digest a -> Digest a -> Bool # (/=) :: Digest a -> Digest a -> Bool #
Eq a => Eq (CryptoFailable a)
Instance details Defined in Crypto.Error.Types Methods (==) :: CryptoFailable a -> CryptoFailable a -> Bool # (/=) :: CryptoFailable a -> CryptoFailable a -> Bool #
Eq1 f => Eq (Fix f)
Instance details Defined in Data.Fix Methods (==) :: Fix f -> Fix f -> Bool # (/=) :: Fix f -> Fix f -> Bool #
(Functor f, Eq1 f) => Eq (Mu f)
Instance details Defined in Data.Fix Methods (==) :: Mu f -> Mu f -> Bool # (/=) :: Mu f -> Mu f -> Bool #
(Functor f, Eq1 f) => Eq (Nu f)
Instance details Defined in Data.Fix Methods (==) :: Nu f -> Nu f -> Bool # (/=) :: Nu f -> Nu f -> Bool #
Eq a => Eq (DNonEmpty a)
Instance details Defined in Data.DList.DNonEmpty.Internal Methods (==) :: DNonEmpty a -> DNonEmpty a -> Bool # (/=) :: DNonEmpty a -> DNonEmpty a -> Bool #
Eq a => Eq (DList a)
Instance details Defined in Data.DList.Internal Methods (==) :: DList a -> DList a -> Bool # (/=) :: DList a -> DList a -> Bool #
Eq a => Eq (Hex a)
Instance details Defined in Data.Text.Format.Types Methods (==) :: Hex a -> Hex a -> Bool # (/=) :: Hex a -> Hex a -> Bool #
Eq a => Eq (Shown a)
Instance details Defined in Data.Text.Format.Types Methods (==) :: Shown a -> Shown a -> Bool # (/=) :: Shown a -> Shown a -> Bool #
Eq (Prime p)
Instance details Defined in Data.Field.Galois.Prime Methods (==) :: Prime p -> Prime p -> Bool # (/=) :: Prime p -> Prime p -> Bool #
Eq (Binary p)
Instance details Defined in Data.Field.Galois.Binary Methods (==) :: Binary p -> Binary p -> Bool # (/=) :: Binary p -> Binary p -> Bool #
Eq a => Eq (Hashed a)	Uses precomputed hash to detect inequality faster
Instance details Defined in Data.Hashable.Class Methods (==) :: Hashed a -> Hashed a -> Bool # (/=) :: Hashed a -> Hashed a -> Bool #
(Prim a, Eq a) => Eq (Vector a)
Instance details Defined in Data.Vector.Primitive Methods (==) :: Vector a -> Vector a -> Bool # (/=) :: Vector a -> Vector a -> Bool #
(Storable a, Eq a) => Eq (Vector a)
Instance details Defined in Data.Vector.Storable Methods (==) :: Vector a -> Vector a -> Bool # (/=) :: Vector a -> Vector a -> Bool #
Eq a => Eq (HashSet a)	Note that, in the presence of hash collisions, equal `HashSet`s 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 details Defined in Data.HashSet.Internal Methods (==) :: HashSet a -> HashSet a -> Bool # (/=) :: HashSet a -> HashSet a -> Bool #
Eq a => Eq (Vector a)
Instance details Defined in Data.Vector Methods (==) :: Vector a -> Vector a -> Bool # (/=) :: Vector a -> Vector a -> Bool #
Eq t => Eq (ErrorItem t)
Instance details Defined in Text.Megaparsec.Error Methods (==) :: ErrorItem t -> ErrorItem t -> Bool # (/=) :: ErrorItem t -> ErrorItem t -> Bool #
Eq e => Eq (ErrorFancy e)
Instance details Defined in Text.Megaparsec.Error Methods (==) :: ErrorFancy e -> ErrorFancy e -> Bool # (/=) :: ErrorFancy e -> ErrorFancy e -> Bool #
Eq s => Eq (PosState s)
Instance details Defined in Text.Megaparsec.State Methods (==) :: PosState s -> PosState s -> Bool # (/=) :: PosState s -> PosState s -> Bool #
Eq (Mod m)
Instance details Defined in Data.Mod Methods (==) :: Mod m -> Mod m -> Bool # (/=) :: Mod m -> Mod m -> Bool #
Eq (Doc a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: Doc a -> Doc a -> Bool # (/=) :: Doc a -> Doc a -> Bool #
Eq a => Eq (AnnotDetails a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: AnnotDetails a -> AnnotDetails a -> Bool # (/=) :: AnnotDetails a -> AnnotDetails a -> Bool #
Eq a => Eq (Span a)
Instance details Defined 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 details Defined in Data.Primitive.PrimArray Methods (==) :: PrimArray a -> PrimArray a -> Bool # (/=) :: PrimArray a -> PrimArray a -> Bool #
Eq (MutableByteArray s)
Instance details Defined in Data.Primitive.ByteArray Methods (==) :: MutableByteArray s -> MutableByteArray s -> Bool # (/=) :: MutableByteArray s -> MutableByteArray s -> Bool #
Eq a => Eq (SmallArray a)
Instance details Defined in Data.Primitive.SmallArray Methods (==) :: SmallArray a -> SmallArray a -> Bool # (/=) :: SmallArray a -> SmallArray a -> Bool #
Eq a => Eq (Array a)
Instance details Defined in Data.Primitive.Array Methods (==) :: Array a -> Array a -> Bool # (/=) :: Array a -> Array a -> Bool #
Eq g => Eq (AtomicGen g)
Instance details Defined in System.Random.Stateful Methods (==) :: AtomicGen g -> AtomicGen g -> Bool # (/=) :: AtomicGen g -> AtomicGen g -> Bool #
Eq g => Eq (IOGen g)
Instance details Defined in System.Random.Stateful Methods (==) :: IOGen g -> IOGen g -> Bool # (/=) :: IOGen g -> IOGen g -> Bool #
Eq g => Eq (STGen g)
Instance details Defined in System.Random.Stateful Methods (==) :: STGen g -> STGen g -> Bool # (/=) :: STGen g -> STGen g -> Bool #
Eq g => Eq (StateGen g)
Instance details Defined in System.Random.Internal Methods (==) :: StateGen g -> StateGen g -> Bool # (/=) :: StateGen g -> StateGen g -> Bool #
Eq a => Eq (Add a)
Instance details Defined in Data.Semiring Methods (==) :: Add a -> Add a -> Bool # (/=) :: Add a -> Add a -> Bool #
Eq a => Eq (Mul a)
Instance details Defined in Data.Semiring Methods (==) :: Mul a -> Mul a -> Bool # (/=) :: Mul a -> Mul a -> Bool #
Eq a => Eq (WrappedNum a)
Instance details Defined in Data.Semiring Methods (==) :: WrappedNum a -> WrappedNum a -> Bool # (/=) :: WrappedNum a -> WrappedNum a -> Bool #
Eq (IntSetOf a)
Instance details Defined in Data.Semiring Methods (==) :: IntSetOf a -> IntSetOf a -> Bool # (/=) :: IntSetOf a -> IntSetOf a -> Bool #
Eq a => Eq (Maybe a)
Instance details Defined in Data.Strict.Maybe Methods (==) :: Maybe a -> Maybe a -> Bool # (/=) :: Maybe a -> Maybe a -> Bool #
Eq a => Eq (Identity a)
Instance details Defined in Data.Vinyl.Functor Methods (==) :: Identity a -> Identity a -> Bool # (/=) :: Identity a -> Identity a -> Bool #
Eq t => Eq (ElField '(s, t))
Instance details Defined in Data.Vinyl.Functor Methods (==) :: ElField '(s, t) -> ElField '(s, t) -> Bool # (/=) :: ElField '(s, t) -> ElField '(s, t) -> Bool #
Eq (Label name)
Instance details Defined in Morley.Util.Label Methods (==) :: Label name -> Label name -> Bool # (/=) :: Label name -> Label name -> Bool #
Eq (AnnotatedValue v)
Instance details Defined in Morley.Michelson.Typed.AnnotatedValue Methods (==) :: AnnotatedValue v -> AnnotatedValue v -> Bool # (/=) :: AnnotatedValue v -> AnnotatedValue v -> Bool #
Eq (Notes t)
Instance details Defined in Morley.Michelson.Typed.Annotation Methods (==) :: Notes t -> Notes t -> Bool # (/=) :: Notes t -> Notes t -> Bool #
Eq (ParamNotes t)
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods (==) :: ParamNotes t -> ParamNotes t -> Bool # (/=) :: ParamNotes t -> ParamNotes t -> Bool #
Eq (SomeEntrypointCallT arg)
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods (==) :: SomeEntrypointCallT arg -> SomeEntrypointCallT arg -> Bool # (/=) :: SomeEntrypointCallT arg -> SomeEntrypointCallT arg -> Bool #
(forall (t :: T). cs t => SingI t) => Eq (SomeConstrainedValue cs)
Instance details Defined in Morley.Michelson.Typed.Existential Methods (==) :: SomeConstrainedValue cs -> SomeConstrainedValue cs -> Bool # (/=) :: SomeConstrainedValue cs -> SomeConstrainedValue cs -> Bool #
Eq (ContractRef arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods (==) :: ContractRef arg -> ContractRef arg -> Bool # (/=) :: ContractRef arg -> ContractRef arg -> Bool #
Eq arg => Eq (Ticket arg)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods (==) :: Ticket arg -> Ticket arg -> Bool # (/=) :: Ticket arg -> Ticket arg -> Bool #
Eq (PrintComment st)
Instance details Defined in Morley.Michelson.Typed.Instr Methods (==) :: PrintComment st -> PrintComment st -> Bool # (/=) :: PrintComment st -> PrintComment st -> Bool #
Eq (StackRef st)
Instance details Defined in Morley.Michelson.Typed.Instr Methods (==) :: StackRef st -> StackRef st -> Bool # (/=) :: StackRef st -> StackRef st -> Bool #
Eq (Operation' instr)
Instance details Defined in Morley.Michelson.Typed.Value Methods (==) :: Operation' instr -> Operation' instr -> Bool # (/=) :: Operation' instr -> Operation' instr -> Bool #
(forall (i :: [T]) (o :: [T]). Eq (instr i o)) => Eq (SomeViewsSet' instr)
Instance details Defined in Morley.Michelson.Typed.View Methods (==) :: SomeViewsSet' instr -> SomeViewsSet' instr -> Bool # (/=) :: SomeViewsSet' instr -> SomeViewsSet' instr -> Bool #
Eq op => Eq (Contract' op)
Instance details Defined in Morley.Michelson.Untyped.Contract Methods (==) :: Contract' op -> Contract' op -> Bool # (/=) :: Contract' op -> Contract' op -> Bool #
Eq op => Eq (ContractBlock op)
Instance details Defined in Morley.Michelson.Untyped.Contract Methods (==) :: ContractBlock op -> ContractBlock op -> Bool # (/=) :: ContractBlock op -> ContractBlock op -> Bool #
Eq op => Eq (ExtInstrAbstract op)
Instance details Defined in Morley.Michelson.Untyped.Ext Methods (==) :: ExtInstrAbstract op -> ExtInstrAbstract op -> Bool # (/=) :: ExtInstrAbstract op -> ExtInstrAbstract op -> Bool #
Eq op => Eq (TestAssert op)
Instance details Defined in Morley.Michelson.Untyped.Ext Methods (==) :: TestAssert op -> TestAssert op -> Bool # (/=) :: TestAssert op -> TestAssert op -> Bool #
Eq op => Eq (InstrAbstract op)
Instance details Defined in Morley.Michelson.Untyped.Instr Methods (==) :: InstrAbstract op -> InstrAbstract op -> Bool # (/=) :: InstrAbstract op -> InstrAbstract op -> Bool #
Eq op => Eq (Elt op)
Instance details Defined in Morley.Michelson.Untyped.Value Methods (==) :: Elt op -> Elt op -> Bool # (/=) :: Elt op -> Elt op -> Bool #
Eq op => Eq (Value' op)
Instance details Defined in Morley.Michelson.Untyped.Value Methods (==) :: Value' op -> Value' op -> Bool # (/=) :: Value' op -> Value' op -> Bool #
Eq op => Eq (View' op)
Instance details Defined in Morley.Michelson.Untyped.View Methods (==) :: View' op -> View' op -> Bool # (/=) :: View' op -> View' op -> Bool #
Eq a => Eq (MismatchError a)
Instance details Defined in Morley.Util.MismatchError Methods (==) :: MismatchError a -> MismatchError a -> Bool # (/=) :: MismatchError a -> MismatchError a -> Bool #
Eq (SingNat n)
Instance details Defined in Morley.Util.Peano Methods (==) :: SingNat n -> SingNat n -> Bool # (/=) :: SingNat n -> SingNat n -> Bool #
Eq (PeanoNatural n)
Instance details Defined in Morley.Util.PeanoNatural Methods (==) :: PeanoNatural n -> PeanoNatural n -> Bool # (/=) :: PeanoNatural n -> PeanoNatural n -> Bool #
Eq a => Eq (StringEncode a)
Instance details Defined in Morley.Micheline.Json Methods (==) :: StringEncode a -> StringEncode a -> Bool # (/=) :: StringEncode a -> StringEncode a -> Bool #
Eq (HST ts)
Instance details Defined in Morley.Michelson.TypeCheck.Types Methods (==) :: HST ts -> HST ts -> Bool # (/=) :: HST ts -> HST ts -> Bool #
Eq a => Eq (ReadTicket a) Source #
Instance details Defined in Lorentz.Value Methods (==) :: ReadTicket a -> ReadTicket a -> Bool # (/=) :: ReadTicket a -> ReadTicket a -> Bool #
Eq a => Eq (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes Methods (==) :: OpenChestT a -> OpenChestT a -> Bool # (/=) :: OpenChestT a -> OpenChestT a -> Bool #
Eq (Packed a) Source #
Instance details Defined in Lorentz.Bytes Methods (==) :: Packed a -> Packed a -> Bool # (/=) :: Packed a -> Packed a -> Bool #
Eq (CustomErrorRep tag) => Eq (CustomError tag) Source #
Instance details Defined in Lorentz.Errors Methods (==) :: CustomError tag -> CustomError tag -> Bool # (/=) :: CustomError tag -> CustomError tag -> Bool #
Eq r => Eq (VoidResult r) Source #
Instance details Defined in Lorentz.Macro Methods (==) :: VoidResult r -> VoidResult r -> Bool # (/=) :: VoidResult r -> VoidResult r -> Bool #
Eq (UParam entries) Source #
Instance details Defined in Lorentz.UParam Methods (==) :: UParam entries -> UParam entries -> Bool # (/=) :: UParam entries -> UParam entries -> Bool #
Eq (StkEl t)
Instance details Defined in Morley.Michelson.Interpret Methods (==) :: StkEl t -> StkEl t -> Bool # (/=) :: StkEl t -> StkEl t -> Bool #
Class (Eq a) (Ord a)
Instance details Defined in Data.Constraint Methods cls :: Ord a :- Eq a #
Class (Eq a) (Bits a)
Instance details Defined in Data.Constraint Methods cls :: Bits a :- Eq a #
(Eq a) :=> (Eq [a])
Instance details Defined in Data.Constraint Methods ins :: Eq a :- Eq [a] #
(Eq a) :=> (Eq (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Eq a :- Eq (Maybe a) #
(Eq a) :=> (Eq (Complex a))
Instance details Defined in Data.Constraint Methods ins :: Eq a :- Eq (Complex a) #
(Eq a) :=> (Eq (Ratio a))
Instance details Defined in Data.Constraint Methods ins :: Eq a :- Eq (Ratio a) #
(Eq a) :=> (Eq (Identity a))
Instance details Defined in Data.Constraint Methods ins :: Eq a :- Eq (Identity a) #
(Eq a) :=> (Eq (Const a b))
Instance details Defined in Data.Constraint Methods ins :: Eq a :- Eq (Const a b) #
(Eq a, Eq b) => Eq (Either a b)	Since: base-2.1
Instance details Defined 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 details Defined in GHC.Generics Methods (==) :: V1 p -> V1 p -> Bool # (/=) :: V1 p -> V1 p -> Bool #
Eq (U1 p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: U1 p -> U1 p -> Bool # (/=) :: U1 p -> U1 p -> Bool #
Eq (TypeRep a)	Since: base-2.1
Instance details Defined in Data.Typeable.Internal Methods (==) :: TypeRep a -> TypeRep a -> Bool # (/=) :: TypeRep a -> TypeRep a -> Bool #
(Eq a, Eq b) => Eq (a, b)
Instance details Defined in GHC.Classes Methods (==) :: (a, b) -> (a, b) -> Bool # (/=) :: (a, b) -> (a, b) -> Bool #
(Eq k, Eq a) => Eq (Map k a)
Instance details Defined in Data.Map.Internal Methods (==) :: Map k a -> Map k a -> Bool # (/=) :: Map k a -> Map k a -> Bool #
Eq (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods (==) :: Proxy s -> Proxy s -> Bool # (/=) :: Proxy s -> Proxy s -> Bool #
Eq a => Eq (OddWord a n)
Instance details Defined in Data.Word.Odd Methods (==) :: OddWord a n -> OddWord a n -> Bool # (/=) :: OddWord a n -> OddWord a n -> Bool #
(Eq k, Eq v) => Eq (HashMap k v)	Note that, in the presence of hash collisions, equal `HashMap`s 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 details Defined in Data.HashMap.Internal Methods (==) :: HashMap k v -> HashMap k v -> Bool # (/=) :: HashMap k v -> HashMap k v -> Bool #
Eq (Fixed a)	Since: base-2.1
Instance details Defined 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 details Defined in Data.Semigroup Methods (==) :: Arg a b -> Arg a b -> Bool # (/=) :: Arg a b -> Arg a b -> Bool #
Eq a => Eq (ListN n a)
Instance details Defined in Basement.Sized.List Methods (==) :: ListN n a -> ListN n a -> Bool # (/=) :: ListN n a -> ListN n a -> Bool #
(Eq a, Eq b) => Eq (Bimap a b)
Instance details Defined in Data.Bimap Methods (==) :: Bimap a b -> Bimap a b -> Bool # (/=) :: Bimap a b -> Bimap a b -> Bool #
Eq (a :- b)	Assumes `IncoherentInstances` doesn't exist.
Instance details Defined in Data.Constraint Methods (==) :: (a :- b) -> (a :- b) -> Bool # (/=) :: (a :- b) -> (a :- b) -> Bool #
(Eq1 m, Eq a) => Eq (MaybeT m a)
Instance details Defined in Control.Monad.Trans.Maybe Methods (==) :: MaybeT m a -> MaybeT m a -> Bool # (/=) :: MaybeT m a -> MaybeT m a -> Bool #
(Eq1 f, Eq a) => Eq (Cofree f a)
Instance details Defined in Control.Comonad.Cofree Methods (==) :: Cofree f a -> Cofree f a -> Bool # (/=) :: Cofree f a -> Cofree f a -> Bool #
(Eq1 f, Eq a) => Eq (Free f a)
Instance details Defined in Control.Monad.Free Methods (==) :: Free f a -> Free f a -> Bool # (/=) :: Free f a -> Free f a -> Bool #
Eq k => Eq (RootsOfUnity n k)
Instance details Defined in Data.Field.Galois.Unity Methods (==) :: RootsOfUnity n k -> RootsOfUnity n k -> Bool # (/=) :: RootsOfUnity n k -> RootsOfUnity n k -> Bool #
Eq k => Eq (Extension p k)
Instance details Defined in Data.Field.Galois.Extension Methods (==) :: Extension p k -> Extension p k -> Bool # (/=) :: Extension p k -> Extension p k -> Bool #
(Eq1 f, Eq a) => Eq (Yoneda f a)
Instance details Defined in Data.Functor.Yoneda Methods (==) :: Yoneda f a -> Yoneda f a -> Bool # (/=) :: Yoneda f a -> Yoneda f a -> Bool #
(Eq s, Eq (Token s), Eq e) => Eq (ParseErrorBundle s e)
Instance details Defined in Text.Megaparsec.Error Methods (==) :: ParseErrorBundle s e -> ParseErrorBundle s e -> Bool # (/=) :: ParseErrorBundle s e -> ParseErrorBundle s e -> Bool #
(Eq (ParseError s e), Eq s) => Eq (State s e)
Instance details Defined in Text.Megaparsec.State Methods (==) :: State s e -> State s e -> Bool # (/=) :: State s e -> State s e -> Bool #
(Eq (Token s), Eq e) => Eq (ParseError s e)
Instance details Defined in Text.Megaparsec.Error Methods (==) :: ParseError s e -> ParseError s e -> Bool # (/=) :: ParseError s e -> ParseError s e -> Bool #
Eq (v a) => Eq (Poly v a)
Instance details Defined in Data.Poly.Internal.Dense Methods (==) :: Poly v a -> Poly v a -> Bool # (/=) :: Poly v a -> Poly v a -> Bool #
Eq (MutablePrimArray s a)
Instance details Defined in Data.Primitive.PrimArray Methods (==) :: MutablePrimArray s a -> MutablePrimArray s a -> Bool # (/=) :: MutablePrimArray s a -> MutablePrimArray s a -> Bool #
Eq (SmallMutableArray s a)
Instance details Defined in Data.Primitive.SmallArray Methods (==) :: SmallMutableArray s a -> SmallMutableArray s a -> Bool # (/=) :: SmallMutableArray s a -> SmallMutableArray s a -> Bool #
Eq (MutableArray s a)
Instance details Defined in Data.Primitive.Array Methods (==) :: MutableArray s a -> MutableArray s a -> Bool # (/=) :: MutableArray s a -> MutableArray s a -> Bool #
Eq v => Eq (IntMapOf k v)
Instance details Defined in Data.Semiring Methods (==) :: IntMapOf k v -> IntMapOf k v -> Bool # (/=) :: IntMapOf k v -> IntMapOf k v -> Bool #
(Eq a, Eq b) => Eq (Pair a b)
Instance details Defined 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 details Defined 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 details Defined in Data.Strict.Either Methods (==) :: Either a b -> Either a b -> Bool # (/=) :: Either a b -> Either a b -> Bool #
(Eq a, Eq b) => Eq (These a b)
Instance details Defined in Data.These Methods (==) :: These a b -> These a b -> Bool # (/=) :: These a b -> These a b -> Bool #
(Eq k, Eq v) => Eq (Leaf k v)
Instance details Defined in Data.HashMap.Internal Methods (==) :: Leaf k v -> Leaf k v -> Bool # (/=) :: Leaf k v -> Leaf k v -> Bool #
(Eq n, Eq m) => Eq (ArithError n m)
Instance details Defined in Morley.Michelson.Typed.Arith Methods (==) :: ArithError n m -> ArithError n m -> Bool # (/=) :: ArithError n m -> ArithError n m -> Bool #
Eq (EntrypointCallT param arg)
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods (==) :: EntrypointCallT param arg -> EntrypointCallT param arg -> Bool # (/=) :: EntrypointCallT param arg -> EntrypointCallT param arg -> Bool #
Eq (EpLiftSequence arg param)
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods (==) :: EpLiftSequence arg param -> EpLiftSequence arg param -> Bool # (/=) :: EpLiftSequence arg param -> EpLiftSequence arg param -> Bool #
Eq (TransferTokens instr p)
Instance details Defined in Morley.Michelson.Typed.Value Methods (==) :: TransferTokens instr p -> TransferTokens instr p -> Bool # (/=) :: TransferTokens instr p -> TransferTokens instr p -> Bool #
Eq (Value' instr t)
Instance details Defined in Morley.Michelson.Typed.Value Methods (==) :: Value' instr t -> Value' instr t -> Bool # (/=) :: Value' instr t -> Value' instr t -> Bool #
(forall (arg :: T) (ret :: T). Eq (ViewCode' instr arg st ret)) => Eq (SomeView' instr st)
Instance details Defined in Morley.Michelson.Typed.View Methods (==) :: SomeView' instr st -> SomeView' instr st -> Bool # (/=) :: SomeView' instr st -> SomeView' instr st -> Bool #
(forall (i :: [T]) (o :: [T]). Eq (instr i o)) => Eq (ViewsSet' instr st)
Instance details Defined in Morley.Michelson.Typed.View Methods (==) :: ViewsSet' instr st -> ViewsSet' instr st -> Bool # (/=) :: ViewsSet' instr st -> ViewsSet' instr st -> Bool #
Eq a => Eq (SizedList' n a)
Instance details Defined in Morley.Util.SizedList Methods (==) :: SizedList' n a -> SizedList' n a -> Bool # (/=) :: SizedList' n a -> SizedList' n a -> Bool #
Eq (Annotation tag)
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods (==) :: Annotation tag -> Annotation tag -> Bool # (/=) :: Annotation tag -> Annotation tag -> Bool #
Eq (inp :-> out) Source #
Instance details Defined in Lorentz.Base Methods (==) :: (inp :-> out) -> (inp :-> out) -> Bool # (/=) :: (inp :-> out) -> (inp :-> out) -> Bool #
Eq (TAddress p vd) Source #
Instance details Defined in Lorentz.Address Methods (==) :: TAddress p vd -> TAddress p vd -> Bool # (/=) :: TAddress p vd -> TAddress p vd -> Bool #
Eq (NFixed p) Source #
Instance details Defined in Lorentz.Value Methods (==) :: NFixed p -> NFixed p -> Bool # (/=) :: NFixed p -> NFixed p -> Bool #
(Eq a, Eq b) => Eq (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip Methods (==) :: ZippedStackRepr a b -> ZippedStackRepr a b -> Bool # (/=) :: ZippedStackRepr a b -> ZippedStackRepr a b -> Bool #
Eq (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Methods (==) :: Hash alg a -> Hash alg a -> Bool # (/=) :: Hash alg a -> Hash alg a -> Bool #
Eq (Extensible x) Source #
Instance details Defined in Lorentz.Extensible Methods (==) :: Extensible x -> Extensible x -> Bool # (/=) :: Extensible x -> Extensible x -> Bool #
Eq a => Eq (View_ a r) Source #
Instance details Defined in Lorentz.Macro Methods (==) :: View_ a r -> View_ a r -> Bool # (/=) :: View_ a r -> View_ a r -> Bool #
(Eq a, Eq b) :=> (Eq (a, b))
Instance details Defined in Data.Constraint Methods ins :: (Eq a, Eq b) :- Eq (a, b) #
(Eq a, Eq b) :=> (Eq (Either a b))
Instance details Defined in Data.Constraint Methods ins :: (Eq a, Eq b) :- Eq (Either a b) #
Eq (f p) => Eq (Rec1 f p)	Since: base-4.7.0.0
Instance details Defined 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 details Defined 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 details Defined 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 details Defined in GHC.Generics Methods (==) :: URec Double p -> URec Double p -> Bool # (/=) :: URec Double p -> URec Double p -> Bool #
Eq (URec Float p)
Instance details Defined 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 details Defined 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 details Defined 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 details Defined in GHC.Classes Methods (==) :: (a, b, c) -> (a, b, c) -> Bool # (/=) :: (a, b, c) -> (a, b, c) -> Bool #
Eq a => Eq (Const a b)	Since: base-4.9.0.0
Instance details Defined 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 details Defined 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 details Defined in Data.Semigroup.Internal Methods (==) :: Alt f a -> Alt f a -> Bool # (/=) :: Alt f a -> Alt f a -> Bool #
Eq (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods (==) :: (a :~: b) -> (a :~: b) -> Bool # (/=) :: (a :~: b) -> (a :~: b) -> Bool #
Eq (p a a) => Eq (Join p a)
Instance details Defined in Data.Bifunctor.Join Methods (==) :: Join p a -> Join p a -> Bool # (/=) :: Join p a -> Join p a -> Bool #
Eq (p (Fix p a) a) => Eq (Fix p a)
Instance details Defined in Data.Bifunctor.Fix Methods (==) :: Fix p a -> Fix p a -> Bool # (/=) :: Fix p a -> Fix p a -> Bool #
(Eq1 f, Eq a) => Eq (IdentityT f a)
Instance details Defined in Control.Monad.Trans.Identity Methods (==) :: IdentityT f a -> IdentityT f a -> Bool # (/=) :: IdentityT f a -> IdentityT f a -> Bool #
(Eq e, Eq1 m, Eq a) => Eq (ExceptT e m a)
Instance details Defined in Control.Monad.Trans.Except Methods (==) :: ExceptT e m a -> ExceptT e m a -> Bool # (/=) :: ExceptT e m a -> ExceptT e m a -> Bool #
(Eq a, Eq (f b)) => Eq (FreeF f a b)
Instance details Defined in Control.Monad.Trans.Free Methods (==) :: FreeF f a b -> FreeF f a b -> Bool # (/=) :: FreeF f a b -> FreeF f a b -> Bool #
(Eq1 f, Eq1 m, Eq a) => Eq (FreeT f m a)
Instance details Defined in Control.Monad.Trans.Free Methods (==) :: FreeT f m a -> FreeT f m a -> Bool # (/=) :: FreeT f m a -> FreeT f m a -> Bool #
(Eq a, Eq (f b)) => Eq (CofreeF f a b)
Instance details Defined in Control.Comonad.Trans.Cofree Methods (==) :: CofreeF f a b -> CofreeF f a b -> Bool # (/=) :: CofreeF f a b -> CofreeF f a b -> Bool #
Eq (w (CofreeF f a (CofreeT f w a))) => Eq (CofreeT f w a)
Instance details Defined in Control.Comonad.Trans.Cofree Methods (==) :: CofreeT f w a -> CofreeT f w a -> Bool # (/=) :: CofreeT f w a -> CofreeT f w a -> Bool #
(Eq e, Eq1 m, Eq a) => Eq (ErrorT e m a)
Instance details Defined 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 details Defined 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 details Defined in Data.Functor.These Methods (==) :: These1 f g a -> These1 f g a -> Bool # (/=) :: These1 f g a -> These1 f g a -> Bool #
(RPureConstrained (IndexableField rs) rs, RecApplicative rs, Eq (Rec f rs)) => Eq (ARec f rs)
Instance details Defined in Data.Vinyl.ARec.Internal Methods (==) :: ARec f rs -> ARec f rs -> Bool # (/=) :: ARec f rs -> ARec f rs -> Bool #
Eq (Rec f ('[] :: [u]))
Instance details Defined in Data.Vinyl.Core Methods (==) :: Rec f '[] -> Rec f '[] -> Bool # (/=) :: Rec f '[] -> Rec f '[] -> Bool #
(Eq (f r), Eq (Rec f rs)) => Eq (Rec f (r ': rs))
Instance details Defined in Data.Vinyl.Core Methods (==) :: Rec f (r ': rs) -> Rec f (r ': rs) -> Bool # (/=) :: Rec f (r ': rs) -> Rec f (r ': rs) -> Bool #
Eq a => Eq (Const a b)
Instance details Defined in Data.Vinyl.Functor Methods (==) :: Const a b -> Const a b -> Bool # (/=) :: Const a b -> Const a b -> Bool #
(forall (i :: [T]) (o :: [T]). Eq (instr i o)) => Eq (Contract' instr cp st)
Instance details Defined in Morley.Michelson.Typed.Contract Methods (==) :: Contract' instr cp st -> Contract' instr cp st -> Bool # (/=) :: Contract' instr cp st -> Contract' instr cp st -> Bool #
Eq (CreateContract instr cp st)
Instance details Defined in Morley.Michelson.Typed.Value Methods (==) :: CreateContract instr cp st -> CreateContract instr cp st -> Bool # (/=) :: CreateContract instr cp st -> CreateContract instr cp st -> Bool #
Eq (Contract cp st vd) Source #
Instance details Defined in Lorentz.Base Methods (==) :: Contract cp st vd -> Contract cp st vd -> Bool # (/=) :: Contract cp st vd -> Contract cp st vd -> Bool #
Eq c => Eq (K1 i c p)	Since: base-4.7.0.0
Instance details Defined 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 details Defined 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 details Defined 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 details Defined 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 details Defined 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 details Defined in Data.Functor.Sum Methods (==) :: Sum f g a -> Sum f g a -> Bool # (/=) :: Sum f g a -> Sum f g a -> Bool #
Eq (a :~~: b)	Since: base-4.10.0.0
Instance details Defined in Data.Type.Equality Methods (==) :: (a :~~: b) -> (a :~~: b) -> Bool # (/=) :: (a :~~: b) -> (a :~~: b) -> Bool #
Eq (instr i o) => Eq (RemFail instr i o)
Instance details Defined in Morley.Michelson.Typed.Value Methods (==) :: RemFail instr i o -> RemFail instr i o -> Bool # (/=) :: RemFail instr i o -> RemFail instr i o -> Bool #
Eq (ViewCode' instr arg st ret) => Eq (View' instr arg st ret)
Instance details Defined in Morley.Michelson.Typed.View Methods (==) :: View' instr arg st ret -> View' instr arg st ret -> Bool # (/=) :: View' instr arg st ret -> View' instr arg st ret -> Bool #
Eq (f p) => Eq (M1 i c f p)	Since: base-4.7.0.0
Instance details Defined 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 details Defined 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 details Defined 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 details Defined in Data.Functor.Compose Methods (==) :: Compose f g a -> Compose f g a -> Bool # (/=) :: Compose f g a -> Compose f g a -> Bool #
Eq (p a b) => Eq (WrappedBifunctor p a b)
Instance details Defined in Data.Bifunctor.Wrapped Methods (==) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # (/=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool #
Eq (g b) => Eq (Joker g a b)
Instance details Defined in Data.Bifunctor.Joker Methods (==) :: Joker g a b -> Joker g a b -> Bool # (/=) :: Joker g a b -> Joker g a b -> Bool #
Eq (p b a) => Eq (Flip p a b)
Instance details Defined in Data.Bifunctor.Flip Methods (==) :: Flip p a b -> Flip p a b -> Bool # (/=) :: Flip p a b -> Flip p a b -> Bool #
Eq (f a) => Eq (Clown f a b)
Instance details Defined in Data.Bifunctor.Clown Methods (==) :: Clown f a b -> Clown f a b -> Bool # (/=) :: Clown f a b -> Clown f a b -> Bool #
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f) => Eq (a, b, c, d, e, f)
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # (/=) :: (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 details Defined 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 details Defined 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 details Defined 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 details Defined 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 details Defined 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 details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # (/=) :: (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 details Defined 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 details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # (/=) :: (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 details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # (/=) :: (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 details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # (/=) :: (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 details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # (/=) :: (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 details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # (/=) :: (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 details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # (/=) :: (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 Eq a => Ord a #

The Ord class is used for totally ordered datatypes.

Instances of Ord can be derived for any user-defined datatype whose constituent types are in Ord. The declared order of the constructors in the data declaration determines the ordering in derived Ord instances. The Ordering datatype allows a single comparison to determine the precise ordering of two objects.

The Haskell Report defines no laws for Ord. However, <= is customarily expected to implement a non-strict partial order and have the following properties:

Transitivity: if x <= y && y <= z = True, then x <= z = True
Reflexivity: x <= x = True
Antisymmetry: if x <= y && y <= x = True, then x == y = True

Note that the following operator interactions are expected to hold:

x >= y = y <= x
x < y = x <= y && x /= y
x > y = y < x
x < y = compare x y == LT
x > y = compare x y == GT
x == y = compare x y == EQ
min x y == if x <= y then x else y = True
max x y == if x >= y then x else y = True

Note that (7.) and (8.) do not require min and max to return either of their arguments. The result is merely required to equal one of the arguments in terms of (==).

Minimal complete definition: either compare or <=. Using compare can be more efficient for complex types.

Minimal complete definition

compare | (<=)

Instances

Instances details

Ord Bool
Instance details Defined in GHC.Classes Methods compare :: Bool -> Bool -> Ordering # (<) :: Bool -> Bool -> Bool # (<=) :: Bool -> Bool -> Bool # (>) :: Bool -> Bool -> Bool # (>=) :: Bool -> Bool -> Bool # max :: Bool -> Bool -> Bool # min :: Bool -> Bool -> Bool #
Ord Char
Instance details Defined in GHC.Classes Methods compare :: Char -> Char -> Ordering # (<) :: Char -> Char -> Bool # (<=) :: Char -> Char -> Bool # (>) :: Char -> Char -> Bool # (>=) :: Char -> Char -> Bool # max :: Char -> Char -> Char # min :: Char -> Char -> Char #
Ord Double	Note that due to the presence of `NaN`, `Double`'s `Ord` instance does not satisfy reflexivity. `>>>` `0/0 <= (0/0 :: Double)`False Also note that, due to the same, `Ord`'s operator interactions are not respected by `Double`'s instance: `>>>` `(0/0 :: Double) > 1`False `>>>` `compare (0/0 :: Double) 1`GT
Instance details Defined in GHC.Classes Methods compare :: Double -> Double -> Ordering # (<) :: Double -> Double -> Bool # (<=) :: Double -> Double -> Bool # (>) :: Double -> Double -> Bool # (>=) :: Double -> Double -> Bool # max :: Double -> Double -> Double # min :: Double -> Double -> Double #
Ord Float	Note that due to the presence of `NaN`, `Float`'s `Ord` instance does not satisfy reflexivity. `>>>` `0/0 <= (0/0 :: Float)`False Also note that, due to the same, `Ord`'s operator interactions are not respected by `Float`'s instance: `>>>` `(0/0 :: Float) > 1`False `>>>` `compare (0/0 :: Float) 1`GT
Instance details Defined in GHC.Classes Methods compare :: Float -> Float -> Ordering # (<) :: Float -> Float -> Bool # (<=) :: Float -> Float -> Bool # (>) :: Float -> Float -> Bool # (>=) :: Float -> Float -> Bool # max :: Float -> Float -> Float # min :: Float -> Float -> Float #
Ord Int
Instance details Defined in GHC.Classes Methods compare :: Int -> Int -> Ordering # (<) :: Int -> Int -> Bool # (<=) :: Int -> Int -> Bool # (>) :: Int -> Int -> Bool # (>=) :: Int -> Int -> Bool # max :: Int -> Int -> Int # min :: Int -> Int -> Int #
Ord Int8	Since: base-2.1
Instance details Defined in GHC.Int Methods compare :: Int8 -> Int8 -> Ordering # (<) :: Int8 -> Int8 -> Bool # (<=) :: Int8 -> Int8 -> Bool # (>) :: Int8 -> Int8 -> Bool # (>=) :: Int8 -> Int8 -> Bool # max :: Int8 -> Int8 -> Int8 # min :: Int8 -> Int8 -> Int8 #
Ord Int16	Since: base-2.1
Instance details Defined in GHC.Int Methods compare :: Int16 -> Int16 -> Ordering # (<) :: Int16 -> Int16 -> Bool # (<=) :: Int16 -> Int16 -> Bool # (>) :: Int16 -> Int16 -> Bool # (>=) :: Int16 -> Int16 -> Bool # max :: Int16 -> Int16 -> Int16 # min :: Int16 -> Int16 -> Int16 #
Ord Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods compare :: Int32 -> Int32 -> Ordering # (<) :: Int32 -> Int32 -> Bool # (<=) :: Int32 -> Int32 -> Bool # (>) :: Int32 -> Int32 -> Bool # (>=) :: Int32 -> Int32 -> Bool # max :: Int32 -> Int32 -> Int32 # min :: Int32 -> Int32 -> Int32 #
Ord Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods compare :: Int64 -> Int64 -> Ordering # (<) :: Int64 -> Int64 -> Bool # (<=) :: Int64 -> Int64 -> Bool # (>) :: Int64 -> Int64 -> Bool # (>=) :: Int64 -> Int64 -> Bool # max :: Int64 -> Int64 -> Int64 # min :: Int64 -> Int64 -> Int64 #
Ord Integer
Instance details Defined in GHC.Integer.Type Methods compare :: Integer -> Integer -> Ordering # (<) :: Integer -> Integer -> Bool # (<=) :: Integer -> Integer -> Bool # (>) :: Integer -> Integer -> Bool # (>=) :: Integer -> Integer -> Bool # max :: Integer -> Integer -> Integer # min :: Integer -> Integer -> Integer #
Ord Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Natural Methods compare :: Natural -> Natural -> Ordering # (<) :: Natural -> Natural -> Bool # (<=) :: Natural -> Natural -> Bool # (>) :: Natural -> Natural -> Bool # (>=) :: Natural -> Natural -> Bool # max :: Natural -> Natural -> Natural # min :: Natural -> Natural -> Natural #
Ord Ordering
Instance details Defined in GHC.Classes Methods compare :: Ordering -> Ordering -> Ordering # (<) :: Ordering -> Ordering -> Bool # (<=) :: Ordering -> Ordering -> Bool # (>) :: Ordering -> Ordering -> Bool # (>=) :: Ordering -> Ordering -> Bool # max :: Ordering -> Ordering -> Ordering # min :: Ordering -> Ordering -> Ordering #
Ord Word
Instance details Defined in GHC.Classes Methods compare :: Word -> Word -> Ordering # (<) :: Word -> Word -> Bool # (<=) :: Word -> Word -> Bool # (>) :: Word -> Word -> Bool # (>=) :: Word -> Word -> Bool # max :: Word -> Word -> Word # min :: Word -> Word -> Word #
Ord Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods compare :: Word8 -> Word8 -> Ordering # (<) :: Word8 -> Word8 -> Bool # (<=) :: Word8 -> Word8 -> Bool # (>) :: Word8 -> Word8 -> Bool # (>=) :: Word8 -> Word8 -> Bool # max :: Word8 -> Word8 -> Word8 # min :: Word8 -> Word8 -> Word8 #
Ord Word16	Since: base-2.1
Instance details Defined in GHC.Word Methods compare :: Word16 -> Word16 -> Ordering # (<) :: Word16 -> Word16 -> Bool # (<=) :: Word16 -> Word16 -> Bool # (>) :: Word16 -> Word16 -> Bool # (>=) :: Word16 -> Word16 -> Bool # max :: Word16 -> Word16 -> Word16 # min :: Word16 -> Word16 -> Word16 #
Ord Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods compare :: Word32 -> Word32 -> Ordering # (<) :: Word32 -> Word32 -> Bool # (<=) :: Word32 -> Word32 -> Bool # (>) :: Word32 -> Word32 -> Bool # (>=) :: Word32 -> Word32 -> Bool # max :: Word32 -> Word32 -> Word32 # min :: Word32 -> Word32 -> Word32 #
Ord Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods compare :: Word64 -> Word64 -> Ordering # (<) :: Word64 -> Word64 -> Bool # (<=) :: Word64 -> Word64 -> Bool # (>) :: Word64 -> Word64 -> Bool # (>=) :: Word64 -> Word64 -> Bool # max :: Word64 -> Word64 -> Word64 # min :: Word64 -> Word64 -> Word64 #
Ord SomeTypeRep
Instance details Defined in Data.Typeable.Internal Methods compare :: SomeTypeRep -> SomeTypeRep -> Ordering # (<) :: SomeTypeRep -> SomeTypeRep -> Bool # (<=) :: SomeTypeRep -> SomeTypeRep -> Bool # (>) :: SomeTypeRep -> SomeTypeRep -> Bool # (>=) :: SomeTypeRep -> SomeTypeRep -> Bool # max :: SomeTypeRep -> SomeTypeRep -> SomeTypeRep # min :: SomeTypeRep -> SomeTypeRep -> SomeTypeRep #
Ord Exp
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Exp -> Exp -> Ordering # (<) :: Exp -> Exp -> Bool # (<=) :: Exp -> Exp -> Bool # (>) :: Exp -> Exp -> Bool # (>=) :: Exp -> Exp -> Bool # max :: Exp -> Exp -> Exp # min :: Exp -> Exp -> Exp #
Ord Match
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Match -> Match -> Ordering # (<) :: Match -> Match -> Bool # (<=) :: Match -> Match -> Bool # (>) :: Match -> Match -> Bool # (>=) :: Match -> Match -> Bool # max :: Match -> Match -> Match # min :: Match -> Match -> Match #
Ord Clause
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Clause -> Clause -> Ordering # (<) :: Clause -> Clause -> Bool # (<=) :: Clause -> Clause -> Bool # (>) :: Clause -> Clause -> Bool # (>=) :: Clause -> Clause -> Bool # max :: Clause -> Clause -> Clause # min :: Clause -> Clause -> Clause #
Ord Pat
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Pat -> Pat -> Ordering # (<) :: Pat -> Pat -> Bool # (<=) :: Pat -> Pat -> Bool # (>) :: Pat -> Pat -> Bool # (>=) :: Pat -> Pat -> Bool # max :: Pat -> Pat -> Pat # min :: Pat -> Pat -> Pat #
Ord Type
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Type -> Type -> Ordering # (<) :: Type -> Type -> Bool # (<=) :: Type -> Type -> Bool # (>) :: Type -> Type -> Bool # (>=) :: Type -> Type -> Bool # max :: Type -> Type -> Type # min :: Type -> Type -> Type #
Ord Dec
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Dec -> Dec -> Ordering # (<) :: Dec -> Dec -> Bool # (<=) :: Dec -> Dec -> Bool # (>) :: Dec -> Dec -> Bool # (>=) :: Dec -> Dec -> Bool # max :: Dec -> Dec -> Dec # min :: Dec -> Dec -> Dec #
Ord Name
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Name -> Name -> Ordering # (<) :: Name -> Name -> Bool # (<=) :: Name -> Name -> Bool # (>) :: Name -> Name -> Bool # (>=) :: Name -> Name -> Bool # max :: Name -> Name -> Name # min :: Name -> Name -> Name #
Ord FunDep
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: FunDep -> FunDep -> Ordering # (<) :: FunDep -> FunDep -> Bool # (<=) :: FunDep -> FunDep -> Bool # (>) :: FunDep -> FunDep -> Bool # (>=) :: FunDep -> FunDep -> Bool # max :: FunDep -> FunDep -> FunDep # min :: FunDep -> FunDep -> FunDep #
Ord InjectivityAnn
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: InjectivityAnn -> InjectivityAnn -> Ordering # (<) :: InjectivityAnn -> InjectivityAnn -> Bool # (<=) :: InjectivityAnn -> InjectivityAnn -> Bool # (>) :: InjectivityAnn -> InjectivityAnn -> Bool # (>=) :: InjectivityAnn -> InjectivityAnn -> Bool # max :: InjectivityAnn -> InjectivityAnn -> InjectivityAnn # min :: InjectivityAnn -> InjectivityAnn -> InjectivityAnn #
Ord Overlap
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Overlap -> Overlap -> Ordering # (<) :: Overlap -> Overlap -> Bool # (<=) :: Overlap -> Overlap -> Bool # (>) :: Overlap -> Overlap -> Bool # (>=) :: Overlap -> Overlap -> Bool # max :: Overlap -> Overlap -> Overlap # min :: Overlap -> Overlap -> Overlap #
Ord ()
Instance details Defined in GHC.Classes Methods compare :: () -> () -> Ordering # (<) :: () -> () -> Bool # (<=) :: () -> () -> Bool # (>) :: () -> () -> Bool # (>=) :: () -> () -> Bool # max :: () -> () -> () # min :: () -> () -> () #
Ord TyCon
Instance details Defined in GHC.Classes Methods compare :: TyCon -> TyCon -> Ordering # (<) :: TyCon -> TyCon -> Bool # (<=) :: TyCon -> TyCon -> Bool # (>) :: TyCon -> TyCon -> Bool # (>=) :: TyCon -> TyCon -> Bool # max :: TyCon -> TyCon -> TyCon # min :: TyCon -> TyCon -> TyCon #
Ord Version	Since: base-2.1
Instance details Defined in Data.Version Methods compare :: Version -> Version -> Ordering # (<) :: Version -> Version -> Bool # (<=) :: Version -> Version -> Bool # (>) :: Version -> Version -> Bool # (>=) :: Version -> Version -> Bool # max :: Version -> Version -> Version # min :: Version -> Version -> Version #
Ord ByteString
Instance details Defined in Data.ByteString.Internal Methods compare :: ByteString -> ByteString -> Ordering # (<) :: ByteString -> ByteString -> Bool # (<=) :: ByteString -> ByteString -> Bool # (>) :: ByteString -> ByteString -> Bool # (>=) :: ByteString -> ByteString -> Bool # max :: ByteString -> ByteString -> ByteString # min :: ByteString -> ByteString -> ByteString #
Ord ShortByteString
Instance details Defined in Data.ByteString.Short.Internal Methods compare :: ShortByteString -> ShortByteString -> Ordering # (<) :: ShortByteString -> ShortByteString -> Bool # (<=) :: ShortByteString -> ShortByteString -> Bool # (>) :: ShortByteString -> ShortByteString -> Bool # (>=) :: ShortByteString -> ShortByteString -> Bool # max :: ShortByteString -> ShortByteString -> ShortByteString # min :: ShortByteString -> ShortByteString -> ShortByteString #
Ord ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods compare :: ByteString -> ByteString -> Ordering # (<) :: ByteString -> ByteString -> Bool # (<=) :: ByteString -> ByteString -> Bool # (>) :: ByteString -> ByteString -> Bool # (>=) :: ByteString -> ByteString -> Bool # max :: ByteString -> ByteString -> ByteString # min :: ByteString -> ByteString -> ByteString #
Ord ThreadId	Since: base-4.2.0.0
Instance details Defined in GHC.Conc.Sync Methods compare :: ThreadId -> ThreadId -> Ordering # (<) :: ThreadId -> ThreadId -> Bool # (<=) :: ThreadId -> ThreadId -> Bool # (>) :: ThreadId -> ThreadId -> Bool # (>=) :: ThreadId -> ThreadId -> Bool # max :: ThreadId -> ThreadId -> ThreadId # min :: ThreadId -> ThreadId -> ThreadId #
Ord Extension
Instance details Defined in Language.Haskell.Extension Methods compare :: Extension -> Extension -> Ordering # (<) :: Extension -> Extension -> Bool # (<=) :: Extension -> Extension -> Bool # (>) :: Extension -> Extension -> Bool # (>=) :: Extension -> Extension -> Bool # max :: Extension -> Extension -> Extension # min :: Extension -> Extension -> Extension #
Ord KnownExtension
Instance details Defined in Language.Haskell.Extension Methods compare :: KnownExtension -> KnownExtension -> Ordering # (<) :: KnownExtension -> KnownExtension -> Bool # (<=) :: KnownExtension -> KnownExtension -> Bool # (>) :: KnownExtension -> KnownExtension -> Bool # (>=) :: KnownExtension -> KnownExtension -> Bool # max :: KnownExtension -> KnownExtension -> KnownExtension # min :: KnownExtension -> KnownExtension -> KnownExtension #
Ord CabalSpecVersion
Instance details Defined in Distribution.CabalSpecVersion Methods compare :: CabalSpecVersion -> CabalSpecVersion -> Ordering # (<) :: CabalSpecVersion -> CabalSpecVersion -> Bool # (<=) :: CabalSpecVersion -> CabalSpecVersion -> Bool # (>) :: CabalSpecVersion -> CabalSpecVersion -> Bool # (>=) :: CabalSpecVersion -> CabalSpecVersion -> Bool # max :: CabalSpecVersion -> CabalSpecVersion -> CabalSpecVersion # min :: CabalSpecVersion -> CabalSpecVersion -> CabalSpecVersion #
Ord PWarnType
Instance details Defined in Distribution.Parsec.Warning Methods compare :: PWarnType -> PWarnType -> Ordering # (<) :: PWarnType -> PWarnType -> Bool # (<=) :: PWarnType -> PWarnType -> Bool # (>) :: PWarnType -> PWarnType -> Bool # (>=) :: PWarnType -> PWarnType -> Bool # max :: PWarnType -> PWarnType -> PWarnType # min :: PWarnType -> PWarnType -> PWarnType #
Ord Position
Instance details Defined in Distribution.Parsec.Position Methods compare :: Position -> Position -> Ordering # (<) :: Position -> Position -> Bool # (<=) :: Position -> Position -> Bool # (>) :: Position -> Position -> Bool # (>=) :: Position -> Position -> Bool # max :: Position -> Position -> Position # min :: Position -> Position -> Position #
Ord Structure
Instance details Defined in Distribution.Utils.Structured Methods compare :: Structure -> Structure -> Ordering # (<) :: Structure -> Structure -> Bool # (<=) :: Structure -> Structure -> Bool # (>) :: Structure -> Structure -> Bool # (>=) :: Structure -> Structure -> Bool # max :: Structure -> Structure -> Structure # min :: Structure -> Structure -> Structure #
Ord Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: Any -> Any -> Ordering # (<) :: Any -> Any -> Bool # (<=) :: Any -> Any -> Bool # (>) :: Any -> Any -> Bool # (>=) :: Any -> Any -> Bool # max :: Any -> Any -> Any # min :: Any -> Any -> Any #
Ord All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: All -> All -> Ordering # (<) :: All -> All -> Bool # (<=) :: All -> All -> Bool # (>) :: All -> All -> Bool # (>=) :: All -> All -> Bool # max :: All -> All -> All # min :: All -> All -> All #
Ord Builder
Instance details Defined in Data.Text.Internal.Builder Methods compare :: Builder -> Builder -> Ordering # (<) :: Builder -> Builder -> Bool # (<=) :: Builder -> Builder -> Bool # (>) :: Builder -> Builder -> Bool # (>=) :: Builder -> Builder -> Bool # max :: Builder -> Builder -> Builder # min :: Builder -> Builder -> Builder #
Ord Scientific	Scientific numbers can be safely compared for ordering. 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 details Defined in Data.Scientific Methods compare :: Scientific -> Scientific -> Ordering # (<) :: Scientific -> Scientific -> Bool # (<=) :: Scientific -> Scientific -> Bool # (>) :: Scientific -> Scientific -> Bool # (>=) :: Scientific -> Scientific -> Bool # max :: Scientific -> Scientific -> Scientific # min :: Scientific -> Scientific -> Scientific #
Ord UTCTime
Instance details Defined in Data.Time.Clock.Internal.UTCTime Methods compare :: UTCTime -> UTCTime -> Ordering # (<) :: UTCTime -> UTCTime -> Bool # (<=) :: UTCTime -> UTCTime -> Bool # (>) :: UTCTime -> UTCTime -> Bool # (>=) :: UTCTime -> UTCTime -> Bool # max :: UTCTime -> UTCTime -> UTCTime # min :: UTCTime -> UTCTime -> UTCTime #
Ord JSONPathElement
Instance details Defined in Data.Aeson.Types.Internal Methods compare :: JSONPathElement -> JSONPathElement -> Ordering # (<) :: JSONPathElement -> JSONPathElement -> Bool # (<=) :: JSONPathElement -> JSONPathElement -> Bool # (>) :: JSONPathElement -> JSONPathElement -> Bool # (>=) :: JSONPathElement -> JSONPathElement -> Bool # max :: JSONPathElement -> JSONPathElement -> JSONPathElement # min :: JSONPathElement -> JSONPathElement -> JSONPathElement #
Ord Value	The ordering is total, consistent with `Eq` instance. However, nothing else about the ordering is specified, and it may change from environment to environment and version to version of either this package or its dependencies (`hashable` and 'unordered-containers'). Since: aeson-1.5.2.0
Instance details Defined in Data.Aeson.Types.Internal Methods compare :: Value -> Value -> Ordering # (<) :: Value -> Value -> Bool # (<=) :: Value -> Value -> Bool # (>) :: Value -> Value -> Bool # (>=) :: Value -> Value -> Bool # max :: Value -> Value -> Value # min :: Value -> Value -> Value #
Ord DotNetTime
Instance details Defined in Data.Aeson.Types.Internal Methods compare :: DotNetTime -> DotNetTime -> Ordering # (<) :: DotNetTime -> DotNetTime -> Bool # (<=) :: DotNetTime -> DotNetTime -> Bool # (>) :: DotNetTime -> DotNetTime -> Bool # (>=) :: DotNetTime -> DotNetTime -> Bool # max :: DotNetTime -> DotNetTime -> DotNetTime # min :: DotNetTime -> DotNetTime -> DotNetTime #
Ord Pos
Instance details Defined in Data.Attoparsec.Internal.Types Methods compare :: Pos -> Pos -> Ordering # (<) :: Pos -> Pos -> Bool # (<=) :: Pos -> Pos -> Bool # (>) :: Pos -> Pos -> Bool # (>=) :: Pos -> Pos -> Bool # max :: Pos -> Pos -> Pos # min :: Pos -> Pos -> Pos #
Ord Void	Since: base-4.8.0.0
Instance details Defined in Data.Void Methods compare :: Void -> Void -> Ordering # (<) :: Void -> Void -> Bool # (<=) :: Void -> Void -> Bool # (>) :: Void -> Void -> Bool # (>=) :: Void -> Void -> Bool # max :: Void -> Void -> Void # min :: Void -> Void -> Void #
Ord BlockReason	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods compare :: BlockReason -> BlockReason -> Ordering # (<) :: BlockReason -> BlockReason -> Bool # (<=) :: BlockReason -> BlockReason -> Bool # (>) :: BlockReason -> BlockReason -> Bool # (>=) :: BlockReason -> BlockReason -> Bool # max :: BlockReason -> BlockReason -> BlockReason # min :: BlockReason -> BlockReason -> BlockReason #
Ord ThreadStatus	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods compare :: ThreadStatus -> ThreadStatus -> Ordering # (<) :: ThreadStatus -> ThreadStatus -> Bool # (<=) :: ThreadStatus -> ThreadStatus -> Bool # (>) :: ThreadStatus -> ThreadStatus -> Bool # (>=) :: ThreadStatus -> ThreadStatus -> Bool # max :: ThreadStatus -> ThreadStatus -> ThreadStatus # min :: ThreadStatus -> ThreadStatus -> ThreadStatus #
Ord AsyncException	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Exception Methods compare :: AsyncException -> AsyncException -> Ordering # (<) :: AsyncException -> AsyncException -> Bool # (<=) :: AsyncException -> AsyncException -> Bool # (>) :: AsyncException -> AsyncException -> Bool # (>=) :: AsyncException -> AsyncException -> Bool # max :: AsyncException -> AsyncException -> AsyncException # min :: AsyncException -> AsyncException -> AsyncException #
Ord ArrayException	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Exception Methods compare :: ArrayException -> ArrayException -> Ordering # (<) :: ArrayException -> ArrayException -> Bool # (<=) :: ArrayException -> ArrayException -> Bool # (>) :: ArrayException -> ArrayException -> Bool # (>=) :: ArrayException -> ArrayException -> Bool # max :: ArrayException -> ArrayException -> ArrayException # min :: ArrayException -> ArrayException -> ArrayException #
Ord ExitCode
Instance details Defined in GHC.IO.Exception Methods compare :: ExitCode -> ExitCode -> Ordering # (<) :: ExitCode -> ExitCode -> Bool # (<=) :: ExitCode -> ExitCode -> Bool # (>) :: ExitCode -> ExitCode -> Bool # (>=) :: ExitCode -> ExitCode -> Bool # max :: ExitCode -> ExitCode -> ExitCode # min :: ExitCode -> ExitCode -> ExitCode #
Ord BufferMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Handle.Types Methods compare :: BufferMode -> BufferMode -> Ordering # (<) :: BufferMode -> BufferMode -> Bool # (<=) :: BufferMode -> BufferMode -> Bool # (>) :: BufferMode -> BufferMode -> Bool # (>=) :: BufferMode -> BufferMode -> Bool # max :: BufferMode -> BufferMode -> BufferMode # min :: BufferMode -> BufferMode -> BufferMode #
Ord Newline	Since: base-4.3.0.0
Instance details Defined in GHC.IO.Handle.Types Methods compare :: Newline -> Newline -> Ordering # (<) :: Newline -> Newline -> Bool # (<=) :: Newline -> Newline -> Bool # (>) :: Newline -> Newline -> Bool # (>=) :: Newline -> Newline -> Bool # max :: Newline -> Newline -> Newline # min :: Newline -> Newline -> Newline #
Ord NewlineMode	Since: base-4.3.0.0
Instance details Defined in GHC.IO.Handle.Types Methods compare :: NewlineMode -> NewlineMode -> Ordering # (<) :: NewlineMode -> NewlineMode -> Bool # (<=) :: NewlineMode -> NewlineMode -> Bool # (>) :: NewlineMode -> NewlineMode -> Bool # (>=) :: NewlineMode -> NewlineMode -> Bool # max :: NewlineMode -> NewlineMode -> NewlineMode # min :: NewlineMode -> NewlineMode -> NewlineMode #
Ord ErrorCall	Since: base-4.7.0.0
Instance details Defined in GHC.Exception Methods compare :: ErrorCall -> ErrorCall -> Ordering # (<) :: ErrorCall -> ErrorCall -> Bool # (<=) :: ErrorCall -> ErrorCall -> Bool # (>) :: ErrorCall -> ErrorCall -> Bool # (>=) :: ErrorCall -> ErrorCall -> Bool # max :: ErrorCall -> ErrorCall -> ErrorCall # min :: ErrorCall -> ErrorCall -> ErrorCall #
Ord ArithException	Since: base-3.0
Instance details Defined in GHC.Exception.Type Methods compare :: ArithException -> ArithException -> Ordering # (<) :: ArithException -> ArithException -> Bool # (<=) :: ArithException -> ArithException -> Bool # (>) :: ArithException -> ArithException -> Bool # (>=) :: ArithException -> ArithException -> Bool # max :: ArithException -> ArithException -> ArithException # min :: ArithException -> ArithException -> ArithException #
Ord Fixity	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Methods compare :: Fixity -> Fixity -> Ordering # (<) :: Fixity -> Fixity -> Bool # (<=) :: Fixity -> Fixity -> Bool # (>) :: Fixity -> Fixity -> Bool # (>=) :: Fixity -> Fixity -> Bool # max :: Fixity -> Fixity -> Fixity # min :: Fixity -> Fixity -> Fixity #
Ord Associativity	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Methods compare :: Associativity -> Associativity -> Ordering # (<) :: Associativity -> Associativity -> Bool # (<=) :: Associativity -> Associativity -> Bool # (>) :: Associativity -> Associativity -> Bool # (>=) :: Associativity -> Associativity -> Bool # max :: Associativity -> Associativity -> Associativity # min :: Associativity -> Associativity -> Associativity #
Ord SourceUnpackedness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: SourceUnpackedness -> SourceUnpackedness -> Ordering # (<) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (<=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # max :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness # min :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness #
Ord SourceStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: SourceStrictness -> SourceStrictness -> Ordering # (<) :: SourceStrictness -> SourceStrictness -> Bool # (<=) :: SourceStrictness -> SourceStrictness -> Bool # (>) :: SourceStrictness -> SourceStrictness -> Bool # (>=) :: SourceStrictness -> SourceStrictness -> Bool # max :: SourceStrictness -> SourceStrictness -> SourceStrictness # min :: SourceStrictness -> SourceStrictness -> SourceStrictness #
Ord DecidedStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: DecidedStrictness -> DecidedStrictness -> Ordering # (<) :: DecidedStrictness -> DecidedStrictness -> Bool # (<=) :: DecidedStrictness -> DecidedStrictness -> Bool # (>) :: DecidedStrictness -> DecidedStrictness -> Bool # (>=) :: DecidedStrictness -> DecidedStrictness -> Bool # max :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness # min :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness #
Ord SomeSymbol	Since: base-4.7.0.0
Instance details Defined in GHC.TypeLits Methods compare :: SomeSymbol -> SomeSymbol -> Ordering # (<) :: SomeSymbol -> SomeSymbol -> Bool # (<=) :: SomeSymbol -> SomeSymbol -> Bool # (>) :: SomeSymbol -> SomeSymbol -> Bool # (>=) :: SomeSymbol -> SomeSymbol -> Bool # max :: SomeSymbol -> SomeSymbol -> SomeSymbol # min :: SomeSymbol -> SomeSymbol -> SomeSymbol #
Ord SomeNat	Since: base-4.7.0.0
Instance details Defined in GHC.TypeNats Methods compare :: SomeNat -> SomeNat -> Ordering # (<) :: SomeNat -> SomeNat -> Bool # (<=) :: SomeNat -> SomeNat -> Bool # (>) :: SomeNat -> SomeNat -> Bool # (>=) :: SomeNat -> SomeNat -> Bool # max :: SomeNat -> SomeNat -> SomeNat # min :: SomeNat -> SomeNat -> SomeNat #
Ord CChar
Instance details Defined in Foreign.C.Types Methods compare :: CChar -> CChar -> Ordering # (<) :: CChar -> CChar -> Bool # (<=) :: CChar -> CChar -> Bool # (>) :: CChar -> CChar -> Bool # (>=) :: CChar -> CChar -> Bool # max :: CChar -> CChar -> CChar # min :: CChar -> CChar -> CChar #
Ord CSChar
Instance details Defined in Foreign.C.Types Methods compare :: CSChar -> CSChar -> Ordering # (<) :: CSChar -> CSChar -> Bool # (<=) :: CSChar -> CSChar -> Bool # (>) :: CSChar -> CSChar -> Bool # (>=) :: CSChar -> CSChar -> Bool # max :: CSChar -> CSChar -> CSChar # min :: CSChar -> CSChar -> CSChar #
Ord CUChar
Instance details Defined in Foreign.C.Types Methods compare :: CUChar -> CUChar -> Ordering # (<) :: CUChar -> CUChar -> Bool # (<=) :: CUChar -> CUChar -> Bool # (>) :: CUChar -> CUChar -> Bool # (>=) :: CUChar -> CUChar -> Bool # max :: CUChar -> CUChar -> CUChar # min :: CUChar -> CUChar -> CUChar #
Ord CShort
Instance details Defined in Foreign.C.Types Methods compare :: CShort -> CShort -> Ordering # (<) :: CShort -> CShort -> Bool # (<=) :: CShort -> CShort -> Bool # (>) :: CShort -> CShort -> Bool # (>=) :: CShort -> CShort -> Bool # max :: CShort -> CShort -> CShort # min :: CShort -> CShort -> CShort #
Ord CUShort
Instance details Defined in Foreign.C.Types Methods compare :: CUShort -> CUShort -> Ordering # (<) :: CUShort -> CUShort -> Bool # (<=) :: CUShort -> CUShort -> Bool # (>) :: CUShort -> CUShort -> Bool # (>=) :: CUShort -> CUShort -> Bool # max :: CUShort -> CUShort -> CUShort # min :: CUShort -> CUShort -> CUShort #
Ord CInt
Instance details Defined in Foreign.C.Types Methods compare :: CInt -> CInt -> Ordering # (<) :: CInt -> CInt -> Bool # (<=) :: CInt -> CInt -> Bool # (>) :: CInt -> CInt -> Bool # (>=) :: CInt -> CInt -> Bool # max :: CInt -> CInt -> CInt # min :: CInt -> CInt -> CInt #
Ord CUInt
Instance details Defined in Foreign.C.Types Methods compare :: CUInt -> CUInt -> Ordering # (<) :: CUInt -> CUInt -> Bool # (<=) :: CUInt -> CUInt -> Bool # (>) :: CUInt -> CUInt -> Bool # (>=) :: CUInt -> CUInt -> Bool # max :: CUInt -> CUInt -> CUInt # min :: CUInt -> CUInt -> CUInt #
Ord CLong
Instance details Defined in Foreign.C.Types Methods compare :: CLong -> CLong -> Ordering # (<) :: CLong -> CLong -> Bool # (<=) :: CLong -> CLong -> Bool # (>) :: CLong -> CLong -> Bool # (>=) :: CLong -> CLong -> Bool # max :: CLong -> CLong -> CLong # min :: CLong -> CLong -> CLong #
Ord CULong
Instance details Defined in Foreign.C.Types Methods compare :: CULong -> CULong -> Ordering # (<) :: CULong -> CULong -> Bool # (<=) :: CULong -> CULong -> Bool # (>) :: CULong -> CULong -> Bool # (>=) :: CULong -> CULong -> Bool # max :: CULong -> CULong -> CULong # min :: CULong -> CULong -> CULong #
Ord CLLong
Instance details Defined in Foreign.C.Types Methods compare :: CLLong -> CLLong -> Ordering # (<) :: CLLong -> CLLong -> Bool # (<=) :: CLLong -> CLLong -> Bool # (>) :: CLLong -> CLLong -> Bool # (>=) :: CLLong -> CLLong -> Bool # max :: CLLong -> CLLong -> CLLong # min :: CLLong -> CLLong -> CLLong #
Ord CULLong
Instance details Defined in Foreign.C.Types Methods compare :: CULLong -> CULLong -> Ordering # (<) :: CULLong -> CULLong -> Bool # (<=) :: CULLong -> CULLong -> Bool # (>) :: CULLong -> CULLong -> Bool # (>=) :: CULLong -> CULLong -> Bool # max :: CULLong -> CULLong -> CULLong # min :: CULLong -> CULLong -> CULLong #
Ord CBool
Instance details Defined in Foreign.C.Types Methods compare :: CBool -> CBool -> Ordering # (<) :: CBool -> CBool -> Bool # (<=) :: CBool -> CBool -> Bool # (>) :: CBool -> CBool -> Bool # (>=) :: CBool -> CBool -> Bool # max :: CBool -> CBool -> CBool # min :: CBool -> CBool -> CBool #
Ord CFloat
Instance details Defined in Foreign.C.Types Methods compare :: CFloat -> CFloat -> Ordering # (<) :: CFloat -> CFloat -> Bool # (<=) :: CFloat -> CFloat -> Bool # (>) :: CFloat -> CFloat -> Bool # (>=) :: CFloat -> CFloat -> Bool # max :: CFloat -> CFloat -> CFloat # min :: CFloat -> CFloat -> CFloat #
Ord CDouble
Instance details Defined in Foreign.C.Types Methods compare :: CDouble -> CDouble -> Ordering # (<) :: CDouble -> CDouble -> Bool # (<=) :: CDouble -> CDouble -> Bool # (>) :: CDouble -> CDouble -> Bool # (>=) :: CDouble -> CDouble -> Bool # max :: CDouble -> CDouble -> CDouble # min :: CDouble -> CDouble -> CDouble #
Ord CPtrdiff
Instance details Defined in Foreign.C.Types Methods compare :: CPtrdiff -> CPtrdiff -> Ordering # (<) :: CPtrdiff -> CPtrdiff -> Bool # (<=) :: CPtrdiff -> CPtrdiff -> Bool # (>) :: CPtrdiff -> CPtrdiff -> Bool # (>=) :: CPtrdiff -> CPtrdiff -> Bool # max :: CPtrdiff -> CPtrdiff -> CPtrdiff # min :: CPtrdiff -> CPtrdiff -> CPtrdiff #
Ord CSize
Instance details Defined in Foreign.C.Types Methods compare :: CSize -> CSize -> Ordering # (<) :: CSize -> CSize -> Bool # (<=) :: CSize -> CSize -> Bool # (>) :: CSize -> CSize -> Bool # (>=) :: CSize -> CSize -> Bool # max :: CSize -> CSize -> CSize # min :: CSize -> CSize -> CSize #
Ord CWchar
Instance details Defined in Foreign.C.Types Methods compare :: CWchar -> CWchar -> Ordering # (<) :: CWchar -> CWchar -> Bool # (<=) :: CWchar -> CWchar -> Bool # (>) :: CWchar -> CWchar -> Bool # (>=) :: CWchar -> CWchar -> Bool # max :: CWchar -> CWchar -> CWchar # min :: CWchar -> CWchar -> CWchar #
Ord CSigAtomic
Instance details Defined in Foreign.C.Types Methods compare :: CSigAtomic -> CSigAtomic -> Ordering # (<) :: CSigAtomic -> CSigAtomic -> Bool # (<=) :: CSigAtomic -> CSigAtomic -> Bool # (>) :: CSigAtomic -> CSigAtomic -> Bool # (>=) :: CSigAtomic -> CSigAtomic -> Bool # max :: CSigAtomic -> CSigAtomic -> CSigAtomic # min :: CSigAtomic -> CSigAtomic -> CSigAtomic #
Ord CClock
Instance details Defined in Foreign.C.Types Methods compare :: CClock -> CClock -> Ordering # (<) :: CClock -> CClock -> Bool # (<=) :: CClock -> CClock -> Bool # (>) :: CClock -> CClock -> Bool # (>=) :: CClock -> CClock -> Bool # max :: CClock -> CClock -> CClock # min :: CClock -> CClock -> CClock #
Ord CTime
Instance details Defined in Foreign.C.Types Methods compare :: CTime -> CTime -> Ordering # (<) :: CTime -> CTime -> Bool # (<=) :: CTime -> CTime -> Bool # (>) :: CTime -> CTime -> Bool # (>=) :: CTime -> CTime -> Bool # max :: CTime -> CTime -> CTime # min :: CTime -> CTime -> CTime #
Ord CUSeconds
Instance details Defined in Foreign.C.Types Methods compare :: CUSeconds -> CUSeconds -> Ordering # (<) :: CUSeconds -> CUSeconds -> Bool # (<=) :: CUSeconds -> CUSeconds -> Bool # (>) :: CUSeconds -> CUSeconds -> Bool # (>=) :: CUSeconds -> CUSeconds -> Bool # max :: CUSeconds -> CUSeconds -> CUSeconds # min :: CUSeconds -> CUSeconds -> CUSeconds #
Ord CSUSeconds
Instance details Defined in Foreign.C.Types Methods compare :: CSUSeconds -> CSUSeconds -> Ordering # (<) :: CSUSeconds -> CSUSeconds -> Bool # (<=) :: CSUSeconds -> CSUSeconds -> Bool # (>) :: CSUSeconds -> CSUSeconds -> Bool # (>=) :: CSUSeconds -> CSUSeconds -> Bool # max :: CSUSeconds -> CSUSeconds -> CSUSeconds # min :: CSUSeconds -> CSUSeconds -> CSUSeconds #
Ord CIntPtr
Instance details Defined in Foreign.C.Types Methods compare :: CIntPtr -> CIntPtr -> Ordering # (<) :: CIntPtr -> CIntPtr -> Bool # (<=) :: CIntPtr -> CIntPtr -> Bool # (>) :: CIntPtr -> CIntPtr -> Bool # (>=) :: CIntPtr -> CIntPtr -> Bool # max :: CIntPtr -> CIntPtr -> CIntPtr # min :: CIntPtr -> CIntPtr -> CIntPtr #
Ord CUIntPtr
Instance details Defined in Foreign.C.Types Methods compare :: CUIntPtr -> CUIntPtr -> Ordering # (<) :: CUIntPtr -> CUIntPtr -> Bool # (<=) :: CUIntPtr -> CUIntPtr -> Bool # (>) :: CUIntPtr -> CUIntPtr -> Bool # (>=) :: CUIntPtr -> CUIntPtr -> Bool # max :: CUIntPtr -> CUIntPtr -> CUIntPtr # min :: CUIntPtr -> CUIntPtr -> CUIntPtr #
Ord CIntMax
Instance details Defined in Foreign.C.Types Methods compare :: CIntMax -> CIntMax -> Ordering # (<) :: CIntMax -> CIntMax -> Bool # (<=) :: CIntMax -> CIntMax -> Bool # (>) :: CIntMax -> CIntMax -> Bool # (>=) :: CIntMax -> CIntMax -> Bool # max :: CIntMax -> CIntMax -> CIntMax # min :: CIntMax -> CIntMax -> CIntMax #
Ord CUIntMax
Instance details Defined in Foreign.C.Types Methods compare :: CUIntMax -> CUIntMax -> Ordering # (<) :: CUIntMax -> CUIntMax -> Bool # (<=) :: CUIntMax -> CUIntMax -> Bool # (>) :: CUIntMax -> CUIntMax -> Bool # (>=) :: CUIntMax -> CUIntMax -> Bool # max :: CUIntMax -> CUIntMax -> CUIntMax # min :: CUIntMax -> CUIntMax -> CUIntMax #
Ord WordPtr
Instance details Defined in Foreign.Ptr Methods compare :: WordPtr -> WordPtr -> Ordering # (<) :: WordPtr -> WordPtr -> Bool # (<=) :: WordPtr -> WordPtr -> Bool # (>) :: WordPtr -> WordPtr -> Bool # (>=) :: WordPtr -> WordPtr -> Bool # max :: WordPtr -> WordPtr -> WordPtr # min :: WordPtr -> WordPtr -> WordPtr #
Ord IntPtr
Instance details Defined in Foreign.Ptr Methods compare :: IntPtr -> IntPtr -> Ordering # (<) :: IntPtr -> IntPtr -> Bool # (<=) :: IntPtr -> IntPtr -> Bool # (>) :: IntPtr -> IntPtr -> Bool # (>=) :: IntPtr -> IntPtr -> Bool # max :: IntPtr -> IntPtr -> IntPtr # min :: IntPtr -> IntPtr -> IntPtr #
Ord IOMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.IOMode Methods compare :: IOMode -> IOMode -> Ordering # (<) :: IOMode -> IOMode -> Bool # (<=) :: IOMode -> IOMode -> Bool # (>) :: IOMode -> IOMode -> Bool # (>=) :: IOMode -> IOMode -> Bool # max :: IOMode -> IOMode -> IOMode # min :: IOMode -> IOMode -> IOMode #
Ord GeneralCategory	Since: base-2.1
Instance details Defined in GHC.Unicode Methods compare :: GeneralCategory -> GeneralCategory -> Ordering # (<) :: GeneralCategory -> GeneralCategory -> Bool # (<=) :: GeneralCategory -> GeneralCategory -> Bool # (>) :: GeneralCategory -> GeneralCategory -> Bool # (>=) :: GeneralCategory -> GeneralCategory -> Bool # max :: GeneralCategory -> GeneralCategory -> GeneralCategory # min :: GeneralCategory -> GeneralCategory -> GeneralCategory #
Ord Alphabet
Instance details Defined in Data.ByteString.Base58.Internal Methods compare :: Alphabet -> Alphabet -> Ordering # (<) :: Alphabet -> Alphabet -> Bool # (<=) :: Alphabet -> Alphabet -> Bool # (>) :: Alphabet -> Alphabet -> Bool # (>=) :: Alphabet -> Alphabet -> Bool # max :: Alphabet -> Alphabet -> Alphabet # min :: Alphabet -> Alphabet -> Alphabet #
Ord UTF32_Invalid
Instance details Defined in Basement.String.Encoding.UTF32 Methods compare :: UTF32_Invalid -> UTF32_Invalid -> Ordering # (<) :: UTF32_Invalid -> UTF32_Invalid -> Bool # (<=) :: UTF32_Invalid -> UTF32_Invalid -> Bool # (>) :: UTF32_Invalid -> UTF32_Invalid -> Bool # (>=) :: UTF32_Invalid -> UTF32_Invalid -> Bool # max :: UTF32_Invalid -> UTF32_Invalid -> UTF32_Invalid # min :: UTF32_Invalid -> UTF32_Invalid -> UTF32_Invalid #
Ord Encoding
Instance details Defined in Basement.String Methods compare :: Encoding -> Encoding -> Ordering # (<) :: Encoding -> Encoding -> Bool # (<=) :: Encoding -> Encoding -> Bool # (>) :: Encoding -> Encoding -> Bool # (>=) :: Encoding -> Encoding -> Bool # max :: Encoding -> Encoding -> Encoding # min :: Encoding -> Encoding -> Encoding #
Ord String
Instance details Defined in Basement.UTF8.Base Methods compare :: String -> String -> Ordering # (<) :: String -> String -> Bool # (<=) :: String -> String -> Bool # (>) :: String -> String -> Bool # (>=) :: String -> String -> Bool # max :: String -> String -> String # min :: String -> String -> String #
Ord AsciiString
Instance details Defined in Basement.Types.AsciiString Methods compare :: AsciiString -> AsciiString -> Ordering # (<) :: AsciiString -> AsciiString -> Bool # (<=) :: AsciiString -> AsciiString -> Bool # (>) :: AsciiString -> AsciiString -> Bool # (>=) :: AsciiString -> AsciiString -> Bool # max :: AsciiString -> AsciiString -> AsciiString # min :: AsciiString -> AsciiString -> AsciiString #
Ord FileSize
Instance details Defined in Basement.Types.OffsetSize Methods compare :: FileSize -> FileSize -> Ordering # (<) :: FileSize -> FileSize -> Bool # (<=) :: FileSize -> FileSize -> Bool # (>) :: FileSize -> FileSize -> Bool # (>=) :: FileSize -> FileSize -> Bool # max :: FileSize -> FileSize -> FileSize # min :: FileSize -> FileSize -> FileSize #
Ord Char7
Instance details Defined in Basement.Types.Char7 Methods compare :: Char7 -> Char7 -> Ordering # (<) :: Char7 -> Char7 -> Bool # (<=) :: Char7 -> Char7 -> Bool # (>) :: Char7 -> Char7 -> Bool # (>=) :: Char7 -> Char7 -> Bool # max :: Char7 -> Char7 -> Char7 # min :: Char7 -> Char7 -> Char7 #
Ord F2Poly
Instance details Defined in Data.Bit.F2Poly Methods compare :: F2Poly -> F2Poly -> Ordering # (<) :: F2Poly -> F2Poly -> Bool # (<=) :: F2Poly -> F2Poly -> Bool # (>) :: F2Poly -> F2Poly -> Bool # (>=) :: F2Poly -> F2Poly -> Bool # max :: F2Poly -> F2Poly -> F2Poly # min :: F2Poly -> F2Poly -> F2Poly #
Ord Bit
Instance details Defined in Data.Bit.Internal Methods compare :: Bit -> Bit -> Ordering # (<) :: Bit -> Bit -> Bool # (<=) :: Bit -> Bit -> Bool # (>) :: Bit -> Bit -> Bool # (>=) :: Bit -> Bit -> Bool # max :: Bit -> Bit -> Bit # min :: Bit -> Bit -> Bit #
Ord TimeSpec
Instance details Defined in System.Clock Methods compare :: TimeSpec -> TimeSpec -> Ordering # (<) :: TimeSpec -> TimeSpec -> Bool # (<=) :: TimeSpec -> TimeSpec -> Bool # (>) :: TimeSpec -> TimeSpec -> Bool # (>=) :: TimeSpec -> TimeSpec -> Bool # max :: TimeSpec -> TimeSpec -> TimeSpec # min :: TimeSpec -> TimeSpec -> TimeSpec #
Ord IntSet
Instance details Defined in Data.IntSet.Internal Methods compare :: IntSet -> IntSet -> Ordering # (<) :: IntSet -> IntSet -> Bool # (<=) :: IntSet -> IntSet -> Bool # (>) :: IntSet -> IntSet -> Bool # (>=) :: IntSet -> IntSet -> Bool # max :: IntSet -> IntSet -> IntSet # min :: IntSet -> IntSet -> IntSet #
Ord DiffTime
Instance details Defined in Data.Time.Clock.Internal.DiffTime Methods compare :: DiffTime -> DiffTime -> Ordering # (<) :: DiffTime -> DiffTime -> Bool # (<=) :: DiffTime -> DiffTime -> Bool # (>) :: DiffTime -> DiffTime -> Bool # (>=) :: DiffTime -> DiffTime -> Bool # max :: DiffTime -> DiffTime -> DiffTime # min :: DiffTime -> DiffTime -> DiffTime #
Ord NominalDiffTime
Instance details Defined in Data.Time.Clock.Internal.NominalDiffTime Methods compare :: NominalDiffTime -> NominalDiffTime -> Ordering # (<) :: NominalDiffTime -> NominalDiffTime -> Bool # (<=) :: NominalDiffTime -> NominalDiffTime -> Bool # (>) :: NominalDiffTime -> NominalDiffTime -> Bool # (>=) :: NominalDiffTime -> NominalDiffTime -> Bool # max :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime # min :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime #
Ord DatatypeVariant
Instance details Defined in Language.Haskell.TH.Datatype Methods compare :: DatatypeVariant -> DatatypeVariant -> Ordering # (<) :: DatatypeVariant -> DatatypeVariant -> Bool # (<=) :: DatatypeVariant -> DatatypeVariant -> Bool # (>) :: DatatypeVariant -> DatatypeVariant -> Bool # (>=) :: DatatypeVariant -> DatatypeVariant -> Bool # max :: DatatypeVariant -> DatatypeVariant -> DatatypeVariant # min :: DatatypeVariant -> DatatypeVariant -> DatatypeVariant #
Ord BigNat
Instance details Defined in GHC.Integer.Type Methods compare :: BigNat -> BigNat -> Ordering # (<) :: BigNat -> BigNat -> Bool # (<=) :: BigNat -> BigNat -> Bool # (>) :: BigNat -> BigNat -> Bool # (>=) :: BigNat -> BigNat -> Bool # max :: BigNat -> BigNat -> BigNat # min :: BigNat -> BigNat -> BigNat #
Ord RuleBndr
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: RuleBndr -> RuleBndr -> Ordering # (<) :: RuleBndr -> RuleBndr -> Bool # (<=) :: RuleBndr -> RuleBndr -> Bool # (>) :: RuleBndr -> RuleBndr -> Bool # (>=) :: RuleBndr -> RuleBndr -> Bool # max :: RuleBndr -> RuleBndr -> RuleBndr # min :: RuleBndr -> RuleBndr -> RuleBndr #
Ord Phases
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Phases -> Phases -> Ordering # (<) :: Phases -> Phases -> Bool # (<=) :: Phases -> Phases -> Bool # (>) :: Phases -> Phases -> Bool # (>=) :: Phases -> Phases -> Bool # max :: Phases -> Phases -> Phases # min :: Phases -> Phases -> Phases #
Ord RuleMatch
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: RuleMatch -> RuleMatch -> Ordering # (<) :: RuleMatch -> RuleMatch -> Bool # (<=) :: RuleMatch -> RuleMatch -> Bool # (>) :: RuleMatch -> RuleMatch -> Bool # (>=) :: RuleMatch -> RuleMatch -> Bool # max :: RuleMatch -> RuleMatch -> RuleMatch # min :: RuleMatch -> RuleMatch -> RuleMatch #
Ord Inline
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Inline -> Inline -> Ordering # (<) :: Inline -> Inline -> Bool # (<=) :: Inline -> Inline -> Bool # (>) :: Inline -> Inline -> Bool # (>=) :: Inline -> Inline -> Bool # max :: Inline -> Inline -> Inline # min :: Inline -> Inline -> Inline #
Ord Pragma
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Pragma -> Pragma -> Ordering # (<) :: Pragma -> Pragma -> Bool # (<=) :: Pragma -> Pragma -> Bool # (>) :: Pragma -> Pragma -> Bool # (>=) :: Pragma -> Pragma -> Bool # max :: Pragma -> Pragma -> Pragma # min :: Pragma -> Pragma -> Pragma #
Ord DerivClause
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: DerivClause -> DerivClause -> Ordering # (<) :: DerivClause -> DerivClause -> Bool # (<=) :: DerivClause -> DerivClause -> Bool # (>) :: DerivClause -> DerivClause -> Bool # (>=) :: DerivClause -> DerivClause -> Bool # max :: DerivClause -> DerivClause -> DerivClause # min :: DerivClause -> DerivClause -> DerivClause #
Ord DerivStrategy
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: DerivStrategy -> DerivStrategy -> Ordering # (<) :: DerivStrategy -> DerivStrategy -> Bool # (<=) :: DerivStrategy -> DerivStrategy -> Bool # (>) :: DerivStrategy -> DerivStrategy -> Bool # (>=) :: DerivStrategy -> DerivStrategy -> Bool # max :: DerivStrategy -> DerivStrategy -> DerivStrategy # min :: DerivStrategy -> DerivStrategy -> DerivStrategy #
Ord TySynEqn
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: TySynEqn -> TySynEqn -> Ordering # (<) :: TySynEqn -> TySynEqn -> Bool # (<=) :: TySynEqn -> TySynEqn -> Bool # (>) :: TySynEqn -> TySynEqn -> Bool # (>=) :: TySynEqn -> TySynEqn -> Bool # max :: TySynEqn -> TySynEqn -> TySynEqn # min :: TySynEqn -> TySynEqn -> TySynEqn #
Ord Fixity
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Fixity -> Fixity -> Ordering # (<) :: Fixity -> Fixity -> Bool # (<=) :: Fixity -> Fixity -> Bool # (>) :: Fixity -> Fixity -> Bool # (>=) :: Fixity -> Fixity -> Bool # max :: Fixity -> Fixity -> Fixity # min :: Fixity -> Fixity -> Fixity #
Ord Info
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Info -> Info -> Ordering # (<) :: Info -> Info -> Bool # (<=) :: Info -> Info -> Bool # (>) :: Info -> Info -> Bool # (>=) :: Info -> Info -> Bool # max :: Info -> Info -> Info # min :: Info -> Info -> Info #
Ord Con
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Con -> Con -> Ordering # (<) :: Con -> Con -> Bool # (<=) :: Con -> Con -> Bool # (>) :: Con -> Con -> Bool # (>=) :: Con -> Con -> Bool # max :: Con -> Con -> Con # min :: Con -> Con -> Con #
Ord TyVarBndr
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: TyVarBndr -> TyVarBndr -> Ordering # (<) :: TyVarBndr -> TyVarBndr -> Bool # (<=) :: TyVarBndr -> TyVarBndr -> Bool # (>) :: TyVarBndr -> TyVarBndr -> Bool # (>=) :: TyVarBndr -> TyVarBndr -> Bool # max :: TyVarBndr -> TyVarBndr -> TyVarBndr # min :: TyVarBndr -> TyVarBndr -> TyVarBndr #
Ord DefName
Instance details Defined in Control.Lens.Internal.FieldTH Methods compare :: DefName -> DefName -> Ordering # (<) :: DefName -> DefName -> Bool # (<=) :: DefName -> DefName -> Bool # (>) :: DefName -> DefName -> Bool # (>=) :: DefName -> DefName -> Bool # max :: DefName -> DefName -> DefName # min :: DefName -> DefName -> DefName #
Ord Pos
Instance details Defined in Text.Megaparsec.Pos Methods compare :: Pos -> Pos -> Ordering # (<) :: Pos -> Pos -> Bool # (<=) :: Pos -> Pos -> Bool # (>) :: Pos -> Pos -> Bool # (>=) :: Pos -> Pos -> Bool # max :: Pos -> Pos -> Pos # min :: Pos -> Pos -> Pos #
Ord SourcePos
Instance details Defined in Text.Megaparsec.Pos Methods compare :: SourcePos -> SourcePos -> Ordering # (<) :: SourcePos -> SourcePos -> Bool # (<=) :: SourcePos -> SourcePos -> Bool # (>) :: SourcePos -> SourcePos -> Bool # (>=) :: SourcePos -> SourcePos -> Bool # max :: SourcePos -> SourcePos -> SourcePos # min :: SourcePos -> SourcePos -> SourcePos #
Ord OptName
Instance details Defined in Options.Applicative.Types Methods compare :: OptName -> OptName -> Ordering # (<) :: OptName -> OptName -> Bool # (<=) :: OptName -> OptName -> Bool # (>) :: OptName -> OptName -> Bool # (>=) :: OptName -> OptName -> Bool # max :: OptName -> OptName -> OptName # min :: OptName -> OptName -> OptName #
Ord OptVisibility
Instance details Defined in Options.Applicative.Types Methods compare :: OptVisibility -> OptVisibility -> Ordering # (<) :: OptVisibility -> OptVisibility -> Bool # (<=) :: OptVisibility -> OptVisibility -> Bool # (>) :: OptVisibility -> OptVisibility -> Bool # (>=) :: OptVisibility -> OptVisibility -> Bool # max :: OptVisibility -> OptVisibility -> OptVisibility # min :: OptVisibility -> OptVisibility -> OptVisibility #
Ord ArgPolicy
Instance details Defined in Options.Applicative.Types Methods compare :: ArgPolicy -> ArgPolicy -> Ordering # (<) :: ArgPolicy -> ArgPolicy -> Bool # (<=) :: ArgPolicy -> ArgPolicy -> Bool # (>) :: ArgPolicy -> ArgPolicy -> Bool # (>=) :: ArgPolicy -> ArgPolicy -> Bool # max :: ArgPolicy -> ArgPolicy -> ArgPolicy # min :: ArgPolicy -> ArgPolicy -> ArgPolicy #
Ord ByteArray	Non-lexicographic ordering. This compares the lengths of the byte arrays first and uses a lexicographic ordering if the lengths are equal. Subject to change between major versions. Since: primitive-0.6.3.0
Instance details Defined in Data.Primitive.ByteArray Methods compare :: ByteArray -> ByteArray -> Ordering # (<) :: ByteArray -> ByteArray -> Bool # (<=) :: ByteArray -> ByteArray -> Bool # (>) :: ByteArray -> ByteArray -> Bool # (>=) :: ByteArray -> ByteArray -> Bool # max :: ByteArray -> ByteArray -> ByteArray # min :: ByteArray -> ByteArray -> ByteArray #
Ord Mod2
Instance details Defined in Data.Semiring Methods compare :: Mod2 -> Mod2 -> Ordering # (<) :: Mod2 -> Mod2 -> Bool # (<=) :: Mod2 -> Mod2 -> Bool # (>) :: Mod2 -> Mod2 -> Bool # (>=) :: Mod2 -> Mod2 -> Bool # max :: Mod2 -> Mod2 -> Mod2 # min :: Mod2 -> Mod2 -> Mod2 #
Ord ModName
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: ModName -> ModName -> Ordering # (<) :: ModName -> ModName -> Bool # (<=) :: ModName -> ModName -> Bool # (>) :: ModName -> ModName -> Bool # (>=) :: ModName -> ModName -> Bool # max :: ModName -> ModName -> ModName # min :: ModName -> ModName -> ModName #
Ord PkgName
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: PkgName -> PkgName -> Ordering # (<) :: PkgName -> PkgName -> Bool # (<=) :: PkgName -> PkgName -> Bool # (>) :: PkgName -> PkgName -> Bool # (>=) :: PkgName -> PkgName -> Bool # max :: PkgName -> PkgName -> PkgName # min :: PkgName -> PkgName -> PkgName #
Ord Module
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Module -> Module -> Ordering # (<) :: Module -> Module -> Bool # (<=) :: Module -> Module -> Bool # (>) :: Module -> Module -> Bool # (>=) :: Module -> Module -> Bool # max :: Module -> Module -> Module # min :: Module -> Module -> Module #
Ord OccName
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: OccName -> OccName -> Ordering # (<) :: OccName -> OccName -> Bool # (<=) :: OccName -> OccName -> Bool # (>) :: OccName -> OccName -> Bool # (>=) :: OccName -> OccName -> Bool # max :: OccName -> OccName -> OccName # min :: OccName -> OccName -> OccName #
Ord NameFlavour
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: NameFlavour -> NameFlavour -> Ordering # (<) :: NameFlavour -> NameFlavour -> Bool # (<=) :: NameFlavour -> NameFlavour -> Bool # (>) :: NameFlavour -> NameFlavour -> Bool # (>=) :: NameFlavour -> NameFlavour -> Bool # max :: NameFlavour -> NameFlavour -> NameFlavour # min :: NameFlavour -> NameFlavour -> NameFlavour #
Ord NameSpace
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: NameSpace -> NameSpace -> Ordering # (<) :: NameSpace -> NameSpace -> Bool # (<=) :: NameSpace -> NameSpace -> Bool # (>) :: NameSpace -> NameSpace -> Bool # (>=) :: NameSpace -> NameSpace -> Bool # max :: NameSpace -> NameSpace -> NameSpace # min :: NameSpace -> NameSpace -> NameSpace #
Ord Loc
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Loc -> Loc -> Ordering # (<) :: Loc -> Loc -> Bool # (<=) :: Loc -> Loc -> Bool # (>) :: Loc -> Loc -> Bool # (>=) :: Loc -> Loc -> Bool # max :: Loc -> Loc -> Loc # min :: Loc -> Loc -> Loc #
Ord ModuleInfo
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: ModuleInfo -> ModuleInfo -> Ordering # (<) :: ModuleInfo -> ModuleInfo -> Bool # (<=) :: ModuleInfo -> ModuleInfo -> Bool # (>) :: ModuleInfo -> ModuleInfo -> Bool # (>=) :: ModuleInfo -> ModuleInfo -> Bool # max :: ModuleInfo -> ModuleInfo -> ModuleInfo # min :: ModuleInfo -> ModuleInfo -> ModuleInfo #
Ord FixityDirection
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: FixityDirection -> FixityDirection -> Ordering # (<) :: FixityDirection -> FixityDirection -> Bool # (<=) :: FixityDirection -> FixityDirection -> Bool # (>) :: FixityDirection -> FixityDirection -> Bool # (>=) :: FixityDirection -> FixityDirection -> Bool # max :: FixityDirection -> FixityDirection -> FixityDirection # min :: FixityDirection -> FixityDirection -> FixityDirection #
Ord Lit
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Lit -> Lit -> Ordering # (<) :: Lit -> Lit -> Bool # (<=) :: Lit -> Lit -> Bool # (>) :: Lit -> Lit -> Bool # (>=) :: Lit -> Lit -> Bool # max :: Lit -> Lit -> Lit # min :: Lit -> Lit -> Lit #
Ord Bytes
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Bytes -> Bytes -> Ordering # (<) :: Bytes -> Bytes -> Bool # (<=) :: Bytes -> Bytes -> Bool # (>) :: Bytes -> Bytes -> Bool # (>=) :: Bytes -> Bytes -> Bool # max :: Bytes -> Bytes -> Bytes # min :: Bytes -> Bytes -> Bytes #
Ord Body
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Body -> Body -> Ordering # (<) :: Body -> Body -> Bool # (<=) :: Body -> Body -> Bool # (>) :: Body -> Body -> Bool # (>=) :: Body -> Body -> Bool # max :: Body -> Body -> Body # min :: Body -> Body -> Body #
Ord Guard
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Guard -> Guard -> Ordering # (<) :: Guard -> Guard -> Bool # (<=) :: Guard -> Guard -> Bool # (>) :: Guard -> Guard -> Bool # (>=) :: Guard -> Guard -> Bool # max :: Guard -> Guard -> Guard # min :: Guard -> Guard -> Guard #
Ord Stmt
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Stmt -> Stmt -> Ordering # (<) :: Stmt -> Stmt -> Bool # (<=) :: Stmt -> Stmt -> Bool # (>) :: Stmt -> Stmt -> Bool # (>=) :: Stmt -> Stmt -> Bool # max :: Stmt -> Stmt -> Stmt # min :: Stmt -> Stmt -> Stmt #
Ord Range
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Range -> Range -> Ordering # (<) :: Range -> Range -> Bool # (<=) :: Range -> Range -> Bool # (>) :: Range -> Range -> Bool # (>=) :: Range -> Range -> Bool # max :: Range -> Range -> Range # min :: Range -> Range -> Range #
Ord TypeFamilyHead
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: TypeFamilyHead -> TypeFamilyHead -> Ordering # (<) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (<=) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (>) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (>=) :: TypeFamilyHead -> TypeFamilyHead -> Bool # max :: TypeFamilyHead -> TypeFamilyHead -> TypeFamilyHead # min :: TypeFamilyHead -> TypeFamilyHead -> TypeFamilyHead #
Ord Foreign
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Foreign -> Foreign -> Ordering # (<) :: Foreign -> Foreign -> Bool # (<=) :: Foreign -> Foreign -> Bool # (>) :: Foreign -> Foreign -> Bool # (>=) :: Foreign -> Foreign -> Bool # max :: Foreign -> Foreign -> Foreign # min :: Foreign -> Foreign -> Foreign #
Ord Callconv
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Callconv -> Callconv -> Ordering # (<) :: Callconv -> Callconv -> Bool # (<=) :: Callconv -> Callconv -> Bool # (>) :: Callconv -> Callconv -> Bool # (>=) :: Callconv -> Callconv -> Bool # max :: Callconv -> Callconv -> Callconv # min :: Callconv -> Callconv -> Callconv #
Ord Safety
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Safety -> Safety -> Ordering # (<) :: Safety -> Safety -> Bool # (<=) :: Safety -> Safety -> Bool # (>) :: Safety -> Safety -> Bool # (>=) :: Safety -> Safety -> Bool # max :: Safety -> Safety -> Safety # min :: Safety -> Safety -> Safety #
Ord AnnTarget
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: AnnTarget -> AnnTarget -> Ordering # (<) :: AnnTarget -> AnnTarget -> Bool # (<=) :: AnnTarget -> AnnTarget -> Bool # (>) :: AnnTarget -> AnnTarget -> Bool # (>=) :: AnnTarget -> AnnTarget -> Bool # max :: AnnTarget -> AnnTarget -> AnnTarget # min :: AnnTarget -> AnnTarget -> AnnTarget #
Ord SourceUnpackedness
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: SourceUnpackedness -> SourceUnpackedness -> Ordering # (<) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (<=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # max :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness # min :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness #
Ord SourceStrictness
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: SourceStrictness -> SourceStrictness -> Ordering # (<) :: SourceStrictness -> SourceStrictness -> Bool # (<=) :: SourceStrictness -> SourceStrictness -> Bool # (>) :: SourceStrictness -> SourceStrictness -> Bool # (>=) :: SourceStrictness -> SourceStrictness -> Bool # max :: SourceStrictness -> SourceStrictness -> SourceStrictness # min :: SourceStrictness -> SourceStrictness -> SourceStrictness #
Ord DecidedStrictness
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: DecidedStrictness -> DecidedStrictness -> Ordering # (<) :: DecidedStrictness -> DecidedStrictness -> Bool # (<=) :: DecidedStrictness -> DecidedStrictness -> Bool # (>) :: DecidedStrictness -> DecidedStrictness -> Bool # (>=) :: DecidedStrictness -> DecidedStrictness -> Bool # max :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness # min :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness #
Ord Bang
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Bang -> Bang -> Ordering # (<) :: Bang -> Bang -> Bool # (<=) :: Bang -> Bang -> Bool # (>) :: Bang -> Bang -> Bool # (>=) :: Bang -> Bang -> Bool # max :: Bang -> Bang -> Bang # min :: Bang -> Bang -> Bang #
Ord PatSynDir
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: PatSynDir -> PatSynDir -> Ordering # (<) :: PatSynDir -> PatSynDir -> Bool # (<=) :: PatSynDir -> PatSynDir -> Bool # (>) :: PatSynDir -> PatSynDir -> Bool # (>=) :: PatSynDir -> PatSynDir -> Bool # max :: PatSynDir -> PatSynDir -> PatSynDir # min :: PatSynDir -> PatSynDir -> PatSynDir #
Ord PatSynArgs
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: PatSynArgs -> PatSynArgs -> Ordering # (<) :: PatSynArgs -> PatSynArgs -> Bool # (<=) :: PatSynArgs -> PatSynArgs -> Bool # (>) :: PatSynArgs -> PatSynArgs -> Bool # (>=) :: PatSynArgs -> PatSynArgs -> Bool # max :: PatSynArgs -> PatSynArgs -> PatSynArgs # min :: PatSynArgs -> PatSynArgs -> PatSynArgs #
Ord FamilyResultSig
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: FamilyResultSig -> FamilyResultSig -> Ordering # (<) :: FamilyResultSig -> FamilyResultSig -> Bool # (<=) :: FamilyResultSig -> FamilyResultSig -> Bool # (>) :: FamilyResultSig -> FamilyResultSig -> Bool # (>=) :: FamilyResultSig -> FamilyResultSig -> Bool # max :: FamilyResultSig -> FamilyResultSig -> FamilyResultSig # min :: FamilyResultSig -> FamilyResultSig -> FamilyResultSig #
Ord TyLit
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: TyLit -> TyLit -> Ordering # (<) :: TyLit -> TyLit -> Bool # (<=) :: TyLit -> TyLit -> Bool # (>) :: TyLit -> TyLit -> Bool # (>=) :: TyLit -> TyLit -> Bool # max :: TyLit -> TyLit -> TyLit # min :: TyLit -> TyLit -> TyLit #
Ord Role
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Role -> Role -> Ordering # (<) :: Role -> Role -> Bool # (<=) :: Role -> Role -> Bool # (>) :: Role -> Role -> Bool # (>=) :: Role -> Role -> Bool # max :: Role -> Role -> Role # min :: Role -> Role -> Role #
Ord AnnLookup
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: AnnLookup -> AnnLookup -> Ordering # (<) :: AnnLookup -> AnnLookup -> Bool # (<=) :: AnnLookup -> AnnLookup -> Bool # (>) :: AnnLookup -> AnnLookup -> Bool # (>=) :: AnnLookup -> AnnLookup -> Bool # max :: AnnLookup -> AnnLookup -> AnnLookup # min :: AnnLookup -> AnnLookup -> AnnLookup #
Ord ConstructorVariant
Instance details Defined in Language.Haskell.TH.Datatype Methods compare :: ConstructorVariant -> ConstructorVariant -> Ordering # (<) :: ConstructorVariant -> ConstructorVariant -> Bool # (<=) :: ConstructorVariant -> ConstructorVariant -> Bool # (>) :: ConstructorVariant -> ConstructorVariant -> Bool # (>=) :: ConstructorVariant -> ConstructorVariant -> Bool # max :: ConstructorVariant -> ConstructorVariant -> ConstructorVariant # min :: ConstructorVariant -> ConstructorVariant -> ConstructorVariant #
Ord FieldStrictness
Instance details Defined in Language.Haskell.TH.Datatype Methods compare :: FieldStrictness -> FieldStrictness -> Ordering # (<) :: FieldStrictness -> FieldStrictness -> Bool # (<=) :: FieldStrictness -> FieldStrictness -> Bool # (>) :: FieldStrictness -> FieldStrictness -> Bool # (>=) :: FieldStrictness -> FieldStrictness -> Bool # max :: FieldStrictness -> FieldStrictness -> FieldStrictness # min :: FieldStrictness -> FieldStrictness -> FieldStrictness #
Ord Unpackedness
Instance details Defined in Language.Haskell.TH.Datatype Methods compare :: Unpackedness -> Unpackedness -> Ordering # (<) :: Unpackedness -> Unpackedness -> Bool # (<=) :: Unpackedness -> Unpackedness -> Bool # (>) :: Unpackedness -> Unpackedness -> Bool # (>=) :: Unpackedness -> Unpackedness -> Bool # max :: Unpackedness -> Unpackedness -> Unpackedness # min :: Unpackedness -> Unpackedness -> Unpackedness #
Ord Strictness
Instance details Defined in Language.Haskell.TH.Datatype Methods compare :: Strictness -> Strictness -> Ordering # (<) :: Strictness -> Strictness -> Bool # (<=) :: Strictness -> Strictness -> Bool # (>) :: Strictness -> Strictness -> Bool # (>=) :: Strictness -> Strictness -> Bool # max :: Strictness -> Strictness -> Strictness # min :: Strictness -> Strictness -> Strictness #
Ord Specificity
Instance details Defined in Language.Haskell.TH.Datatype.TyVarBndr Methods compare :: Specificity -> Specificity -> Ordering # (<) :: Specificity -> Specificity -> Bool # (<=) :: Specificity -> Specificity -> Bool # (>) :: Specificity -> Specificity -> Bool # (>=) :: Specificity -> Specificity -> Bool # max :: Specificity -> Specificity -> Specificity # min :: Specificity -> Specificity -> Specificity #
Ord LocalTime
Instance details Defined in Data.Time.LocalTime.Internal.LocalTime Methods compare :: LocalTime -> LocalTime -> Ordering # (<) :: LocalTime -> LocalTime -> Bool # (<=) :: LocalTime -> LocalTime -> Bool # (>) :: LocalTime -> LocalTime -> Bool # (>=) :: LocalTime -> LocalTime -> Bool # max :: LocalTime -> LocalTime -> LocalTime # min :: LocalTime -> LocalTime -> LocalTime #
Ord TimeOfDay
Instance details Defined in Data.Time.LocalTime.Internal.TimeOfDay Methods compare :: TimeOfDay -> TimeOfDay -> Ordering # (<) :: TimeOfDay -> TimeOfDay -> Bool # (<=) :: TimeOfDay -> TimeOfDay -> Bool # (>) :: TimeOfDay -> TimeOfDay -> Bool # (>=) :: TimeOfDay -> TimeOfDay -> Bool # max :: TimeOfDay -> TimeOfDay -> TimeOfDay # min :: TimeOfDay -> TimeOfDay -> TimeOfDay #
Ord TimeZone
Instance details Defined in Data.Time.LocalTime.Internal.TimeZone Methods compare :: TimeZone -> TimeZone -> Ordering # (<) :: TimeZone -> TimeZone -> Bool # (<=) :: TimeZone -> TimeZone -> Bool # (>) :: TimeZone -> TimeZone -> Bool # (>=) :: TimeZone -> TimeZone -> Bool # max :: TimeZone -> TimeZone -> TimeZone # min :: TimeZone -> TimeZone -> TimeZone #
Ord UniversalTime
Instance details Defined in Data.Time.Clock.Internal.UniversalTime Methods compare :: UniversalTime -> UniversalTime -> Ordering # (<) :: UniversalTime -> UniversalTime -> Bool # (<=) :: UniversalTime -> UniversalTime -> Bool # (>) :: UniversalTime -> UniversalTime -> Bool # (>=) :: UniversalTime -> UniversalTime -> Bool # max :: UniversalTime -> UniversalTime -> UniversalTime # min :: UniversalTime -> UniversalTime -> UniversalTime #
Ord AbsoluteTime
Instance details Defined in Data.Time.Clock.Internal.AbsoluteTime Methods compare :: AbsoluteTime -> AbsoluteTime -> Ordering # (<) :: AbsoluteTime -> AbsoluteTime -> Bool # (<=) :: AbsoluteTime -> AbsoluteTime -> Bool # (>) :: AbsoluteTime -> AbsoluteTime -> Bool # (>=) :: AbsoluteTime -> AbsoluteTime -> Bool # max :: AbsoluteTime -> AbsoluteTime -> AbsoluteTime # min :: AbsoluteTime -> AbsoluteTime -> AbsoluteTime #
Ord Day
Instance details Defined in Data.Time.Calendar.Days Methods compare :: Day -> Day -> Ordering # (<) :: Day -> Day -> Bool # (<=) :: Day -> Day -> Bool # (>) :: Day -> Day -> Bool # (>=) :: Day -> Day -> Bool # max :: Day -> Day -> Day # min :: Day -> Day -> Day #
Ord Undefined
Instance details Defined in Universum.Debug Methods compare :: Undefined -> Undefined -> Ordering # (<) :: Undefined -> Undefined -> Bool # (<=) :: Undefined -> Undefined -> Bool # (>) :: Undefined -> Undefined -> Bool # (>=) :: Undefined -> Undefined -> Bool # max :: Undefined -> Undefined -> Undefined # min :: Undefined -> Undefined -> Undefined #
Ord UnpackedUUID
Instance details Defined in Data.UUID.Types.Internal Methods compare :: UnpackedUUID -> UnpackedUUID -> Ordering # (<) :: UnpackedUUID -> UnpackedUUID -> Bool # (<=) :: UnpackedUUID -> UnpackedUUID -> Bool # (>) :: UnpackedUUID -> UnpackedUUID -> Bool # (>=) :: UnpackedUUID -> UnpackedUUID -> Bool # max :: UnpackedUUID -> UnpackedUUID -> UnpackedUUID # min :: UnpackedUUID -> UnpackedUUID -> UnpackedUUID #
Ord UUID
Instance details Defined in Data.UUID.Types.Internal Methods compare :: UUID -> UUID -> Ordering # (<) :: UUID -> UUID -> Bool # (<=) :: UUID -> UUID -> Bool # (>) :: UUID -> UUID -> Bool # (>=) :: UUID -> UUID -> Bool # max :: UUID -> UUID -> UUID # min :: UUID -> UUID -> UUID #
Ord MText
Instance details Defined in Morley.Michelson.Text Methods compare :: MText -> MText -> Ordering # (<) :: MText -> MText -> Bool # (<=) :: MText -> MText -> Bool # (>) :: MText -> MText -> Bool # (>=) :: MText -> MText -> Bool # max :: MText -> MText -> MText # min :: MText -> MText -> MText #
Ord MutezArithErrorType
Instance details Defined in Morley.Michelson.Typed.Arith Methods compare :: MutezArithErrorType -> MutezArithErrorType -> Ordering # (<) :: MutezArithErrorType -> MutezArithErrorType -> Bool # (<=) :: MutezArithErrorType -> MutezArithErrorType -> Bool # (>) :: MutezArithErrorType -> MutezArithErrorType -> Bool # (>=) :: MutezArithErrorType -> MutezArithErrorType -> Bool # max :: MutezArithErrorType -> MutezArithErrorType -> MutezArithErrorType # min :: MutezArithErrorType -> MutezArithErrorType -> MutezArithErrorType #
Ord ShiftArithErrorType
Instance details Defined in Morley.Michelson.Typed.Arith Methods compare :: ShiftArithErrorType -> ShiftArithErrorType -> Ordering # (<) :: ShiftArithErrorType -> ShiftArithErrorType -> Bool # (<=) :: ShiftArithErrorType -> ShiftArithErrorType -> Bool # (>) :: ShiftArithErrorType -> ShiftArithErrorType -> Bool # (>=) :: ShiftArithErrorType -> ShiftArithErrorType -> Bool # max :: ShiftArithErrorType -> ShiftArithErrorType -> ShiftArithErrorType # min :: ShiftArithErrorType -> ShiftArithErrorType -> ShiftArithErrorType #
Ord EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints Methods compare :: EpAddress -> EpAddress -> Ordering # (<) :: EpAddress -> EpAddress -> Bool # (<=) :: EpAddress -> EpAddress -> Bool # (>) :: EpAddress -> EpAddress -> Bool # (>=) :: EpAddress -> EpAddress -> Bool # max :: EpAddress -> EpAddress -> EpAddress # min :: EpAddress -> EpAddress -> EpAddress #
Ord DStorageType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Methods compare :: DStorageType -> DStorageType -> Ordering # (<) :: DStorageType -> DStorageType -> Bool # (<=) :: DStorageType -> DStorageType -> Bool # (>) :: DStorageType -> DStorageType -> Bool # (>=) :: DStorageType -> DStorageType -> Bool # max :: DStorageType -> DStorageType -> DStorageType # min :: DStorageType -> DStorageType -> DStorageType #
Ord DType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Methods compare :: DType -> DType -> Ordering # (<) :: DType -> DType -> Bool # (<=) :: DType -> DType -> Bool # (>) :: DType -> DType -> Bool # (>=) :: DType -> DType -> Bool # max :: DType -> DType -> DType # min :: DType -> DType -> DType #
Ord EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Methods compare :: EpName -> EpName -> Ordering # (<) :: EpName -> EpName -> Bool # (<=) :: EpName -> EpName -> Bool # (>) :: EpName -> EpName -> Bool # (>=) :: EpName -> EpName -> Bool # max :: EpName -> EpName -> EpName # min :: EpName -> EpName -> EpName #
Ord OpSize
Instance details Defined in Morley.Michelson.Untyped.OpSize Methods compare :: OpSize -> OpSize -> Ordering # (<) :: OpSize -> OpSize -> Bool # (<=) :: OpSize -> OpSize -> Bool # (>) :: OpSize -> OpSize -> Bool # (>=) :: OpSize -> OpSize -> Bool # max :: OpSize -> OpSize -> OpSize # min :: OpSize -> OpSize -> OpSize #
Ord ViewName
Instance details Defined in Morley.Michelson.Untyped.View Methods compare :: ViewName -> ViewName -> Ordering # (<) :: ViewName -> ViewName -> Bool # (<=) :: ViewName -> ViewName -> Bool # (>) :: ViewName -> ViewName -> Bool # (>=) :: ViewName -> ViewName -> Bool # max :: ViewName -> ViewName -> ViewName # min :: ViewName -> ViewName -> ViewName #
Ord Address
Instance details Defined in Morley.Tezos.Address Methods compare :: Address -> Address -> Ordering # (<) :: Address -> Address -> Bool # (<=) :: Address -> Address -> Bool # (>) :: Address -> Address -> Bool # (>=) :: Address -> Address -> Bool # max :: Address -> Address -> Address # min :: Address -> Address -> Address #
Ord Bls12381Fr
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods compare :: Bls12381Fr -> Bls12381Fr -> Ordering # (<) :: Bls12381Fr -> Bls12381Fr -> Bool # (<=) :: Bls12381Fr -> Bls12381Fr -> Bool # (>) :: Bls12381Fr -> Bls12381Fr -> Bool # (>=) :: Bls12381Fr -> Bls12381Fr -> Bool # max :: Bls12381Fr -> Bls12381Fr -> Bls12381Fr # min :: Bls12381Fr -> Bls12381Fr -> Bls12381Fr #
Ord ChainId
Instance details Defined in Morley.Tezos.Core Methods compare :: ChainId -> ChainId -> Ordering # (<) :: ChainId -> ChainId -> Bool # (<=) :: ChainId -> ChainId -> Bool # (>) :: ChainId -> ChainId -> Bool # (>=) :: ChainId -> ChainId -> Bool # max :: ChainId -> ChainId -> ChainId # min :: ChainId -> ChainId -> ChainId #
Ord KeyHash
Instance details Defined in Morley.Tezos.Crypto Methods compare :: KeyHash -> KeyHash -> Ordering # (<) :: KeyHash -> KeyHash -> Bool # (<=) :: KeyHash -> KeyHash -> Bool # (>) :: KeyHash -> KeyHash -> Bool # (>=) :: KeyHash -> KeyHash -> Bool # max :: KeyHash -> KeyHash -> KeyHash # min :: KeyHash -> KeyHash -> KeyHash #
Ord Mutez
Instance details Defined in Morley.Tezos.Core Methods compare :: Mutez -> Mutez -> Ordering # (<) :: Mutez -> Mutez -> Bool # (<=) :: Mutez -> Mutez -> Bool # (>) :: Mutez -> Mutez -> Bool # (>=) :: Mutez -> Mutez -> Bool # max :: Mutez -> Mutez -> Mutez # min :: Mutez -> Mutez -> Mutez #
Ord PublicKey
Instance details Defined in Morley.Tezos.Crypto Methods compare :: PublicKey -> PublicKey -> Ordering # (<) :: PublicKey -> PublicKey -> Bool # (<=) :: PublicKey -> PublicKey -> Bool # (>) :: PublicKey -> PublicKey -> Bool # (>=) :: PublicKey -> PublicKey -> Bool # max :: PublicKey -> PublicKey -> PublicKey # min :: PublicKey -> PublicKey -> PublicKey #
Ord Signature
Instance details Defined in Morley.Tezos.Crypto Methods compare :: Signature -> Signature -> Ordering # (<) :: Signature -> Signature -> Bool # (<=) :: Signature -> Signature -> Bool # (>) :: Signature -> Signature -> Bool # (>=) :: Signature -> Signature -> Bool # max :: Signature -> Signature -> Signature # min :: Signature -> Signature -> Signature #
Ord Timestamp
Instance details Defined in Morley.Tezos.Core Methods compare :: Timestamp -> Timestamp -> Ordering # (<) :: Timestamp -> Timestamp -> Bool # (<=) :: Timestamp -> Timestamp -> Bool # (>) :: Timestamp -> Timestamp -> Bool # (>=) :: Timestamp -> Timestamp -> Bool # max :: Timestamp -> Timestamp -> Timestamp # min :: Timestamp -> Timestamp -> Timestamp #
Ord Var
Instance details Defined in Morley.Michelson.Untyped.Ext Methods compare :: Var -> Var -> Ordering # (<) :: Var -> Var -> Bool # (<=) :: Var -> Var -> Bool # (>) :: Var -> Var -> Bool # (>=) :: Var -> Var -> Bool # max :: Var -> Var -> Var # min :: Var -> Var -> Var #
Ord BadViewNameError
Instance details Defined in Morley.Michelson.Untyped.View Methods compare :: BadViewNameError -> BadViewNameError -> Ordering # (<) :: BadViewNameError -> BadViewNameError -> Bool # (<=) :: BadViewNameError -> BadViewNameError -> Bool # (>) :: BadViewNameError -> BadViewNameError -> Bool # (>=) :: BadViewNameError -> BadViewNameError -> Bool # max :: BadViewNameError -> BadViewNameError -> BadViewNameError # min :: BadViewNameError -> BadViewNameError -> BadViewNameError #
Ord ContractHash
Instance details Defined in Morley.Tezos.Address Methods compare :: ContractHash -> ContractHash -> Ordering # (<) :: ContractHash -> ContractHash -> Bool # (<=) :: ContractHash -> ContractHash -> Bool # (>) :: ContractHash -> ContractHash -> Bool # (>=) :: ContractHash -> ContractHash -> Bool # max :: ContractHash -> ContractHash -> ContractHash # min :: ContractHash -> ContractHash -> ContractHash #
Ord KeyHashTag
Instance details Defined in Morley.Tezos.Crypto Methods compare :: KeyHashTag -> KeyHashTag -> Ordering # (<) :: KeyHashTag -> KeyHashTag -> Bool # (<=) :: KeyHashTag -> KeyHashTag -> Bool # (>) :: KeyHashTag -> KeyHashTag -> Bool # (>=) :: KeyHashTag -> KeyHashTag -> Bool # max :: KeyHashTag -> KeyHashTag -> KeyHashTag # min :: KeyHashTag -> KeyHashTag -> KeyHashTag #
Ord PublicKey
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Methods compare :: PublicKey -> PublicKey -> Ordering # (<) :: PublicKey -> PublicKey -> Bool # (<=) :: PublicKey -> PublicKey -> Bool # (>) :: PublicKey -> PublicKey -> Bool # (>=) :: PublicKey -> PublicKey -> Bool # max :: PublicKey -> PublicKey -> PublicKey # min :: PublicKey -> PublicKey -> PublicKey #
Ord PublicKey
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Methods compare :: PublicKey -> PublicKey -> Ordering # (<) :: PublicKey -> PublicKey -> Bool # (<=) :: PublicKey -> PublicKey -> Bool # (>) :: PublicKey -> PublicKey -> Bool # (>=) :: PublicKey -> PublicKey -> Bool # max :: PublicKey -> PublicKey -> PublicKey # min :: PublicKey -> PublicKey -> PublicKey #
Ord PublicKey
Instance details Defined in Morley.Tezos.Crypto.P256 Methods compare :: PublicKey -> PublicKey -> Ordering # (<) :: PublicKey -> PublicKey -> Bool # (<=) :: PublicKey -> PublicKey -> Bool # (>) :: PublicKey -> PublicKey -> Bool # (>=) :: PublicKey -> PublicKey -> Bool # max :: PublicKey -> PublicKey -> PublicKey # min :: PublicKey -> PublicKey -> PublicKey #
Ord DocItemPos
Instance details Defined in Morley.Michelson.Doc Methods compare :: DocItemPos -> DocItemPos -> Ordering # (<) :: DocItemPos -> DocItemPos -> Bool # (<=) :: DocItemPos -> DocItemPos -> Bool # (>) :: DocItemPos -> DocItemPos -> Bool # (>=) :: DocItemPos -> DocItemPos -> Bool # max :: DocItemPos -> DocItemPos -> DocItemPos # min :: DocItemPos -> DocItemPos -> DocItemPos #
Ord SomeDocDefinitionItem
Instance details Defined in Morley.Michelson.Doc Methods compare :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> Ordering # (<) :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> Bool # (<=) :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> Bool # (>) :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> Bool # (>=) :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> Bool # max :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> SomeDocDefinitionItem # min :: SomeDocDefinitionItem -> SomeDocDefinitionItem -> SomeDocDefinitionItem #
Ord InstrCallStack
Instance details Defined in Morley.Michelson.ErrorPos Methods compare :: InstrCallStack -> InstrCallStack -> Ordering # (<) :: InstrCallStack -> InstrCallStack -> Bool # (<=) :: InstrCallStack -> InstrCallStack -> Bool # (>) :: InstrCallStack -> InstrCallStack -> Bool # (>=) :: InstrCallStack -> InstrCallStack -> Bool # max :: InstrCallStack -> InstrCallStack -> InstrCallStack # min :: InstrCallStack -> InstrCallStack -> InstrCallStack #
Ord DocItemId
Instance details Defined in Morley.Michelson.Doc Methods compare :: DocItemId -> DocItemId -> Ordering # (<) :: DocItemId -> DocItemId -> Bool # (<=) :: DocItemId -> DocItemId -> Bool # (>) :: DocItemId -> DocItemId -> Bool # (>=) :: DocItemId -> DocItemId -> Bool # max :: DocItemId -> DocItemId -> DocItemId # min :: DocItemId -> DocItemId -> DocItemId #
Ord TezosMutez
Instance details Defined in Morley.Micheline.Json Methods compare :: TezosMutez -> TezosMutez -> Ordering # (<) :: TezosMutez -> TezosMutez -> Bool # (<=) :: TezosMutez -> TezosMutez -> Bool # (>) :: TezosMutez -> TezosMutez -> Bool # (>=) :: TezosMutez -> TezosMutez -> Bool # max :: TezosMutez -> TezosMutez -> TezosMutez # min :: TezosMutez -> TezosMutez -> TezosMutez #
Ord LetName
Instance details Defined in Morley.Michelson.ErrorPos Methods compare :: LetName -> LetName -> Ordering # (<) :: LetName -> LetName -> Bool # (<=) :: LetName -> LetName -> Bool # (>) :: LetName -> LetName -> Bool # (>=) :: LetName -> LetName -> Bool # max :: LetName -> LetName -> LetName # min :: LetName -> LetName -> LetName #
Ord Pos
Instance details Defined in Morley.Michelson.ErrorPos Methods compare :: Pos -> Pos -> Ordering # (<) :: Pos -> Pos -> Bool # (<=) :: Pos -> Pos -> Bool # (>) :: Pos -> Pos -> Bool # (>=) :: Pos -> Pos -> Bool # max :: Pos -> Pos -> Pos # min :: Pos -> Pos -> Pos #
Ord SrcPos
Instance details Defined in Morley.Michelson.ErrorPos Methods compare :: SrcPos -> SrcPos -> Ordering # (<) :: SrcPos -> SrcPos -> Bool # (<=) :: SrcPos -> SrcPos -> Bool # (>) :: SrcPos -> SrcPos -> Bool # (>=) :: SrcPos -> SrcPos -> Bool # max :: SrcPos -> SrcPos -> SrcPos # min :: SrcPos -> SrcPos -> SrcPos #
Ord HexJSONByteString
Instance details Defined in Morley.Util.ByteString Methods compare :: HexJSONByteString -> HexJSONByteString -> Ordering # (<) :: HexJSONByteString -> HexJSONByteString -> Bool # (<=) :: HexJSONByteString -> HexJSONByteString -> Bool # (>) :: HexJSONByteString -> HexJSONByteString -> Bool # (>=) :: HexJSONByteString -> HexJSONByteString -> Bool # max :: HexJSONByteString -> HexJSONByteString -> HexJSONByteString # min :: HexJSONByteString -> HexJSONByteString -> HexJSONByteString #
Ord MichelinePrimitive
Instance details Defined in Morley.Micheline.Expression Methods compare :: MichelinePrimitive -> MichelinePrimitive -> Ordering # (<) :: MichelinePrimitive -> MichelinePrimitive -> Bool # (<=) :: MichelinePrimitive -> MichelinePrimitive -> Bool # (>) :: MichelinePrimitive -> MichelinePrimitive -> Bool # (>=) :: MichelinePrimitive -> MichelinePrimitive -> Bool # max :: MichelinePrimitive -> MichelinePrimitive -> MichelinePrimitive # min :: MichelinePrimitive -> MichelinePrimitive -> MichelinePrimitive #
Ord CustomParserException
Instance details Defined in Morley.Michelson.Parser.Error Methods compare :: CustomParserException -> CustomParserException -> Ordering # (<) :: CustomParserException -> CustomParserException -> Bool # (<=) :: CustomParserException -> CustomParserException -> Bool # (>) :: CustomParserException -> CustomParserException -> Bool # (>=) :: CustomParserException -> CustomParserException -> Bool # max :: CustomParserException -> CustomParserException -> CustomParserException # min :: CustomParserException -> CustomParserException -> CustomParserException #
Ord StringLiteralParserException
Instance details Defined in Morley.Michelson.Parser.Error Methods compare :: StringLiteralParserException -> StringLiteralParserException -> Ordering # (<) :: StringLiteralParserException -> StringLiteralParserException -> Bool # (<=) :: StringLiteralParserException -> StringLiteralParserException -> Bool # (>) :: StringLiteralParserException -> StringLiteralParserException -> Bool # (>=) :: StringLiteralParserException -> StringLiteralParserException -> Bool # max :: StringLiteralParserException -> StringLiteralParserException -> StringLiteralParserException # min :: StringLiteralParserException -> StringLiteralParserException -> StringLiteralParserException #
Ord Positive
Instance details Defined in Morley.Util.Positive Methods compare :: Positive -> Positive -> Ordering # (<) :: Positive -> Positive -> Bool # (<=) :: Positive -> Positive -> Bool # (>) :: Positive -> Positive -> Bool # (>=) :: Positive -> Positive -> Bool # max :: Positive -> Positive -> Positive # min :: Positive -> Positive -> Positive #
Ord Never Source #
Instance details Defined in Lorentz.Value Methods compare :: Never -> Never -> Ordering # (<) :: Never -> Never -> Bool # (<=) :: Never -> Never -> Bool # (>) :: Never -> Never -> Bool # (>=) :: Never -> Never -> Bool # max :: Never -> Never -> Never # min :: Never -> Never -> Never #
Ord DViewDesc Source #
Instance details Defined in Lorentz.Doc Methods compare :: DViewDesc -> DViewDesc -> Ordering # (<) :: DViewDesc -> DViewDesc -> Bool # (<=) :: DViewDesc -> DViewDesc -> Bool # (>) :: DViewDesc -> DViewDesc -> Bool # (>=) :: DViewDesc -> DViewDesc -> Bool # max :: DViewDesc -> DViewDesc -> DViewDesc # min :: DViewDesc -> DViewDesc -> DViewDesc #
Ord DHashAlgorithm Source #
Instance details Defined in Lorentz.Bytes Methods compare :: DHashAlgorithm -> DHashAlgorithm -> Ordering # (<) :: DHashAlgorithm -> DHashAlgorithm -> Bool # (<=) :: DHashAlgorithm -> DHashAlgorithm -> Bool # (>) :: DHashAlgorithm -> DHashAlgorithm -> Bool # (>=) :: DHashAlgorithm -> DHashAlgorithm -> Bool # max :: DHashAlgorithm -> DHashAlgorithm -> DHashAlgorithm # min :: DHashAlgorithm -> DHashAlgorithm -> DHashAlgorithm #
Ord DError Source #
Instance details Defined in Lorentz.Errors Methods compare :: DError -> DError -> Ordering # (<) :: DError -> DError -> Bool # (<=) :: DError -> DError -> Bool # (>) :: DError -> DError -> Bool # (>=) :: DError -> DError -> Bool # max :: DError -> DError -> DError # min :: DError -> DError -> DError #
Ord Transformation
Instance details Defined in Morley.Util.Interpolate.Internal Methods compare :: Transformation -> Transformation -> Ordering # (<) :: Transformation -> Transformation -> Bool # (<=) :: Transformation -> Transformation -> Bool # (>) :: Transformation -> Transformation -> Bool # (>=) :: Transformation -> Transformation -> Bool # max :: Transformation -> Transformation -> Transformation # min :: Transformation -> Transformation -> Transformation #
Ord DDescribeErrorTagMap Source #
Instance details Defined in Lorentz.Errors.Numeric.Doc Methods compare :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Ordering # (<) :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Bool # (<=) :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Bool # (>) :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Bool # (>=) :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> Bool # max :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> DDescribeErrorTagMap # min :: DDescribeErrorTagMap -> DDescribeErrorTagMap -> DDescribeErrorTagMap #
Ord RemainingSteps
Instance details Defined in Morley.Michelson.Interpret Methods compare :: RemainingSteps -> RemainingSteps -> Ordering # (<) :: RemainingSteps -> RemainingSteps -> Bool # (<=) :: RemainingSteps -> RemainingSteps -> Bool # (>) :: RemainingSteps -> RemainingSteps -> Bool # (>=) :: RemainingSteps -> RemainingSteps -> Bool # max :: RemainingSteps -> RemainingSteps -> RemainingSteps # min :: RemainingSteps -> RemainingSteps -> RemainingSteps #
Ord OperationHash
Instance details Defined in Morley.Michelson.Typed.Operation Methods compare :: OperationHash -> OperationHash -> Ordering # (<) :: OperationHash -> OperationHash -> Bool # (<=) :: OperationHash -> OperationHash -> Bool # (>) :: OperationHash -> OperationHash -> Bool # (>=) :: OperationHash -> OperationHash -> Bool # max :: OperationHash -> OperationHash -> OperationHash # min :: OperationHash -> OperationHash -> OperationHash #
() :=> (Ord Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Bool #
() :=> (Ord Char)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Char #
() :=> (Ord Double)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Double #
() :=> (Ord Float)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Float #
() :=> (Ord Int)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Int #
() :=> (Ord Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Integer #
() :=> (Ord Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Natural #
() :=> (Ord Word)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Word #
() :=> (Ord ())
Instance details Defined in Data.Constraint Methods ins :: () :- Ord () #
() :=> (Ord (Dict a))
Instance details Defined in Data.Constraint Methods ins :: () :- Ord (Dict a) #
() :=> (Ord (a :- b))
Instance details Defined in Data.Constraint Methods ins :: () :- Ord (a :- b) #
Ord a => Ord [a]
Instance details Defined in GHC.Classes Methods compare :: [a] -> [a] -> Ordering # (<) :: [a] -> [a] -> Bool # (<=) :: [a] -> [a] -> Bool # (>) :: [a] -> [a] -> Bool # (>=) :: [a] -> [a] -> Bool # max :: [a] -> [a] -> [a] # min :: [a] -> [a] -> [a] #
Ord a => Ord (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Maybe Methods compare :: Maybe a -> Maybe a -> Ordering # (<) :: Maybe a -> Maybe a -> Bool # (<=) :: Maybe a -> Maybe a -> Bool # (>) :: Maybe a -> Maybe a -> Bool # (>=) :: Maybe a -> Maybe a -> Bool # max :: Maybe a -> Maybe a -> Maybe a # min :: Maybe a -> Maybe a -> Maybe a #
Integral a => Ord (Ratio a)	Since: base-2.0.1
Instance details Defined in GHC.Real Methods compare :: Ratio a -> Ratio a -> Ordering # (<) :: Ratio a -> Ratio a -> Bool # (<=) :: Ratio a -> Ratio a -> Bool # (>) :: Ratio a -> Ratio a -> Bool # (>=) :: Ratio a -> Ratio a -> Bool # max :: Ratio a -> Ratio a -> Ratio a # min :: Ratio a -> Ratio a -> Ratio a #
Ord (Ptr a)	Since: base-2.1
Instance details Defined in GHC.Ptr Methods compare :: Ptr a -> Ptr a -> Ordering # (<) :: Ptr a -> Ptr a -> Bool # (<=) :: Ptr a -> Ptr a -> Bool # (>) :: Ptr a -> Ptr a -> Bool # (>=) :: Ptr a -> Ptr a -> Bool # max :: Ptr a -> Ptr a -> Ptr a # min :: Ptr a -> Ptr a -> Ptr a #
Ord (FunPtr a)
Instance details Defined in GHC.Ptr Methods compare :: FunPtr a -> FunPtr a -> Ordering # (<) :: FunPtr a -> FunPtr a -> Bool # (<=) :: FunPtr a -> FunPtr a -> Bool # (>) :: FunPtr a -> FunPtr a -> Bool # (>=) :: FunPtr a -> FunPtr a -> Bool # max :: FunPtr a -> FunPtr a -> FunPtr a # min :: FunPtr a -> FunPtr a -> FunPtr a #
Ord p => Ord (Par1 p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: Par1 p -> Par1 p -> Ordering # (<) :: Par1 p -> Par1 p -> Bool # (<=) :: Par1 p -> Par1 p -> Bool # (>) :: Par1 p -> Par1 p -> Bool # (>=) :: Par1 p -> Par1 p -> Bool # max :: Par1 p -> Par1 p -> Par1 p # min :: Par1 p -> Par1 p -> Par1 p #
Ord a => Ord (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: First a -> First a -> Ordering # (<) :: First a -> First a -> Bool # (<=) :: First a -> First a -> Bool # (>) :: First a -> First a -> Bool # (>=) :: First a -> First a -> Bool # max :: First a -> First a -> First a # min :: First a -> First a -> First a #
Ord a => Ord (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Last a -> Last a -> Ordering # (<) :: Last a -> Last a -> Bool # (<=) :: Last a -> Last a -> Bool # (>) :: Last a -> Last a -> Bool # (>=) :: Last a -> Last a -> Bool # max :: Last a -> Last a -> Last a # min :: Last a -> Last a -> Last a #
Ord a => Ord (First' a)
Instance details Defined in Distribution.Compat.Semigroup Methods compare :: First' a -> First' a -> Ordering # (<) :: First' a -> First' a -> Bool # (<=) :: First' a -> First' a -> Bool # (>) :: First' a -> First' a -> Bool # (>=) :: First' a -> First' a -> Bool # max :: First' a -> First' a -> First' a # min :: First' a -> First' a -> First' a #
Ord a => Ord (Last' a)
Instance details Defined in Distribution.Compat.Semigroup Methods compare :: Last' a -> Last' a -> Ordering # (<) :: Last' a -> Last' a -> Bool # (<=) :: Last' a -> Last' a -> Bool # (>) :: Last' a -> Last' a -> Bool # (>=) :: Last' a -> Last' a -> Bool # max :: Last' a -> Last' a -> Last' a # min :: Last' a -> Last' a -> Last' a #
Ord a => Ord (Option' a)
Instance details Defined in Distribution.Compat.Semigroup Methods compare :: Option' a -> Option' a -> Ordering # (<) :: Option' a -> Option' a -> Bool # (<=) :: Option' a -> Option' a -> Bool # (>) :: Option' a -> Option' a -> Bool # (>=) :: Option' a -> Option' a -> Bool # max :: Option' a -> Option' a -> Option' a # min :: Option' a -> Option' a -> Option' a #
Ord a => Ord (Set a)
Instance details Defined in Data.Set.Internal Methods compare :: Set a -> Set a -> Ordering # (<) :: Set a -> Set a -> Bool # (<=) :: Set a -> Set a -> Bool # (>) :: Set a -> Set a -> Bool # (>=) :: Set a -> Set a -> Bool # max :: Set a -> Set a -> Set a # min :: Set a -> Set a -> Set a #
Ord a => Ord (NonEmpty a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods compare :: NonEmpty a -> NonEmpty a -> Ordering # (<) :: NonEmpty a -> NonEmpty a -> Bool # (<=) :: NonEmpty a -> NonEmpty a -> Bool # (>) :: NonEmpty a -> NonEmpty a -> Bool # (>=) :: NonEmpty a -> NonEmpty a -> Bool # max :: NonEmpty a -> NonEmpty a -> NonEmpty a # min :: NonEmpty a -> NonEmpty a -> NonEmpty a #
Ord a => Ord (Identity a)	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods compare :: Identity a -> Identity a -> Ordering # (<) :: Identity a -> Identity a -> Bool # (<=) :: Identity a -> Identity a -> Bool # (>) :: Identity a -> Identity a -> Bool # (>=) :: Identity a -> Identity a -> Bool # max :: Identity a -> Identity a -> Identity a # min :: Identity a -> Identity a -> Identity a #
Ord (ForeignPtr a)	Since: base-2.1
Instance details Defined in GHC.ForeignPtr Methods compare :: ForeignPtr a -> ForeignPtr a -> Ordering # (<) :: ForeignPtr a -> ForeignPtr a -> Bool # (<=) :: ForeignPtr a -> ForeignPtr a -> Bool # (>) :: ForeignPtr a -> ForeignPtr a -> Bool # (>=) :: ForeignPtr a -> ForeignPtr a -> Bool # max :: ForeignPtr a -> ForeignPtr a -> ForeignPtr a # min :: ForeignPtr a -> ForeignPtr a -> ForeignPtr a #
Ord a => Ord (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Min a -> Min a -> Ordering # (<) :: Min a -> Min a -> Bool # (<=) :: Min a -> Min a -> Bool # (>) :: Min a -> Min a -> Bool # (>=) :: Min a -> Min a -> Bool # max :: Min a -> Min a -> Min a # min :: Min a -> Min a -> Min a #
Ord a => Ord (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Max a -> Max a -> Ordering # (<) :: Max a -> Max a -> Bool # (<=) :: Max a -> Max a -> Bool # (>) :: Max a -> Max a -> Bool # (>=) :: Max a -> Max a -> Bool # max :: Max a -> Max a -> Max a # min :: Max a -> Max a -> Max a #
Ord m => Ord (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: WrappedMonoid m -> WrappedMonoid m -> Ordering # (<) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (<=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (>) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (>=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # max :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # min :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m #
Ord a => Ord (Option a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Option a -> Option a -> Ordering # (<) :: Option a -> Option a -> Bool # (<=) :: Option a -> Option a -> Bool # (>) :: Option a -> Option a -> Bool # (>=) :: Option a -> Option a -> Bool # max :: Option a -> Option a -> Option a # min :: Option a -> Option a -> Option a #
Ord a => Ord (ZipList a)	Since: base-4.7.0.0
Instance details Defined in Control.Applicative Methods compare :: ZipList a -> ZipList a -> Ordering # (<) :: ZipList a -> ZipList a -> Bool # (<=) :: ZipList a -> ZipList a -> Bool # (>) :: ZipList a -> ZipList a -> Bool # (>=) :: ZipList a -> ZipList a -> Bool # max :: ZipList a -> ZipList a -> ZipList a # min :: ZipList a -> ZipList a -> ZipList a #
Ord a => Ord (First a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods compare :: First a -> First a -> Ordering # (<) :: First a -> First a -> Bool # (<=) :: First a -> First a -> Bool # (>) :: First a -> First a -> Bool # (>=) :: First a -> First a -> Bool # max :: First a -> First a -> First a # min :: First a -> First a -> First a #
Ord a => Ord (Last a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods compare :: Last a -> Last a -> Ordering # (<) :: Last a -> Last a -> Bool # (<=) :: Last a -> Last a -> Bool # (>) :: Last a -> Last a -> Bool # (>=) :: Last a -> Last a -> Bool # max :: Last a -> Last a -> Last a # min :: Last a -> Last a -> Last a #
Ord a => Ord (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: Dual a -> Dual a -> Ordering # (<) :: Dual a -> Dual a -> Bool # (<=) :: Dual a -> Dual a -> Bool # (>) :: Dual a -> Dual a -> Bool # (>=) :: Dual a -> Dual a -> Bool # max :: Dual a -> Dual a -> Dual a # min :: Dual a -> Dual a -> Dual a #
Ord a => Ord (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: Sum a -> Sum a -> Ordering # (<) :: Sum a -> Sum a -> Bool # (<=) :: Sum a -> Sum a -> Bool # (>) :: Sum a -> Sum a -> Bool # (>=) :: Sum a -> Sum a -> Bool # max :: Sum a -> Sum a -> Sum a # min :: Sum a -> Sum a -> Sum a #
Ord a => Ord (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: Product a -> Product a -> Ordering # (<) :: Product a -> Product a -> Bool # (<=) :: Product a -> Product a -> Bool # (>) :: Product a -> Product a -> Bool # (>=) :: Product a -> Product a -> Bool # max :: Product a -> Product a -> Product a # min :: Product a -> Product a -> Product a #
Ord a => Ord (Down a)	Since: base-4.6.0.0
Instance details Defined in Data.Ord Methods compare :: Down a -> Down a -> Ordering # (<) :: Down a -> Down a -> Bool # (<=) :: Down a -> Down a -> Bool # (>) :: Down a -> Down a -> Bool # (>=) :: Down a -> Down a -> Bool # max :: Down a -> Down a -> Down a # min :: Down a -> Down a -> Down a #
Ord a => Ord (Array a)
Instance details Defined in Basement.BoxedArray Methods compare :: Array a -> Array a -> Ordering # (<) :: Array a -> Array a -> Bool # (<=) :: Array a -> Array a -> Bool # (>) :: Array a -> Array a -> Bool # (>=) :: Array a -> Array a -> Bool # max :: Array a -> Array a -> Array a # min :: Array a -> Array a -> Array a #
(PrimType ty, Ord ty) => Ord (UArray ty)
Instance details Defined in Basement.UArray.Base Methods compare :: UArray ty -> UArray ty -> Ordering # (<) :: UArray ty -> UArray ty -> Bool # (<=) :: UArray ty -> UArray ty -> Bool # (>) :: UArray ty -> UArray ty -> Bool # (>=) :: UArray ty -> UArray ty -> Bool # max :: UArray ty -> UArray ty -> UArray ty # min :: UArray ty -> UArray ty -> UArray ty #
(PrimType ty, Ord ty) => Ord (Block ty)
Instance details Defined in Basement.Block.Base Methods compare :: Block ty -> Block ty -> Ordering # (<) :: Block ty -> Block ty -> Bool # (<=) :: Block ty -> Block ty -> Bool # (>) :: Block ty -> Block ty -> Bool # (>=) :: Block ty -> Block ty -> Bool # max :: Block ty -> Block ty -> Block ty # min :: Block ty -> Block ty -> Block ty #
Ord (Offset ty)
Instance details Defined in Basement.Types.OffsetSize Methods compare :: Offset ty -> Offset ty -> Ordering # (<) :: Offset ty -> Offset ty -> Bool # (<=) :: Offset ty -> Offset ty -> Bool # (>) :: Offset ty -> Offset ty -> Bool # (>=) :: Offset ty -> Offset ty -> Bool # max :: Offset ty -> Offset ty -> Offset ty # min :: Offset ty -> Offset ty -> Offset ty #
Ord (CountOf ty)
Instance details Defined in Basement.Types.OffsetSize Methods compare :: CountOf ty -> CountOf ty -> Ordering # (<) :: CountOf ty -> CountOf ty -> Bool # (<=) :: CountOf ty -> CountOf ty -> Bool # (>) :: CountOf ty -> CountOf ty -> Bool # (>=) :: CountOf ty -> CountOf ty -> Bool # max :: CountOf ty -> CountOf ty -> CountOf ty # min :: CountOf ty -> CountOf ty -> CountOf ty #
Ord (Zn64 n)
Instance details Defined in Basement.Bounded Methods compare :: Zn64 n -> Zn64 n -> Ordering # (<) :: Zn64 n -> Zn64 n -> Bool # (<=) :: Zn64 n -> Zn64 n -> Bool # (>) :: Zn64 n -> Zn64 n -> Bool # (>=) :: Zn64 n -> Zn64 n -> Bool # max :: Zn64 n -> Zn64 n -> Zn64 n # min :: Zn64 n -> Zn64 n -> Zn64 n #
Ord (Zn n)
Instance details Defined in Basement.Bounded Methods compare :: Zn n -> Zn n -> Ordering # (<) :: Zn n -> Zn n -> Bool # (<=) :: Zn n -> Zn n -> Bool # (>) :: Zn n -> Zn n -> Bool # (>=) :: Zn n -> Zn n -> Bool # max :: Zn n -> Zn n -> Zn n # min :: Zn n -> Zn n -> Zn n #
Ord (Dict a)
Instance details Defined in Data.Constraint Methods compare :: Dict a -> Dict a -> Ordering # (<) :: Dict a -> Dict a -> Bool # (<=) :: Dict a -> Dict a -> Bool # (>) :: Dict a -> Dict a -> Bool # (>=) :: Dict a -> Dict a -> Bool # max :: Dict a -> Dict a -> Dict a # min :: Dict a -> Dict a -> Dict a #
Ord a => Ord (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods compare :: IntMap a -> IntMap a -> Ordering # (<) :: IntMap a -> IntMap a -> Bool # (<=) :: IntMap a -> IntMap a -> Bool # (>) :: IntMap a -> IntMap a -> Bool # (>=) :: IntMap a -> IntMap a -> Bool # max :: IntMap a -> IntMap a -> IntMap a # min :: IntMap a -> IntMap a -> IntMap a #
Ord a => Ord (Tree a)	Since: containers-0.6.5
Instance details Defined in Data.Tree Methods compare :: Tree a -> Tree a -> Ordering # (<) :: Tree a -> Tree a -> Bool # (<=) :: Tree a -> Tree a -> Bool # (>) :: Tree a -> Tree a -> Bool # (>=) :: Tree a -> Tree a -> Bool # max :: Tree a -> Tree a -> Tree a # min :: Tree a -> Tree a -> Tree a #
Ord a => Ord (Seq a)
Instance details Defined in Data.Sequence.Internal Methods compare :: Seq a -> Seq a -> Ordering # (<) :: Seq a -> Seq a -> Bool # (<=) :: Seq a -> Seq a -> Bool # (>) :: Seq a -> Seq a -> Bool # (>=) :: Seq a -> Seq a -> Bool # max :: Seq a -> Seq a -> Seq a # min :: Seq a -> Seq a -> Seq a #
Ord a => Ord (ViewL a)
Instance details Defined in Data.Sequence.Internal Methods compare :: ViewL a -> ViewL a -> Ordering # (<) :: ViewL a -> ViewL a -> Bool # (<=) :: ViewL a -> ViewL a -> Bool # (>) :: ViewL a -> ViewL a -> Bool # (>=) :: ViewL a -> ViewL a -> Bool # max :: ViewL a -> ViewL a -> ViewL a # min :: ViewL a -> ViewL a -> ViewL a #
Ord a => Ord (ViewR a)
Instance details Defined in Data.Sequence.Internal Methods compare :: ViewR a -> ViewR a -> Ordering # (<) :: ViewR a -> ViewR a -> Bool # (<=) :: ViewR a -> ViewR a -> Bool # (>) :: ViewR a -> ViewR a -> Bool # (>=) :: ViewR a -> ViewR a -> Bool # max :: ViewR a -> ViewR a -> ViewR a # min :: ViewR a -> ViewR a -> ViewR a #
Ord (Digest a)
Instance details Defined in Crypto.Hash.Types Methods compare :: Digest a -> Digest a -> Ordering # (<) :: Digest a -> Digest a -> Bool # (<=) :: Digest a -> Digest a -> Bool # (>) :: Digest a -> Digest a -> Bool # (>=) :: Digest a -> Digest a -> Bool # max :: Digest a -> Digest a -> Digest a # min :: Digest a -> Digest a -> Digest a #
Ord1 f => Ord (Fix f)
Instance details Defined in Data.Fix Methods compare :: Fix f -> Fix f -> Ordering # (<) :: Fix f -> Fix f -> Bool # (<=) :: Fix f -> Fix f -> Bool # (>) :: Fix f -> Fix f -> Bool # (>=) :: Fix f -> Fix f -> Bool # max :: Fix f -> Fix f -> Fix f # min :: Fix f -> Fix f -> Fix f #
(Functor f, Ord1 f) => Ord (Mu f)
Instance details Defined in Data.Fix Methods compare :: Mu f -> Mu f -> Ordering # (<) :: Mu f -> Mu f -> Bool # (<=) :: Mu f -> Mu f -> Bool # (>) :: Mu f -> Mu f -> Bool # (>=) :: Mu f -> Mu f -> Bool # max :: Mu f -> Mu f -> Mu f # min :: Mu f -> Mu f -> Mu f #
(Functor f, Ord1 f) => Ord (Nu f)
Instance details Defined in Data.Fix Methods compare :: Nu f -> Nu f -> Ordering # (<) :: Nu f -> Nu f -> Bool # (<=) :: Nu f -> Nu f -> Bool # (>) :: Nu f -> Nu f -> Bool # (>=) :: Nu f -> Nu f -> Bool # max :: Nu f -> Nu f -> Nu f # min :: Nu f -> Nu f -> Nu f #
Ord a => Ord (DNonEmpty a)
Instance details Defined in Data.DList.DNonEmpty.Internal Methods compare :: DNonEmpty a -> DNonEmpty a -> Ordering # (<) :: DNonEmpty a -> DNonEmpty a -> Bool # (<=) :: DNonEmpty a -> DNonEmpty a -> Bool # (>) :: DNonEmpty a -> DNonEmpty a -> Bool # (>=) :: DNonEmpty a -> DNonEmpty a -> Bool # max :: DNonEmpty a -> DNonEmpty a -> DNonEmpty a # min :: DNonEmpty a -> DNonEmpty a -> DNonEmpty a #
Ord a => Ord (DList a)
Instance details Defined in Data.DList.Internal Methods compare :: DList a -> DList a -> Ordering # (<) :: DList a -> DList a -> Bool # (<=) :: DList a -> DList a -> Bool # (>) :: DList a -> DList a -> Bool # (>=) :: DList a -> DList a -> Bool # max :: DList a -> DList a -> DList a # min :: DList a -> DList a -> DList a #
Ord a => Ord (Hex a)
Instance details Defined in Data.Text.Format.Types Methods compare :: Hex a -> Hex a -> Ordering # (<) :: Hex a -> Hex a -> Bool # (<=) :: Hex a -> Hex a -> Bool # (>) :: Hex a -> Hex a -> Bool # (>=) :: Hex a -> Hex a -> Bool # max :: Hex a -> Hex a -> Hex a # min :: Hex a -> Hex a -> Hex a #
Ord a => Ord (Shown a)
Instance details Defined in Data.Text.Format.Types Methods compare :: Shown a -> Shown a -> Ordering # (<) :: Shown a -> Shown a -> Bool # (<=) :: Shown a -> Shown a -> Bool # (>) :: Shown a -> Shown a -> Bool # (>=) :: Shown a -> Shown a -> Bool # max :: Shown a -> Shown a -> Shown a # min :: Shown a -> Shown a -> Shown a #
Ord (Prime p)
Instance details Defined in Data.Field.Galois.Prime Methods compare :: Prime p -> Prime p -> Ordering # (<) :: Prime p -> Prime p -> Bool # (<=) :: Prime p -> Prime p -> Bool # (>) :: Prime p -> Prime p -> Bool # (>=) :: Prime p -> Prime p -> Bool # max :: Prime p -> Prime p -> Prime p # min :: Prime p -> Prime p -> Prime p #
Ord (Binary p)
Instance details Defined in Data.Field.Galois.Binary Methods compare :: Binary p -> Binary p -> Ordering # (<) :: Binary p -> Binary p -> Bool # (<=) :: Binary p -> Binary p -> Bool # (>) :: Binary p -> Binary p -> Bool # (>=) :: Binary p -> Binary p -> Bool # max :: Binary p -> Binary p -> Binary p # min :: Binary p -> Binary p -> Binary p #
Ord a => Ord (Hashed a)
Instance details Defined in Data.Hashable.Class Methods compare :: Hashed a -> Hashed a -> Ordering # (<) :: Hashed a -> Hashed a -> Bool # (<=) :: Hashed a -> Hashed a -> Bool # (>) :: Hashed a -> Hashed a -> Bool # (>=) :: Hashed a -> Hashed a -> Bool # max :: Hashed a -> Hashed a -> Hashed a # min :: Hashed a -> Hashed a -> Hashed a #
(Prim a, Ord a) => Ord (Vector a)
Instance details Defined in Data.Vector.Primitive Methods compare :: Vector a -> Vector a -> Ordering # (<) :: Vector a -> Vector a -> Bool # (<=) :: Vector a -> Vector a -> Bool # (>) :: Vector a -> Vector a -> Bool # (>=) :: Vector a -> Vector a -> Bool # max :: Vector a -> Vector a -> Vector a # min :: Vector a -> Vector a -> Vector a #
(Storable a, Ord a) => Ord (Vector a)
Instance details Defined in Data.Vector.Storable Methods compare :: Vector a -> Vector a -> Ordering # (<) :: Vector a -> Vector a -> Bool # (<=) :: Vector a -> Vector a -> Bool # (>) :: Vector a -> Vector a -> Bool # (>=) :: Vector a -> Vector a -> Bool # max :: Vector a -> Vector a -> Vector a # min :: Vector a -> Vector a -> Vector a #
Ord a => Ord (HashSet a)
Instance details Defined in Data.HashSet.Internal Methods compare :: HashSet a -> HashSet a -> Ordering # (<) :: HashSet a -> HashSet a -> Bool # (<=) :: HashSet a -> HashSet a -> Bool # (>) :: HashSet a -> HashSet a -> Bool # (>=) :: HashSet a -> HashSet a -> Bool # max :: HashSet a -> HashSet a -> HashSet a # min :: HashSet a -> HashSet a -> HashSet a #
Ord a => Ord (Vector a)
Instance details Defined in Data.Vector Methods compare :: Vector a -> Vector a -> Ordering # (<) :: Vector a -> Vector a -> Bool # (<=) :: Vector a -> Vector a -> Bool # (>) :: Vector a -> Vector a -> Bool # (>=) :: Vector a -> Vector a -> Bool # max :: Vector a -> Vector a -> Vector a # min :: Vector a -> Vector a -> Vector a #
Ord t => Ord (ErrorItem t)
Instance details Defined in Text.Megaparsec.Error Methods compare :: ErrorItem t -> ErrorItem t -> Ordering # (<) :: ErrorItem t -> ErrorItem t -> Bool # (<=) :: ErrorItem t -> ErrorItem t -> Bool # (>) :: ErrorItem t -> ErrorItem t -> Bool # (>=) :: ErrorItem t -> ErrorItem t -> Bool # max :: ErrorItem t -> ErrorItem t -> ErrorItem t # min :: ErrorItem t -> ErrorItem t -> ErrorItem t #
Ord e => Ord (ErrorFancy e)
Instance details Defined in Text.Megaparsec.Error Methods compare :: ErrorFancy e -> ErrorFancy e -> Ordering # (<) :: ErrorFancy e -> ErrorFancy e -> Bool # (<=) :: ErrorFancy e -> ErrorFancy e -> Bool # (>) :: ErrorFancy e -> ErrorFancy e -> Bool # (>=) :: ErrorFancy e -> ErrorFancy e -> Bool # max :: ErrorFancy e -> ErrorFancy e -> ErrorFancy e # min :: ErrorFancy e -> ErrorFancy e -> ErrorFancy e #
Ord (Mod m)
Instance details Defined in Data.Mod Methods compare :: Mod m -> Mod m -> Ordering # (<) :: Mod m -> Mod m -> Bool # (<=) :: Mod m -> Mod m -> Bool # (>) :: Mod m -> Mod m -> Bool # (>=) :: Mod m -> Mod m -> Bool # max :: Mod m -> Mod m -> Mod m # min :: Mod m -> Mod m -> Mod m #
(Ord a, Prim a) => Ord (PrimArray a)	Lexicographic ordering. Subject to change between major versions. Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.PrimArray Methods compare :: PrimArray a -> PrimArray a -> Ordering # (<) :: PrimArray a -> PrimArray a -> Bool # (<=) :: PrimArray a -> PrimArray a -> Bool # (>) :: PrimArray a -> PrimArray a -> Bool # (>=) :: PrimArray a -> PrimArray a -> Bool # max :: PrimArray a -> PrimArray a -> PrimArray a # min :: PrimArray a -> PrimArray a -> PrimArray a #
Ord a => Ord (SmallArray a)	Lexicographic ordering. Subject to change between major versions.
Instance details Defined in Data.Primitive.SmallArray Methods compare :: SmallArray a -> SmallArray a -> Ordering # (<) :: SmallArray a -> SmallArray a -> Bool # (<=) :: SmallArray a -> SmallArray a -> Bool # (>) :: SmallArray a -> SmallArray a -> Bool # (>=) :: SmallArray a -> SmallArray a -> Bool # max :: SmallArray a -> SmallArray a -> SmallArray a # min :: SmallArray a -> SmallArray a -> SmallArray a #
Ord a => Ord (Array a)	Lexicographic ordering. Subject to change between major versions.
Instance details Defined in Data.Primitive.Array Methods compare :: Array a -> Array a -> Ordering # (<) :: Array a -> Array a -> Bool # (<=) :: Array a -> Array a -> Bool # (>) :: Array a -> Array a -> Bool # (>=) :: Array a -> Array a -> Bool # max :: Array a -> Array a -> Array a # min :: Array a -> Array a -> Array a #
Ord g => Ord (AtomicGen g)
Instance details Defined in System.Random.Stateful Methods compare :: AtomicGen g -> AtomicGen g -> Ordering # (<) :: AtomicGen g -> AtomicGen g -> Bool # (<=) :: AtomicGen g -> AtomicGen g -> Bool # (>) :: AtomicGen g -> AtomicGen g -> Bool # (>=) :: AtomicGen g -> AtomicGen g -> Bool # max :: AtomicGen g -> AtomicGen g -> AtomicGen g # min :: AtomicGen g -> AtomicGen g -> AtomicGen g #
Ord g => Ord (IOGen g)
Instance details Defined in System.Random.Stateful Methods compare :: IOGen g -> IOGen g -> Ordering # (<) :: IOGen g -> IOGen g -> Bool # (<=) :: IOGen g -> IOGen g -> Bool # (>) :: IOGen g -> IOGen g -> Bool # (>=) :: IOGen g -> IOGen g -> Bool # max :: IOGen g -> IOGen g -> IOGen g # min :: IOGen g -> IOGen g -> IOGen g #
Ord g => Ord (STGen g)
Instance details Defined in System.Random.Stateful Methods compare :: STGen g -> STGen g -> Ordering # (<) :: STGen g -> STGen g -> Bool # (<=) :: STGen g -> STGen g -> Bool # (>) :: STGen g -> STGen g -> Bool # (>=) :: STGen g -> STGen g -> Bool # max :: STGen g -> STGen g -> STGen g # min :: STGen g -> STGen g -> STGen g #
Ord g => Ord (StateGen g)
Instance details Defined in System.Random.Internal Methods compare :: StateGen g -> StateGen g -> Ordering # (<) :: StateGen g -> StateGen g -> Bool # (<=) :: StateGen g -> StateGen g -> Bool # (>) :: StateGen g -> StateGen g -> Bool # (>=) :: StateGen g -> StateGen g -> Bool # max :: StateGen g -> StateGen g -> StateGen g # min :: StateGen g -> StateGen g -> StateGen g #
Ord a => Ord (Add a)
Instance details Defined in Data.Semiring Methods compare :: Add a -> Add a -> Ordering # (<) :: Add a -> Add a -> Bool # (<=) :: Add a -> Add a -> Bool # (>) :: Add a -> Add a -> Bool # (>=) :: Add a -> Add a -> Bool # max :: Add a -> Add a -> Add a # min :: Add a -> Add a -> Add a #
Ord a => Ord (Mul a)
Instance details Defined in Data.Semiring Methods compare :: Mul a -> Mul a -> Ordering # (<) :: Mul a -> Mul a -> Bool # (<=) :: Mul a -> Mul a -> Bool # (>) :: Mul a -> Mul a -> Bool # (>=) :: Mul a -> Mul a -> Bool # max :: Mul a -> Mul a -> Mul a # min :: Mul a -> Mul a -> Mul a #
Ord a => Ord (WrappedNum a)
Instance details Defined in Data.Semiring Methods compare :: WrappedNum a -> WrappedNum a -> Ordering # (<) :: WrappedNum a -> WrappedNum a -> Bool # (<=) :: WrappedNum a -> WrappedNum a -> Bool # (>) :: WrappedNum a -> WrappedNum a -> Bool # (>=) :: WrappedNum a -> WrappedNum a -> Bool # max :: WrappedNum a -> WrappedNum a -> WrappedNum a # min :: WrappedNum a -> WrappedNum a -> WrappedNum a #
Ord (IntSetOf a)
Instance details Defined in Data.Semiring Methods compare :: IntSetOf a -> IntSetOf a -> Ordering # (<) :: IntSetOf a -> IntSetOf a -> Bool # (<=) :: IntSetOf a -> IntSetOf a -> Bool # (>) :: IntSetOf a -> IntSetOf a -> Bool # (>=) :: IntSetOf a -> IntSetOf a -> Bool # max :: IntSetOf a -> IntSetOf a -> IntSetOf a # min :: IntSetOf a -> IntSetOf a -> IntSetOf a #
Ord a => Ord (Maybe a)
Instance details Defined in Data.Strict.Maybe Methods compare :: Maybe a -> Maybe a -> Ordering # (<) :: Maybe a -> Maybe a -> Bool # (<=) :: Maybe a -> Maybe a -> Bool # (>) :: Maybe a -> Maybe a -> Bool # (>=) :: Maybe a -> Maybe a -> Bool # max :: Maybe a -> Maybe a -> Maybe a # min :: Maybe a -> Maybe a -> Maybe a #
Ord a => Ord (Identity a)
Instance details Defined in Data.Vinyl.Functor Methods compare :: Identity a -> Identity a -> Ordering # (<) :: Identity a -> Identity a -> Bool # (<=) :: Identity a -> Identity a -> Bool # (>) :: Identity a -> Identity a -> Bool # (>=) :: Identity a -> Identity a -> Bool # max :: Identity a -> Identity a -> Identity a # min :: Identity a -> Identity a -> Identity a #
Ord t => Ord (ElField '(s, t))
Instance details Defined in Data.Vinyl.Functor Methods compare :: ElField '(s, t) -> ElField '(s, t) -> Ordering # (<) :: ElField '(s, t) -> ElField '(s, t) -> Bool # (<=) :: ElField '(s, t) -> ElField '(s, t) -> Bool # (>) :: ElField '(s, t) -> ElField '(s, t) -> Bool # (>=) :: ElField '(s, t) -> ElField '(s, t) -> Bool # max :: ElField '(s, t) -> ElField '(s, t) -> ElField '(s, t) # min :: ElField '(s, t) -> ElField '(s, t) -> ElField '(s, t) #
Ord a => Ord (StringEncode a)
Instance details Defined in Morley.Micheline.Json Methods compare :: StringEncode a -> StringEncode a -> Ordering # (<) :: StringEncode a -> StringEncode a -> Bool # (<=) :: StringEncode a -> StringEncode a -> Bool # (>) :: StringEncode a -> StringEncode a -> Bool # (>=) :: StringEncode a -> StringEncode a -> Bool # max :: StringEncode a -> StringEncode a -> StringEncode a # min :: StringEncode a -> StringEncode a -> StringEncode a #
Ord a => Ord (ReadTicket a) Source #
Instance details Defined in Lorentz.Value Methods compare :: ReadTicket a -> ReadTicket a -> Ordering # (<) :: ReadTicket a -> ReadTicket a -> Bool # (<=) :: ReadTicket a -> ReadTicket a -> Bool # (>) :: ReadTicket a -> ReadTicket a -> Bool # (>=) :: ReadTicket a -> ReadTicket a -> Bool # max :: ReadTicket a -> ReadTicket a -> ReadTicket a # min :: ReadTicket a -> ReadTicket a -> ReadTicket a #
Ord (Packed a) Source #
Instance details Defined in Lorentz.Bytes Methods compare :: Packed a -> Packed a -> Ordering # (<) :: Packed a -> Packed a -> Bool # (<=) :: Packed a -> Packed a -> Bool # (>) :: Packed a -> Packed a -> Bool # (>=) :: Packed a -> Packed a -> Bool # max :: Packed a -> Packed a -> Packed a # min :: Packed a -> Packed a -> Packed a #
Class (Eq a) (Ord a)
Instance details Defined in Data.Constraint Methods cls :: Ord a :- Eq a #
(Integral a) :=> (Ord (Ratio a))
Instance details Defined in Data.Constraint Methods ins :: Integral a :- Ord (Ratio a) #
(Ord a) :=> (Ord (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Ord a :- Ord (Maybe a) #
(Ord a) :=> (Ord [a])
Instance details Defined in Data.Constraint Methods ins :: Ord a :- Ord [a] #
(Ord a) :=> (Ord (Identity a))
Instance details Defined in Data.Constraint Methods ins :: Ord a :- Ord (Identity a) #
(Ord a) :=> (Ord (Const a b))
Instance details Defined in Data.Constraint Methods ins :: Ord a :- Ord (Const a b) #
(Ord a, Ord b) => Ord (Either a b)	Since: base-2.1
Instance details Defined in Data.Either Methods compare :: Either a b -> Either a b -> Ordering # (<) :: Either a b -> Either a b -> Bool # (<=) :: Either a b -> Either a b -> Bool # (>) :: Either a b -> Either a b -> Bool # (>=) :: Either a b -> Either a b -> Bool # max :: Either a b -> Either a b -> Either a b # min :: Either a b -> Either a b -> Either a b #
Ord (V1 p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: V1 p -> V1 p -> Ordering # (<) :: V1 p -> V1 p -> Bool # (<=) :: V1 p -> V1 p -> Bool # (>) :: V1 p -> V1 p -> Bool # (>=) :: V1 p -> V1 p -> Bool # max :: V1 p -> V1 p -> V1 p # min :: V1 p -> V1 p -> V1 p #
Ord (U1 p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: U1 p -> U1 p -> Ordering # (<) :: U1 p -> U1 p -> Bool # (<=) :: U1 p -> U1 p -> Bool # (>) :: U1 p -> U1 p -> Bool # (>=) :: U1 p -> U1 p -> Bool # max :: U1 p -> U1 p -> U1 p # min :: U1 p -> U1 p -> U1 p #
Ord (TypeRep a)	Since: base-4.4.0.0
Instance details Defined in Data.Typeable.Internal Methods compare :: TypeRep a -> TypeRep a -> Ordering # (<) :: TypeRep a -> TypeRep a -> Bool # (<=) :: TypeRep a -> TypeRep a -> Bool # (>) :: TypeRep a -> TypeRep a -> Bool # (>=) :: TypeRep a -> TypeRep a -> Bool # max :: TypeRep a -> TypeRep a -> TypeRep a # min :: TypeRep a -> TypeRep a -> TypeRep a #
(Ord a, Ord b) => Ord (a, b)
Instance details Defined in GHC.Classes Methods compare :: (a, b) -> (a, b) -> Ordering # (<) :: (a, b) -> (a, b) -> Bool # (<=) :: (a, b) -> (a, b) -> Bool # (>) :: (a, b) -> (a, b) -> Bool # (>=) :: (a, b) -> (a, b) -> Bool # max :: (a, b) -> (a, b) -> (a, b) # min :: (a, b) -> (a, b) -> (a, b) #
(Ord k, Ord v) => Ord (Map k v)
Instance details Defined in Data.Map.Internal Methods compare :: Map k v -> Map k v -> Ordering # (<) :: Map k v -> Map k v -> Bool # (<=) :: Map k v -> Map k v -> Bool # (>) :: Map k v -> Map k v -> Bool # (>=) :: Map k v -> Map k v -> Bool # max :: Map k v -> Map k v -> Map k v # min :: Map k v -> Map k v -> Map k v #
Ord (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods compare :: Proxy s -> Proxy s -> Ordering # (<) :: Proxy s -> Proxy s -> Bool # (<=) :: Proxy s -> Proxy s -> Bool # (>) :: Proxy s -> Proxy s -> Bool # (>=) :: Proxy s -> Proxy s -> Bool # max :: Proxy s -> Proxy s -> Proxy s # min :: Proxy s -> Proxy s -> Proxy s #
Ord a => Ord (OddWord a n)
Instance details Defined in Data.Word.Odd Methods compare :: OddWord a n -> OddWord a n -> Ordering # (<) :: OddWord a n -> OddWord a n -> Bool # (<=) :: OddWord a n -> OddWord a n -> Bool # (>) :: OddWord a n -> OddWord a n -> Bool # (>=) :: OddWord a n -> OddWord a n -> Bool # max :: OddWord a n -> OddWord a n -> OddWord a n # min :: OddWord a n -> OddWord a n -> OddWord a n #
(Ord k, Ord v) => Ord (HashMap k v)	The ordering is total and consistent with the `Eq` instance. However, nothing else about the ordering is specified, and it may change from version to version of either this package or of hashable.
Instance details Defined in Data.HashMap.Internal Methods compare :: HashMap k v -> HashMap k v -> Ordering # (<) :: HashMap k v -> HashMap k v -> Bool # (<=) :: HashMap k v -> HashMap k v -> Bool # (>) :: HashMap k v -> HashMap k v -> Bool # (>=) :: HashMap k v -> HashMap k v -> Bool # max :: HashMap k v -> HashMap k v -> HashMap k v # min :: HashMap k v -> HashMap k v -> HashMap k v #
Ord (Fixed a)	Since: base-2.1
Instance details Defined in Data.Fixed Methods compare :: Fixed a -> Fixed a -> Ordering # (<) :: Fixed a -> Fixed a -> Bool # (<=) :: Fixed a -> Fixed a -> Bool # (>) :: Fixed a -> Fixed a -> Bool # (>=) :: Fixed a -> Fixed a -> Bool # max :: Fixed a -> Fixed a -> Fixed a # min :: Fixed a -> Fixed a -> Fixed a #
Ord a => Ord (Arg a b)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Arg a b -> Arg a b -> Ordering # (<) :: Arg a b -> Arg a b -> Bool # (<=) :: Arg a b -> Arg a b -> Bool # (>) :: Arg a b -> Arg a b -> Bool # (>=) :: Arg a b -> Arg a b -> Bool # max :: Arg a b -> Arg a b -> Arg a b # min :: Arg a b -> Arg a b -> Arg a b #
Ord a => Ord (ListN n a)
Instance details Defined in Basement.Sized.List Methods compare :: ListN n a -> ListN n a -> Ordering # (<) :: ListN n a -> ListN n a -> Bool # (<=) :: ListN n a -> ListN n a -> Bool # (>) :: ListN n a -> ListN n a -> Bool # (>=) :: ListN n a -> ListN n a -> Bool # max :: ListN n a -> ListN n a -> ListN n a # min :: ListN n a -> ListN n a -> ListN n a #
(Ord a, Ord b) => Ord (Bimap a b)
Instance details Defined in Data.Bimap Methods compare :: Bimap a b -> Bimap a b -> Ordering # (<) :: Bimap a b -> Bimap a b -> Bool # (<=) :: Bimap a b -> Bimap a b -> Bool # (>) :: Bimap a b -> Bimap a b -> Bool # (>=) :: Bimap a b -> Bimap a b -> Bool # max :: Bimap a b -> Bimap a b -> Bimap a b # min :: Bimap a b -> Bimap a b -> Bimap a b #
Ord (a :- b)	Assumes `IncoherentInstances` doesn't exist.
Instance details Defined in Data.Constraint Methods compare :: (a :- b) -> (a :- b) -> Ordering # (<) :: (a :- b) -> (a :- b) -> Bool # (<=) :: (a :- b) -> (a :- b) -> Bool # (>) :: (a :- b) -> (a :- b) -> Bool # (>=) :: (a :- b) -> (a :- b) -> Bool # max :: (a :- b) -> (a :- b) -> a :- b # min :: (a :- b) -> (a :- b) -> a :- b #
(Ord1 m, Ord a) => Ord (MaybeT m a)
Instance details Defined in Control.Monad.Trans.Maybe Methods compare :: MaybeT m a -> MaybeT m a -> Ordering # (<) :: MaybeT m a -> MaybeT m a -> Bool # (<=) :: MaybeT m a -> MaybeT m a -> Bool # (>) :: MaybeT m a -> MaybeT m a -> Bool # (>=) :: MaybeT m a -> MaybeT m a -> Bool # max :: MaybeT m a -> MaybeT m a -> MaybeT m a # min :: MaybeT m a -> MaybeT m a -> MaybeT m a #
(Ord1 f, Ord a) => Ord (Cofree f a)
Instance details Defined in Control.Comonad.Cofree Methods compare :: Cofree f a -> Cofree f a -> Ordering # (<) :: Cofree f a -> Cofree f a -> Bool # (<=) :: Cofree f a -> Cofree f a -> Bool # (>) :: Cofree f a -> Cofree f a -> Bool # (>=) :: Cofree f a -> Cofree f a -> Bool # max :: Cofree f a -> Cofree f a -> Cofree f a # min :: Cofree f a -> Cofree f a -> Cofree f a #
(Ord1 f, Ord a) => Ord (Free f a)
Instance details Defined in Control.Monad.Free Methods compare :: Free f a -> Free f a -> Ordering # (<) :: Free f a -> Free f a -> Bool # (<=) :: Free f a -> Free f a -> Bool # (>) :: Free f a -> Free f a -> Bool # (>=) :: Free f a -> Free f a -> Bool # max :: Free f a -> Free f a -> Free f a # min :: Free f a -> Free f a -> Free f a #
Ord k => Ord (RootsOfUnity n k)
Instance details Defined in Data.Field.Galois.Unity Methods compare :: RootsOfUnity n k -> RootsOfUnity n k -> Ordering # (<) :: RootsOfUnity n k -> RootsOfUnity n k -> Bool # (<=) :: RootsOfUnity n k -> RootsOfUnity n k -> Bool # (>) :: RootsOfUnity n k -> RootsOfUnity n k -> Bool # (>=) :: RootsOfUnity n k -> RootsOfUnity n k -> Bool # max :: RootsOfUnity n k -> RootsOfUnity n k -> RootsOfUnity n k # min :: RootsOfUnity n k -> RootsOfUnity n k -> RootsOfUnity n k #
Ord k => Ord (Extension p k)
Instance details Defined in Data.Field.Galois.Extension Methods compare :: Extension p k -> Extension p k -> Ordering # (<) :: Extension p k -> Extension p k -> Bool # (<=) :: Extension p k -> Extension p k -> Bool # (>) :: Extension p k -> Extension p k -> Bool # (>=) :: Extension p k -> Extension p k -> Bool # max :: Extension p k -> Extension p k -> Extension p k # min :: Extension p k -> Extension p k -> Extension p k #
(Ord1 f, Ord a) => Ord (Yoneda f a)
Instance details Defined in Data.Functor.Yoneda Methods compare :: Yoneda f a -> Yoneda f a -> Ordering # (<) :: Yoneda f a -> Yoneda f a -> Bool # (<=) :: Yoneda f a -> Yoneda f a -> Bool # (>) :: Yoneda f a -> Yoneda f a -> Bool # (>=) :: Yoneda f a -> Yoneda f a -> Bool # max :: Yoneda f a -> Yoneda f a -> Yoneda f a # min :: Yoneda f a -> Yoneda f a -> Yoneda f a #
Ord (v a) => Ord (Poly v a)
Instance details Defined in Data.Poly.Internal.Dense Methods compare :: Poly v a -> Poly v a -> Ordering # (<) :: Poly v a -> Poly v a -> Bool # (<=) :: Poly v a -> Poly v a -> Bool # (>) :: Poly v a -> Poly v a -> Bool # (>=) :: Poly v a -> Poly v a -> Bool # max :: Poly v a -> Poly v a -> Poly v a # min :: Poly v a -> Poly v a -> Poly v a #
Ord v => Ord (IntMapOf k v)
Instance details Defined in Data.Semiring Methods compare :: IntMapOf k v -> IntMapOf k v -> Ordering # (<) :: IntMapOf k v -> IntMapOf k v -> Bool # (<=) :: IntMapOf k v -> IntMapOf k v -> Bool # (>) :: IntMapOf k v -> IntMapOf k v -> Bool # (>=) :: IntMapOf k v -> IntMapOf k v -> Bool # max :: IntMapOf k v -> IntMapOf k v -> IntMapOf k v # min :: IntMapOf k v -> IntMapOf k v -> IntMapOf k v #
(Ord a, Ord b) => Ord (Pair a b)
Instance details Defined in Data.Strict.Tuple Methods compare :: Pair a b -> Pair a b -> Ordering # (<) :: Pair a b -> Pair a b -> Bool # (<=) :: Pair a b -> Pair a b -> Bool # (>) :: Pair a b -> Pair a b -> Bool # (>=) :: Pair a b -> Pair a b -> Bool # max :: Pair a b -> Pair a b -> Pair a b # min :: Pair a b -> Pair a b -> Pair a b #
(Ord a, Ord b) => Ord (These a b)
Instance details Defined in Data.Strict.These Methods compare :: These a b -> These a b -> Ordering # (<) :: These a b -> These a b -> Bool # (<=) :: These a b -> These a b -> Bool # (>) :: These a b -> These a b -> Bool # (>=) :: These a b -> These a b -> Bool # max :: These a b -> These a b -> These a b # min :: These a b -> These a b -> These a b #
(Ord a, Ord b) => Ord (Either a b)
Instance details Defined in Data.Strict.Either Methods compare :: Either a b -> Either a b -> Ordering # (<) :: Either a b -> Either a b -> Bool # (<=) :: Either a b -> Either a b -> Bool # (>) :: Either a b -> Either a b -> Bool # (>=) :: Either a b -> Either a b -> Bool # max :: Either a b -> Either a b -> Either a b # min :: Either a b -> Either a b -> Either a b #
(Ord a, Ord b) => Ord (These a b)
Instance details Defined in Data.These Methods compare :: These a b -> These a b -> Ordering # (<) :: These a b -> These a b -> Bool # (<=) :: These a b -> These a b -> Bool # (>) :: These a b -> These a b -> Bool # (>=) :: These a b -> These a b -> Bool # max :: These a b -> These a b -> These a b # min :: These a b -> These a b -> These a b #
(Ord n, Ord m) => Ord (ArithError n m)
Instance details Defined in Morley.Michelson.Typed.Arith Methods compare :: ArithError n m -> ArithError n m -> Ordering # (<) :: ArithError n m -> ArithError n m -> Bool # (<=) :: ArithError n m -> ArithError n m -> Bool # (>) :: ArithError n m -> ArithError n m -> Bool # (>=) :: ArithError n m -> ArithError n m -> Bool # max :: ArithError n m -> ArithError n m -> ArithError n m # min :: ArithError n m -> ArithError n m -> ArithError n m #
Comparable t => Ord (Value' instr t)
Instance details Defined in Morley.Michelson.Typed.Value Methods compare :: Value' instr t -> Value' instr t -> Ordering # (<) :: Value' instr t -> Value' instr t -> Bool # (<=) :: Value' instr t -> Value' instr t -> Bool # (>) :: Value' instr t -> Value' instr t -> Bool # (>=) :: Value' instr t -> Value' instr t -> Bool # max :: Value' instr t -> Value' instr t -> Value' instr t # min :: Value' instr t -> Value' instr t -> Value' instr t #
Ord a => Ord (SizedList' n a)
Instance details Defined in Morley.Util.SizedList Methods compare :: SizedList' n a -> SizedList' n a -> Ordering # (<) :: SizedList' n a -> SizedList' n a -> Bool # (<=) :: SizedList' n a -> SizedList' n a -> Bool # (>) :: SizedList' n a -> SizedList' n a -> Bool # (>=) :: SizedList' n a -> SizedList' n a -> Bool # max :: SizedList' n a -> SizedList' n a -> SizedList' n a # min :: SizedList' n a -> SizedList' n a -> SizedList' n a #
Ord (TAddress p vd) Source #
Instance details Defined in Lorentz.Address Methods compare :: TAddress p vd -> TAddress p vd -> Ordering # (<) :: TAddress p vd -> TAddress p vd -> Bool # (<=) :: TAddress p vd -> TAddress p vd -> Bool # (>) :: TAddress p vd -> TAddress p vd -> Bool # (>=) :: TAddress p vd -> TAddress p vd -> Bool # max :: TAddress p vd -> TAddress p vd -> TAddress p vd # min :: TAddress p vd -> TAddress p vd -> TAddress p vd #
Ord (NFixed p) Source #
Instance details Defined in Lorentz.Value Methods compare :: NFixed p -> NFixed p -> Ordering # (<) :: NFixed p -> NFixed p -> Bool # (<=) :: NFixed p -> NFixed p -> Bool # (>) :: NFixed p -> NFixed p -> Bool # (>=) :: NFixed p -> NFixed p -> Bool # max :: NFixed p -> NFixed p -> NFixed p # min :: NFixed p -> NFixed p -> NFixed p #
Ord (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Methods compare :: Hash alg a -> Hash alg a -> Ordering # (<) :: Hash alg a -> Hash alg a -> Bool # (<=) :: Hash alg a -> Hash alg a -> Bool # (>) :: Hash alg a -> Hash alg a -> Bool # (>=) :: Hash alg a -> Hash alg a -> Bool # max :: Hash alg a -> Hash alg a -> Hash alg a # min :: Hash alg a -> Hash alg a -> Hash alg a #
Class (Num a, Ord a) (Real a)
Instance details Defined in Data.Constraint Methods cls :: Real a :- (Num a, Ord a) #
(Ord a, Ord b) :=> (Ord (a, b))
Instance details Defined in Data.Constraint Methods ins :: (Ord a, Ord b) :- Ord (a, b) #
(Ord a, Ord b) :=> (Ord (Either a b))
Instance details Defined in Data.Constraint Methods ins :: (Ord a, Ord b) :- Ord (Either a b) #
Ord (f p) => Ord (Rec1 f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: Rec1 f p -> Rec1 f p -> Ordering # (<) :: Rec1 f p -> Rec1 f p -> Bool # (<=) :: Rec1 f p -> Rec1 f p -> Bool # (>) :: Rec1 f p -> Rec1 f p -> Bool # (>=) :: Rec1 f p -> Rec1 f p -> Bool # max :: Rec1 f p -> Rec1 f p -> Rec1 f p # min :: Rec1 f p -> Rec1 f p -> Rec1 f p #
Ord (URec (Ptr ()) p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: URec (Ptr ()) p -> URec (Ptr ()) p -> Ordering # (<) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (<=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (>) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (>=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # max :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p # min :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p #
Ord (URec Char p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: URec Char p -> URec Char p -> Ordering # (<) :: URec Char p -> URec Char p -> Bool # (<=) :: URec Char p -> URec Char p -> Bool # (>) :: URec Char p -> URec Char p -> Bool # (>=) :: URec Char p -> URec Char p -> Bool # max :: URec Char p -> URec Char p -> URec Char p # min :: URec Char p -> URec Char p -> URec Char p #
Ord (URec Double p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: URec Double p -> URec Double p -> Ordering # (<) :: URec Double p -> URec Double p -> Bool # (<=) :: URec Double p -> URec Double p -> Bool # (>) :: URec Double p -> URec Double p -> Bool # (>=) :: URec Double p -> URec Double p -> Bool # max :: URec Double p -> URec Double p -> URec Double p # min :: URec Double p -> URec Double p -> URec Double p #
Ord (URec Float p)
Instance details Defined in GHC.Generics Methods compare :: URec Float p -> URec Float p -> Ordering # (<) :: URec Float p -> URec Float p -> Bool # (<=) :: URec Float p -> URec Float p -> Bool # (>) :: URec Float p -> URec Float p -> Bool # (>=) :: URec Float p -> URec Float p -> Bool # max :: URec Float p -> URec Float p -> URec Float p # min :: URec Float p -> URec Float p -> URec Float p #
Ord (URec Int p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: URec Int p -> URec Int p -> Ordering # (<) :: URec Int p -> URec Int p -> Bool # (<=) :: URec Int p -> URec Int p -> Bool # (>) :: URec Int p -> URec Int p -> Bool # (>=) :: URec Int p -> URec Int p -> Bool # max :: URec Int p -> URec Int p -> URec Int p # min :: URec Int p -> URec Int p -> URec Int p #
Ord (URec Word p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: URec Word p -> URec Word p -> Ordering # (<) :: URec Word p -> URec Word p -> Bool # (<=) :: URec Word p -> URec Word p -> Bool # (>) :: URec Word p -> URec Word p -> Bool # (>=) :: URec Word p -> URec Word p -> Bool # max :: URec Word p -> URec Word p -> URec Word p # min :: URec Word p -> URec Word p -> URec Word p #
(Ord a, Ord b, Ord c) => Ord (a, b, c)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c) -> (a, b, c) -> Ordering # (<) :: (a, b, c) -> (a, b, c) -> Bool # (<=) :: (a, b, c) -> (a, b, c) -> Bool # (>) :: (a, b, c) -> (a, b, c) -> Bool # (>=) :: (a, b, c) -> (a, b, c) -> Bool # max :: (a, b, c) -> (a, b, c) -> (a, b, c) # min :: (a, b, c) -> (a, b, c) -> (a, b, c) #
Ord a => Ord (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods compare :: Const a b -> Const a b -> Ordering # (<) :: Const a b -> Const a b -> Bool # (<=) :: Const a b -> Const a b -> Bool # (>) :: Const a b -> Const a b -> Bool # (>=) :: Const a b -> Const a b -> Bool # max :: Const a b -> Const a b -> Const a b # min :: Const a b -> Const a b -> Const a b #
Ord (f a) => Ord (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods compare :: Ap f a -> Ap f a -> Ordering # (<) :: Ap f a -> Ap f a -> Bool # (<=) :: Ap f a -> Ap f a -> Bool # (>) :: Ap f a -> Ap f a -> Bool # (>=) :: Ap f a -> Ap f a -> Bool # max :: Ap f a -> Ap f a -> Ap f a # min :: Ap f a -> Ap f a -> Ap f a #
Ord (f a) => Ord (Alt f a)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods compare :: Alt f a -> Alt f a -> Ordering # (<) :: Alt f a -> Alt f a -> Bool # (<=) :: Alt f a -> Alt f a -> Bool # (>) :: Alt f a -> Alt f a -> Bool # (>=) :: Alt f a -> Alt f a -> Bool # max :: Alt f a -> Alt f a -> Alt f a # min :: Alt f a -> Alt f a -> Alt f a #
Ord (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods compare :: (a :~: b) -> (a :~: b) -> Ordering # (<) :: (a :~: b) -> (a :~: b) -> Bool # (<=) :: (a :~: b) -> (a :~: b) -> Bool # (>) :: (a :~: b) -> (a :~: b) -> Bool # (>=) :: (a :~: b) -> (a :~: b) -> Bool # max :: (a :~: b) -> (a :~: b) -> a :~: b # min :: (a :~: b) -> (a :~: b) -> a :~: b #
Ord (p a a) => Ord (Join p a)
Instance details Defined in Data.Bifunctor.Join Methods compare :: Join p a -> Join p a -> Ordering # (<) :: Join p a -> Join p a -> Bool # (<=) :: Join p a -> Join p a -> Bool # (>) :: Join p a -> Join p a -> Bool # (>=) :: Join p a -> Join p a -> Bool # max :: Join p a -> Join p a -> Join p a # min :: Join p a -> Join p a -> Join p a #
Ord (p (Fix p a) a) => Ord (Fix p a)
Instance details Defined in Data.Bifunctor.Fix Methods compare :: Fix p a -> Fix p a -> Ordering # (<) :: Fix p a -> Fix p a -> Bool # (<=) :: Fix p a -> Fix p a -> Bool # (>) :: Fix p a -> Fix p a -> Bool # (>=) :: Fix p a -> Fix p a -> Bool # max :: Fix p a -> Fix p a -> Fix p a # min :: Fix p a -> Fix p a -> Fix p a #
(Ord1 f, Ord a) => Ord (IdentityT f a)
Instance details Defined in Control.Monad.Trans.Identity Methods compare :: IdentityT f a -> IdentityT f a -> Ordering # (<) :: IdentityT f a -> IdentityT f a -> Bool # (<=) :: IdentityT f a -> IdentityT f a -> Bool # (>) :: IdentityT f a -> IdentityT f a -> Bool # (>=) :: IdentityT f a -> IdentityT f a -> Bool # max :: IdentityT f a -> IdentityT f a -> IdentityT f a # min :: IdentityT f a -> IdentityT f a -> IdentityT f a #
(Ord e, Ord1 m, Ord a) => Ord (ExceptT e m a)
Instance details Defined in Control.Monad.Trans.Except Methods compare :: ExceptT e m a -> ExceptT e m a -> Ordering # (<) :: ExceptT e m a -> ExceptT e m a -> Bool # (<=) :: ExceptT e m a -> ExceptT e m a -> Bool # (>) :: ExceptT e m a -> ExceptT e m a -> Bool # (>=) :: ExceptT e m a -> ExceptT e m a -> Bool # max :: ExceptT e m a -> ExceptT e m a -> ExceptT e m a # min :: ExceptT e m a -> ExceptT e m a -> ExceptT e m a #
(Ord a, Ord (f b)) => Ord (FreeF f a b)
Instance details Defined in Control.Monad.Trans.Free Methods compare :: FreeF f a b -> FreeF f a b -> Ordering # (<) :: FreeF f a b -> FreeF f a b -> Bool # (<=) :: FreeF f a b -> FreeF f a b -> Bool # (>) :: FreeF f a b -> FreeF f a b -> Bool # (>=) :: FreeF f a b -> FreeF f a b -> Bool # max :: FreeF f a b -> FreeF f a b -> FreeF f a b # min :: FreeF f a b -> FreeF f a b -> FreeF f a b #
(Ord1 f, Ord1 m, Ord a) => Ord (FreeT f m a)
Instance details Defined in Control.Monad.Trans.Free Methods compare :: FreeT f m a -> FreeT f m a -> Ordering # (<) :: FreeT f m a -> FreeT f m a -> Bool # (<=) :: FreeT f m a -> FreeT f m a -> Bool # (>) :: FreeT f m a -> FreeT f m a -> Bool # (>=) :: FreeT f m a -> FreeT f m a -> Bool # max :: FreeT f m a -> FreeT f m a -> FreeT f m a # min :: FreeT f m a -> FreeT f m a -> FreeT f m a #
(Ord a, Ord (f b)) => Ord (CofreeF f a b)
Instance details Defined in Control.Comonad.Trans.Cofree Methods compare :: CofreeF f a b -> CofreeF f a b -> Ordering # (<) :: CofreeF f a b -> CofreeF f a b -> Bool # (<=) :: CofreeF f a b -> CofreeF f a b -> Bool # (>) :: CofreeF f a b -> CofreeF f a b -> Bool # (>=) :: CofreeF f a b -> CofreeF f a b -> Bool # max :: CofreeF f a b -> CofreeF f a b -> CofreeF f a b # min :: CofreeF f a b -> CofreeF f a b -> CofreeF f a b #
Ord (w (CofreeF f a (CofreeT f w a))) => Ord (CofreeT f w a)
Instance details Defined in Control.Comonad.Trans.Cofree Methods compare :: CofreeT f w a -> CofreeT f w a -> Ordering # (<) :: CofreeT f w a -> CofreeT f w a -> Bool # (<=) :: CofreeT f w a -> CofreeT f w a -> Bool # (>) :: CofreeT f w a -> CofreeT f w a -> Bool # (>=) :: CofreeT f w a -> CofreeT f w a -> Bool # max :: CofreeT f w a -> CofreeT f w a -> CofreeT f w a # min :: CofreeT f w a -> CofreeT f w a -> CofreeT f w a #
(Ord e, Ord1 m, Ord a) => Ord (ErrorT e m a)
Instance details Defined in Control.Monad.Trans.Error Methods compare :: ErrorT e m a -> ErrorT e m a -> Ordering # (<) :: ErrorT e m a -> ErrorT e m a -> Bool # (<=) :: ErrorT e m a -> ErrorT e m a -> Bool # (>) :: ErrorT e m a -> ErrorT e m a -> Bool # (>=) :: ErrorT e m a -> ErrorT e m a -> Bool # max :: ErrorT e m a -> ErrorT e m a -> ErrorT e m a # min :: ErrorT e m a -> ErrorT e m a -> ErrorT e m a #
Ord b => Ord (Tagged s b)
Instance details Defined in Data.Tagged Methods compare :: Tagged s b -> Tagged s b -> Ordering # (<) :: Tagged s b -> Tagged s b -> Bool # (<=) :: Tagged s b -> Tagged s b -> Bool # (>) :: Tagged s b -> Tagged s b -> Bool # (>=) :: Tagged s b -> Tagged s b -> Bool # max :: Tagged s b -> Tagged s b -> Tagged s b # min :: Tagged s b -> Tagged s b -> Tagged s b #
(Ord1 f, Ord1 g, Ord a) => Ord (These1 f g a)
Instance details Defined in Data.Functor.These Methods compare :: These1 f g a -> These1 f g a -> Ordering # (<) :: These1 f g a -> These1 f g a -> Bool # (<=) :: These1 f g a -> These1 f g a -> Bool # (>) :: These1 f g a -> These1 f g a -> Bool # (>=) :: These1 f g a -> These1 f g a -> Bool # max :: These1 f g a -> These1 f g a -> These1 f g a # min :: These1 f g a -> These1 f g a -> These1 f g a #
(RPureConstrained (IndexableField rs) rs, RecApplicative rs, Ord (Rec f rs)) => Ord (ARec f rs)
Instance details Defined in Data.Vinyl.ARec.Internal Methods compare :: ARec f rs -> ARec f rs -> Ordering # (<) :: ARec f rs -> ARec f rs -> Bool # (<=) :: ARec f rs -> ARec f rs -> Bool # (>) :: ARec f rs -> ARec f rs -> Bool # (>=) :: ARec f rs -> ARec f rs -> Bool # max :: ARec f rs -> ARec f rs -> ARec f rs # min :: ARec f rs -> ARec f rs -> ARec f rs #
Ord (Rec f ('[] :: [u]))
Instance details Defined in Data.Vinyl.Core Methods compare :: Rec f '[] -> Rec f '[] -> Ordering # (<) :: Rec f '[] -> Rec f '[] -> Bool # (<=) :: Rec f '[] -> Rec f '[] -> Bool # (>) :: Rec f '[] -> Rec f '[] -> Bool # (>=) :: Rec f '[] -> Rec f '[] -> Bool # max :: Rec f '[] -> Rec f '[] -> Rec f '[] # min :: Rec f '[] -> Rec f '[] -> Rec f '[] #
(Ord (f r), Ord (Rec f rs)) => Ord (Rec f (r ': rs))
Instance details Defined in Data.Vinyl.Core Methods compare :: Rec f (r ': rs) -> Rec f (r ': rs) -> Ordering # (<) :: Rec f (r ': rs) -> Rec f (r ': rs) -> Bool # (<=) :: Rec f (r ': rs) -> Rec f (r ': rs) -> Bool # (>) :: Rec f (r ': rs) -> Rec f (r ': rs) -> Bool # (>=) :: Rec f (r ': rs) -> Rec f (r ': rs) -> Bool # max :: Rec f (r ': rs) -> Rec f (r ': rs) -> Rec f (r ': rs) # min :: Rec f (r ': rs) -> Rec f (r ': rs) -> Rec f (r ': rs) #
Ord c => Ord (K1 i c p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: K1 i c p -> K1 i c p -> Ordering # (<) :: K1 i c p -> K1 i c p -> Bool # (<=) :: K1 i c p -> K1 i c p -> Bool # (>) :: K1 i c p -> K1 i c p -> Bool # (>=) :: K1 i c p -> K1 i c p -> Bool # max :: K1 i c p -> K1 i c p -> K1 i c p # min :: K1 i c p -> K1 i c p -> K1 i c p #
(Ord (f p), Ord (g p)) => Ord ((f :+: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: (f :+: g) p -> (f :+: g) p -> Ordering # (<) :: (f :+: g) p -> (f :+: g) p -> Bool # (<=) :: (f :+: g) p -> (f :+: g) p -> Bool # (>) :: (f :+: g) p -> (f :+: g) p -> Bool # (>=) :: (f :+: g) p -> (f :+: g) p -> Bool # max :: (f :+: g) p -> (f :+: g) p -> (f :+: g) p # min :: (f :+: g) p -> (f :+: g) p -> (f :+: g) p #
(Ord (f p), Ord (g p)) => Ord ((f :*: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: (f :: g) p -> (f :: g) p -> Ordering # (<) :: (f :: g) p -> (f :: g) p -> Bool # (<=) :: (f :: g) p -> (f :: g) p -> Bool # (>) :: (f :: g) p -> (f :: g) p -> Bool # (>=) :: (f :: g) p -> (f :: g) p -> Bool # max :: (f :: g) p -> (f :: g) p -> (f :: g) p # min :: (f :: g) p -> (f :: g) p -> (f :: g) p #
(Ord a, Ord b, Ord c, Ord d) => Ord (a, b, c, d)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d) -> (a, b, c, d) -> Ordering # (<) :: (a, b, c, d) -> (a, b, c, d) -> Bool # (<=) :: (a, b, c, d) -> (a, b, c, d) -> Bool # (>) :: (a, b, c, d) -> (a, b, c, d) -> Bool # (>=) :: (a, b, c, d) -> (a, b, c, d) -> Bool # max :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) # min :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) #
(Ord1 f, Ord1 g, Ord a) => Ord (Product f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods compare :: Product f g a -> Product f g a -> Ordering # (<) :: Product f g a -> Product f g a -> Bool # (<=) :: Product f g a -> Product f g a -> Bool # (>) :: Product f g a -> Product f g a -> Bool # (>=) :: Product f g a -> Product f g a -> Bool # max :: Product f g a -> Product f g a -> Product f g a # min :: Product f g a -> Product f g a -> Product f g a #
(Ord1 f, Ord1 g, Ord a) => Ord (Sum f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Sum Methods compare :: Sum f g a -> Sum f g a -> Ordering # (<) :: Sum f g a -> Sum f g a -> Bool # (<=) :: Sum f g a -> Sum f g a -> Bool # (>) :: Sum f g a -> Sum f g a -> Bool # (>=) :: Sum f g a -> Sum f g a -> Bool # max :: Sum f g a -> Sum f g a -> Sum f g a # min :: Sum f g a -> Sum f g a -> Sum f g a #
Ord (a :~~: b)	Since: base-4.10.0.0
Instance details Defined in Data.Type.Equality Methods compare :: (a :~~: b) -> (a :~~: b) -> Ordering # (<) :: (a :~~: b) -> (a :~~: b) -> Bool # (<=) :: (a :~~: b) -> (a :~~: b) -> Bool # (>) :: (a :~~: b) -> (a :~~: b) -> Bool # (>=) :: (a :~~: b) -> (a :~~: b) -> Bool # max :: (a :~~: b) -> (a :~~: b) -> a :~~: b # min :: (a :~~: b) -> (a :~~: b) -> a :~~: b #
Ord (f p) => Ord (M1 i c f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: M1 i c f p -> M1 i c f p -> Ordering # (<) :: M1 i c f p -> M1 i c f p -> Bool # (<=) :: M1 i c f p -> M1 i c f p -> Bool # (>) :: M1 i c f p -> M1 i c f p -> Bool # (>=) :: M1 i c f p -> M1 i c f p -> Bool # max :: M1 i c f p -> M1 i c f p -> M1 i c f p # min :: M1 i c f p -> M1 i c f p -> M1 i c f p #
Ord (f (g p)) => Ord ((f :.: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: (f :.: g) p -> (f :.: g) p -> Ordering # (<) :: (f :.: g) p -> (f :.: g) p -> Bool # (<=) :: (f :.: g) p -> (f :.: g) p -> Bool # (>) :: (f :.: g) p -> (f :.: g) p -> Bool # (>=) :: (f :.: g) p -> (f :.: g) p -> Bool # max :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p # min :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p #
(Ord a, Ord b, Ord c, Ord d, Ord e) => Ord (a, b, c, d, e)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e) -> (a, b, c, d, e) -> Ordering # (<) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # (<=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # (>) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # (>=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # max :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) # min :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) #
(Ord1 f, Ord1 g, Ord a) => Ord (Compose f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods compare :: Compose f g a -> Compose f g a -> Ordering # (<) :: Compose f g a -> Compose f g a -> Bool # (<=) :: Compose f g a -> Compose f g a -> Bool # (>) :: Compose f g a -> Compose f g a -> Bool # (>=) :: Compose f g a -> Compose f g a -> Bool # max :: Compose f g a -> Compose f g a -> Compose f g a # min :: Compose f g a -> Compose f g a -> Compose f g a #
Ord (p a b) => Ord (WrappedBifunctor p a b)
Instance details Defined in Data.Bifunctor.Wrapped Methods compare :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Ordering # (<) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # (<=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # (>) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # (>=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # max :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> WrappedBifunctor p a b # min :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> WrappedBifunctor p a b #
Ord (g b) => Ord (Joker g a b)
Instance details Defined in Data.Bifunctor.Joker Methods compare :: Joker g a b -> Joker g a b -> Ordering # (<) :: Joker g a b -> Joker g a b -> Bool # (<=) :: Joker g a b -> Joker g a b -> Bool # (>) :: Joker g a b -> Joker g a b -> Bool # (>=) :: Joker g a b -> Joker g a b -> Bool # max :: Joker g a b -> Joker g a b -> Joker g a b # min :: Joker g a b -> Joker g a b -> Joker g a b #
Ord (p b a) => Ord (Flip p a b)
Instance details Defined in Data.Bifunctor.Flip Methods compare :: Flip p a b -> Flip p a b -> Ordering # (<) :: Flip p a b -> Flip p a b -> Bool # (<=) :: Flip p a b -> Flip p a b -> Bool # (>) :: Flip p a b -> Flip p a b -> Bool # (>=) :: Flip p a b -> Flip p a b -> Bool # max :: Flip p a b -> Flip p a b -> Flip p a b # min :: Flip p a b -> Flip p a b -> Flip p a b #
Ord (f a) => Ord (Clown f a b)
Instance details Defined in Data.Bifunctor.Clown Methods compare :: Clown f a b -> Clown f a b -> Ordering # (<) :: Clown f a b -> Clown f a b -> Bool # (<=) :: Clown f a b -> Clown f a b -> Bool # (>) :: Clown f a b -> Clown f a b -> Bool # (>=) :: Clown f a b -> Clown f a b -> Bool # max :: Clown f a b -> Clown f a b -> Clown f a b # min :: Clown f a b -> Clown f a b -> Clown f a b #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => Ord (a, b, c, d, e, f)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Ordering # (<) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # (<=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # (>) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # (>=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # max :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) # min :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) #
(Ord (p a b), Ord (q a b)) => Ord (Sum p q a b)
Instance details Defined in Data.Bifunctor.Sum Methods compare :: Sum p q a b -> Sum p q a b -> Ordering # (<) :: Sum p q a b -> Sum p q a b -> Bool # (<=) :: Sum p q a b -> Sum p q a b -> Bool # (>) :: Sum p q a b -> Sum p q a b -> Bool # (>=) :: Sum p q a b -> Sum p q a b -> Bool # max :: Sum p q a b -> Sum p q a b -> Sum p q a b # min :: Sum p q a b -> Sum p q a b -> Sum p q a b #
(Ord (f a b), Ord (g a b)) => Ord (Product f g a b)
Instance details Defined in Data.Bifunctor.Product Methods compare :: Product f g a b -> Product f g a b -> Ordering # (<) :: Product f g a b -> Product f g a b -> Bool # (<=) :: Product f g a b -> Product f g a b -> Bool # (>) :: Product f g a b -> Product f g a b -> Bool # (>=) :: Product f g a b -> Product f g a b -> Bool # max :: Product f g a b -> Product f g a b -> Product f g a b # min :: Product f g a b -> Product f g a b -> Product f g a b #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => Ord (a, b, c, d, e, f, g)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Ordering # (<) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # (<=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # (>) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # (>=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # max :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) # min :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) #
Ord (f (p a b)) => Ord (Tannen f p a b)
Instance details Defined in Data.Bifunctor.Tannen Methods compare :: Tannen f p a b -> Tannen f p a b -> Ordering # (<) :: Tannen f p a b -> Tannen f p a b -> Bool # (<=) :: Tannen f p a b -> Tannen f p a b -> Bool # (>) :: Tannen f p a b -> Tannen f p a b -> Bool # (>=) :: Tannen f p a b -> Tannen f p a b -> Bool # max :: Tannen f p a b -> Tannen f p a b -> Tannen f p a b # min :: Tannen f p a b -> Tannen f p a b -> Tannen f p a b #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h) => Ord (a, b, c, d, e, f, g, h)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Ordering # (<) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # (<=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # (>) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # (>=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # max :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) # min :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i) => Ord (a, b, c, d, e, f, g, h, i)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # max :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) # min :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) #
Ord (p (f a) (g b)) => Ord (Biff p f g a b)
Instance details Defined in Data.Bifunctor.Biff Methods compare :: Biff p f g a b -> Biff p f g a b -> Ordering # (<) :: 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 # (>) :: 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 # max :: Biff p f g a b -> Biff p f g a b -> Biff p f g a b # min :: Biff p f g a b -> Biff p f g a b -> Biff p f g a b #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j) => Ord (a, b, c, d, e, f, g, h, i, j)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) # min :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k) => Ord (a, b, c, d, e, f, g, h, i, j, k)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) # min :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l) => Ord (a, b, c, d, e, f, g, h, i, j, k, l)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) # min :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) # min :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m, Ord n) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m, n)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # min :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m, Ord n, Ord o) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # min :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #

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

Bounded Bool	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Bool # maxBound :: Bool #
Bounded Char	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Char # maxBound :: Char #
Bounded Int	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Int # maxBound :: Int #
Bounded Int8	Since: base-2.1
Instance details Defined in GHC.Int Methods minBound :: Int8 # maxBound :: Int8 #
Bounded Int16	Since: base-2.1
Instance details Defined in GHC.Int Methods minBound :: Int16 # maxBound :: Int16 #
Bounded Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods minBound :: Int32 # maxBound :: Int32 #
Bounded Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods minBound :: Int64 # maxBound :: Int64 #
Bounded Ordering	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Ordering # maxBound :: Ordering #
Bounded Word	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Word # maxBound :: Word #
Bounded Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods minBound :: Word8 # maxBound :: Word8 #
Bounded Word16	Since: base-2.1
Instance details Defined in GHC.Word Methods minBound :: Word16 # maxBound :: Word16 #
Bounded Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods minBound :: Word32 # maxBound :: Word32 #
Bounded Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods minBound :: Word64 # maxBound :: Word64 #
Bounded VecCount	Since: base-4.10.0.0
Instance details Defined in GHC.Enum Methods minBound :: VecCount # maxBound :: VecCount #
Bounded VecElem	Since: base-4.10.0.0
Instance details Defined in GHC.Enum Methods minBound :: VecElem # maxBound :: VecElem #
Bounded ()	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: () # maxBound :: () #
Bounded KnownExtension
Instance details Defined in Language.Haskell.Extension Methods minBound :: KnownExtension # maxBound :: KnownExtension #
Bounded CabalSpecVersion
Instance details Defined in Distribution.CabalSpecVersion Methods minBound :: CabalSpecVersion # maxBound :: CabalSpecVersion #
Bounded PWarnType
Instance details Defined in Distribution.Parsec.Warning Methods minBound :: PWarnType # maxBound :: PWarnType #
Bounded Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: Any # maxBound :: Any #
Bounded All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: All # maxBound :: All #
Bounded Associativity	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods minBound :: Associativity # maxBound :: Associativity #
Bounded SourceUnpackedness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods minBound :: SourceUnpackedness # maxBound :: SourceUnpackedness #
Bounded SourceStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods minBound :: SourceStrictness # maxBound :: SourceStrictness #
Bounded DecidedStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods minBound :: DecidedStrictness # maxBound :: DecidedStrictness #
Bounded CChar
Instance details Defined in Foreign.C.Types Methods minBound :: CChar # maxBound :: CChar #
Bounded CSChar
Instance details Defined in Foreign.C.Types Methods minBound :: CSChar # maxBound :: CSChar #
Bounded CUChar
Instance details Defined in Foreign.C.Types Methods minBound :: CUChar # maxBound :: CUChar #
Bounded CShort
Instance details Defined in Foreign.C.Types Methods minBound :: CShort # maxBound :: CShort #
Bounded CUShort
Instance details Defined in Foreign.C.Types Methods minBound :: CUShort # maxBound :: CUShort #
Bounded CInt
Instance details Defined in Foreign.C.Types Methods minBound :: CInt # maxBound :: CInt #
Bounded CUInt
Instance details Defined in Foreign.C.Types Methods minBound :: CUInt # maxBound :: CUInt #
Bounded CLong
Instance details Defined in Foreign.C.Types Methods minBound :: CLong # maxBound :: CLong #
Bounded CULong
Instance details Defined in Foreign.C.Types Methods minBound :: CULong # maxBound :: CULong #
Bounded CLLong
Instance details Defined in Foreign.C.Types Methods minBound :: CLLong # maxBound :: CLLong #
Bounded CULLong
Instance details Defined in Foreign.C.Types Methods minBound :: CULLong # maxBound :: CULLong #
Bounded CBool
Instance details Defined in Foreign.C.Types Methods minBound :: CBool # maxBound :: CBool #
Bounded CPtrdiff
Instance details Defined in Foreign.C.Types Methods minBound :: CPtrdiff # maxBound :: CPtrdiff #
Bounded CSize
Instance details Defined in Foreign.C.Types Methods minBound :: CSize # maxBound :: CSize #
Bounded CWchar
Instance details Defined in Foreign.C.Types Methods minBound :: CWchar # maxBound :: CWchar #
Bounded CSigAtomic
Instance details Defined in Foreign.C.Types Methods minBound :: CSigAtomic # maxBound :: CSigAtomic #
Bounded CIntPtr
Instance details Defined in Foreign.C.Types Methods minBound :: CIntPtr # maxBound :: CIntPtr #
Bounded CUIntPtr
Instance details Defined in Foreign.C.Types Methods minBound :: CUIntPtr # maxBound :: CUIntPtr #
Bounded CIntMax
Instance details Defined in Foreign.C.Types Methods minBound :: CIntMax # maxBound :: CIntMax #
Bounded CUIntMax
Instance details Defined in Foreign.C.Types Methods minBound :: CUIntMax # maxBound :: CUIntMax #
Bounded WordPtr
Instance details Defined in Foreign.Ptr Methods minBound :: WordPtr # maxBound :: WordPtr #
Bounded IntPtr
Instance details Defined in Foreign.Ptr Methods minBound :: IntPtr # maxBound :: IntPtr #
Bounded GeneralCategory	Since: base-2.1
Instance details Defined in GHC.Unicode Methods minBound :: GeneralCategory # maxBound :: GeneralCategory #
Bounded UTF32_Invalid
Instance details Defined in Basement.String.Encoding.UTF32 Methods minBound :: UTF32_Invalid # maxBound :: UTF32_Invalid #
Bounded Encoding
Instance details Defined in Basement.String Methods minBound :: Encoding # maxBound :: Encoding #
Bounded Bit
Instance details Defined in Data.Bit.Internal Methods minBound :: Bit # maxBound :: Bit #
Bounded Extension
Instance details Defined in GHC.LanguageExtensions.Type Methods minBound :: Extension # maxBound :: Extension #
Bounded Mod2
Instance details Defined in Data.Semiring Methods minBound :: Mod2 # maxBound :: Mod2 #
Bounded Undefined
Instance details Defined in Universum.Debug Methods minBound :: Undefined # maxBound :: Undefined #
Bounded Bls12381Fr
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Methods minBound :: Bls12381Fr # maxBound :: Bls12381Fr #
Bounded Mutez
Instance details Defined in Morley.Tezos.Core Methods minBound :: Mutez # maxBound :: Mutez #
Bounded EntriesOrder
Instance details Defined in Morley.Michelson.Untyped.Contract Methods minBound :: EntriesOrder # maxBound :: EntriesOrder #
Bounded KeyHashTag
Instance details Defined in Morley.Tezos.Crypto Methods minBound :: KeyHashTag # maxBound :: KeyHashTag #
Bounded TLTime
Instance details Defined in Morley.Tezos.Crypto.Timelock Methods minBound :: TLTime # maxBound :: TLTime #
Bounded Transformation
Instance details Defined in Morley.Util.Interpolate.Internal Methods minBound :: Transformation # maxBound :: Transformation #
Class () (Bounded a)
Instance details Defined in Data.Constraint Methods cls :: Bounded a :- () #
a :=> (Bounded (Dict a))
Instance details Defined in Data.Constraint Methods ins :: a :- Bounded (Dict a) #
() :=> (Bounded Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Bounded Bool #
() :=> (Bounded Char)
Instance details Defined in Data.Constraint Methods ins :: () :- Bounded Char #
() :=> (Bounded Int)
Instance details Defined in Data.Constraint Methods ins :: () :- Bounded Int #
() :=> (Bounded Ordering)
Instance details Defined in Data.Constraint Methods ins :: () :- Bounded Ordering #
() :=> (Bounded Word)
Instance details Defined in Data.Constraint Methods ins :: () :- Bounded Word #
() :=> (Bounded ())
Instance details Defined in Data.Constraint Methods ins :: () :- Bounded () #
Bounded a => Bounded (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: First a # maxBound :: First a #
Bounded a => Bounded (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: Last a # maxBound :: Last a #
Bounded a => Bounded (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods minBound :: Identity a # maxBound :: Identity a #
Bounded a => Bounded (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: Min a # maxBound :: Min a #
Bounded a => Bounded (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: Max a # maxBound :: Max a #
Bounded m => Bounded (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: WrappedMonoid m # maxBound :: WrappedMonoid m #
Bounded a => Bounded (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: Dual a # maxBound :: Dual a #
Bounded a => Bounded (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: Sum a # maxBound :: Sum a #
Bounded a => Bounded (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: Product a # maxBound :: Product a #
Bounded a => Bounded (Down a)	Since: base-4.14.0.0
Instance details Defined in Data.Ord Methods minBound :: Down a # maxBound :: Down a #
a => Bounded (Dict a)
Instance details Defined in Data.Constraint Methods minBound :: Dict a # maxBound :: Dict a #
Bounded a => Bounded (Shown a)
Instance details Defined in Data.Text.Format.Types Methods minBound :: Shown a # maxBound :: Shown a #
KnownNat p => Bounded (Prime p)
Instance details Defined in Data.Field.Galois.Prime Methods minBound :: Prime p # maxBound :: Prime p #
KnownNat p => Bounded (Binary p)
Instance details Defined in Data.Field.Galois.Binary Methods minBound :: Binary p # maxBound :: Binary p #
KnownNat m => Bounded (Mod m)
Instance details Defined in Data.Mod Methods minBound :: Mod m # maxBound :: Mod m #
Bounded a => Bounded (Add a)
Instance details Defined in Data.Semiring Methods minBound :: Add a # maxBound :: Add a #
Bounded a => Bounded (Mul a)
Instance details Defined in Data.Semiring Methods minBound :: Mul a # maxBound :: Mul a #
Bounded a => Bounded (WrappedNum a)
Instance details Defined in Data.Semiring Methods minBound :: WrappedNum a # maxBound :: WrappedNum a #
Bounded a => Bounded (StringEncode a)
Instance details Defined in Morley.Micheline.Json Methods minBound :: StringEncode a # maxBound :: StringEncode a #
(Bounded a) :=> (Bounded (Identity a))
Instance details Defined in Data.Constraint Methods ins :: Bounded a :- Bounded (Identity a) #
(Bounded a) :=> (Bounded (Const a b))
Instance details Defined in Data.Constraint Methods ins :: Bounded a :- Bounded (Const a b) #
(Bounded a, Bounded b) => Bounded (a, b)	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: (a, b) # maxBound :: (a, b) #
Bounded (Proxy t)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods minBound :: Proxy t # maxBound :: Proxy t #
(Num a, Bits a, TypeNum n) => Bounded (OddWord a n)
Instance details Defined in Data.Word.Odd Methods minBound :: OddWord a n # maxBound :: OddWord a n #
(Bounded a, Bounded b) => Bounded (Pair a b)
Instance details Defined in Data.Strict.Tuple Methods minBound :: Pair a b # maxBound :: Pair a b #
(Bounded a, Bounded b) :=> (Bounded (a, b))
Instance details Defined in Data.Constraint Methods ins :: (Bounded a, Bounded b) :- Bounded (a, b) #
(Bounded a, Bounded b, Bounded c) => Bounded (a, b, c)	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c) # maxBound :: (a, b, c) #
Bounded a => Bounded (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods minBound :: Const a b # maxBound :: Const a b #
(Applicative f, Bounded a) => Bounded (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods minBound :: Ap f a # maxBound :: Ap f a #
a ~ b => Bounded (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods minBound :: a :~: b # maxBound :: a :~: b #
Bounded b => Bounded (Tagged s b)
Instance details Defined in Data.Tagged Methods minBound :: 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 details Defined in GHC.Enum Methods minBound :: (a, b, c, d) # maxBound :: (a, b, c, d) #
a ~~ b => Bounded (a :~~: b)	Since: base-4.10.0.0
Instance details Defined in Data.Type.Equality Methods minBound :: a :~~: b # maxBound :: a :~~: b #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (a, b, c, d, e)	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: (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 details Defined in GHC.Enum Methods minBound :: (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 details Defined in GHC.Enum Methods minBound :: (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 details Defined in GHC.Enum Methods minBound :: (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 details Defined in GHC.Enum Methods minBound :: (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 details Defined in GHC.Enum Methods minBound :: (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 details Defined in GHC.Enum Methods minBound :: (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 details Defined in GHC.Enum Methods minBound :: (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 details Defined in GHC.Enum Methods minBound :: (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 details Defined in GHC.Enum Methods minBound :: (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 details Defined in GHC.Enum Methods minBound :: (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 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

Semigroup Ordering	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: Ordering -> Ordering -> Ordering # sconcat :: NonEmpty Ordering -> Ordering # stimes :: Integral b => b -> Ordering -> Ordering #
Semigroup ()	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: () -> () -> () # sconcat :: NonEmpty () -> () # stimes :: Integral b => b -> () -> () #
Semigroup Doc
Instance details Defined in Text.PrettyPrint.HughesPJ Methods (<>) :: Doc -> Doc -> Doc # sconcat :: NonEmpty Doc -> Doc # stimes :: Integral b => b -> Doc -> Doc #
Semigroup ByteString
Instance details Defined in Data.ByteString.Internal Methods (<>) :: ByteString -> ByteString -> ByteString # sconcat :: NonEmpty ByteString -> ByteString # stimes :: Integral b => b -> ByteString -> ByteString #
Semigroup ShortByteString
Instance details Defined in Data.ByteString.Short.Internal Methods (<>) :: ShortByteString -> ShortByteString -> ShortByteString # sconcat :: NonEmpty ShortByteString -> ShortByteString # stimes :: Integral b => b -> ShortByteString -> ShortByteString #
Semigroup ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods (<>) :: ByteString -> ByteString -> ByteString # sconcat :: NonEmpty ByteString -> ByteString # stimes :: Integral b => b -> ByteString -> ByteString #
Semigroup Any	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Any -> Any -> Any # sconcat :: NonEmpty Any -> Any # stimes :: Integral b => b -> Any -> Any #
Semigroup All	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: All -> All -> All # sconcat :: NonEmpty All -> All # stimes :: Integral b => b -> All -> All #
Semigroup Builder
Instance details Defined in Data.Text.Internal.Builder Methods (<>) :: Builder -> Builder -> Builder # sconcat :: NonEmpty Builder -> Builder # stimes :: Integral b => b -> Builder -> Builder #
Semigroup Builder
Instance details Defined in Data.ByteString.Builder.Internal Methods (<>) :: Builder -> Builder -> Builder # sconcat :: NonEmpty Builder -> Builder # stimes :: Integral b => b -> Builder -> Builder #
Semigroup More
Instance details Defined in Data.Attoparsec.Internal.Types Methods (<>) :: More -> More -> More # sconcat :: NonEmpty More -> More # stimes :: Integral b => b -> More -> More #
Semigroup Void	Since: base-4.9.0.0
Instance details Defined in Data.Void Methods (<>) :: Void -> Void -> Void # sconcat :: NonEmpty Void -> Void # stimes :: Integral b => b -> Void -> Void #
Semigroup String
Instance details Defined in Basement.UTF8.Base Methods (<>) :: String -> String -> String # sconcat :: NonEmpty String -> String # stimes :: Integral b => b -> String -> String #
Semigroup AsciiString
Instance details Defined in Basement.Types.AsciiString Methods (<>) :: AsciiString -> AsciiString -> AsciiString # sconcat :: NonEmpty AsciiString -> AsciiString # stimes :: Integral b => b -> AsciiString -> AsciiString #
Semigroup IntSet	Since: containers-0.5.7
Instance details Defined in Data.IntSet.Internal Methods (<>) :: IntSet -> IntSet -> IntSet # sconcat :: NonEmpty IntSet -> IntSet # stimes :: Integral b => b -> IntSet -> IntSet #
Semigroup Pos
Instance details Defined in Text.Megaparsec.Pos Methods (<>) :: Pos -> Pos -> Pos # sconcat :: NonEmpty Pos -> Pos # stimes :: Integral b => b -> Pos -> Pos #
Semigroup PrefsMod
Instance details Defined in Options.Applicative.Builder Methods (<>) :: PrefsMod -> PrefsMod -> PrefsMod # sconcat :: NonEmpty PrefsMod -> PrefsMod # stimes :: Integral b => b -> PrefsMod -> PrefsMod #
Semigroup ParseError
Instance details Defined in Options.Applicative.Types Methods (<>) :: ParseError -> ParseError -> ParseError # sconcat :: NonEmpty ParseError -> ParseError # stimes :: Integral b => b -> ParseError -> ParseError #
Semigroup Completer
Instance details Defined in Options.Applicative.Types Methods (<>) :: Completer -> Completer -> Completer # sconcat :: NonEmpty Completer -> Completer # stimes :: Integral b => b -> Completer -> Completer #
Semigroup ByteArray
Instance details Defined in Data.Primitive.ByteArray Methods (<>) :: ByteArray -> ByteArray -> ByteArray # sconcat :: NonEmpty ByteArray -> ByteArray # stimes :: Integral b => b -> ByteArray -> ByteArray #
Semigroup PromDPatInfos
Instance details Defined in Data.Singletons.Syntax Methods (<>) :: PromDPatInfos -> PromDPatInfos -> PromDPatInfos # sconcat :: NonEmpty PromDPatInfos -> PromDPatInfos # stimes :: Integral b => b -> PromDPatInfos -> PromDPatInfos #
Semigroup ULetDecEnv
Instance details Defined in Data.Singletons.Syntax Methods (<>) :: ULetDecEnv -> ULetDecEnv -> ULetDecEnv # sconcat :: NonEmpty ULetDecEnv -> ULetDecEnv # stimes :: Integral b => b -> ULetDecEnv -> ULetDecEnv #
Semigroup Doc	In particular, note that the document `(x <> y)` concatenates document `x` and document `y`. It is an associative operation having `empty` as a left and right unit. (infixr 6)
Instance details Defined in Text.PrettyPrint.Leijen.Text Methods (<>) :: Doc -> Doc -> Doc # sconcat :: NonEmpty Doc -> Doc # stimes :: Integral b => b -> Doc -> Doc #
Semigroup MText
Instance details Defined in Morley.Michelson.Text Methods (<>) :: MText -> MText -> MText # sconcat :: NonEmpty MText -> MText # stimes :: Integral b => b -> MText -> MText #
Semigroup OpSize
Instance details Defined in Morley.Michelson.Untyped.OpSize Methods (<>) :: OpSize -> OpSize -> OpSize # sconcat :: NonEmpty OpSize -> OpSize # stimes :: Integral b => b -> OpSize -> OpSize #
Semigroup AnnotationSet
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods (<>) :: AnnotationSet -> AnnotationSet -> AnnotationSet # sconcat :: NonEmpty AnnotationSet -> AnnotationSet # stimes :: Integral b => b -> AnnotationSet -> AnnotationSet #
Semigroup VarAnn
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods (<>) :: VarAnn -> VarAnn -> VarAnn # sconcat :: NonEmpty VarAnn -> VarAnn # stimes :: Integral b => b -> VarAnn -> VarAnn #
Semigroup ContractDoc
Instance details Defined in Morley.Michelson.Doc Methods (<>) :: ContractDoc -> ContractDoc -> ContractDoc # sconcat :: NonEmpty ContractDoc -> ContractDoc # stimes :: Integral b => b -> ContractDoc -> ContractDoc #
Semigroup AnalyzerRes
Instance details Defined in Morley.Michelson.Analyzer Methods (<>) :: AnalyzerRes -> AnalyzerRes -> AnalyzerRes # sconcat :: NonEmpty AnalyzerRes -> AnalyzerRes # stimes :: Integral b => b -> AnalyzerRes -> AnalyzerRes #
Semigroup MorleyLogs
Instance details Defined in Morley.Michelson.Interpret Methods (<>) :: MorleyLogs -> MorleyLogs -> MorleyLogs # sconcat :: NonEmpty MorleyLogs -> MorleyLogs # stimes :: Integral b => b -> MorleyLogs -> MorleyLogs #
Semigroup MorleyLogsBuilder
Instance details Defined in Morley.Michelson.Interpret Methods (<>) :: MorleyLogsBuilder -> MorleyLogsBuilder -> MorleyLogsBuilder # sconcat :: NonEmpty MorleyLogsBuilder -> MorleyLogsBuilder # stimes :: Integral b => b -> MorleyLogsBuilder -> MorleyLogsBuilder #
Class () (Semigroup a)
Instance details Defined in Data.Constraint Methods cls :: Semigroup a :- () #
() :=> (Semigroup [a])
Instance details Defined in Data.Constraint Methods ins :: () :- Semigroup [a] #
() :=> (Semigroup Ordering)
Instance details Defined in Data.Constraint Methods ins :: () :- Semigroup Ordering #
() :=> (Semigroup ())
Instance details Defined in Data.Constraint Methods ins :: () :- Semigroup () #
() :=> (Semigroup (Dict a))
Instance details Defined in Data.Constraint Methods ins :: () :- Semigroup (Dict a) #
Semigroup [a]	Since: base-4.9.0.0
Instance details Defined 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 details Defined 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 details Defined 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 details Defined in GHC.Generics Methods (<>) :: Par1 p -> Par1 p -> Par1 p # sconcat :: NonEmpty (Par1 p) -> Par1 p # stimes :: Integral b => b -> Par1 p -> Par1 p #
Semigroup (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: First a -> First a -> First a # sconcat :: NonEmpty (First a) -> First a # stimes :: Integral b => b -> First a -> First a #
Semigroup (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Last a -> Last a -> Last a # sconcat :: NonEmpty (Last a) -> Last a # stimes :: Integral b => b -> Last a -> Last a #
Semigroup (First' a)
Instance details Defined in Distribution.Compat.Semigroup Methods (<>) :: First' a -> First' a -> First' a # sconcat :: NonEmpty (First' a) -> First' a # stimes :: Integral b => b -> First' a -> First' a #
Semigroup (Last' a)
Instance details Defined in Distribution.Compat.Semigroup Methods (<>) :: Last' a -> Last' a -> Last' a # sconcat :: NonEmpty (Last' a) -> Last' a # stimes :: Integral b => b -> Last' a -> Last' a #
Semigroup a => Semigroup (Option' a)
Instance details Defined in Distribution.Compat.Semigroup Methods (<>) :: Option' a -> Option' a -> Option' a # sconcat :: NonEmpty (Option' a) -> Option' a # stimes :: Integral b => b -> Option' a -> Option' a #
Ord a => Semigroup (Set a)	Since: containers-0.5.7
Instance details Defined 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 (NonEmpty a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: NonEmpty a -> NonEmpty a -> NonEmpty a # sconcat :: NonEmpty (NonEmpty a) -> NonEmpty a # stimes :: Integral b => b -> NonEmpty a -> NonEmpty a #
Semigroup a => Semigroup (Identity a)	Since: base-4.9.0.0
Instance details Defined 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 #
Semigroup (IResult a)
Instance details Defined in Data.Aeson.Types.Internal Methods (<>) :: IResult a -> IResult a -> IResult a # sconcat :: NonEmpty (IResult a) -> IResult a # stimes :: Integral b => b -> IResult a -> IResult a #
Semigroup (Result a)
Instance details Defined in Data.Aeson.Types.Internal Methods (<>) :: Result a -> Result a -> Result a # sconcat :: NonEmpty (Result a) -> Result a # stimes :: Integral b => b -> Result a -> Result a #
Semigroup (Parser a)
Instance details Defined in Data.Aeson.Types.Internal Methods (<>) :: Parser a -> Parser a -> Parser a # sconcat :: NonEmpty (Parser a) -> Parser a # stimes :: Integral b => b -> Parser a -> Parser a #
Ord a => Semigroup (Min a)	Since: base-4.9.0.0
Instance details Defined 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 details Defined in Data.Semigroup Methods (<>) :: Max a -> Max a -> Max a # sconcat :: NonEmpty (Max a) -> Max a # stimes :: Integral b => b -> Max a -> Max a #
Monoid m => Semigroup (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # sconcat :: NonEmpty (WrappedMonoid m) -> WrappedMonoid m # stimes :: Integral b => b -> WrappedMonoid m -> WrappedMonoid m #
Semigroup a => Semigroup (Option a)	Since: base-4.9.0.0
Instance details Defined 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 (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Monoid Methods (<>) :: First a -> First a -> First a # sconcat :: NonEmpty (First a) -> First a # stimes :: Integral b => b -> First a -> First a #
Semigroup (Last a)	Since: base-4.9.0.0
Instance details Defined 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 details Defined 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 #
Semigroup (Endo a)	Since: base-4.9.0.0
Instance details Defined 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 details Defined 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 details Defined 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 details Defined in Data.Ord Methods (<>) :: Down a -> Down a -> Down a # sconcat :: NonEmpty (Down a) -> Down a # stimes :: Integral b => b -> Down a -> Down a #
Semigroup (Array a)
Instance details Defined in Basement.BoxedArray Methods (<>) :: Array a -> Array a -> Array a # sconcat :: NonEmpty (Array a) -> Array a # stimes :: Integral b => b -> Array a -> Array a #
PrimType ty => Semigroup (UArray ty)
Instance details Defined in Basement.UArray.Base Methods (<>) :: UArray ty -> UArray ty -> UArray ty # sconcat :: NonEmpty (UArray ty) -> UArray ty # stimes :: Integral b => b -> UArray ty -> UArray ty #
PrimType ty => Semigroup (Block ty)
Instance details Defined in Basement.Block.Base Methods (<>) :: Block ty -> Block ty -> Block ty # sconcat :: NonEmpty (Block ty) -> Block ty # stimes :: Integral b => b -> Block ty -> Block ty #
Semigroup (CountOf ty)
Instance details Defined in Basement.Types.OffsetSize Methods (<>) :: CountOf ty -> CountOf ty -> CountOf ty # sconcat :: NonEmpty (CountOf ty) -> CountOf ty # stimes :: Integral b => b -> CountOf ty -> CountOf ty #
Num a => Semigroup (Colour a)
Instance details Defined 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 details Defined in Data.Colour.Internal Methods (<>) :: AlphaColour a -> AlphaColour a -> AlphaColour a # sconcat :: NonEmpty (AlphaColour a) -> AlphaColour a # stimes :: Integral b => b -> AlphaColour a -> AlphaColour a #
Semigroup (Dict a)
Instance details Defined in Data.Constraint Methods (<>) :: Dict a -> Dict a -> Dict a # sconcat :: NonEmpty (Dict a) -> Dict a # stimes :: Integral b => b -> Dict a -> Dict a #
Semigroup (IntMap a)	Since: containers-0.5.7
Instance details Defined 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 details Defined 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 #
Semigroup (DNonEmpty a)
Instance details Defined in Data.DList.DNonEmpty.Internal Methods (<>) :: DNonEmpty a -> DNonEmpty a -> DNonEmpty a # sconcat :: NonEmpty (DNonEmpty a) -> DNonEmpty a # stimes :: Integral b => b -> DNonEmpty a -> DNonEmpty a #
Semigroup (DList a)
Instance details Defined in Data.DList.Internal Methods (<>) :: DList a -> DList a -> DList a # sconcat :: NonEmpty (DList a) -> DList a # stimes :: Integral b => b -> DList a -> DList a #
KnownNat p => Semigroup (Prime p)
Instance details Defined in Data.Field.Galois.Prime Methods (<>) :: Prime p -> Prime p -> Prime p # sconcat :: NonEmpty (Prime p) -> Prime p # stimes :: Integral b => b -> Prime p -> Prime p #
KnownNat p => Semigroup (Binary p)
Instance details Defined in Data.Field.Galois.Binary Methods (<>) :: Binary p -> Binary p -> Binary p # sconcat :: NonEmpty (Binary p) -> Binary p # stimes :: Integral b => b -> Binary p -> Binary p #
Prim a => Semigroup (Vector a)
Instance details Defined in Data.Vector.Primitive Methods (<>) :: Vector a -> Vector a -> Vector a # sconcat :: NonEmpty (Vector a) -> Vector a # stimes :: Integral b => b -> Vector a -> Vector a #
Storable a => Semigroup (Vector a)
Instance details Defined in Data.Vector.Storable Methods (<>) :: Vector a -> Vector a -> Vector a # sconcat :: NonEmpty (Vector a) -> Vector a # stimes :: Integral b => b -> Vector a -> Vector a #
(Hashable a, Eq a) => Semigroup (HashSet a)	`<>` = `union` O(n+m) To obtain good performance, the smaller set must be presented as the first argument. Examples Expand `>>>` `fromList [1,2] <> fromList [2,3]`fromList [1,2,3]
Instance details Defined in Data.HashSet.Internal Methods (<>) :: HashSet a -> HashSet a -> HashSet a # sconcat :: NonEmpty (HashSet a) -> HashSet a # stimes :: Integral b => b -> HashSet a -> HashSet a #
Semigroup (Vector a)
Instance details Defined in Data.Vector Methods (<>) :: Vector a -> Vector a -> Vector a # sconcat :: NonEmpty (Vector a) -> Vector a # stimes :: Integral b => b -> Vector a -> Vector a #
Semigroup a => Semigroup (May a)
Instance details Defined in Lens.Micro.Mtl.Internal Methods (<>) :: May a -> May a -> May a # sconcat :: NonEmpty (May a) -> May a # stimes :: Integral b => b -> May a -> May a #
Semigroup (InfoMod a)
Instance details Defined in Options.Applicative.Builder Methods (<>) :: InfoMod a -> InfoMod a -> InfoMod a # sconcat :: NonEmpty (InfoMod a) -> InfoMod a # stimes :: Integral b => b -> InfoMod a -> InfoMod a #
Semigroup (DefaultProp a)
Instance details Defined in Options.Applicative.Builder.Internal Methods (<>) :: DefaultProp a -> DefaultProp a -> DefaultProp a # sconcat :: NonEmpty (DefaultProp a) -> DefaultProp a # stimes :: Integral b => b -> DefaultProp a -> DefaultProp a #
Semigroup (Doc a)
Instance details Defined 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 (PrimArray a)	Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.PrimArray Methods (<>) :: PrimArray a -> PrimArray a -> PrimArray a # sconcat :: NonEmpty (PrimArray a) -> PrimArray a # stimes :: Integral b => b -> PrimArray a -> PrimArray a #
Semigroup (SmallArray a)	Since: primitive-0.6.3.0
Instance details Defined in Data.Primitive.SmallArray Methods (<>) :: SmallArray a -> SmallArray a -> SmallArray a # sconcat :: NonEmpty (SmallArray a) -> SmallArray a # stimes :: Integral b => b -> SmallArray a -> SmallArray a #
Semigroup (Array a)	Since: primitive-0.6.3.0
Instance details Defined in Data.Primitive.Array Methods (<>) :: Array a -> Array a -> Array a # sconcat :: NonEmpty (Array a) -> Array a # stimes :: Integral b => b -> Array a -> Array a #
Semiring a => Semigroup (Add a)
Instance details Defined in Data.Semiring Methods (<>) :: Add a -> Add a -> Add a # sconcat :: NonEmpty (Add a) -> Add a # stimes :: Integral b => b -> Add a -> Add a #
Semiring a => Semigroup (Mul a)
Instance details Defined in Data.Semiring Methods (<>) :: Mul a -> Mul a -> Mul a # sconcat :: NonEmpty (Mul a) -> Mul a # stimes :: Integral b => b -> Mul a -> Mul a #
Semigroup (IntSetOf a)
Instance details Defined in Data.Semiring Methods (<>) :: IntSetOf a -> IntSetOf a -> IntSetOf a # sconcat :: NonEmpty (IntSetOf a) -> IntSetOf a # stimes :: Integral b => b -> IntSetOf a -> IntSetOf a #
Semigroup a => Semigroup (Maybe a)
Instance details Defined in Data.Strict.Maybe Methods (<>) :: Maybe a -> Maybe a -> Maybe a # sconcat :: NonEmpty (Maybe a) -> Maybe a # stimes :: Integral b => b -> Maybe a -> Maybe a #
Semigroup t => Semigroup (ElField '(s, t))
Instance details Defined in Data.Vinyl.Functor Methods (<>) :: ElField '(s, t) -> ElField '(s, t) -> ElField '(s, t) # sconcat :: NonEmpty (ElField '(s, t)) -> ElField '(s, t) # stimes :: Integral b => b -> ElField '(s, t) -> ElField '(s, t) #
Semigroup (ComposeResult a)
Instance details Defined in Morley.Michelson.Typed.Haskell.LooseSum Methods (<>) :: ComposeResult a -> ComposeResult a -> ComposeResult a # sconcat :: NonEmpty (ComposeResult a) -> ComposeResult a # stimes :: Integral b => b -> ComposeResult a -> ComposeResult a #
Semigroup (PrintComment st)
Instance details Defined in Morley.Michelson.Typed.Instr Methods (<>) :: PrintComment st -> PrintComment st -> PrintComment st # sconcat :: NonEmpty (PrintComment st) -> PrintComment st # stimes :: Integral b => b -> PrintComment st -> PrintComment st #
Semigroup (MergeSet a)
Instance details Defined 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 (SomeSizedList a)
Instance details Defined in Morley.Util.SizedList Methods (<>) :: SomeSizedList a -> SomeSizedList a -> SomeSizedList a # sconcat :: NonEmpty (SomeSizedList a) -> SomeSizedList a # stimes :: Integral b => b -> SomeSizedList a -> SomeSizedList a #
Semiring a => Semigroup (Add' a)
Instance details Defined in Data.Semiring Methods (<>) :: Add' a -> Add' a -> Add' a # sconcat :: NonEmpty (Add' a) -> Add' a # stimes :: Integral b => b -> Add' a -> Add' a #
Class (Semigroup a) (Monoid a)
Instance details Defined in Data.Constraint Methods cls :: Monoid a :- Semigroup a #
(Semigroup a) :=> (Semigroup (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Semigroup a :- Semigroup (Maybe a) #
(Semigroup a) :=> (Semigroup (Const a b))
Instance details Defined in Data.Constraint Methods ins :: Semigroup a :- Semigroup (Const a b) #
(Semigroup a) :=> (Semigroup (Identity a))
Instance details Defined in Data.Constraint Methods ins :: Semigroup a :- Semigroup (Identity a) #
(Semigroup a) :=> (Semigroup (IO a))
Instance details Defined in Data.Constraint Methods ins :: Semigroup a :- Semigroup (IO a) #
Semigroup b => Semigroup (a -> b)	Since: base-4.9.0.0
Instance details Defined 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 details Defined 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 details Defined 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 details Defined 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 details Defined 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 details Defined 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 #
Ord k => Semigroup (Map k v)
Instance details Defined 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 #
Semigroup (Proxy s)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods (<>) :: Proxy s -> Proxy s -> Proxy s # sconcat :: NonEmpty (Proxy s) -> Proxy s # stimes :: Integral b => b -> Proxy s -> Proxy s #
(Eq k, Hashable k) => Semigroup (HashMap k v)	`<>` = `union` If a key occurs in both maps, the mapping from the first will be the mapping in the result. Examples Expand `>>>` `fromList [(1,'a'),(2,'b')] <> fromList [(2,'c'),(3,'d')]`fromList [(1,'a'),(2,'b'),(3,'d')]
Instance details Defined in Data.HashMap.Internal Methods (<>) :: HashMap k v -> HashMap k v -> HashMap k v # sconcat :: NonEmpty (HashMap k v) -> HashMap k v # stimes :: Integral b => b -> HashMap k v -> HashMap k v #
Semigroup (Parser i a)
Instance details Defined in Data.Attoparsec.Internal.Types Methods (<>) :: Parser i a -> Parser i a -> Parser i a # sconcat :: NonEmpty (Parser i a) -> Parser i a # stimes :: Integral b => b -> Parser i a -> Parser i a #
(KnownNat n, GaloisField k) => Semigroup (RootsOfUnity n k)
Instance details Defined in Data.Field.Galois.Unity Methods (<>) :: RootsOfUnity n k -> RootsOfUnity n k -> RootsOfUnity n k # sconcat :: NonEmpty (RootsOfUnity n k) -> RootsOfUnity n k # stimes :: Integral b => b -> RootsOfUnity n k -> RootsOfUnity n k #
IrreducibleMonic p k => Semigroup (Extension p k)
Instance details Defined in Data.Field.Galois.Extension Methods (<>) :: Extension p k -> Extension p k -> Extension p k # sconcat :: NonEmpty (Extension p k) -> Extension p k # stimes :: Integral b => b -> Extension p k -> Extension p k #
Semigroup (ReifiedFold s a)
Instance details Defined in Control.Lens.Reified Methods (<>) :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a # sconcat :: NonEmpty (ReifiedFold s a) -> ReifiedFold s a # stimes :: Integral b => b -> ReifiedFold s a -> ReifiedFold s a #
Semigroup (f a) => Semigroup (Indexing f a)
Instance details Defined in Control.Lens.Internal.Indexed Methods (<>) :: Indexing f a -> Indexing f a -> Indexing f a # sconcat :: NonEmpty (Indexing f a) -> Indexing f a # stimes :: Integral b => b -> Indexing f a -> Indexing f a #
(Stream s, Ord e) => Semigroup (ParseError s e)
Instance details Defined in Text.Megaparsec.Error Methods (<>) :: ParseError s e -> ParseError s e -> ParseError s e # sconcat :: NonEmpty (ParseError s e) -> ParseError s e # stimes :: Integral b => b -> ParseError s e -> ParseError s e #
Semigroup a => Semigroup (Err e a)
Instance details Defined in Lens.Micro.Mtl.Internal Methods (<>) :: Err e a -> Err e a -> Err e a # sconcat :: NonEmpty (Err e a) -> Err e a # stimes :: Integral b => b -> Err e a -> Err e a #
Semigroup (Mod f a)	Since: optparse-applicative-0.13.0.0
Instance details Defined in Options.Applicative.Builder.Internal Methods (<>) :: Mod f a -> Mod f a -> Mod f a # sconcat :: NonEmpty (Mod f a) -> Mod f a # stimes :: Integral b => b -> Mod f a -> Mod f a #
Semigroup (IntMapOf k v)
Instance details Defined in Data.Semiring Methods (<>) :: IntMapOf k v -> IntMapOf k v -> IntMapOf k v # sconcat :: NonEmpty (IntMapOf k v) -> IntMapOf k v # stimes :: Integral b => b -> IntMapOf k v -> IntMapOf k v #
(Semigroup a, Semigroup b) => Semigroup (Pair a b)
Instance details Defined in Data.Strict.Tuple Methods (<>) :: Pair a b -> Pair a b -> Pair a b # sconcat :: NonEmpty (Pair a b) -> Pair a b # stimes :: Integral b0 => b0 -> Pair a b -> Pair a b #
(Semigroup a, Semigroup b) => Semigroup (These a b)
Instance details Defined in Data.Strict.These Methods (<>) :: These a b -> These a b -> These a b # sconcat :: NonEmpty (These a b) -> These a b # stimes :: Integral b0 => b0 -> These a b -> These a b #
Semigroup (Either a b)
Instance details Defined in Data.Strict.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 a, Semigroup b) => Semigroup (These a b)
Instance details Defined in Data.These Methods (<>) :: These a b -> These a b -> These a b # sconcat :: NonEmpty (These a b) -> These a b # stimes :: Integral b0 => b0 -> These a b -> These a b #
Ord k => Semigroup (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Methods (<>) :: BigMap k v -> BigMap k v -> BigMap k v # sconcat :: NonEmpty (BigMap k v) -> BigMap k v # stimes :: Integral b => b -> BigMap k v -> BigMap k v #
Semigroup (Instr s s)
Instance details Defined in Morley.Michelson.Typed.Instr Methods (<>) :: Instr s s -> Instr s s -> Instr s s # sconcat :: NonEmpty (Instr s s) -> Instr s s # stimes :: Integral b => b -> Instr s s -> Instr s s #
Semigroup (s :-> s) Source #
Instance details Defined in Lorentz.Base Methods (<>) :: (s :-> s) -> (s :-> s) -> s :-> s # sconcat :: NonEmpty (s :-> s) -> s :-> s # stimes :: Integral b => b -> (s :-> s) -> s :-> s #
(Semigroup a, Semigroup b) :=> (Semigroup (a, b))
Instance details Defined in Data.Constraint Methods ins :: (Semigroup a, Semigroup b) :- Semigroup (a, b) #
Semigroup (f p) => Semigroup (Rec1 f p)	Since: base-4.12.0.0
Instance details Defined 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 details Defined 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 details Defined 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 details Defined 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 details Defined 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 a => Semigroup (Tagged s a)
Instance details Defined in Data.Tagged Methods (<>) :: Tagged s a -> Tagged s a -> Tagged s a # sconcat :: NonEmpty (Tagged s a) -> Tagged s a # stimes :: Integral b => b -> Tagged s a -> Tagged s a #
Semigroup (ReifiedIndexedFold i s a)
Instance details Defined in Control.Lens.Reified Methods (<>) :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a # sconcat :: NonEmpty (ReifiedIndexedFold i s a) -> ReifiedIndexedFold i s a # stimes :: Integral b => b -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #
(Monad m, Semigroup r) => Semigroup (Effect m r a)
Instance details Defined in Lens.Micro.Mtl.Internal Methods (<>) :: Effect m r a -> Effect m r a -> Effect m r a # sconcat :: NonEmpty (Effect m r a) -> Effect m r a # stimes :: Integral b => b -> Effect m r a -> Effect m r a #
Reifies s (ReifiedMonoid a) => Semigroup (ReflectedMonoid a s)
Instance details Defined in Data.Reflection Methods (<>) :: ReflectedMonoid a s -> ReflectedMonoid a s -> ReflectedMonoid a s # sconcat :: NonEmpty (ReflectedMonoid a s) -> ReflectedMonoid a s # stimes :: Integral b => b -> ReflectedMonoid a s -> ReflectedMonoid a s #
Semigroup (Rec f ('[] :: [u]))
Instance details Defined in Data.Vinyl.Core Methods (<>) :: Rec f '[] -> Rec f '[] -> Rec f '[] # sconcat :: NonEmpty (Rec f '[]) -> Rec f '[] # stimes :: Integral b => b -> Rec f '[] -> Rec f '[] #
(Semigroup (f r), Semigroup (Rec f rs)) => Semigroup (Rec f (r ': rs))
Instance details Defined in Data.Vinyl.Core Methods (<>) :: Rec f (r ': rs) -> Rec f (r ': rs) -> Rec f (r ': rs) # sconcat :: NonEmpty (Rec f (r ': rs)) -> Rec f (r ': rs) # stimes :: Integral b => b -> Rec f (r ': rs) -> Rec f (r ': rs) #
Semigroup c => Semigroup (K1 i c p)	Since: base-4.12.0.0
Instance details Defined 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 details Defined 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 details Defined 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 details Defined 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 details Defined 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 details Defined 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) #
Semigroup (f (g a)) => Semigroup (Compose f g a)
Instance details Defined in Data.Vinyl.Functor Methods (<>) :: Compose f g a -> Compose f g a -> Compose f g a # sconcat :: NonEmpty (Compose f g a) -> Compose f g a # stimes :: Integral b => b -> Compose f g a -> Compose f g a #
Curve f c e q r => Semigroup (Point f c e q r)
Instance details Defined in Data.Curve Methods (<>) :: Point f c e q r -> Point f c e q r -> Point f c e q r # sconcat :: NonEmpty (Point f c e q r) -> Point f c e q r # stimes :: Integral b => b -> Point f c e q r -> Point f c e q r #

class Semigroup a => Monoid a where #

The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following:

Right identity: x <> mempty = x
Left identity: mempty <> x = x
Associativity: x <> (y <> z) = (x <> y) <> z (Semigroup law)
Concatenation: mconcat = foldr (<>) mempty

The method names refer to the monoid of lists under concatenation, but there are many other instances.

Some types can be viewed as a monoid in more than one way, e.g. both addition and multiplication on numbers. In such cases we often define newtypes and make those instances of Monoid, e.g. Sum and Product.

NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.

Minimal complete definition

mempty

Methods

mempty :: a #

Identity of mappend

>>> "Hello world" <> mempty
"Hello world"

mappend :: a -> a -> a #

An associative operation

NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

mconcat :: [a] -> a #

Fold a list using the monoid.

For most types, the default definition for mconcat will be used, but the function is included in the class definition so that an optimized version can be provided for specific types.

>>> mconcat ["Hello", " ", "Haskell", "!"]
"Hello Haskell!"

Instances

Instances details

Monoid Ordering	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: Ordering # mappend :: Ordering -> Ordering -> Ordering # mconcat :: [Ordering] -> Ordering #
Monoid ()	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: () # mappend :: () -> () -> () # mconcat :: [()] -> () #
Monoid Doc
Instance details Defined in Text.PrettyPrint.HughesPJ Methods mempty :: Doc # mappend :: Doc -> Doc -> Doc # mconcat :: [Doc] -> Doc #
Monoid ByteString
Instance details Defined in Data.ByteString.Internal Methods mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString #
Monoid ShortByteString
Instance details Defined in Data.ByteString.Short.Internal Methods mempty :: ShortByteString # mappend :: ShortByteString -> ShortByteString -> ShortByteString # mconcat :: [ShortByteString] -> ShortByteString #
Monoid ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString #
Monoid Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Any # mappend :: Any -> Any -> Any # mconcat :: [Any] -> Any #
Monoid All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: All # mappend :: All -> All -> All # mconcat :: [All] -> All #
Monoid Builder
Instance details Defined in Data.Text.Internal.Builder Methods mempty :: Builder # mappend :: Builder -> Builder -> Builder # mconcat :: [Builder] -> Builder #
Monoid Builder
Instance details Defined in Data.ByteString.Builder.Internal Methods mempty :: Builder # mappend :: Builder -> Builder -> Builder # mconcat :: [Builder] -> Builder #
Monoid More
Instance details Defined in Data.Attoparsec.Internal.Types Methods mempty :: More # mappend :: More -> More -> More # mconcat :: [More] -> More #
Monoid String
Instance details Defined in Basement.UTF8.Base Methods mempty :: String # mappend :: String -> String -> String # mconcat :: [String] -> String #
Monoid AsciiString
Instance details Defined in Basement.Types.AsciiString Methods mempty :: AsciiString # mappend :: AsciiString -> AsciiString -> AsciiString # mconcat :: [AsciiString] -> AsciiString #
Monoid IntSet
Instance details Defined in Data.IntSet.Internal Methods mempty :: IntSet # mappend :: IntSet -> IntSet -> IntSet # mconcat :: [IntSet] -> IntSet #
Monoid PrefsMod
Instance details Defined in Options.Applicative.Builder Methods mempty :: PrefsMod # mappend :: PrefsMod -> PrefsMod -> PrefsMod # mconcat :: [PrefsMod] -> PrefsMod #
Monoid ParseError
Instance details Defined in Options.Applicative.Types Methods mempty :: ParseError # mappend :: ParseError -> ParseError -> ParseError # mconcat :: [ParseError] -> ParseError #
Monoid Completer
Instance details Defined in Options.Applicative.Types Methods mempty :: Completer # mappend :: Completer -> Completer -> Completer # mconcat :: [Completer] -> Completer #
Monoid ByteArray
Instance details Defined in Data.Primitive.ByteArray Methods mempty :: ByteArray # mappend :: ByteArray -> ByteArray -> ByteArray # mconcat :: [ByteArray] -> ByteArray #
Monoid PromDPatInfos
Instance details Defined in Data.Singletons.Syntax Methods mempty :: PromDPatInfos # mappend :: PromDPatInfos -> PromDPatInfos -> PromDPatInfos # mconcat :: [PromDPatInfos] -> PromDPatInfos #
Monoid ULetDecEnv
Instance details Defined in Data.Singletons.Syntax Methods mempty :: ULetDecEnv # mappend :: ULetDecEnv -> ULetDecEnv -> ULetDecEnv # mconcat :: [ULetDecEnv] -> ULetDecEnv #
Monoid Doc
Instance details Defined in Text.PrettyPrint.Leijen.Text Methods mempty :: Doc # mappend :: Doc -> Doc -> Doc # mconcat :: [Doc] -> Doc #
Monoid MText
Instance details Defined in Morley.Michelson.Text Methods mempty :: MText # mappend :: MText -> MText -> MText # mconcat :: [MText] -> MText #
Monoid OpSize
Instance details Defined in Morley.Michelson.Untyped.OpSize Methods mempty :: OpSize # mappend :: OpSize -> OpSize -> OpSize # mconcat :: [OpSize] -> OpSize #
Monoid AnnotationSet
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods mempty :: AnnotationSet # mappend :: AnnotationSet -> AnnotationSet -> AnnotationSet # mconcat :: [AnnotationSet] -> AnnotationSet #
Monoid VarAnn
Instance details Defined in Morley.Michelson.Untyped.Annotation Methods mempty :: VarAnn # mappend :: VarAnn -> VarAnn -> VarAnn # mconcat :: [VarAnn] -> VarAnn #
Monoid ContractDoc
Instance details Defined in Morley.Michelson.Doc Methods mempty :: ContractDoc # mappend :: ContractDoc -> ContractDoc -> ContractDoc # mconcat :: [ContractDoc] -> ContractDoc #
Monoid AnalyzerRes
Instance details Defined in Morley.Michelson.Analyzer Methods mempty :: AnalyzerRes # mappend :: AnalyzerRes -> AnalyzerRes -> AnalyzerRes # mconcat :: [AnalyzerRes] -> AnalyzerRes #
Monoid MorleyLogs
Instance details Defined in Morley.Michelson.Interpret Methods mempty :: MorleyLogs # mappend :: MorleyLogs -> MorleyLogs -> MorleyLogs # mconcat :: [MorleyLogs] -> MorleyLogs #
Monoid MorleyLogsBuilder
Instance details Defined in Morley.Michelson.Interpret Methods mempty :: MorleyLogsBuilder # mappend :: MorleyLogsBuilder -> MorleyLogsBuilder -> MorleyLogsBuilder # mconcat :: [MorleyLogsBuilder] -> MorleyLogsBuilder #
a :=> (Monoid (Dict a))
Instance details Defined in Data.Constraint Methods ins :: a :- Monoid (Dict a) #
() :=> (Monoid [a])
Instance details Defined in Data.Constraint Methods ins :: () :- Monoid [a] #
() :=> (Monoid Ordering)
Instance details Defined in Data.Constraint Methods ins :: () :- Monoid Ordering #
() :=> (Monoid ())
Instance details Defined in Data.Constraint Methods ins :: () :- Monoid () #
Monoid [a]	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: [a] # mappend :: [a] -> [a] -> [a] # mconcat :: [[a]] -> [a] #
Semigroup a => Monoid (Maybe a)	Lift a semigroup into `Maybe` forming a `Monoid` according to http://en.wikipedia.org/wiki/Monoid: "Any semigroup `S` may be turned into a monoid simply by adjoining an element `e` not in `S` and defining `ee = e` and `es = s = se` for all `s ∈ S`." Since 4.11.0: constraint on inner `a` value generalised from `Monoid` to `Semigroup`. Since: base-2.1*
Instance details Defined in GHC.Base Methods mempty :: Maybe a # mappend :: Maybe a -> Maybe a -> Maybe a # mconcat :: [Maybe a] -> Maybe a #
Monoid a => Monoid (IO a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods mempty :: IO a # mappend :: IO a -> IO a -> IO a # mconcat :: [IO a] -> IO a #
Monoid p => Monoid (Par1 p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: Par1 p # mappend :: Par1 p -> Par1 p -> Par1 p # mconcat :: [Par1 p] -> Par1 p #
Semigroup a => Monoid (Option' a)
Instance details Defined in Distribution.Compat.Semigroup Methods mempty :: Option' a # mappend :: Option' a -> Option' a -> Option' a # mconcat :: [Option' a] -> Option' a #
Ord a => Monoid (Set a)
Instance details Defined in Data.Set.Internal Methods mempty :: Set a # mappend :: Set a -> Set a -> Set a # mconcat :: [Set a] -> Set a #
Monoid a => Monoid (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods mempty :: Identity a # mappend :: Identity a -> Identity a -> Identity a # mconcat :: [Identity a] -> Identity a #
Monoid (IResult a)
Instance details Defined in Data.Aeson.Types.Internal Methods mempty :: IResult a # mappend :: IResult a -> IResult a -> IResult a # mconcat :: [IResult a] -> IResult a #
Monoid (Result a)
Instance details Defined in Data.Aeson.Types.Internal Methods mempty :: Result a # mappend :: Result a -> Result a -> Result a # mconcat :: [Result a] -> Result a #
Monoid (Parser a)
Instance details Defined in Data.Aeson.Types.Internal Methods mempty :: Parser a # mappend :: Parser a -> Parser a -> Parser a # mconcat :: [Parser a] -> Parser a #
(Ord a, Bounded a) => Monoid (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mempty :: Min a # mappend :: Min a -> Min a -> Min a # mconcat :: [Min a] -> Min a #
(Ord a, Bounded a) => Monoid (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mempty :: Max a # mappend :: Max a -> Max a -> Max a # mconcat :: [Max a] -> Max a #
Monoid m => Monoid (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mempty :: WrappedMonoid m # mappend :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # mconcat :: [WrappedMonoid m] -> WrappedMonoid m #
Semigroup a => Monoid (Option a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mempty :: Option a # mappend :: Option a -> Option a -> Option a # mconcat :: [Option a] -> Option a #
Monoid (First a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods mempty :: First a # mappend :: First a -> First a -> First a # mconcat :: [First a] -> First a #
Monoid (Last a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods mempty :: Last a # mappend :: Last a -> Last a -> Last a # mconcat :: [Last a] -> Last a #
Monoid a => Monoid (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Dual a # mappend :: Dual a -> Dual a -> Dual a # mconcat :: [Dual a] -> Dual a #
Monoid (Endo a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Endo a # mappend :: Endo a -> Endo a -> Endo a # mconcat :: [Endo a] -> Endo a #
Num a => Monoid (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Sum a # mappend :: Sum a -> Sum a -> Sum a # mconcat :: [Sum a] -> Sum a #
Num a => Monoid (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Product a # mappend :: Product a -> Product a -> Product a # mconcat :: [Product a] -> Product a #
Monoid a => Monoid (Down a)	Since: base-4.11.0.0
Instance details Defined in Data.Ord Methods mempty :: Down a # mappend :: Down a -> Down a -> Down a # mconcat :: [Down a] -> Down a #
Monoid (Array a)
Instance details Defined in Basement.BoxedArray Methods mempty :: Array a # mappend :: Array a -> Array a -> Array a # mconcat :: [Array a] -> Array a #
PrimType ty => Monoid (UArray ty)
Instance details Defined in Basement.UArray.Base Methods mempty :: UArray ty # mappend :: UArray ty -> UArray ty -> UArray ty # mconcat :: [UArray ty] -> UArray ty #
PrimType ty => Monoid (Block ty)
Instance details Defined in Basement.Block.Base Methods mempty :: Block ty # mappend :: Block ty -> Block ty -> Block ty # mconcat :: [Block ty] -> Block ty #
Monoid (CountOf ty)
Instance details Defined in Basement.Types.OffsetSize Methods mempty :: CountOf ty # mappend :: CountOf ty -> CountOf ty -> CountOf ty # mconcat :: [CountOf ty] -> CountOf ty #
Num a => Monoid (Colour a)
Instance details Defined in Data.Colour.Internal Methods mempty :: Colour a # mappend :: Colour a -> Colour a -> Colour a # mconcat :: [Colour a] -> Colour a #
Num a => Monoid (AlphaColour a)
Instance details Defined in Data.Colour.Internal Methods mempty :: AlphaColour a # mappend :: AlphaColour a -> AlphaColour a -> AlphaColour a # mconcat :: [AlphaColour a] -> AlphaColour a #
a => Monoid (Dict a)
Instance details Defined in Data.Constraint Methods mempty :: Dict a # mappend :: Dict a -> Dict a -> Dict a # mconcat :: [Dict a] -> Dict a #
Monoid (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods mempty :: IntMap a # mappend :: IntMap a -> IntMap a -> IntMap a # mconcat :: [IntMap a] -> IntMap a #
Monoid (Seq a)
Instance details Defined in Data.Sequence.Internal Methods mempty :: Seq a # mappend :: Seq a -> Seq a -> Seq a # mconcat :: [Seq a] -> Seq a #
Monoid (DList a)
Instance details Defined in Data.DList.Internal Methods mempty :: DList a # mappend :: DList a -> DList a -> DList a # mconcat :: [DList a] -> DList a #
KnownNat p => Monoid (Prime p)
Instance details Defined in Data.Field.Galois.Prime Methods mempty :: Prime p # mappend :: Prime p -> Prime p -> Prime p # mconcat :: [Prime p] -> Prime p #
KnownNat p => Monoid (Binary p)
Instance details Defined in Data.Field.Galois.Binary Methods mempty :: Binary p # mappend :: Binary p -> Binary p -> Binary p # mconcat :: [Binary p] -> Binary p #
Prim a => Monoid (Vector a)
Instance details Defined in Data.Vector.Primitive Methods mempty :: Vector a # mappend :: Vector a -> Vector a -> Vector a # mconcat :: [Vector a] -> Vector a #
Storable a => Monoid (Vector a)
Instance details Defined in Data.Vector.Storable Methods mempty :: Vector a # mappend :: Vector a -> Vector a -> Vector a # mconcat :: [Vector a] -> Vector a #
(Hashable a, Eq a) => Monoid (HashSet a)	`mempty` = `empty` `mappend` = `union` O(n+m) To obtain good performance, the smaller set must be presented as the first argument. Examples Expand `>>>` `mappend (fromList [1,2]) (fromList [2,3])`fromList [1,2,3]
Instance details Defined in Data.HashSet.Internal Methods mempty :: HashSet a # mappend :: HashSet a -> HashSet a -> HashSet a # mconcat :: [HashSet a] -> HashSet a #
Monoid (Vector a)
Instance details Defined in Data.Vector Methods mempty :: Vector a # mappend :: Vector a -> Vector a -> Vector a # mconcat :: [Vector a] -> Vector a #
Monoid a => Monoid (May a)
Instance details Defined in Lens.Micro.Mtl.Internal Methods mempty :: May a # mappend :: May a -> May a -> May a # mconcat :: [May a] -> May a #
Monoid (InfoMod a)
Instance details Defined in Options.Applicative.Builder Methods mempty :: InfoMod a # mappend :: InfoMod a -> InfoMod a -> InfoMod a # mconcat :: [InfoMod a] -> InfoMod a #
Monoid (DefaultProp a)
Instance details Defined in Options.Applicative.Builder.Internal Methods mempty :: DefaultProp a # mappend :: DefaultProp a -> DefaultProp a -> DefaultProp a # mconcat :: [DefaultProp a] -> DefaultProp a #
Monoid (Doc a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods mempty :: Doc a # mappend :: Doc a -> Doc a -> Doc a # mconcat :: [Doc a] -> Doc a #
Monoid (PrimArray a)	Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.PrimArray Methods mempty :: PrimArray a # mappend :: PrimArray a -> PrimArray a -> PrimArray a # mconcat :: [PrimArray a] -> PrimArray a #
Monoid (SmallArray a)
Instance details Defined in Data.Primitive.SmallArray Methods mempty :: SmallArray a # mappend :: SmallArray a -> SmallArray a -> SmallArray a # mconcat :: [SmallArray a] -> SmallArray a #
Monoid (Array a)
Instance details Defined in Data.Primitive.Array Methods mempty :: Array a # mappend :: Array a -> Array a -> Array a # mconcat :: [Array a] -> Array a #
Semiring a => Monoid (Add a)
Instance details Defined in Data.Semiring Methods mempty :: Add a # mappend :: Add a -> Add a -> Add a # mconcat :: [Add a] -> Add a #
Semiring a => Monoid (Mul a)
Instance details Defined in Data.Semiring Methods mempty :: Mul a # mappend :: Mul a -> Mul a -> Mul a # mconcat :: [Mul a] -> Mul a #
Monoid (IntSetOf a)
Instance details Defined in Data.Semiring Methods mempty :: IntSetOf a # mappend :: IntSetOf a -> IntSetOf a -> IntSetOf a # mconcat :: [IntSetOf a] -> IntSetOf a #
Semigroup a => Monoid (Maybe a)
Instance details Defined in Data.Strict.Maybe Methods mempty :: Maybe a # mappend :: Maybe a -> Maybe a -> Maybe a # mconcat :: [Maybe a] -> Maybe a #
(KnownSymbol s, Monoid t) => Monoid (ElField '(s, t))
Instance details Defined in Data.Vinyl.Functor Methods mempty :: ElField '(s, t) # mappend :: ElField '(s, t) -> ElField '(s, t) -> ElField '(s, t) # mconcat :: [ElField '(s, t)] -> ElField '(s, t) #
Monoid (ComposeResult a)
Instance details Defined in Morley.Michelson.Typed.Haskell.LooseSum Methods mempty :: ComposeResult a # mappend :: ComposeResult a -> ComposeResult a -> ComposeResult a # mconcat :: [ComposeResult a] -> ComposeResult a #
Monoid (PrintComment st)
Instance details Defined in Morley.Michelson.Typed.Instr Methods mempty :: PrintComment st # mappend :: PrintComment st -> PrintComment st -> PrintComment st # mconcat :: [PrintComment st] -> PrintComment st #
Monoid (MergeSet a)
Instance details Defined in Data.Set.Internal Methods mempty :: MergeSet a # mappend :: MergeSet a -> MergeSet a -> MergeSet a # mconcat :: [MergeSet a] -> MergeSet a #
Monoid (SomeSizedList a)
Instance details Defined in Morley.Util.SizedList Methods mempty :: SomeSizedList a # mappend :: SomeSizedList a -> SomeSizedList a -> SomeSizedList a # mconcat :: [SomeSizedList a] -> SomeSizedList a #
Class (Semigroup a) (Monoid a)
Instance details Defined in Data.Constraint Methods cls :: Monoid a :- Semigroup a #
(Monoid a) :=> (Monoid (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Monoid a :- Monoid (Maybe a) #
(Monoid a) :=> (Monoid (Const a b))
Instance details Defined in Data.Constraint Methods ins :: Monoid a :- Monoid (Const a b) #
(Monoid a) :=> (Monoid (Identity a))
Instance details Defined in Data.Constraint Methods ins :: Monoid a :- Monoid (Identity a) #
(Monoid a) :=> (Monoid (IO a))
Instance details Defined in Data.Constraint Methods ins :: Monoid a :- Monoid (IO a) #
(Monoid a) :=> (Applicative ((,) a))
Instance details Defined in Data.Constraint Methods ins :: Monoid a :- Applicative ((,) a) #
(Monoid a) :=> (Applicative (Const a :: Type -> Type))
Instance details Defined in Data.Constraint Methods ins :: Monoid a :- Applicative (Const a) #
Monoid b => Monoid (a -> b)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: a -> b # mappend :: (a -> b) -> (a -> b) -> a -> b # mconcat :: [a -> b] -> a -> b #
Monoid (U1 p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: U1 p # mappend :: U1 p -> U1 p -> U1 p # mconcat :: [U1 p] -> U1 p #
(Monoid a, Monoid b) => Monoid (a, b)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: (a, b) # mappend :: (a, b) -> (a, b) -> (a, b) # mconcat :: [(a, b)] -> (a, b) #
Monoid a => Monoid (ST s a)	Since: base-4.11.0.0
Instance details Defined in GHC.ST Methods mempty :: ST s a # mappend :: ST s a -> ST s a -> ST s a # mconcat :: [ST s a] -> ST s a #
Ord k => Monoid (Map k v)
Instance details Defined in Data.Map.Internal Methods mempty :: Map k v # mappend :: Map k v -> Map k v -> Map k v # mconcat :: [Map k v] -> Map k v #
Monoid (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods mempty :: Proxy s # mappend :: Proxy s -> Proxy s -> Proxy s # mconcat :: [Proxy s] -> Proxy s #
(Eq k, Hashable k) => Monoid (HashMap k v)	`mempty` = `empty` `mappend` = `union` If a key occurs in both maps, the mapping from the first will be the mapping in the result. Examples Expand `>>>` `mappend (fromList [(1,'a'),(2,'b')]) (fromList [(2,'c'),(3,'d')])`fromList [(1,'a'),(2,'b'),(3,'d')]
Instance details Defined in Data.HashMap.Internal Methods mempty :: HashMap k v # mappend :: HashMap k v -> HashMap k v -> HashMap k v # mconcat :: [HashMap k v] -> HashMap k v #
Monoid (Parser i a)
Instance details Defined in Data.Attoparsec.Internal.Types Methods mempty :: Parser i a # mappend :: Parser i a -> Parser i a -> Parser i a # mconcat :: [Parser i a] -> Parser i a #
(KnownNat n, GaloisField k) => Monoid (RootsOfUnity n k)
Instance details Defined in Data.Field.Galois.Unity Methods mempty :: RootsOfUnity n k # mappend :: RootsOfUnity n k -> RootsOfUnity n k -> RootsOfUnity n k # mconcat :: [RootsOfUnity n k] -> RootsOfUnity n k #
IrreducibleMonic p k => Monoid (Extension p k)
Instance details Defined in Data.Field.Galois.Extension Methods mempty :: Extension p k # mappend :: Extension p k -> Extension p k -> Extension p k # mconcat :: [Extension p k] -> Extension p k #
Monoid (ReifiedFold s a)
Instance details Defined in Control.Lens.Reified Methods mempty :: ReifiedFold s a # mappend :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a # mconcat :: [ReifiedFold s a] -> ReifiedFold s a #
Monoid (f a) => Monoid (Indexing f a)	`>>>` `"cat" ^@.. (folded <> folded)`[(0,'c'),(1,'a'),(2,'t'),(0,'c'),(1,'a'),(2,'t')] `>>>` `"cat" ^@.. indexing (folded <> folded)`[(0,'c'),(1,'a'),(2,'t'),(3,'c'),(4,'a'),(5,'t')]
Instance details Defined in Control.Lens.Internal.Indexed Methods mempty :: Indexing f a # mappend :: Indexing f a -> Indexing f a -> Indexing f a # mconcat :: [Indexing f a] -> Indexing f a #
(Stream s, Ord e) => Monoid (ParseError s e)
Instance details Defined in Text.Megaparsec.Error Methods mempty :: ParseError s e # mappend :: ParseError s e -> ParseError s e -> ParseError s e # mconcat :: [ParseError s e] -> ParseError s e #
Monoid a => Monoid (Err e a)
Instance details Defined in Lens.Micro.Mtl.Internal Methods mempty :: Err e a # mappend :: Err e a -> Err e a -> Err e a # mconcat :: [Err e a] -> Err e a #
Monoid (Mod f a)
Instance details Defined in Options.Applicative.Builder.Internal Methods mempty :: Mod f a # mappend :: Mod f a -> Mod f a -> Mod f a # mconcat :: [Mod f a] -> Mod f a #
Monoid (IntMapOf k v)
Instance details Defined in Data.Semiring Methods mempty :: IntMapOf k v # mappend :: IntMapOf k v -> IntMapOf k v -> IntMapOf k v # mconcat :: [IntMapOf k v] -> IntMapOf k v #
(Monoid a, Monoid b) => Monoid (Pair a b)
Instance details Defined in Data.Strict.Tuple Methods mempty :: Pair a b # mappend :: Pair a b -> Pair a b -> Pair a b # mconcat :: [Pair a b] -> Pair a b #
Monoid (Instr s s)
Instance details Defined in Morley.Michelson.Typed.Instr Methods mempty :: Instr s s # mappend :: Instr s s -> Instr s s -> Instr s s # mconcat :: [Instr s s] -> Instr s s #
Monoid (s :-> s) Source #
Instance details Defined in Lorentz.Base Methods mempty :: s :-> s # mappend :: (s :-> s) -> (s :-> s) -> s :-> s # mconcat :: [s :-> s] -> s :-> s #
(Monoid a, Monoid b) :=> (Monoid (a, b))
Instance details Defined in Data.Constraint Methods ins :: (Monoid a, Monoid b) :- Monoid (a, b) #
Monoid (f p) => Monoid (Rec1 f p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: Rec1 f p # mappend :: Rec1 f p -> Rec1 f p -> Rec1 f p # mconcat :: [Rec1 f p] -> Rec1 f p #
(Monoid a, Monoid b, Monoid c) => Monoid (a, b, c)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: (a, b, c) # mappend :: (a, b, c) -> (a, b, c) -> (a, b, c) # mconcat :: [(a, b, c)] -> (a, b, c) #
Monoid a => Monoid (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods mempty :: Const a b # mappend :: Const a b -> Const a b -> Const a b # mconcat :: [Const a b] -> Const a b #
(Applicative f, Monoid a) => Monoid (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods mempty :: Ap f a # mappend :: Ap f a -> Ap f a -> Ap f a # mconcat :: [Ap f a] -> Ap f a #
Alternative f => Monoid (Alt f a)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Alt f a # mappend :: Alt f a -> Alt f a -> Alt f a # mconcat :: [Alt f a] -> Alt f a #
(Semigroup a, Monoid a) => Monoid (Tagged s a)
Instance details Defined in Data.Tagged Methods mempty :: Tagged s a # mappend :: Tagged s a -> Tagged s a -> Tagged s a # mconcat :: [Tagged s a] -> Tagged s a #
Monoid (ReifiedIndexedFold i s a)
Instance details Defined in Control.Lens.Reified Methods mempty :: ReifiedIndexedFold i s a # mappend :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a # mconcat :: [ReifiedIndexedFold i s a] -> ReifiedIndexedFold i s a #
(Monad m, Monoid r) => Monoid (Effect m r a)
Instance details Defined in Lens.Micro.Mtl.Internal Methods mempty :: Effect m r a # mappend :: Effect m r a -> Effect m r a -> Effect m r a # mconcat :: [Effect m r a] -> Effect m r a #
Reifies s (ReifiedMonoid a) => Monoid (ReflectedMonoid a s)
Instance details Defined in Data.Reflection Methods mempty :: ReflectedMonoid a s # mappend :: ReflectedMonoid a s -> ReflectedMonoid a s -> ReflectedMonoid a s # mconcat :: [ReflectedMonoid a s] -> ReflectedMonoid a s #
Monoid (Rec f ('[] :: [u]))
Instance details Defined in Data.Vinyl.Core Methods mempty :: Rec f '[] # mappend :: Rec f '[] -> Rec f '[] -> Rec f '[] # mconcat :: [Rec f '[]] -> Rec f '[] #
(Monoid (f r), Monoid (Rec f rs)) => Monoid (Rec f (r ': rs))
Instance details Defined in Data.Vinyl.Core Methods mempty :: Rec f (r ': rs) # mappend :: Rec f (r ': rs) -> Rec f (r ': rs) -> Rec f (r ': rs) # mconcat :: [Rec f (r ': rs)] -> Rec f (r ': rs) #
Monoid c => Monoid (K1 i c p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: K1 i c p # mappend :: K1 i c p -> K1 i c p -> K1 i c p # mconcat :: [K1 i c p] -> K1 i c p #
(Monoid (f p), Monoid (g p)) => Monoid ((f :*: g) p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: (f :: g) p # mappend :: (f :: g) p -> (f :: g) p -> (f :: g) p # mconcat :: [(f :: g) p] -> (f :: g) p #
(Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: (a, b, c, d) # mappend :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) # mconcat :: [(a, b, c, d)] -> (a, b, c, d) #
Monoid (f p) => Monoid (M1 i c f p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: M1 i c f p # mappend :: M1 i c f p -> M1 i c f p -> M1 i c f p # mconcat :: [M1 i c f p] -> M1 i c f p #
Monoid (f (g p)) => Monoid ((f :.: g) p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: (f :.: g) p # mappend :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p # mconcat :: [(f :.: g) p] -> (f :.: g) p #
(Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) => Monoid (a, b, c, d, e)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: (a, b, c, d, e) # mappend :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) # mconcat :: [(a, b, c, d, e)] -> (a, b, c, d, e) #
Monoid (f (g a)) => Monoid (Compose f g a)
Instance details Defined in Data.Vinyl.Functor Methods mempty :: Compose f g a # mappend :: Compose f g a -> Compose f g a -> Compose f g a # mconcat :: [Compose f g a] -> Compose f g a #
Curve f c e q r => Monoid (Point f c e q r)
Instance details Defined in Data.Curve Methods mempty :: Point f c e q r # mappend :: Point f c e q r -> Point f c e q r -> Point f c e q r # mconcat :: [Point f c e q r] -> Point f c e q r #

class Generic a #

Representable types of kind *. This class is derivable in GHC with the DeriveGeneric flag on.

A Generic instance must satisfy the following laws:

from . to ≡ id
to . from ≡ id

Minimal complete definition

from, to

Instances

Instances details

Generic Bool	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep Bool :: Type -> Type # Methods from :: Bool -> Rep Bool x # to :: Rep Bool x -> Bool #
Generic Ordering	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep Ordering :: Type -> Type # Methods from :: Ordering -> Rep Ordering x # to :: Rep Ordering x -> Ordering #
Generic Exp
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Exp :: Type -> Type # Methods from :: Exp -> Rep Exp x # to :: Rep Exp x -> Exp #
Generic Match
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Match :: Type -> Type # Methods from :: Match -> Rep Match x # to :: Rep Match x -> Match #
Generic Clause
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Clause :: Type -> Type # Methods from :: Clause -> Rep Clause x # to :: Rep Clause x -> Clause #
Generic Pat
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Pat :: Type -> Type # Methods from :: Pat -> Rep Pat x # to :: Rep Pat x -> Pat #
Generic Type
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Type :: Type -> Type # Methods from :: Type -> Rep Type x # to :: Rep Type x -> Type #
Generic Dec
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Dec :: Type -> Type # Methods from :: Dec -> Rep Dec x # to :: Rep Dec x -> Dec #
Generic Name
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Name :: Type -> Type # Methods from :: Name -> Rep Name x # to :: Rep Name x -> Name #
Generic FunDep
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep FunDep :: Type -> Type # Methods from :: FunDep -> Rep FunDep x # to :: Rep FunDep x -> FunDep #
Generic InjectivityAnn
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep InjectivityAnn :: Type -> Type # Methods from :: InjectivityAnn -> Rep InjectivityAnn x # to :: Rep InjectivityAnn x -> InjectivityAnn #
Generic Overlap
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Overlap :: Type -> Type # Methods from :: Overlap -> Rep Overlap x # to :: Rep Overlap x -> Overlap #
Generic ()	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep () :: Type -> Type # Methods from :: () -> Rep () x # to :: Rep () x -> () #
Generic Doc
Instance details Defined in Text.PrettyPrint.HughesPJ Associated Types type Rep Doc :: Type -> Type # Methods from :: Doc -> Rep Doc x # to :: Rep Doc x -> Doc #
Generic Version	Since: base-4.9.0.0
Instance details Defined in Data.Version Associated Types type Rep Version :: Type -> Type # Methods from :: Version -> Rep Version x # to :: Rep Version x -> Version #
Generic Language
Instance details Defined in Language.Haskell.Extension Associated Types type Rep Language :: Type -> Type # Methods from :: Language -> Rep Language x # to :: Rep Language x -> Language #
Generic Extension
Instance details Defined in Language.Haskell.Extension Associated Types type Rep Extension :: Type -> Type # Methods from :: Extension -> Rep Extension x # to :: Rep Extension x -> Extension #
Generic KnownExtension
Instance details Defined in Language.Haskell.Extension Associated Types type Rep KnownExtension :: Type -> Type # Methods from :: KnownExtension -> Rep KnownExtension x # to :: Rep KnownExtension x -> KnownExtension #
Generic CabalSpecVersion
Instance details Defined in Distribution.CabalSpecVersion Associated Types type Rep CabalSpecVersion :: Type -> Type # Methods from :: CabalSpecVersion -> Rep CabalSpecVersion x # to :: Rep CabalSpecVersion x -> CabalSpecVersion #
Generic PError
Instance details Defined in Distribution.Parsec.Error Associated Types type Rep PError :: Type -> Type # Methods from :: PError -> Rep PError x # to :: Rep PError x -> PError #
Generic PWarnType
Instance details Defined in Distribution.Parsec.Warning Associated Types type Rep PWarnType :: Type -> Type # Methods from :: PWarnType -> Rep PWarnType x # to :: Rep PWarnType x -> PWarnType #
Generic PWarning
Instance details Defined in Distribution.Parsec.Warning Associated Types type Rep PWarning :: Type -> Type # Methods from :: PWarning -> Rep PWarning x # to :: Rep PWarning x -> PWarning #
Generic Position
Instance details Defined in Distribution.Parsec.Position Associated Types type Rep Position :: Type -> Type # Methods from :: Position -> Rep Position x # to :: Rep Position x -> Position #
Generic Structure
Instance details Defined in Distribution.Utils.Structured Associated Types type Rep Structure :: Type -> Type # Methods from :: Structure -> Rep Structure x # to :: Rep Structure x -> Structure #
Generic Any	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep Any :: Type -> Type # Methods from :: Any -> Rep Any x # to :: Rep Any x -> Any #
Generic All	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep All :: Type -> Type # Methods from :: All -> Rep All x # to :: Rep All x -> All #
Generic Value
Instance details Defined in Data.Aeson.Types.Internal Associated Types type Rep Value :: Type -> Type # Methods from :: Value -> Rep Value x # to :: Rep Value x -> Value #
Generic Void	Since: base-4.8.0.0
Instance details Defined in Data.Void Associated Types type Rep Void :: Type -> Type # Methods from :: Void -> Rep Void x # to :: Rep Void x -> Void #
Generic ExitCode
Instance details Defined in GHC.IO.Exception Associated Types type Rep ExitCode :: Type -> Type # Methods from :: ExitCode -> Rep ExitCode x # to :: Rep ExitCode x -> ExitCode #
Generic Fixity	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Associated Types type Rep Fixity :: Type -> Type # Methods from :: Fixity -> Rep Fixity x # to :: Rep Fixity x -> Fixity #
Generic Associativity	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Associated Types type Rep Associativity :: Type -> Type # Methods from :: Associativity -> Rep Associativity x # to :: Rep Associativity x -> Associativity #
Generic SourceUnpackedness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Associated Types type Rep SourceUnpackedness :: Type -> Type # Methods from :: SourceUnpackedness -> Rep SourceUnpackedness x # to :: Rep SourceUnpackedness x -> SourceUnpackedness #
Generic SourceStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Associated Types type Rep SourceStrictness :: Type -> Type # Methods from :: SourceStrictness -> Rep SourceStrictness x # to :: Rep SourceStrictness x -> SourceStrictness #
Generic DecidedStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Associated Types type Rep DecidedStrictness :: Type -> Type # Methods from :: DecidedStrictness -> Rep DecidedStrictness x # to :: Rep DecidedStrictness x -> DecidedStrictness #
Generic Alphabet
Instance details Defined in Data.ByteString.Base58.Internal Associated Types type Rep Alphabet :: Type -> Type # Methods from :: Alphabet -> Rep Alphabet x # to :: Rep Alphabet x -> Alphabet #
Generic F2Poly
Instance details Defined in Data.Bit.F2Poly Associated Types type Rep F2Poly :: Type -> Type # Methods from :: F2Poly -> Rep F2Poly x # to :: Rep F2Poly x -> F2Poly #
Generic Bit
Instance details Defined in Data.Bit.Internal Associated Types type Rep Bit :: Type -> Type # Methods from :: Bit -> Rep Bit x # to :: Rep Bit x -> Bit #
Generic Clock
Instance details Defined in System.Clock Associated Types type Rep Clock :: Type -> Type # Methods from :: Clock -> Rep Clock x # to :: Rep Clock x -> Clock #
Generic TimeSpec
Instance details Defined in System.Clock Associated Types type Rep TimeSpec :: Type -> Type # Methods from :: TimeSpec -> Rep TimeSpec x # to :: Rep TimeSpec x -> TimeSpec #
Generic ConstructorInfo
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep ConstructorInfo :: Type -> Type # Methods from :: ConstructorInfo -> Rep ConstructorInfo x # to :: Rep ConstructorInfo x -> ConstructorInfo #
Generic DatatypeVariant
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep DatatypeVariant :: Type -> Type # Methods from :: DatatypeVariant -> Rep DatatypeVariant x # to :: Rep DatatypeVariant x -> DatatypeVariant #
Generic Extension
Instance details Defined in GHC.LanguageExtensions.Type Associated Types type Rep Extension :: Type -> Type # Methods from :: Extension -> Rep Extension x # to :: Rep Extension x -> Extension #
Generic ForeignSrcLang
Instance details Defined in GHC.ForeignSrcLang.Type Associated Types type Rep ForeignSrcLang :: Type -> Type # Methods from :: ForeignSrcLang -> Rep ForeignSrcLang x # to :: Rep ForeignSrcLang x -> ForeignSrcLang #
Generic RuleBndr
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep RuleBndr :: Type -> Type # Methods from :: RuleBndr -> Rep RuleBndr x # to :: Rep RuleBndr x -> RuleBndr #
Generic Phases
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Phases :: Type -> Type # Methods from :: Phases -> Rep Phases x # to :: Rep Phases x -> Phases #
Generic RuleMatch
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep RuleMatch :: Type -> Type # Methods from :: RuleMatch -> Rep RuleMatch x # to :: Rep RuleMatch x -> RuleMatch #
Generic Inline
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Inline :: Type -> Type # Methods from :: Inline -> Rep Inline x # to :: Rep Inline x -> Inline #
Generic Pragma
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Pragma :: Type -> Type # Methods from :: Pragma -> Rep Pragma x # to :: Rep Pragma x -> Pragma #
Generic DerivClause
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep DerivClause :: Type -> Type # Methods from :: DerivClause -> Rep DerivClause x # to :: Rep DerivClause x -> DerivClause #
Generic DerivStrategy
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep DerivStrategy :: Type -> Type # Methods from :: DerivStrategy -> Rep DerivStrategy x # to :: Rep DerivStrategy x -> DerivStrategy #
Generic TySynEqn
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep TySynEqn :: Type -> Type # Methods from :: TySynEqn -> Rep TySynEqn x # to :: Rep TySynEqn x -> TySynEqn #
Generic Fixity
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Fixity :: Type -> Type # Methods from :: Fixity -> Rep Fixity x # to :: Rep Fixity x -> Fixity #
Generic Info
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Info :: Type -> Type # Methods from :: Info -> Rep Info x # to :: Rep Info x -> Info #
Generic Con
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Con :: Type -> Type # Methods from :: Con -> Rep Con x # to :: Rep Con x -> Con #
Generic TyVarBndr
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep TyVarBndr :: Type -> Type # Methods from :: TyVarBndr -> Rep TyVarBndr x # to :: Rep TyVarBndr x -> TyVarBndr #
Generic Pos
Instance details Defined in Text.Megaparsec.Pos Associated Types type Rep Pos :: Type -> Type # Methods from :: Pos -> Rep Pos x # to :: Rep Pos x -> Pos #
Generic InvalidPosException
Instance details Defined in Text.Megaparsec.Pos Associated Types type Rep InvalidPosException :: Type -> Type # Methods from :: InvalidPosException -> Rep InvalidPosException x # to :: Rep InvalidPosException x -> InvalidPosException #
Generic SourcePos
Instance details Defined in Text.Megaparsec.Pos Associated Types type Rep SourcePos :: Type -> Type # Methods from :: SourcePos -> Rep SourcePos x # to :: Rep SourcePos x -> SourcePos #
Generic TextDetails
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types type Rep TextDetails :: Type -> Type # Methods from :: TextDetails -> Rep TextDetails x # to :: Rep TextDetails x -> TextDetails #
Generic Style
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types type Rep Style :: Type -> Type # Methods from :: Style -> Rep Style x # to :: Rep Style x -> Style #
Generic Mode
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types type Rep Mode :: Type -> Type # Methods from :: Mode -> Rep Mode x # to :: Rep Mode x -> Mode #
Generic Mod2
Instance details Defined in Data.Semiring Associated Types type Rep Mod2 :: Type -> Type # Methods from :: Mod2 -> Rep Mod2 x # to :: Rep Mod2 x -> Mod2 #
Generic Outcome
Instance details Defined in Test.Tasty.Core Associated Types type Rep Outcome :: Type -> Type # Methods from :: Outcome -> Rep Outcome x # to :: Rep Outcome x -> Outcome #
Generic Expr
Instance details Defined in Test.Tasty.Patterns.Types Associated Types type Rep Expr :: Type -> Type # Methods from :: Expr -> Rep Expr x # to :: Rep Expr x -> Expr #
Generic ModName
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep ModName :: Type -> Type # Methods from :: ModName -> Rep ModName x # to :: Rep ModName x -> ModName #
Generic PkgName
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep PkgName :: Type -> Type # Methods from :: PkgName -> Rep PkgName x # to :: Rep PkgName x -> PkgName #
Generic Module
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Module :: Type -> Type # Methods from :: Module -> Rep Module x # to :: Rep Module x -> Module #
Generic OccName
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep OccName :: Type -> Type # Methods from :: OccName -> Rep OccName x # to :: Rep OccName x -> OccName #
Generic NameFlavour
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep NameFlavour :: Type -> Type # Methods from :: NameFlavour -> Rep NameFlavour x # to :: Rep NameFlavour x -> NameFlavour #
Generic NameSpace
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep NameSpace :: Type -> Type # Methods from :: NameSpace -> Rep NameSpace x # to :: Rep NameSpace x -> NameSpace #
Generic Loc
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Loc :: Type -> Type # Methods from :: Loc -> Rep Loc x # to :: Rep Loc x -> Loc #
Generic ModuleInfo
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep ModuleInfo :: Type -> Type # Methods from :: ModuleInfo -> Rep ModuleInfo x # to :: Rep ModuleInfo x -> ModuleInfo #
Generic FixityDirection
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep FixityDirection :: Type -> Type # Methods from :: FixityDirection -> Rep FixityDirection x # to :: Rep FixityDirection x -> FixityDirection #
Generic Lit
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Lit :: Type -> Type # Methods from :: Lit -> Rep Lit x # to :: Rep Lit x -> Lit #
Generic Bytes
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Bytes :: Type -> Type # Methods from :: Bytes -> Rep Bytes x # to :: Rep Bytes x -> Bytes #
Generic Body
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Body :: Type -> Type # Methods from :: Body -> Rep Body x # to :: Rep Body x -> Body #
Generic Guard
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Guard :: Type -> Type # Methods from :: Guard -> Rep Guard x # to :: Rep Guard x -> Guard #
Generic Stmt
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Stmt :: Type -> Type # Methods from :: Stmt -> Rep Stmt x # to :: Rep Stmt x -> Stmt #
Generic Range
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Range :: Type -> Type # Methods from :: Range -> Rep Range x # to :: Rep Range x -> Range #
Generic TypeFamilyHead
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep TypeFamilyHead :: Type -> Type # Methods from :: TypeFamilyHead -> Rep TypeFamilyHead x # to :: Rep TypeFamilyHead x -> TypeFamilyHead #
Generic Foreign
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Foreign :: Type -> Type # Methods from :: Foreign -> Rep Foreign x # to :: Rep Foreign x -> Foreign #
Generic Callconv
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Callconv :: Type -> Type # Methods from :: Callconv -> Rep Callconv x # to :: Rep Callconv x -> Callconv #
Generic Safety
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Safety :: Type -> Type # Methods from :: Safety -> Rep Safety x # to :: Rep Safety x -> Safety #
Generic AnnTarget
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep AnnTarget :: Type -> Type # Methods from :: AnnTarget -> Rep AnnTarget x # to :: Rep AnnTarget x -> AnnTarget #
Generic SourceUnpackedness
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep SourceUnpackedness :: Type -> Type # Methods from :: SourceUnpackedness -> Rep SourceUnpackedness x # to :: Rep SourceUnpackedness x -> SourceUnpackedness #
Generic SourceStrictness
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep SourceStrictness :: Type -> Type # Methods from :: SourceStrictness -> Rep SourceStrictness x # to :: Rep SourceStrictness x -> SourceStrictness #
Generic DecidedStrictness
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep DecidedStrictness :: Type -> Type # Methods from :: DecidedStrictness -> Rep DecidedStrictness x # to :: Rep DecidedStrictness x -> DecidedStrictness #
Generic Bang
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Bang :: Type -> Type # Methods from :: Bang -> Rep Bang x # to :: Rep Bang x -> Bang #
Generic PatSynDir
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep PatSynDir :: Type -> Type # Methods from :: PatSynDir -> Rep PatSynDir x # to :: Rep PatSynDir x -> PatSynDir #
Generic PatSynArgs
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep PatSynArgs :: Type -> Type # Methods from :: PatSynArgs -> Rep PatSynArgs x # to :: Rep PatSynArgs x -> PatSynArgs #
Generic FamilyResultSig
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep FamilyResultSig :: Type -> Type # Methods from :: FamilyResultSig -> Rep FamilyResultSig x # to :: Rep FamilyResultSig x -> FamilyResultSig #
Generic TyLit
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep TyLit :: Type -> Type # Methods from :: TyLit -> Rep TyLit x # to :: Rep TyLit x -> TyLit #
Generic Role
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Role :: Type -> Type # Methods from :: Role -> Rep Role x # to :: Rep Role x -> Role #
Generic AnnLookup
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep AnnLookup :: Type -> Type # Methods from :: AnnLookup -> Rep AnnLookup x # to :: Rep AnnLookup x -> AnnLookup #
Generic DatatypeInfo
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep DatatypeInfo :: Type -> Type # Methods from :: DatatypeInfo -> Rep DatatypeInfo x # to :: Rep DatatypeInfo x -> DatatypeInfo #
Generic ConstructorVariant
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep ConstructorVariant :: Type -> Type # Methods from :: ConstructorVariant -> Rep ConstructorVariant x # to :: Rep ConstructorVariant x -> ConstructorVariant #
Generic FieldStrictness
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep FieldStrictness :: Type -> Type # Methods from :: FieldStrictness -> Rep FieldStrictness x # to :: Rep FieldStrictness x -> FieldStrictness #
Generic Unpackedness
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep Unpackedness :: Type -> Type # Methods from :: Unpackedness -> Rep Unpackedness x # to :: Rep Unpackedness x -> Unpackedness #
Generic Strictness
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep Strictness :: Type -> Type # Methods from :: Strictness -> Rep Strictness x # to :: Rep Strictness x -> Strictness #
Generic Specificity
Instance details Defined in Language.Haskell.TH.Datatype.TyVarBndr Associated Types type Rep Specificity :: Type -> Type # Methods from :: Specificity -> Rep Specificity x # to :: Rep Specificity x -> Specificity #
Generic DTypeArg
Instance details Defined in Language.Haskell.TH.Desugar.Core Associated Types type Rep DTypeArg :: Type -> Type # Methods from :: DTypeArg -> Rep DTypeArg x # to :: Rep DTypeArg x -> DTypeArg #
Generic DFunArgs
Instance details Defined in Language.Haskell.TH.Desugar.Core Associated Types type Rep DFunArgs :: Type -> Type # Methods from :: DFunArgs -> Rep DFunArgs x # to :: Rep DFunArgs x -> DFunArgs #
Generic DVisFunArg
Instance details Defined in Language.Haskell.TH.Desugar.Core Associated Types type Rep DVisFunArg :: Type -> Type # Methods from :: DVisFunArg -> Rep DVisFunArg x # to :: Rep DVisFunArg x -> DVisFunArg #
Generic DExp
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DExp :: Type -> Type # Methods from :: DExp -> Rep DExp x # to :: Rep DExp x -> DExp #
Generic DPat
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DPat :: Type -> Type # Methods from :: DPat -> Rep DPat x # to :: Rep DPat x -> DPat #
Generic DType
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DType :: Type -> Type # Methods from :: DType -> Rep DType x # to :: Rep DType x -> DType #
Generic DTyVarBndr
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DTyVarBndr :: Type -> Type # Methods from :: DTyVarBndr -> Rep DTyVarBndr x # to :: Rep DTyVarBndr x -> DTyVarBndr #
Generic DMatch
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DMatch :: Type -> Type # Methods from :: DMatch -> Rep DMatch x # to :: Rep DMatch x -> DMatch #
Generic DClause
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DClause :: Type -> Type # Methods from :: DClause -> Rep DClause x # to :: Rep DClause x -> DClause #
Generic DLetDec
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DLetDec :: Type -> Type # Methods from :: DLetDec -> Rep DLetDec x # to :: Rep DLetDec x -> DLetDec #
Generic NewOrData
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep NewOrData :: Type -> Type # Methods from :: NewOrData -> Rep NewOrData x # to :: Rep NewOrData x -> NewOrData #
Generic DDec
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DDec :: Type -> Type # Methods from :: DDec -> Rep DDec x # to :: Rep DDec x -> DDec #
Generic DPatSynDir
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DPatSynDir :: Type -> Type # Methods from :: DPatSynDir -> Rep DPatSynDir x # to :: Rep DPatSynDir x -> DPatSynDir #
Generic DTypeFamilyHead
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DTypeFamilyHead :: Type -> Type # Methods from :: DTypeFamilyHead -> Rep DTypeFamilyHead x # to :: Rep DTypeFamilyHead x -> DTypeFamilyHead #
Generic DFamilyResultSig
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DFamilyResultSig :: Type -> Type # Methods from :: DFamilyResultSig -> Rep DFamilyResultSig x # to :: Rep DFamilyResultSig x -> DFamilyResultSig #
Generic DCon
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DCon :: Type -> Type # Methods from :: DCon -> Rep DCon x # to :: Rep DCon x -> DCon #
Generic DConFields
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DConFields :: Type -> Type # Methods from :: DConFields -> Rep DConFields x # to :: Rep DConFields x -> DConFields #
Generic DForeign
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DForeign :: Type -> Type # Methods from :: DForeign -> Rep DForeign x # to :: Rep DForeign x -> DForeign #
Generic DPragma
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DPragma :: Type -> Type # Methods from :: DPragma -> Rep DPragma x # to :: Rep DPragma x -> DPragma #
Generic DRuleBndr
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DRuleBndr :: Type -> Type # Methods from :: DRuleBndr -> Rep DRuleBndr x # to :: Rep DRuleBndr x -> DRuleBndr #
Generic DTySynEqn
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DTySynEqn :: Type -> Type # Methods from :: DTySynEqn -> Rep DTySynEqn x # to :: Rep DTySynEqn x -> DTySynEqn #
Generic DInfo
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DInfo :: Type -> Type # Methods from :: DInfo -> Rep DInfo x # to :: Rep DInfo x -> DInfo #
Generic DDerivClause
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DDerivClause :: Type -> Type # Methods from :: DDerivClause -> Rep DDerivClause x # to :: Rep DDerivClause x -> DDerivClause #
Generic DDerivStrategy
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DDerivStrategy :: Type -> Type # Methods from :: DDerivStrategy -> Rep DDerivStrategy x # to :: Rep DDerivStrategy x -> DDerivStrategy #
Generic Undefined
Instance details Defined in Universum.Debug Associated Types type Rep Undefined :: Type -> Type # Methods from :: Undefined -> Rep Undefined x # to :: Rep Undefined x -> Undefined #
Generic MText
Instance details Defined in Morley.Michelson.Text Associated Types type Rep MText :: Type -> Type # Methods from :: MText -> Rep MText x # to :: Rep MText x -> MText #
Generic MutezArithErrorType
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type Rep MutezArithErrorType :: Type -> Type # Methods from :: MutezArithErrorType -> Rep MutezArithErrorType x # to :: Rep MutezArithErrorType x -> MutezArithErrorType #
Generic ShiftArithErrorType
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type Rep ShiftArithErrorType :: Type -> Type # Methods from :: ShiftArithErrorType -> Rep ShiftArithErrorType x # to :: Rep ShiftArithErrorType x -> ShiftArithErrorType #
Generic ArmCoord
Instance details Defined in Morley.Michelson.Typed.Entrypoints Associated Types type Rep ArmCoord :: Type -> Type # Methods from :: ArmCoord -> Rep ArmCoord x # to :: Rep ArmCoord x -> ArmCoord #
Generic EpAddress
Instance details Defined in Morley.Michelson.Typed.Entrypoints Associated Types type Rep EpAddress :: Type -> Type # Methods from :: EpAddress -> Rep EpAddress x # to :: Rep EpAddress x -> EpAddress #
Generic ParamEpError
Instance details Defined in Morley.Michelson.Typed.Entrypoints Associated Types type Rep ParamEpError :: Type -> Type # Methods from :: ParamEpError -> Rep ParamEpError x # to :: Rep ParamEpError x -> ParamEpError #
Generic ParseEpAddressError
Instance details Defined in Morley.Michelson.Typed.Entrypoints Associated Types type Rep ParseEpAddressError :: Type -> Type # Methods from :: ParseEpAddressError -> Rep ParseEpAddressError x # to :: Rep ParseEpAddressError x -> ParseEpAddressError #
Generic DStorageType
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type Rep DStorageType :: Type -> Type # Methods from :: DStorageType -> Rep DStorageType x # to :: Rep DStorageType x -> DStorageType #
Generic MyCompoundType
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type Rep MyCompoundType :: Type -> Type # Methods from :: MyCompoundType -> Rep MyCompoundType x # to :: Rep MyCompoundType x -> MyCompoundType #
Generic CommentType
Instance details Defined in Morley.Michelson.Typed.Instr Associated Types type Rep CommentType :: Type -> Type # Methods from :: CommentType -> Rep CommentType x # to :: Rep CommentType x -> CommentType #
Generic BadTypeForScope
Instance details Defined in Morley.Michelson.Typed.Scope Associated Types type Rep BadTypeForScope :: Type -> Type # Methods from :: BadTypeForScope -> Rep BadTypeForScope x # to :: Rep BadTypeForScope x -> BadTypeForScope #
Generic T
Instance details Defined in Morley.Michelson.Typed.T Associated Types type Rep T :: Type -> Type # Methods from :: T -> Rep T x # to :: Rep T x -> T #
Generic SetDelegate
Instance details Defined in Morley.Michelson.Typed.Value Associated Types type Rep SetDelegate :: Type -> Type # Methods from :: SetDelegate -> Rep SetDelegate x # to :: Rep SetDelegate x -> SetDelegate #
Generic EpName
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Associated Types type Rep EpName :: Type -> Type # Methods from :: EpName -> Rep EpName x # to :: Rep EpName x -> EpName #
Generic EpNameFromRefAnnError
Instance details Defined in Morley.Michelson.Untyped.Entrypoints Associated Types type Rep EpNameFromRefAnnError :: Type -> Type # Methods from :: EpNameFromRefAnnError -> Rep EpNameFromRefAnnError x # to :: Rep EpNameFromRefAnnError x -> EpNameFromRefAnnError #
Generic ViewName
Instance details Defined in Morley.Michelson.Untyped.View Associated Types type Rep ViewName :: Type -> Type # Methods from :: ViewName -> Rep ViewName x # to :: Rep ViewName x -> ViewName #
Generic Address
Instance details Defined in Morley.Tezos.Address Associated Types type Rep Address :: Type -> Type # Methods from :: Address -> Rep Address x # to :: Rep Address x -> Address #
Generic ChainId
Instance details Defined in Morley.Tezos.Core Associated Types type Rep ChainId :: Type -> Type # Methods from :: ChainId -> Rep ChainId x # to :: Rep ChainId x -> ChainId #
Generic Chest
Instance details Defined in Morley.Tezos.Crypto.Timelock Associated Types type Rep Chest :: Type -> Type # Methods from :: Chest -> Rep Chest x # to :: Rep Chest x -> Chest #
Generic ChestKey
Instance details Defined in Morley.Tezos.Crypto.Timelock Associated Types type Rep ChestKey :: Type -> Type # Methods from :: ChestKey -> Rep ChestKey x # to :: Rep ChestKey x -> ChestKey #
Generic KeyHash
Instance details Defined in Morley.Tezos.Crypto Associated Types type Rep KeyHash :: Type -> Type # Methods from :: KeyHash -> Rep KeyHash x # to :: Rep KeyHash x -> KeyHash #
Generic Mutez
Instance details Defined in Morley.Tezos.Core Associated Types type Rep Mutez :: Type -> Type # Methods from :: Mutez -> Rep Mutez x # to :: Rep Mutez x -> Mutez #
Generic PublicKey
Instance details Defined in Morley.Tezos.Crypto Associated Types type Rep PublicKey :: Type -> Type # Methods from :: PublicKey -> Rep PublicKey x # to :: Rep PublicKey x -> PublicKey #
Generic Signature
Instance details Defined in Morley.Tezos.Crypto Associated Types type Rep Signature :: Type -> Type # Methods from :: Signature -> Rep Signature x # to :: Rep Signature x -> Signature #
Generic Timestamp
Instance details Defined in Morley.Tezos.Core Associated Types type Rep Timestamp :: Type -> Type # Methods from :: Timestamp -> Rep Timestamp x # to :: Rep Timestamp x -> Timestamp #
Generic VarAnns
Instance details Defined in Morley.Michelson.Untyped.Annotation Associated Types type Rep VarAnns :: Type -> Type # Methods from :: VarAnns -> Rep VarAnns x # to :: Rep VarAnns x -> VarAnns #
Generic EntriesOrder
Instance details Defined in Morley.Michelson.Untyped.Contract Associated Types type Rep EntriesOrder :: Type -> Type # Methods from :: EntriesOrder -> Rep EntriesOrder x # to :: Rep EntriesOrder x -> EntriesOrder #
Generic PrintComment
Instance details Defined in Morley.Michelson.Untyped.Ext Associated Types type Rep PrintComment :: Type -> Type # Methods from :: PrintComment -> Rep PrintComment x # to :: Rep PrintComment x -> PrintComment #
Generic StackFn
Instance details Defined in Morley.Michelson.Untyped.Ext Associated Types type Rep StackFn :: Type -> Type # Methods from :: StackFn -> Rep StackFn x # to :: Rep StackFn x -> StackFn #
Generic StackRef
Instance details Defined in Morley.Michelson.Untyped.Ext Associated Types type Rep StackRef :: Type -> Type # Methods from :: StackRef -> Rep StackRef x # to :: Rep StackRef x -> StackRef #
Generic StackTypePattern
Instance details Defined in Morley.Michelson.Untyped.Ext Associated Types type Rep StackTypePattern :: Type -> Type # Methods from :: StackTypePattern -> Rep StackTypePattern x # to :: Rep StackTypePattern x -> StackTypePattern #
Generic TyVar
Instance details Defined in Morley.Michelson.Untyped.Ext Associated Types type Rep TyVar :: Type -> Type # Methods from :: TyVar -> Rep TyVar x # to :: Rep TyVar x -> TyVar #
Generic Var
Instance details Defined in Morley.Michelson.Untyped.Ext Associated Types type Rep Var :: Type -> Type # Methods from :: Var -> Rep Var x # to :: Rep Var x -> Var #
Generic ExpandedOp
Instance details Defined in Morley.Michelson.Untyped.Instr Associated Types type Rep ExpandedOp :: Type -> Type # Methods from :: ExpandedOp -> Rep ExpandedOp x # to :: Rep ExpandedOp x -> ExpandedOp #
Generic ParameterType
Instance details Defined in Morley.Michelson.Untyped.Type Associated Types type Rep ParameterType :: Type -> Type # Methods from :: ParameterType -> Rep ParameterType x # to :: Rep ParameterType x -> ParameterType #
Generic T
Instance details Defined in Morley.Michelson.Untyped.Type Associated Types type Rep T :: Type -> Type # Methods from :: T -> Rep T x # to :: Rep T x -> T #
Generic Ty
Instance details Defined in Morley.Michelson.Untyped.Type Associated Types type Rep Ty :: Type -> Type # Methods from :: Ty -> Rep Ty x # to :: Rep Ty x -> Ty #
Generic InternalByteString
Instance details Defined in Morley.Michelson.Untyped.Value Associated Types type Rep InternalByteString :: Type -> Type # Methods from :: InternalByteString -> Rep InternalByteString x # to :: Rep InternalByteString x -> InternalByteString #
Generic BadViewNameError
Instance details Defined in Morley.Michelson.Untyped.View Associated Types type Rep BadViewNameError :: Type -> Type # Methods from :: BadViewNameError -> Rep BadViewNameError x # to :: Rep BadViewNameError x -> BadViewNameError #
Generic ContractHash
Instance details Defined in Morley.Tezos.Address Associated Types type Rep ContractHash :: Type -> Type # Methods from :: ContractHash -> Rep ContractHash x # to :: Rep ContractHash x -> ContractHash #
Generic GlobalCounter
Instance details Defined in Morley.Tezos.Address Associated Types type Rep GlobalCounter :: Type -> Type # Methods from :: GlobalCounter -> Rep GlobalCounter x # to :: Rep GlobalCounter x -> GlobalCounter #
Generic ParseAddressError
Instance details Defined in Morley.Tezos.Address Associated Types type Rep ParseAddressError :: Type -> Type # Methods from :: ParseAddressError -> Rep ParseAddressError x # to :: Rep ParseAddressError x -> ParseAddressError #
Generic ParseAddressRawError
Instance details Defined in Morley.Tezos.Address Associated Types type Rep ParseAddressRawError :: Type -> Type # Methods from :: ParseAddressRawError -> Rep ParseAddressRawError x # to :: Rep ParseAddressRawError x -> ParseAddressRawError #
Generic ParseContractAddressError
Instance details Defined in Morley.Tezos.Address Associated Types type Rep ParseContractAddressError :: Type -> Type # Methods from :: ParseContractAddressError -> Rep ParseContractAddressError x # to :: Rep ParseContractAddressError x -> ParseContractAddressError #
Generic KeyHashTag
Instance details Defined in Morley.Tezos.Crypto Associated Types type Rep KeyHashTag :: Type -> Type # Methods from :: KeyHashTag -> Rep KeyHashTag x # to :: Rep KeyHashTag x -> KeyHashTag #
Generic SecretKey
Instance details Defined in Morley.Tezos.Crypto Associated Types type Rep SecretKey :: Type -> Type # Methods from :: SecretKey -> Rep SecretKey x # to :: Rep SecretKey x -> SecretKey #
Generic ParseSignatureRawError
Instance details Defined in Morley.Tezos.Crypto Associated Types type Rep ParseSignatureRawError :: Type -> Type # Methods from :: ParseSignatureRawError -> Rep ParseSignatureRawError x # to :: Rep ParseSignatureRawError x -> ParseSignatureRawError #
Generic PublicKey
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Associated Types type Rep PublicKey :: Type -> Type # Methods from :: PublicKey -> Rep PublicKey x # to :: Rep PublicKey x -> PublicKey #
Generic PublicKey
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Associated Types type Rep PublicKey :: Type -> Type # Methods from :: PublicKey -> Rep PublicKey x # to :: Rep PublicKey x -> PublicKey #
Generic PublicKey
Instance details Defined in Morley.Tezos.Crypto.P256 Associated Types type Rep PublicKey :: Type -> Type # Methods from :: PublicKey -> Rep PublicKey x # to :: Rep PublicKey x -> PublicKey #
Generic SecretKey
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Associated Types type Rep SecretKey :: Type -> Type # Methods from :: SecretKey -> Rep SecretKey x # to :: Rep SecretKey x -> SecretKey #
Generic SecretKey
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Associated Types type Rep SecretKey :: Type -> Type # Methods from :: SecretKey -> Rep SecretKey x # to :: Rep SecretKey x -> SecretKey #
Generic SecretKey
Instance details Defined in Morley.Tezos.Crypto.P256 Associated Types type Rep SecretKey :: Type -> Type # Methods from :: SecretKey -> Rep SecretKey x # to :: Rep SecretKey x -> SecretKey #
Generic Signature
Instance details Defined in Morley.Tezos.Crypto.Ed25519 Associated Types type Rep Signature :: Type -> Type # Methods from :: Signature -> Rep Signature x # to :: Rep Signature x -> Signature #
Generic Signature
Instance details Defined in Morley.Tezos.Crypto.Secp256k1 Associated Types type Rep Signature :: Type -> Type # Methods from :: Signature -> Rep Signature x # to :: Rep Signature x -> Signature #
Generic Signature
Instance details Defined in Morley.Tezos.Crypto.P256 Associated Types type Rep Signature :: Type -> Type # Methods from :: Signature -> Rep Signature x # to :: Rep Signature x -> Signature #
Generic Ciphertext
Instance details Defined in Morley.Tezos.Crypto.Timelock Associated Types type Rep Ciphertext :: Type -> Type # Methods from :: Ciphertext -> Rep Ciphertext x # to :: Rep Ciphertext x -> Ciphertext #
Generic InstrCallStack
Instance details Defined in Morley.Michelson.ErrorPos Associated Types type Rep InstrCallStack :: Type -> Type # Methods from :: InstrCallStack -> Rep InstrCallStack x # to :: Rep InstrCallStack x -> InstrCallStack #
Generic DeserializationError
Instance details Defined in Morley.Tezos.Crypto.BLS12381 Associated Types type Rep DeserializationError :: Type -> Type # Methods from :: DeserializationError -> Rep DeserializationError x # to :: Rep DeserializationError x -> DeserializationError #
Generic LetName
Instance details Defined in Morley.Michelson.ErrorPos Associated Types type Rep LetName :: Type -> Type # Methods from :: LetName -> Rep LetName x # to :: Rep LetName x -> LetName #
Generic Pos
Instance details Defined in Morley.Michelson.ErrorPos Associated Types type Rep Pos :: Type -> Type # Methods from :: Pos -> Rep Pos x # to :: Rep Pos x -> Pos #
Generic SrcPos
Instance details Defined in Morley.Michelson.ErrorPos Associated Types type Rep SrcPos :: Type -> Type # Methods from :: SrcPos -> Rep SrcPos x # to :: Rep SrcPos x -> SrcPos #
Generic ExtError
Instance details Defined in Morley.Michelson.TypeCheck.Error Associated Types type Rep ExtError :: Type -> Type # Methods from :: ExtError -> Rep ExtError x # to :: Rep ExtError x -> ExtError #
Generic StackSize
Instance details Defined in Morley.Michelson.TypeCheck.Error Associated Types type Rep StackSize :: Type -> Type # Methods from :: StackSize -> Rep StackSize x # to :: Rep StackSize x -> StackSize #
Generic TCError
Instance details Defined in Morley.Michelson.TypeCheck.Error Associated Types type Rep TCError :: Type -> Type # Methods from :: TCError -> Rep TCError x # to :: Rep TCError x -> TCError #
Generic TCTypeError
Instance details Defined in Morley.Michelson.TypeCheck.Error Associated Types type Rep TCTypeError :: Type -> Type # Methods from :: TCTypeError -> Rep TCTypeError x # to :: Rep TCTypeError x -> TCTypeError #
Generic TopLevelType
Instance details Defined in Morley.Michelson.TypeCheck.Error Associated Types type Rep TopLevelType :: Type -> Type # Methods from :: TopLevelType -> Rep TopLevelType x # to :: Rep TopLevelType x -> TopLevelType #
Generic TypeContext
Instance details Defined in Morley.Michelson.TypeCheck.Error Associated Types type Rep TypeContext :: Type -> Type # Methods from :: TypeContext -> Rep TypeContext x # to :: Rep TypeContext x -> TypeContext #
Generic IllTypedInstr
Instance details Defined in Morley.Michelson.TypeCheck.TypeCheckedOp Associated Types type Rep IllTypedInstr :: Type -> Type # Methods from :: IllTypedInstr -> Rep IllTypedInstr x # to :: Rep IllTypedInstr x -> IllTypedInstr #
Generic MyType2
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Product Associated Types type Rep MyType2 :: Type -> Type # Methods from :: MyType2 -> Rep MyType2 x # to :: Rep MyType2 x -> MyType2 #
Generic MyType
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type Rep MyType :: Type -> Type # Methods from :: MyType -> Rep MyType x # to :: Rep MyType x -> MyType #
Generic MyType'
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type Rep MyType' :: Type -> Type # Methods from :: MyType' -> Rep MyType' x # to :: Rep MyType' x -> MyType' #
Generic MyEnum
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type Rep MyEnum :: Type -> Type # Methods from :: MyEnum -> Rep MyEnum x # to :: Rep MyEnum x -> MyEnum #
Generic MyTypeWithNamedField
Instance details Defined in Morley.Michelson.Typed.Haskell.Instr.Sum Associated Types type Rep MyTypeWithNamedField :: Type -> Type # Methods from :: MyTypeWithNamedField -> Rep MyTypeWithNamedField x # to :: Rep MyTypeWithNamedField x -> MyTypeWithNamedField #
Generic HexJSONByteString
Instance details Defined in Morley.Util.ByteString Associated Types type Rep HexJSONByteString :: Type -> Type # Methods from :: HexJSONByteString -> Rep HexJSONByteString x # to :: Rep HexJSONByteString x -> HexJSONByteString #
Generic CustomParserException
Instance details Defined in Morley.Michelson.Parser.Error Associated Types type Rep CustomParserException :: Type -> Type # Methods from :: CustomParserException -> Rep CustomParserException x # to :: Rep CustomParserException x -> CustomParserException #
Generic StringLiteralParserException
Instance details Defined in Morley.Michelson.Parser.Error Associated Types type Rep StringLiteralParserException :: Type -> Type # Methods from :: StringLiteralParserException -> Rep StringLiteralParserException x # to :: Rep StringLiteralParserException x -> StringLiteralParserException #
Generic ParsedOp
Instance details Defined in Morley.Michelson.Macro Associated Types type Rep ParsedOp :: Type -> Type # Methods from :: ParsedOp -> Rep ParsedOp x # to :: Rep ParsedOp x -> ParsedOp #
Generic LetMacro
Instance details Defined in Morley.Michelson.Macro Associated Types type Rep LetMacro :: Type -> Type # Methods from :: LetMacro -> Rep LetMacro x # to :: Rep LetMacro x -> LetMacro #
Generic CadrStruct
Instance details Defined in Morley.Michelson.Macro Associated Types type Rep CadrStruct :: Type -> Type # Methods from :: CadrStruct -> Rep CadrStruct x # to :: Rep CadrStruct x -> CadrStruct #
Generic Macro
Instance details Defined in Morley.Michelson.Macro Associated Types type Rep Macro :: Type -> Type # Methods from :: Macro -> Rep Macro x # to :: Rep Macro x -> Macro #
Generic PairStruct
Instance details Defined in Morley.Michelson.Macro Associated Types type Rep PairStruct :: Type -> Type # Methods from :: PairStruct -> Rep PairStruct x # to :: Rep PairStruct x -> PairStruct #
Generic UnpairStruct
Instance details Defined in Morley.Michelson.Macro Associated Types type Rep UnpairStruct :: Type -> Type # Methods from :: UnpairStruct -> Rep UnpairStruct x # to :: Rep UnpairStruct x -> UnpairStruct #
Generic Positive
Instance details Defined in Morley.Util.Positive Associated Types type Rep Positive :: Type -> Type # Methods from :: Positive -> Rep Positive x # to :: Rep Positive x -> Positive #
Generic Never Source #
Instance details Defined in Lorentz.Value Associated Types type Rep Never :: Type -> Type # Methods from :: Never -> Rep Never x # to :: Rep Never x -> Never #
Generic OpenChest Source #
Instance details Defined in Lorentz.Value Associated Types type Rep OpenChest :: Type -> Type # Methods from :: OpenChest -> Rep OpenChest x # to :: Rep OpenChest x -> OpenChest #
Generic ZSNil Source #
Instance details Defined in Lorentz.Zip Associated Types type Rep ZSNil :: Type -> Type # Methods from :: ZSNil -> Rep ZSNil x # to :: Rep ZSNil x -> ZSNil #
Generic UnspecifiedError Source #
Instance details Defined in Lorentz.Errors Associated Types type Rep UnspecifiedError :: Type -> Type # Methods from :: UnspecifiedError -> Rep UnspecifiedError x # to :: Rep UnspecifiedError x -> UnspecifiedError #
Generic Empty Source #
Instance details Defined in Lorentz.Empty Associated Types type Rep Empty :: Type -> Type # Methods from :: Empty -> Rep Empty x # to :: Rep Empty x -> Empty #
Generic EntrypointLookupError Source #
Instance details Defined in Lorentz.UParam Associated Types type Rep EntrypointLookupError :: Type -> Type # Methods from :: EntrypointLookupError -> Rep EntrypointLookupError x # to :: Rep EntrypointLookupError x -> EntrypointLookupError #
Generic InterpretError
Instance details Defined in Morley.Michelson.Interpret Associated Types type Rep InterpretError :: Type -> Type # Methods from :: InterpretError -> Rep InterpretError x # to :: Rep InterpretError x -> InterpretError #
Generic InterpreterState
Instance details Defined in Morley.Michelson.Interpret Associated Types type Rep InterpreterState :: Type -> Type # Methods from :: InterpreterState -> Rep InterpreterState x # to :: Rep InterpreterState x -> InterpreterState #
Generic MichelsonFailureWithStack
Instance details Defined in Morley.Michelson.Interpret Associated Types type Rep MichelsonFailureWithStack :: Type -> Type # Methods from :: MichelsonFailureWithStack -> Rep MichelsonFailureWithStack x # to :: Rep MichelsonFailureWithStack x -> MichelsonFailureWithStack #
Generic MorleyLogs
Instance details Defined in Morley.Michelson.Interpret Associated Types type Rep MorleyLogs :: Type -> Type # Methods from :: MorleyLogs -> Rep MorleyLogs x # to :: Rep MorleyLogs x -> MorleyLogs #
Generic MorleyLogsBuilder
Instance details Defined in Morley.Michelson.Interpret Associated Types type Rep MorleyLogsBuilder :: Type -> Type # Methods from :: MorleyLogsBuilder -> Rep MorleyLogsBuilder x # to :: Rep MorleyLogsBuilder x -> MorleyLogsBuilder #
Generic RemainingSteps
Instance details Defined in Morley.Michelson.Interpret Associated Types type Rep RemainingSteps :: Type -> Type # Methods from :: RemainingSteps -> Rep RemainingSteps x # to :: Rep RemainingSteps x -> RemainingSteps #
Generic BigMapCounter
Instance details Defined in Morley.Michelson.Runtime.GState Associated Types type Rep BigMapCounter :: Type -> Type # Methods from :: BigMapCounter -> Rep BigMapCounter x # to :: Rep BigMapCounter x -> BigMapCounter #
Generic AddressState
Instance details Defined in Morley.Michelson.Runtime.GState Associated Types type Rep AddressState :: Type -> Type # Methods from :: AddressState -> Rep AddressState x # to :: Rep AddressState x -> AddressState #
Generic OperationHash
Instance details Defined in Morley.Michelson.Typed.Operation Associated Types type Rep OperationHash :: Type -> Type # Methods from :: OperationHash -> Rep OperationHash x # to :: Rep OperationHash x -> OperationHash #
Generic [a]	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep [a] :: Type -> Type # Methods from :: [a] -> Rep [a] x # to :: Rep [a] x -> [a] #
Generic (Maybe a)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (Maybe a) :: Type -> Type # Methods from :: Maybe a -> Rep (Maybe a) x # to :: Rep (Maybe a) x -> Maybe a #
Generic (Par1 p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (Par1 p) :: Type -> Type # Methods from :: Par1 p -> Rep (Par1 p) x # to :: Rep (Par1 p) x -> Par1 p #
Generic (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Associated Types type Rep (First a) :: Type -> Type # Methods from :: First a -> Rep (First a) x # to :: Rep (First a) x -> First a #
Generic (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Associated Types type Rep (Last a) :: Type -> Type # Methods from :: Last a -> Rep (Last a) x # to :: Rep (Last a) x -> Last a #
Generic (Last' a)
Instance details Defined in Distribution.Compat.Semigroup Associated Types type Rep (Last' a) :: Type -> Type # Methods from :: Last' a -> Rep (Last' a) x # to :: Rep (Last' a) x -> Last' a #
Generic (Option' a)
Instance details Defined in Distribution.Compat.Semigroup Associated Types type Rep (Option' a) :: Type -> Type # Methods from :: Option' a -> Rep (Option' a) x # to :: Rep (Option' a) x -> Option' a #
Generic (SCC vertex)	Since: containers-0.5.9
Instance details Defined in Data.Graph Associated Types type Rep (SCC vertex) :: Type -> Type # Methods from :: SCC vertex -> Rep (SCC vertex) x # to :: Rep (SCC vertex) x -> SCC vertex #
Generic (NonEmpty a)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (NonEmpty a) :: Type -> Type # Methods from :: NonEmpty a -> Rep (NonEmpty a) x # to :: Rep (NonEmpty a) x -> NonEmpty a #
Generic (Identity a)	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Associated Types type Rep (Identity a) :: Type -> Type # Methods from :: Identity a -> Rep (Identity a) x # to :: Rep (Identity a) x -> Identity a #
Generic (Complex a)	Since: base-4.9.0.0
Instance details Defined in Data.Complex Associated Types type Rep (Complex a) :: Type -> Type # Methods from :: Complex a -> Rep (Complex a) x # to :: Rep (Complex a) x -> Complex a #
Generic (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Associated Types type Rep (Min a) :: Type -> Type # Methods from :: Min a -> Rep (Min a) x # to :: Rep (Min a) x -> Min a #
Generic (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Associated Types type Rep (Max a) :: Type -> Type # Methods from :: Max a -> Rep (Max a) x # to :: Rep (Max a) x -> Max a #
Generic (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Associated Types type Rep (WrappedMonoid m) :: Type -> Type # Methods from :: WrappedMonoid m -> Rep (WrappedMonoid m) x # to :: Rep (WrappedMonoid m) x -> WrappedMonoid m #
Generic (Option a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Associated Types type Rep (Option a) :: Type -> Type # Methods from :: Option a -> Rep (Option a) x # to :: Rep (Option a) x -> Option a #
Generic (ZipList a)	Since: base-4.7.0.0
Instance details Defined in Control.Applicative Associated Types type Rep (ZipList a) :: Type -> Type # Methods from :: ZipList a -> Rep (ZipList a) x # to :: Rep (ZipList a) x -> ZipList a #
Generic (First a)	Since: base-4.7.0.0
Instance details Defined in Data.Monoid Associated Types type Rep (First a) :: Type -> Type # Methods from :: First a -> Rep (First a) x # to :: Rep (First a) x -> First a #
Generic (Last a)	Since: base-4.7.0.0
Instance details Defined in Data.Monoid Associated Types type Rep (Last a) :: Type -> Type # Methods from :: Last a -> Rep (Last a) x # to :: Rep (Last a) x -> Last a #
Generic (Dual a)	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Dual a) :: Type -> Type # Methods from :: Dual a -> Rep (Dual a) x # to :: Rep (Dual a) x -> Dual a #
Generic (Endo a)	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Endo a) :: Type -> Type # Methods from :: Endo a -> Rep (Endo a) x # to :: Rep (Endo a) x -> Endo a #
Generic (Sum a)	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Sum a) :: Type -> Type # Methods from :: Sum a -> Rep (Sum a) x # to :: Rep (Sum a) x -> Sum a #
Generic (Product a)	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Product a) :: Type -> Type # Methods from :: Product a -> Rep (Product a) x # to :: Rep (Product a) x -> Product a #
Generic (Down a)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (Down a) :: Type -> Type # Methods from :: Down a -> Rep (Down a) x # to :: Rep (Down a) x -> Down a #
Generic (Tree a)	Since: containers-0.5.8
Instance details Defined in Data.Tree Associated Types type Rep (Tree a) :: Type -> Type # Methods from :: Tree a -> Rep (Tree a) x # to :: Rep (Tree a) x -> Tree a #
Generic (FingerTree a)	Since: containers-0.6.1
Instance details Defined in Data.Sequence.Internal Associated Types type Rep (FingerTree a) :: Type -> Type # Methods from :: FingerTree a -> Rep (FingerTree a) x # to :: Rep (FingerTree a) x -> FingerTree a #
Generic (Digit a)	Since: containers-0.6.1
Instance details Defined in Data.Sequence.Internal Associated Types type Rep (Digit a) :: Type -> Type # Methods from :: Digit a -> Rep (Digit a) x # to :: Rep (Digit a) x -> Digit a #
Generic (Node a)	Since: containers-0.6.1
Instance details Defined in Data.Sequence.Internal Associated Types type Rep (Node a) :: Type -> Type # Methods from :: Node a -> Rep (Node a) x # to :: Rep (Node a) x -> Node a #
Generic (Elem a)	Since: containers-0.6.1
Instance details Defined in Data.Sequence.Internal Associated Types type Rep (Elem a) :: Type -> Type # Methods from :: Elem a -> Rep (Elem a) x # to :: Rep (Elem a) x -> Elem a #
Generic (ViewL a)	Since: containers-0.5.8
Instance details Defined in Data.Sequence.Internal Associated Types type Rep (ViewL a) :: Type -> Type # Methods from :: ViewL a -> Rep (ViewL a) x # to :: Rep (ViewL a) x -> ViewL a #
Generic (ViewR a)	Since: containers-0.5.8
Instance details Defined in Data.Sequence.Internal Associated Types type Rep (ViewR a) :: Type -> Type # Methods from :: ViewR a -> Rep (ViewR a) x # to :: Rep (ViewR a) x -> ViewR a #
Generic (Fix f)
Instance details Defined in Data.Fix Associated Types type Rep (Fix f) :: Type -> Type # Methods from :: Fix f -> Rep (Fix f) x # to :: Rep (Fix f) x -> Fix f #
Generic (Prime p)
Instance details Defined in Data.Field.Galois.Prime Associated Types type Rep (Prime p) :: Type -> Type # Methods from :: Prime p -> Rep (Prime p) x # to :: Rep (Prime p) x -> Prime p #
Generic (Binary p)
Instance details Defined in Data.Field.Galois.Binary Associated Types type Rep (Binary p) :: Type -> Type # Methods from :: Binary p -> Rep (Binary p) x # to :: Rep (Binary p) x -> Binary p #
Generic (ErrorItem t)
Instance details Defined in Text.Megaparsec.Error Associated Types type Rep (ErrorItem t) :: Type -> Type # Methods from :: ErrorItem t -> Rep (ErrorItem t) x # to :: Rep (ErrorItem t) x -> ErrorItem t #
Generic (ErrorFancy e)
Instance details Defined in Text.Megaparsec.Error Associated Types type Rep (ErrorFancy e) :: Type -> Type # Methods from :: ErrorFancy e -> Rep (ErrorFancy e) x # to :: Rep (ErrorFancy e) x -> ErrorFancy e #
Generic (PosState s)
Instance details Defined in Text.Megaparsec.State Associated Types type Rep (PosState s) :: Type -> Type # Methods from :: PosState s -> Rep (PosState s) x # to :: Rep (PosState s) x -> PosState s #
Generic (Mod m)
Instance details Defined in Data.Mod Associated Types type Rep (Mod m) :: Type -> Type # Methods from :: Mod m -> Rep (Mod m) x # to :: Rep (Mod m) x -> Mod m #
Generic (Doc a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types type Rep (Doc a) :: Type -> Type # Methods from :: Doc a -> Rep (Doc a) x # to :: Rep (Doc a) x -> Doc a #
Generic (Add a)
Instance details Defined in Data.Semiring Associated Types type Rep (Add a) :: Type -> Type # Methods from :: Add a -> Rep (Add a) x # to :: Rep (Add a) x -> Add a #
Generic (Mul a)
Instance details Defined in Data.Semiring Associated Types type Rep (Mul a) :: Type -> Type # Methods from :: Mul a -> Rep (Mul a) x # to :: Rep (Mul a) x -> Mul a #
Generic (WrappedNum a)
Instance details Defined in Data.Semiring Associated Types type Rep (WrappedNum a) :: Type -> Type # Methods from :: WrappedNum a -> Rep (WrappedNum a) x # to :: Rep (WrappedNum a) x -> WrappedNum a #
Generic (IntSetOf a)
Instance details Defined in Data.Semiring Associated Types type Rep (IntSetOf a) :: Type -> Type # Methods from :: IntSetOf a -> Rep (IntSetOf a) x # to :: Rep (IntSetOf a) x -> IntSetOf a #
Generic (Maybe a)
Instance details Defined in Data.Strict.Maybe Associated Types type Rep (Maybe a) :: Type -> Type # Methods from :: Maybe a -> Rep (Maybe a) x # to :: Rep (Maybe a) x -> Maybe a #
Generic (Identity a)
Instance details Defined in Data.Vinyl.Functor Associated Types type Rep (Identity a) :: Type -> Type # Methods from :: Identity a -> Rep (Identity a) x # to :: Rep (Identity a) x -> Identity a #
KnownSymbol s => Generic (ElField '(s, a))
Instance details Defined in Data.Vinyl.Functor Associated Types type Rep (ElField '(s, a)) :: Type -> Type # Methods from :: ElField '(s, a) -> Rep (ElField '(s, a)) x # to :: Rep (ElField '(s, a)) x -> ElField '(s, a) #
Generic (ParamNotes t)
Instance details Defined in Morley.Michelson.Typed.Entrypoints Associated Types type Rep (ParamNotes t) :: Type -> Type # Methods from :: ParamNotes t -> Rep (ParamNotes t) x # to :: Rep (ParamNotes t) x -> ParamNotes t #
Generic (ExtInstr s)
Instance details Defined in Morley.Michelson.Typed.Instr Associated Types type Rep (ExtInstr s) :: Type -> Type # Methods from :: ExtInstr s -> Rep (ExtInstr s) x # to :: Rep (ExtInstr s) x -> ExtInstr s #
Generic (PrintComment st)
Instance details Defined in Morley.Michelson.Typed.Instr Associated Types type Rep (PrintComment st) :: Type -> Type # Methods from :: PrintComment st -> Rep (PrintComment st) x # to :: Rep (PrintComment st) x -> PrintComment st #
Generic (Contract' op)
Instance details Defined in Morley.Michelson.Untyped.Contract Associated Types type Rep (Contract' op) :: Type -> Type # Methods from :: Contract' op -> Rep (Contract' op) x # to :: Rep (Contract' op) x -> Contract' op #
Generic (ExtInstrAbstract op)
Instance details Defined in Morley.Michelson.Untyped.Ext Associated Types type Rep (ExtInstrAbstract op) :: Type -> Type # Methods from :: ExtInstrAbstract op -> Rep (ExtInstrAbstract op) x # to :: Rep (ExtInstrAbstract op) x -> ExtInstrAbstract op #
Generic (TestAssert op)
Instance details Defined in Morley.Michelson.Untyped.Ext Associated Types type Rep (TestAssert op) :: Type -> Type # Methods from :: TestAssert op -> Rep (TestAssert op) x # to :: Rep (TestAssert op) x -> TestAssert op #
Generic (InstrAbstract op)
Instance details Defined in Morley.Michelson.Untyped.Instr Associated Types type Rep (InstrAbstract op) :: Type -> Type # Methods from :: InstrAbstract op -> Rep (InstrAbstract op) x # to :: Rep (InstrAbstract op) x -> InstrAbstract op #
Generic (Elt op)
Instance details Defined in Morley.Michelson.Untyped.Value Associated Types type Rep (Elt op) :: Type -> Type # Methods from :: Elt op -> Rep (Elt op) x # to :: Rep (Elt op) x -> Elt op #
Generic (Value' op)
Instance details Defined in Morley.Michelson.Untyped.Value Associated Types type Rep (Value' op) :: Type -> Type # Methods from :: Value' op -> Rep (Value' op) x # to :: Rep (Value' op) x -> Value' op #
Generic (View' op)
Instance details Defined in Morley.Michelson.Untyped.View Associated Types type Rep (View' op) :: Type -> Type # Methods from :: View' op -> Rep (View' op) x # to :: Rep (View' op) x -> View' op #
Generic (MismatchError a)
Instance details Defined in Morley.Util.MismatchError Associated Types type Rep (MismatchError a) :: Type -> Type # Methods from :: MismatchError a -> Rep (MismatchError a) x # to :: Rep (MismatchError a) x -> MismatchError a #
Generic (ShouldHaveEntrypoints a) Source #
Instance details Defined in Lorentz.Entrypoints.Helpers Associated Types type Rep (ShouldHaveEntrypoints a) :: Type -> Type # Methods from :: ShouldHaveEntrypoints a -> Rep (ShouldHaveEntrypoints a) x # to :: Rep (ShouldHaveEntrypoints a) x -> ShouldHaveEntrypoints a #
Generic (StringEncode a)
Instance details Defined in Morley.Micheline.Json Associated Types type Rep (StringEncode a) :: Type -> Type # Methods from :: StringEncode a -> Rep (StringEncode a) x # to :: Rep (StringEncode a) x -> StringEncode a #
Generic (ReadTicket a) Source #
Instance details Defined in Lorentz.Value Associated Types type Rep (ReadTicket a) :: Type -> Type # Methods from :: ReadTicket a -> Rep (ReadTicket a) x # to :: Rep (ReadTicket a) x -> ReadTicket a #
Generic (OpenChestT a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type Rep (OpenChestT a) :: Type -> Type # Methods from :: OpenChestT a -> Rep (OpenChestT a) x # to :: Rep (OpenChestT a) x -> OpenChestT a #
Generic (ChestT a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type Rep (ChestT a) :: Type -> Type # Methods from :: ChestT a -> Rep (ChestT a) x # to :: Rep (ChestT a) x -> ChestT a #
Generic (TSignature a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type Rep (TSignature a) :: Type -> Type # Methods from :: TSignature a -> Rep (TSignature a) x # to :: Rep (TSignature a) x -> TSignature a #
Generic (Packed a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type Rep (Packed a) :: Type -> Type # Methods from :: Packed a -> Rep (Packed a) x # to :: Rep (Packed a) x -> Packed a #
Generic (VoidResult r) Source #
Instance details Defined in Lorentz.Macro Associated Types type Rep (VoidResult r) :: Type -> Type # Methods from :: VoidResult r -> Rep (VoidResult r) x # to :: Rep (VoidResult r) x -> VoidResult r #
Generic (UParam entries) Source #
Instance details Defined in Lorentz.UParam Associated Types type Rep (UParam entries) :: Type -> Type # Methods from :: UParam entries -> Rep (UParam entries) x # to :: Rep (UParam entries) x -> UParam entries #
Generic (Either a b)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (Either a b) :: Type -> Type # Methods from :: Either a b -> Rep (Either a b) x # to :: Rep (Either a b) x -> Either a b #
Generic (V1 p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (V1 p) :: Type -> Type # Methods from :: V1 p -> Rep (V1 p) x # to :: Rep (V1 p) x -> V1 p #
Generic (U1 p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (U1 p) :: Type -> Type # Methods from :: U1 p -> Rep (U1 p) x # to :: Rep (U1 p) x -> U1 p #
Generic (a, b)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (a, b) :: Type -> Type # Methods from :: (a, b) -> Rep (a, b) x # to :: Rep (a, b) x -> (a, b) #
Generic (Proxy t)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (Proxy t) :: Type -> Type # Methods from :: Proxy t -> Rep (Proxy t) x # to :: Rep (Proxy t) x -> Proxy t #
Generic (Arg a b)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Associated Types type Rep (Arg a b) :: Type -> Type # Methods from :: Arg a b -> Rep (Arg a b) x # to :: Rep (Arg a b) x -> Arg a b #
Generic (WrappedMonad m a)	Since: base-4.7.0.0
Instance details Defined in Control.Applicative Associated Types type Rep (WrappedMonad m a) :: Type -> Type # Methods from :: WrappedMonad m a -> Rep (WrappedMonad m a) x # to :: Rep (WrappedMonad m a) x -> WrappedMonad m a #
Generic (ListN n a)
Instance details Defined in Basement.Sized.List Associated Types type Rep (ListN n a) :: Type -> Type # Methods from :: ListN n a -> Rep (ListN n a) x # to :: Rep (ListN n a) x -> ListN n a #
Generic (Bimap a b)
Instance details Defined in Data.Bimap Associated Types type Rep (Bimap a b) :: Type -> Type # Methods from :: Bimap a b -> Rep (Bimap a b) x # to :: Rep (Bimap a b) x -> Bimap a b #
Generic (Cofree f a)
Instance details Defined in Control.Comonad.Cofree Associated Types type Rep (Cofree f a) :: Type -> Type # Methods from :: Cofree f a -> Rep (Cofree f a) x # to :: Rep (Cofree f a) x -> Cofree f a #
Generic (Free f a)
Instance details Defined in Control.Monad.Free Associated Types type Rep (Free f a) :: Type -> Type # Methods from :: Free f a -> Rep (Free f a) x # to :: Rep (Free f a) x -> Free f a #
Generic (RootsOfUnity n k)
Instance details Defined in Data.Field.Galois.Unity Associated Types type Rep (RootsOfUnity n k) :: Type -> Type # Methods from :: RootsOfUnity n k -> Rep (RootsOfUnity n k) x # to :: Rep (RootsOfUnity n k) x -> RootsOfUnity n k #
Generic (Extension p k)
Instance details Defined in Data.Field.Galois.Extension Associated Types type Rep (Extension p k) :: Type -> Type # Methods from :: Extension p k -> Rep (Extension p k) x # to :: Rep (Extension p k) x -> Extension p k #
Generic (ParseErrorBundle s e)
Instance details Defined in Text.Megaparsec.Error Associated Types type Rep (ParseErrorBundle s e) :: Type -> Type # Methods from :: ParseErrorBundle s e -> Rep (ParseErrorBundle s e) x # to :: Rep (ParseErrorBundle s e) x -> ParseErrorBundle s e #
Generic (State s e)
Instance details Defined in Text.Megaparsec.State Associated Types type Rep (State s e) :: Type -> Type # Methods from :: State s e -> Rep (State s e) x # to :: Rep (State s e) x -> State s e #
Generic (ParseError s e)
Instance details Defined in Text.Megaparsec.Error Associated Types type Rep (ParseError s e) :: Type -> Type # Methods from :: ParseError s e -> Rep (ParseError s e) x # to :: Rep (ParseError s e) x -> ParseError s e #
Generic (IntMapOf k v)
Instance details Defined in Data.Semiring Associated Types type Rep (IntMapOf k v) :: Type -> Type # Methods from :: IntMapOf k v -> Rep (IntMapOf k v) x # to :: Rep (IntMapOf k v) x -> IntMapOf k v #
Generic (Pair a b)
Instance details Defined in Data.Strict.Tuple Associated Types type Rep (Pair a b) :: Type -> Type # Methods from :: Pair a b -> Rep (Pair a b) x # to :: Rep (Pair a b) x -> Pair a b #
Generic (These a b)
Instance details Defined in Data.Strict.These Associated Types type Rep (These a b) :: Type -> Type # Methods from :: These a b -> Rep (These a b) x # to :: Rep (These a b) x -> These a b #
Generic (Either a b)
Instance details Defined in Data.Strict.Either Associated Types type Rep (Either a b) :: Type -> Type # Methods from :: Either a b -> Rep (Either a b) x # to :: Rep (Either a b) x -> Either a b #
Generic (These a b)
Instance details Defined in Data.These Associated Types type Rep (These a b) :: Type -> Type # Methods from :: These a b -> Rep (These a b) x # to :: Rep (These a b) x -> These a b #
Generic (ArithError n m)
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type Rep (ArithError n m) :: Type -> Type # Methods from :: ArithError n m -> Rep (ArithError n m) x # to :: Rep (ArithError n m) x -> ArithError n m #
Generic (BigMap k v)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type Rep (BigMap k v) :: Type -> Type # Methods from :: BigMap k v -> Rep (BigMap k v) x # to :: Rep (BigMap k v) x -> BigMap k v #
Generic (TransferTokens instr p)
Instance details Defined in Morley.Michelson.Typed.Value Associated Types type Rep (TransferTokens instr p) :: Type -> Type # Methods from :: TransferTokens instr p -> Rep (TransferTokens instr p) x # to :: Rep (TransferTokens instr p) x -> TransferTokens instr p #
Generic (Annotation tag)
Instance details Defined in Morley.Michelson.Untyped.Annotation Associated Types type Rep (Annotation tag) :: Type -> Type # Methods from :: Annotation tag -> Rep (Annotation tag) x # to :: Rep (Annotation tag) x -> Annotation tag #
Generic (TAddress p vd) Source #
Instance details Defined in Lorentz.Address Associated Types type Rep (TAddress p vd) :: Type -> Type # Methods from :: TAddress p vd -> Rep (TAddress p vd) x # to :: Rep (TAddress p vd) x -> TAddress p vd #
Generic (ParameterWrapper deriv cp) Source #
Instance details Defined in Lorentz.Entrypoints.Manual Associated Types type Rep (ParameterWrapper deriv cp) :: Type -> Type # Methods from :: ParameterWrapper deriv cp -> Rep (ParameterWrapper deriv cp) x # to :: Rep (ParameterWrapper deriv cp) x -> ParameterWrapper deriv cp #
Generic (ZippedStackRepr a b) Source #
Instance details Defined in Lorentz.Zip Associated Types type Rep (ZippedStackRepr a b) :: Type -> Type # Methods from :: ZippedStackRepr a b -> Rep (ZippedStackRepr a b) x # to :: Rep (ZippedStackRepr a b) x -> ZippedStackRepr a b #
Generic (Hash alg a) Source #
Instance details Defined in Lorentz.Bytes Associated Types type Rep (Hash alg a) :: Type -> Type # Methods from :: Hash alg a -> Rep (Hash alg a) x # to :: Rep (Hash alg a) x -> Hash alg a #
Generic (Extensible x) Source #
Instance details Defined in Lorentz.Extensible Associated Types type Rep (Extensible x) :: Type -> Type # Methods from :: Extensible x -> Rep (Extensible x) x0 # to :: Rep (Extensible x) x0 -> Extensible x #
Generic (Void_ a b) Source #
Instance details Defined in Lorentz.Macro Associated Types type Rep (Void_ a b) :: Type -> Type # Methods from :: Void_ a b -> Rep (Void_ a b) x # to :: Rep (Void_ a b) x -> Void_ a b #
Generic (View_ a r) Source #
Instance details Defined in Lorentz.Macro Associated Types type Rep (View_ a r) :: Type -> Type # Methods from :: View_ a r -> Rep (View_ a r) x # to :: Rep (View_ a r) x -> View_ a r #
Generic (Rec1 f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (Rec1 f p) :: Type -> Type # Methods from :: Rec1 f p -> Rep (Rec1 f p) x # to :: Rep (Rec1 f p) x -> Rec1 f p #
Generic (URec (Ptr ()) p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (URec (Ptr ()) p) :: Type -> Type # Methods from :: URec (Ptr ()) p -> Rep (URec (Ptr ()) p) x # to :: Rep (URec (Ptr ()) p) x -> URec (Ptr ()) p #
Generic (URec Char p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (URec Char p) :: Type -> Type # Methods from :: URec Char p -> Rep (URec Char p) x # to :: Rep (URec Char p) x -> URec Char p #
Generic (URec Double p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (URec Double p) :: Type -> Type # Methods from :: URec Double p -> Rep (URec Double p) x # to :: Rep (URec Double p) x -> URec Double p #
Generic (URec Float p)
Instance details Defined in GHC.Generics Associated Types type Rep (URec Float p) :: Type -> Type # Methods from :: URec Float p -> Rep (URec Float p) x # to :: Rep (URec Float p) x -> URec Float p #
Generic (URec Int p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (URec Int p) :: Type -> Type # Methods from :: URec Int p -> Rep (URec Int p) x # to :: Rep (URec Int p) x -> URec Int p #
Generic (URec Word p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (URec Word p) :: Type -> Type # Methods from :: URec Word p -> Rep (URec Word p) x # to :: Rep (URec Word p) x -> URec Word p #
Generic (a, b, c)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c) :: Type -> Type # Methods from :: (a, b, c) -> Rep (a, b, c) x # to :: Rep (a, b, c) x -> (a, b, c) #
Generic (WrappedArrow a b c)	Since: base-4.7.0.0
Instance details Defined in Control.Applicative Associated Types type Rep (WrappedArrow a b c) :: Type -> Type # Methods from :: WrappedArrow a b c -> Rep (WrappedArrow a b c) x # to :: Rep (WrappedArrow a b c) x -> WrappedArrow a b c #
Generic (Kleisli m a b)	Since: base-4.14.0.0
Instance details Defined in Control.Arrow Associated Types type Rep (Kleisli m a b) :: Type -> Type # Methods from :: Kleisli m a b -> Rep (Kleisli m a b) x # to :: Rep (Kleisli m a b) x -> Kleisli m a b #
Generic (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Associated Types type Rep (Const a b) :: Type -> Type # Methods from :: Const a b -> Rep (Const a b) x # to :: Rep (Const a b) x -> Const a b #
Generic (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Associated Types type Rep (Ap f a) :: Type -> Type # Methods from :: Ap f a -> Rep (Ap f a) x # to :: Rep (Ap f a) x -> Ap f a #
Generic (Alt f a)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Alt f a) :: Type -> Type # Methods from :: Alt f a -> Rep (Alt f a) x # to :: Rep (Alt f a) x -> Alt f a #
Generic (Join p a)
Instance details Defined in Data.Bifunctor.Join Associated Types type Rep (Join p a) :: Type -> Type # Methods from :: Join p a -> Rep (Join p a) x # to :: Rep (Join p a) x -> Join p a #
Generic (Fix p a)
Instance details Defined in Data.Bifunctor.Fix Associated Types type Rep (Fix p a) :: Type -> Type # Methods from :: Fix p a -> Rep (Fix p a) x # to :: Rep (Fix p a) x -> Fix p a #
Generic (FreeF f a b)
Instance details Defined in Control.Monad.Trans.Free Associated Types type Rep (FreeF f a b) :: Type -> Type # Methods from :: FreeF f a b -> Rep (FreeF f a b) x # to :: Rep (FreeF f a b) x -> FreeF f a b #
Generic (CofreeF f a b)
Instance details Defined in Control.Comonad.Trans.Cofree Associated Types type Rep (CofreeF f a b) :: Type -> Type # Methods from :: CofreeF f a b -> Rep (CofreeF f a b) x # to :: Rep (CofreeF f a b) x -> CofreeF f a b #
Generic (Tagged s b)
Instance details Defined in Data.Tagged Associated Types type Rep (Tagged s b) :: Type -> Type # Methods from :: Tagged s b -> Rep (Tagged s b) x # to :: Rep (Tagged s b) x -> Tagged s b #
Generic (These1 f g a)
Instance details Defined in Data.Functor.These Associated Types type Rep (These1 f g a) :: Type -> Type # Methods from :: These1 f g a -> Rep (These1 f g a) x # to :: Rep (These1 f g a) x -> These1 f g a #
Generic (Rec f ('[] :: [u]))
Instance details Defined in Data.Vinyl.Core Associated Types type Rep (Rec f '[]) :: Type -> Type # Methods from :: Rec f '[] -> Rep (Rec f '[]) x # to :: Rep (Rec f '[]) x -> Rec f '[] #
Generic (Rec f rs) => Generic (Rec f (r ': rs))
Instance details Defined in Data.Vinyl.Core Associated Types type Rep (Rec f (r ': rs)) :: Type -> Type # Methods from :: Rec f (r ': rs) -> Rep (Rec f (r ': rs)) x # to :: Rep (Rec f (r ': rs)) x -> Rec f (r ': rs) #
Generic (Const a b)
Instance details Defined in Data.Vinyl.Functor Associated Types type Rep (Const a b) :: Type -> Type # Methods from :: Const a b -> Rep (Const a b) x # to :: Rep (Const a b) x -> Const a b #
Generic (STicket action td) Source #
Instance details Defined in Lorentz.Tickets Associated Types type Rep (STicket action td) :: Type -> Type # Methods from :: STicket action td -> Rep (STicket action td) x # to :: Rep (STicket action td) x -> STicket action td #
Generic (K1 i c p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (K1 i c p) :: Type -> Type # Methods from :: K1 i c p -> Rep (K1 i c p) x # to :: Rep (K1 i c p) x -> K1 i c p #
Generic ((f :+: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Associated Types type Rep ((f :+: g) p) :: Type -> Type # Methods from :: (f :+: g) p -> Rep ((f :+: g) p) x # to :: Rep ((f :+: g) p) x -> (f :+: g) p #
Generic ((f :*: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Associated Types type Rep ((f :: g) p) :: Type -> Type # Methods from :: (f :: g) p -> Rep ((f :: g) p) x # to :: Rep ((f :: g) p) x -> (f :*: g) p #
Generic (a, b, c, d)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d) :: Type -> Type # Methods from :: (a, b, c, d) -> Rep (a, b, c, d) x # to :: Rep (a, b, c, d) x -> (a, b, c, d) #
Generic (Product f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Associated Types type Rep (Product f g a) :: Type -> Type # Methods from :: Product f g a -> Rep (Product f g a) x # to :: Rep (Product f g a) x -> Product f g a #
Generic (Sum f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Sum Associated Types type Rep (Sum f g a) :: Type -> Type # Methods from :: Sum f g a -> Rep (Sum f g a) x # to :: Rep (Sum f g a) x -> Sum f g a #
Generic (M1 i c f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (M1 i c f p) :: Type -> Type # Methods from :: M1 i c f p -> Rep (M1 i c f p) x # to :: Rep (M1 i c f p) x -> M1 i c f p #
Generic ((f :.: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Associated Types type Rep ((f :.: g) p) :: Type -> Type # Methods from :: (f :.: g) p -> Rep ((f :.: g) p) x # to :: Rep ((f :.: g) p) x -> (f :.: g) p #
Generic (a, b, c, d, e)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e) :: Type -> Type # Methods from :: (a, b, c, d, e) -> Rep (a, b, c, d, e) x # to :: Rep (a, b, c, d, e) x -> (a, b, c, d, e) #
Generic (Compose f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Associated Types type Rep (Compose f g a) :: Type -> Type # Methods from :: Compose f g a -> Rep (Compose f g a) x # to :: Rep (Compose f g a) x -> Compose f g a #
Generic (WrappedBifunctor p a b)
Instance details Defined in Data.Bifunctor.Wrapped Associated Types type Rep (WrappedBifunctor p a b) :: Type -> Type # Methods from :: WrappedBifunctor p a b -> Rep (WrappedBifunctor p a b) x # to :: Rep (WrappedBifunctor p a b) x -> WrappedBifunctor p a b #
Generic (Joker g a b)
Instance details Defined in Data.Bifunctor.Joker Associated Types type Rep (Joker g a b) :: Type -> Type # Methods from :: Joker g a b -> Rep (Joker g a b) x # to :: Rep (Joker g a b) x -> Joker g a b #
Generic (Flip p a b)
Instance details Defined in Data.Bifunctor.Flip Associated Types type Rep (Flip p a b) :: Type -> Type # Methods from :: Flip p a b -> Rep (Flip p a b) x # to :: Rep (Flip p a b) x -> Flip p a b #
Generic (Clown f a b)
Instance details Defined in Data.Bifunctor.Clown Associated Types type Rep (Clown f a b) :: Type -> Type # Methods from :: Clown f a b -> Rep (Clown f a b) x # to :: Rep (Clown f a b) x -> Clown f a b #
Generic (Compose f g x)
Instance details Defined in Data.Vinyl.Functor Associated Types type Rep (Compose f g x) :: Type -> Type # Methods from :: Compose f g x -> Rep (Compose f g x) x0 # to :: Rep (Compose f g x) x0 -> Compose f g x #
Generic (a, b, c, d, e, f)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e, f) :: Type -> Type # Methods from :: (a, b, c, d, e, f) -> Rep (a, b, c, d, e, f) x # to :: Rep (a, b, c, d, e, f) x -> (a, b, c, d, e, f) #
Generic (Sum p q a b)
Instance details Defined in Data.Bifunctor.Sum Associated Types type Rep (Sum p q a b) :: Type -> Type # Methods from :: Sum p q a b -> Rep (Sum p q a b) x # to :: Rep (Sum p q a b) x -> Sum p q a b #
Generic (Product f g a b)
Instance details Defined in Data.Bifunctor.Product Associated Types type Rep (Product f g a b) :: Type -> Type # Methods from :: Product f g a b -> Rep (Product f g a b) x # to :: Rep (Product f g a b) x -> Product f g a b #
Generic (a, b, c, d, e, f, g)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e, f, g) :: Type -> Type # Methods from :: (a, b, c, d, e, f, g) -> Rep (a, b, c, d, e, f, g) x # to :: Rep (a, b, c, d, e, f, g) x -> (a, b, c, d, e, f, g) #
Generic (Tannen f p a b)
Instance details Defined in Data.Bifunctor.Tannen Associated Types type Rep (Tannen f p a b) :: Type -> Type # Methods from :: Tannen f p a b -> Rep (Tannen f p a b) x # to :: Rep (Tannen f p a b) x -> Tannen f p a b #
Generic (Biff p f g a b)
Instance details Defined in Data.Bifunctor.Biff Associated Types type Rep (Biff p f g a b) :: Type -> Type # Methods from :: Biff p f g a b -> Rep (Biff p f g a b) x # to :: Rep (Biff p f g a b) x -> Biff p f g a b #

data Text #

A space efficient, packed, unboxed Unicode text type.

Instances

Instances details

Structured Text
Instance details Defined in Distribution.Utils.Structured Methods structure :: Proxy Text -> Structure # structureHash' :: Tagged Text MD5
Hashable Text
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Text -> Int # hash :: Text -> Int #
ToJSON Text
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Text -> Value # toEncoding :: Text -> Encoding # toJSONList :: [Text] -> Value # toEncodingList :: [Text] -> Encoding #
KeyValue Object	Constructs a singleton `HashMap`. For calling functions that demand an `Object` for constructing objects. To be used in conjunction with `mconcat`. Prefer to use `object` where possible.
Instance details Defined in Data.Aeson.Types.ToJSON Methods (.=) :: ToJSON v => Text -> v -> Object #
KeyValue Pair
Instance details Defined in Data.Aeson.Types.ToJSON Methods (.=) :: ToJSON v => Text -> v -> Pair #
ToJSONKey Text
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSONKey :: ToJSONKeyFunction Text # toJSONKeyList :: ToJSONKeyFunction [Text] #
Chunk Text
Instance details Defined in Data.Attoparsec.Internal.Types Associated Types type ChunkElem Text # Methods nullChunk :: Text -> Bool # pappendChunk :: State Text -> Text -> State Text # atBufferEnd :: Text -> State Text -> Pos # bufferElemAt :: Text -> Pos -> State Text -> Maybe (ChunkElem Text, Int) # chunkElemToChar :: Text -> ChunkElem Text -> Char #
FromBuilder Text
Instance details Defined in Fmt.Internal.Core Methods fromBuilder :: Builder -> Text #
Buildable Text
Instance details Defined in Formatting.Buildable Methods build :: Text -> Builder #
Ixed Text
Instance details Defined in Control.Lens.At Methods ix :: Index Text -> Traversal' Text (IxValue Text) #
Stream Text
Instance details Defined in Text.Megaparsec.Stream Associated Types type Token Text # type Tokens Text # Methods tokenToChunk :: Proxy Text -> Token Text -> Tokens Text # tokensToChunk :: Proxy Text -> [Token Text] -> Tokens Text # chunkToTokens :: Proxy Text -> Tokens Text -> [Token Text] # chunkLength :: Proxy Text -> Tokens Text -> Int # chunkEmpty :: Proxy Text -> Tokens Text -> Bool # take1_ :: Text -> Maybe (Token Text, Text) # takeN_ :: Int -> Text -> Maybe (Tokens Text, Text) # takeWhile_ :: (Token Text -> Bool) -> Text -> (Tokens Text, Text) #
VisualStream Text
Instance details Defined in Text.Megaparsec.Stream Methods showTokens :: Proxy Text -> NonEmpty (Token Text) -> String # tokensLength :: Proxy Text -> NonEmpty (Token Text) -> Int #
TraversableStream Text
Instance details Defined in Text.Megaparsec.Stream Methods reachOffset :: Int -> PosState Text -> (Maybe String, PosState Text) # reachOffsetNoLine :: Int -> PosState Text -> PosState Text #
ToText Text
Instance details Defined in Universum.String.Conversion Methods toText :: Text -> Text #
ToLText Text
Instance details Defined in Universum.String.Conversion Methods toLText :: Text -> Text0 #
ToString Text
Instance details Defined in Universum.String.Conversion Methods toString :: Text -> String #
Print Text
Instance details Defined in Universum.Print.Internal Methods hPutStr :: Handle -> Text -> IO () # hPutStrLn :: Handle -> Text -> IO () #
Container Text
Instance details Defined in Universum.Container.Class Associated Types type Element Text # Methods toList :: Text -> [Element Text] # null :: Text -> Bool # foldr :: (Element Text -> b -> b) -> b -> Text -> b # foldl :: (b -> Element Text -> b) -> b -> Text -> b # foldl' :: (b -> Element Text -> b) -> b -> Text -> b # length :: Text -> Int # elem :: Element Text -> Text -> Bool # foldMap :: Monoid m => (Element Text -> m) -> Text -> m # fold :: Text -> Element Text # foldr' :: (Element Text -> b -> b) -> b -> Text -> b # notElem :: Element Text -> Text -> Bool # all :: (Element Text -> Bool) -> Text -> Bool # any :: (Element Text -> Bool) -> Text -> Bool # and :: Text -> Bool # or :: Text -> Bool # find :: (Element Text -> Bool) -> Text -> Maybe (Element Text) # safeHead :: Text -> Maybe (Element Text) # safeMaximum :: Text -> Maybe (Element Text) # safeMinimum :: Text -> Maybe (Element Text) # safeFoldr1 :: (Element Text -> Element Text -> Element Text) -> Text -> Maybe (Element Text) # safeFoldl1 :: (Element Text -> Element Text -> Element Text) -> Text -> Maybe (Element Text) #
One Text
Instance details Defined in Universum.Container.Class Associated Types type OneItem Text # Methods one :: OneItem Text -> Text #
Pretty Text
Instance details Defined in Text.PrettyPrint.Leijen.Text Methods pretty :: Text -> Doc # prettyList :: [Text] -> Doc #
HasCLReader Text
Instance details Defined in Morley.Util.CLI Methods getReader :: ReadM Text getMetavar :: String
(DoNotUseTextError :: Constraint) => IsoValue Text
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT Text :: T # Methods toVal :: Text -> Value (ToT Text) # fromVal :: Value (ToT Text) -> Text #
ToAnchor Text
Instance details Defined in Morley.Util.Markdown Methods toAnchor :: Text -> Anchor
ConvertUtf8 Text ByteString
Instance details Defined in Universum.String.Conversion Methods encodeUtf8 :: Text -> ByteString # decodeUtf8 :: ByteString -> Text # decodeUtf8Strict :: ByteString -> Either UnicodeException Text #
ConvertUtf8 Text ByteString
Instance details Defined in Universum.String.Conversion Methods encodeUtf8 :: Text -> ByteString # decodeUtf8 :: ByteString -> Text # decodeUtf8Strict :: ByteString -> Either UnicodeException Text #
Cons Text Text Char Char
Instance details Defined in Control.Lens.Cons Methods _Cons :: Prism Text Text (Char, Text) (Char, Text) #
Snoc Text Text Char Char
Instance details Defined in Control.Lens.Cons Methods _Snoc :: Prism Text Text (Text, Char) (Text, Char) #
FromPairs Value (DList Pair)
Instance details Defined in Data.Aeson.Types.ToJSON Methods fromPairs :: DList Pair -> Value
v ~ Value => KeyValuePair v (DList Pair)
Instance details Defined in Data.Aeson.Types.ToJSON Methods pair :: String -> v -> DList Pair
type State Text
Instance details Defined in Data.Attoparsec.Internal.Types type State Text = Buffer
type ChunkElem Text
Instance details Defined in Data.Attoparsec.Internal.Types type ChunkElem Text = Char
type Item Text
Instance details Defined in Data.Text type Item Text = Char
type Index Text
Instance details Defined in Control.Lens.At type Index Text = Int
type IxValue Text
Instance details Defined in Control.Lens.At type IxValue Text = Char
type Tokens Text
Instance details Defined in Text.Megaparsec.Stream type Tokens Text = Text
type Token Text
Instance details Defined in Text.Megaparsec.Stream type Token Text = Char
type Element Text
Instance details Defined in Universum.Container.Class type Element Text = Char
type OneItem Text
Instance details Defined in Universum.Container.Class type OneItem Text = Char
type PrettyShow Text
Instance details Defined in Morley.Prelude.Show type PrettyShow Text = TypeError ('Text "Show instance for Text is not pretty" :$$: 'Text "Consider relying on the Buildable instance") :: Constraint
type ToT Text
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT Text = ToT MText

data Either a b #

The Either type represents values with two possibilities: a value of type Either a b is either Left a or Right b.

The Either type is sometimes used to represent a value which is either correct or an error; by convention, the Left constructor is used to hold an error value and the Right constructor is used to hold a correct value (mnemonic: "right" also means "correct").

Examples

Expand

The type Either String Int is the type of values which can be either a String or an Int. The Left constructor can be used only on Strings, and the Right constructor can be used only on Ints:

>>> let s = Left "foo" :: Either String Int
>>> s
Left "foo"
>>> let n = Right 3 :: Either String Int
>>> n
Right 3
>>> :type s
s :: Either String Int
>>> :type n
n :: Either String Int

The fmap from our Functor instance will ignore Left values, but will apply the supplied function to values contained in a Right:

>>> let s = Left "foo" :: Either String Int
>>> let n = Right 3 :: Either String Int
>>> fmap (*2) s
Left "foo"
>>> fmap (*2) n
Right 6

The Monad instance for Either allows us to chain together multiple actions which may fail, and fail overall if any of the individual steps failed. First we'll write a function that can either parse an Int from a Char, or fail.

>>> import Data.Char ( digitToInt, isDigit )
>>> :{
    let parseEither :: Char -> Either String Int
        parseEither c
          | isDigit c = Right (digitToInt c)
          | otherwise = Left "parse error"
>>> :}

The following should work, since both '1' and '2' can be parsed as Ints.

>>> :{
    let parseMultiple :: Either String Int
        parseMultiple = do
          x <- parseEither '1'
          y <- parseEither '2'
          return (x + y)
>>> :}

>>> parseMultiple
Right 3

But the following should fail overall, since the first operation where we attempt to parse 'm' as an Int will fail:

>>> :{
    let parseMultiple :: Either String Int
        parseMultiple = do
          x <- parseEither 'm'
          y <- parseEither '2'
          return (x + y)
>>> :}

>>> parseMultiple
Left "parse error"

Constructors

Left a
Right b

Instances

Instances details

ToJSON2 Either
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON2 :: (a -> Value) -> ([a] -> Value) -> (b -> Value) -> ([b] -> Value) -> Either a b -> Value # liftToJSONList2 :: (a -> Value) -> ([a] -> Value) -> (b -> Value) -> ([b] -> Value) -> [Either a b] -> Value # liftToEncoding2 :: (a -> Encoding) -> ([a] -> Encoding) -> (b -> Encoding) -> ([b] -> Encoding) -> Either a b -> Encoding # liftToEncodingList2 :: (a -> Encoding) -> ([a] -> Encoding) -> (b -> Encoding) -> ([b] -> Encoding) -> [Either a b] -> Encoding #
Bifunctor Either	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> Either a c -> Either b d # first :: (a -> b) -> Either a c -> Either b c # second :: (b -> c) -> Either a b -> Either a c #
Eq2 Either	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Either a c -> Either b d -> Bool #
Ord2 Either	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Either a c -> Either b d -> Ordering #
Read2 Either	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (Either a b) # liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Either a b] # liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Either a b) # liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Either a b] #
Show2 Either	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Either a b -> ShowS # liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Either a b] -> ShowS #
NFData2 Either	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf2 :: (a -> ()) -> (b -> ()) -> Either a b -> () #
Hashable2 Either
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt2 :: (Int -> a -> Int) -> (Int -> b -> Int) -> Int -> Either a b -> Int #
() :=> (Monad (Either a))
Instance details Defined in Data.Constraint Methods ins :: () :- Monad (Either a) #
() :=> (Functor (Either a))
Instance details Defined in Data.Constraint Methods ins :: () :- Functor (Either a) #
() :=> (Applicative (Either a))
Instance details Defined in Data.Constraint Methods ins :: () :- Applicative (Either a) #
MonadError e (Either e)
Instance details Defined in Control.Monad.Error.Class Methods throwError :: e -> Either e a # catchError :: Either e a -> (e -> Either e a) -> Either e a #
(Lift a, Lift b) => Lift (Either a b :: Type)
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Either a b -> Q Exp # liftTyped :: Either a b -> Q (TExp (Either a b)) #
Monad (Either e)	Since: base-4.4.0.0
Instance details Defined 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 #
Functor (Either a)	Since: base-3.0
Instance details Defined in Data.Either Methods fmap :: (a0 -> b) -> Either a a0 -> Either a b # (<$) :: a0 -> Either a b -> Either a a0 #
Applicative (Either e)	Since: base-3.0
Instance details Defined in Data.Either Methods pure :: a -> Either e a # (<>) :: Either e (a -> b) -> Either e a -> Either e b # liftA2 :: (a -> b -> c) -> Either e a -> Either e b -> Either e c # (>) :: Either e a -> Either e b -> Either e b # (<*) :: Either e a -> Either e b -> Either e a #
Foldable (Either a)	Since: base-4.7.0.0
Instance details Defined in Data.Foldable Methods fold :: Monoid m => Either a m -> m # foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # toList :: Either a a0 -> [a0] # null :: Either a a0 -> Bool # length :: Either a a0 -> Int # elem :: Eq a0 => a0 -> Either a a0 -> Bool # maximum :: Ord a0 => Either a a0 -> a0 # minimum :: Ord a0 => Either a a0 -> a0 # sum :: Num a0 => Either a a0 -> a0 # product :: Num a0 => Either a a0 -> a0 #
Traversable (Either a)	Since: base-4.7.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a0 -> f b) -> Either a a0 -> f (Either a b) # sequenceA :: Applicative f => Either a (f a0) -> f (Either a a0) # mapM :: Monad m => (a0 -> m b) -> Either a a0 -> m (Either a b) # sequence :: Monad m => Either a (m a0) -> m (Either a a0) #
ToJSON a => ToJSON1 (Either a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a0 -> Value) -> ([a0] -> Value) -> Either a a0 -> Value # liftToJSONList :: (a0 -> Value) -> ([a0] -> Value) -> [Either a a0] -> Value # liftToEncoding :: (a0 -> Encoding) -> ([a0] -> Encoding) -> Either a a0 -> Encoding # liftToEncodingList :: (a0 -> Encoding) -> ([a0] -> Encoding) -> [Either a a0] -> Encoding #
Eq a => Eq1 (Either a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftEq :: (a0 -> b -> Bool) -> Either a a0 -> Either a b -> Bool #
Ord a => Ord1 (Either a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftCompare :: (a0 -> b -> Ordering) -> Either a a0 -> Either a b -> Ordering #
Read a => Read1 (Either a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (Either a a0) # liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [Either a a0] # liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (Either a a0) # liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [Either a a0] #
Show a => Show1 (Either a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> Either a a0 -> ShowS # liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [Either a a0] -> ShowS #
MonadFailure (Either a)
Instance details Defined in Basement.Monad Associated Types type Failure (Either a) # Methods mFail :: Failure (Either a) -> Either a () #
NFData a => NFData1 (Either a)	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a0 -> ()) -> Either a a0 -> () #
e ~ SomeException => MonadThrow (Either e)
Instance details Defined in Control.Monad.Catch Methods throwM :: Exception e0 => e0 -> Either e a #
e ~ SomeException => MonadCatch (Either e)	Since: exceptions-0.8.3
Instance details Defined in Control.Monad.Catch Methods catch :: Exception e0 => Either e a -> (e0 -> Either e a) -> Either e a #
e ~ SomeException => MonadMask (Either e)	Since: exceptions-0.8.3
Instance details Defined in Control.Monad.Catch Methods mask :: ((forall a. Either e a -> Either e a) -> Either e b) -> Either e b # uninterruptibleMask :: ((forall a. Either e a -> Either e a) -> Either e b) -> Either e b # generalBracket :: Either e a -> (a -> ExitCase b -> Either e c) -> (a -> Either e b) -> Either e (b, c) #
Hashable a => Hashable1 (Either a)
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a0 -> Int) -> Int -> Either a a0 -> Int #
PTraversable (Either a)
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg1 :: f (t b) # type SequenceA arg :: f (t a) # type MapM arg arg1 :: m (t b) # type Sequence arg :: m (t a) #
STraversable (Either a)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a0 (f :: Type -> Type) b (t1 :: a0 ~> f b) (t2 :: Either a a0). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: forall (f :: Type -> Type) a0 (t1 :: Either a (f a0)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # sMapM :: forall a0 (m :: Type -> Type) b (t1 :: a0 ~> m b) (t2 :: Either a a0). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: forall (m :: Type -> Type) a0 (t1 :: Either a (m a0)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) #
PFoldable (Either a)
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg :: m # type FoldMap arg arg1 :: m # type Foldr arg arg1 arg2 :: b # type Foldr' arg arg1 arg2 :: b # type Foldl arg arg1 arg2 :: b # type Foldl' arg arg1 arg2 :: b # type Foldr1 arg arg1 :: a # type Foldl1 arg arg1 :: a # type ToList arg :: [a] # type Null arg :: Bool # type Length arg :: Nat # type Elem arg arg1 :: Bool # type Maximum arg :: a # type Minimum arg :: a # type Sum arg :: a # type Product arg :: a #
SFoldable (Either a)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t1 :: Either a m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # sFoldMap :: forall a0 m (t1 :: a0 ~> m) (t2 :: Either a a0). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: forall a0 b (t1 :: a0 ~> (b ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: forall a0 b (t1 :: a0 ~> (b ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: forall b a0 (t1 :: b ~> (a0 ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: forall b a0 (t1 :: b ~> (a0 ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Either a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Either a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: forall a0 (t1 :: a0) (t2 :: Either a a0). SEq a0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a0 (t1 :: Either a a0). SOrd a0 => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: forall a0 (t1 :: Either a a0). SOrd a0 => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: forall a0 (t1 :: Either a a0). SNum a0 => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: forall a0 (t1 :: Either a a0). SNum a0 => Sing t1 -> Sing (Apply ProductSym0 t1) #
PFunctor (Either a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Fmap arg arg1 :: f b # type arg <$ arg1 :: f a #
PApplicative (Either e)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Pure arg :: f a # type arg <> arg1 :: f b # type LiftA2 arg arg1 arg2 :: f c # type arg > arg1 :: f b # type arg <* arg1 :: f a #
PMonad (Either e)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type arg >>= arg1 :: m b # type arg >> arg1 :: m b # type Return arg :: m a #
SFunctor (Either a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sFmap :: forall a0 b (t1 :: a0 ~> b) (t2 :: Either a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) # (%<$) :: forall a0 b (t1 :: a0) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<$@#@$) t1) t2) #
SApplicative (Either e)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) # (%<>) :: forall a b (t1 :: Either e (a ~> b)) (t2 :: Either e a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) # sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Either e a) (t3 :: Either e b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3) # (%>) :: forall a b (t1 :: Either e a) (t2 :: Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%<) :: forall a b (t1 :: Either e a) (t2 :: Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) #
SMonad (Either e)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods (%>>=) :: forall a b (t1 :: Either e a) (t2 :: a ~> Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>=@#@$) t1) t2) # (%>>) :: forall a b (t1 :: Either e a) (t2 :: Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>@#@$) t1) t2) # sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) #
Generic1 (Either a :: Type -> Type)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep1 (Either a) :: k -> Type # Methods from1 :: forall (a0 :: k). Either a a0 -> Rep1 (Either a) a0 # to1 :: forall (a0 :: k). Rep1 (Either a) a0 -> Either a a0 #
IsoHKD (Either a :: Type -> Type) (b :: Type)
Instance details Defined in Data.Vinyl.XRec Associated Types type HKD (Either a) b # Methods unHKD :: HKD (Either a) b -> Either a b # toHKD :: Either a b -> HKD (Either a) b #
(CanCastTo l1 l2, CanCastTo r1 r2) => CanCastTo (Either l1 r1 :: Type) (Either l2 r2 :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Either l1 r1) -> Proxy (Either l2 r2) -> () Source #
(Eq a, Eq b) => Eq (Either a b)	Since: base-2.1
Instance details Defined in Data.Either Methods (==) :: Either a b -> Either a b -> Bool # (/=) :: Either a b -> Either a b -> Bool #
(Data a, Data b) => Data (Either a b)	Since: base-4.0.0.0
Instance details Defined in Data.Data Methods gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Either a b -> c (Either a b) # gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Either a b) # toConstr :: Either a b -> Constr # dataTypeOf :: Either a b -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Either a b)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Either a b)) # gmapT :: (forall b0. Data b0 => b0 -> b0) -> Either a b -> Either a b # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Either a b -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Either a b -> r # gmapQ :: (forall d. Data d => d -> u) -> Either a b -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Either a b -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) #
(Ord a, Ord b) => Ord (Either a b)	Since: base-2.1
Instance details Defined in Data.Either Methods compare :: Either a b -> Either a b -> Ordering # (<) :: Either a b -> Either a b -> Bool # (<=) :: Either a b -> Either a b -> Bool # (>) :: Either a b -> Either a b -> Bool # (>=) :: Either a b -> Either a b -> Bool # max :: Either a b -> Either a b -> Either a b # min :: Either a b -> Either a b -> Either a b #
(Read a, Read b) => Read (Either a b)	Since: base-3.0
Instance details Defined in Data.Either Methods readsPrec :: Int -> ReadS (Either a b) # readList :: ReadS [Either a b] # readPrec :: ReadPrec (Either a b) # readListPrec :: ReadPrec [Either a b] #
(Show a, Show b) => Show (Either a b)	Since: base-3.0
Instance details Defined in Data.Either Methods showsPrec :: Int -> Either a b -> ShowS # show :: Either a b -> String # showList :: [Either a b] -> ShowS #
Generic (Either a b)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (Either a b) :: Type -> Type # Methods from :: Either a b -> Rep (Either a b) x # to :: Rep (Either a b) x -> Either a b #
Semigroup (Either a b)	Since: base-4.9.0.0
Instance details Defined 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 #
(Structured a, Structured b) => Structured (Either a b)
Instance details Defined in Distribution.Utils.Structured Methods structure :: Proxy (Either a b) -> Structure # structureHash' :: Tagged (Either a b) MD5
(NFData a, NFData b) => NFData (Either a b)
Instance details Defined in Control.DeepSeq Methods rnf :: Either a b -> () #
(Hashable a, Hashable b) => Hashable (Either a b)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Either a b -> Int # hash :: Either a b -> Int #
(ToJSON a, ToJSON b) => ToJSON (Either a b)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Either a b -> Value # toEncoding :: Either a b -> Encoding # toJSONList :: [Either a b] -> Value # toEncodingList :: [Either a b] -> Encoding #
PShow (Either a b)
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg1 arg2 :: Symbol # type Show_ arg :: Symbol # type ShowList arg arg1 :: Symbol #
(SShow a, SShow b) => SShow (Either a b)
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t1 :: Nat) (t2 :: Either a b) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) # sShow_ :: forall (t :: Either a b). Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: forall (t1 :: [Either a b]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) #
PSemigroup (Either a b)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type arg <> arg1 :: a # type Sconcat arg :: a #
SSemigroup (Either a b)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%<>) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) # sSconcat :: forall (t :: NonEmpty (Either a b)). Sing t -> Sing (Apply SconcatSym0 t) #
POrd (Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg1 :: Ordering # type arg < arg1 :: Bool # type arg <= arg1 :: Bool # type arg > arg1 :: Bool # type arg >= arg1 :: Bool # type Max arg arg1 :: a # type Min arg arg1 :: a #
(SOrd a, SOrd b) => SOrd (Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) #
(SEq a, SEq b) => SEq (Either a b)
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: forall (a0 :: Either a b) (b0 :: Either a b). Sing a0 -> Sing b0 -> Sing (a0 == b0) # (%/=) :: forall (a0 :: Either a b) (b0 :: Either a b). Sing a0 -> Sing b0 -> Sing (a0 /= b0) #
PEq (Either a b)
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool # type x /= y :: Bool #
(TypeError (DisallowInstance "Either") :: Constraint) => Container (Either a b)
Instance details Defined in Universum.Container.Class Associated Types type Element (Either a b) # Methods toList :: Either a b -> [Element (Either a b)] # null :: Either a b -> Bool # foldr :: (Element (Either a b) -> b0 -> b0) -> b0 -> Either a b -> b0 # foldl :: (b0 -> Element (Either a b) -> b0) -> b0 -> Either a b -> b0 # foldl' :: (b0 -> Element (Either a b) -> b0) -> b0 -> Either a b -> b0 # length :: Either a b -> Int # elem :: Element (Either a b) -> Either a b -> Bool # foldMap :: Monoid m => (Element (Either a b) -> m) -> Either a b -> m # fold :: Either a b -> Element (Either a b) # foldr' :: (Element (Either a b) -> b0 -> b0) -> b0 -> Either a b -> b0 # notElem :: Element (Either a b) -> Either a b -> Bool # all :: (Element (Either a b) -> Bool) -> Either a b -> Bool # any :: (Element (Either a b) -> Bool) -> Either a b -> Bool # and :: Either a b -> Bool # or :: Either a b -> Bool # find :: (Element (Either a b) -> Bool) -> Either a b -> Maybe (Element (Either a b)) # safeHead :: Either a b -> Maybe (Element (Either a b)) # safeMaximum :: Either a b -> Maybe (Element (Either a b)) # safeMinimum :: Either a b -> Maybe (Element (Either a b)) # safeFoldr1 :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Maybe (Element (Either a b)) # safeFoldl1 :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Maybe (Element (Either a b)) #
PolyTypeHasDocC '[l, r] => TypeHasDoc (Either l r)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Either l r) :: FieldDescriptions # Methods typeDocName :: Proxy (Either l r) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Either l r) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Either l r) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Either l r) # typeDocMichelsonRep :: TypeDocMichelsonRep (Either l r) #
(IsoValue l, IsoValue r) => IsoValue (Either l r)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Either l r) :: T # Methods toVal :: Either l r -> Value (ToT (Either l r)) # fromVal :: Value (ToT (Either l r)) -> Either l r #
(HasAnnotation a, HasAnnotation b) => HasAnnotation (Either a b) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Either a b)) Source # annOptions :: AnnOptions Source #
(HasRPCRepr l, HasRPCRepr r) => HasRPCRepr (Either l r)
Instance details Defined in Morley.AsRPC Associated Types type AsRPC (Either l r)
(Eq a, Eq b) :=> (Eq (Either a b))
Instance details Defined in Data.Constraint Methods ins :: (Eq a, Eq b) :- Eq (Either a b) #
(Ord a, Ord b) :=> (Ord (Either a b))
Instance details Defined in Data.Constraint Methods ins :: (Ord a, Ord b) :- Ord (Either a b) #
(Read a, Read b) :=> (Read (Either a b))
Instance details Defined in Data.Constraint Methods ins :: (Read a, Read b) :- Read (Either a b) #
(Show a, Show b) :=> (Show (Either a b))
Instance details Defined in Data.Constraint Methods ins :: (Show a, Show b) :- Show (Either a b) #
(SDecide a, SDecide b) => TestCoercion (SEither :: Either a b -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods testCoercion :: forall (a0 :: k) (b0 :: k). SEither a0 -> SEither b0 -> Maybe (Coercion a0 b0) #
(SDecide a, SDecide b) => TestEquality (SEither :: Either a b -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods testEquality :: forall (a0 :: k) (b0 :: k). SEither a0 -> SEither b0 -> Maybe (a0 :~: b0) #
SuppressUnusedWarnings (RightsSym0 :: TyFun [Either a b] [b] -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LeftsSym0 :: TyFun [Either a b] [a] -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680823386Sym0 :: TyFun (Either a1 a2) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Length_6989586621680823380Sym0 :: TyFun (Either a1 a2) Nat -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679848544Sym0 :: TyFun (Either a b) (Either a b ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680240804Sym0 :: TyFun (Either a b) (Either a b ~> Either a b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680653958Sym0 :: TyFun Nat (Either a b ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Pure_6989586621680072933Sym0 :: TyFun a (Either e a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (RightSym0 :: TyFun b (Either a b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LeftSym0 :: TyFun a (Either a b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680240813ASym0 :: TyFun k1 (Either a k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SingI (RightsSym0 :: TyFun [Either a b] [b] -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing RightsSym0 #
SingI (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing PartitionEithersSym0 #
SingI (LeftsSym0 :: TyFun [Either a b] [a] -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing LeftsSym0 #
SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsRightSym0 #
SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsLeftSym0 #
SingI (RightSym0 :: TyFun b (Either a b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing RightSym0 #
SingI (LeftSym0 :: TyFun a (Either a b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing LeftSym0 #
(a ~ a', b ~ b') => Each (Either a a') (Either b b') a b	Since: microlens-0.4.11
Instance details Defined in Lens.Micro.Internal Methods each :: Traversal (Either a a') (Either b b') a b #
SuppressUnusedWarnings (ShowsPrec_6989586621680653958Sym1 a6989586621680653968 :: TyFun (Either a b) (Symbol ~> Symbol) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680073027Sym0 :: TyFun (Either e a) ((a ~> Either e b) ~> Either e b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072943Sym0 :: TyFun (Either e (a ~> b)) (Either e a ~> Either e b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679848544Sym1 a6989586621679848549 :: TyFun (Either a b) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680240804Sym1 a6989586621680240809 :: TyFun (Either a b) (Either a b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072764Sym0 :: TyFun a1 (Either a2 b ~> Either a2 a1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621680072747Sym0 :: TyFun (a1 ~> b) (Either a2 a1 ~> Either a2 b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680823366Sym0 :: TyFun (a1 ~> (b ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FoldMap_6989586621680823354Sym0 :: TyFun (a1 ~> m) (Either a2 a1 ~> m) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SingI (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing Either_Sym0 #
SuppressUnusedWarnings (TFHelper_6989586621680072943Sym1 a6989586621680072948 :: TyFun (Either e a) (Either e b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072764Sym1 a6989586621680072769 :: TyFun (Either a2 b) (Either a2 a1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621680072747Sym1 a6989586621680072752 :: TyFun (Either a2 a1) (Either a2 b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FoldMap_6989586621680823354Sym1 a6989586621680823359 :: TyFun (Either a2 a1) m -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680823366Sym1 a6989586621680823372 :: TyFun b (Either a2 a1 ~> b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Traverse_6989586621681088300Sym0 :: TyFun (a1 ~> f b) (Either a2 a1 ~> f (Either a2 b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680073027Sym1 a6989586621680073032 :: TyFun (a ~> Either e b) (Either e b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Either_Sym1 a6989586621680802341 :: TyFun (b ~> c) (Either a b ~> c) -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SingI d => SingI (Either_Sym1 d :: TyFun (b ~> c) (Either a b ~> c) -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing (Either_Sym1 d) #
SuppressUnusedWarnings (Traverse_6989586621681088300Sym1 a6989586621681088305 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680823366Sym2 a6989586621680823372 a6989586621680823373 :: TyFun (Either a2 a1) b -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Either_Sym2 a6989586621680802341 a6989586621680802342 :: TyFun (Either a b) c -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
(SingI d1, SingI d2) => SingI (Either_Sym2 d1 d2 :: TyFun (Either a b) c -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing (Either_Sym2 d1 d2) #
(Functor f, Functor g) => Functor (Lift Either f g)
Instance details Defined in Data.Vinyl.Functor Methods fmap :: (a -> b) -> Lift Either f g a -> Lift Either f g b # (<$) :: a -> Lift Either f g b -> Lift Either f g a #
type MapM (arg1 :: a1 ~> m b) (arg2 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Traversable type MapM (arg1 :: a1 ~> m b) (arg2 :: Either a2 a1) = Apply (Apply (MapM_6989586621681082044Sym0 :: TyFun (a1 ~> m b) (Either a2 a1 ~> m (Either a2 b)) -> Type) arg1) arg2
type Traverse (a3 :: a1 ~> f b) (a4 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Traversable type Traverse (a3 :: a1 ~> f b) (a4 :: Either a2 a1) = Apply (Apply (Traverse_6989586621681088300Sym0 :: TyFun (a1 ~> f b) (Either a2 a1 ~> f (Either a2 b)) -> Type) a3) a4
type LiftA2 (arg1 :: a ~> (b ~> c)) (arg2 :: Either e a) (arg3 :: Either e b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type LiftA2 (arg1 :: a ~> (b ~> c)) (arg2 :: Either e a) (arg3 :: Either e b) = Apply (Apply (Apply (LiftA2_6989586621680011943Sym0 :: TyFun (a ~> (b ~> c)) (Either e a ~> (Either e b ~> Either e c)) -> Type) arg1) arg2) arg3
type FoldMap (a3 :: a1 ~> k2) (a4 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type FoldMap (a3 :: a1 ~> k2) (a4 :: Either a2 a1) = Apply (Apply (FoldMap_6989586621680823354Sym0 :: TyFun (a1 ~> k2) (Either a2 a1 ~> k2) -> Type) a3) a4
type Fmap (a3 :: a1 ~> b) (a4 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Fmap (a3 :: a1 ~> b) (a4 :: Either a2 a1) = Apply (Apply (Fmap_6989586621680072747Sym0 :: TyFun (a1 ~> b) (Either a2 a1 ~> Either a2 b) -> Type) a3) a4
type Foldl' (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl' (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) = Apply (Apply (Apply (Foldl'_6989586621680822873Sym0 :: TyFun (b ~> (a1 ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) arg1) arg2) arg3
type Foldl (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) = Apply (Apply (Apply (Foldl_6989586621680822858Sym0 :: TyFun (b ~> (a1 ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) arg1) arg2) arg3
type Foldr' (arg1 :: a1 ~> (b ~> b)) (arg2 :: b) (arg3 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr' (arg1 :: a1 ~> (b ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) = Apply (Apply (Apply (Foldr'_6989586621680822835Sym0 :: TyFun (a1 ~> (b ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) arg1) arg2) arg3
type Foldr (a3 :: a1 ~> (k2 ~> k2)) (a4 :: k2) (a5 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr (a3 :: a1 ~> (k2 ~> k2)) (a4 :: k2) (a5 :: Either a2 a1) = Apply (Apply (Apply (Foldr_6989586621680823366Sym0 :: TyFun (a1 ~> (k2 ~> k2)) (k2 ~> (Either a2 a1 ~> k2)) -> Type) a3) a4) a5
type Pure (a :: k1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Pure (a :: k1) = Apply (Pure_6989586621680072933Sym0 :: TyFun k1 (Either e k1) -> Type) a
type Return (arg :: a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Return (arg :: a) = Apply (Return_6989586621680012015Sym0 :: TyFun a (Either e a) -> Type) arg
type Elem (arg1 :: a1) (arg2 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Elem (arg1 :: a1) (arg2 :: Either a2 a1) = Apply (Apply (Elem_6989586621680822981Sym0 :: TyFun a1 (Either a2 a1 ~> Bool) -> Type) arg1) arg2
type Foldl1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1) = Apply (Apply (Foldl1_6989586621680822916Sym0 :: TyFun (a1 ~> (a1 ~> a1)) (Either a2 a1 ~> a1) -> Type) arg1) arg2
type Foldr1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1) = Apply (Apply (Foldr1_6989586621680822895Sym0 :: TyFun (a1 ~> (a1 ~> a1)) (Either a2 a1 ~> a1) -> Type) arg1) arg2
type (a2 :: k1) <$ (a3 :: Either a1 b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a2 :: k1) <$ (a3 :: Either a1 b) = Apply (Apply (TFHelper_6989586621680072764Sym0 :: TyFun k1 (Either a1 b ~> Either a1 k1) -> Type) a2) a3
type Apply (ShowsPrec_6989586621680653958Sym0 :: TyFun Nat (Either a b ~> (Symbol ~> Symbol)) -> Type) (a6989586621680653968 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680653958Sym0 :: TyFun Nat (Either a b ~> (Symbol ~> Symbol)) -> Type) (a6989586621680653968 :: Nat) = ShowsPrec_6989586621680653958Sym1 a6989586621680653968 :: TyFun (Either a b) (Symbol ~> Symbol) -> Type
type Apply (Pure_6989586621680072933Sym0 :: TyFun a (Either e a) -> Type) (a6989586621680072939 :: a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Pure_6989586621680072933Sym0 :: TyFun a (Either e a) -> Type) (a6989586621680072939 :: a) = Pure_6989586621680072933Sym1 a6989586621680072939 :: Either e a
type Apply (LeftSym0 :: TyFun a (Either a b) -> Type) (a6989586621679750173 :: a)
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (LeftSym0 :: TyFun a (Either a b) -> Type) (a6989586621679750173 :: a) = LeftSym1 a6989586621679750173 :: Either a b
type Apply (RightSym0 :: TyFun b (Either a b) -> Type) (a6989586621679750175 :: b)
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (RightSym0 :: TyFun b (Either a b) -> Type) (a6989586621679750175 :: b) = RightSym1 a6989586621679750175 :: Either a b
type Apply (Let6989586621680240813ASym0 :: TyFun k1 (Either a k1) -> Type) (wild_69895866216802404776989586621680240812 :: k1)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Let6989586621680240813ASym0 :: TyFun k1 (Either a k1) -> Type) (wild_69895866216802404776989586621680240812 :: k1) = Let6989586621680240813ASym1 wild_69895866216802404776989586621680240812 :: Either a k1
type Apply (TFHelper_6989586621680072764Sym0 :: TyFun a1 (Either a2 b ~> Either a2 a1) -> Type) (a6989586621680072769 :: a1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072764Sym0 :: TyFun a1 (Either a2 b ~> Either a2 a1) -> Type) (a6989586621680072769 :: a1) = TFHelper_6989586621680072764Sym1 a6989586621680072769 :: TyFun (Either a2 b) (Either a2 a1) -> Type
type Apply (Foldr_6989586621680823366Sym1 a6989586621680823372 :: TyFun b (Either a2 a1 ~> b) -> Type) (a6989586621680823373 :: b)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldr_6989586621680823366Sym1 a6989586621680823372 :: TyFun b (Either a2 a1 ~> b) -> Type) (a6989586621680823373 :: b) = Foldr_6989586621680823366Sym2 a6989586621680823372 a6989586621680823373 :: TyFun (Either a2 a1) b -> Type
type Eval (FoldMap f ('Right x :: Either a3 a1) :: a2 -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (FoldMap f ('Right x :: Either a3 a1) :: a2 -> Type) = Eval (f x)
type Eval (FoldMap f ('Left _a :: Either a3 a1) :: a2 -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (FoldMap f ('Left _a :: Either a3 a1) :: a2 -> Type) = MEmpty :: a2
type Eval (Foldr f y ('Right x :: Either a3 a1) :: a2 -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (Foldr f y ('Right x :: Either a3 a1) :: a2 -> Type) = Eval (f x y)
type Eval (Foldr f y ('Left _a :: Either a3 a1) :: a2 -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (Foldr f y ('Left _a :: Either a3 a1) :: a2 -> Type) = y
type Failure (Either a)
Instance details Defined in Basement.Monad type Failure (Either a) = a
type Product (arg :: Either a1 a2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Product (arg :: Either a1 a2) = Apply (Product_6989586621680823034Sym0 :: TyFun (Either a1 a2) a2 -> Type) arg
type Sum (arg :: Either a1 a2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Sum (arg :: Either a1 a2) = Apply (Sum_6989586621680823025Sym0 :: TyFun (Either a1 a2) a2 -> Type) arg
type Minimum (arg :: Either a1 a2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Minimum (arg :: Either a1 a2) = Apply (Minimum_6989586621680823010Sym0 :: TyFun (Either a1 a2) a2 -> Type) arg
type Maximum (arg :: Either a1 a2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Maximum (arg :: Either a1 a2) = Apply (Maximum_6989586621680822995Sym0 :: TyFun (Either a1 a2) a2 -> Type) arg
type Length (a3 :: Either a1 a2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Length (a3 :: Either a1 a2) = Apply (Length_6989586621680823380Sym0 :: TyFun (Either a1 a2) Nat -> Type) a3
type Null (a3 :: Either a1 a2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Null (a3 :: Either a1 a2) = Apply (Null_6989586621680823386Sym0 :: TyFun (Either a1 a2) Bool -> Type) a3
type ToList (arg :: Either a1 a2)
Instance details Defined in Data.Singletons.Prelude.Foldable type ToList (arg :: Either a1 a2) = Apply (ToList_6989586621680822936Sym0 :: TyFun (Either a1 a2) [a2] -> Type) arg
type Fold (arg :: Either a m)
Instance details Defined in Data.Singletons.Prelude.Foldable type Fold (arg :: Either a m) = Apply (Fold_6989586621680822796Sym0 :: TyFun (Either a m) m -> Type) arg
type Sequence (arg :: Either a1 (m a2))
Instance details Defined in Data.Singletons.Prelude.Traversable type Sequence (arg :: Either a1 (m a2)) = Apply (Sequence_6989586621681082058Sym0 :: TyFun (Either a1 (m a2)) (m (Either a1 a2)) -> Type) arg
type SequenceA (arg :: Either a1 (f a2))
Instance details Defined in Data.Singletons.Prelude.Traversable type SequenceA (arg :: Either a1 (f a2)) = Apply (SequenceA_6989586621681082034Sym0 :: TyFun (Either a1 (f a2)) (f (Either a1 a2)) -> Type) arg
type (arg1 :: Either e a) <* (arg2 :: Either e b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (arg1 :: Either e a) <* (arg2 :: Either e b) = Apply (Apply (TFHelper_6989586621680011970Sym0 :: TyFun (Either e a) (Either e b ~> Either e a) -> Type) arg1) arg2
type (arg1 :: Either e a) *> (arg2 :: Either e b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (arg1 :: Either e a) *> (arg2 :: Either e b) = Apply (Apply (TFHelper_6989586621680011959Sym0 :: TyFun (Either e a) (Either e b ~> Either e b) -> Type) arg1) arg2
type (a2 :: Either e (a1 ~> b)) <*> (a3 :: Either e a1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a2 :: Either e (a1 ~> b)) <*> (a3 :: Either e a1) = Apply (Apply (TFHelper_6989586621680072943Sym0 :: TyFun (Either e (a1 ~> b)) (Either e a1 ~> Either e b) -> Type) a2) a3
type (arg1 :: Either e a) >> (arg2 :: Either e b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (arg1 :: Either e a) >> (arg2 :: Either e b) = Apply (Apply (TFHelper_6989586621680011998Sym0 :: TyFun (Either e a) (Either e b ~> Either e b) -> Type) arg1) arg2
type (a2 :: Either e a1) >>= (a3 :: a1 ~> Either e b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a2 :: Either e a1) >>= (a3 :: a1 ~> Either e b) = Apply (Apply (TFHelper_6989586621680073027Sym0 :: TyFun (Either e a1) ((a1 ~> Either e b) ~> Either e b) -> Type) a2) a3
type Rep1 (Either a :: Type -> Type)
Instance details Defined in GHC.Generics type Rep1 (Either a :: Type -> Type) = D1 ('MetaData "Either" "Data.Either" "base" 'False) (C1 ('MetaCons "Left" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Right" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1))
type HKD (Either a :: Type -> Type) (b :: Type)
Instance details Defined in Data.Vinyl.XRec type HKD (Either a :: Type -> Type) (b :: Type) = Either a b
type Apply (RightsSym0 :: TyFun [Either a b] [b] -> Type) (a6989586621680804025 :: [Either a b])
Instance details Defined in Data.Singletons.Prelude.Either type Apply (RightsSym0 :: TyFun [Either a b] [b] -> Type) (a6989586621680804025 :: [Either a b]) = RightsSym1 a6989586621680804025
type Apply (LeftsSym0 :: TyFun [Either a b] [a] -> Type) (a6989586621680804031 :: [Either a b])
Instance details Defined in Data.Singletons.Prelude.Either type Apply (LeftsSym0 :: TyFun [Either a b] [a] -> Type) (a6989586621680804031 :: [Either a b]) = LeftsSym1 a6989586621680804031
type Apply (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) (a6989586621680804008 :: [Either a b])
Instance details Defined in Data.Singletons.Prelude.Either type Apply (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) (a6989586621680804008 :: [Either a b]) = PartitionEithersSym1 a6989586621680804008
type Rep (Either a b)
Instance details Defined in GHC.Generics type Rep (Either a b) = D1 ('MetaData "Either" "Data.Either" "base" 'False) (C1 ('MetaCons "Left" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Right" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 b)))
type Sing
Instance details Defined in Data.Singletons.Prelude.Instances type Sing = SEither :: Either a b -> Type
type Demote (Either a b)
Instance details Defined in Data.Singletons.Prelude.Instances type Demote (Either a b) = Either (Demote a) (Demote b)
type Element (Either a b)
Instance details Defined in Universum.Container.Class type Element (Either a b) = ElementDefault (Either a b)
type TypeDocFieldDescriptions (Either l r)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Either l r) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (Either l r)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Either l r) = GValueType (Rep (Either l r))
type AsRPC (Either l r)
Instance details Defined in Morley.AsRPC type AsRPC (Either l r) = Either (AsRPC l) (AsRPC r)
type Show_ (arg :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Show type Show_ (arg :: Either a b) = Apply (Show__6989586621680636746Sym0 :: TyFun (Either a b) Symbol -> Type) arg
type Sconcat (arg :: NonEmpty (Either a b))
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Sconcat (arg :: NonEmpty (Either a b)) = Apply (Sconcat_6989586621680240642Sym0 :: TyFun (NonEmpty (Either a b)) (Either a b) -> Type) arg
type ShowList (arg1 :: [Either a b]) arg2
Instance details Defined in Data.Singletons.Prelude.Show type ShowList (arg1 :: [Either a b]) arg2 = Apply (Apply (ShowList_6989586621680636754Sym0 :: TyFun [Either a b] (Symbol ~> Symbol) -> Type) arg1) arg2
type (a2 :: Either a1 b) <> (a3 :: Either a1 b)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type (a2 :: Either a1 b) <> (a3 :: Either a1 b) = Apply (Apply (TFHelper_6989586621680240804Sym0 :: TyFun (Either a1 b) (Either a1 b ~> Either a1 b) -> Type) a2) a3
type Min (arg1 :: Either a b) (arg2 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord type Min (arg1 :: Either a b) (arg2 :: Either a b) = Apply (Apply (Min_6989586621679837487Sym0 :: TyFun (Either a b) (Either a b ~> Either a b) -> Type) arg1) arg2
type Max (arg1 :: Either a b) (arg2 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord type Max (arg1 :: Either a b) (arg2 :: Either a b) = Apply (Apply (Max_6989586621679837471Sym0 :: TyFun (Either a b) (Either a b ~> Either a b) -> Type) arg1) arg2
type (arg1 :: Either a b) >= (arg2 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Either a b) >= (arg2 :: Either a b) = Apply (Apply (TFHelper_6989586621679837455Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) arg1) arg2
type (arg1 :: Either a b) > (arg2 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Either a b) > (arg2 :: Either a b) = Apply (Apply (TFHelper_6989586621679837439Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) arg1) arg2
type (arg1 :: Either a b) <= (arg2 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Either a b) <= (arg2 :: Either a b) = Apply (Apply (TFHelper_6989586621679837423Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) arg1) arg2
type (arg1 :: Either a b) < (arg2 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Either a b) < (arg2 :: Either a b) = Apply (Apply (TFHelper_6989586621679837407Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) arg1) arg2
type Compare (a2 :: Either a1 b) (a3 :: Either a1 b)
Instance details Defined in Data.Singletons.Prelude.Ord type Compare (a2 :: Either a1 b) (a3 :: Either a1 b) = Apply (Apply (Compare_6989586621679848544Sym0 :: TyFun (Either a1 b) (Either a1 b ~> Ordering) -> Type) a2) a3
type (x :: Either a b) /= (y :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Eq type (x :: Either a b) /= (y :: Either a b) = Not (x == y)
type (a2 :: Either a1 b1) == (b2 :: Either a1 b1)
Instance details Defined in Data.Singletons.Prelude.Eq type (a2 :: Either a1 b1) == (b2 :: Either a1 b1) = Equals_6989586621679820281 a2 b2
type ShowsPrec a2 (a3 :: Either a1 b) a4
Instance details Defined in Data.Singletons.Prelude.Show type ShowsPrec a2 (a3 :: Either a1 b) a4 = Apply (Apply (Apply (ShowsPrec_6989586621680653958Sym0 :: TyFun Nat (Either a1 b ~> (Symbol ~> Symbol)) -> Type) a2) a3) a4
type Apply (Length_6989586621680823380Sym0 :: TyFun (Either a1 a2) Nat -> Type) (a6989586621680823384 :: Either a1 a2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Length_6989586621680823380Sym0 :: TyFun (Either a1 a2) Nat -> Type) (a6989586621680823384 :: Either a1 a2) = Length_6989586621680823380Sym1 a6989586621680823384
type Apply (Null_6989586621680823386Sym0 :: TyFun (Either a1 a2) Bool -> Type) (a6989586621680823392 :: Either a1 a2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680823386Sym0 :: TyFun (Either a1 a2) Bool -> Type) (a6989586621680823392 :: Either a1 a2) = Null_6989586621680823386Sym1 a6989586621680823392
type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680804000 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Either type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680804000 :: Either a b) = IsRightSym1 a6989586621680804000
type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680804003 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Either type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680804003 :: Either a b) = IsLeftSym1 a6989586621680804003
type Apply (Compare_6989586621679848544Sym1 a6989586621679848549 :: TyFun (Either a b) Ordering -> Type) (a6989586621679848550 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679848544Sym1 a6989586621679848549 :: TyFun (Either a b) Ordering -> Type) (a6989586621679848550 :: Either a b) = Compare_6989586621679848544Sym2 a6989586621679848549 a6989586621679848550
type Apply (FoldMap_6989586621680823354Sym1 a6989586621680823359 :: TyFun (Either a2 a1) m -> Type) (a6989586621680823360 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FoldMap_6989586621680823354Sym1 a6989586621680823359 :: TyFun (Either a2 a1) m -> Type) (a6989586621680823360 :: Either a2 a1) = FoldMap_6989586621680823354Sym2 a6989586621680823359 a6989586621680823360
type Apply (Foldr_6989586621680823366Sym2 a6989586621680823372 a6989586621680823373 :: TyFun (Either a2 a1) b -> Type) (a6989586621680823374 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldr_6989586621680823366Sym2 a6989586621680823372 a6989586621680823373 :: TyFun (Either a2 a1) b -> Type) (a6989586621680823374 :: Either a2 a1) = Foldr_6989586621680823366Sym3 a6989586621680823372 a6989586621680823373 a6989586621680823374
type Apply (Either_Sym2 a6989586621680802341 a6989586621680802342 :: TyFun (Either a b) c -> Type) (a6989586621680802343 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym2 a6989586621680802341 a6989586621680802342 :: TyFun (Either a b) c -> Type) (a6989586621680802343 :: Either a b) = Either_Sym3 a6989586621680802341 a6989586621680802342 a6989586621680802343
type Apply (Traverse_6989586621681088300Sym1 a6989586621681088305 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type) (a6989586621681088306 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621681088300Sym1 a6989586621681088305 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type) (a6989586621681088306 :: Either a2 a1) = Traverse_6989586621681088300Sym2 a6989586621681088305 a6989586621681088306
type Apply (Compare_6989586621679848544Sym0 :: TyFun (Either a b) (Either a b ~> Ordering) -> Type) (a6989586621679848549 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679848544Sym0 :: TyFun (Either a b) (Either a b ~> Ordering) -> Type) (a6989586621679848549 :: Either a b) = Compare_6989586621679848544Sym1 a6989586621679848549
type Apply (TFHelper_6989586621680240804Sym0 :: TyFun (Either a b) (Either a b ~> Either a b) -> Type) (a6989586621680240809 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (TFHelper_6989586621680240804Sym0 :: TyFun (Either a b) (Either a b ~> Either a b) -> Type) (a6989586621680240809 :: Either a b) = TFHelper_6989586621680240804Sym1 a6989586621680240809
type Apply (ShowsPrec_6989586621680653958Sym1 a6989586621680653968 :: TyFun (Either a b) (Symbol ~> Symbol) -> Type) (a6989586621680653969 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680653958Sym1 a6989586621680653968 :: TyFun (Either a b) (Symbol ~> Symbol) -> Type) (a6989586621680653969 :: Either a b) = ShowsPrec_6989586621680653958Sym2 a6989586621680653968 a6989586621680653969
type Apply (TFHelper_6989586621680072943Sym0 :: TyFun (Either e (a ~> b)) (Either e a ~> Either e b) -> Type) (a6989586621680072948 :: Either e (a ~> b))
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072943Sym0 :: TyFun (Either e (a ~> b)) (Either e a ~> Either e b) -> Type) (a6989586621680072948 :: Either e (a ~> b)) = TFHelper_6989586621680072943Sym1 a6989586621680072948
type Apply (TFHelper_6989586621680073027Sym0 :: TyFun (Either e a) ((a ~> Either e b) ~> Either e b) -> Type) (a6989586621680073032 :: Either e a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680073027Sym0 :: TyFun (Either e a) ((a ~> Either e b) ~> Either e b) -> Type) (a6989586621680073032 :: Either e a) = TFHelper_6989586621680073027Sym1 a6989586621680073032 :: TyFun (a ~> Either e b) (Either e b) -> Type
type Apply (TFHelper_6989586621680240804Sym1 a6989586621680240809 :: TyFun (Either a b) (Either a b) -> Type) (a6989586621680240810 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (TFHelper_6989586621680240804Sym1 a6989586621680240809 :: TyFun (Either a b) (Either a b) -> Type) (a6989586621680240810 :: Either a b) = TFHelper_6989586621680240804Sym2 a6989586621680240809 a6989586621680240810
type Apply (Fmap_6989586621680072747Sym0 :: TyFun (a1 ~> b) (Either a2 a1 ~> Either a2 b) -> Type) (a6989586621680072752 :: a1 ~> b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621680072747Sym0 :: TyFun (a1 ~> b) (Either a2 a1 ~> Either a2 b) -> Type) (a6989586621680072752 :: a1 ~> b) = Fmap_6989586621680072747Sym1 a6989586621680072752 :: TyFun (Either a2 a1) (Either a2 b) -> Type
type Apply (FoldMap_6989586621680823354Sym0 :: TyFun (a1 ~> m) (Either a2 a1 ~> m) -> Type) (a6989586621680823359 :: a1 ~> m)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FoldMap_6989586621680823354Sym0 :: TyFun (a1 ~> m) (Either a2 a1 ~> m) -> Type) (a6989586621680823359 :: a1 ~> m) = FoldMap_6989586621680823354Sym1 a6989586621680823359 :: TyFun (Either a2 a1) m -> Type
type Apply (Foldr_6989586621680823366Sym0 :: TyFun (a1 ~> (b ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) (a6989586621680823372 :: a1 ~> (b ~> b))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldr_6989586621680823366Sym0 :: TyFun (a1 ~> (b ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) (a6989586621680823372 :: a1 ~> (b ~> b)) = Foldr_6989586621680823366Sym1 a6989586621680823372 :: TyFun b (Either a2 a1 ~> b) -> Type
type Apply (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) (a6989586621680802341 :: a ~> c)
Instance details Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) (a6989586621680802341 :: a ~> c) = Either_Sym1 a6989586621680802341 :: TyFun (b ~> c) (Either a b ~> c) -> Type
type Apply (Fmap_6989586621680072747Sym1 a6989586621680072752 :: TyFun (Either a2 a1) (Either a2 b) -> Type) (a6989586621680072753 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621680072747Sym1 a6989586621680072752 :: TyFun (Either a2 a1) (Either a2 b) -> Type) (a6989586621680072753 :: Either a2 a1) = Fmap_6989586621680072747Sym2 a6989586621680072752 a6989586621680072753
type Apply (TFHelper_6989586621680072764Sym1 a6989586621680072769 :: TyFun (Either a2 b) (Either a2 a1) -> Type) (a6989586621680072770 :: Either a2 b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072764Sym1 a6989586621680072769 :: TyFun (Either a2 b) (Either a2 a1) -> Type) (a6989586621680072770 :: Either a2 b) = TFHelper_6989586621680072764Sym2 a6989586621680072769 a6989586621680072770
type Apply (TFHelper_6989586621680072943Sym1 a6989586621680072948 :: TyFun (Either e a) (Either e b) -> Type) (a6989586621680072949 :: Either e a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072943Sym1 a6989586621680072948 :: TyFun (Either e a) (Either e b) -> Type) (a6989586621680072949 :: Either e a) = TFHelper_6989586621680072943Sym2 a6989586621680072948 a6989586621680072949
type Apply (Traverse_6989586621681088300Sym0 :: TyFun (a1 ~> f b) (Either a2 a1 ~> f (Either a2 b)) -> Type) (a6989586621681088305 :: a1 ~> f b)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621681088300Sym0 :: TyFun (a1 ~> f b) (Either a2 a1 ~> f (Either a2 b)) -> Type) (a6989586621681088305 :: a1 ~> f b) = Traverse_6989586621681088300Sym1 a6989586621681088305 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type
type Apply (TFHelper_6989586621680073027Sym1 a6989586621680073032 :: TyFun (a ~> Either e b) (Either e b) -> Type) (a6989586621680073033 :: a ~> Either e b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680073027Sym1 a6989586621680073032 :: TyFun (a ~> Either e b) (Either e b) -> Type) (a6989586621680073033 :: a ~> Either e b) = TFHelper_6989586621680073027Sym2 a6989586621680073032 a6989586621680073033
type Apply (Either_Sym1 a6989586621680802341 :: TyFun (b ~> c) (Either a b ~> c) -> Type) (a6989586621680802342 :: b ~> c)
Instance details Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym1 a6989586621680802341 :: TyFun (b ~> c) (Either a b ~> c) -> Type) (a6989586621680802342 :: b ~> c) = Either_Sym2 a6989586621680802341 a6989586621680802342
type Eval (Map f ('Right a3 :: Either a2 a1) :: Either a2 b -> Type)
Instance details Defined in Fcf.Class.Functor type Eval (Map f ('Right a3 :: Either a2 a1) :: Either a2 b -> Type) = 'Right (Eval (f a3)) :: Either a2 b
type Eval (Map f ('Left x :: Either a2 a1) :: Either a2 b -> Type)
Instance details Defined in Fcf.Class.Functor type Eval (Map f ('Left x :: Either a2 a1) :: Either a2 b -> Type) = 'Left x :: Either a2 b
type Eval (Bimap f g ('Right y :: Either a b1) :: Either a' b2 -> Type)
Instance details Defined in Fcf.Class.Bifunctor type Eval (Bimap f g ('Right y :: Either a b1) :: Either a' b2 -> Type) = 'Right (Eval (g y)) :: Either a' b2
type Eval (Bimap f g ('Left x :: Either a1 b) :: Either a2 b' -> Type)
Instance details Defined in Fcf.Class.Bifunctor type Eval (Bimap f g ('Left x :: Either a1 b) :: Either a2 b' -> Type) = 'Left (Eval (f x)) :: Either a2 b'

data Maybe a #

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

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

Constructors

Nothing
Just a

Instances

Instances details

Monad Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods (>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b # (>>) :: Maybe a -> Maybe b -> Maybe b # return :: a -> Maybe a #
Functor Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods fmap :: (a -> b) -> Maybe a -> Maybe b # (<$) :: a -> Maybe b -> Maybe a #
MonadFail Maybe	Since: base-4.9.0.0
Instance details Defined in Control.Monad.Fail Methods fail :: String -> Maybe a #
Applicative Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods pure :: a -> Maybe a # (<>) :: Maybe (a -> b) -> Maybe a -> Maybe b # liftA2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c # (>) :: Maybe a -> Maybe b -> Maybe b # (<*) :: Maybe a -> Maybe b -> Maybe a #
Foldable Maybe	Since: base-2.1
Instance details Defined in Data.Foldable Methods fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldMap' :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # toList :: Maybe a -> [a] # null :: Maybe a -> Bool # length :: Maybe a -> Int # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # sum :: Num a => Maybe a -> a # product :: Num a => Maybe a -> a #
Traversable Maybe	Since: base-2.1
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Maybe a -> f (Maybe b) # sequenceA :: Applicative f => Maybe (f a) -> f (Maybe a) # mapM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b) # sequence :: Monad m => Maybe (m a) -> m (Maybe a) #
MonadPlus Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods mzero :: Maybe a # mplus :: Maybe a -> Maybe a -> Maybe a #
Alternative Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods empty :: Maybe a # (<\|>) :: Maybe a -> Maybe a -> Maybe a # some :: Maybe a -> Maybe [a] # many :: Maybe a -> Maybe [a] #
ToJSON1 Maybe
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Maybe a -> Value # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Maybe a] -> Value # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Maybe a -> Encoding # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Maybe a] -> Encoding #
Eq1 Maybe	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftEq :: (a -> b -> Bool) -> Maybe a -> Maybe b -> Bool #
Ord1 Maybe	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftCompare :: (a -> b -> Ordering) -> Maybe a -> Maybe b -> Ordering #
Read1 Maybe	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Maybe a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Maybe a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Maybe a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Maybe a] #
Show1 Maybe	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Maybe a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Maybe a] -> ShowS #
MonadFailure Maybe
Instance details Defined in Basement.Monad Associated Types type Failure Maybe # Methods mFail :: Failure Maybe -> Maybe () #
NFData1 Maybe	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> Maybe a -> () #
MonadThrow Maybe
Instance details Defined in Control.Monad.Catch Methods throwM :: Exception e => e -> Maybe a #
Hashable1 Maybe
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> Maybe a -> Int #
InjValue Maybe
Instance details Defined in Named.Internal Methods injValue :: a -> Maybe a #
PTraversable Maybe
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg1 :: f (t b) # type SequenceA arg :: f (t a) # type MapM arg arg1 :: m (t b) # type Sequence arg :: m (t a) #
STraversable Maybe
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Maybe a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: forall (f :: Type -> Type) a (t1 :: Maybe (f a)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Maybe a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: forall (m :: Type -> Type) a (t1 :: Maybe (m a)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) #
PFoldable Maybe
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg :: m # type FoldMap arg arg1 :: m # type Foldr arg arg1 arg2 :: b # type Foldr' arg arg1 arg2 :: b # type Foldl arg arg1 arg2 :: b # type Foldl' arg arg1 arg2 :: b # type Foldr1 arg arg1 :: a # type Foldl1 arg arg1 :: a # type ToList arg :: [a] # type Null arg :: Bool # type Length arg :: Nat # type Elem arg arg1 :: Bool # type Maximum arg :: a # type Minimum arg :: a # type Sum arg :: a # type Product arg :: a #
SFoldable Maybe
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t1 :: Maybe m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Maybe a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: forall a (t1 :: a) (t2 :: Maybe a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t1 :: Maybe a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: forall a (t1 :: Maybe a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: forall a (t1 :: Maybe a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: forall a (t1 :: Maybe a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) #
SMonadFail Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Fail Methods sFail :: forall a (t :: [Char]). Sing t -> Sing (Apply FailSym0 t) #
PFunctor Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Fmap arg arg1 :: f b # type arg <$ arg1 :: f a #
PApplicative Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Pure arg :: f a # type arg <> arg1 :: f b # type LiftA2 arg arg1 arg2 :: f c # type arg > arg1 :: f b # type arg <* arg1 :: f a #
PMonad Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type arg >>= arg1 :: m b # type arg >> arg1 :: m b # type Return arg :: m a #
SFunctor Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sFmap :: forall a b (t1 :: a ~> b) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) # (%<$) :: forall a b (t1 :: a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<$@#@$) t1) t2) #
SApplicative Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) # (%<>) :: forall a b (t1 :: Maybe (a ~> b)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) # sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Maybe a) (t3 :: Maybe b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3) # (%>) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%<) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) #
SMonad Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods (%>>=) :: forall a b (t1 :: Maybe a) (t2 :: a ~> Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>=@#@$) t1) t2) # (%>>) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>@#@$) t1) t2) # sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) #
SAlternative Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sEmpty :: Sing EmptySym0 # (%<\|>) :: forall a (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<\|>@#@$) t1) t2) #
SMonadPlus Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sMzero :: Sing MzeroSym0 # sMplus :: forall a (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MplusSym0 t1) t2) #
KnownNamedFunctor Maybe
Instance details Defined in Morley.Util.Named Methods namedL :: forall (name :: Symbol) a. Label name -> Iso' (NamedF Maybe a name) (ApplyNamedFunctor Maybe a)
LorentzFunctor Maybe Source #
Instance details Defined in Lorentz.Instr Methods lmap :: forall b a (s :: [Type]). KnownValue b => ((a ': s) :-> (b ': s)) -> (Maybe a ': s) :-> (Maybe b ': s) Source #
MonadError () Maybe	Since: mtl-2.2.2
Instance details Defined in Control.Monad.Error.Class Methods throwError :: () -> Maybe a # catchError :: Maybe a -> (() -> Maybe a) -> Maybe a #
(Selector s, GToJSON' enc arity (K1 i (Maybe a) :: Type -> Type), KeyValuePair enc pairs, Monoid pairs) => RecordToPairs enc pairs arity (S1 s (K1 i (Maybe a) :: Type -> Type))
Instance details Defined in Data.Aeson.Types.ToJSON Methods recordToPairs :: Options -> ToArgs enc arity a0 -> S1 s (K1 i (Maybe a)) a0 -> pairs
Lift a => Lift (Maybe a :: Type)
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Maybe a -> Q Exp # liftTyped :: Maybe a -> Q (TExp (Maybe a)) #
() :=> (Functor Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- Functor Maybe #
() :=> (Applicative Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- Applicative Maybe #
() :=> (MonadPlus Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- MonadPlus Maybe #
() :=> (Alternative Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- Alternative Maybe #
Eq a => Eq (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Maybe Methods (==) :: Maybe a -> Maybe a -> Bool # (/=) :: Maybe a -> Maybe a -> Bool #
Data a => Data (Maybe a)	Since: base-4.0.0.0
Instance details Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Maybe a -> c (Maybe a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Maybe a) # toConstr :: Maybe a -> Constr # dataTypeOf :: Maybe a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Maybe a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Maybe a)) # gmapT :: (forall b. Data b => b -> b) -> Maybe a -> Maybe a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r # gmapQ :: (forall d. Data d => d -> u) -> Maybe a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Maybe a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) #
Ord a => Ord (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Maybe Methods compare :: Maybe a -> Maybe a -> Ordering # (<) :: Maybe a -> Maybe a -> Bool # (<=) :: Maybe a -> Maybe a -> Bool # (>) :: Maybe a -> Maybe a -> Bool # (>=) :: Maybe a -> Maybe a -> Bool # max :: Maybe a -> Maybe a -> Maybe a # min :: Maybe a -> Maybe a -> Maybe a #
Read a => Read (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (Maybe a) # readList :: ReadS [Maybe a] # readPrec :: ReadPrec (Maybe a) # readListPrec :: ReadPrec [Maybe a] #
Show a => Show (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Maybe a -> ShowS # show :: Maybe a -> String # showList :: [Maybe a] -> ShowS #
Generic (Maybe a)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (Maybe a) :: Type -> Type # Methods from :: Maybe a -> Rep (Maybe a) x # to :: Rep (Maybe a) x -> Maybe a #
Semigroup a => Semigroup (Maybe a)	Since: base-4.9.0.0
Instance details Defined 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 => Monoid (Maybe a)	Lift a semigroup into `Maybe` forming a `Monoid` according to http://en.wikipedia.org/wiki/Monoid: "Any semigroup `S` may be turned into a monoid simply by adjoining an element `e` not in `S` and defining `ee = e` and `es = s = se` for all `s ∈ S`." Since 4.11.0: constraint on inner `a` value generalised from `Monoid` to `Semigroup`. Since: base-2.1*
Instance details Defined in GHC.Base Methods mempty :: Maybe a # mappend :: Maybe a -> Maybe a -> Maybe a # mconcat :: [Maybe a] -> Maybe a #
Structured a => Structured (Maybe a)
Instance details Defined in Distribution.Utils.Structured Methods structure :: Proxy (Maybe a) -> Structure # structureHash' :: Tagged (Maybe a) MD5
NFData a => NFData (Maybe a)
Instance details Defined in Control.DeepSeq Methods rnf :: Maybe a -> () #
Hashable a => Hashable (Maybe a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Maybe a -> Int # hash :: Maybe a -> Int #
ToJSON a => ToJSON (Maybe a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Maybe a -> Value # toEncoding :: Maybe a -> Encoding # toJSONList :: [Maybe a] -> Value # toEncodingList :: [Maybe a] -> Encoding #
Default (Maybe a)
Instance details Defined in Data.Default.Class Methods def :: Maybe a #
Buildable a => Buildable (Maybe a)
Instance details Defined in Formatting.Buildable Methods build :: Maybe a -> Builder #
Ixed (Maybe a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Maybe a) -> Traversal' (Maybe a) (IxValue (Maybe a)) #
At (Maybe a)
Instance details Defined in Control.Lens.At Methods at :: Index (Maybe a) -> Lens' (Maybe a) (Maybe (IxValue (Maybe a))) #
Semiring a => Semiring (Maybe a)
Instance details Defined in Data.Semiring Methods plus :: Maybe a -> Maybe a -> Maybe a # zero :: Maybe a # times :: Maybe a -> Maybe a -> Maybe a # one :: Maybe a # fromNatural :: Natural -> Maybe a #
PMonoid (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a # type Mappend arg arg1 :: a # type Mconcat arg :: a #
SSemigroup a => SMonoid (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 # sMappend :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) # sMconcat :: forall (t :: [Maybe a]). Sing t -> Sing (Apply MconcatSym0 t) #
PShow (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg1 arg2 :: Symbol # type Show_ arg :: Symbol # type ShowList arg arg1 :: Symbol #
SShow a => SShow (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t1 :: Nat) (t2 :: Maybe a) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) # sShow_ :: forall (t :: Maybe a). Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: forall (t1 :: [Maybe a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) #
PSemigroup (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type arg <> arg1 :: a # type Sconcat arg :: a #
SSemigroup a => SSemigroup (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%<>) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) # sSconcat :: forall (t :: NonEmpty (Maybe a)). Sing t -> Sing (Apply SconcatSym0 t) #
POrd (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg1 :: Ordering # type arg < arg1 :: Bool # type arg <= arg1 :: Bool # type arg > arg1 :: Bool # type arg >= arg1 :: Bool # type Max arg arg1 :: a # type Min arg arg1 :: a #
SOrd a => SOrd (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) #
SEq a => SEq (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: forall (a0 :: Maybe a) (b :: Maybe a). Sing a0 -> Sing b -> Sing (a0 == b) # (%/=) :: forall (a0 :: Maybe a) (b :: Maybe a). Sing a0 -> Sing b -> Sing (a0 /= b) #
PEq (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool # type x /= y :: Bool #
(TypeError (DisallowInstance "Maybe") :: Constraint) => Container (Maybe a)
Instance details Defined in Universum.Container.Class Associated Types type Element (Maybe a) # Methods toList :: Maybe a -> [Element (Maybe a)] # null :: Maybe a -> Bool # foldr :: (Element (Maybe a) -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> Element (Maybe a) -> b) -> b -> Maybe a -> b # foldl' :: (b -> Element (Maybe a) -> b) -> b -> Maybe a -> b # length :: Maybe a -> Int # elem :: Element (Maybe a) -> Maybe a -> Bool # foldMap :: Monoid m => (Element (Maybe a) -> m) -> Maybe a -> m # fold :: Maybe a -> Element (Maybe a) # foldr' :: (Element (Maybe a) -> b -> b) -> b -> Maybe a -> b # notElem :: Element (Maybe a) -> Maybe a -> Bool # all :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # any :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # and :: Maybe a -> Bool # or :: Maybe a -> Bool # find :: (Element (Maybe a) -> Bool) -> Maybe a -> Maybe (Element (Maybe a)) # safeHead :: Maybe a -> Maybe (Element (Maybe a)) # safeMaximum :: Maybe a -> Maybe (Element (Maybe a)) # safeMinimum :: Maybe a -> Maybe (Element (Maybe a)) # safeFoldr1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Maybe (Element (Maybe a)) # safeFoldl1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Maybe (Element (Maybe a)) #
Pretty a => Pretty (Maybe a)
Instance details Defined in Text.PrettyPrint.Leijen.Text Methods pretty :: Maybe a -> Doc # prettyList :: [Maybe a] -> Doc #
SingKind a => SingKind (Maybe a)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Associated Types type DemoteRep (Maybe a) Methods fromSing :: forall (a0 :: Maybe a). Sing a0 -> DemoteRep (Maybe a)
PolyTypeHasDocC '[a] => TypeHasDoc (Maybe a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Maybe a) :: FieldDescriptions # Methods typeDocName :: Proxy (Maybe a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Maybe a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Maybe a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Maybe a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Maybe a) #
IsoValue a => IsoValue (Maybe a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (Maybe a) :: T # Methods toVal :: Maybe a -> Value (ToT (Maybe a)) # fromVal :: Value (ToT (Maybe a)) -> Maybe a #
HasAnnotation a => HasAnnotation (Maybe a) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Maybe a)) Source # annOptions :: AnnOptions Source #
HasRPCRepr a => HasRPCRepr (Maybe a)
Instance details Defined in Morley.AsRPC Associated Types type AsRPC (Maybe a)
MapOpHs (Maybe e) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MapOpInpHs (Maybe e) Source # type MapOpResHs (Maybe e) :: Type -> Type Source #
Generic1 Maybe	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep1 Maybe :: k -> Type # Methods from1 :: forall (a :: k). Maybe a -> Rep1 Maybe a # to1 :: forall (a :: k). Rep1 Maybe a -> Maybe a #
PMonadFail Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Fail Associated Types type Fail arg :: m a #
PAlternative Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Empty :: f a # type arg <\|> arg1 :: f a #
PMonadPlus Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Mzero :: m a # type Mplus arg arg1 :: m a #
IsoHKD Maybe (a :: Type)
Instance details Defined in Data.Vinyl.XRec Associated Types type HKD Maybe a # Methods unHKD :: HKD Maybe a -> Maybe a # toHKD :: Maybe a -> HKD Maybe a #
SDecide a => TestCoercion (SMaybe :: Maybe a -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods testCoercion :: forall (a0 :: k) (b :: k). SMaybe a0 -> SMaybe b -> Maybe (Coercion a0 b) #
SDecide a => TestEquality (SMaybe :: Maybe a -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods testEquality :: forall (a0 :: k) (b :: k). SMaybe a0 -> SMaybe b -> Maybe (a0 :~: b) #
(Eq a) :=> (Eq (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Eq a :- Eq (Maybe a) #
(Ord a) :=> (Ord (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Ord a :- Ord (Maybe a) #
(Read a) :=> (Read (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Read a :- Read (Maybe a) #
(Show a) :=> (Show (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Show a :- Show (Maybe a) #
(Semigroup a) :=> (Semigroup (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Semigroup a :- Semigroup (Maybe a) #
(Monoid a) :=> (Monoid (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Monoid a :- Monoid (Maybe a) #
SingI ('Nothing :: Maybe a)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing 'Nothing
Each (Maybe a) (Maybe b) a b
Instance details Defined in Lens.Micro.Internal Methods each :: Traversal (Maybe a) (Maybe b) a b #
CanCastTo a b => CanCastTo (Maybe a :: Type) (Maybe b :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: Proxy (Maybe a) -> Proxy (Maybe b) -> () Source #
SingI a2 => SingI ('Just a2 :: Maybe a1)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing ('Just a2)
SuppressUnusedWarnings (Fail_6989586621680156221Sym0 :: TyFun [Char] (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Fail Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680073042Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromJustSym0 :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679848468Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680240791Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a) (Last a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a) (First a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680653904Sym0 :: TyFun Nat (Maybe a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Pure_6989586621680072784Sym0 :: TyFun a (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680073051LSym0 :: TyFun k1 (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (JustSym0 :: TyFun a (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SingI (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing CatMaybesSym0 #
SingI (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing ListToMaybeSym0 #
SingI (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MaybeToListSym0 #
SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsNothingSym0 #
SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsJustSym0 #
SingI (FromJustSym0 :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromJustSym0 #
SingI (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing MinInternalSym0 #
SingI (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing MaxInternalSym0 #
SingI (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing OptionSym0 #
SingI (LastSym0 :: TyFun (Maybe a) (Last a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sing :: Sing LastSym0 #
SingI (FirstSym0 :: TyFun (Maybe a) (First a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sing :: Sing FirstSym0 #
SingI (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromMaybeSym0 #
SEq a => SingI (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing ElemIndexSym0 #
SingI (JustSym0 :: TyFun a (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing JustSym0 #
SingI (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing GetOptionSym0 #
SingI (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sing :: Sing GetFirstSym0 #
SingI (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sing :: Sing GetLastSym0 #
SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindSym0 #
SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndexSym0 #
SingI (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing GetMaxInternalSym0 #
SingI (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing GetMinInternalSym0 #
SuppressUnusedWarnings (StripPrefixSym1 a6989586621680498961 :: TyFun [a] (Maybe [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym1 a6989586621680379639 :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym1 a6989586621680379612 :: TyFun [a] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemIndexSym1 a6989586621680379630 :: TyFun [a] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680653904Sym1 a6989586621680653914 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680073042Sym1 a6989586621680073047 :: TyFun (Maybe a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072966Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072955Sym0 :: TyFun (Maybe a) ((a ~> Maybe b) ~> Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072821Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromMaybeSym1 a6989586621679959410 :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679848468Sym1 a6989586621679848473 :: TyFun (Maybe a) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680240791Sym1 a6989586621680240796 :: TyFun (Maybe a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072794Sym0 :: TyFun (Maybe (a ~> b)) (Maybe a ~> Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072673Sym0 :: TyFun a (Maybe b ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680823018MkJustSym0 :: TyFun k (TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680823003MkJustSym0 :: TyFun k (TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814087NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814087MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814063NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814063MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621680072661Sym0 :: TyFun (a ~> b) (Maybe a ~> Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680823060Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl_6989586621680823076Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FoldMap_6989586621680823044Sym0 :: TyFun (a ~> m) (Maybe a ~> m) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SingI d => SingI (FindSym1 d :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (FindSym1 d) #
SingI d => SingI (FindIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (FindIndexSym1 d) #
(SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (ElemIndexSym1 d) #
SingI d => SingI (FromMaybeSym1 d :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (FromMaybeSym1 d) #
SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing Maybe_Sym0 #
SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing LookupSym0 #
SAlternative f => SingI (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Applicative Methods sing :: Sing OptionalSym0 #
SingI (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MapMaybeSym0 #
SingI (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing UnfoldrSym0 #
SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing FindSym0 #
SuppressUnusedWarnings (LookupSym1 a6989586621680379337 :: TyFun [(a, b)] (Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072966Sym1 a6989586621680072975 :: TyFun (Maybe b) (Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072821Sym1 a6989586621680072826 :: TyFun (Maybe b) (Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072794Sym1 a6989586621680072799 :: TyFun (Maybe a) (Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072673Sym1 a6989586621680072678 :: TyFun (Maybe b) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621680072661Sym1 a6989586621680072666 :: TyFun (Maybe a) (Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FoldMap_6989586621680823044Sym1 a6989586621680823053 :: TyFun (Maybe a) m -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680823018MkJustSym1 a_69895866216808230126989586621680823017 :: TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680823003MkJustSym1 a_69895866216808229976989586621680823002 :: TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814087NSym1 x6989586621680814085 :: TyFun k1 (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814087MSym1 x6989586621680814085 :: TyFun k (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814063NSym1 x6989586621680814061 :: TyFun k1 (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680814063MSym1 x6989586621680814061 :: TyFun k (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680823060Sym1 a6989586621680823066 :: TyFun b (Maybe a ~> b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl_6989586621680823076Sym1 a6989586621680823082 :: TyFun b (Maybe a ~> b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym1 a6989586621680822510 :: TyFun (t a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680701092Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680701013Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Traverse_6989586621681088263Sym0 :: TyFun (a ~> f b) (Maybe a ~> f (Maybe b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680072955Sym1 a6989586621680072960 :: TyFun (a ~> Maybe b) (Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LiftA2_6989586621680072807Sym0 :: TyFun (a ~> (b ~> c)) (Maybe a ~> (Maybe b ~> Maybe c)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maybe_Sym1 a6989586621679957844 :: TyFun (a ~> b) (Maybe a ~> b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679959385RsSym0 :: TyFun (a ~> Maybe k1) (TyFun k (TyFun [a] [k1] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680822925MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680822904MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
(SEq a, SingI d) => SingI (LookupSym1 d :: TyFun [(a, b)] (Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (LookupSym1 d) #
(SFoldable t, SingI d) => SingI (FindSym1 d :: TyFun (t a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (FindSym1 d) #
SingI d => SingI (Maybe_Sym1 d :: TyFun (a ~> b) (Maybe a ~> b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym1 d) #
SuppressUnusedWarnings (Traverse_6989586621681088263Sym1 a6989586621681088268 :: TyFun (Maybe a) (f (Maybe b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LiftA2_6989586621680072807Sym1 a6989586621680072813 :: TyFun (Maybe a) (Maybe b ~> Maybe c) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maybe_Sym2 a6989586621679957844 a6989586621679957845 :: TyFun (Maybe a) b -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680823060Sym2 a6989586621680823066 a6989586621680823067 :: TyFun (Maybe a) b -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl_6989586621680823076Sym2 a6989586621680823082 a6989586621680823083 :: TyFun (Maybe a) b -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680822925MfSym1 f6989586621680822923 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680822904MfSym1 f6989586621680822902 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680701092Sym1 a6989586621680701090 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680701013Sym1 a6989586621680701011 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
(SingI d1, SingI d2) => SingI (Maybe_Sym2 d1 d2 :: TyFun (Maybe a) b -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym2 d1 d2) #
SuppressUnusedWarnings (LiftA2_6989586621680072807Sym2 a6989586621680072813 a6989586621680072814 :: TyFun (Maybe b) (Maybe c) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680822925MfSym2 f6989586621680822923 xs6989586621680822924 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680822904MfSym2 f6989586621680822902 xs6989586621680822903 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680701092Sym2 a6989586621680701090 k6989586621680701091 :: TyFun k1 (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680701013Sym2 a6989586621680701011 k6989586621680701012 :: TyFun k1 (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680822904MfSym3 f6989586621680822902 xs6989586621680822903 a6989586621680822905 :: TyFun (Maybe k3) (Maybe k2) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680822925MfSym3 f6989586621680822923 xs6989586621680822924 a6989586621680822926 :: TyFun k3 (Maybe k3) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
IsoValue a => IsoValue (NamedF Maybe a name)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value Associated Types type ToT (NamedF Maybe a name) :: T # Methods toVal :: NamedF Maybe a name -> Value (ToT (NamedF Maybe a name)) # fromVal :: Value (ToT (NamedF Maybe a name)) -> NamedF Maybe a name #
(HasAnnotation (Maybe a), KnownSymbol name) => HasAnnotation (NamedF Maybe a name) Source #
Instance details Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (NamedF Maybe a name)) Source # annOptions :: AnnOptions Source #
HasRPCRepr a => HasRPCRepr (NamedF Maybe a name)
Instance details Defined in Morley.AsRPC Associated Types type AsRPC (NamedF Maybe a name)
Wrappable (NamedF Maybe a name) Source #
Instance details Defined in Lorentz.Wrappable
Unwrappable (NamedF Maybe a name) Source #
Instance details Defined in Lorentz.Wrappable Associated Types type Unwrappabled (NamedF Maybe a name) Source #
type Failure Maybe
Instance details Defined in Basement.Monad type Failure Maybe = ()
type Product (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Product (arg :: Maybe a) = Apply (Product_6989586621680823034Sym0 :: TyFun (Maybe a) a -> Type) arg
type Sum (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Sum (arg :: Maybe a) = Apply (Sum_6989586621680823025Sym0 :: TyFun (Maybe a) a -> Type) arg
type Minimum (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Minimum (arg :: Maybe a) = Apply (Minimum_6989586621680823010Sym0 :: TyFun (Maybe a) a -> Type) arg
type Maximum (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Maximum (arg :: Maybe a) = Apply (Maximum_6989586621680822995Sym0 :: TyFun (Maybe a) a -> Type) arg
type Length (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Length (arg :: Maybe a) = Apply (Length_6989586621680822962Sym0 :: TyFun (Maybe a) Nat -> Type) arg
type Null (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Null (arg :: Maybe a) = Apply (Null_6989586621680822945Sym0 :: TyFun (Maybe a) Bool -> Type) arg
type ToList (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type ToList (arg :: Maybe a) = Apply (ToList_6989586621680822936Sym0 :: TyFun (Maybe a) [a] -> Type) arg
type Fold (arg :: Maybe m)
Instance details Defined in Data.Singletons.Prelude.Foldable type Fold (arg :: Maybe m) = Apply (Fold_6989586621680822796Sym0 :: TyFun (Maybe m) m -> Type) arg
type Pure (a :: k1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Pure (a :: k1) = Apply (Pure_6989586621680072784Sym0 :: TyFun k1 (Maybe k1) -> Type) a
type Return (arg :: a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Return (arg :: a) = Apply (Return_6989586621680012015Sym0 :: TyFun a (Maybe a) -> Type) arg
type Sequence (arg :: Maybe (m a))
Instance details Defined in Data.Singletons.Prelude.Traversable type Sequence (arg :: Maybe (m a)) = Apply (Sequence_6989586621681082058Sym0 :: TyFun (Maybe (m a)) (m (Maybe a)) -> Type) arg
type SequenceA (arg :: Maybe (f a))
Instance details Defined in Data.Singletons.Prelude.Traversable type SequenceA (arg :: Maybe (f a)) = Apply (SequenceA_6989586621681082034Sym0 :: TyFun (Maybe (f a)) (f (Maybe a)) -> Type) arg
type Elem (arg1 :: a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Elem (arg1 :: a) (arg2 :: Maybe a) = Apply (Apply (Elem_6989586621680822981Sym0 :: TyFun a (Maybe a ~> Bool) -> Type) arg1) arg2
type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) = Apply (Apply (Foldl1_6989586621680822916Sym0 :: TyFun (a ~> (a ~> a)) (Maybe a ~> a) -> Type) arg1) arg2
type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) = Apply (Apply (Foldr1_6989586621680822895Sym0 :: TyFun (a ~> (a ~> a)) (Maybe a ~> a) -> Type) arg1) arg2
type FoldMap (a2 :: a1 ~> k2) (a3 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type FoldMap (a2 :: a1 ~> k2) (a3 :: Maybe a1) = Apply (Apply (FoldMap_6989586621680823044Sym0 :: TyFun (a1 ~> k2) (Maybe a1 ~> k2) -> Type) a2) a3
type (a1 :: k1) <$ (a2 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: k1) <$ (a2 :: Maybe b) = Apply (Apply (TFHelper_6989586621680072673Sym0 :: TyFun k1 (Maybe b ~> Maybe k1) -> Type) a1) a2
type Fmap (a2 :: a1 ~> b) (a3 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Fmap (a2 :: a1 ~> b) (a3 :: Maybe a1) = Apply (Apply (Fmap_6989586621680072661Sym0 :: TyFun (a1 ~> b) (Maybe a1 ~> Maybe b) -> Type) a2) a3
type (arg1 :: Maybe a) <* (arg2 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (arg1 :: Maybe a) <* (arg2 :: Maybe b) = Apply (Apply (TFHelper_6989586621680011970Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe a) -> Type) arg1) arg2
type (a2 :: Maybe a1) *> (a3 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a2 :: Maybe a1) *> (a3 :: Maybe b) = Apply (Apply (TFHelper_6989586621680072821Sym0 :: TyFun (Maybe a1) (Maybe b ~> Maybe b) -> Type) a2) a3
type (a2 :: Maybe (a1 ~> b)) <*> (a3 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a2 :: Maybe (a1 ~> b)) <*> (a3 :: Maybe a1) = Apply (Apply (TFHelper_6989586621680072794Sym0 :: TyFun (Maybe (a1 ~> b)) (Maybe a1 ~> Maybe b) -> Type) a2) a3
type (a2 :: Maybe a1) >> (a3 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a2 :: Maybe a1) >> (a3 :: Maybe b) = Apply (Apply (TFHelper_6989586621680072966Sym0 :: TyFun (Maybe a1) (Maybe b ~> Maybe b) -> Type) a2) a3
type (a2 :: Maybe a1) >>= (a3 :: a1 ~> Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a2 :: Maybe a1) >>= (a3 :: a1 ~> Maybe b) = Apply (Apply (TFHelper_6989586621680072955Sym0 :: TyFun (Maybe a1) ((a1 ~> Maybe b) ~> Maybe b) -> Type) a2) a3
type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Traversable type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a) = Apply (Apply (MapM_6989586621681082044Sym0 :: TyFun (a ~> m b) (Maybe a ~> m (Maybe b)) -> Type) arg1) arg2
type Traverse (a2 :: a1 ~> f b) (a3 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Traversable type Traverse (a2 :: a1 ~> f b) (a3 :: Maybe a1) = Apply (Apply (Traverse_6989586621681088263Sym0 :: TyFun (a1 ~> f b) (Maybe a1 ~> f (Maybe b)) -> Type) a2) a3
type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a) = Apply (Apply (Apply (Foldl'_6989586621680822873Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) arg1) arg2) arg3
type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Maybe a1) = Apply (Apply (Apply (Foldl_6989586621680823076Sym0 :: TyFun (k2 ~> (a1 ~> k2)) (k2 ~> (Maybe a1 ~> k2)) -> Type) a2) a3) a4
type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a) = Apply (Apply (Apply (Foldr'_6989586621680822835Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) arg1) arg2) arg3
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Maybe a1) = Apply (Apply (Apply (Foldr_6989586621680823060Sym0 :: TyFun (a1 ~> (k2 ~> k2)) (k2 ~> (Maybe a1 ~> k2)) -> Type) a2) a3) a4
type LiftA2 (a2 :: a1 ~> (b ~> c)) (a3 :: Maybe a1) (a4 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type LiftA2 (a2 :: a1 ~> (b ~> c)) (a3 :: Maybe a1) (a4 :: Maybe b) = Apply (Apply (Apply (LiftA2_6989586621680072807Sym0 :: TyFun (a1 ~> (b ~> c)) (Maybe a1 ~> (Maybe b ~> Maybe c)) -> Type) a2) a3) a4
type Apply (Pure_6989586621680072784Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621680072790 :: a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Pure_6989586621680072784Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621680072790 :: a) = Pure_6989586621680072784Sym1 a6989586621680072790
type Apply (Let6989586621680073051LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216800721496989586621680073050 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Let6989586621680073051LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216800721496989586621680073050 :: k1) = Let6989586621680073051LSym1 wild_69895866216800721496989586621680073050
type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (a6989586621679750104 :: a)
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (a6989586621679750104 :: a) = JustSym1 a6989586621679750104
type Apply (Let6989586621680814063NSym1 x6989586621680814061 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680814062 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814063NSym1 x6989586621680814061 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680814062 :: k1) = Let6989586621680814063NSym2 x6989586621680814061 y6989586621680814062
type Apply (Let6989586621680814063MSym1 x6989586621680814061 :: TyFun k (Maybe k1) -> Type) (y6989586621680814062 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814063MSym1 x6989586621680814061 :: TyFun k (Maybe k1) -> Type) (y6989586621680814062 :: k) = Let6989586621680814063MSym2 x6989586621680814061 y6989586621680814062
type Apply (Let6989586621680814087NSym1 x6989586621680814085 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680814086 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814087NSym1 x6989586621680814085 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680814086 :: k1) = Let6989586621680814087NSym2 x6989586621680814085 y6989586621680814086
type Apply (Let6989586621680814087MSym1 x6989586621680814085 :: TyFun k (Maybe k1) -> Type) (y6989586621680814086 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814087MSym1 x6989586621680814085 :: TyFun k (Maybe k1) -> Type) (y6989586621680814086 :: k) = Let6989586621680814087MSym2 x6989586621680814085 y6989586621680814086
type Apply (Let6989586621680823003MkJustSym1 a_69895866216808229976989586621680823002 :: TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type) (a6989586621680823006 :: a6989586621680822175)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680823003MkJustSym1 a_69895866216808229976989586621680823002 :: TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type) (a6989586621680823006 :: a6989586621680822175) = Let6989586621680823003MkJustSym2 a_69895866216808229976989586621680823002 a6989586621680823006
type Apply (Let6989586621680823018MkJustSym1 a_69895866216808230126989586621680823017 :: TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type) (a6989586621680823021 :: a6989586621680822176)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680823018MkJustSym1 a_69895866216808230126989586621680823017 :: TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type) (a6989586621680823021 :: a6989586621680822176) = Let6989586621680823018MkJustSym2 a_69895866216808230126989586621680823017 a6989586621680823021
type Apply (Lambda_6989586621680701013Sym2 a6989586621680701011 k6989586621680701012 :: TyFun k1 (Maybe a) -> Type) (x6989586621680701015 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680701013Sym2 a6989586621680701011 k6989586621680701012 :: TyFun k1 (Maybe a) -> Type) (x6989586621680701015 :: k1) = Lambda_6989586621680701013Sym3 a6989586621680701011 k6989586621680701012 x6989586621680701015
type Apply (Lambda_6989586621680701092Sym2 a6989586621680701090 k6989586621680701091 :: TyFun k1 (Maybe a) -> Type) (x6989586621680701094 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680701092Sym2 a6989586621680701090 k6989586621680701091 :: TyFun k1 (Maybe a) -> Type) (x6989586621680701094 :: k1) = Lambda_6989586621680701092Sym3 a6989586621680701090 k6989586621680701091 x6989586621680701094
type Apply (Let6989586621680822925MfSym3 f6989586621680822923 xs6989586621680822924 a6989586621680822926 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680822927 :: k3)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680822925MfSym3 f6989586621680822923 xs6989586621680822924 a6989586621680822926 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680822927 :: k3) = Let6989586621680822925MfSym4 f6989586621680822923 xs6989586621680822924 a6989586621680822926 a6989586621680822927
type Apply (ShowsPrec_6989586621680653904Sym0 :: TyFun Nat (Maybe a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680653914 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680653904Sym0 :: TyFun Nat (Maybe a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680653914 :: Nat) = ShowsPrec_6989586621680653904Sym1 a6989586621680653914 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type
type Apply (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) (a6989586621679959410 :: a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) (a6989586621679959410 :: a) = FromMaybeSym1 a6989586621679959410
type Apply (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) (a6989586621680379630 :: a)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) (a6989586621680379630 :: a) = ElemIndexSym1 a6989586621680379630
type Apply (TFHelper_6989586621680072673Sym0 :: TyFun a (Maybe b ~> Maybe a) -> Type) (a6989586621680072678 :: a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072673Sym0 :: TyFun a (Maybe b ~> Maybe a) -> Type) (a6989586621680072678 :: a) = TFHelper_6989586621680072673Sym1 a6989586621680072678 :: TyFun (Maybe b) (Maybe a) -> Type
type Apply (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) (a6989586621679957844 :: b)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) (a6989586621679957844 :: b) = Maybe_Sym1 a6989586621679957844 :: TyFun (a ~> b) (Maybe a ~> b) -> Type
type Apply (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) (a6989586621680379337 :: a)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) (a6989586621680379337 :: a) = LookupSym1 a6989586621680379337 :: TyFun [(a, b)] (Maybe b) -> Type
type Apply (Let6989586621680814063NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680814061 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814063NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680814061 :: k) = Let6989586621680814063NSym1 x6989586621680814061 :: TyFun k1 (Maybe k1) -> Type
type Apply (Let6989586621680814063MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680814061 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814063MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680814061 :: k1) = Let6989586621680814063MSym1 x6989586621680814061 :: TyFun k (Maybe k1) -> Type
type Apply (Let6989586621680814087NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680814085 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814087NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680814085 :: k) = Let6989586621680814087NSym1 x6989586621680814085 :: TyFun k1 (Maybe k1) -> Type
type Apply (Let6989586621680814087MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680814085 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814087MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680814085 :: k1) = Let6989586621680814087MSym1 x6989586621680814085 :: TyFun k (Maybe k1) -> Type
type Apply (Let6989586621680823003MkJustSym0 :: TyFun k (TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type) -> Type) (a_69895866216808229976989586621680823002 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680823003MkJustSym0 :: TyFun k (TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type) -> Type) (a_69895866216808229976989586621680823002 :: k) = Let6989586621680823003MkJustSym1 a_69895866216808229976989586621680823002 :: TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type
type Apply (Let6989586621680823018MkJustSym0 :: TyFun k (TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type) -> Type) (a_69895866216808230126989586621680823017 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680823018MkJustSym0 :: TyFun k (TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type) -> Type) (a_69895866216808230126989586621680823017 :: k) = Let6989586621680823018MkJustSym1 a_69895866216808230126989586621680823017 :: TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type
type Apply (Foldr_6989586621680823060Sym1 a6989586621680823066 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680823067 :: b)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldr_6989586621680823060Sym1 a6989586621680823066 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680823067 :: b) = Foldr_6989586621680823060Sym2 a6989586621680823066 a6989586621680823067
type Apply (Foldl_6989586621680823076Sym1 a6989586621680823082 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680823083 :: b)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldl_6989586621680823076Sym1 a6989586621680823082 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680823083 :: b) = Foldl_6989586621680823076Sym2 a6989586621680823082 a6989586621680823083
type Apply (Lambda_6989586621680701013Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680701011 :: k)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680701013Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680701011 :: k) = Lambda_6989586621680701013Sym1 a6989586621680701011 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type
type Apply (Lambda_6989586621680701092Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680701090 :: k)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680701092Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680701090 :: k) = Lambda_6989586621680701092Sym1 a6989586621680701090 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type
type Apply (Let6989586621680822904MfSym1 f6989586621680822902 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) (xs6989586621680822903 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680822904MfSym1 f6989586621680822902 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) (xs6989586621680822903 :: k) = Let6989586621680822904MfSym2 f6989586621680822902 xs6989586621680822903
type Apply (Let6989586621680822925MfSym1 f6989586621680822923 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680822924 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680822925MfSym1 f6989586621680822923 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680822924 :: k) = Let6989586621680822925MfSym2 f6989586621680822923 xs6989586621680822924
type Apply (Let6989586621680822904MfSym2 f6989586621680822902 xs6989586621680822903 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) (a6989586621680822905 :: k2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680822904MfSym2 f6989586621680822902 xs6989586621680822903 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) (a6989586621680822905 :: k2) = Let6989586621680822904MfSym3 f6989586621680822902 xs6989586621680822903 a6989586621680822905
type Eval (FoldMap f ('Just x) :: a2 -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (FoldMap f ('Just x) :: a2 -> Type) = Eval (f x)
type Eval (FoldMap f ('Nothing :: Maybe a1) :: a2 -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (FoldMap f ('Nothing :: Maybe a1) :: a2 -> Type) = MEmpty :: a2
type Eval (Foldr f y ('Just x) :: a2 -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (Foldr f y ('Just x) :: a2 -> Type) = Eval (f x y)
type Eval (Foldr f y ('Nothing :: Maybe a1) :: a2 -> Type)
Instance details Defined in Fcf.Class.Foldable type Eval (Foldr f y ('Nothing :: Maybe a1) :: a2 -> Type) = y
type Rep (Maybe a)
Instance details Defined in GHC.Generics type Rep (Maybe a) = D1 ('MetaData "Maybe" "GHC.Maybe" "base" 'False) (C1 ('MetaCons "Nothing" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Just" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))
type MEmpty
Instance details Defined in Fcf.Class.Monoid type MEmpty = 'Nothing :: Maybe a
type Index (Maybe a)
Instance details Defined in Control.Lens.At type Index (Maybe a) = ()
type IxValue (Maybe a)
Instance details Defined in Control.Lens.At type IxValue (Maybe a) = a
type Mempty
Instance details Defined in Data.Singletons.Prelude.Monoid type Mempty = Mempty_6989586621680691392Sym0 :: Maybe a
type Sing
Instance details Defined in Data.Singletons.Prelude.Instances type Sing = SMaybe :: Maybe a -> Type
type Demote (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Instances type Demote (Maybe a) = Maybe (Demote a)
type Element (Maybe a)
Instance details Defined in Universum.Container.Class type Element (Maybe a) = ElementDefault (Maybe a)
type DemoteRep (Maybe a)
Instance details Defined in GHC.Generics type DemoteRep (Maybe a) = Maybe (DemoteRep a)
data Sing (b :: Maybe a)
Instance details Defined in GHC.Generics data Sing (b :: Maybe a) where SNothing :: forall a. Sing ('Nothing :: Maybe a) SJust :: forall a (a1 :: a). Sing a1 -> Sing ('Just a1)
type TypeDocFieldDescriptions (Maybe a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Maybe a) = '[] :: [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type ToT (Maybe a)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (Maybe a) = 'TOption (ToT a)
type AsRPC (Maybe a)
Instance details Defined in Morley.AsRPC type AsRPC (Maybe a) = Maybe (AsRPC a)
type MapOpInpHs (Maybe e) Source #
Instance details Defined in Lorentz.Polymorphic type MapOpInpHs (Maybe e) = e
type MapOpResHs (Maybe e) Source #
Instance details Defined in Lorentz.Polymorphic type MapOpResHs (Maybe e) = Maybe
type Rep1 Maybe
Instance details Defined in GHC.Generics type Rep1 Maybe = D1 ('MetaData "Maybe" "GHC.Maybe" "base" 'False) (C1 ('MetaCons "Nothing" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Just" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1))
type Mconcat (arg :: [Maybe a])
Instance details Defined in Data.Singletons.Prelude.Monoid type Mconcat (arg :: [Maybe a]) = Apply (Mconcat_6989586621680691345Sym0 :: TyFun [Maybe a] (Maybe a) -> Type) arg
type Show_ (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Show type Show_ (arg :: Maybe a) = Apply (Show__6989586621680636746Sym0 :: TyFun (Maybe a) Symbol -> Type) arg
type Sconcat (arg :: NonEmpty (Maybe a))
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Sconcat (arg :: NonEmpty (Maybe a)) = Apply (Sconcat_6989586621680240642Sym0 :: TyFun (NonEmpty (Maybe a)) (Maybe a) -> Type) arg
type Mappend (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Mappend (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Mappend_6989586621680691331Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type ShowList (arg1 :: [Maybe a]) arg2
Instance details Defined in Data.Singletons.Prelude.Show type ShowList (arg1 :: [Maybe a]) arg2 = Apply (Apply (ShowList_6989586621680636754Sym0 :: TyFun [Maybe a] (Symbol ~> Symbol) -> Type) arg1) arg2
type (a2 :: Maybe a1) <> (a3 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type (a2 :: Maybe a1) <> (a3 :: Maybe a1) = Apply (Apply (TFHelper_6989586621680240791Sym0 :: TyFun (Maybe a1) (Maybe a1 ~> Maybe a1) -> Type) a2) a3
type Empty
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Empty = Empty_6989586621680073037Sym0 :: Maybe a
type Mzero
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Mzero = Mzero_6989586621680012035Sym0 :: Maybe a
type Min (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type Min (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Min_6989586621679837487Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type Max (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type Max (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Max_6989586621679837471Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type (arg1 :: Maybe a) >= (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Maybe a) >= (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679837455Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Maybe a) > (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Maybe a) > (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679837439Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Maybe a) <= (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Maybe a) <= (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679837423Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Maybe a) < (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Maybe a) < (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679837407Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type Compare (a2 :: Maybe a1) (a3 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Ord type Compare (a2 :: Maybe a1) (a3 :: Maybe a1) = Apply (Apply (Compare_6989586621679848468Sym0 :: TyFun (Maybe a1) (Maybe a1 ~> Ordering) -> Type) a2) a3
type (x :: Maybe a) /= (y :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Eq type (x :: Maybe a) /= (y :: Maybe a) = Not (x == y)
type (a2 :: Maybe a1) == (b :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Eq type (a2 :: Maybe a1) == (b :: Maybe a1) = Equals_6989586621679820229 a2 b
type HKD Maybe (a :: Type)
Instance details Defined in Data.Vinyl.XRec type HKD Maybe (a :: Type) = Maybe a
type ShowsPrec a2 (a3 :: Maybe a1) a4
Instance details Defined in Data.Singletons.Prelude.Show type ShowsPrec a2 (a3 :: Maybe a1) a4 = Apply (Apply (Apply (ShowsPrec_6989586621680653904Sym0 :: TyFun Nat (Maybe a1 ~> (Symbol ~> Symbol)) -> Type) a2) a3) a4
type Fail a2
Instance details Defined in Data.Singletons.Prelude.Monad.Fail type Fail a2 = Apply (Fail_6989586621680156221Sym0 :: TyFun [Char] (Maybe a1) -> Type) a2
type (a2 :: Maybe a1) <\|> (a3 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a2 :: Maybe a1) <\|> (a3 :: Maybe a1) = Apply (Apply (TFHelper_6989586621680073042Sym0 :: TyFun (Maybe a1) (Maybe a1 ~> Maybe a1) -> Type) a2) a3
type Mplus (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Mplus (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Mplus_6989586621680012040Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type (a2 :: Maybe a1) <> ('Nothing :: Maybe a1)
Instance details Defined in Fcf.Class.Monoid type (a2 :: Maybe a1) <> ('Nothing :: Maybe a1) = a2
type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621679959420 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621679959420 :: Maybe a) = FromJustSym1 a6989586621679959420
type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959424 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959424 :: Maybe a) = IsNothingSym1 a6989586621679959424
type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959427 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959427 :: Maybe a) = IsJustSym1 a6989586621679959427
type Apply (FromMaybeSym1 a6989586621679959410 :: TyFun (Maybe a) a -> Type) (a6989586621679959411 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym1 a6989586621679959410 :: TyFun (Maybe a) a -> Type) (a6989586621679959411 :: Maybe a) = FromMaybeSym2 a6989586621679959410 a6989586621679959411
type Apply (Compare_6989586621679848468Sym1 a6989586621679848473 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679848474 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679848468Sym1 a6989586621679848473 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679848474 :: Maybe a) = Compare_6989586621679848468Sym2 a6989586621679848473 a6989586621679848474
type Apply (FoldMap_6989586621680823044Sym1 a6989586621680823053 :: TyFun (Maybe a) m -> Type) (a6989586621680823054 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FoldMap_6989586621680823044Sym1 a6989586621680823053 :: TyFun (Maybe a) m -> Type) (a6989586621680823054 :: Maybe a) = FoldMap_6989586621680823044Sym2 a6989586621680823053 a6989586621680823054
type Apply (Maybe_Sym2 a6989586621679957844 a6989586621679957845 :: TyFun (Maybe a) b -> Type) (a6989586621679957846 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym2 a6989586621679957844 a6989586621679957845 :: TyFun (Maybe a) b -> Type) (a6989586621679957846 :: Maybe a) = Maybe_Sym3 a6989586621679957844 a6989586621679957845 a6989586621679957846
type Apply (Foldr_6989586621680823060Sym2 a6989586621680823066 a6989586621680823067 :: TyFun (Maybe a) b -> Type) (a6989586621680823068 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldr_6989586621680823060Sym2 a6989586621680823066 a6989586621680823067 :: TyFun (Maybe a) b -> Type) (a6989586621680823068 :: Maybe a) = Foldr_6989586621680823060Sym3 a6989586621680823066 a6989586621680823067 a6989586621680823068
type Apply (Foldl_6989586621680823076Sym2 a6989586621680823082 a6989586621680823083 :: TyFun (Maybe a) b -> Type) (a6989586621680823084 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldl_6989586621680823076Sym2 a6989586621680823082 a6989586621680823083 :: TyFun (Maybe a) b -> Type) (a6989586621680823084 :: Maybe a) = Foldl_6989586621680823076Sym3 a6989586621680823082 a6989586621680823083 a6989586621680823084
type ('Nothing :: Maybe a) <> (b :: Maybe a)
Instance details Defined in Fcf.Class.Monoid type ('Nothing :: Maybe a) <> (b :: Maybe a) = b
type Apply (Fail_6989586621680156221Sym0 :: TyFun [Char] (Maybe a) -> Type) (a6989586621680156225 :: [Char])
Instance details Defined in Data.Singletons.Prelude.Monad.Fail type Apply (Fail_6989586621680156221Sym0 :: TyFun [Char] (Maybe a) -> Type) (a6989586621680156225 :: [Char]) = Fail_6989586621680156221Sym1 a6989586621680156225 :: Maybe a
type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621679959395 :: [Maybe a])
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621679959395 :: [Maybe a]) = CatMaybesSym1 a6989586621679959395
type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679959401 :: [a])
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679959401 :: [a]) = ListToMaybeSym1 a6989586621679959401
type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679959405 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679959405 :: Maybe a) = MaybeToListSym1 a6989586621679959405
type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (a6989586621680812483 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (a6989586621680812483 :: Maybe a) = MaxInternalSym1 a6989586621680812483
type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (a6989586621680812486 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (a6989586621680812486 :: Maybe a) = MinInternalSym1 a6989586621680812486
type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (a6989586621680249994 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (a6989586621680249994 :: Maybe a) = OptionSym1 a6989586621680249994
type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (a6989586621680694787 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (a6989586621680694787 :: Maybe a) = FirstSym1 a6989586621680694787
type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (a6989586621680694814 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (a6989586621680694814 :: Maybe a) = LastSym1 a6989586621680694814
type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621680249997 :: Option a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621680249997 :: Option a) = GetOptionSym1 a6989586621680249997
type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680694790 :: First a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680694790 :: First a) = GetFirstSym1 a6989586621680694790
type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680694817 :: Last a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680694817 :: Last a) = GetLastSym1 a6989586621680694817
type Apply (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type) (a6989586621680812493 :: MaxInternal a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type) (a6989586621680812493 :: MaxInternal a) = GetMaxInternalSym1 a6989586621680812493
type Apply (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type) (a6989586621680812489 :: MinInternal a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type) (a6989586621680812489 :: MinInternal a) = GetMinInternalSym1 a6989586621680812489
type Apply (FindSym1 a6989586621680379639 :: TyFun [a] (Maybe a) -> Type) (a6989586621680379640 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindSym1 a6989586621680379639 :: TyFun [a] (Maybe a) -> Type) (a6989586621680379640 :: [a]) = FindSym2 a6989586621680379639 a6989586621680379640
type Apply (FindIndexSym1 a6989586621680379612 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680379613 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndexSym1 a6989586621680379612 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680379613 :: [a]) = FindIndexSym2 a6989586621680379612 a6989586621680379613
type Apply (ElemIndexSym1 a6989586621680379630 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680379631 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym1 a6989586621680379630 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680379631 :: [a]) = ElemIndexSym2 a6989586621680379630 a6989586621680379631
type Apply (StripPrefixSym1 a6989586621680498961 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680498962 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym1 a6989586621680498961 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680498962 :: [a]) = StripPrefixSym2 a6989586621680498961 a6989586621680498962
type Apply (TFHelper_6989586621680073042Sym1 a6989586621680073047 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680073048 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680073042Sym1 a6989586621680073047 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680073048 :: Maybe a) = TFHelper_6989586621680073042Sym2 a6989586621680073047 a6989586621680073048
type Apply (TFHelper_6989586621680240791Sym1 a6989586621680240796 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680240797 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (TFHelper_6989586621680240791Sym1 a6989586621680240796 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680240797 :: Maybe a) = TFHelper_6989586621680240791Sym2 a6989586621680240796 a6989586621680240797
type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621681492707 :: f a)
Instance details Defined in Data.Singletons.Prelude.Applicative type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621681492707 :: f a) = OptionalSym1 a6989586621681492707
type Apply (LookupSym1 a6989586621680379337 :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621680379338 :: [(a, b)])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym1 a6989586621680379337 :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621680379338 :: [(a, b)]) = LookupSym2 a6989586621680379337 a6989586621680379338
type Apply (Fmap_6989586621680072661Sym1 a6989586621680072666 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680072667 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621680072661Sym1 a6989586621680072666 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680072667 :: Maybe a) = Fmap_6989586621680072661Sym2 a6989586621680072666 a6989586621680072667
type Apply (TFHelper_6989586621680072673Sym1 a6989586621680072678 :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621680072679 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072673Sym1 a6989586621680072678 :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621680072679 :: Maybe b) = TFHelper_6989586621680072673Sym2 a6989586621680072678 a6989586621680072679
type Apply (TFHelper_6989586621680072794Sym1 a6989586621680072799 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680072800 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072794Sym1 a6989586621680072799 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680072800 :: Maybe a) = TFHelper_6989586621680072794Sym2 a6989586621680072799 a6989586621680072800
type Apply (TFHelper_6989586621680072821Sym1 a6989586621680072826 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680072827 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072821Sym1 a6989586621680072826 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680072827 :: Maybe b) = TFHelper_6989586621680072821Sym2 a6989586621680072826 a6989586621680072827
type Apply (TFHelper_6989586621680072966Sym1 a6989586621680072975 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680072976 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072966Sym1 a6989586621680072975 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680072976 :: Maybe b) = TFHelper_6989586621680072966Sym2 a6989586621680072975 a6989586621680072976
type Apply (FindSym1 a6989586621680822510 :: TyFun (t a) (Maybe a) -> Type) (a6989586621680822511 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym1 a6989586621680822510 :: TyFun (t a) (Maybe a) -> Type) (a6989586621680822511 :: t a) = FindSym2 a6989586621680822510 a6989586621680822511
type Apply (Traverse_6989586621681088263Sym1 a6989586621681088268 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621681088269 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621681088263Sym1 a6989586621681088268 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621681088269 :: Maybe a) = Traverse_6989586621681088263Sym2 a6989586621681088268 a6989586621681088269
type Apply (LiftA2_6989586621680072807Sym2 a6989586621680072813 a6989586621680072814 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621680072815 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621680072807Sym2 a6989586621680072813 a6989586621680072814 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621680072815 :: Maybe b) = LiftA2_6989586621680072807Sym3 a6989586621680072813 a6989586621680072814 a6989586621680072815
type Apply (Let6989586621680822904MfSym3 f6989586621680822902 xs6989586621680822903 a6989586621680822905 :: TyFun (Maybe k3) (Maybe k2) -> Type) (a6989586621680822906 :: Maybe k3)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680822904MfSym3 f6989586621680822902 xs6989586621680822903 a6989586621680822905 :: TyFun (Maybe k3) (Maybe k2) -> Type) (a6989586621680822906 :: Maybe k3) = Let6989586621680822904MfSym4 f6989586621680822902 xs6989586621680822903 a6989586621680822905 a6989586621680822906
type Eval (Init '[a2] :: Maybe [a1] -> Type)
Instance details Defined in Fcf.Data.List type Eval (Init '[a2] :: Maybe [a1] -> Type) = 'Just ('[] :: [a1])
type Eval (Init ('[] :: [a]) :: Maybe [a] -> Type)
Instance details Defined in Fcf.Data.List type Eval (Init ('[] :: [a]) :: Maybe [a] -> Type) = 'Nothing :: Maybe [a]
type Eval (Tail (_a ': as) :: Maybe [a] -> Type)
Instance details Defined in Fcf.Data.List type Eval (Tail (_a ': as) :: Maybe [a] -> Type) = 'Just as
type Eval (Tail ('[] :: [a]) :: Maybe [a] -> Type)
Instance details Defined in Fcf.Data.List type Eval (Tail ('[] :: [a]) :: Maybe [a] -> Type) = 'Nothing :: Maybe [a]
type Eval (Init (a2 ': (b ': as)) :: Maybe [a1] -> Type)
Instance details Defined in Fcf.Data.List type Eval (Init (a2 ': (b ': as)) :: Maybe [a1] -> Type) = Eval ((Map (Cons a2) :: Maybe [a1] -> Maybe [a1] -> Type) =<< Init (b ': as))
type Eval (Head (a2 ': _as) :: Maybe a1 -> Type)
Instance details Defined in Fcf.Data.List type Eval (Head (a2 ': _as) :: Maybe a1 -> Type) = 'Just a2
type Eval (Head ('[] :: [a]) :: Maybe a -> Type)
Instance details Defined in Fcf.Data.List type Eval (Head ('[] :: [a]) :: Maybe a -> Type) = 'Nothing :: Maybe a
type Eval (Last (a2 ': (b ': as)) :: Maybe a1 -> Type)
Instance details Defined in Fcf.Data.List type Eval (Last (a2 ': (b ': as)) :: Maybe a1 -> Type) = Eval (Last (b ': as))
type Eval (Last '[a2] :: Maybe a1 -> Type)
Instance details Defined in Fcf.Data.List type Eval (Last '[a2] :: Maybe a1 -> Type) = 'Just a2
type Eval (Last ('[] :: [a]) :: Maybe a -> Type)
Instance details Defined in Fcf.Data.List type Eval (Last ('[] :: [a]) :: Maybe a -> Type) = 'Nothing :: Maybe a
type Apply (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type) (a6989586621680498961 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type) (a6989586621680498961 :: [a]) = StripPrefixSym1 a6989586621680498961
type Apply (TFHelper_6989586621680073042Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621680073047 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680073042Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621680073047 :: Maybe a) = TFHelper_6989586621680073042Sym1 a6989586621680073047
type Apply (Compare_6989586621679848468Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type) (a6989586621679848473 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679848468Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type) (a6989586621679848473 :: Maybe a) = Compare_6989586621679848468Sym1 a6989586621679848473
type Apply (TFHelper_6989586621680240791Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621680240796 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (TFHelper_6989586621680240791Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621680240796 :: Maybe a) = TFHelper_6989586621680240791Sym1 a6989586621680240796
type ('Just a2 :: Maybe a1) <> ('Just b :: Maybe a1)
Instance details Defined in Fcf.Class.Monoid type ('Just a2 :: Maybe a1) <> ('Just b :: Maybe a1) = 'Just (a2 <> b)
type Apply (ShowsPrec_6989586621680653904Sym1 a6989586621680653914 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type) (a6989586621680653915 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680653904Sym1 a6989586621680653914 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type) (a6989586621680653915 :: Maybe a) = ShowsPrec_6989586621680653904Sym2 a6989586621680653914 a6989586621680653915
type Apply (TFHelper_6989586621680072821Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621680072826 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072821Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621680072826 :: Maybe a) = TFHelper_6989586621680072821Sym1 a6989586621680072826 :: TyFun (Maybe b) (Maybe b) -> Type
type Apply (TFHelper_6989586621680072955Sym0 :: TyFun (Maybe a) ((a ~> Maybe b) ~> Maybe b) -> Type) (a6989586621680072960 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072955Sym0 :: TyFun (Maybe a) ((a ~> Maybe b) ~> Maybe b) -> Type) (a6989586621680072960 :: Maybe a) = TFHelper_6989586621680072955Sym1 a6989586621680072960 :: TyFun (a ~> Maybe b) (Maybe b) -> Type
type Apply (TFHelper_6989586621680072966Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621680072975 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072966Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621680072975 :: Maybe a) = TFHelper_6989586621680072966Sym1 a6989586621680072975 :: TyFun (Maybe b) (Maybe b) -> Type
type Apply (TFHelper_6989586621680072794Sym0 :: TyFun (Maybe (a ~> b)) (Maybe a ~> Maybe b) -> Type) (a6989586621680072799 :: Maybe (a ~> b))
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072794Sym0 :: TyFun (Maybe (a ~> b)) (Maybe a ~> Maybe b) -> Type) (a6989586621680072799 :: Maybe (a ~> b)) = TFHelper_6989586621680072794Sym1 a6989586621680072799
type Apply (LiftA2_6989586621680072807Sym1 a6989586621680072813 :: TyFun (Maybe a) (Maybe b ~> Maybe c) -> Type) (a6989586621680072814 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621680072807Sym1 a6989586621680072813 :: TyFun (Maybe a) (Maybe b ~> Maybe c) -> Type) (a6989586621680072814 :: Maybe a) = LiftA2_6989586621680072807Sym2 a6989586621680072813 a6989586621680072814
type Apply (Let6989586621680822925MfSym2 f6989586621680822923 xs6989586621680822924 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680822926 :: Maybe k2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680822925MfSym2 f6989586621680822923 xs6989586621680822924 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680822926 :: Maybe k2) = Let6989586621680822925MfSym3 f6989586621680822923 xs6989586621680822924 a6989586621680822926
type Eval (FindIndex p (a2 ': as) :: Maybe Nat -> Type)
Instance details Defined in Fcf.Data.List type Eval (FindIndex p (a2 ': as) :: Maybe Nat -> Type) = Eval (If (Eval (p a2)) (Pure ('Just 0)) ((Map ((+) 1) :: Maybe Nat -> Maybe Nat -> Type) =<< FindIndex p as))
type Eval (FindIndex _p ('[] :: [a]) :: Maybe Nat -> Type)
Instance details Defined in Fcf.Data.List type Eval (FindIndex _p ('[] :: [a]) :: Maybe Nat -> Type) = 'Nothing :: Maybe Nat
type Eval (NumIter a s :: Maybe (k, Nat) -> Type)
Instance details Defined in Fcf.Data.List type Eval (NumIter a s :: Maybe (k, Nat) -> Type) = If (Eval (s > 0)) ('Just '(a, s - 1)) ('Nothing :: Maybe (k, Nat))
type Eval (Find p (a2 ': as) :: Maybe a1 -> Type)
Instance details Defined in Fcf.Data.List type Eval (Find p (a2 ': as) :: Maybe a1 -> Type) = Eval (If (Eval (p a2)) (Pure ('Just a2)) (Find p as))
type Eval (Find _p ('[] :: [a]) :: Maybe a -> Type)
Instance details Defined in Fcf.Data.List type Eval (Find _p ('[] :: [a]) :: Maybe a -> Type) = 'Nothing :: Maybe a
type Eval (Lookup a as :: Maybe b -> Type)
Instance details Defined in Fcf.Data.List type Eval (Lookup a as :: Maybe b -> Type) = Eval (Map (Snd :: (k, b) -> b -> Type) (Eval (Find ((TyEq a :: k -> Bool -> Type) <=< (Fst :: (k, b) -> k -> Type)) as)))
type Eval (Map f ('Just a3) :: Maybe a2 -> Type)
Instance details Defined in Fcf.Class.Functor type Eval (Map f ('Just a3) :: Maybe a2 -> Type) = 'Just (Eval (f a3))
type Eval (Map f ('Nothing :: Maybe a) :: Maybe b -> Type)
Instance details Defined in Fcf.Class.Functor type Eval (Map f ('Nothing :: Maybe a) :: Maybe b -> Type) = 'Nothing :: Maybe b
type Eval ('Just x <\|> _1 :: Maybe a -> Type)
Instance details Defined in Morley.Util.Fcf type Eval ('Just x <\|> _1 :: Maybe a -> Type) = 'Just x
type Eval (('Nothing :: Maybe a) <\|> m :: Maybe a -> Type)
Instance details Defined in Morley.Util.Fcf type Eval (('Nothing :: Maybe a) <\|> m :: Maybe a -> Type) = m
type Apply (TFHelper_6989586621680072955Sym1 a6989586621680072960 :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621680072961 :: a ~> Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680072955Sym1 a6989586621680072960 :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621680072961 :: a ~> Maybe b) = TFHelper_6989586621680072955Sym2 a6989586621680072960 a6989586621680072961
type Apply (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) (a6989586621680379639 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) (a6989586621680379639 :: a ~> Bool) = FindSym1 a6989586621680379639
type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) (a6989586621680379612 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) (a6989586621680379612 :: a ~> Bool) = FindIndexSym1 a6989586621680379612
type Apply (Fmap_6989586621680072661Sym0 :: TyFun (a ~> b) (Maybe a ~> Maybe b) -> Type) (a6989586621680072666 :: a ~> b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621680072661Sym0 :: TyFun (a ~> b) (Maybe a ~> Maybe b) -> Type) (a6989586621680072666 :: a ~> b) = Fmap_6989586621680072661Sym1 a6989586621680072666
type Apply (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) (a6989586621679959380 :: a ~> Maybe b)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) (a6989586621679959380 :: a ~> Maybe b) = MapMaybeSym1 a6989586621679959380
type Apply (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) (a6989586621680380029 :: b ~> Maybe (a, b))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) (a6989586621680380029 :: b ~> Maybe (a, b)) = UnfoldrSym1 a6989586621680380029
type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680822510 :: a ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680822510 :: a ~> Bool) = FindSym1 a6989586621680822510 :: TyFun (t a) (Maybe a) -> Type
type Apply (FoldMap_6989586621680823044Sym0 :: TyFun (a ~> m) (Maybe a ~> m) -> Type) (a6989586621680823053 :: a ~> m)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FoldMap_6989586621680823044Sym0 :: TyFun (a ~> m) (Maybe a ~> m) -> Type) (a6989586621680823053 :: a ~> m) = FoldMap_6989586621680823044Sym1 a6989586621680823053
type Apply (Foldr_6989586621680823060Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680823066 :: a ~> (b ~> b))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldr_6989586621680823060Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680823066 :: a ~> (b ~> b)) = Foldr_6989586621680823060Sym1 a6989586621680823066
type Apply (Foldl_6989586621680823076Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680823082 :: b ~> (a ~> b))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldl_6989586621680823076Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680823082 :: b ~> (a ~> b)) = Foldl_6989586621680823076Sym1 a6989586621680823082
type Apply (Traverse_6989586621681088263Sym0 :: TyFun (a ~> f b) (Maybe a ~> f (Maybe b)) -> Type) (a6989586621681088268 :: a ~> f b)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621681088263Sym0 :: TyFun (a ~> f b) (Maybe a ~> f (Maybe b)) -> Type) (a6989586621681088268 :: a ~> f b) = Traverse_6989586621681088263Sym1 a6989586621681088268
type Apply (LiftA2_6989586621680072807Sym0 :: TyFun (a ~> (b ~> c)) (Maybe a ~> (Maybe b ~> Maybe c)) -> Type) (a6989586621680072813 :: a ~> (b ~> c))
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621680072807Sym0 :: TyFun (a ~> (b ~> c)) (Maybe a ~> (Maybe b ~> Maybe c)) -> Type) (a6989586621680072813 :: a ~> (b ~> c)) = LiftA2_6989586621680072807Sym1 a6989586621680072813
type Apply (Maybe_Sym1 a6989586621679957844 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) (a6989586621679957845 :: a ~> b)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym1 a6989586621679957844 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) (a6989586621679957845 :: a ~> b) = Maybe_Sym2 a6989586621679957844 a6989586621679957845
type Apply (Let6989586621679959385RsSym0 :: TyFun (a ~> Maybe k1) (TyFun k (TyFun [a] [k1] -> Type) -> Type) -> Type) (f6989586621679959382 :: a ~> Maybe k1)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Let6989586621679959385RsSym0 :: TyFun (a ~> Maybe k1) (TyFun k (TyFun [a] [k1] -> Type) -> Type) -> Type) (f6989586621679959382 :: a ~> Maybe k1) = Let6989586621679959385RsSym1 f6989586621679959382 :: TyFun k (TyFun [a] [k1] -> Type) -> Type
type Apply (Let6989586621680822904MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680822902 :: k2 ~> (k3 ~> k2))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680822904MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680822902 :: k2 ~> (k3 ~> k2)) = Let6989586621680822904MfSym1 f6989586621680822902 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type
type Apply (Let6989586621680822925MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680822923 :: k2 ~> (k3 ~> k3))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680822925MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680822923 :: k2 ~> (k3 ~> k3)) = Let6989586621680822925MfSym1 f6989586621680822923 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type
type Apply (Lambda_6989586621680701013Sym1 a6989586621680701011 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680701012 :: k1 ~> First a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680701013Sym1 a6989586621680701011 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680701012 :: k1 ~> First a) = Lambda_6989586621680701013Sym2 a6989586621680701011 k6989586621680701012
type Apply (Lambda_6989586621680701092Sym1 a6989586621680701090 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680701091 :: k1 ~> Last a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680701092Sym1 a6989586621680701090 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680701091 :: k1 ~> Last a) = Lambda_6989586621680701092Sym2 a6989586621680701090 k6989586621680701091
type ToT (NamedF Maybe a name)
Instance details Defined in Morley.Michelson.Typed.Haskell.Value type ToT (NamedF Maybe a name) = ToT (Maybe a)
type AsRPC (NamedF Maybe a name)
Instance details Defined in Morley.AsRPC type AsRPC (NamedF Maybe a name) = NamedF Maybe (AsRPC a) name
type Unwrappabled (NamedF Maybe a name) Source #
Instance details Defined in Lorentz.Wrappable type Unwrappabled (NamedF Maybe a name) = Maybe a

data Proxy (t :: k) #

Proxy is a type that holds no data, but has a phantom parameter of arbitrary type (or even kind). Its use is to provide type information, even though there is no value available of that type (or it may be too costly to create one).

Historically, Proxy :: Proxy a is a safer alternative to the undefined :: a idiom.

>>> Proxy :: Proxy (Void, Int -> Int)
Proxy

Proxy can even hold types of higher kinds,

>>> Proxy :: Proxy Either
Proxy

>>> Proxy :: Proxy Functor
Proxy

>>> Proxy :: Proxy complicatedStructure
Proxy

Constructors

Proxy

Instances

Instances details

Generic1 (Proxy :: k -> Type)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep1 Proxy :: k -> Type # Methods from1 :: forall (a :: k0). Proxy a -> Rep1 Proxy a # to1 :: forall (a :: k0). Rep1 Proxy a -> Proxy a #
Monad (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods (>>=) :: Proxy a -> (a -> Proxy b) -> Proxy b # (>>) :: Proxy a -> Proxy b -> Proxy b # return :: a -> Proxy a #
Functor (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods fmap :: (a -> b) -> Proxy a -> Proxy b # (<$) :: a -> Proxy b -> Proxy a #
Applicative (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods pure :: a -> Proxy a # (<>) :: Proxy (a -> b) -> Proxy a -> Proxy b # liftA2 :: (a -> b -> c) -> Proxy a -> Proxy b -> Proxy c # (>) :: Proxy a -> Proxy b -> Proxy b # (<*) :: Proxy a -> Proxy b -> Proxy a #
Foldable (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Foldable Methods fold :: Monoid m => Proxy m -> m # foldMap :: Monoid m => (a -> m) -> Proxy a -> m # foldMap' :: Monoid m => (a -> m) -> Proxy a -> m # foldr :: (a -> b -> b) -> b -> Proxy a -> b # foldr' :: (a -> b -> b) -> b -> Proxy a -> b # foldl :: (b -> a -> b) -> b -> Proxy a -> b # foldl' :: (b -> a -> b) -> b -> Proxy a -> b # foldr1 :: (a -> a -> a) -> Proxy a -> a # foldl1 :: (a -> a -> a) -> Proxy a -> a # toList :: Proxy a -> [a] # null :: Proxy a -> Bool # length :: Proxy a -> Int # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # sum :: Num a => Proxy a -> a # product :: Num a => Proxy a -> a #
Traversable (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Proxy a -> f (Proxy b) # sequenceA :: Applicative f => Proxy (f a) -> f (Proxy a) # mapM :: Monad m => (a -> m b) -> Proxy a -> m (Proxy b) # sequence :: Monad m => Proxy (m a) -> m (Proxy a) #
MonadPlus (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods mzero :: Proxy a # mplus :: Proxy a -> Proxy a -> Proxy a #
Alternative (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods empty :: Proxy a # (<\|>) :: Proxy a -> Proxy a -> Proxy a # some :: Proxy a -> Proxy [a] # many :: Proxy a -> Proxy [a] #
Representable (Proxy :: Type -> Type)
Instance details Defined in Data.Functor.Rep Associated Types type Rep Proxy # Methods tabulate :: (Rep Proxy -> a) -> Proxy a # index :: Proxy a -> Rep Proxy -> a #
ToJSON1 (Proxy :: Type -> Type)
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Proxy a -> Value # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Proxy a] -> Value # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Proxy a -> Encoding # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Proxy a] -> Encoding #
Eq1 (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftEq :: (a -> b -> Bool) -> Proxy a -> Proxy b -> Bool #
Ord1 (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftCompare :: (a -> b -> Ordering) -> Proxy a -> Proxy b -> Ordering #
Read1 (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Proxy a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Proxy a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Proxy a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Proxy a] #
Show1 (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Proxy a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Proxy a] -> ShowS #
NFData1 (Proxy :: Type -> Type)	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> Proxy a -> () #
Hashable1 (Proxy :: Type -> Type)
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> Proxy a -> Int #
PTraversable (Proxy :: Type -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg1 :: f (t b) # type SequenceA arg :: f (t a) # type MapM arg arg1 :: m (t b) # type Sequence arg :: m (t a) #
STraversable (Proxy :: Type -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Proxy a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: forall (f :: Type -> Type) a (t1 :: Proxy (f a)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Proxy a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: forall (m :: Type -> Type) a (t1 :: Proxy (m a)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) #
PFoldable (Proxy :: Type -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg :: m # type FoldMap arg arg1 :: m # type Foldr arg arg1 arg2 :: b # type Foldr' arg arg1 arg2 :: b # type Foldl arg arg1 arg2 :: b # type Foldl' arg arg1 arg2 :: b # type Foldr1 arg arg1 :: a # type Foldl1 arg arg1 :: a # type ToList arg :: [a] # type Null arg :: Bool # type Length arg :: Nat # type Elem arg arg1 :: Bool # type Maximum arg :: a # type Minimum arg :: a # type Sum arg :: a # type Product arg :: a #
SFoldable (Proxy :: Type -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t1 :: Proxy m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Proxy a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Proxy a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Proxy a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Proxy a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Proxy a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Proxy a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Proxy a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: forall a (t1 :: Proxy a). Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: forall a (t1 :: Proxy a). Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: forall a (t1 :: Proxy a). Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: forall a (t1 :: a) (t2 :: Proxy a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t1 :: Proxy a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: forall a (t1 :: Proxy a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: forall a (t1 :: Proxy a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: forall a (t1 :: Proxy a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) #
Bounded (Proxy t)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods minBound :: Proxy t # maxBound :: Proxy t #
Enum (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods succ :: Proxy s -> Proxy s # pred :: Proxy s -> Proxy s # toEnum :: Int -> Proxy s # fromEnum :: Proxy s -> Int # enumFrom :: Proxy s -> [Proxy s] # enumFromThen :: Proxy s -> Proxy s -> [Proxy s] # enumFromTo :: Proxy s -> Proxy s -> [Proxy s] # enumFromThenTo :: Proxy s -> Proxy s -> Proxy s -> [Proxy s] #
Eq (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods (==) :: Proxy s -> Proxy s -> Bool # (/=) :: Proxy s -> Proxy s -> Bool #
Data t => Data (Proxy t)	Since: base-4.7.0.0
Instance details Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Proxy t -> c (Proxy t) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Proxy t) # toConstr :: Proxy t -> Constr # dataTypeOf :: Proxy t -> DataType # dataCast1 :: Typeable t0 => (forall d. Data d => c (t0 d)) -> Maybe (c (Proxy t)) # dataCast2 :: Typeable t0 => (forall d e. (Data d, Data e) => c (t0 d e)) -> Maybe (c (Proxy t)) # gmapT :: (forall b. Data b => b -> b) -> Proxy t -> Proxy t # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Proxy t -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Proxy t -> r # gmapQ :: (forall d. Data d => d -> u) -> Proxy t -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Proxy t -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) #
Ord (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods compare :: Proxy s -> Proxy s -> Ordering # (<) :: Proxy s -> Proxy s -> Bool # (<=) :: Proxy s -> Proxy s -> Bool # (>) :: Proxy s -> Proxy s -> Bool # (>=) :: Proxy s -> Proxy s -> Bool # max :: Proxy s -> Proxy s -> Proxy s # min :: Proxy s -> Proxy s -> Proxy s #
Read (Proxy t)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods readsPrec :: Int -> ReadS (Proxy t) # readList :: ReadS [Proxy t] # readPrec :: ReadPrec (Proxy t) # readListPrec :: ReadPrec [Proxy t] #
Show (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods showsPrec :: Int -> Proxy s -> ShowS # show :: Proxy s -> String # showList :: [Proxy s] -> ShowS #
Ix (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods range :: (Proxy s, Proxy s) -> [Proxy s] # index :: (Proxy s, Proxy s) -> Proxy s -> Int # unsafeIndex :: (Proxy s, Proxy s) -> Proxy s -> Int # inRange :: (Proxy s, Proxy s) -> Proxy s -> Bool # rangeSize :: (Proxy s, Proxy s) -> Int # unsafeRangeSize :: (Proxy s, Proxy s) -> Int #
Generic (Proxy t)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (Proxy t) :: Type -> Type # Methods from :: Proxy t -> Rep (Proxy t) x # to :: Rep (Proxy t) x -> Proxy t #
Semigroup (Proxy s)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods (<>) :: Proxy s -> Proxy s -> Proxy s # sconcat :: NonEmpty (Proxy s) -> Proxy s # stimes :: Integral b => b -> Proxy s -> Proxy s #
Monoid (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods mempty :: Proxy s # mappend :: Proxy s -> Proxy s -> Proxy s # mconcat :: [Proxy s] -> Proxy s #
NFData (Proxy a)	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Proxy a -> () #
Hashable (Proxy a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Proxy a -> Int # hash :: Proxy a -> Int #
ToJSON (Proxy a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Proxy a -> Value # toEncoding :: Proxy a -> Encoding # toJSONList :: [Proxy a] -> Value # toEncodingList :: [Proxy a] -> Encoding #
Semiring (Proxy a)
Instance details Defined in Data.Semiring Methods plus :: Proxy a -> Proxy a -> Proxy a # zero :: Proxy a # times :: Proxy a -> Proxy a -> Proxy a # one :: Proxy a # fromNatural :: Natural -> Proxy a #
SuppressUnusedWarnings (Elem_6989586621680823467Sym0 :: TyFun a (Proxy a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Pure_6989586621680787290Sym0 :: TyFun a (Proxy a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Sum_6989586621680823475Sym0 :: TyFun (Proxy a) a -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Product_6989586621680823481Sym0 :: TyFun (Proxy a) a -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fold_6989586621680823404Sym0 :: TyFun (Proxy m) m -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr1_6989586621680823446Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl1_6989586621680823437Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
TestCoercion (SProxy :: Proxy t -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods testCoercion :: forall (a :: k) (b :: k). SProxy a -> SProxy b -> Maybe (Coercion a b) #
TestEquality (SProxy :: Proxy t -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods testEquality :: forall (a :: k) (b :: k). SProxy a -> SProxy b -> Maybe (a :~: b) #
SuppressUnusedWarnings (Mconcat_6989586621680787275Sym0 :: TyFun [Proxy s] (Proxy s) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ToEnum_6989586621680787224Sym0 :: TyFun Nat (Proxy s) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680787193Sym0 :: TyFun Nat (Proxy s ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Sconcat_6989586621680787266Sym0 :: TyFun (NonEmpty (Proxy s)) (Proxy s) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Sequence_6989586621681088348Sym0 :: TyFun (Proxy (m a)) (m (Proxy a)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (SequenceA_6989586621681088333Sym0 :: TyFun (Proxy (f a)) (f (Proxy a)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr1_6989586621680823446Sym1 a6989586621680823451 :: TyFun (Proxy a) a -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl1_6989586621680823437Sym1 a6989586621680823442 :: TyFun (Proxy a) a -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680787297Sym0 :: TyFun (Proxy (a ~> b)) (Proxy a ~> Proxy b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680823467Sym1 a6989586621680823472 :: TyFun (Proxy a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680823460Sym0 :: TyFun (Proxy a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Length_6989586621680823454Sym0 :: TyFun (Proxy a) Nat -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680787309Sym0 :: TyFun (Proxy a) (Proxy a ~> Proxy a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680787258Sym0 :: TyFun (Proxy s) (Proxy s ~> Proxy s) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680787174Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Succ_6989586621680787206Sym0 :: TyFun (Proxy s) (Proxy s) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Pred_6989586621680787212Sym0 :: TyFun (Proxy s) (Proxy s) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromEnum_6989586621680787218Sym0 :: TyFun (Proxy s) Nat -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromTo_6989586621680787249Sym0 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromThenTo_6989586621680787238Sym0 :: TyFun (Proxy s) (Proxy s ~> (Proxy s ~> [Proxy s])) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680787183Sym0 :: TyFun (Proxy s) (Proxy s ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680823412Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Proxy a ~> b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl_6989586621680823425Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Proxy a ~> b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FoldMap_6989586621680823396Sym0 :: TyFun (a ~> m) (Proxy a ~> m) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621680787282Sym0 :: TyFun (a ~> b) (Proxy a ~> Proxy b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680823412Sym1 a6989586621680823418 :: TyFun b (Proxy a ~> b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl_6989586621680823425Sym1 a6989586621680823431 :: TyFun b (Proxy a ~> b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FoldMap_6989586621680823396Sym1 a6989586621680823401 :: TyFun (Proxy a) m -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680787318Sym0 :: TyFun (Proxy a) ((a ~> Proxy b) ~> Proxy b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680787297Sym1 a6989586621680787302 :: TyFun (Proxy a) (Proxy b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621680787282Sym1 a6989586621680787287 :: TyFun (Proxy a) (Proxy b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680787309Sym1 a6989586621680787314 :: TyFun (Proxy a) (Proxy a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680787258Sym1 a6989586621680787263 :: TyFun (Proxy s) (Proxy s) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680787174Sym1 a6989586621680787179 :: TyFun (Proxy s) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680787193Sym1 a6989586621680787201 :: TyFun (Proxy s) (Symbol ~> Symbol) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromTo_6989586621680787249Sym1 a6989586621680787254 :: TyFun (Proxy s) [Proxy s] -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromThenTo_6989586621680787238Sym1 a6989586621680787244 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680787183Sym1 a6989586621680787188 :: TyFun (Proxy s) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Traverse_6989586621681088325Sym0 :: TyFun (a ~> f b) (Proxy a ~> f (Proxy b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MapM_6989586621681088340Sym0 :: TyFun (a ~> m b) (Proxy a ~> m (Proxy b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Traverse_6989586621681088325Sym1 a6989586621681088330 :: TyFun (Proxy a) (f (Proxy b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MapM_6989586621681088340Sym1 a6989586621681088345 :: TyFun (Proxy a) (m (Proxy b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680823412Sym2 a6989586621680823418 a6989586621680823419 :: TyFun (Proxy a) b -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl_6989586621680823425Sym2 a6989586621680823431 a6989586621680823432 :: TyFun (Proxy a) b -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromThenTo_6989586621680787238Sym2 a6989586621680787244 a6989586621680787245 :: TyFun (Proxy s) [Proxy s] -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680787318Sym1 a6989586621680787323 :: TyFun (a ~> Proxy b) (Proxy b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () #
type MapM (a2 :: a1 ~> m b) (a3 :: Proxy a1)
Instance details Defined in Data.Singletons.Prelude.Traversable type MapM (a2 :: a1 ~> m b) (a3 :: Proxy a1) = Apply (Apply (MapM_6989586621681088340Sym0 :: TyFun (a1 ~> m b) (Proxy a1 ~> m (Proxy b)) -> Type) a2) a3
type Traverse (a2 :: a1 ~> f b) (a3 :: Proxy a1)
Instance details Defined in Data.Singletons.Prelude.Traversable type Traverse (a2 :: a1 ~> f b) (a3 :: Proxy a1) = Apply (Apply (Traverse_6989586621681088325Sym0 :: TyFun (a1 ~> f b) (Proxy a1 ~> f (Proxy b)) -> Type) a2) a3
type LiftA2 (arg1 :: a ~> (b ~> c)) (arg2 :: Proxy a) (arg3 :: Proxy b)
Instance details Defined in Data.Singletons.Prelude.Proxy type LiftA2 (arg1 :: a ~> (b ~> c)) (arg2 :: Proxy a) (arg3 :: Proxy b) = Apply (Apply (Apply (LiftA2_6989586621680011943Sym0 :: TyFun (a ~> (b ~> c)) (Proxy a ~> (Proxy b ~> Proxy c)) -> Type) arg1) arg2) arg3
type FoldMap (a2 :: a1 ~> k2) (a3 :: Proxy a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type FoldMap (a2 :: a1 ~> k2) (a3 :: Proxy a1) = Apply (Apply (FoldMap_6989586621680823396Sym0 :: TyFun (a1 ~> k2) (Proxy a1 ~> k2) -> Type) a2) a3
type Fmap (a2 :: a1 ~> b) (a3 :: Proxy a1)
Instance details Defined in Data.Singletons.Prelude.Proxy type Fmap (a2 :: a1 ~> b) (a3 :: Proxy a1) = Apply (Apply (Fmap_6989586621680787282Sym0 :: TyFun (a1 ~> b) (Proxy a1 ~> Proxy b) -> Type) a2) a3
type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Proxy a) = Apply (Apply (Apply (Foldl'_6989586621680822873Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Proxy a ~> b)) -> Type) arg1) arg2) arg3
type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Proxy a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Proxy a1) = Apply (Apply (Apply (Foldl_6989586621680823425Sym0 :: TyFun (k2 ~> (a1 ~> k2)) (k2 ~> (Proxy a1 ~> k2)) -> Type) a2) a3) a4
type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Proxy a) = Apply (Apply (Apply (Foldr'_6989586621680822835Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Proxy a ~> b)) -> Type) arg1) arg2) arg3
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Proxy a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Proxy a1) = Apply (Apply (Apply (Foldr_6989586621680823412Sym0 :: TyFun (a1 ~> (k2 ~> k2)) (k2 ~> (Proxy a1 ~> k2)) -> Type) a2) a3) a4
type Rep1 (Proxy :: k -> Type)
Instance details Defined in GHC.Generics type Rep1 (Proxy :: k -> Type) = D1 ('MetaData "Proxy" "Data.Proxy" "base" 'False) (C1 ('MetaCons "Proxy" 'PrefixI 'False) (U1 :: k -> Type))
type Pure (a :: k1)
Instance details Defined in Data.Singletons.Prelude.Proxy type Pure (a :: k1) = Apply (Pure_6989586621680787290Sym0 :: TyFun k1 (Proxy k1) -> Type) a
type Return (arg :: a)
Instance details Defined in Data.Singletons.Prelude.Proxy type Return (arg :: a) = Apply (Return_6989586621680012015Sym0 :: TyFun a (Proxy a) -> Type) arg
type Empty
Instance details Defined in Data.Singletons.Prelude.Proxy type Empty = Empty_6989586621680787304Sym0 :: Proxy a
type Mzero
Instance details Defined in Data.Singletons.Prelude.Proxy type Mzero = Mzero_6989586621680012035Sym0 :: Proxy a
type Elem (a1 :: k1) (a2 :: Proxy k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Elem (a1 :: k1) (a2 :: Proxy k1) = Apply (Apply (Elem_6989586621680823467Sym0 :: TyFun k1 (Proxy k1 ~> Bool) -> Type) a1) a2
type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Proxy k2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Proxy k2) = Apply (Apply (Foldl1_6989586621680823437Sym0 :: TyFun (k2 ~> (k2 ~> k2)) (Proxy k2 ~> k2) -> Type) a1) a2
type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Proxy k2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Proxy k2) = Apply (Apply (Foldr1_6989586621680823446Sym0 :: TyFun (k2 ~> (k2 ~> k2)) (Proxy k2 ~> k2) -> Type) a1) a2
type (arg1 :: a) <$ (arg2 :: Proxy b)
Instance details Defined in Data.Singletons.Prelude.Proxy type (arg1 :: a) <$ (arg2 :: Proxy b) = Apply (Apply (TFHelper_6989586621680011887Sym0 :: TyFun a (Proxy b ~> Proxy a) -> Type) arg1) arg2
type (a2 :: Proxy a1) <\|> (a3 :: Proxy a1)
Instance details Defined in Data.Singletons.Prelude.Proxy type (a2 :: Proxy a1) <\|> (a3 :: Proxy a1) = Apply (Apply (TFHelper_6989586621680787309Sym0 :: TyFun (Proxy a1) (Proxy a1 ~> Proxy a1) -> Type) a2) a3
type Mplus (arg1 :: Proxy a) (arg2 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Proxy type Mplus (arg1 :: Proxy a) (arg2 :: Proxy a) = Apply (Apply (Mplus_6989586621680012040Sym0 :: TyFun (Proxy a) (Proxy a ~> Proxy a) -> Type) arg1) arg2
type Apply (Elem_6989586621680823467Sym0 :: TyFun a (Proxy a ~> Bool) -> Type) (a6989586621680823472 :: a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680823467Sym0 :: TyFun a (Proxy a ~> Bool) -> Type) (a6989586621680823472 :: a) = Elem_6989586621680823467Sym1 a6989586621680823472
type Apply (Pure_6989586621680787290Sym0 :: TyFun a (Proxy a) -> Type) (a6989586621680787294 :: a)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (Pure_6989586621680787290Sym0 :: TyFun a (Proxy a) -> Type) (a6989586621680787294 :: a) = Pure_6989586621680787290Sym1 a6989586621680787294
type Apply (ToEnum_6989586621680787224Sym0 :: TyFun Nat (Proxy s) -> Type) (a6989586621680787228 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (ToEnum_6989586621680787224Sym0 :: TyFun Nat (Proxy s) -> Type) (a6989586621680787228 :: Nat) = ToEnum_6989586621680787224Sym1 a6989586621680787228 :: Proxy s
type Apply (ShowsPrec_6989586621680787193Sym0 :: TyFun Nat (Proxy s ~> (Symbol ~> Symbol)) -> Type) (a6989586621680787201 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (ShowsPrec_6989586621680787193Sym0 :: TyFun Nat (Proxy s ~> (Symbol ~> Symbol)) -> Type) (a6989586621680787201 :: Nat) = ShowsPrec_6989586621680787193Sym1 a6989586621680787201 :: TyFun (Proxy s) (Symbol ~> Symbol) -> Type
type Apply (Foldr_6989586621680823412Sym1 a6989586621680823418 :: TyFun b (Proxy a ~> b) -> Type) (a6989586621680823419 :: b)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldr_6989586621680823412Sym1 a6989586621680823418 :: TyFun b (Proxy a ~> b) -> Type) (a6989586621680823419 :: b) = Foldr_6989586621680823412Sym2 a6989586621680823418 a6989586621680823419
type Apply (Foldl_6989586621680823425Sym1 a6989586621680823431 :: TyFun b (Proxy a ~> b) -> Type) (a6989586621680823432 :: b)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldl_6989586621680823425Sym1 a6989586621680823431 :: TyFun b (Proxy a ~> b) -> Type) (a6989586621680823432 :: b) = Foldl_6989586621680823425Sym2 a6989586621680823431 a6989586621680823432
type Rep (Proxy :: Type -> Type)
Instance details Defined in Data.Functor.Rep type Rep (Proxy :: Type -> Type) = Void
type Product (a :: Proxy k2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Product (a :: Proxy k2) = Apply (Product_6989586621680823481Sym0 :: TyFun (Proxy k2) k2 -> Type) a
type Sum (a :: Proxy k2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Sum (a :: Proxy k2) = Apply (Sum_6989586621680823475Sym0 :: TyFun (Proxy k2) k2 -> Type) a
type Minimum (arg :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Minimum (arg :: Proxy a) = Apply (Minimum_6989586621680823010Sym0 :: TyFun (Proxy a) a -> Type) arg
type Maximum (arg :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Maximum (arg :: Proxy a) = Apply (Maximum_6989586621680822995Sym0 :: TyFun (Proxy a) a -> Type) arg
type Length (a2 :: Proxy a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Length (a2 :: Proxy a1) = Apply (Length_6989586621680823454Sym0 :: TyFun (Proxy a1) Nat -> Type) a2
type Null (a2 :: Proxy a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Null (a2 :: Proxy a1) = Apply (Null_6989586621680823460Sym0 :: TyFun (Proxy a1) Bool -> Type) a2
type ToList (arg :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Foldable type ToList (arg :: Proxy a) = Apply (ToList_6989586621680822936Sym0 :: TyFun (Proxy a) [a] -> Type) arg
type Fold (a :: Proxy k2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Fold (a :: Proxy k2) = Apply (Fold_6989586621680823404Sym0 :: TyFun (Proxy k2) k2 -> Type) a
type Sequence (a2 :: Proxy (m a1))
Instance details Defined in Data.Singletons.Prelude.Traversable type Sequence (a2 :: Proxy (m a1)) = Apply (Sequence_6989586621681088348Sym0 :: TyFun (Proxy (m a1)) (m (Proxy a1)) -> Type) a2
type SequenceA (a2 :: Proxy (f a1))
Instance details Defined in Data.Singletons.Prelude.Traversable type SequenceA (a2 :: Proxy (f a1)) = Apply (SequenceA_6989586621681088333Sym0 :: TyFun (Proxy (f a1)) (f (Proxy a1)) -> Type) a2
type (arg1 :: Proxy a) <* (arg2 :: Proxy b)
Instance details Defined in Data.Singletons.Prelude.Proxy type (arg1 :: Proxy a) <* (arg2 :: Proxy b) = Apply (Apply (TFHelper_6989586621680011970Sym0 :: TyFun (Proxy a) (Proxy b ~> Proxy a) -> Type) arg1) arg2
type (arg1 :: Proxy a) *> (arg2 :: Proxy b)
Instance details Defined in Data.Singletons.Prelude.Proxy type (arg1 :: Proxy a) *> (arg2 :: Proxy b) = Apply (Apply (TFHelper_6989586621680011959Sym0 :: TyFun (Proxy a) (Proxy b ~> Proxy b) -> Type) arg1) arg2
type (a2 :: Proxy (a1 ~> b)) <*> (a3 :: Proxy a1)
Instance details Defined in Data.Singletons.Prelude.Proxy type (a2 :: Proxy (a1 ~> b)) <*> (a3 :: Proxy a1) = Apply (Apply (TFHelper_6989586621680787297Sym0 :: TyFun (Proxy (a1 ~> b)) (Proxy a1 ~> Proxy b) -> Type) a2) a3
type (arg1 :: Proxy a) >> (arg2 :: Proxy b)
Instance details Defined in Data.Singletons.Prelude.Proxy type (arg1 :: Proxy a) >> (arg2 :: Proxy b) = Apply (Apply (TFHelper_6989586621680011998Sym0 :: TyFun (Proxy a) (Proxy b ~> Proxy b) -> Type) arg1) arg2
type (a2 :: Proxy a1) >>= (a3 :: a1 ~> Proxy b)
Instance details Defined in Data.Singletons.Prelude.Proxy type (a2 :: Proxy a1) >>= (a3 :: a1 ~> Proxy b) = Apply (Apply (TFHelper_6989586621680787318Sym0 :: TyFun (Proxy a1) ((a1 ~> Proxy b) ~> Proxy b) -> Type) a2) a3
type Apply (Mconcat_6989586621680787275Sym0 :: TyFun [Proxy s] (Proxy s) -> Type) (a6989586621680787279 :: [Proxy s])
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (Mconcat_6989586621680787275Sym0 :: TyFun [Proxy s] (Proxy s) -> Type) (a6989586621680787279 :: [Proxy s]) = Mconcat_6989586621680787275Sym1 a6989586621680787279
type Apply (Sconcat_6989586621680787266Sym0 :: TyFun (NonEmpty (Proxy s)) (Proxy s) -> Type) (a6989586621680787270 :: NonEmpty (Proxy s))
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (Sconcat_6989586621680787266Sym0 :: TyFun (NonEmpty (Proxy s)) (Proxy s) -> Type) (a6989586621680787270 :: NonEmpty (Proxy s)) = Sconcat_6989586621680787266Sym1 a6989586621680787270
type Rep (Proxy t)
Instance details Defined in GHC.Generics type Rep (Proxy t) = D1 ('MetaData "Proxy" "Data.Proxy" "base" 'False) (C1 ('MetaCons "Proxy" 'PrefixI 'False) (U1 :: Type -> Type))
type Mempty
Instance details Defined in Data.Singletons.Prelude.Proxy type Mempty = Mempty_6989586621680787271Sym0 :: Proxy s
type MaxBound
Instance details Defined in Data.Singletons.Prelude.Proxy type MaxBound = MaxBound_6989586621680787169Sym0 :: Proxy s
type MinBound
Instance details Defined in Data.Singletons.Prelude.Proxy type MinBound = MinBound_6989586621680787166Sym0 :: Proxy s
type Sing
Instance details Defined in Data.Singletons.Prelude.Proxy type Sing = SProxy :: Proxy t -> Type
type Demote (Proxy t)
Instance details Defined in Data.Singletons.Prelude.Proxy type Demote (Proxy t) = Proxy t
type Mconcat (a :: [Proxy s])
Instance details Defined in Data.Singletons.Prelude.Proxy type Mconcat (a :: [Proxy s]) = Apply (Mconcat_6989586621680787275Sym0 :: TyFun [Proxy s] (Proxy s) -> Type) a
type Show_ (arg :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Show_ (arg :: Proxy s) = Apply (Show__6989586621680636746Sym0 :: TyFun (Proxy s) Symbol -> Type) arg
type Sconcat (a :: NonEmpty (Proxy s))
Instance details Defined in Data.Singletons.Prelude.Proxy type Sconcat (a :: NonEmpty (Proxy s)) = Apply (Sconcat_6989586621680787266Sym0 :: TyFun (NonEmpty (Proxy s)) (Proxy s) -> Type) a
type FromEnum (a :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type FromEnum (a :: Proxy s) = Apply (FromEnum_6989586621680787218Sym0 :: TyFun (Proxy s) Nat -> Type) a
type ToEnum a
Instance details Defined in Data.Singletons.Prelude.Proxy type ToEnum a = Apply (ToEnum_6989586621680787224Sym0 :: TyFun Nat (Proxy s) -> Type) a
type Pred (a :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Pred (a :: Proxy s) = Apply (Pred_6989586621680787212Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) a
type Succ (a :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Succ (a :: Proxy s) = Apply (Succ_6989586621680787206Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) a
type Mappend (arg1 :: Proxy s) (arg2 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Mappend (arg1 :: Proxy s) (arg2 :: Proxy s) = Apply (Apply (Mappend_6989586621680691331Sym0 :: TyFun (Proxy s) (Proxy s ~> Proxy s) -> Type) arg1) arg2
type ShowList (arg1 :: [Proxy s]) arg2
Instance details Defined in Data.Singletons.Prelude.Proxy type ShowList (arg1 :: [Proxy s]) arg2 = Apply (Apply (ShowList_6989586621680636754Sym0 :: TyFun [Proxy s] (Symbol ~> Symbol) -> Type) arg1) arg2
type (a1 :: Proxy s) <> (a2 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type (a1 :: Proxy s) <> (a2 :: Proxy s) = Apply (Apply (TFHelper_6989586621680787258Sym0 :: TyFun (Proxy s) (Proxy s ~> Proxy s) -> Type) a1) a2
type EnumFromTo (a1 :: Proxy s) (a2 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type EnumFromTo (a1 :: Proxy s) (a2 :: Proxy s) = Apply (Apply (EnumFromTo_6989586621680787249Sym0 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type) a1) a2
type Min (arg1 :: Proxy s) (arg2 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Min (arg1 :: Proxy s) (arg2 :: Proxy s) = Apply (Apply (Min_6989586621679837487Sym0 :: TyFun (Proxy s) (Proxy s ~> Proxy s) -> Type) arg1) arg2
type Max (arg1 :: Proxy s) (arg2 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Max (arg1 :: Proxy s) (arg2 :: Proxy s) = Apply (Apply (Max_6989586621679837471Sym0 :: TyFun (Proxy s) (Proxy s ~> Proxy s) -> Type) arg1) arg2
type (arg1 :: Proxy s) >= (arg2 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type (arg1 :: Proxy s) >= (arg2 :: Proxy s) = Apply (Apply (TFHelper_6989586621679837455Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) arg1) arg2
type (arg1 :: Proxy s) > (arg2 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type (arg1 :: Proxy s) > (arg2 :: Proxy s) = Apply (Apply (TFHelper_6989586621679837439Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) arg1) arg2
type (arg1 :: Proxy s) <= (arg2 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type (arg1 :: Proxy s) <= (arg2 :: Proxy s) = Apply (Apply (TFHelper_6989586621679837423Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) arg1) arg2
type (arg1 :: Proxy s) < (arg2 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type (arg1 :: Proxy s) < (arg2 :: Proxy s) = Apply (Apply (TFHelper_6989586621679837407Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) arg1) arg2
type Compare (a1 :: Proxy s) (a2 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Compare (a1 :: Proxy s) (a2 :: Proxy s) = Apply (Apply (Compare_6989586621680787183Sym0 :: TyFun (Proxy s) (Proxy s ~> Ordering) -> Type) a1) a2
type (x :: Proxy s) /= (y :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type (x :: Proxy s) /= (y :: Proxy s) = Not (x == y)
type (a1 :: Proxy s) == (a2 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type (a1 :: Proxy s) == (a2 :: Proxy s) = Apply (Apply (TFHelper_6989586621680787174Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) a1) a2
type ShowsPrec a1 (a2 :: Proxy s) a3
Instance details Defined in Data.Singletons.Prelude.Proxy type ShowsPrec a1 (a2 :: Proxy s) a3 = Apply (Apply (Apply (ShowsPrec_6989586621680787193Sym0 :: TyFun Nat (Proxy s ~> (Symbol ~> Symbol)) -> Type) a1) a2) a3
type EnumFromThenTo (a1 :: Proxy s) (a2 :: Proxy s) (a3 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type EnumFromThenTo (a1 :: Proxy s) (a2 :: Proxy s) (a3 :: Proxy s) = Apply (Apply (Apply (EnumFromThenTo_6989586621680787238Sym0 :: TyFun (Proxy s) (Proxy s ~> (Proxy s ~> [Proxy s])) -> Type) a1) a2) a3
type Apply (Fold_6989586621680823404Sym0 :: TyFun (Proxy m) m -> Type) (a6989586621680823408 :: Proxy m)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Fold_6989586621680823404Sym0 :: TyFun (Proxy m) m -> Type) (a6989586621680823408 :: Proxy m) = Fold_6989586621680823404Sym1 a6989586621680823408
type Apply (Sum_6989586621680823475Sym0 :: TyFun (Proxy a) a -> Type) (a6989586621680823479 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Sum_6989586621680823475Sym0 :: TyFun (Proxy a) a -> Type) (a6989586621680823479 :: Proxy a) = Sum_6989586621680823475Sym1 a6989586621680823479
type Apply (Product_6989586621680823481Sym0 :: TyFun (Proxy a) a -> Type) (a6989586621680823485 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Product_6989586621680823481Sym0 :: TyFun (Proxy a) a -> Type) (a6989586621680823485 :: Proxy a) = Product_6989586621680823481Sym1 a6989586621680823485
type Apply (Foldl1_6989586621680823437Sym1 a6989586621680823442 :: TyFun (Proxy a) a -> Type) (a6989586621680823443 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldl1_6989586621680823437Sym1 a6989586621680823442 :: TyFun (Proxy a) a -> Type) (a6989586621680823443 :: Proxy a) = Foldl1_6989586621680823437Sym2 a6989586621680823442 a6989586621680823443
type Apply (Foldr1_6989586621680823446Sym1 a6989586621680823451 :: TyFun (Proxy a) a -> Type) (a6989586621680823452 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldr1_6989586621680823446Sym1 a6989586621680823451 :: TyFun (Proxy a) a -> Type) (a6989586621680823452 :: Proxy a) = Foldr1_6989586621680823446Sym2 a6989586621680823451 a6989586621680823452
type Apply (Elem_6989586621680823467Sym1 a6989586621680823472 :: TyFun (Proxy a) Bool -> Type) (a6989586621680823473 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680823467Sym1 a6989586621680823472 :: TyFun (Proxy a) Bool -> Type) (a6989586621680823473 :: Proxy a) = Elem_6989586621680823467Sym2 a6989586621680823472 a6989586621680823473
type Apply (Length_6989586621680823454Sym0 :: TyFun (Proxy a) Nat -> Type) (a6989586621680823458 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Length_6989586621680823454Sym0 :: TyFun (Proxy a) Nat -> Type) (a6989586621680823458 :: Proxy a) = Length_6989586621680823454Sym1 a6989586621680823458
type Apply (Null_6989586621680823460Sym0 :: TyFun (Proxy a) Bool -> Type) (a6989586621680823464 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680823460Sym0 :: TyFun (Proxy a) Bool -> Type) (a6989586621680823464 :: Proxy a) = Null_6989586621680823460Sym1 a6989586621680823464
type Apply (FromEnum_6989586621680787218Sym0 :: TyFun (Proxy s) Nat -> Type) (a6989586621680787222 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (FromEnum_6989586621680787218Sym0 :: TyFun (Proxy s) Nat -> Type) (a6989586621680787222 :: Proxy s) = FromEnum_6989586621680787218Sym1 a6989586621680787222
type Apply (FoldMap_6989586621680823396Sym1 a6989586621680823401 :: TyFun (Proxy a) m -> Type) (a6989586621680823402 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FoldMap_6989586621680823396Sym1 a6989586621680823401 :: TyFun (Proxy a) m -> Type) (a6989586621680823402 :: Proxy a) = FoldMap_6989586621680823396Sym2 a6989586621680823401 a6989586621680823402
type Apply (TFHelper_6989586621680787174Sym1 a6989586621680787179 :: TyFun (Proxy s) Bool -> Type) (a6989586621680787180 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (TFHelper_6989586621680787174Sym1 a6989586621680787179 :: TyFun (Proxy s) Bool -> Type) (a6989586621680787180 :: Proxy s) = TFHelper_6989586621680787174Sym2 a6989586621680787179 a6989586621680787180
type Apply (Compare_6989586621680787183Sym1 a6989586621680787188 :: TyFun (Proxy s) Ordering -> Type) (a6989586621680787189 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (Compare_6989586621680787183Sym1 a6989586621680787188 :: TyFun (Proxy s) Ordering -> Type) (a6989586621680787189 :: Proxy s) = Compare_6989586621680787183Sym2 a6989586621680787188 a6989586621680787189
type Apply (Foldr_6989586621680823412Sym2 a6989586621680823418 a6989586621680823419 :: TyFun (Proxy a) b -> Type) (a6989586621680823420 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldr_6989586621680823412Sym2 a6989586621680823418 a6989586621680823419 :: TyFun (Proxy a) b -> Type) (a6989586621680823420 :: Proxy a) = Foldr_6989586621680823412Sym3 a6989586621680823418 a6989586621680823419 a6989586621680823420
type Apply (Foldl_6989586621680823425Sym2 a6989586621680823431 a6989586621680823432 :: TyFun (Proxy a) b -> Type) (a6989586621680823433 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldl_6989586621680823425Sym2 a6989586621680823431 a6989586621680823432 :: TyFun (Proxy a) b -> Type) (a6989586621680823433 :: Proxy a) = Foldl_6989586621680823425Sym3 a6989586621680823431 a6989586621680823432 a6989586621680823433
type Apply (SequenceA_6989586621681088333Sym0 :: TyFun (Proxy (f a)) (f (Proxy a)) -> Type) (a6989586621681088337 :: Proxy (f a))
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (SequenceA_6989586621681088333Sym0 :: TyFun (Proxy (f a)) (f (Proxy a)) -> Type) (a6989586621681088337 :: Proxy (f a)) = SequenceA_6989586621681088333Sym1 a6989586621681088337
type Apply (Sequence_6989586621681088348Sym0 :: TyFun (Proxy (m a)) (m (Proxy a)) -> Type) (a6989586621681088352 :: Proxy (m a))
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Sequence_6989586621681088348Sym0 :: TyFun (Proxy (m a)) (m (Proxy a)) -> Type) (a6989586621681088352 :: Proxy (m a)) = Sequence_6989586621681088348Sym1 a6989586621681088352
type Apply (EnumFromTo_6989586621680787249Sym1 a6989586621680787254 :: TyFun (Proxy s) [Proxy s] -> Type) (a6989586621680787255 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (EnumFromTo_6989586621680787249Sym1 a6989586621680787254 :: TyFun (Proxy s) [Proxy s] -> Type) (a6989586621680787255 :: Proxy s) = EnumFromTo_6989586621680787249Sym2 a6989586621680787254 a6989586621680787255
type Apply (Traverse_6989586621681088325Sym1 a6989586621681088330 :: TyFun (Proxy a) (f (Proxy b)) -> Type) (a6989586621681088331 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621681088325Sym1 a6989586621681088330 :: TyFun (Proxy a) (f (Proxy b)) -> Type) (a6989586621681088331 :: Proxy a) = Traverse_6989586621681088325Sym2 a6989586621681088330 a6989586621681088331
type Apply (MapM_6989586621681088340Sym1 a6989586621681088345 :: TyFun (Proxy a) (m (Proxy b)) -> Type) (a6989586621681088346 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (MapM_6989586621681088340Sym1 a6989586621681088345 :: TyFun (Proxy a) (m (Proxy b)) -> Type) (a6989586621681088346 :: Proxy a) = MapM_6989586621681088340Sym2 a6989586621681088345 a6989586621681088346
type Apply (EnumFromThenTo_6989586621680787238Sym2 a6989586621680787244 a6989586621680787245 :: TyFun (Proxy s) [Proxy s] -> Type) (a6989586621680787246 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (EnumFromThenTo_6989586621680787238Sym2 a6989586621680787244 a6989586621680787245 :: TyFun (Proxy s) [Proxy s] -> Type) (a6989586621680787246 :: Proxy s) = EnumFromThenTo_6989586621680787238Sym3 a6989586621680787244 a6989586621680787245 a6989586621680787246
type Apply (Foldl1_6989586621680823437Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type) (a6989586621680823442 :: a ~> (a ~> a))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldl1_6989586621680823437Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type) (a6989586621680823442 :: a ~> (a ~> a)) = Foldl1_6989586621680823437Sym1 a6989586621680823442
type Apply (Foldr1_6989586621680823446Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type) (a6989586621680823451 :: a ~> (a ~> a))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldr1_6989586621680823446Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type) (a6989586621680823451 :: a ~> (a ~> a)) = Foldr1_6989586621680823446Sym1 a6989586621680823451
type Apply (TFHelper_6989586621680787297Sym0 :: TyFun (Proxy (a ~> b)) (Proxy a ~> Proxy b) -> Type) (a6989586621680787302 :: Proxy (a ~> b))
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (TFHelper_6989586621680787297Sym0 :: TyFun (Proxy (a ~> b)) (Proxy a ~> Proxy b) -> Type) (a6989586621680787302 :: Proxy (a ~> b)) = TFHelper_6989586621680787297Sym1 a6989586621680787302
type Apply (TFHelper_6989586621680787174Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) (a6989586621680787179 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (TFHelper_6989586621680787174Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) (a6989586621680787179 :: Proxy s) = TFHelper_6989586621680787174Sym1 a6989586621680787179
type Apply (Compare_6989586621680787183Sym0 :: TyFun (Proxy s) (Proxy s ~> Ordering) -> Type) (a6989586621680787188 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (Compare_6989586621680787183Sym0 :: TyFun (Proxy s) (Proxy s ~> Ordering) -> Type) (a6989586621680787188 :: Proxy s) = Compare_6989586621680787183Sym1 a6989586621680787188
type Apply (Succ_6989586621680787206Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) (a6989586621680787210 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (Succ_6989586621680787206Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) (a6989586621680787210 :: Proxy s) = Succ_6989586621680787206Sym1 a6989586621680787210
type Apply (Pred_6989586621680787212Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) (a6989586621680787216 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (Pred_6989586621680787212Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) (a6989586621680787216 :: Proxy s) = Pred_6989586621680787212Sym1 a6989586621680787216
type Apply (EnumFromThenTo_6989586621680787238Sym0 :: TyFun (Proxy s) (Proxy s ~> (Proxy s ~> [Proxy s])) -> Type) (a6989586621680787244 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (EnumFromThenTo_6989586621680787238Sym0 :: TyFun (Proxy s) (Proxy s ~> (Proxy s ~> [Proxy s])) -> Type) (a6989586621680787244 :: Proxy s) = EnumFromThenTo_6989586621680787238Sym1 a6989586621680787244
type Apply (EnumFromTo_6989586621680787249Sym0 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type) (a6989586621680787254 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (EnumFromTo_6989586621680787249Sym0 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type) (a6989586621680787254 :: Proxy s) = EnumFromTo_6989586621680787249Sym1 a6989586621680787254
type Apply (TFHelper_6989586621680787258Sym0 :: TyFun (Proxy s) (Proxy s ~> Proxy s) -> Type) (a6989586621680787263 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (TFHelper_6989586621680787258Sym0 :: TyFun (Proxy s) (Proxy s ~> Proxy s) -> Type) (a6989586621680787263 :: Proxy s) = TFHelper_6989586621680787258Sym1 a6989586621680787263
type Apply (TFHelper_6989586621680787309Sym0 :: TyFun (Proxy a) (Proxy a ~> Proxy a) -> Type) (a6989586621680787314 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (TFHelper_6989586621680787309Sym0 :: TyFun (Proxy a) (Proxy a ~> Proxy a) -> Type) (a6989586621680787314 :: Proxy a) = TFHelper_6989586621680787309Sym1 a6989586621680787314
type Apply (FoldMap_6989586621680823396Sym0 :: TyFun (a ~> m) (Proxy a ~> m) -> Type) (a6989586621680823401 :: a ~> m)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FoldMap_6989586621680823396Sym0 :: TyFun (a ~> m) (Proxy a ~> m) -> Type) (a6989586621680823401 :: a ~> m) = FoldMap_6989586621680823396Sym1 a6989586621680823401
type Apply (Foldr_6989586621680823412Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Proxy a ~> b)) -> Type) (a6989586621680823418 :: a ~> (b ~> b))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldr_6989586621680823412Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Proxy a ~> b)) -> Type) (a6989586621680823418 :: a ~> (b ~> b)) = Foldr_6989586621680823412Sym1 a6989586621680823418
type Apply (Foldl_6989586621680823425Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Proxy a ~> b)) -> Type) (a6989586621680823431 :: b ~> (a ~> b))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Foldl_6989586621680823425Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Proxy a ~> b)) -> Type) (a6989586621680823431 :: b ~> (a ~> b)) = Foldl_6989586621680823425Sym1 a6989586621680823431
type Apply (Fmap_6989586621680787282Sym0 :: TyFun (a ~> b) (Proxy a ~> Proxy b) -> Type) (a6989586621680787287 :: a ~> b)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (Fmap_6989586621680787282Sym0 :: TyFun (a ~> b) (Proxy a ~> Proxy b) -> Type) (a6989586621680787287 :: a ~> b) = Fmap_6989586621680787282Sym1 a6989586621680787287
type Apply (Fmap_6989586621680787282Sym1 a6989586621680787287 :: TyFun (Proxy a) (Proxy b) -> Type) (a6989586621680787288 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (Fmap_6989586621680787282Sym1 a6989586621680787287 :: TyFun (Proxy a) (Proxy b) -> Type) (a6989586621680787288 :: Proxy a) = Fmap_6989586621680787282Sym2 a6989586621680787287 a6989586621680787288
type Apply (TFHelper_6989586621680787297Sym1 a6989586621680787302 :: TyFun (Proxy a) (Proxy b) -> Type) (a6989586621680787303 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (TFHelper_6989586621680787297Sym1 a6989586621680787302 :: TyFun (Proxy a) (Proxy b) -> Type) (a6989586621680787303 :: Proxy a) = TFHelper_6989586621680787297Sym2 a6989586621680787302 a6989586621680787303
type Apply (TFHelper_6989586621680787318Sym0 :: TyFun (Proxy a) ((a ~> Proxy b) ~> Proxy b) -> Type) (a6989586621680787323 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (TFHelper_6989586621680787318Sym0 :: TyFun (Proxy a) ((a ~> Proxy b) ~> Proxy b) -> Type) (a6989586621680787323 :: Proxy a) = TFHelper_6989586621680787318Sym1 a6989586621680787323 :: TyFun (a ~> Proxy b) (Proxy b) -> Type
type Apply (ShowsPrec_6989586621680787193Sym1 a6989586621680787201 :: TyFun (Proxy s) (Symbol ~> Symbol) -> Type) (a6989586621680787202 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (ShowsPrec_6989586621680787193Sym1 a6989586621680787201 :: TyFun (Proxy s) (Symbol ~> Symbol) -> Type) (a6989586621680787202 :: Proxy s) = ShowsPrec_6989586621680787193Sym2 a6989586621680787201 a6989586621680787202
type Apply (EnumFromThenTo_6989586621680787238Sym1 a6989586621680787244 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type) (a6989586621680787245 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (EnumFromThenTo_6989586621680787238Sym1 a6989586621680787244 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type) (a6989586621680787245 :: Proxy s) = EnumFromThenTo_6989586621680787238Sym2 a6989586621680787244 a6989586621680787245
type Apply (TFHelper_6989586621680787258Sym1 a6989586621680787263 :: TyFun (Proxy s) (Proxy s) -> Type) (a6989586621680787264 :: Proxy s)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (TFHelper_6989586621680787258Sym1 a6989586621680787263 :: TyFun (Proxy s) (Proxy s) -> Type) (a6989586621680787264 :: Proxy s) = TFHelper_6989586621680787258Sym2 a6989586621680787263 a6989586621680787264
type Apply (TFHelper_6989586621680787309Sym1 a6989586621680787314 :: TyFun (Proxy a) (Proxy a) -> Type) (a6989586621680787315 :: Proxy a)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (TFHelper_6989586621680787309Sym1 a6989586621680787314 :: TyFun (Proxy a) (Proxy a) -> Type) (a6989586621680787315 :: Proxy a) = TFHelper_6989586621680787309Sym2 a6989586621680787314 a6989586621680787315
type Apply (Traverse_6989586621681088325Sym0 :: TyFun (a ~> f b) (Proxy a ~> f (Proxy b)) -> Type) (a6989586621681088330 :: a ~> f b)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621681088325Sym0 :: TyFun (a ~> f b) (Proxy a ~> f (Proxy b)) -> Type) (a6989586621681088330 :: a ~> f b) = Traverse_6989586621681088325Sym1 a6989586621681088330
type Apply (MapM_6989586621681088340Sym0 :: TyFun (a ~> m b) (Proxy a ~> m (Proxy b)) -> Type) (a6989586621681088345 :: a ~> m b)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (MapM_6989586621681088340Sym0 :: TyFun (a ~> m b) (Proxy a ~> m (Proxy b)) -> Type) (a6989586621681088345 :: a ~> m b) = MapM_6989586621681088340Sym1 a6989586621681088345
type Apply (TFHelper_6989586621680787318Sym1 a6989586621680787323 :: TyFun (a ~> Proxy b) (Proxy b) -> Type) (a6989586621680787324 :: a ~> Proxy b)
Instance details Defined in Data.Singletons.Prelude.Proxy type Apply (TFHelper_6989586621680787318Sym1 a6989586621680787323 :: TyFun (a ~> Proxy b) (Proxy b) -> Type) (a6989586621680787324 :: a ~> Proxy b) = TFHelper_6989586621680787318Sym2 a6989586621680787323 a6989586621680787324

fromString :: IsString a => String -> a #

undefined :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => a #

undefined that leaves a warning in code on every usage.

error :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => Text -> a #

error that takes Text as an argument.

(!) :: WithParam p fn fn' => fn -> Param p -> fn' infixl 9 #

Supply a parameter to a function:

function ! #param_name value

function ! #x 7 ! #y 42 ! defaults

This is an infix version of with.