Hoogle Search
Within LTS Haskell 24.51 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
type family
MaybeToList (a :: Maybe Type) :: [Type]hvect Data.HVect No documentation available.
MaybePartiallyTrimmed :: FinalExceptionmmsyn7ukr-common Sound.Control.Exception.FinalException No documentation available.
module Clash.XException.
MaybeX Helpers to make XException explicit in the type system. Using these helpers can help programmers account for XExceptions properly in blackbox models or tests. Note that none of these operations can be translated to HDL.
-
clash-prelude Clash.XException.MaybeX Structure helping programmers to deal with XException values. For safety reasons it can't be constructed directly, but should be constructed using either pure or toMaybeX. After construction, it can be deconstructed using either IsX or IsDefined.
MaybeColumn :: ColumnType -> ColumnTypecql Database.CQL.Protocol No documentation available.
MaybeColumn :: ColumnType -> ColumnTypecql Database.CQL.Protocol.Internal No documentation available.
type
MaybeMemberAt (n :: Nat) (x :: k) (xs :: [k]) = (NatToInt n, KindAtPositionIs n x xs)data-diverse Data.Diverse.TypeLevel Ensures that x is a member of xs at n if it exists, and that natToInt can be used.
type
MaybeUniqueMember (x :: k) (xs :: [k]) = (Unique x xs, NatToInt PositionOf x xs)data-diverse Data.Diverse.TypeLevel Ensures that x is a unique member of xs if it exists, and that natToInt can be used.
newtype
MaybeF (f :: k -> Type) (a :: k)functor-combinators Control.Applicative.ListF A maybe f a. Can be useful for describing a "an f a that may or may not be there". This is the free structure for a "fail"-like typeclass that would only have zero :: f a.
MaybeF :: Maybe (f a) -> MaybeF (f :: k -> Type) (a :: k)functor-combinators Control.Applicative.ListF No documentation available.