Data.Dependent.Map.Class

Documentation

newtype Apply f a

Constructors

Apply (f a)

Instances

EqForall f => Eq (Apply f a)

Defined in Data.Dependent.Map.Class

Methods

(==) :: Apply f a -> Apply f a -> Bool

(/=) :: Apply f a -> Apply f a -> Bool

OrdForall f => Ord (Apply f a)

Defined in Data.Dependent.Map.Class

Methods

compare :: Apply f a -> Apply f a -> Ordering

(<) :: Apply f a -> Apply f a -> Bool

(<=) :: Apply f a -> Apply f a -> Bool

(>) :: Apply f a -> Apply f a -> Bool

(>=) :: Apply f a -> Apply f a -> Bool

max :: Apply f a -> Apply f a -> Apply f a

min :: Apply f a -> Apply f a -> Apply f a

ApplyUniversally f PrimUnlifted => PrimUnlifted (Apply f a)

Defined in Data.Dependent.Map.Class

Methods

toArrayArray# :: Apply f a -> ArrayArray#

fromArrayArray# :: ArrayArray# -> Apply f a

PrimForall f => Prim (Apply f a)

Defined in Data.Dependent.Map.Class

Methods

sizeOf# :: Apply f a -> Int#

alignment# :: Apply f a -> Int#

indexByteArray# :: ByteArray# -> Int# -> Apply f a

readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Apply f a#)

writeByteArray# :: MutableByteArray# s -> Int# -> Apply f a -> State# s -> State# s

setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Apply f a -> State# s -> State# s

indexOffAddr# :: Addr# -> Int# -> Apply f a

readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Apply f a#)

writeOffAddr# :: Addr# -> Int# -> Apply f a -> State# s -> State# s

setOffAddr# :: Addr# -> Int# -> Int# -> Apply f a -> State# s -> State# s

class Universally (f :: k -> Type) (x :: Type -> Constraint) where

Methods

universally :: Proxy f -> Proxy x -> Proxy a -> (x (Apply f a) => y) -> y

Instances

ApplyUniversally f PrimUnlifted => Universally (f :: k -> Type) PrimUnlifted

Defined in Data.Dependent.Map.Class

Methods

universally :: Proxy f -> Proxy PrimUnlifted -> Proxy a -> (PrimUnlifted (Apply f a) -> y) -> y

Universally (f :: k -> Type) Always

Defined in Data.Dependent.Map.Class

Methods

universally :: Proxy f -> Proxy Always -> Proxy a -> (Always (Apply f a) -> y) -> y

class ApplyUniversally (f :: k -> Type) (x :: Type -> Constraint) where

Methods

applyUniversallyLifted :: forall a y. Proxy f -> Proxy x -> Proxy a -> (x (f a) => y) -> y

applyUniversallyUnlifted :: forall a (y :: TYPE UnliftedRep). Proxy f -> Proxy x -> Proxy a -> (x (f a) => y) -> y

Instances

ApplyUniversally (f :: k -> Type) Always

Defined in Data.Dependent.Map.Class

Methods

applyUniversallyLifted :: Proxy f -> Proxy Always -> Proxy a -> (Always (f a) -> y) -> y

applyUniversallyUnlifted :: Proxy f -> Proxy Always -> Proxy a -> (Always (f a) -> y) -> y