| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Lorentz.Prelude
Description
Commonly used parts of regular Prelude.
Synopsis
- ($) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
- (.) :: (b -> c) -> (a -> b) -> a -> c
- 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 map ($ 0) xszipWith ($) 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 <= xx < y=x <= y && x /= yx > y=y < xx < y=compare x y == LTx > y=compare x y == GTx == y=compare x y == EQmin x y == if x <= y then x else y=Truemax 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
The class of semigroups (types with an associative binary operation).
Instances should satisfy the following:
Since: base-4.9.0.0
Minimal complete definition
Methods
(<>) :: 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 stimesIdempotentstimes =
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)<>zSemigrouplaw)- Concatenation
mconcat=foldr(<>)mempty
The method names refer to the monoid of lists under concatenation, but there are many other instances.
Some types can be viewed as a monoid in more than one way,
e.g. both addition and multiplication on numbers.
In such cases we often define newtypes and make those instances
of Monoid, e.g. Sum and Product.
NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.
Minimal complete definition
Methods
Identity of mappend
An associative operation
NOTE: This method is redundant and has the default
implementation 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≡idto.from≡id
Instances
A space efficient, packed, unboxed Unicode text type.
Instances
The Either type represents values with two possibilities: a value of
type Either a bLeft aRight 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 Either String IntString or an Int. The Left constructor can be used only on
Strings, and the Right constructor can be used only on Ints:
>>>let s = Left "foo" :: Either String Int>>>sLeft "foo">>>let n = Right 3 :: Either String Int>>>nRight 3>>>:type ss :: Either String Int>>>:type nn :: 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) sLeft "foo">>>fmap (*2) nRight 6
The Monad instance for Either allows us to chain together multiple
actions which may fail, and fail overall if any of the individual
steps failed. First we'll write a function that can either parse an
Int from a Char, or fail.
>>>import Data.Char ( digitToInt, isDigit )>>>:{let parseEither :: Char -> Either String Int parseEither c | isDigit c = Right (digitToInt c) | otherwise = Left "parse error">>>:}
The following should work, since both '1' and '2' can be
parsed as Ints.
>>>:{let parseMultiple :: Either String Int parseMultiple = do x <- parseEither '1' y <- parseEither '2' return (x + y)>>>:}
>>>parseMultipleRight 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)>>>:}
>>>parseMultipleLeft "parse error"
Instances
| Arbitrary2 Either | |
Defined in Test.QuickCheck.Arbitrary Methods liftArbitrary2 :: Gen a -> Gen b -> Gen (Either a b) # liftShrink2 :: (a -> [a]) -> (b -> [b]) -> Either a b -> [Either a b] # | |
| ToJSON2 Either | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON2 :: (a -> Value) -> ([a] -> Value) -> (b -> Value) -> ([b] -> Value) -> Either a b -> Value # liftToJSONList2 :: (a -> Value) -> ([a] -> Value) -> (b -> Value) -> ([b] -> Value) -> [Either a b] -> Value # liftToEncoding2 :: (a -> Encoding) -> ([a] -> Encoding) -> (b -> Encoding) -> ([b] -> Encoding) -> Either a b -> Encoding # liftToEncodingList2 :: (a -> Encoding) -> ([a] -> Encoding) -> (b -> Encoding) -> ([b] -> Encoding) -> [Either a b] -> Encoding # | |
| Bifunctor Either | Since: base-4.8.0.0 |
| 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 Methods liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (Either a b) # liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Either a b] # liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Either a b) # liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Either a b] # | |
| Show2 Either | Since: base-4.9.0.0 |
| 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 Methods ins :: () :- Applicative (Either a) # | |
| MonadError e (Either e) | |
Defined in Control.Monad.Error.Class | |
| 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 Methods fold :: Monoid m => Either a m -> m # foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # toList :: Either a a0 -> [a0] # 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 |
Defined in Data.Traversable | |
| Arbitrary a => Arbitrary1 (Either a) | |
Defined in Test.QuickCheck.Arbitrary Methods liftArbitrary :: Gen a0 -> Gen (Either a a0) # liftShrink :: (a0 -> [a0]) -> Either a a0 -> [Either a a0] # | |
| ToJSON a => ToJSON1 (Either a) | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a0 -> Value) -> ([a0] -> Value) -> Either a a0 -> Value # liftToJSONList :: (a0 -> Value) -> ([a0] -> Value) -> [Either a a0] -> Value # liftToEncoding :: (a0 -> Encoding) -> ([a0] -> Encoding) -> Either a a0 -> Encoding # liftToEncodingList :: (a0 -> Encoding) -> ([a0] -> Encoding) -> [Either a a0] -> Encoding # | |
| Eq a => Eq1 (Either a) | Since: base-4.9.0.0 |
| 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 Methods liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (Either a a0) # liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [Either a a0] # liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (Either a a0) # liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [Either a a0] # | |
| Show a => Show1 (Either a) | Since: base-4.9.0.0 |
| MonadFailure (Either a) | |
| e ~ SomeException => MonadMask (Either e) | Since: exceptions-0.8.3 |
Defined in Control.Monad.Catch | |
| e ~ SomeException => MonadCatch (Either e) | Since: exceptions-0.8.3 |
| e ~ SomeException => MonadThrow (Either e) | |
Defined in Control.Monad.Catch | |
| NFData a => NFData1 (Either a) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable a => Hashable1 (Either a) | |
Defined in Data.Hashable.Class | |
| Apply (Either a) | |
| Bind (Either a) | |
| PTraversable (Either a) | |
| STraversable (Either a) | |
Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a0 (f :: Type -> Type) b (t1 :: a0 ~> f b) (t2 :: Either a a0). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: forall (f :: Type -> Type) a0 (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 Methods 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 Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) # (%<*>) :: forall a b (t1 :: Either e (a ~> b)) (t2 :: Either e a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2) # sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Either e a) (t3 :: Either e b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3) # (%*>) :: forall a b (t1 :: Either e a) (t2 :: Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2) # (%<*) :: forall a b (t1 :: Either e a) (t2 :: Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2) # | |
| SMonad (Either e) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods (%>>=) :: forall a b (t1 :: Either e a) (t2 :: a ~> Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>=@#@$) t1) t2) # (%>>) :: forall a b (t1 :: Either e a) (t2 :: Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>@#@$) t1) t2) # sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) # | |
| Generic1 (Either a :: Type -> Type) | Since: base-4.6.0.0 |
| MonadBaseControl (Either e) (Either e) | |
| 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 |
| (Data a, Data b) => Data (Either a b) | Since: base-4.0.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Either a b -> c (Either a b) # gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Either a b) # toConstr :: Either a b -> Constr # dataTypeOf :: Either a b -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Either a b)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Either a b)) # gmapT :: (forall b0. Data b0 => b0 -> b0) -> Either a b -> Either a b # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Either a b -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Either a b -> r # gmapQ :: (forall d. Data d => d -> u) -> Either a b -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Either a b -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # | |
| (Ord a, Ord b) => Ord (Either a b) | Since: base-2.1 |
| (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) | |
| (Arbitrary a, Arbitrary b) => Arbitrary (Either a b) | |
| (CoArbitrary a, CoArbitrary b) => CoArbitrary (Either a b) | |
Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Either a b -> Gen b0 -> Gen b0 # | |
| (NFData a, NFData b) => NFData (Either a b) | |
Defined in Control.DeepSeq | |
| (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 | |
| PolyTypeHasDocC '[l, r] => TypeHasDoc (Either l r) | |
Defined in Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Either l r) :: FieldDescriptions # Methods typeDocName :: Proxy (Either l r) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Either l r) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Either l r) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Either l r) # typeDocMichelsonRep :: TypeDocMichelsonRep (Either l r) # | |
| (IsoValue l, IsoValue r) => IsoValue (Either l r) | |
| (TypeError (DisallowInstance "Either") :: Constraint) => Container (Either a b) | |
Defined in Universum.Container.Class Methods 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)) # | |
| PShow (Either a b) | |
| (SShow a, SShow b) => SShow (Either a b) | |
Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t1 :: Nat) (t2 :: Either a b) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) # sShow_ :: forall (t :: Either a b). Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: forall (t1 :: [Either a b]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) # | |
| PSemigroup (Either a b) | |
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 Methods sCompare :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| (SEq a, SEq b) => SEq (Either a b) | |
| PEq (Either a b) | |
| (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 | |
| SingI (RightsSym0 :: TyFun [Either a b] [b] -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods 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 Methods sing :: Sing IsRightSym0 # | |
| SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods 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 | |
| SuppressUnusedWarnings (RightsSym0 :: TyFun [Either a6989586621680725238 b6989586621680725239] [b6989586621680725239] -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (PartitionEithersSym0 :: TyFun [Either a6989586621680725236 b6989586621680725237] ([a6989586621680725236], [b6989586621680725237]) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LeftsSym0 :: TyFun [Either a6989586621680725240 b6989586621680725241] [a6989586621680725240] -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a6989586621680725232 b6989586621680725233) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a6989586621680725234 b6989586621680725235) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803285Sym0 :: TyFun (Either a6989586621679091038 b6989586621679091039) (Either a6989586621679091038 b6989586621679091039 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595791Sym0 :: TyFun Nat (Either a6989586621679091038 b6989586621679091039 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680024475Sym0 :: TyFun a6989586621679962808 (Either e6989586621680023557 a6989586621679962808) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (RightSym0 :: TyFun b6989586621679091039 (Either a6989586621679091038 b6989586621679091039) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LeftSym0 :: TyFun a6989586621679091038 (Either a6989586621679091038 b6989586621679091039) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680187944ASym0 :: TyFun k1 (Either a6989586621679091038 k1) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| (a ~ a', b ~ b') => Each (Either a a') (Either b b') a b | Since: microlens-0.4.11 |
| SingI (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing Either_Sym0 # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595791Sym1 a6989586621680595788 a6989586621679091038 b6989586621679091039 :: TyFun (Either a6989586621679091038 b6989586621679091039) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024585Sym0 :: TyFun (Either e6989586621680023574 a6989586621679962832) ((a6989586621679962832 ~> Either e6989586621680023574 b6989586621679962833) ~> Either e6989586621680023574 b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024485Sym0 :: TyFun (Either e6989586621680023557 (a6989586621679962809 ~> b6989586621679962810)) (Either e6989586621680023557 a6989586621679962809 ~> Either e6989586621680023557 b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803285Sym1 a6989586621679803283 :: TyFun (Either a6989586621679091038 b6989586621679091039) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024288Sym0 :: TyFun a6989586621679962805 (Either a6989586621680023545 b6989586621679962806 ~> Either a6989586621680023545 a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680024267Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Either a6989586621680023545 a6989586621679962803 ~> Either a6989586621680023545 b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym0 :: TyFun (a6989586621680723758 ~> c6989586621680723759) ((b6989586621680723760 ~> c6989586621680723759) ~> (Either a6989586621680723758 b6989586621680723760 ~> c6989586621680723759)) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI (Either_Sym1 d b :: TyFun (b ~> c) (Either a b ~> c) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing (Either_Sym1 d b) # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024485Sym1 a6989586621680024483 :: TyFun (Either e6989586621680023557 a6989586621679962809) (Either e6989586621680023557 b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024288Sym1 a6989586621680024286 a6989586621680023545 b6989586621679962806 :: TyFun (Either a6989586621680023545 b6989586621679962806) (Either a6989586621680023545 a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680024267Sym1 a6989586621680024265 a6989586621680023545 :: TyFun (Either a6989586621680023545 a6989586621679962803) (Either a6989586621680023545 b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995098Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Either a6989586621680994521 a6989586621680988964 ~> f6989586621680988963 (Either a6989586621680994521 b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024585Sym1 a6989586621680024583 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Either e6989586621680023574 b6989586621679962833) (Either e6989586621680023574 b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym1 a6989586621680723794 b6989586621680723760 :: TyFun (b6989586621680723760 ~> c6989586621680723759) (Either a6989586621680723758 b6989586621680723760 ~> c6989586621680723759) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| (SingI d1, SingI d2) => SingI (Either_Sym2 d1 d2 :: TyFun (Either a b) c -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing (Either_Sym2 d1 d2) # | |
| SuppressUnusedWarnings (Traverse_6989586621680995098Sym1 a6989586621680995096 a6989586621680994521 :: TyFun (Either a6989586621680994521 a6989586621680988964) (f6989586621680988963 (Either a6989586621680994521 b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym2 a6989586621680723795 a6989586621680723794 :: TyFun (Either a6989586621680723758 b6989586621680723760) c6989586621680723759 -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| (Functor f, Functor g) => Functor (Lift Either f g) | |
| type MapM (arg1 :: a0 ~> m0 b0) (arg2 :: Either a a0) | |
| type Traverse (a2 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a3 :: Either a1 a6989586621680988964) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a2 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a3 :: Either a1 a6989586621680988964) = Apply (Apply (Traverse_6989586621680995098Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Either a1 a6989586621680988964 ~> f6989586621680988963 (Either a1 b6989586621680988965)) -> Type) a2) a3 | |
| type LiftA2 (arg1 :: a0 ~> (b0 ~> c0)) (arg2 :: Either e a0) (arg3 :: Either e b0) | |
| type FoldMap (a2 :: a6989586621680742384 ~> k2) (a3 :: Either a1 a6989586621680742384) | |
| type Fmap (a2 :: a6989586621679962803 ~> b6989586621679962804) (a3 :: Either a1 a6989586621679962803) | |
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 :: a6989586621680742385 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Either a1 a6989586621680742385) | |
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 b6989586621679962806) | |
| type Apply (ShowsPrec_6989586621680595791Sym0 :: TyFun Nat (Either a6989586621679091038 b6989586621679091039 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680595788 :: Nat) | |
Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680595791Sym0 :: TyFun Nat (Either a6989586621679091038 b6989586621679091039 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680595788 :: Nat) = ShowsPrec_6989586621680595791Sym1 a6989586621680595788 a6989586621679091038 b6989586621679091039 :: TyFun (Either a6989586621679091038 b6989586621679091039) (Symbol ~> Symbol) -> Type | |
| type Apply (Pure_6989586621680024475Sym0 :: TyFun a (Either e6989586621680023557 a) -> Type) (a6989586621680024474 :: a) | |
| type Apply (LeftSym0 :: TyFun a (Either a b6989586621679091039) -> Type) (t6989586621679707106 :: a) | |
| type Apply (RightSym0 :: TyFun b (Either a6989586621679091038 b) -> Type) (t6989586621679707108 :: b) | |
| type Apply (Let6989586621680187944ASym0 :: TyFun k1 (Either a6989586621679091038 k1) -> Type) (wild_69895866216801875286989586621680187943 :: k1) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (TFHelper_6989586621680024288Sym0 :: TyFun a6989586621679962805 (Either a6989586621680023545 b6989586621679962806 ~> Either a6989586621680023545 a6989586621679962805) -> Type) (a6989586621680024286 :: a6989586621679962805) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024288Sym0 :: TyFun a6989586621679962805 (Either a6989586621680023545 b6989586621679962806 ~> Either a6989586621680023545 a6989586621679962805) -> Type) (a6989586621680024286 :: a6989586621679962805) = TFHelper_6989586621680024288Sym1 a6989586621680024286 a6989586621680023545 b6989586621679962806 :: TyFun (Either a6989586621680023545 b6989586621679962806) (Either a6989586621680023545 a6989586621679962805) -> Type | |
| type Failure (Either a) | |
Defined in Basement.Monad | |
| type StM (Either e) a | |
Defined in Control.Monad.Trans.Control | |
| 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 a6989586621680742397) | |
| type Null (a2 :: Either a1 a6989586621680742396) | |
| 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 (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: Either e a6989586621679962809) | |
Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Either e (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: Either e a6989586621679962809) = Apply (Apply (TFHelper_6989586621680024485Sym0 :: TyFun (Either e (a6989586621679962809 ~> b6989586621679962810)) (Either e a6989586621679962809 ~> Either e b6989586621679962810) -> Type) a1) a2 | |
| type (arg1 :: Either e a0) >> (arg2 :: Either e b0) | |
| type (a1 :: Either e a6989586621679962832) >>= (a2 :: a6989586621679962832 ~> Either e b6989586621679962833) | |
Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Either e a6989586621679962832) >>= (a2 :: a6989586621679962832 ~> Either e b6989586621679962833) = Apply (Apply (TFHelper_6989586621680024585Sym0 :: TyFun (Either e a6989586621679962832) ((a6989586621679962832 ~> Either e b6989586621679962833) ~> Either e b6989586621679962833) -> 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) (a6989586621680725507 :: [Either a b]) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (LeftsSym0 :: TyFun [Either a b] [a] -> Type) (a6989586621680725512 :: [Either a b]) | |
| type Apply (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) (a6989586621680725487 :: [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 TypeDocFieldDescriptions (Either l r) | |
Defined in Michelson.Typed.Haskell.Doc | |
| type ToT (Either l r) | |
Defined in Michelson.Typed.Haskell.Value | |
| type Element (Either a b) | |
Defined in Universum.Container.Class | |
| type Demote (Either a b) | |
| 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) (a6989586621680725481 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680725483 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (Compare_6989586621679803285Sym1 a6989586621679803283 :: TyFun (Either a b) Ordering -> Type) (a6989586621679803284 :: Either a b) | |
| type Apply (Either_Sym2 a6989586621680723795 a6989586621680723794 :: TyFun (Either a b) c -> Type) (a6989586621680723796 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (Traverse_6989586621680995098Sym1 a6989586621680995096 a2 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type) (a6989586621680995097 :: Either a2 a1) | |
| type Apply (Compare_6989586621679803285Sym0 :: TyFun (Either a6989586621679091038 b6989586621679091039) (Either a6989586621679091038 b6989586621679091039 ~> Ordering) -> Type) (a6989586621679803283 :: Either a6989586621679091038 b6989586621679091039) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679803285Sym0 :: TyFun (Either a6989586621679091038 b6989586621679091039) (Either a6989586621679091038 b6989586621679091039 ~> Ordering) -> Type) (a6989586621679803283 :: Either a6989586621679091038 b6989586621679091039) = Compare_6989586621679803285Sym1 a6989586621679803283 | |
| type Apply (ShowsPrec_6989586621680595791Sym1 a6989586621680595788 a6989586621679091038 b6989586621679091039 :: TyFun (Either a6989586621679091038 b6989586621679091039) (Symbol ~> Symbol) -> Type) (a6989586621680595789 :: Either a6989586621679091038 b6989586621679091039) | |
Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680595791Sym1 a6989586621680595788 a6989586621679091038 b6989586621679091039 :: TyFun (Either a6989586621679091038 b6989586621679091039) (Symbol ~> Symbol) -> Type) (a6989586621680595789 :: Either a6989586621679091038 b6989586621679091039) = ShowsPrec_6989586621680595791Sym2 a6989586621680595788 a6989586621680595789 | |
| type Apply (TFHelper_6989586621680024485Sym0 :: TyFun (Either e6989586621680023557 (a6989586621679962809 ~> b6989586621679962810)) (Either e6989586621680023557 a6989586621679962809 ~> Either e6989586621680023557 b6989586621679962810) -> Type) (a6989586621680024483 :: Either e6989586621680023557 (a6989586621679962809 ~> b6989586621679962810)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024485Sym0 :: TyFun (Either e6989586621680023557 (a6989586621679962809 ~> b6989586621679962810)) (Either e6989586621680023557 a6989586621679962809 ~> Either e6989586621680023557 b6989586621679962810) -> Type) (a6989586621680024483 :: Either e6989586621680023557 (a6989586621679962809 ~> b6989586621679962810)) = TFHelper_6989586621680024485Sym1 a6989586621680024483 | |
| type Apply (TFHelper_6989586621680024585Sym0 :: TyFun (Either e6989586621680023574 a6989586621679962832) ((a6989586621679962832 ~> Either e6989586621680023574 b6989586621679962833) ~> Either e6989586621680023574 b6989586621679962833) -> Type) (a6989586621680024583 :: Either e6989586621680023574 a6989586621679962832) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024585Sym0 :: TyFun (Either e6989586621680023574 a6989586621679962832) ((a6989586621679962832 ~> Either e6989586621680023574 b6989586621679962833) ~> Either e6989586621680023574 b6989586621679962833) -> Type) (a6989586621680024583 :: Either e6989586621680023574 a6989586621679962832) = TFHelper_6989586621680024585Sym1 a6989586621680024583 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Either e6989586621680023574 b6989586621679962833) (Either e6989586621680023574 b6989586621679962833) -> Type | |
| type Apply (Fmap_6989586621680024267Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Either a6989586621680023545 a6989586621679962803 ~> Either a6989586621680023545 b6989586621679962804) -> Type) (a6989586621680024265 :: a6989586621679962803 ~> b6989586621679962804) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621680024267Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Either a6989586621680023545 a6989586621679962803 ~> Either a6989586621680023545 b6989586621679962804) -> Type) (a6989586621680024265 :: a6989586621679962803 ~> b6989586621679962804) = Fmap_6989586621680024267Sym1 a6989586621680024265 a6989586621680023545 :: TyFun (Either a6989586621680023545 a6989586621679962803) (Either a6989586621680023545 b6989586621679962804) -> Type | |
| type Apply (Either_Sym0 :: TyFun (a6989586621680723758 ~> c6989586621680723759) ((b6989586621680723760 ~> c6989586621680723759) ~> (Either a6989586621680723758 b6989586621680723760 ~> c6989586621680723759)) -> Type) (a6989586621680723794 :: a6989586621680723758 ~> c6989586621680723759) | |
Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym0 :: TyFun (a6989586621680723758 ~> c6989586621680723759) ((b6989586621680723760 ~> c6989586621680723759) ~> (Either a6989586621680723758 b6989586621680723760 ~> c6989586621680723759)) -> Type) (a6989586621680723794 :: a6989586621680723758 ~> c6989586621680723759) = Either_Sym1 a6989586621680723794 b6989586621680723760 :: TyFun (b6989586621680723760 ~> c6989586621680723759) (Either a6989586621680723758 b6989586621680723760 ~> c6989586621680723759) -> Type | |
| type Apply (Fmap_6989586621680024267Sym1 a6989586621680024265 a2 :: TyFun (Either a2 a1) (Either a2 b) -> Type) (a6989586621680024266 :: Either a2 a1) | |
| type Apply (TFHelper_6989586621680024288Sym1 a6989586621680024286 a2 b :: TyFun (Either a2 b) (Either a2 a1) -> Type) (a6989586621680024287 :: Either a2 b) | |
| type Apply (TFHelper_6989586621680024485Sym1 a6989586621680024483 :: TyFun (Either e a) (Either e b) -> Type) (a6989586621680024484 :: Either e a) | |
| type Apply (Traverse_6989586621680995098Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Either a6989586621680994521 a6989586621680988964 ~> f6989586621680988963 (Either a6989586621680994521 b6989586621680988965)) -> Type) (a6989586621680995096 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680995098Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Either a6989586621680994521 a6989586621680988964 ~> f6989586621680988963 (Either a6989586621680994521 b6989586621680988965)) -> Type) (a6989586621680995096 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) = Traverse_6989586621680995098Sym1 a6989586621680995096 a6989586621680994521 :: TyFun (Either a6989586621680994521 a6989586621680988964) (f6989586621680988963 (Either a6989586621680994521 b6989586621680988965)) -> Type | |
| type Apply (TFHelper_6989586621680024585Sym1 a6989586621680024583 b :: TyFun (a ~> Either e b) (Either e b) -> Type) (a6989586621680024584 :: a ~> Either e b) | |
| type Apply (Either_Sym1 a6989586621680723794 b6989586621680723760 :: TyFun (b6989586621680723760 ~> c6989586621680723759) (Either a6989586621680723758 b6989586621680723760 ~> c6989586621680723759) -> Type) (a6989586621680723795 :: b6989586621680723760 ~> c6989586621680723759) | |
Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym1 a6989586621680723794 b6989586621680723760 :: TyFun (b6989586621680723760 ~> c6989586621680723759) (Either a6989586621680723758 b6989586621680723760 ~> c6989586621680723759) -> Type) (a6989586621680723795 :: b6989586621680723760 ~> c6989586621680723759) = Either_Sym2 a6989586621680723794 a6989586621680723795 | |
| 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
Maybe aa (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 Methods fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldMap' :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # 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 |
| Arbitrary1 Maybe | |
Defined in Test.QuickCheck.Arbitrary | |
| ToJSON1 Maybe | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Maybe a -> Value # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Maybe a] -> Value # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Maybe a -> Encoding # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Maybe a] -> Encoding # | |
| 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 | |
| MonadThrow Maybe | |
Defined in Control.Monad.Catch | |
| NFData1 Maybe | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable1 Maybe | |
Defined in Data.Hashable.Class | |
| Apply Maybe | |
| KnownNamedFunctor Maybe | |
Defined in Util.Named | |
| InjValue Maybe | |
Defined in Named.Internal | |
| Bind Maybe | |
| PTraversable Maybe | |
| STraversable Maybe | |
Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Maybe a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: forall (f :: Type -> Type) a (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 Methods 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 Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) # (%<*>) :: forall a b (t1 :: Maybe (a ~> b)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2) # sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Maybe a) (t3 :: Maybe b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3) # (%*>) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2) # (%<*) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2) # | |
| SMonad Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods (%>>=) :: forall a b (t1 :: Maybe a) (t2 :: a ~> Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>=@#@$) t1) t2) # (%>>) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>@#@$) t1) t2) # sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) # | |
| SAlternative Maybe | |
| SMonadPlus Maybe | |
| LorentzFunctor Maybe Source # | |
Defined in Lorentz.Instr | |
| MonadBaseControl Maybe Maybe | |
| MonadError () Maybe | Since: mtl-2.2.2 |
Defined in Control.Monad.Error.Class | |
| (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 Methods ins :: () :- Applicative Maybe # | |
| () :=> (Alternative Maybe) | |
Defined in Data.Constraint Methods ins :: () :- Alternative Maybe # | |
| () :=> (MonadPlus Maybe) | |
| Eq a => Eq (Maybe a) | Since: base-2.1 |
| Data a => Data (Maybe a) | Since: base-4.0.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Maybe a -> c (Maybe a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Maybe a) # toConstr :: Maybe a -> Constr # dataTypeOf :: Maybe a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Maybe a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Maybe a)) # gmapT :: (forall b. Data b => b -> b) -> Maybe a -> Maybe a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r # gmapQ :: (forall d. Data d => d -> u) -> Maybe a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Maybe a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # | |
| Ord a => Ord (Maybe a) | Since: base-2.1 |
| 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) | |
| Testable prop => Testable (Maybe prop) | |
| Arbitrary a => Arbitrary (Maybe a) | |
| CoArbitrary a => CoArbitrary (Maybe a) | |
Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Maybe a -> Gen b -> Gen b # | |
| NFData a => NFData (Maybe a) | |
Defined in Control.DeepSeq | |
| 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 Associated Types type DemoteRep (Maybe a) | |
| 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) | |
| PolyTypeHasDocC '[a] => TypeHasDoc (Maybe a) | |
Defined in Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Maybe a) :: FieldDescriptions # Methods typeDocName :: Proxy (Maybe a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Maybe a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Maybe a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Maybe a) # | |
| IsoValue a => IsoValue (Maybe a) | |
| (TypeError (DisallowInstance "Maybe") :: Constraint) => Container (Maybe a) | |
Defined in Universum.Container.Class Methods 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)) # | |
| PMonoid (Maybe a) | |
| SSemigroup a => SMonoid (Maybe a) | |
| PShow (Maybe a) | |
| SShow a => SShow (Maybe a) | |
Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t1 :: Nat) (t2 :: Maybe a) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) # sShow_ :: forall (t :: Maybe a). Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: forall (t1 :: [Maybe a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) # | |
| PSemigroup (Maybe a) | |
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 Methods sCompare :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| SEq a => SEq (Maybe a) | |
| PEq (Maybe a) | |
| Pretty a => Pretty (Maybe a) | |
Defined in Text.PrettyPrint.Annotated.WL | |
| Pretty a => Pretty (Maybe a) | |
Defined in Text.PrettyPrint.Leijen.Text | |
| HasTypeAnn a => HasTypeAnn (Maybe a) Source # | |
Defined in Lorentz.TypeAnns | |
| 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 | |
| SingI (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing CatMaybesSym0 # | |
| SingI (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing ListToMaybeSym0 # | |
| SingI (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MaybeToListSym0 # | |
| SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsNothingSym0 # | |
| SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsJustSym0 # | |
| SingI (FromJustSym0 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromJustSym0 # | |
| SingI (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods 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 Methods sing :: Sing FromMaybeSym0 # | |
| SEq a => SingI (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods 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 Methods sing :: Sing FindIndexSym0 # | |
| SuppressUnusedWarnings (CatMaybesSym0 :: TyFun [Maybe a6989586621679913394] [a6989586621679913394] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListToMaybeSym0 :: TyFun [a6989586621679913395] (Maybe a6989586621679913395) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (StripPrefixSym0 :: TyFun [a6989586621680438531] ([a6989586621680438531] ~> Maybe [a6989586621680438531]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024600Sym0 :: TyFun (Maybe a6989586621679962884) (Maybe a6989586621679962884 ~> Maybe a6989586621679962884) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaybeToListSym0 :: TyFun (Maybe a6989586621679913396) [a6989586621679913396] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a6989586621679913399) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a6989586621679913400) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromJustSym0 :: TyFun (Maybe a6989586621679913398) a6989586621679913398 -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MinInternalSym0 :: TyFun (Maybe a6989586621680733526) (MinInternal a6989586621680733526) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaxInternalSym0 :: TyFun (Maybe a6989586621680732852) (MaxInternal a6989586621680732852) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803207Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (OptionSym0 :: TyFun (Maybe a6989586621679060063) (Option a6989586621679060063) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a6989586621679087417) (Last a6989586621679087417) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a6989586621679087424) (First a6989586621679087424) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595735Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680024315Sym0 :: TyFun a6989586621679962808 (Maybe a6989586621679962808) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680024608LSym0 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromMaybeSym0 :: TyFun a6989586621679913397 (Maybe a6989586621679913397 ~> a6989586621679913397) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemIndexSym0 :: TyFun a6989586621680316349 ([a6989586621680316349] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (JustSym0 :: TyFun a3530822107858468865 (Maybe a3530822107858468865) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetOptionSym0 :: TyFun (Option a6989586621679060063) (Maybe a6989586621679060063) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a6989586621679087424) (Maybe a6989586621679087424) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a6989586621679087417) (Maybe a6989586621679087417) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680316350 ~> Bool) ([a6989586621680316350] ~> Maybe a6989586621680316350) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a6989586621680316347 ~> Bool) ([a6989586621680316347] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods 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 Methods sing :: Sing (FindIndexSym1 d) # | |
| (SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (ElemIndexSym1 d) # | |
| SingI d => SingI (FromMaybeSym1 d :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (FromMaybeSym1 d) # | |
| SAlternative f => SingI (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative Methods sing :: Sing OptionalSym0 # | |
| SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing Maybe_Sym0 # | |
| SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing LookupSym0 # | |
| SingI (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MapMaybeSym0 # | |
| SingI (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing UnfoldrSym0 # | |
| SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SuppressUnusedWarnings (StripPrefixSym1 a6989586621680440227 :: TyFun [a6989586621680438531] (Maybe [a6989586621680438531]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym1 a6989586621680320898 :: TyFun [a6989586621680316350] (Maybe a6989586621680316350) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndexSym1 a6989586621680320874 :: TyFun [a6989586621680316347] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemIndexSym1 a6989586621680320890 :: TyFun [a6989586621680316349] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595735Sym1 a6989586621680595732 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024600Sym1 a6989586621680024598 :: TyFun (Maybe a6989586621679962884) (Maybe a6989586621679962884) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024510Sym0 :: TyFun (Maybe a6989586621679962834) (Maybe b6989586621679962835 ~> Maybe b6989586621679962835) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024498Sym0 :: TyFun (Maybe a6989586621679962832) ((a6989586621679962832 ~> Maybe b6989586621679962833) ~> Maybe b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024355Sym0 :: TyFun (Maybe a6989586621679962814) (Maybe b6989586621679962815 ~> Maybe b6989586621679962815) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromMaybeSym1 a6989586621679913583 :: TyFun (Maybe a6989586621679913397) a6989586621679913397 -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803207Sym1 a6989586621679803205 :: TyFun (Maybe a3530822107858468865) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024325Sym0 :: TyFun (Maybe (a6989586621679962809 ~> b6989586621679962810)) (Maybe a6989586621679962809 ~> Maybe b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (OptionalSym0 :: TyFun (f6989586621681393521 a6989586621681393522) (f6989586621681393521 (Maybe a6989586621681393522)) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024177Sym0 :: TyFun a6989586621679962805 (Maybe b6989586621679962806 ~> Maybe a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b6989586621679911960 ((a6989586621679911961 ~> b6989586621679911960) ~> (Maybe a6989586621679911961 ~> b6989586621679911960)) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LookupSym0 :: TyFun a6989586621680316328 ([(a6989586621680316328, b6989586621680316329)] ~> Maybe b6989586621680316329) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734313NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734313MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734286NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734286MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680024164Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Maybe a6989586621679962803 ~> Maybe b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MapMaybeSym0 :: TyFun (a6989586621679913392 ~> Maybe b6989586621679913393) ([a6989586621679913392] ~> [b6989586621679913393]) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UnfoldrSym0 :: TyFun (b6989586621680316406 ~> Maybe (a6989586621680316407, b6989586621680316406)) (b6989586621680316406 ~> [a6989586621680316407]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680742290 ~> Bool) (t6989586621680742289 a6989586621680742290 ~> Maybe a6989586621680742290) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| (SEq a, SingI d) => SingI (LookupSym1 d b :: TyFun [(a, b)] (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods 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 Methods sing :: Sing (Maybe_Sym1 d a) # | |
| SuppressUnusedWarnings (LookupSym1 a6989586621680320552 b6989586621680316329 :: TyFun [(a6989586621680316328, b6989586621680316329)] (Maybe b6989586621680316329) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024510Sym1 a6989586621680024508 b6989586621679962835 :: TyFun (Maybe b6989586621679962835) (Maybe b6989586621679962835) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024355Sym1 a6989586621680024353 b6989586621679962815 :: TyFun (Maybe b6989586621679962815) (Maybe b6989586621679962815) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024325Sym1 a6989586621680024323 :: TyFun (Maybe a6989586621679962809) (Maybe b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024177Sym1 a6989586621680024175 b6989586621679962806 :: TyFun (Maybe b6989586621679962806) (Maybe a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680024164Sym1 a6989586621680024162 :: TyFun (Maybe a6989586621679962803) (Maybe b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734313NSym1 x6989586621680734311 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734313MSym1 x6989586621680734311 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734286NSym1 x6989586621680734284 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734286MSym1 x6989586621680734284 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym1 a6989586621680742743 t6989586621680742289 :: TyFun (t6989586621680742289 a6989586621680742290) (Maybe a6989586621680742290) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680641007Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680640919Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995058Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Maybe a6989586621680988964 ~> f6989586621680988963 (Maybe b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024498Sym1 a6989586621680024496 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Maybe b6989586621679962833) (Maybe b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680024339Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Maybe a6989586621679962811 ~> (Maybe b6989586621679962812 ~> Maybe c6989586621679962813)) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym1 a6989586621679911978 a6989586621679911961 :: TyFun (a6989586621679911961 ~> b6989586621679911960) (Maybe a6989586621679911961 ~> b6989586621679911960) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679913560RsSym0 :: TyFun (a6989586621679913392 ~> Maybe k1) (TyFun k (TyFun [a6989586621679913392] [k1] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743224MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743199MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| (SingI d1, SingI d2) => SingI (Maybe_Sym2 d1 d2 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym2 d1 d2) # | |
| SuppressUnusedWarnings (Traverse_6989586621680995058Sym1 a6989586621680995056 :: TyFun (Maybe a6989586621680988964) (f6989586621680988963 (Maybe b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680024339Sym1 a6989586621680024336 :: TyFun (Maybe a6989586621679962811) (Maybe b6989586621679962812 ~> Maybe c6989586621679962813) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym2 a6989586621679911979 a6989586621679911978 :: TyFun (Maybe a6989586621679911961) b6989586621679911960 -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743224MfSym1 f6989586621680743222 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743199MfSym1 f6989586621680743197 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680641007Sym1 a6989586621680641005 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680640919Sym1 a6989586621680640917 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680024339Sym2 a6989586621680024337 a6989586621680024336 :: TyFun (Maybe b6989586621679962812) (Maybe c6989586621679962813) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743224MfSym2 xs6989586621680743223 f6989586621680743222 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743199MfSym2 xs6989586621680743198 f6989586621680743197 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680641007Sym2 k6989586621680641006 a6989586621680641005 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680640919Sym2 k6989586621680640918 a6989586621680640917 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743199MfSym3 a6989586621680743200 xs6989586621680743198 f6989586621680743197 :: TyFun (Maybe k3) (Maybe k2) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743224MfSym3 a6989586621680743225 xs6989586621680743223 f6989586621680743222 :: TyFun k3 (Maybe k3) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| IsoValue a => IsoValue (NamedF Maybe a name) | |
| (HasTypeAnn (Maybe a), KnownSymbol name) => HasTypeAnn (NamedF Maybe a name) Source # | |
Defined in Lorentz.TypeAnns | |
| type Failure Maybe | |
Defined in Basement.Monad | |
| type StM Maybe a | |
Defined in Control.Monad.Trans.Control | |
| 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 a6989586621679962884) <|> (a2 :: Maybe a6989586621679962884) | |
| type Mplus (arg1 :: Maybe a0) (arg2 :: Maybe a0) | |
| type FoldMap (a1 :: a6989586621680742384 ~> k2) (a2 :: Maybe a6989586621680742384) | |
| type (a1 :: k1) <$ (a2 :: Maybe b6989586621679962806) | |
| type Fmap (a1 :: a6989586621679962803 ~> b6989586621679962804) (a2 :: Maybe a6989586621679962803) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type (arg1 :: Maybe a0) <* (arg2 :: Maybe b0) | |
| type (a1 :: Maybe a6989586621679962814) *> (a2 :: Maybe b6989586621679962815) | |
| type (a1 :: Maybe (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: Maybe a6989586621679962809) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type (a1 :: Maybe a6989586621679962834) >> (a2 :: Maybe b6989586621679962835) | |
| type (a1 :: Maybe a6989586621679962832) >>= (a2 :: a6989586621679962832 ~> Maybe b6989586621679962833) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type MapM (arg1 :: a0 ~> m0 b0) (arg2 :: Maybe a0) | |
| type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: Maybe a6989586621680988964) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: Maybe a6989586621680988964) = Apply (Apply (Traverse_6989586621680995058Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Maybe a6989586621680988964 ~> f6989586621680988963 (Maybe b6989586621680988965)) -> Type) a1) a2 | |
| type Foldl' (arg1 :: b0 ~> (a0 ~> b0)) (arg2 :: b0) (arg3 :: Maybe a0) | |
| type Foldl (a1 :: k2 ~> (a6989586621680742390 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680742390) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Foldr' (arg1 :: a0 ~> (b0 ~> b0)) (arg2 :: b0) (arg3 :: Maybe a0) | |
| type Foldr (a1 :: a6989586621680742385 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680742385) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type LiftA2 (a1 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (a2 :: Maybe a6989586621679962811) (a3 :: Maybe b6989586621679962812) | |
Defined in Data.Singletons.Prelude.Monad.Internal type LiftA2 (a1 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (a2 :: Maybe a6989586621679962811) (a3 :: Maybe b6989586621679962812) = Apply (Apply (Apply (LiftA2_6989586621680024339Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Maybe a6989586621679962811 ~> (Maybe b6989586621679962812 ~> Maybe c6989586621679962813)) -> Type) a1) a2) a3 | |
| type Apply (Pure_6989586621680024315Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621680024314 :: a) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Let6989586621680024608LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216800235866989586621680024607 :: k1) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (t6989586621679707039 :: a) | |
| type Apply (Let6989586621680734286NSym1 x6989586621680734284 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680734285 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680734286MSym1 x6989586621680734284 :: TyFun k (Maybe k1) -> Type) (y6989586621680734285 :: k) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680734313NSym1 x6989586621680734311 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680734312 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680734313MSym1 x6989586621680734311 :: TyFun k (Maybe k1) -> Type) (y6989586621680734312 :: k) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Lambda_6989586621680640919Sym2 k6989586621680640918 a6989586621680640917 :: TyFun k1 (Maybe a) -> Type) (t6989586621680640930 :: k1) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Lambda_6989586621680641007Sym2 k6989586621680641006 a6989586621680641005 :: TyFun k1 (Maybe a) -> Type) (t6989586621680641018 :: k1) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Let6989586621680743224MfSym3 a6989586621680743225 xs6989586621680743223 f6989586621680743222 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680743226 :: k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (ShowsPrec_6989586621680595735Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680595732 :: Nat) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply (FromMaybeSym0 :: TyFun a6989586621679913397 (Maybe a6989586621679913397 ~> a6989586621679913397) -> Type) (a6989586621679913583 :: a6989586621679913397) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym0 :: TyFun a6989586621679913397 (Maybe a6989586621679913397 ~> a6989586621679913397) -> Type) (a6989586621679913583 :: a6989586621679913397) = FromMaybeSym1 a6989586621679913583 | |
| type Apply (ElemIndexSym0 :: TyFun a6989586621680316349 ([a6989586621680316349] ~> Maybe Nat) -> Type) (a6989586621680320890 :: a6989586621680316349) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym0 :: TyFun a6989586621680316349 ([a6989586621680316349] ~> Maybe Nat) -> Type) (a6989586621680320890 :: a6989586621680316349) = ElemIndexSym1 a6989586621680320890 | |
| type Apply (TFHelper_6989586621680024177Sym0 :: TyFun a6989586621679962805 (Maybe b6989586621679962806 ~> Maybe a6989586621679962805) -> Type) (a6989586621680024175 :: a6989586621679962805) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024177Sym0 :: TyFun a6989586621679962805 (Maybe b6989586621679962806 ~> Maybe a6989586621679962805) -> Type) (a6989586621680024175 :: a6989586621679962805) = TFHelper_6989586621680024177Sym1 a6989586621680024175 b6989586621679962806 :: TyFun (Maybe b6989586621679962806) (Maybe a6989586621679962805) -> Type | |
| type Apply (Maybe_Sym0 :: TyFun b6989586621679911960 ((a6989586621679911961 ~> b6989586621679911960) ~> (Maybe a6989586621679911961 ~> b6989586621679911960)) -> Type) (a6989586621679911978 :: b6989586621679911960) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym0 :: TyFun b6989586621679911960 ((a6989586621679911961 ~> b6989586621679911960) ~> (Maybe a6989586621679911961 ~> b6989586621679911960)) -> Type) (a6989586621679911978 :: b6989586621679911960) = Maybe_Sym1 a6989586621679911978 a6989586621679911961 :: TyFun (a6989586621679911961 ~> b6989586621679911960) (Maybe a6989586621679911961 ~> b6989586621679911960) -> Type | |
| type Apply (LookupSym0 :: TyFun a6989586621680316328 ([(a6989586621680316328, b6989586621680316329)] ~> Maybe b6989586621680316329) -> Type) (a6989586621680320552 :: a6989586621680316328) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym0 :: TyFun a6989586621680316328 ([(a6989586621680316328, b6989586621680316329)] ~> Maybe b6989586621680316329) -> Type) (a6989586621680320552 :: a6989586621680316328) = LookupSym1 a6989586621680320552 b6989586621680316329 :: TyFun [(a6989586621680316328, b6989586621680316329)] (Maybe b6989586621680316329) -> Type | |
| type Apply (Let6989586621680734286NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680734284 :: k) | |
| type Apply (Let6989586621680734286MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680734284 :: k1) | |
| type Apply (Let6989586621680734313NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680734311 :: k) | |
| type Apply (Let6989586621680734313MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680734311 :: k1) | |
| type Apply (Lambda_6989586621680640919Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680640917 :: k) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Lambda_6989586621680641007Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680641005 :: k) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Let6989586621680743199MfSym1 f6989586621680743197 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) (xs6989586621680743198 :: k) | |
| type Apply (Let6989586621680743224MfSym1 f6989586621680743222 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680743223 :: k) | |
| type Apply (Let6989586621680743199MfSym2 xs6989586621680743198 f6989586621680743197 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) (a6989586621680743200 :: k2) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Rep (Maybe a) | |
Defined in GHC.Generics | |
| data Sing (b :: Maybe a) | |
| type DemoteRep (Maybe a) | |
Defined in GHC.Generics | |
| type Index (Maybe a) | |
Defined in Control.Lens.At | |
| type IxValue (Maybe a) | |
Defined in Control.Lens.At | |
| type Sing | |
Defined in Data.Singletons.Prelude.Instances | |
| type TypeDocFieldDescriptions (Maybe a) | |
Defined in Michelson.Typed.Haskell.Doc | |
| type ToT (Maybe a) | |
Defined in Michelson.Typed.Haskell.Value | |
| type Element (Maybe a) | |
Defined in Universum.Container.Class | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Demote (Maybe a) | |
Defined in Data.Singletons.Prelude.Instances | |
| 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 Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621679913593 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679913596 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679913598 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (FromMaybeSym1 a6989586621679913583 :: TyFun (Maybe a) a -> Type) (a6989586621679913584 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (Compare_6989586621679803207Sym1 a6989586621679803205 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679803206 :: Maybe a) | |
| type Apply (Maybe_Sym2 a6989586621679911979 a6989586621679911978 :: TyFun (Maybe a) b -> Type) (a6989586621679911980 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621679913572 :: [Maybe a]) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679913577 :: [a]) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679913577 :: [a]) = ListToMaybe a6989586621679913577 | |
| type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679913580 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679913580 :: Maybe a) = MaybeToList a6989586621679913580 | |
| type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (t6989586621680733515 :: Maybe a) | |
| type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (t6989586621680733713 :: Maybe a) | |
| type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (t6989586621680197015 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (t6989586621680634737 :: Maybe a) | |
| type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (t6989586621680634760 :: Maybe a) | |
| type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621680197012 :: Option a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680634734 :: First a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680634757 :: Last a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (FindSym1 a6989586621680320898 :: TyFun [a] (Maybe a) -> Type) (a6989586621680320899 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (FindIndexSym1 a6989586621680320874 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680320875 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (ElemIndexSym1 a6989586621680320890 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680320891 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (StripPrefixSym1 a6989586621680440227 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680440228 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym1 a6989586621680440227 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680440228 :: [a]) = StripPrefix a6989586621680440227 a6989586621680440228 | |
| type Apply (TFHelper_6989586621680024600Sym1 a6989586621680024598 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680024599 :: Maybe a) | |
| type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621681393559 :: f a) | |
Defined in Data.Singletons.Prelude.Applicative | |
| type Apply (LookupSym1 a6989586621680320552 b :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621680320553 :: [(a, b)]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Fmap_6989586621680024164Sym1 a6989586621680024162 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680024163 :: Maybe a) | |
| type Apply (TFHelper_6989586621680024177Sym1 a6989586621680024175 b :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621680024176 :: Maybe b) | |
| type Apply (TFHelper_6989586621680024325Sym1 a6989586621680024323 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680024324 :: Maybe a) | |
| type Apply (TFHelper_6989586621680024355Sym1 a6989586621680024353 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680024354 :: Maybe b) | |
| type Apply (TFHelper_6989586621680024510Sym1 a6989586621680024508 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680024509 :: Maybe b) | |
| type Apply (FindSym1 a6989586621680742743 t :: TyFun (t a) (Maybe a) -> Type) (a6989586621680742744 :: t a) | |
| type Apply (Traverse_6989586621680995058Sym1 a6989586621680995056 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621680995057 :: Maybe a) | |
| type Apply (LiftA2_6989586621680024339Sym2 a6989586621680024337 a6989586621680024336 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621680024338 :: Maybe b) | |
| type Apply (Let6989586621680743199MfSym3 a6989586621680743200 xs6989586621680743198 f6989586621680743197 :: TyFun (Maybe k3) (Maybe k2) -> Type) (a6989586621680743201 :: Maybe k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Eval (Init (a2 ': (b ': as)) :: Maybe [a1] -> Type) | |
| 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 (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 [a6989586621680438531] ([a6989586621680438531] ~> Maybe [a6989586621680438531]) -> Type) (a6989586621680440227 :: [a6989586621680438531]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym0 :: TyFun [a6989586621680438531] ([a6989586621680438531] ~> Maybe [a6989586621680438531]) -> Type) (a6989586621680440227 :: [a6989586621680438531]) = StripPrefixSym1 a6989586621680440227 | |
| type Apply (TFHelper_6989586621680024600Sym0 :: TyFun (Maybe a6989586621679962884) (Maybe a6989586621679962884 ~> Maybe a6989586621679962884) -> Type) (a6989586621680024598 :: Maybe a6989586621679962884) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Compare_6989586621679803207Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) (a6989586621679803205 :: Maybe a3530822107858468865) | |
| type Apply (ShowsPrec_6989586621680595735Sym1 a6989586621680595732 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type) (a6989586621680595733 :: Maybe a3530822107858468865) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply (TFHelper_6989586621680024355Sym0 :: TyFun (Maybe a6989586621679962814) (Maybe b6989586621679962815 ~> Maybe b6989586621679962815) -> Type) (a6989586621680024353 :: Maybe a6989586621679962814) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024355Sym0 :: TyFun (Maybe a6989586621679962814) (Maybe b6989586621679962815 ~> Maybe b6989586621679962815) -> Type) (a6989586621680024353 :: Maybe a6989586621679962814) = TFHelper_6989586621680024355Sym1 a6989586621680024353 b6989586621679962815 :: TyFun (Maybe b6989586621679962815) (Maybe b6989586621679962815) -> Type | |
| type Apply (TFHelper_6989586621680024498Sym0 :: TyFun (Maybe a6989586621679962832) ((a6989586621679962832 ~> Maybe b6989586621679962833) ~> Maybe b6989586621679962833) -> Type) (a6989586621680024496 :: Maybe a6989586621679962832) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024498Sym0 :: TyFun (Maybe a6989586621679962832) ((a6989586621679962832 ~> Maybe b6989586621679962833) ~> Maybe b6989586621679962833) -> Type) (a6989586621680024496 :: Maybe a6989586621679962832) = TFHelper_6989586621680024498Sym1 a6989586621680024496 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Maybe b6989586621679962833) (Maybe b6989586621679962833) -> Type | |
| type Apply (TFHelper_6989586621680024510Sym0 :: TyFun (Maybe a6989586621679962834) (Maybe b6989586621679962835 ~> Maybe b6989586621679962835) -> Type) (a6989586621680024508 :: Maybe a6989586621679962834) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024510Sym0 :: TyFun (Maybe a6989586621679962834) (Maybe b6989586621679962835 ~> Maybe b6989586621679962835) -> Type) (a6989586621680024508 :: Maybe a6989586621679962834) = TFHelper_6989586621680024510Sym1 a6989586621680024508 b6989586621679962835 :: TyFun (Maybe b6989586621679962835) (Maybe b6989586621679962835) -> Type | |
| type Apply (TFHelper_6989586621680024325Sym0 :: TyFun (Maybe (a6989586621679962809 ~> b6989586621679962810)) (Maybe a6989586621679962809 ~> Maybe b6989586621679962810) -> Type) (a6989586621680024323 :: Maybe (a6989586621679962809 ~> b6989586621679962810)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024325Sym0 :: TyFun (Maybe (a6989586621679962809 ~> b6989586621679962810)) (Maybe a6989586621679962809 ~> Maybe b6989586621679962810) -> Type) (a6989586621680024323 :: Maybe (a6989586621679962809 ~> b6989586621679962810)) = TFHelper_6989586621680024325Sym1 a6989586621680024323 | |
| type Apply (LiftA2_6989586621680024339Sym1 a6989586621680024336 :: TyFun (Maybe a6989586621679962811) (Maybe b6989586621679962812 ~> Maybe c6989586621679962813) -> Type) (a6989586621680024337 :: Maybe a6989586621679962811) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Let6989586621680743224MfSym2 xs6989586621680743223 f6989586621680743222 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680743225 :: 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_6989586621680024498Sym1 a6989586621680024496 b :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621680024497 :: a ~> Maybe b) | |
| type Apply (FindSym0 :: TyFun (a6989586621680316350 ~> Bool) ([a6989586621680316350] ~> Maybe a6989586621680316350) -> Type) (a6989586621680320898 :: a6989586621680316350 ~> Bool) | |
| type Apply (FindIndexSym0 :: TyFun (a6989586621680316347 ~> Bool) ([a6989586621680316347] ~> Maybe Nat) -> Type) (a6989586621680320874 :: a6989586621680316347 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Fmap_6989586621680024164Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Maybe a6989586621679962803 ~> Maybe b6989586621679962804) -> Type) (a6989586621680024162 :: a6989586621679962803 ~> b6989586621679962804) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (MapMaybeSym0 :: TyFun (a6989586621679913392 ~> Maybe b6989586621679913393) ([a6989586621679913392] ~> [b6989586621679913393]) -> Type) (a6989586621679913553 :: a6989586621679913392 ~> Maybe b6989586621679913393) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (MapMaybeSym0 :: TyFun (a6989586621679913392 ~> Maybe b6989586621679913393) ([a6989586621679913392] ~> [b6989586621679913393]) -> Type) (a6989586621679913553 :: a6989586621679913392 ~> Maybe b6989586621679913393) = MapMaybeSym1 a6989586621679913553 | |
| type Apply (UnfoldrSym0 :: TyFun (b6989586621680316406 ~> Maybe (a6989586621680316407, b6989586621680316406)) (b6989586621680316406 ~> [a6989586621680316407]) -> Type) (a6989586621680321318 :: b6989586621680316406 ~> Maybe (a6989586621680316407, b6989586621680316406)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (UnfoldrSym0 :: TyFun (b6989586621680316406 ~> Maybe (a6989586621680316407, b6989586621680316406)) (b6989586621680316406 ~> [a6989586621680316407]) -> Type) (a6989586621680321318 :: b6989586621680316406 ~> Maybe (a6989586621680316407, b6989586621680316406)) = UnfoldrSym1 a6989586621680321318 | |
| type Apply (FindSym0 :: TyFun (a6989586621680742290 ~> Bool) (t6989586621680742289 a6989586621680742290 ~> Maybe a6989586621680742290) -> Type) (a6989586621680742743 :: a6989586621680742290 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym0 :: TyFun (a6989586621680742290 ~> Bool) (t6989586621680742289 a6989586621680742290 ~> Maybe a6989586621680742290) -> Type) (a6989586621680742743 :: a6989586621680742290 ~> Bool) = FindSym1 a6989586621680742743 t6989586621680742289 :: TyFun (t6989586621680742289 a6989586621680742290) (Maybe a6989586621680742290) -> Type | |
| type Apply (Traverse_6989586621680995058Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Maybe a6989586621680988964 ~> f6989586621680988963 (Maybe b6989586621680988965)) -> Type) (a6989586621680995056 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680995058Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Maybe a6989586621680988964 ~> f6989586621680988963 (Maybe b6989586621680988965)) -> Type) (a6989586621680995056 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) = Traverse_6989586621680995058Sym1 a6989586621680995056 | |
| type Apply (LiftA2_6989586621680024339Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Maybe a6989586621679962811 ~> (Maybe b6989586621679962812 ~> Maybe c6989586621679962813)) -> Type) (a6989586621680024336 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621680024339Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Maybe a6989586621679962811 ~> (Maybe b6989586621679962812 ~> Maybe c6989586621679962813)) -> Type) (a6989586621680024336 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) = LiftA2_6989586621680024339Sym1 a6989586621680024336 | |
| type Apply (Maybe_Sym1 a6989586621679911978 a6989586621679911961 :: TyFun (a6989586621679911961 ~> b6989586621679911960) (Maybe a6989586621679911961 ~> b6989586621679911960) -> Type) (a6989586621679911979 :: a6989586621679911961 ~> b6989586621679911960) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym1 a6989586621679911978 a6989586621679911961 :: TyFun (a6989586621679911961 ~> b6989586621679911960) (Maybe a6989586621679911961 ~> b6989586621679911960) -> Type) (a6989586621679911979 :: a6989586621679911961 ~> b6989586621679911960) = Maybe_Sym2 a6989586621679911978 a6989586621679911979 | |
| type Apply (Let6989586621679913560RsSym0 :: TyFun (a6989586621679913392 ~> Maybe k1) (TyFun k (TyFun [a6989586621679913392] [k1] -> Type) -> Type) -> Type) (f6989586621679913557 :: a6989586621679913392 ~> Maybe k1) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Let6989586621679913560RsSym0 :: TyFun (a6989586621679913392 ~> Maybe k1) (TyFun k (TyFun [a6989586621679913392] [k1] -> Type) -> Type) -> Type) (f6989586621679913557 :: a6989586621679913392 ~> Maybe k1) = Let6989586621679913560RsSym1 f6989586621679913557 :: TyFun k (TyFun [a6989586621679913392] [k1] -> Type) -> Type | |
| type Apply (Let6989586621680743199MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680743197 :: k2 ~> (k3 ~> k2)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680743199MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680743197 :: k2 ~> (k3 ~> k2)) = Let6989586621680743199MfSym1 f6989586621680743197 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680743224MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680743222 :: k2 ~> (k3 ~> k3)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680743224MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680743222 :: k2 ~> (k3 ~> k3)) = Let6989586621680743224MfSym1 f6989586621680743222 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type | |
| type Apply (Lambda_6989586621680640919Sym1 a6989586621680640917 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680640918 :: k1 ~> First a) | |
| type Apply (Lambda_6989586621680641007Sym1 a6989586621680641005 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680641006 :: k1 ~> Last a) | |
| type Unwrapped (NamedF Maybe a name) | |
Defined in Util.Named | |
| type ToT (NamedF Maybe a name) | |
Proxy is a type that holds no data, but has a phantom parameter of
arbitrary type (or even kind). Its use is to provide type information, even
though there is no value available of that type (or it may be too costly to
create one).
Historically, Proxy :: Proxy aundefined :: a
>>>Proxy :: Proxy (Void, Int -> Int)Proxy
Proxy can even hold types of higher kinds,
>>>Proxy :: Proxy EitherProxy
>>>Proxy :: Proxy FunctorProxy
>>>Proxy :: Proxy complicatedStructureProxy
Constructors
| 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 Methods fold :: Monoid m => Proxy m -> m # foldMap :: Monoid m => (a -> m) -> Proxy a -> m # foldMap' :: Monoid m => (a -> m) -> Proxy a -> m # foldr :: (a -> b -> b) -> b -> Proxy a -> b # foldr' :: (a -> b -> b) -> b -> Proxy a -> b # foldl :: (b -> a -> b) -> b -> Proxy a -> b # foldl' :: (b -> a -> b) -> b -> Proxy a -> b # foldr1 :: (a -> a -> a) -> Proxy a -> a # foldl1 :: (a -> a -> a) -> Proxy a -> a # 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 |
| Contravariant (Proxy :: Type -> Type) | |
| Representable (Proxy :: Type -> Type) | |
| ToJSON1 (Proxy :: Type -> Type) | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Proxy a -> Value # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Proxy a] -> Value # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Proxy a -> Encoding # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Proxy a] -> Encoding # | |
| 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 | |
| Apply (Proxy :: Type -> Type) | |
| Bind (Proxy :: Type -> Type) | |
| 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 |
| Data t => Data (Proxy t) | Since: base-4.7.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Proxy t -> c (Proxy t) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Proxy t) # toConstr :: Proxy t -> Constr # dataTypeOf :: Proxy t -> DataType # dataCast1 :: Typeable t0 => (forall d. Data d => c (t0 d)) -> Maybe (c (Proxy t)) # dataCast2 :: Typeable t0 => (forall d e. (Data d, Data e) => c (t0 d e)) -> Maybe (c (Proxy t)) # gmapT :: (forall b. Data b => b -> b) -> Proxy t -> Proxy t # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Proxy t -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Proxy t -> r # gmapQ :: (forall d. Data d => d -> u) -> Proxy t -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Proxy t -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # | |
| Ord (Proxy s) | Since: base-4.7.0.0 |
| 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 |
| NFData (Proxy a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Hashable (Proxy a) | |
Defined in Data.Hashable.Class | |
| ToJSON (Proxy a) | |
Defined in Data.Aeson.Types.ToJSON | |
| 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 #