Safe Haskell | None |
---|---|
Language | Haskell2010 |
Commonly used parts of regular Prelude.
Synopsis
- ($) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
- (.) :: (b -> c) -> (a -> b) -> a -> c
- type ($) (f :: k1 -> k) (a :: k1) = f a
- class Eq a
- class Eq a => Ord a
- class Bounded a where
- class Semigroup a where
- class Semigroup a => Monoid a where
- class Generic a
- data Text
- data Either a b
- data Maybe 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
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
. However, $
x)$
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
,
or map
($
0) xs
.zipWith
($
) fs xs
Note that (
is levity-polymorphic in its result type, so that
$
)foo
where $
Truefoo :: Bool -> Int#
is well-typed.
type ($) (f :: k1 -> k) (a :: k1) = f a infixr 2 #
Infix application.
f :: Either String $ Maybe Int = f :: Either String (Maybe Int)
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:
Instances
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
, thenx <= z
=True
- Reflexivity
x <= x
=True
- Antisymmetry
- if
x <= y && y <= x
=True
, thenx == 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
Minimal complete definition: either compare
or <=
.
Using compare
can be more efficient for complex types.
Instances
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
.
Instances
Bounded Bool | Since: base-2.1 |
Bounded Char | Since: base-2.1 |
Bounded Int | Since: base-2.1 |
Bounded Int8 | Since: base-2.1 |
Bounded Int16 | Since: base-2.1 |
Bounded Int32 | Since: base-2.1 |
Bounded Int64 | Since: base-2.1 |
Bounded Ordering | Since: base-2.1 |
Bounded Word | Since: base-2.1 |
Bounded Word8 | Since: base-2.1 |
Bounded Word16 | Since: base-2.1 |
Bounded Word32 | Since: base-2.1 |
Bounded Word64 | Since: base-2.1 |
Bounded VecCount | Since: base-4.10.0.0 |
Bounded VecElem | Since: base-4.10.0.0 |
Bounded () | Since: base-2.1 |
Bounded All | Since: base-2.1 |
Bounded Any | Since: base-2.1 |
Bounded Associativity | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
Bounded SourceUnpackedness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
Bounded SourceStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
Bounded DecidedStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
Bounded GeneralCategory | Since: base-2.1 |
Defined in GHC.Unicode | |
Bounded UTF32_Invalid | |
Defined in Basement.String.Encoding.UTF32 | |
Bounded Encoding | |
Bounded Extension | |
Bounded Undefined | |
Bounded Mutez | |
Bounded EntriesOrder | |
Defined in Michelson.Untyped.Contract | |
Bounded KeyHashTag | |
Defined in Tezos.Crypto | |
Class () (Bounded a) | |
Defined in Data.Constraint | |
a :=> (Bounded (Dict a)) | |
() :=> (Bounded Bool) | |
() :=> (Bounded Char) | |
() :=> (Bounded Int) | |
() :=> (Bounded Ordering) | |
() :=> (Bounded Word) | |
() :=> (Bounded ()) | |
Defined in Data.Constraint | |
Bounded a => Bounded (Min a) | Since: base-4.9.0.0 |
Bounded a => Bounded (Max a) | Since: base-4.9.0.0 |
Bounded a => Bounded (First a) | Since: base-4.9.0.0 |
Bounded a => Bounded (Last a) | Since: base-4.9.0.0 |
Bounded m => Bounded (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup minBound :: WrappedMonoid m # maxBound :: WrappedMonoid m # | |
Bounded a => Bounded (Identity a) | Since: base-4.9.0.0 |
Bounded a => Bounded (Dual a) | Since: base-2.1 |
Bounded a => Bounded (Sum a) | Since: base-2.1 |
Bounded a => Bounded (Product a) | Since: base-2.1 |
a => Bounded (Dict a) | |
Bounded a => Bounded (StringEncode a) | |
Defined in Morley.Micheline.Json | |
(Bounded a) :=> (Bounded (Identity a)) | |
(Bounded a) :=> (Bounded (Const a b)) | |
(Bounded a, Bounded b) => Bounded (a, b) | Since: base-2.1 |
Bounded (Proxy t) | Since: base-4.7.0.0 |
(Bounded a, Bounded b) :=> (Bounded (a, b)) | |
(Bounded a, Bounded b, Bounded c) => Bounded (a, b, c) | Since: base-2.1 |
Bounded a => Bounded (Const a b) | Since: base-4.9.0.0 |
(Applicative f, Bounded a) => Bounded (Ap f a) | Since: base-4.12.0.0 |
a ~ b => Bounded (a :~: b) | Since: base-4.7.0.0 |
Bounded b => Bounded (Tagged s b) | |
(Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (a, b, c, d) | Since: base-2.1 |
a ~~ b => Bounded (a :~~: b) | Since: base-4.10.0.0 |
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (a, b, c, d, e) | Since: base-2.1 |
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f) => Bounded (a, b, c, d, e, f) | Since: base-2.1 |
(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 |
(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 |
(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 |
(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 |
(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 |
(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 |
(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 |
(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 |
(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 |
The class of semigroups (types with an associative binary operation).
Instances should satisfy the following:
Since: base-4.9.0.0
(<>) :: a -> a -> a infixr 6 #
An associative operation.
Reduce a non-empty list with <>
The default definition should be sufficient, but this can be overridden for efficiency.
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 O(1) by
picking stimes =
or stimesIdempotent
stimes =
respectively.stimesIdempotentMonoid
Instances
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)<>
zSemigroup
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 newtype
s and make those instances
of Monoid
, e.g. Sum
and Product
.
NOTE: Semigroup
is a superclass of Monoid
since base-4.11.0.0.
Identity of mappend
An associative operation
NOTE: This method is redundant and has the default
implementation
since base-4.11.0.0.mappend
= (<>
)
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.
Instances
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
Instances
A space efficient, packed, unboxed Unicode text type.
Instances
The Either
type represents values with two possibilities: a value of
type
is either Either
a b
or Left
a
.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
The type
is the type of values which can be either
a Either
String
Int
String
or an Int
. The Left
constructor can be used only on
String
s, and the Right
constructor can be used only on Int
s:
>>>
let s = Left "foo" :: Either String Int
>>>
s
Left "foo">>>
let n = Right 3 :: Either String Int
>>>
n
Right 3>>>
:type s
s :: Either String Int>>>
:type n
n :: Either String Int
The fmap
from our Functor
instance will ignore Left
values, but
will apply the supplied function to values contained in a Right
:
>>>
let s = Left "foo" :: Either String Int
>>>
let n = Right 3 :: Either String Int
>>>
fmap (*2) s
Left "foo">>>
fmap (*2) n
Right 6
The Monad
instance for Either
allows us to chain together multiple
actions which may fail, and fail overall if any of the individual
steps failed. First we'll write a function that can either parse an
Int
from a Char
, or fail.
>>>
import Data.Char ( digitToInt, isDigit )
>>>
:{
let parseEither :: Char -> Either String Int parseEither c | isDigit c = Right (digitToInt c) | otherwise = Left "parse error">>>
:}
The following should work, since both '1'
and '2'
can be
parsed as Int
s.
>>>
:{
let parseMultiple :: Either String Int parseMultiple = do x <- parseEither '1' y <- parseEither '2' return (x + y)>>>
:}
>>>
parseMultiple
Right 3
But the following should fail overall, since the first operation where
we attempt to parse 'm'
as an Int
will fail:
>>>
:{
let parseMultiple :: Either String Int parseMultiple = do x <- parseEither 'm' y <- parseEither '2' return (x + y)>>>
:}
>>>
parseMultiple
Left "parse error"
Instances
ToJSON2 Either | |
Defined in Data.Aeson.Types.ToJSON 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 |
Eq2 Either | Since: base-4.9.0.0 |
Ord2 Either | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
Read2 Either | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes 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 |
NFData2 Either | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
Hashable2 Either | |
Defined in Data.Hashable.Class | |
() :=> (Monad (Either a)) | |
() :=> (Functor (Either a)) | |
() :=> (Applicative (Either a)) | |
Defined in Data.Constraint ins :: () :- Applicative (Either a) # | |
Monad (Either e) | Since: base-4.4.0.0 |
Functor (Either a) | Since: base-3.0 |
Applicative (Either e) | Since: base-3.0 |
Foldable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Foldable fold :: Monoid m => Either a m -> m # foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # toList :: Either a a0 -> [a0] # length :: Either a a0 -> Int # elem :: Eq a0 => a0 -> Either a a0 -> Bool # maximum :: Ord a0 => Either a a0 -> a0 # minimum :: Ord a0 => Either a a0 -> a0 # | |
Traversable (Either a) | Since: base-4.7.0.0 |
ToJSON a => ToJSON1 (Either a) | |
Defined in Data.Aeson.Types.ToJSON 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 |
Ord a => Ord1 (Either a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
Read a => Read1 (Either a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes 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 |
MonadFailure (Either a) | |
NFData a => NFData1 (Either a) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
e ~ SomeException => MonadThrow (Either e) | |
Defined in Control.Monad.Catch | |
e ~ SomeException => MonadCatch (Either e) | Since: exceptions-0.8.3 |
e ~ SomeException => MonadMask (Either e) | Since: exceptions-0.8.3 |
Defined in Control.Monad.Catch | |
Hashable a => Hashable1 (Either a) | |
Defined in Data.Hashable.Class | |
PTraversable (Either a) | |
STraversable (Either a) | |
Defined in Data.Singletons.Prelude.Traversable 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 (t :: Either a (f a0)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) # 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 (t :: Either a (m a0)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) # | |
PFoldable (Either a) | |
SFoldable (Either a) | |
Defined in Data.Singletons.Prelude.Foldable sFold :: forall m (t :: Either a m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) # 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 (t :: Either a a0). Sing t -> Sing (Apply ToListSym0 t) # sNull :: forall a0 (t :: Either a a0). Sing t -> Sing (Apply NullSym0 t) # sLength :: forall a0 (t :: Either a a0). Sing t -> Sing (Apply LengthSym0 t) # sElem :: forall a0 (t1 :: a0) (t2 :: Either a a0). SEq a0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a0 (t :: Either a a0). SOrd a0 => Sing t -> Sing (Apply MaximumSym0 t) # sMinimum :: forall a0 (t :: Either a a0). SOrd a0 => Sing t -> Sing (Apply MinimumSym0 t) # sSum :: forall a0 (t :: Either a a0). SNum a0 => Sing t -> Sing (Apply SumSym0 t) # sProduct :: forall a0 (t :: Either a a0). SNum a0 => Sing t -> Sing (Apply ProductSym0 t) # | |
PFunctor (Either a) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
PApplicative (Either e) | |
PMonad (Either e) | |
SFunctor (Either a) | |
SApplicative (Either e) | |
Defined in Data.Singletons.Prelude.Monad.Internal 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) | |
Defined in Data.Singletons.Prelude.Monad.Internal (%>>=) :: 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 |
IsoHKD (Either a :: Type -> Type) (b :: Type) | |
(CanCastTo l1 l2, CanCastTo r1 r2) => CanCastTo (Either l1 r1 :: Type) (Either l2 r2 :: Type) Source # | |
(Eq a, Eq b) => Eq (Either a b) | Since: base-2.1 |
(Ord a, Ord b) => Ord (Either a b) | Since: base-2.1 |
(Read a, Read b) => Read (Either a b) | Since: base-3.0 |
(Show a, Show b) => Show (Either a b) | Since: base-3.0 |
Generic (Either a b) | Since: base-4.6.0.0 |
Semigroup (Either a b) | Since: base-4.9.0.0 |
(Lift a, Lift b) => Lift (Either a b) | |
(Hashable a, Hashable b) => Hashable (Either a b) | |
Defined in Data.Hashable.Class | |
(ToJSON a, ToJSON b) => ToJSON (Either a b) | |
Defined in Data.Aeson.Types.ToJSON | |
(NFData a, NFData b) => NFData (Either a b) | |
Defined in Control.DeepSeq | |
PShow (Either a b) | |
(SShow a, SShow b) => SShow (Either a b) | |
Defined in Data.Singletons.Prelude.Show 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) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
SSemigroup (Either a b) | |
POrd (Either a b) | |
(SOrd a, SOrd b) => SOrd (Either a b) | |
Defined in Data.Singletons.Prelude.Ord 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) | |
PEq (Either a b) | |
(TypeError (DisallowInstance "Either") :: Constraint) => Container (Either a b) | |
Defined in Universum.Container.Class toList :: Either a b -> [Element (Either a b)] # 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 # elem :: Element (Either a b) -> Either a b -> Bool # maximum :: Either a b -> Element (Either a b) # minimum :: Either a b -> Element (Either a b) # 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 # foldr1 :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Element (Either a b) # foldl1 :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Element (Either a b) # 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 # find :: (Element (Either a b) -> Bool) -> Either a b -> Maybe (Element (Either a b)) # | |
PolyTypeHasDocC '[l, r] => TypeHasDoc (Either l r) | |
Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Either l r) :: FieldDescriptions # 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) | |
(HasAnnotation a, HasAnnotation b) => HasAnnotation (Either a b) Source # | |
Defined in Lorentz.Annotation getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Either a b)) Source # | |
(Eq a, Eq b) :=> (Eq (Either a b)) | |
(Ord a, Ord b) :=> (Ord (Either a b)) | |
(Read a, Read b) :=> (Read (Either a b)) | |
(Show a, Show b) :=> (Show (Either a b)) | |
(SDecide a, SDecide b) => TestCoercion (SEither :: Either a b -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SDecide a, SDecide b) => TestEquality (SEither :: Either a b -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SuppressUnusedWarnings (RightsSym0 :: TyFun [Either a6989586621680725242 b6989586621680725243] [b6989586621680725243] -> Type) | |
Defined in Data.Singletons.Prelude.Either suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (PartitionEithersSym0 :: TyFun [Either a6989586621680725240 b6989586621680725241] ([a6989586621680725240], [b6989586621680725241]) -> Type) | |
Defined in Data.Singletons.Prelude.Either suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (LeftsSym0 :: TyFun [Either a6989586621680725244 b6989586621680725245] [a6989586621680725244] -> Type) | |
Defined in Data.Singletons.Prelude.Either suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a6989586621680725236 b6989586621680725237) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a6989586621680725238 b6989586621680725239) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Compare_6989586621679803289Sym0 :: TyFun (Either a6989586621679091042 b6989586621679091043) (Either a6989586621679091042 b6989586621679091043 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ShowsPrec_6989586621680595795Sym0 :: TyFun Nat (Either a6989586621679091042 b6989586621679091043 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Pure_6989586621680024479Sym0 :: TyFun a6989586621679962812 (Either e6989586621680023561 a6989586621679962812) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (RightSym0 :: TyFun b6989586621679091043 (Either a6989586621679091042 b6989586621679091043) -> Type) | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (LeftSym0 :: TyFun a6989586621679091042 (Either a6989586621679091042 b6989586621679091043) -> Type) | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680187948ASym0 :: TyFun k1 (Either a6989586621679091042 k1) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal suppressUnusedWarnings :: () # | |
SingI (RightsSym0 :: TyFun [Either a b] [b] -> Type) | |
Defined in Data.Singletons.Prelude.Either sing :: Sing RightsSym0 # | |
SingI (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
SingI (LeftsSym0 :: TyFun [Either a b] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either sing :: Sing IsRightSym0 # | |
SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either sing :: Sing IsLeftSym0 # | |
SingI (RightSym0 :: TyFun b (Either a b) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SingI (LeftSym0 :: TyFun a (Either a b) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(a ~ a', b ~ b') => Each (Either a a') (Either b b') a b | Since: microlens-0.4.11 |
SuppressUnusedWarnings (ShowsPrec_6989586621680595795Sym1 a6989586621680595792 a6989586621679091042 b6989586621679091043 :: TyFun (Either a6989586621679091042 b6989586621679091043) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680024589Sym0 :: TyFun (Either e6989586621680023578 a6989586621679962836) ((a6989586621679962836 ~> Either e6989586621680023578 b6989586621679962837) ~> Either e6989586621680023578 b6989586621679962837) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680024489Sym0 :: TyFun (Either e6989586621680023561 (a6989586621679962813 ~> b6989586621679962814)) (Either e6989586621680023561 a6989586621679962813 ~> Either e6989586621680023561 b6989586621679962814) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Compare_6989586621679803289Sym1 a6989586621679803287 :: TyFun (Either a6989586621679091042 b6989586621679091043) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680024292Sym0 :: TyFun a6989586621679962809 (Either a6989586621680023549 b6989586621679962810 ~> Either a6989586621680023549 a6989586621679962809) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Fmap_6989586621680024271Sym0 :: TyFun (a6989586621679962807 ~> b6989586621679962808) (Either a6989586621680023549 a6989586621679962807 ~> Either a6989586621680023549 b6989586621679962808) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Either_Sym0 :: TyFun (a6989586621680723762 ~> c6989586621680723763) ((b6989586621680723764 ~> c6989586621680723763) ~> (Either a6989586621680723762 b6989586621680723764 ~> c6989586621680723763)) -> Type) | |
Defined in Data.Singletons.Prelude.Either suppressUnusedWarnings :: () # | |
SingI (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) | |
Defined in Data.Singletons.Prelude.Either sing :: Sing Either_Sym0 # | |
SuppressUnusedWarnings (TFHelper_6989586621680024489Sym1 a6989586621680024487 :: TyFun (Either e6989586621680023561 a6989586621679962813) (Either e6989586621680023561 b6989586621679962814) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680024292Sym1 a6989586621680024290 a6989586621680023549 b6989586621679962810 :: TyFun (Either a6989586621680023549 b6989586621679962810) (Either a6989586621680023549 a6989586621679962809) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Fmap_6989586621680024271Sym1 a6989586621680024269 a6989586621680023549 :: TyFun (Either a6989586621680023549 a6989586621679962807) (Either a6989586621680023549 b6989586621679962808) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Traverse_6989586621680995102Sym0 :: TyFun (a6989586621680988968 ~> f6989586621680988967 b6989586621680988969) (Either a6989586621680994525 a6989586621680988968 ~> f6989586621680988967 (Either a6989586621680994525 b6989586621680988969)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680024589Sym1 a6989586621680024587 b6989586621679962837 :: TyFun (a6989586621679962836 ~> Either e6989586621680023578 b6989586621679962837) (Either e6989586621680023578 b6989586621679962837) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Either_Sym1 a6989586621680723798 b6989586621680723764 :: TyFun (b6989586621680723764 ~> c6989586621680723763) (Either a6989586621680723762 b6989586621680723764 ~> c6989586621680723763) -> Type) | |
Defined in Data.Singletons.Prelude.Either suppressUnusedWarnings :: () # | |
SingI d => SingI (Either_Sym1 d b :: TyFun (b ~> c) (Either a b ~> c) -> Type) | |
Defined in Data.Singletons.Prelude.Either sing :: Sing (Either_Sym1 d b) # | |
SuppressUnusedWarnings (Traverse_6989586621680995102Sym1 a6989586621680995100 a6989586621680994525 :: TyFun (Either a6989586621680994525 a6989586621680988968) (f6989586621680988967 (Either a6989586621680994525 b6989586621680988969)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Either_Sym2 a6989586621680723799 a6989586621680723798 :: TyFun (Either a6989586621680723762 b6989586621680723764) c6989586621680723763 -> Type) | |
Defined in Data.Singletons.Prelude.Either suppressUnusedWarnings :: () # | |
(SingI d1, SingI d2) => SingI (Either_Sym2 d1 d2 :: TyFun (Either a b) c -> Type) | |
Defined in Data.Singletons.Prelude.Either sing :: Sing (Either_Sym2 d1 d2) # | |
(Functor f, Functor g) => Functor (Lift Either f g) | |
type MapM (arg1 :: a0 ~> m0 b0) (arg2 :: Either a a0) | |
type Traverse (a2 :: a6989586621680988968 ~> f6989586621680988967 b6989586621680988969) (a3 :: Either a1 a6989586621680988968) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a2 :: a6989586621680988968 ~> f6989586621680988967 b6989586621680988969) (a3 :: Either a1 a6989586621680988968) = Apply (Apply (Traverse_6989586621680995102Sym0 :: TyFun (a6989586621680988968 ~> f6989586621680988967 b6989586621680988969) (Either a1 a6989586621680988968 ~> f6989586621680988967 (Either a1 b6989586621680988969)) -> Type) a2) a3 | |
type LiftA2 (arg1 :: a0 ~> (b0 ~> c0)) (arg2 :: Either e a0) (arg3 :: Either e b0) | |
type FoldMap (a2 :: a6989586621680742388 ~> k2) (a3 :: Either a1 a6989586621680742388) | |
type Fmap (a2 :: a6989586621679962807 ~> b6989586621679962808) (a3 :: Either a1 a6989586621679962807) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
type Foldl' (arg1 :: b0 ~> (a0 ~> b0)) (arg2 :: b0) (arg3 :: Either a a0) | |
type Foldl (arg1 :: b0 ~> (a0 ~> b0)) (arg2 :: b0) (arg3 :: Either a a0) | |
type Foldr' (arg1 :: a0 ~> (b0 ~> b0)) (arg2 :: b0) (arg3 :: Either a a0) | |
type Foldr (a2 :: a6989586621680742389 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Either a1 a6989586621680742389) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Pure (a :: k1) | |
type Return (arg0 :: a0) | |
type Elem (arg1 :: a0) (arg2 :: Either a a0) | |
type Foldl1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: Either a a0) | |
type Foldr1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: Either a a0) | |
type (a2 :: k1) <$ (a3 :: Either a1 b6989586621679962810) | |
type Apply (ShowsPrec_6989586621680595795Sym0 :: TyFun Nat (Either a6989586621679091042 b6989586621679091043 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680595792 :: Nat) | |
Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680595795Sym0 :: TyFun Nat (Either a6989586621679091042 b6989586621679091043 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680595792 :: Nat) = ShowsPrec_6989586621680595795Sym1 a6989586621680595792 a6989586621679091042 b6989586621679091043 :: TyFun (Either a6989586621679091042 b6989586621679091043) (Symbol ~> Symbol) -> Type | |
type Apply (Pure_6989586621680024479Sym0 :: TyFun a (Either e6989586621680023561 a) -> Type) (a6989586621680024478 :: a) | |
type Apply (LeftSym0 :: TyFun a (Either a b6989586621679091043) -> Type) (t6989586621679707110 :: a) | |
type Apply (RightSym0 :: TyFun b (Either a6989586621679091042 b) -> Type) (t6989586621679707112 :: b) | |
type Apply (Let6989586621680187948ASym0 :: TyFun k1 (Either a6989586621679091042 k1) -> Type) (wild_69895866216801875326989586621680187947 :: k1) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
type Apply (TFHelper_6989586621680024292Sym0 :: TyFun a6989586621679962809 (Either a6989586621680023549 b6989586621679962810 ~> Either a6989586621680023549 a6989586621679962809) -> Type) (a6989586621680024290 :: a6989586621679962809) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024292Sym0 :: TyFun a6989586621679962809 (Either a6989586621680023549 b6989586621679962810 ~> Either a6989586621680023549 a6989586621679962809) -> Type) (a6989586621680024290 :: a6989586621679962809) = TFHelper_6989586621680024292Sym1 a6989586621680024290 a6989586621680023549 b6989586621679962810 :: TyFun (Either a6989586621680023549 b6989586621679962810) (Either a6989586621680023549 a6989586621679962809) -> Type | |
type Eval (FoldMap f ('Right x :: Either a3 a1) :: a2 -> Type) | |
type Eval (FoldMap f ('Left _a :: Either a3 a1) :: a2 -> Type) | |
type Eval (Foldr f y ('Right x :: Either a3 a1) :: a2 -> Type) | |
type Eval (Foldr f y ('Left _a :: Either a3 a1) :: a2 -> Type) | |
type Failure (Either a) | |
Defined in Basement.Monad | |
type Product (arg0 :: Either a a0) | |
type Sum (arg0 :: Either a a0) | |
type Minimum (arg0 :: Either a a0) | |
type Maximum (arg0 :: Either a a0) | |
type Length (a2 :: Either a1 a6989586621680742401) | |
type Null (a2 :: Either a1 a6989586621680742400) | |
type ToList (arg0 :: Either a a0) | |
type Fold (arg0 :: Either a m0) | |
type Sequence (arg0 :: Either a (m0 a0)) | |
type SequenceA (arg0 :: Either a (f0 a0)) | |
type (arg1 :: Either e a0) <* (arg2 :: Either e b0) | |
type (arg1 :: Either e a0) *> (arg2 :: Either e b0) | |
type (a1 :: Either e (a6989586621679962813 ~> b6989586621679962814)) <*> (a2 :: Either e a6989586621679962813) | |
Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Either e (a6989586621679962813 ~> b6989586621679962814)) <*> (a2 :: Either e a6989586621679962813) = Apply (Apply (TFHelper_6989586621680024489Sym0 :: TyFun (Either e (a6989586621679962813 ~> b6989586621679962814)) (Either e a6989586621679962813 ~> Either e b6989586621679962814) -> Type) a1) a2 | |
type (arg1 :: Either e a0) >> (arg2 :: Either e b0) | |
type (a1 :: Either e a6989586621679962836) >>= (a2 :: a6989586621679962836 ~> Either e b6989586621679962837) | |
Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Either e a6989586621679962836) >>= (a2 :: a6989586621679962836 ~> Either e b6989586621679962837) = Apply (Apply (TFHelper_6989586621680024589Sym0 :: TyFun (Either e a6989586621679962836) ((a6989586621679962836 ~> Either e b6989586621679962837) ~> Either e b6989586621679962837) -> Type) a1) a2 | |
type Rep1 (Either a :: Type -> Type) | |
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) | |
type Apply (RightsSym0 :: TyFun [Either a b] [b] -> Type) (a6989586621680725511 :: [Either a b]) | |
Defined in Data.Singletons.Prelude.Either | |
type Apply (LeftsSym0 :: TyFun [Either a b] [a] -> Type) (a6989586621680725516 :: [Either a b]) | |
type Apply (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) (a6989586621680725491 :: [Either a b]) | |
Defined in Data.Singletons.Prelude.Either | |
type Rep (Either a b) | |
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 | |
Defined in Data.Singletons.Prelude.Instances | |
type Demote (Either a b) | |
type Element (Either a b) | |
Defined in Universum.Container.Class | |
type TypeDocFieldDescriptions (Either l r) | |
Defined in Michelson.Typed.Haskell.Doc | |
type ToT (Either l r) | |
Defined in Michelson.Typed.Haskell.Value | |
type Show_ (arg0 :: Either a b) | |
type Sconcat (arg0 :: NonEmpty (Either a b)) | |
type ShowList (arg1 :: [Either a b]) arg2 | |
type (a2 :: Either a1 b) <> (a3 :: Either a1 b) | |
type Min (arg1 :: Either a b) (arg2 :: Either a b) | |
type Max (arg1 :: Either a b) (arg2 :: Either a b) | |
type (arg1 :: Either a b) >= (arg2 :: Either a b) | |
type (arg1 :: Either a b) > (arg2 :: Either a b) | |
type (arg1 :: Either a b) <= (arg2 :: Either a b) | |
type (arg1 :: Either a b) < (arg2 :: Either a b) | |
type Compare (a2 :: Either a1 b) (a3 :: Either a1 b) | |
type (x :: Either a b) /= (y :: Either a b) | |
type (a2 :: Either a1 b1) == (b2 :: Either a1 b1) | |
Defined in Data.Singletons.Prelude.Eq | |
type ShowsPrec a2 (a3 :: Either a1 b) a4 | |
type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680725485 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680725487 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
type Apply (Compare_6989586621679803289Sym1 a6989586621679803287 :: TyFun (Either a b) Ordering -> Type) (a6989586621679803288 :: Either a b) | |
type Apply (Either_Sym2 a6989586621680723799 a6989586621680723798 :: TyFun (Either a b) c -> Type) (a6989586621680723800 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
type Apply (Traverse_6989586621680995102Sym1 a6989586621680995100 a2 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type) (a6989586621680995101 :: Either a2 a1) | |
type Apply (Compare_6989586621679803289Sym0 :: TyFun (Either a6989586621679091042 b6989586621679091043) (Either a6989586621679091042 b6989586621679091043 ~> Ordering) -> Type) (a6989586621679803287 :: Either a6989586621679091042 b6989586621679091043) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679803289Sym0 :: TyFun (Either a6989586621679091042 b6989586621679091043) (Either a6989586621679091042 b6989586621679091043 ~> Ordering) -> Type) (a6989586621679803287 :: Either a6989586621679091042 b6989586621679091043) = Compare_6989586621679803289Sym1 a6989586621679803287 | |
type Apply (ShowsPrec_6989586621680595795Sym1 a6989586621680595792 a6989586621679091042 b6989586621679091043 :: TyFun (Either a6989586621679091042 b6989586621679091043) (Symbol ~> Symbol) -> Type) (a6989586621680595793 :: Either a6989586621679091042 b6989586621679091043) | |
Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680595795Sym1 a6989586621680595792 a6989586621679091042 b6989586621679091043 :: TyFun (Either a6989586621679091042 b6989586621679091043) (Symbol ~> Symbol) -> Type) (a6989586621680595793 :: Either a6989586621679091042 b6989586621679091043) = ShowsPrec_6989586621680595795Sym2 a6989586621680595792 a6989586621680595793 | |
type Apply (TFHelper_6989586621680024489Sym0 :: TyFun (Either e6989586621680023561 (a6989586621679962813 ~> b6989586621679962814)) (Either e6989586621680023561 a6989586621679962813 ~> Either e6989586621680023561 b6989586621679962814) -> Type) (a6989586621680024487 :: Either e6989586621680023561 (a6989586621679962813 ~> b6989586621679962814)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024489Sym0 :: TyFun (Either e6989586621680023561 (a6989586621679962813 ~> b6989586621679962814)) (Either e6989586621680023561 a6989586621679962813 ~> Either e6989586621680023561 b6989586621679962814) -> Type) (a6989586621680024487 :: Either e6989586621680023561 (a6989586621679962813 ~> b6989586621679962814)) = TFHelper_6989586621680024489Sym1 a6989586621680024487 | |
type Apply (TFHelper_6989586621680024589Sym0 :: TyFun (Either e6989586621680023578 a6989586621679962836) ((a6989586621679962836 ~> Either e6989586621680023578 b6989586621679962837) ~> Either e6989586621680023578 b6989586621679962837) -> Type) (a6989586621680024587 :: Either e6989586621680023578 a6989586621679962836) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024589Sym0 :: TyFun (Either e6989586621680023578 a6989586621679962836) ((a6989586621679962836 ~> Either e6989586621680023578 b6989586621679962837) ~> Either e6989586621680023578 b6989586621679962837) -> Type) (a6989586621680024587 :: Either e6989586621680023578 a6989586621679962836) = TFHelper_6989586621680024589Sym1 a6989586621680024587 b6989586621679962837 :: TyFun (a6989586621679962836 ~> Either e6989586621680023578 b6989586621679962837) (Either e6989586621680023578 b6989586621679962837) -> Type | |
type Apply (Fmap_6989586621680024271Sym0 :: TyFun (a6989586621679962807 ~> b6989586621679962808) (Either a6989586621680023549 a6989586621679962807 ~> Either a6989586621680023549 b6989586621679962808) -> Type) (a6989586621680024269 :: a6989586621679962807 ~> b6989586621679962808) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621680024271Sym0 :: TyFun (a6989586621679962807 ~> b6989586621679962808) (Either a6989586621680023549 a6989586621679962807 ~> Either a6989586621680023549 b6989586621679962808) -> Type) (a6989586621680024269 :: a6989586621679962807 ~> b6989586621679962808) = Fmap_6989586621680024271Sym1 a6989586621680024269 a6989586621680023549 :: TyFun (Either a6989586621680023549 a6989586621679962807) (Either a6989586621680023549 b6989586621679962808) -> Type | |
type Apply (Either_Sym0 :: TyFun (a6989586621680723762 ~> c6989586621680723763) ((b6989586621680723764 ~> c6989586621680723763) ~> (Either a6989586621680723762 b6989586621680723764 ~> c6989586621680723763)) -> Type) (a6989586621680723798 :: a6989586621680723762 ~> c6989586621680723763) | |
Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym0 :: TyFun (a6989586621680723762 ~> c6989586621680723763) ((b6989586621680723764 ~> c6989586621680723763) ~> (Either a6989586621680723762 b6989586621680723764 ~> c6989586621680723763)) -> Type) (a6989586621680723798 :: a6989586621680723762 ~> c6989586621680723763) = Either_Sym1 a6989586621680723798 b6989586621680723764 :: TyFun (b6989586621680723764 ~> c6989586621680723763) (Either a6989586621680723762 b6989586621680723764 ~> c6989586621680723763) -> Type | |
type Apply (Fmap_6989586621680024271Sym1 a6989586621680024269 a2 :: TyFun (Either a2 a1) (Either a2 b) -> Type) (a6989586621680024270 :: Either a2 a1) | |
type Apply (TFHelper_6989586621680024292Sym1 a6989586621680024290 a2 b :: TyFun (Either a2 b) (Either a2 a1) -> Type) (a6989586621680024291 :: Either a2 b) | |
type Apply (TFHelper_6989586621680024489Sym1 a6989586621680024487 :: TyFun (Either e a) (Either e b) -> Type) (a6989586621680024488 :: Either e a) | |
type Apply (Traverse_6989586621680995102Sym0 :: TyFun (a6989586621680988968 ~> f6989586621680988967 b6989586621680988969) (Either a6989586621680994525 a6989586621680988968 ~> f6989586621680988967 (Either a6989586621680994525 b6989586621680988969)) -> Type) (a6989586621680995100 :: a6989586621680988968 ~> f6989586621680988967 b6989586621680988969) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680995102Sym0 :: TyFun (a6989586621680988968 ~> f6989586621680988967 b6989586621680988969) (Either a6989586621680994525 a6989586621680988968 ~> f6989586621680988967 (Either a6989586621680994525 b6989586621680988969)) -> Type) (a6989586621680995100 :: a6989586621680988968 ~> f6989586621680988967 b6989586621680988969) = Traverse_6989586621680995102Sym1 a6989586621680995100 a6989586621680994525 :: TyFun (Either a6989586621680994525 a6989586621680988968) (f6989586621680988967 (Either a6989586621680994525 b6989586621680988969)) -> Type | |
type Apply (TFHelper_6989586621680024589Sym1 a6989586621680024587 b :: TyFun (a ~> Either e b) (Either e b) -> Type) (a6989586621680024588 :: a ~> Either e b) | |
type Apply (Either_Sym1 a6989586621680723798 b6989586621680723764 :: TyFun (b6989586621680723764 ~> c6989586621680723763) (Either a6989586621680723762 b6989586621680723764 ~> c6989586621680723763) -> Type) (a6989586621680723799 :: b6989586621680723764 ~> c6989586621680723763) | |
Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym1 a6989586621680723798 b6989586621680723764 :: TyFun (b6989586621680723764 ~> c6989586621680723763) (Either a6989586621680723762 b6989586621680723764 ~> c6989586621680723763) -> Type) (a6989586621680723799 :: b6989586621680723764 ~> c6989586621680723763) = Either_Sym2 a6989586621680723798 a6989586621680723799 | |
type Eval (Map f ('Right a3 :: Either a2 a1) :: Either a2 b -> Type) | |
type Eval (Map f ('Left x :: Either a2 a1) :: Either a2 b -> Type) | |
type Eval (Bimap f g ('Right y :: Either a b1) :: Either a' b2 -> Type) | |
type Eval (Bimap f g ('Left x :: Either a1 b) :: Either a2 b' -> Type) | |
The Maybe
type encapsulates an optional value. A value of type
either contains a value of type Maybe
aa
(represented as
),
or it is empty (represented as Just
aNothing
). 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.
Instances
Monad Maybe | Since: base-2.1 |
Functor Maybe | Since: base-2.1 |
MonadFail Maybe | Since: base-4.9.0.0 |
Defined in Control.Monad.Fail | |
Applicative Maybe | Since: base-2.1 |
Foldable Maybe | Since: base-2.1 |
Defined in Data.Foldable fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldMap' :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # | |
Traversable Maybe | Since: base-2.1 |
ToJSON1 Maybe | |
Defined in Data.Aeson.Types.ToJSON 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 # | |
Alternative Maybe | Since: base-2.1 |
MonadPlus Maybe | Since: base-2.1 |
Eq1 Maybe | Since: base-4.9.0.0 |
Ord1 Maybe | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
Read1 Maybe | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
Show1 Maybe | Since: base-4.9.0.0 |
MonadFailure Maybe | |
NFData1 Maybe | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
MonadThrow Maybe | |
Defined in Control.Monad.Catch | |
Hashable1 Maybe | |
Defined in Data.Hashable.Class | |
InjValue Maybe | |
Defined in Named.Internal | |
PTraversable Maybe | |
STraversable Maybe | |
Defined in Data.Singletons.Prelude.Traversable 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 (t :: Maybe (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) # 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 (t :: Maybe (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) # | |
PFoldable Maybe | |
SFoldable Maybe | |
Defined in Data.Singletons.Prelude.Foldable sFold :: forall m (t :: Maybe m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) # 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 (t :: Maybe a). Sing t -> Sing (Apply ToListSym0 t) # sNull :: forall a (t :: Maybe a). Sing t -> Sing (Apply NullSym0 t) # sLength :: forall a (t :: Maybe a). Sing t -> Sing (Apply LengthSym0 t) # sElem :: forall a (t1 :: a) (t2 :: Maybe a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t :: Maybe a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) # sMinimum :: forall a (t :: Maybe a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) # sSum :: forall a (t :: Maybe a). SNum a => Sing t -> Sing (Apply SumSym0 t) # sProduct :: forall a (t :: Maybe a). SNum a => Sing t -> Sing (Apply ProductSym0 t) # | |
PMonadFail Maybe | |
Defined in Data.Singletons.Prelude.Monad.Fail | |
SMonadFail Maybe | |
PFunctor Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
PApplicative Maybe | |
PMonad Maybe | |
PAlternative Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
PMonadPlus Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SFunctor Maybe | |
SApplicative Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal 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 | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SAlternative Maybe | |
SMonadPlus Maybe | |
KnownNamedFunctor Maybe | |
LorentzFunctor Maybe Source # | |
Defined in Lorentz.Instr | |
(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)) | |
Defined in Data.Aeson.Types.ToJSON | |
() :=> (Functor Maybe) | |
() :=> (Applicative Maybe) | |
Defined in Data.Constraint ins :: () :- Applicative Maybe # | |
() :=> (Alternative Maybe) | |
Defined in Data.Constraint ins :: () :- Alternative Maybe # | |
() :=> (MonadPlus Maybe) | |
Eq a => Eq (Maybe a) | Since: base-2.1 |
Ord a => Ord (Maybe a) | Since: base-2.1 |
Read a => Read (Maybe a) | Since: base-2.1 |
Show a => Show (Maybe a) | Since: base-2.1 |
Generic (Maybe a) | Since: base-4.6.0.0 |
Semigroup a => Semigroup (Maybe a) | Since: base-4.9.0.0 |
Semigroup a => Monoid (Maybe a) | Lift a semigroup into Since 4.11.0: constraint on inner Since: base-2.1 |
Lift a => Lift (Maybe a) | |
Hashable a => Hashable (Maybe a) | |
Defined in Data.Hashable.Class | |
ToJSON a => ToJSON (Maybe a) | |
Defined in Data.Aeson.Types.ToJSON | |
SingKind a => SingKind (Maybe a) | Since: base-4.9.0.0 |
Defined in GHC.Generics type DemoteRep (Maybe a) | |
NFData a => NFData (Maybe a) | |
Defined in Control.DeepSeq | |
Default (Maybe a) | |
Defined in Data.Default.Class | |
Buildable a => Buildable (Maybe a) | |
Defined in Formatting.Buildable | |
Ixed (Maybe a) | |
Defined in Control.Lens.At | |
At (Maybe a) | |
PMonoid (Maybe a) | |
SSemigroup a => SMonoid (Maybe a) | |
PShow (Maybe a) | |
SShow a => SShow (Maybe a) | |
Defined in Data.Singletons.Prelude.Show 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) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
SSemigroup a => SSemigroup (Maybe a) | |
POrd (Maybe a) | |
SOrd a => SOrd (Maybe a) | |
Defined in Data.Singletons.Prelude.Ord 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) | |
PEq (Maybe a) | |
(TypeError (DisallowInstance "Maybe") :: Constraint) => Container (Maybe a) | |
Defined in Universum.Container.Class toList :: Maybe a -> [Element (Maybe a)] # 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 # elem :: Element (Maybe a) -> Maybe a -> Bool # maximum :: Maybe a -> Element (Maybe a) # minimum :: Maybe a -> Element (Maybe a) # 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 # foldr1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Element (Maybe a) # foldl1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Element (Maybe a) # notElem :: Element (Maybe a) -> Maybe a -> Bool # all :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # any :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # find :: (Element (Maybe a) -> Bool) -> Maybe a -> Maybe (Element (Maybe a)) # | |
Pretty a => Pretty (Maybe a) | |
Defined in Text.PrettyPrint.Leijen.Text | |
PolyTypeHasDocC '[a] => TypeHasDoc (Maybe a) | |
Defined in Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Maybe a) :: FieldDescriptions # 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) | |
HasAnnotation a => HasAnnotation (Maybe a) Source # | |
Defined in Lorentz.Annotation getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Maybe a)) Source # | |
Generic1 Maybe | Since: base-4.6.0.0 |
IsoHKD Maybe (a :: Type) | |
SingI ('Nothing :: Maybe a) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
SDecide a => TestCoercion (SMaybe :: Maybe a -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SDecide a => TestEquality (SMaybe :: Maybe a -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(Eq a) :=> (Eq (Maybe a)) | |
(Ord a) :=> (Ord (Maybe a)) | |
(Read a) :=> (Read (Maybe a)) | |
(Show a) :=> (Show (Maybe a)) | |
(Semigroup a) :=> (Semigroup (Maybe a)) | |
(Monoid a) :=> (Monoid (Maybe a)) | |
Each (Maybe a) (Maybe b) a b | |
CanCastTo a b => CanCastTo (Maybe a :: Type) (Maybe b :: Type) Source # | |
SingI a2 => SingI ('Just a2 :: Maybe a1) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
SuppressUnusedWarnings (CatMaybesSym0 :: TyFun [Maybe a6989586621679913398] [a6989586621679913398] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ListToMaybeSym0 :: TyFun [a6989586621679913399] (Maybe a6989586621679913399) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (StripPrefixSym0 :: TyFun [a6989586621680438535] ([a6989586621680438535] ~> Maybe [a6989586621680438535]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680024604Sym0 :: TyFun (Maybe a6989586621679962888) (Maybe a6989586621679962888 ~> Maybe a6989586621679962888) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (MaybeToListSym0 :: TyFun (Maybe a6989586621679913400) [a6989586621679913400] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a6989586621679913403) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a6989586621679913404) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FromJustSym0 :: TyFun (Maybe a6989586621679913402) a6989586621679913402 -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (MinInternalSym0 :: TyFun (Maybe a6989586621680733530) (MinInternal a6989586621680733530) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (MaxInternalSym0 :: TyFun (Maybe a6989586621680732856) (MaxInternal a6989586621680732856) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Compare_6989586621679803211Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (OptionSym0 :: TyFun (Maybe a6989586621679060067) (Option a6989586621679060067) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a6989586621679087421) (Last a6989586621679087421) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a6989586621679087428) (First a6989586621679087428) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ShowsPrec_6989586621680595739Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Pure_6989586621680024319Sym0 :: TyFun a6989586621679962812 (Maybe a6989586621679962812) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680024612LSym0 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FromMaybeSym0 :: TyFun a6989586621679913401 (Maybe a6989586621679913401 ~> a6989586621679913401) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ElemIndexSym0 :: TyFun a6989586621680316353 ([a6989586621680316353] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (JustSym0 :: TyFun a3530822107858468865 (Maybe a3530822107858468865) -> Type) | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (GetOptionSym0 :: TyFun (Option a6989586621679060067) (Maybe a6989586621679060067) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a6989586621679087428) (Maybe a6989586621679087428) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a6989586621679087421) (Maybe a6989586621679087421) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680316354 ~> Bool) ([a6989586621680316354] ~> Maybe a6989586621680316354) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a6989586621680316351 ~> Bool) ([a6989586621680316351] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SingI (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing CatMaybesSym0 # | |
SingI (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing ListToMaybeSym0 # | |
SingI (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing MaybeToListSym0 # | |
SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing IsNothingSym0 # | |
SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing IsJustSym0 # | |
SingI (FromJustSym0 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing FromJustSym0 # | |
SingI (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal sing :: Sing OptionSym0 # | |
SingI (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
SingI (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
SingI (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing FromMaybeSym0 # | |
SEq a => SingI (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing ElemIndexSym0 # | |
SingI (JustSym0 :: TyFun a (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing FindIndexSym0 # | |
SuppressUnusedWarnings (StripPrefixSym1 a6989586621680440231 :: TyFun [a6989586621680438535] (Maybe [a6989586621680438535]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FindSym1 a6989586621680320902 :: TyFun [a6989586621680316354] (Maybe a6989586621680316354) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FindIndexSym1 a6989586621680320878 :: TyFun [a6989586621680316351] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ElemIndexSym1 a6989586621680320894 :: TyFun [a6989586621680316353] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ShowsPrec_6989586621680595739Sym1 a6989586621680595736 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680024604Sym1 a6989586621680024602 :: TyFun (Maybe a6989586621679962888) (Maybe a6989586621679962888) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680024514Sym0 :: TyFun (Maybe a6989586621679962838) (Maybe b6989586621679962839 ~> Maybe b6989586621679962839) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680024502Sym0 :: TyFun (Maybe a6989586621679962836) ((a6989586621679962836 ~> Maybe b6989586621679962837) ~> Maybe b6989586621679962837) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680024359Sym0 :: TyFun (Maybe a6989586621679962818) (Maybe b6989586621679962819 ~> Maybe b6989586621679962819) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FromMaybeSym1 a6989586621679913587 :: TyFun (Maybe a6989586621679913401) a6989586621679913401 -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Compare_6989586621679803211Sym1 a6989586621679803209 :: TyFun (Maybe a3530822107858468865) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680024329Sym0 :: TyFun (Maybe (a6989586621679962813 ~> b6989586621679962814)) (Maybe a6989586621679962813 ~> Maybe b6989586621679962814) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (OptionalSym0 :: TyFun (f6989586621681393525 a6989586621681393526) (f6989586621681393525 (Maybe a6989586621681393526)) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680024181Sym0 :: TyFun a6989586621679962809 (Maybe b6989586621679962810 ~> Maybe a6989586621679962809) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b6989586621679911964 ((a6989586621679911965 ~> b6989586621679911964) ~> (Maybe a6989586621679911965 ~> b6989586621679911964)) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (LookupSym0 :: TyFun a6989586621680316332 ([(a6989586621680316332, b6989586621680316333)] ~> Maybe b6989586621680316333) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680734317NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680734317MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680734290NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680734290MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Fmap_6989586621680024168Sym0 :: TyFun (a6989586621679962807 ~> b6989586621679962808) (Maybe a6989586621679962807 ~> Maybe b6989586621679962808) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (MapMaybeSym0 :: TyFun (a6989586621679913396 ~> Maybe b6989586621679913397) ([a6989586621679913396] ~> [b6989586621679913397]) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (UnfoldrSym0 :: TyFun (b6989586621680316410 ~> Maybe (a6989586621680316411, b6989586621680316410)) (b6989586621680316410 ~> [a6989586621680316411]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680742294 ~> Bool) (t6989586621680742293 a6989586621680742294 ~> Maybe a6989586621680742294) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SingI d => SingI (FindSym1 d :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (FindIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (FindIndexSym1 d) # | |
(SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (ElemIndexSym1 d) # | |
SingI d => SingI (FromMaybeSym1 d :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing (FromMaybeSym1 d) # | |
SAlternative f => SingI (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative sing :: Sing OptionalSym0 # | |
SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing Maybe_Sym0 # | |
SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing LookupSym0 # | |
SingI (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing MapMaybeSym0 # | |
SingI (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing UnfoldrSym0 # | |
SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SuppressUnusedWarnings (LookupSym1 a6989586621680320556 b6989586621680316333 :: TyFun [(a6989586621680316332, b6989586621680316333)] (Maybe b6989586621680316333) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680024514Sym1 a6989586621680024512 b6989586621679962839 :: TyFun (Maybe b6989586621679962839) (Maybe b6989586621679962839) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680024359Sym1 a6989586621680024357 b6989586621679962819 :: TyFun (Maybe b6989586621679962819) (Maybe b6989586621679962819) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680024329Sym1 a6989586621680024327 :: TyFun (Maybe a6989586621679962813) (Maybe b6989586621679962814) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680024181Sym1 a6989586621680024179 b6989586621679962810 :: TyFun (Maybe b6989586621679962810) (Maybe a6989586621679962809) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Fmap_6989586621680024168Sym1 a6989586621680024166 :: TyFun (Maybe a6989586621679962807) (Maybe b6989586621679962808) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680734317NSym1 x6989586621680734315 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680734317MSym1 x6989586621680734315 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680734290NSym1 x6989586621680734288 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680734290MSym1 x6989586621680734288 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FindSym1 a6989586621680742747 t6989586621680742293 :: TyFun (t6989586621680742293 a6989586621680742294) (Maybe a6989586621680742294) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621680641011Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621680640923Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Traverse_6989586621680995062Sym0 :: TyFun (a6989586621680988968 ~> f6989586621680988967 b6989586621680988969) (Maybe a6989586621680988968 ~> f6989586621680988967 (Maybe b6989586621680988969)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680024502Sym1 a6989586621680024500 b6989586621679962837 :: TyFun (a6989586621679962836 ~> Maybe b6989586621679962837) (Maybe b6989586621679962837) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (LiftA2_6989586621680024343Sym0 :: TyFun (a6989586621679962815 ~> (b6989586621679962816 ~> c6989586621679962817)) (Maybe a6989586621679962815 ~> (Maybe b6989586621679962816 ~> Maybe c6989586621679962817)) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Maybe_Sym1 a6989586621679911982 a6989586621679911965 :: TyFun (a6989586621679911965 ~> b6989586621679911964) (Maybe a6989586621679911965 ~> b6989586621679911964) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621679913564RsSym0 :: TyFun (a6989586621679913396 ~> Maybe k1) (TyFun k (TyFun [a6989586621679913396] [k1] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680743228MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680743203MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
(SEq a, SingI d) => SingI (LookupSym1 d b :: TyFun [(a, b)] (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (LookupSym1 d b) # | |
(SFoldable t, SingI d) => SingI (FindSym1 d t :: TyFun (t a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SingI d => SingI (Maybe_Sym1 d a :: TyFun (a ~> b) (Maybe a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing (Maybe_Sym1 d a) # | |
SuppressUnusedWarnings (Traverse_6989586621680995062Sym1 a6989586621680995060 :: TyFun (Maybe a6989586621680988968) (f6989586621680988967 (Maybe b6989586621680988969)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (LiftA2_6989586621680024343Sym1 a6989586621680024340 :: TyFun (Maybe a6989586621679962815) (Maybe b6989586621679962816 ~> Maybe c6989586621679962817) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Maybe_Sym2 a6989586621679911983 a6989586621679911982 :: TyFun (Maybe a6989586621679911965) b6989586621679911964 -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680743228MfSym1 f6989586621680743226 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680743203MfSym1 f6989586621680743201 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621680641011Sym1 a6989586621680641009 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621680640923Sym1 a6989586621680640921 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
(SingI d1, SingI d2) => SingI (Maybe_Sym2 d1 d2 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing (Maybe_Sym2 d1 d2) # | |
SuppressUnusedWarnings (LiftA2_6989586621680024343Sym2 a6989586621680024341 a6989586621680024340 :: TyFun (Maybe b6989586621679962816) (Maybe c6989586621679962817) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680743228MfSym2 xs6989586621680743227 f6989586621680743226 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680743203MfSym2 xs6989586621680743202 f6989586621680743201 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621680641011Sym2 k6989586621680641010 a6989586621680641009 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621680640923Sym2 k6989586621680640922 a6989586621680640921 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680743203MfSym3 a6989586621680743204 xs6989586621680743202 f6989586621680743201 :: TyFun (Maybe k3) (Maybe k2) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680743228MfSym3 a6989586621680743229 xs6989586621680743227 f6989586621680743226 :: TyFun k3 (Maybe k3) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
IsoValue a => IsoValue (NamedF Maybe a name) | |
(HasAnnotation (Maybe a), KnownSymbol name) => HasAnnotation (NamedF Maybe a name) Source # | |
Defined in Lorentz.Annotation getAnnotation :: FollowEntrypointFlag -> Notes (ToT (NamedF Maybe a name)) Source # | |
Wrappable (NamedF Maybe a name) Source # | |
Defined in Lorentz.Wrappable type Unwrappable (NamedF Maybe a name) Source # | |
type Failure Maybe | |
Defined in Basement.Monad | |
type Empty | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
type Mzero | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
type Product (arg0 :: Maybe a0) | |
type Sum (arg0 :: Maybe a0) | |
type Minimum (arg0 :: Maybe a0) | |
type Maximum (arg0 :: Maybe a0) | |
type Length (arg0 :: Maybe a0) | |
type Null (arg0 :: Maybe a0) | |
type ToList (arg0 :: Maybe a0) | |
type Fold (arg0 :: Maybe m0) | |
type Fail a2 | |
type Pure (a :: k1) | |
type Return (arg0 :: a0) | |
type Sequence (arg0 :: Maybe (m0 a0)) | |
type SequenceA (arg0 :: Maybe (f0 a0)) | |
type Elem (arg1 :: a0) (arg2 :: Maybe a0) | |
type Foldl1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: Maybe a0) | |
type Foldr1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: Maybe a0) | |
type (a1 :: Maybe a6989586621679962888) <|> (a2 :: Maybe a6989586621679962888) | |
type Mplus (arg1 :: Maybe a0) (arg2 :: Maybe a0) | |
type FoldMap (a1 :: a6989586621680742388 ~> k2) (a2 :: Maybe a6989586621680742388) | |
type (a1 :: k1) <$ (a2 :: Maybe b6989586621679962810) | |
type Fmap (a1 :: a6989586621679962807 ~> b6989586621679962808) (a2 :: Maybe a6989586621679962807) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
type (arg1 :: Maybe a0) <* (arg2 :: Maybe b0) | |
type (a1 :: Maybe a6989586621679962818) *> (a2 :: Maybe b6989586621679962819) | |
type (a1 :: Maybe (a6989586621679962813 ~> b6989586621679962814)) <*> (a2 :: Maybe a6989586621679962813) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
type (a1 :: Maybe a6989586621679962838) >> (a2 :: Maybe b6989586621679962839) | |
type (a1 :: Maybe a6989586621679962836) >>= (a2 :: a6989586621679962836 ~> Maybe b6989586621679962837) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
type MapM (arg1 :: a0 ~> m0 b0) (arg2 :: Maybe a0) | |
type Traverse (a1 :: a6989586621680988968 ~> f6989586621680988967 b6989586621680988969) (a2 :: Maybe a6989586621680988968) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680988968 ~> f6989586621680988967 b6989586621680988969) (a2 :: Maybe a6989586621680988968) = Apply (Apply (Traverse_6989586621680995062Sym0 :: TyFun (a6989586621680988968 ~> f6989586621680988967 b6989586621680988969) (Maybe a6989586621680988968 ~> f6989586621680988967 (Maybe b6989586621680988969)) -> Type) a1) a2 | |
type Foldl' (arg1 :: b0 ~> (a0 ~> b0)) (arg2 :: b0) (arg3 :: Maybe a0) | |
type Foldl (a1 :: k2 ~> (a6989586621680742394 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680742394) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Foldr' (arg1 :: a0 ~> (b0 ~> b0)) (arg2 :: b0) (arg3 :: Maybe a0) | |
type Foldr (a1 :: a6989586621680742389 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680742389) | |
Defined in Data.Singletons.Prelude.Foldable | |
type LiftA2 (a1 :: a6989586621679962815 ~> (b6989586621679962816 ~> c6989586621679962817)) (a2 :: Maybe a6989586621679962815) (a3 :: Maybe b6989586621679962816) | |
Defined in Data.Singletons.Prelude.Monad.Internal type LiftA2 (a1 :: a6989586621679962815 ~> (b6989586621679962816 ~> c6989586621679962817)) (a2 :: Maybe a6989586621679962815) (a3 :: Maybe b6989586621679962816) = Apply (Apply (Apply (LiftA2_6989586621680024343Sym0 :: TyFun (a6989586621679962815 ~> (b6989586621679962816 ~> c6989586621679962817)) (Maybe a6989586621679962815 ~> (Maybe b6989586621679962816 ~> Maybe c6989586621679962817)) -> Type) a1) a2) a3 | |
type Apply (Pure_6989586621680024319Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621680024318 :: a) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
type Apply (Let6989586621680024612LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216800235906989586621680024611 :: k1) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (t6989586621679707043 :: a) | |
type Apply (Let6989586621680734290NSym1 x6989586621680734288 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680734289 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (Let6989586621680734290MSym1 x6989586621680734288 :: TyFun k (Maybe k1) -> Type) (y6989586621680734289 :: k) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (Let6989586621680734317NSym1 x6989586621680734315 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680734316 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (Let6989586621680734317MSym1 x6989586621680734315 :: TyFun k (Maybe k1) -> Type) (y6989586621680734316 :: k) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (Lambda_6989586621680640923Sym2 k6989586621680640922 a6989586621680640921 :: TyFun k1 (Maybe a) -> Type) (t6989586621680640934 :: k1) | |
Defined in Data.Singletons.Prelude.Monoid | |
type Apply (Lambda_6989586621680641011Sym2 k6989586621680641010 a6989586621680641009 :: TyFun k1 (Maybe a) -> Type) (t6989586621680641022 :: k1) | |
Defined in Data.Singletons.Prelude.Monoid | |
type Apply (Let6989586621680743228MfSym3 a6989586621680743229 xs6989586621680743227 f6989586621680743226 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680743230 :: k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (ShowsPrec_6989586621680595739Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680595736 :: Nat) | |
Defined in Data.Singletons.Prelude.Show | |
type Apply (FromMaybeSym0 :: TyFun a6989586621679913401 (Maybe a6989586621679913401 ~> a6989586621679913401) -> Type) (a6989586621679913587 :: a6989586621679913401) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym0 :: TyFun a6989586621679913401 (Maybe a6989586621679913401 ~> a6989586621679913401) -> Type) (a6989586621679913587 :: a6989586621679913401) = FromMaybeSym1 a6989586621679913587 | |
type Apply (ElemIndexSym0 :: TyFun a6989586621680316353 ([a6989586621680316353] ~> Maybe Nat) -> Type) (a6989586621680320894 :: a6989586621680316353) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym0 :: TyFun a6989586621680316353 ([a6989586621680316353] ~> Maybe Nat) -> Type) (a6989586621680320894 :: a6989586621680316353) = ElemIndexSym1 a6989586621680320894 | |
type Apply (TFHelper_6989586621680024181Sym0 :: TyFun a6989586621679962809 (Maybe b6989586621679962810 ~> Maybe a6989586621679962809) -> Type) (a6989586621680024179 :: a6989586621679962809) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024181Sym0 :: TyFun a6989586621679962809 (Maybe b6989586621679962810 ~> Maybe a6989586621679962809) -> Type) (a6989586621680024179 :: a6989586621679962809) = TFHelper_6989586621680024181Sym1 a6989586621680024179 b6989586621679962810 :: TyFun (Maybe b6989586621679962810) (Maybe a6989586621679962809) -> Type | |
type Apply (Maybe_Sym0 :: TyFun b6989586621679911964 ((a6989586621679911965 ~> b6989586621679911964) ~> (Maybe a6989586621679911965 ~> b6989586621679911964)) -> Type) (a6989586621679911982 :: b6989586621679911964) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym0 :: TyFun b6989586621679911964 ((a6989586621679911965 ~> b6989586621679911964) ~> (Maybe a6989586621679911965 ~> b6989586621679911964)) -> Type) (a6989586621679911982 :: b6989586621679911964) = Maybe_Sym1 a6989586621679911982 a6989586621679911965 :: TyFun (a6989586621679911965 ~> b6989586621679911964) (Maybe a6989586621679911965 ~> b6989586621679911964) -> Type | |
type Apply (LookupSym0 :: TyFun a6989586621680316332 ([(a6989586621680316332, b6989586621680316333)] ~> Maybe b6989586621680316333) -> Type) (a6989586621680320556 :: a6989586621680316332) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym0 :: TyFun a6989586621680316332 ([(a6989586621680316332, b6989586621680316333)] ~> Maybe b6989586621680316333) -> Type) (a6989586621680320556 :: a6989586621680316332) = LookupSym1 a6989586621680320556 b6989586621680316333 :: TyFun [(a6989586621680316332, b6989586621680316333)] (Maybe b6989586621680316333) -> Type | |
type Apply (Let6989586621680734290NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680734288 :: k) | |
type Apply (Let6989586621680734290MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680734288 :: k1) | |
type Apply (Let6989586621680734317NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680734315 :: k) | |
type Apply (Let6989586621680734317MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680734315 :: k1) | |
type Apply (Lambda_6989586621680640923Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680640921 :: k) | |
Defined in Data.Singletons.Prelude.Monoid | |
type Apply (Lambda_6989586621680641011Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680641009 :: k) | |
Defined in Data.Singletons.Prelude.Monoid | |
type Apply (Let6989586621680743203MfSym1 f6989586621680743201 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) (xs6989586621680743202 :: k) | |
type Apply (Let6989586621680743228MfSym1 f6989586621680743226 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680743227 :: k) | |
type Apply (Let6989586621680743203MfSym2 xs6989586621680743202 f6989586621680743201 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) (a6989586621680743204 :: k2) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Eval (FoldMap f ('Just x) :: a2 -> Type) | |
type Eval (FoldMap f ('Nothing :: Maybe a1) :: a2 -> Type) | |
type Eval (Foldr f y ('Just x) :: a2 -> Type) | |
type Eval (Foldr f y ('Nothing :: Maybe a1) :: a2 -> Type) | |
type Rep (Maybe a) | |
Defined in GHC.Generics | |
data Sing (b :: Maybe a) | |
type DemoteRep (Maybe a) | |
Defined in GHC.Generics | |
type MEmpty | |
Defined in Fcf.Class.Monoid | |
type Index (Maybe a) | |
Defined in Control.Lens.At | |
type IxValue (Maybe a) | |
Defined in Control.Lens.At | |
type Mempty | |
Defined in Data.Singletons.Prelude.Monoid | |
type Sing | |
Defined in Data.Singletons.Prelude.Instances | |
type Demote (Maybe a) | |
Defined in Data.Singletons.Prelude.Instances | |
type Element (Maybe a) | |
Defined in Universum.Container.Class | |
type TypeDocFieldDescriptions (Maybe a) | |
Defined in Michelson.Typed.Haskell.Doc | |
type ToT (Maybe a) | |
Defined in Michelson.Typed.Haskell.Value | |
type Rep1 Maybe | |
type Mconcat (arg0 :: [Maybe a]) | |
type Show_ (arg0 :: Maybe a) | |
type Sconcat (arg0 :: NonEmpty (Maybe a)) | |
type Mappend (arg1 :: Maybe a) (arg2 :: Maybe a) | |
type ShowList (arg1 :: [Maybe a]) arg2 | |
type (a2 :: Maybe a1) <> (a3 :: Maybe a1) | |
type Min (arg1 :: Maybe a) (arg2 :: Maybe a) | |
type Max (arg1 :: Maybe a) (arg2 :: Maybe a) | |
type (arg1 :: Maybe a) >= (arg2 :: Maybe a) | |
type (arg1 :: Maybe a) > (arg2 :: Maybe a) | |
type (arg1 :: Maybe a) <= (arg2 :: Maybe a) | |
type (arg1 :: Maybe a) < (arg2 :: Maybe a) | |
type Compare (a2 :: Maybe a1) (a3 :: Maybe a1) | |
type (x :: Maybe a) /= (y :: Maybe a) | |
type (a2 :: Maybe a1) == (b :: Maybe a1) | |
Defined in Data.Singletons.Prelude.Eq | |
type HKD Maybe (a :: Type) | |
Defined in Data.Vinyl.XRec | |
type ShowsPrec a2 (a3 :: Maybe a1) a4 | |
type (a2 :: Maybe a1) <> ('Nothing :: Maybe a1) | |
Defined in Fcf.Class.Monoid | |
type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621679913597 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679913600 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679913602 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
type Apply (FromMaybeSym1 a6989586621679913587 :: TyFun (Maybe a) a -> Type) (a6989586621679913588 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
type Apply (Compare_6989586621679803211Sym1 a6989586621679803209 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679803210 :: Maybe a) | |
type Apply (Maybe_Sym2 a6989586621679911983 a6989586621679911982 :: TyFun (Maybe a) b -> Type) (a6989586621679911984 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
type ('Nothing :: Maybe a) <> (b :: Maybe a) | |
Defined in Fcf.Class.Monoid | |
type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621679913576 :: [Maybe a]) | |
Defined in Data.Singletons.Prelude.Maybe | |
type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679913581 :: [a]) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679913581 :: [a]) = ListToMaybe a6989586621679913581 | |
type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679913584 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679913584 :: Maybe a) = MaybeToList a6989586621679913584 | |
type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (t6989586621680733519 :: Maybe a) | |
type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (t6989586621680733717 :: Maybe a) | |
type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (t6989586621680197019 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (t6989586621680634741 :: Maybe a) | |
type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (t6989586621680634764 :: Maybe a) | |
type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621680197016 :: Option a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680634738 :: First a) | |
Defined in Data.Singletons.Prelude.Monoid | |
type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680634761 :: Last a) | |
Defined in Data.Singletons.Prelude.Monoid | |
type Apply (FindSym1 a6989586621680320902 :: TyFun [a] (Maybe a) -> Type) (a6989586621680320903 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (FindIndexSym1 a6989586621680320878 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680320879 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (ElemIndexSym1 a6989586621680320894 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680320895 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (StripPrefixSym1 a6989586621680440231 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680440232 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym1 a6989586621680440231 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680440232 :: [a]) = StripPrefix a6989586621680440231 a6989586621680440232 | |
type Apply (TFHelper_6989586621680024604Sym1 a6989586621680024602 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680024603 :: Maybe a) | |
type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621681393563 :: f a) | |
Defined in Data.Singletons.Prelude.Applicative | |
type Apply (LookupSym1 a6989586621680320556 b :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621680320557 :: [(a, b)]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (Fmap_6989586621680024168Sym1 a6989586621680024166 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680024167 :: Maybe a) | |
type Apply (TFHelper_6989586621680024181Sym1 a6989586621680024179 b :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621680024180 :: Maybe b) | |
type Apply (TFHelper_6989586621680024329Sym1 a6989586621680024327 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680024328 :: Maybe a) | |
type Apply (TFHelper_6989586621680024359Sym1 a6989586621680024357 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680024358 :: Maybe b) | |
type Apply (TFHelper_6989586621680024514Sym1 a6989586621680024512 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680024513 :: Maybe b) | |
type Apply (FindSym1 a6989586621680742747 t :: TyFun (t a) (Maybe a) -> Type) (a6989586621680742748 :: t a) | |
type Apply (Traverse_6989586621680995062Sym1 a6989586621680995060 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621680995061 :: Maybe a) | |
type Apply (LiftA2_6989586621680024343Sym2 a6989586621680024341 a6989586621680024340 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621680024342 :: Maybe b) | |
type Apply (Let6989586621680743203MfSym3 a6989586621680743204 xs6989586621680743202 f6989586621680743201 :: TyFun (Maybe k3) (Maybe k2) -> Type) (a6989586621680743205 :: Maybe k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Eval (Init '[a2] :: Maybe [a1] -> Type) | |
type Eval (Init ('[] :: [a]) :: Maybe [a] -> Type) | |
type Eval (Tail (_a ': as) :: Maybe [a] -> Type) | |
type Eval (Tail ('[] :: [a]) :: Maybe [a] -> Type) | |
type Eval (Init (a2 ': (b ': as)) :: Maybe [a1] -> Type) | |
type Eval (Head (a2 ': _as) :: Maybe a1 -> Type) | |
type Eval (Head ('[] :: [a]) :: Maybe a -> Type) | |
type Eval (Last (a2 ': (b ': as)) :: Maybe a1 -> Type) | |
type Eval (Last '[a2] :: Maybe a1 -> Type) | |
type Eval (Last ('[] :: [a]) :: Maybe a -> Type) | |
type Apply (StripPrefixSym0 :: TyFun [a6989586621680438535] ([a6989586621680438535] ~> Maybe [a6989586621680438535]) -> Type) (a6989586621680440231 :: [a6989586621680438535]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym0 :: TyFun [a6989586621680438535] ([a6989586621680438535] ~> Maybe [a6989586621680438535]) -> Type) (a6989586621680440231 :: [a6989586621680438535]) = StripPrefixSym1 a6989586621680440231 | |
type Apply (TFHelper_6989586621680024604Sym0 :: TyFun (Maybe a6989586621679962888) (Maybe a6989586621679962888 ~> Maybe a6989586621679962888) -> Type) (a6989586621680024602 :: Maybe a6989586621679962888) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
type Apply (Compare_6989586621679803211Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) (a6989586621679803209 :: Maybe a3530822107858468865) | |
type ('Just a2 :: Maybe a1) <> ('Just b :: Maybe a1) | |
type Apply (ShowsPrec_6989586621680595739Sym1 a6989586621680595736 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type) (a6989586621680595737 :: Maybe a3530822107858468865) | |
Defined in Data.Singletons.Prelude.Show | |
type Apply (TFHelper_6989586621680024359Sym0 :: TyFun (Maybe a6989586621679962818) (Maybe b6989586621679962819 ~> Maybe b6989586621679962819) -> Type) (a6989586621680024357 :: Maybe a6989586621679962818) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024359Sym0 :: TyFun (Maybe a6989586621679962818) (Maybe b6989586621679962819 ~> Maybe b6989586621679962819) -> Type) (a6989586621680024357 :: Maybe a6989586621679962818) = TFHelper_6989586621680024359Sym1 a6989586621680024357 b6989586621679962819 :: TyFun (Maybe b6989586621679962819) (Maybe b6989586621679962819) -> Type | |
type Apply (TFHelper_6989586621680024502Sym0 :: TyFun (Maybe a6989586621679962836) ((a6989586621679962836 ~> Maybe b6989586621679962837) ~> Maybe b6989586621679962837) -> Type) (a6989586621680024500 :: Maybe a6989586621679962836) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024502Sym0 :: TyFun (Maybe a6989586621679962836) ((a6989586621679962836 ~> Maybe b6989586621679962837) ~> Maybe b6989586621679962837) -> Type) (a6989586621680024500 :: Maybe a6989586621679962836) = TFHelper_6989586621680024502Sym1 a6989586621680024500 b6989586621679962837 :: TyFun (a6989586621679962836 ~> Maybe b6989586621679962837) (Maybe b6989586621679962837) -> Type | |
type Apply (TFHelper_6989586621680024514Sym0 :: TyFun (Maybe a6989586621679962838) (Maybe b6989586621679962839 ~> Maybe b6989586621679962839) -> Type) (a6989586621680024512 :: Maybe a6989586621679962838) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024514Sym0 :: TyFun (Maybe a6989586621679962838) (Maybe b6989586621679962839 ~> Maybe b6989586621679962839) -> Type) (a6989586621680024512 :: Maybe a6989586621679962838) = TFHelper_6989586621680024514Sym1 a6989586621680024512 b6989586621679962839 :: TyFun (Maybe b6989586621679962839) (Maybe b6989586621679962839) -> Type | |
type Apply (TFHelper_6989586621680024329Sym0 :: TyFun (Maybe (a6989586621679962813 ~> b6989586621679962814)) (Maybe a6989586621679962813 ~> Maybe b6989586621679962814) -> Type) (a6989586621680024327 :: Maybe (a6989586621679962813 ~> b6989586621679962814)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024329Sym0 :: TyFun (Maybe (a6989586621679962813 ~> b6989586621679962814)) (Maybe a6989586621679962813 ~> Maybe b6989586621679962814) -> Type) (a6989586621680024327 :: Maybe (a6989586621679962813 ~> b6989586621679962814)) = TFHelper_6989586621680024329Sym1 a6989586621680024327 | |
type Apply (LiftA2_6989586621680024343Sym1 a6989586621680024340 :: TyFun (Maybe a6989586621679962815) (Maybe b6989586621679962816 ~> Maybe c6989586621679962817) -> Type) (a6989586621680024341 :: Maybe a6989586621679962815) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
type Apply (Let6989586621680743228MfSym2 xs6989586621680743227 f6989586621680743226 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680743229 :: Maybe k2) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Eval (FindIndex p (a2 ': as) :: Maybe Nat -> Type) | |
type Eval (FindIndex _p ('[] :: [a]) :: Maybe Nat -> Type) | |
type Eval (NumIter a s :: Maybe (k, Nat) -> Type) | |
type Eval (Find p (a2 ': as) :: Maybe a1 -> Type) | |
type Eval (Find _p ('[] :: [a]) :: Maybe a -> Type) | |
type Eval (Lookup a as :: Maybe b -> Type) | |
type Eval (Map f ('Just a3) :: Maybe a2 -> Type) | |
type Eval (Map f ('Nothing :: Maybe a) :: Maybe b -> Type) | |
type Eval ('Just x <|> _1 :: Maybe a -> Type) | |
type Eval (('Nothing :: Maybe a) <|> m :: Maybe a -> Type) | |
type Apply (TFHelper_6989586621680024502Sym1 a6989586621680024500 b :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621680024501 :: a ~> Maybe b) | |
type Apply (FindSym0 :: TyFun (a6989586621680316354 ~> Bool) ([a6989586621680316354] ~> Maybe a6989586621680316354) -> Type) (a6989586621680320902 :: a6989586621680316354 ~> Bool) | |
type Apply (FindIndexSym0 :: TyFun (a6989586621680316351 ~> Bool) ([a6989586621680316351] ~> Maybe Nat) -> Type) (a6989586621680320878 :: a6989586621680316351 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (Fmap_6989586621680024168Sym0 :: TyFun (a6989586621679962807 ~> b6989586621679962808) (Maybe a6989586621679962807 ~> Maybe b6989586621679962808) -> Type) (a6989586621680024166 :: a6989586621679962807 ~> b6989586621679962808) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
type Apply (MapMaybeSym0 :: TyFun (a6989586621679913396 ~> Maybe b6989586621679913397) ([a6989586621679913396] ~> [b6989586621679913397]) -> Type) (a6989586621679913557 :: a6989586621679913396 ~> Maybe b6989586621679913397) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (MapMaybeSym0 :: TyFun (a6989586621679913396 ~> Maybe b6989586621679913397) ([a6989586621679913396] ~> [b6989586621679913397]) -> Type) (a6989586621679913557 :: a6989586621679913396 ~> Maybe b6989586621679913397) = MapMaybeSym1 a6989586621679913557 | |
type Apply (UnfoldrSym0 :: TyFun (b6989586621680316410 ~> Maybe (a6989586621680316411, b6989586621680316410)) (b6989586621680316410 ~> [a6989586621680316411]) -> Type) (a6989586621680321322 :: b6989586621680316410 ~> Maybe (a6989586621680316411, b6989586621680316410)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (UnfoldrSym0 :: TyFun (b6989586621680316410 ~> Maybe (a6989586621680316411, b6989586621680316410)) (b6989586621680316410 ~> [a6989586621680316411]) -> Type) (a6989586621680321322 :: b6989586621680316410 ~> Maybe (a6989586621680316411, b6989586621680316410)) = UnfoldrSym1 a6989586621680321322 | |
type Apply (FindSym0 :: TyFun (a6989586621680742294 ~> Bool) (t6989586621680742293 a6989586621680742294 ~> Maybe a6989586621680742294) -> Type) (a6989586621680742747 :: a6989586621680742294 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym0 :: TyFun (a6989586621680742294 ~> Bool) (t6989586621680742293 a6989586621680742294 ~> Maybe a6989586621680742294) -> Type) (a6989586621680742747 :: a6989586621680742294 ~> Bool) = FindSym1 a6989586621680742747 t6989586621680742293 :: TyFun (t6989586621680742293 a6989586621680742294) (Maybe a6989586621680742294) -> Type | |
type Apply (Traverse_6989586621680995062Sym0 :: TyFun (a6989586621680988968 ~> f6989586621680988967 b6989586621680988969) (Maybe a6989586621680988968 ~> f6989586621680988967 (Maybe b6989586621680988969)) -> Type) (a6989586621680995060 :: a6989586621680988968 ~> f6989586621680988967 b6989586621680988969) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680995062Sym0 :: TyFun (a6989586621680988968 ~> f6989586621680988967 b6989586621680988969) (Maybe a6989586621680988968 ~> f6989586621680988967 (Maybe b6989586621680988969)) -> Type) (a6989586621680995060 :: a6989586621680988968 ~> f6989586621680988967 b6989586621680988969) = Traverse_6989586621680995062Sym1 a6989586621680995060 | |
type Apply (LiftA2_6989586621680024343Sym0 :: TyFun (a6989586621679962815 ~> (b6989586621679962816 ~> c6989586621679962817)) (Maybe a6989586621679962815 ~> (Maybe b6989586621679962816 ~> Maybe c6989586621679962817)) -> Type) (a6989586621680024340 :: a6989586621679962815 ~> (b6989586621679962816 ~> c6989586621679962817)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621680024343Sym0 :: TyFun (a6989586621679962815 ~> (b6989586621679962816 ~> c6989586621679962817)) (Maybe a6989586621679962815 ~> (Maybe b6989586621679962816 ~> Maybe c6989586621679962817)) -> Type) (a6989586621680024340 :: a6989586621679962815 ~> (b6989586621679962816 ~> c6989586621679962817)) = LiftA2_6989586621680024343Sym1 a6989586621680024340 | |
type Apply (Maybe_Sym1 a6989586621679911982 a6989586621679911965 :: TyFun (a6989586621679911965 ~> b6989586621679911964) (Maybe a6989586621679911965 ~> b6989586621679911964) -> Type) (a6989586621679911983 :: a6989586621679911965 ~> b6989586621679911964) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym1 a6989586621679911982 a6989586621679911965 :: TyFun (a6989586621679911965 ~> b6989586621679911964) (Maybe a6989586621679911965 ~> b6989586621679911964) -> Type) (a6989586621679911983 :: a6989586621679911965 ~> b6989586621679911964) = Maybe_Sym2 a6989586621679911982 a6989586621679911983 | |
type Apply (Let6989586621679913564RsSym0 :: TyFun (a6989586621679913396 ~> Maybe k1) (TyFun k (TyFun [a6989586621679913396] [k1] -> Type) -> Type) -> Type) (f6989586621679913561 :: a6989586621679913396 ~> Maybe k1) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Let6989586621679913564RsSym0 :: TyFun (a6989586621679913396 ~> Maybe k1) (TyFun k (TyFun [a6989586621679913396] [k1] -> Type) -> Type) -> Type) (f6989586621679913561 :: a6989586621679913396 ~> Maybe k1) = Let6989586621679913564RsSym1 f6989586621679913561 :: TyFun k (TyFun [a6989586621679913396] [k1] -> Type) -> Type | |
type Apply (Let6989586621680743203MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680743201 :: k2 ~> (k3 ~> k2)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680743203MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680743201 :: k2 ~> (k3 ~> k2)) = Let6989586621680743203MfSym1 f6989586621680743201 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type | |
type Apply (Let6989586621680743228MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680743226 :: k2 ~> (k3 ~> k3)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680743228MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680743226 :: k2 ~> (k3 ~> k3)) = Let6989586621680743228MfSym1 f6989586621680743226 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type | |
type Apply (Lambda_6989586621680640923Sym1 a6989586621680640921 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680640922 :: k1 ~> First a) | |
type Apply (Lambda_6989586621680641011Sym1 a6989586621680641009 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680641010 :: k1 ~> Last a) | |
type ToT (NamedF Maybe a name) | |
type Unwrappable (NamedF Maybe a name) Source # | |
Defined in Lorentz.Wrappable |
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,
is a safer alternative to the
Proxy
:: Proxy
a
idiom.undefined
:: a
>>>
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
Instances
Generic1 (Proxy :: k -> Type) | Since: base-4.6.0.0 |
Monad (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Functor (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Applicative (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Foldable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Foldable fold :: Monoid m => Proxy m -> m # foldMap :: Monoid m => (a -> m) -> Proxy a -> m # foldMap' :: Monoid m => (a -> m) -> Proxy a -> m # foldr :: (a -> b -> b) -> b -> Proxy a -> b # foldr' :: (a -> b -> b) -> b -> Proxy a -> b # foldl :: (b -> a -> b) -> b -> Proxy a -> b # foldl' :: (b -> a -> b) -> b -> Proxy a -> b # foldr1 :: (a -> a -> a) -> Proxy a -> a # foldl1 :: (a -> a -> a) -> Proxy a -> a # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # | |
Traversable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Representable (Proxy :: Type -> Type) | |
ToJSON1 (Proxy :: Type -> Type) | |
Defined in Data.Aeson.Types.ToJSON 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 # | |
Alternative (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
MonadPlus (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
Eq1 (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
Ord1 (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
Read1 (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
Show1 (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
NFData1 (Proxy :: Type -> Type) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
Hashable1 (Proxy :: Type -> Type) | |
Defined in Data.Hashable.Class | |
Bounded (Proxy t) | Since: base-4.7.0.0 |
Enum (Proxy s) | Since: base-4.7.0.0 |
Eq (Proxy s) | Since: base-4.7.0.0 |
Ord (Proxy s) | Since: base-4.7.0.0 |
Read (Proxy t) | Since: base-4.7.0.0 |
Show (Proxy s) | Since: base-4.7.0.0 |
Ix (Proxy s) | Since: base-4.7.0.0 |
Defined in Data.Proxy | |
Generic (Proxy t) | Since: base-4.6.0.0 |
Semigroup (Proxy s) | Since: base-4.9.0.0 |
Monoid (Proxy s) | Since: base-4.7.0.0 |
Hashable (Proxy a) | |
Defined in Data.Hashable.Class | |
ToJSON (Proxy a) | |
Defined in Data.Aeson.Types.ToJSON | |
NFData (Proxy a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
type Rep1 (Proxy :: k -> Type) | |
type Rep (Proxy :: Type -> Type) | |
type Rep (Proxy t) | |
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 #