Hoogle Search
Within LTS Haskell 24.41 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
type (e :: k)
:| (es :: [k]) = Member e esvary Vary.Utils Constrain es to be any type list containing e. Useful to talk about variants generically without having to specify the exact type list right away. For instance, the type of from is
Vary.from :: (a :| l) => a -> Vary l
because we can use it to construct any Vary as long as there is an a somewhere in its list of types.(
::: ) :: forall a (n1 :: Nat) . a -> Vec n1 a -> Vec ('S n1) avec Data.Vec.Lazy No documentation available.
(
::: ) :: forall a (n1 :: Nat) . a -> Vec n1 a -> Vec ('S n1) avec Data.Vec.Lazy.Inline No documentation available.
(
:? ) :: forall e (es1 :: [Type]) . Filter e -> MultiFilter es1 -> MultiFilter (e ': es1)web3-ethereum Network.Ethereum.Contract.Event.MultiFilter No documentation available.
(
:< ) :: forall a1 (as :: [Type]) . a1 -> HList as -> HList (a1 ': as)web3-solidity Data.Solidity.Event.Internal No documentation available.
data ((f :: Type -> Type)
:+: (g :: Type -> Type)) wwizards System.Console.Wizard Coproduct of two functors
class (Functor sub, Functor sup) => (sub :: Type -> Type)
:<: (sup :: Type -> Type)wizards System.Console.Wizard Subsumption of two functors. You shouldn't define any of your own instances of this when writing back-ends, rely only on GeneralizedNewtypeDeriving.
data ((f :: Type -> Type)
:+: (g :: Type -> Type)) wwizards System.Console.Wizard.Internal Coproduct of two functors
class (Functor sub, Functor sup) => (sub :: Type -> Type)
:<: (sup :: Type -> Type)wizards System.Console.Wizard.Internal Subsumption of two functors. You shouldn't define any of your own instances of this when writing back-ends, rely only on GeneralizedNewtypeDeriving.
-
zippers Control.Zipper This type family represents a Zipper with the p variable abstracting over the position and the index, in terms of :@. You can visually see it in type signatures as:
h :> (a :@ i) = Zipper h i a