Modulestrict-sop-core-0.1.4.0Haskell2010

Data.SOP.Strict.NP

Strict variant of NP

NP

6 declarations

datadata NP (f :: k -> Type) (xs :: [k]) where

Instances16HTrans, HAp, HCollapse, HPure, HSequence, HTraverse_, …

HTrans NP NPDefined in strict-sop-core-0.1.4.0 · Data.SOP.Strict.NP
HAp NPDefined in strict-sop-core-0.1.4.0 · Data.SOP.Strict.NP
HCollapse NPDefined in strict-sop-core-0.1.4.0 · Data.SOP.Strict.NP
HPure NPDefined in strict-sop-core-0.1.4.0 · Data.SOP.Strict.NP
HSequence NPDefined in strict-sop-core-0.1.4.0 · Data.SOP.Strict.NP
HTraverse_ NPDefined in strict-sop-core-0.1.4.0 · Data.SOP.Strict.NP
All (Compose Eq f) xs => Eq (NP f xs)Defined in strict-sop-core-0.1.4.0 · Data.SOP.Strict.NP
(All (Compose Eq f) xs, All (Compose Ord f) xs) => Ord (NP f xs)Defined in strict-sop-core-0.1.4.0 · Data.SOP.Strict.NP
All (Compose Show f) xs => Show (NP f xs)Defined in strict-sop-core-0.1.4.0 · Data.SOP.Strict.NP
Copied from sop-core
Not derived, since derived instance ignores associativity info
All (Compose NoThunks f) xs => NoThunks (NP f xs)Defined in strict-sop-core-0.1.4.0 · Data.SOP.Strict.NP
type CollapseTo NP a = [a]Defined in strict-sop-core-0.1.4.0 · Data.SOP.Strict.NP
type Prod NP = NPDefined in strict-sop-core-0.1.4.0 · Data.SOP.Strict.NP
type AllN NP c = All cDefined in strict-sop-core-0.1.4.0 · Data.SOP.Strict.NP
type AllZipN NP c = AllZip cDefined in strict-sop-core-0.1.4.0 · Data.SOP.Strict.NP
type Same NP = NPDefined in strict-sop-core-0.1.4.0 · Data.SOP.Strict.NP
type SListIN NP = SListIDefined in strict-sop-core-0.1.4.0 · Data.SOP.Strict.NP

valuehd :: NP f (x ': xs) -> f x

valuemap_NP' :: (forall (a :: k). f a -> g a) -> NP f xs -> NP g xs

Version of map_NP that does not require a singleton

valuenpToSListI :: NP a xs -> (SListI xs => r) -> r

Conjure up an SListI constraint from an NP

valuesingletonNP :: f x -> NP f '[x]

valuetl :: NP f (x ': xs) -> NP f xs

9 declarations

valuepure_NP :: SListI xs => (forall (a :: k). f a) -> NP f xs

valuecpure_NP :: All c xs => proxy c -> (forall (a :: k). c a => f a) -> NP f xs

valueap_NP :: NP (f -.-> g) xs -> NP f xs -> NP g xs

valuecollapse_NP :: NP (K a) xs -> [a]

valuectraverse'_NP

valuectraverse__NP

valuetraverse__NP

valuetrans_NP

valuecoerce_NP :: AllZip (LiftedCoercible f g) xs ys => NP f xs -> NP g ys