Module

Data.Struct

Package: purescript-struct
Repository: matthew-hilty/purescript-struct

Re-exports from Data.Struct.Compare

#RCompare Source

class RCompare (f :: Row Type -> Type) (l :: RowList) (r :: Row Type) | l -> r where

Members

rcompare :: forall g. RLProxying g l => g l -> f r -> f r -> Ordering

Instances

(OrdRecord l r, RowToList r l) => RCompare Record l r

#compare Source

compare :: forall r l f. RowToList r l => RCompare f l r => f r -> f r -> Ordering

Re-exports from Data.Struct.Const

#RConst Source

class RConst (p :: Type -> Type -> Type) (f :: Row Type -> Type) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) | l0 -> r0, l1 -> r1 where

Members

rconst :: forall g. RLProxying g l0 => RLProxying g l1 => g l0 -> g l1 -> f r0 -> p (f r1) (f r0)

Instances

(HasConst p (f r0), ObjectOf p (f r0), ObjectOf p (f r1), Restrictable Function p) => RConst p f l0 r0 l1 r1

#const Source

const :: forall r1 r0 p l1 l0 f. RConst p f l0 r0 l1 r1 => RowToList r0 l0 => RowToList r1 l1 => f r0 -> p (f r1) (f r0)

Re-exports from Data.Struct.Contract

#GContract Source

class GContract (p :: Type -> Type -> Type) (f :: Row Type -> Type) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) (l2 :: RowList) (r2 :: Row Type) | l0 -> r0, l1 -> r1, l2 -> r2, l0 l1 -> l2 where

Members

gContract :: forall g. RLProxying g l0 => RLProxying g l1 => RLProxying g l2 => g l0 -> g l1 -> g l2 -> p (f r1) (f r2)

Instances

(Category p) => GContract p f Nil () Nil () Nil ()
(Category p) => GContract p f Nil () (Cons s1 v1 l1') unifyR (Cons s2 v2 l2') unifyR
(RConst p f Nil () (Cons s v l') r, REmpty f) => GContract p f (Cons s v l') r (Cons s v l') r Nil ()
(Cons s0 v0 r2' r2, GContract p f l0' r0' (Cons s1 v1 l1') r1 (Cons s0 v0 (Cons s2' v2' l2'')) r2, Lacks s0 r2', RDelete p f SProxy s0 (Cons s0 v0 (Cons s2' v2' l2'')) r2 (Cons s2' v2' l2'') r2', Semigroupoid p) => GContract p f (Cons s0 v0 l0') r0 (Cons s1 v1 l1') r1 (Cons s2' v2' l2'') r2'

#RContract Source

class RContract (p :: Type -> Type -> Type) (f :: Row Type -> Type) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) | l0 -> r0, l1 -> r1 where

Members

rcontract :: forall r g. RLProxying g l0 => RLProxying g l1 => Union r1 r r0 => g l0 -> g l1 -> p (f r0) (f r1)

Instances

(GContract p Record l0 r0 l1 r1 l2 r2, RowToList r0 l0, Union r2 r0 r1) => RContract p Record l1 r1 l2 r2
(RProxying f r1) => RContract Function f l0 r0 l1 r1

#contract Source

contract :: forall r2 r1 r0 p l2 l1 l0 f. GContract p f l0 r0 l1 r1 l2 r2 => RowToList r0 l0 => RowToList r1 l1 => RowToList r2 l2 => Union r2 r0 r1 => p (f r1) (f r2)

Re-exports from Data.Struct.ContractOrAlt

#RContractOrAlt Source

class RContractOrAlt (p :: Type -> Type -> Type) (f :: Row Type -> Type) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) | l0 -> r0, l1 -> r1 where

Members

rcontractOrAlt :: forall r h g. Alternative h => RLProxying g l0 => RLProxying g l1 => Union r1 r r0 => g l0 -> g l1 -> p (f r0) (h (f r1))

Instances

(Keys l1, RowToList r1 l1, ListToRow l1 r1) => RContractOrAlt Function Record l0 r0 l1 r1
(Contractable r0 r1) => RContractOrAlt Function Variant l0 r0 l1 r1
(RProxying f r1) => RContractOrAlt Function f l0 r0 l1 r1

#contractOrAlt Source

contractOrAlt :: forall r1 r0 r p l1 l0 h f. Alternative h => Keys l1 => RContractOrAlt p f l0 r0 l1 r1 => RowToList r0 l0 => RowToList r1 l1 => Union r1 r r0 => p (f r0) (h (f r1))

Re-exports from Data.Struct.Delete

#RDelete Source

class RDelete (p :: Type -> Type -> Type) (f :: Row Type -> Type) (g :: Symbol -> Type) (s :: Symbol) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) | l0 -> r0, l1 -> r1 where

Members

rdelete :: forall v h. Cons s v r1 r0 => Lacks s r1 => RLProxying h l0 => RLProxying h l1 => h l0 -> h l1 -> g s -> p (f r0) (f r1)

Instances

(IsSymbol s) => RDelete Builder Record SProxy s l0 r0 l1 r1
(IsSymbol s) => RDelete Function Record SProxy s l0 r0 l1 r1
(RProxying f r1) => RDelete Function f g s l0 r0 l1 r1

#delete Source

delete :: forall v s r1 r0 p l1 l0 g f. Cons s v r1 r0 => Lacks s r1 => RDelete p f g s l0 r0 l1 r1 => RowToList r0 l0 => RowToList r1 l1 => g s -> p (f r0) (f r1)

Re-exports from Data.Struct.DisjointUnion

#RDisjointUnion Source

class RDisjointUnion (p :: Type -> Type -> Type) (f :: Row Type -> Type) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) (l2 :: RowList) (r2 :: Row Type) | l0 -> r0, l1 -> r1, l2 -> r2 where

Members

rdisjointUnion :: forall g. Nub r2 r2 => RLProxying g l0 => RLProxying g l1 => RLProxying g l2 => Union r0 r1 r2 => g l0 -> g l1 -> g l2 -> f r0 -> p (f r1) (f r2)

Instances

RDisjointUnion Builder Record l0 r0 l1 r1 l2 r2
RDisjointUnion Function Record l0 r0 l1 r1 l2 r2
(RProxying f r2) => RDisjointUnion Function f l0 r0 l1 r1 l2 r2

#disjointUnion Source

disjointUnion :: forall r2 r1 r0 p l2 l1 l0 f. Nub r2 r2 => RowToList r0 l0 => RowToList r1 l1 => RowToList r2 l2 => RDisjointUnion p f l0 r0 l1 r1 l2 r2 => Union r0 r1 r2 => f r0 -> p (f r1) (f r2)

Re-exports from Data.Struct.Empty

#REmpty Source

class REmpty (f :: Row Type -> Type)  where

Members

rempty :: f ()

Instances

REmpty Record
(RProxying g ()) => REmpty g

#empty Source

empty :: forall f. REmpty f => f ()

Re-exports from Data.Struct.Equal

#REqual Source

class REqual (f :: Row Type -> Type) (l :: RowList) (r :: Row Type) | l -> r where

Members

requal :: forall g. RLProxying g l => g l -> f r -> f r -> Boolean

Instances

(EqualFields l r, RowToList r l) => REqual Record l r
(RowToList r l, VariantEqs l, VariantTags l) => REqual Variant l r
(RProxying f r) => REqual f l r

#equal Source

equal :: forall r l f. REqual f l r => RowToList r l => f r -> f r -> Boolean

Re-exports from Data.Struct.Eval

#REval Source

class REval (p :: Type -> Type -> Type) (f :: Row Type -> Type) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) | l0 -> r0, l1 -> r1 where

Members

reval :: forall g. RLProxying g l0 => RLProxying g l1 => g l0 -> g l1 -> p (f r0) (f r1) -> f r0 -> f r1

Instances

(ObjectOf p (f r0), ObjectOf p (f r1), Slackable p) => REval p f l0 r0 l1 r1

#eval Source

eval :: forall r1 r0 p l1 l0 f. REval p f l0 r0 l1 r1 => RowToList r0 l0 => RowToList r1 l1 => p (f r0) (f r1) -> f r0 -> f r1

Re-exports from Data.Struct.Expand

#RExpand Source

class RExpand (p :: Type -> Type -> Type) (f :: Row Type -> Type) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) | l0 -> r0, l1 -> r1 where

Members

rexpand :: forall r g. RLProxying g l0 => RLProxying g l1 => Union r0 r r1 => g l0 -> g l1 -> p (f r0) (f r1)

Instances

RExpand Function Variant l0 r0 l1 r1
(RProxying f r1) => RExpand Function f l0 r0 l1 r1

#expand Source

expand :: forall r1 r0 r p l1 l0 f. RExpand p f l0 r0 l1 r1 => RowToList r0 l0 => RowToList r1 l1 => Union r0 r r1 => p (f r0) (f r1)

Re-exports from Data.Struct.Get

#RGet Source

class RGet (f :: Row Type -> Type) (g :: Symbol -> Type) (s :: Symbol) (l :: RowList) (r :: Row Type) | l -> r where

Members

rget :: forall v r' h. Cons s v r' r => RLProxying h l => h l -> g s -> f r -> v

Instances

(IsSymbol s, SProxying g s) => RGet Record g s l r

#get Source

get :: forall v s r' r l g f. Cons s v r' r => RGet f g s l r => RowToList r l => g s -> f r -> v

Re-exports from Data.Struct.GetOrAlt

#RGetOrAlt Source

class RGetOrAlt (f :: Row Type -> Type) (g :: Symbol -> Type) (s :: Symbol) (l :: RowList) (r :: Row Type) | l -> r where

Members

rgetOrAlt :: forall v r' i h. Alternative h => Cons s v r' r => RLProxying i l => i l -> g s -> f r -> h v

Instances

(IsSymbol s, SProxying g s) => RGetOrAlt Record g s l r
(IsSymbol s, SProxying g s) => RGetOrAlt Variant g s l r

#getOrAlt Source

getOrAlt :: forall v s r' r l h g f. Alternative h => Cons s v r' r => RowToList r l => RGetOrAlt f g s l r => g s -> f r -> h v

Re-exports from Data.Struct.Insert

#RInsert Source

class RInsert (p :: Type -> Type -> Type) (f :: Row Type -> Type) (g :: Symbol -> Type) (s :: Symbol) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) | l0 -> r0, l1 -> r1 where

Members

rinsert :: forall v h. Cons s v r0 r1 => Lacks s r0 => RLProxying h l0 => RLProxying h l1 => h l0 -> h l1 -> g s -> v -> p (f r0) (f r1)

Instances

(IsSymbol s, SProxying g s) => RInsert Builder Record g s l0 r0 l1 r1
(IsSymbol s, SProxying g s) => RInsert Function Record g s l0 r0 l1 r1
(IsSymbol s, SProxying g s) => RInsert Function Variant g s l0 r0 l1 r1
(RProxying f r1) => RInsert Function f g s l0 r0 l1 r1

#insert Source

insert :: forall v s r1 r0 p l1 l0 g f. Cons s v r0 r1 => Lacks s r0 => RInsert p f g s l0 r0 l1 r1 => RowToList r0 l0 => RowToList r1 l1 => g s -> v -> p (f r0) (f r1)

Re-exports from Data.Struct.Map

#GMap Source

class GMap (p :: Type -> Type -> Type) (f :: Row Type -> Type) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) (r2 :: Row Type) | l0 -> r0, l1 -> r1, l0 l1 -> r2 where

Members

gMap :: forall g. RLProxying g l0 => RLProxying g l1 => g l0 -> g l1 -> Record r0 -> p (f r1) (f r2)

Instances

(Category p) => GMap p f Nil () l r r
(Cons s (va -> vb) r0' r0, Cons s va r r2', Cons s vb r r2, GMap p f l0' r0' l1 r1 r2', IsSymbol s, RGet Record SProxy s l0 r0, RModify p f SProxy s l2' r2' l2 r2, Semigroupoid p) => GMap p f (Cons s v l0') r0 l1 r1 r2

#RMap Source

class RMap (p :: Type -> Type -> Type) (f :: Row Type -> Type) (g :: Row Type -> Type) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) (r2 :: Row Type) | l0 -> r0, l1 -> r1, l0 l1 -> r2 where

Members

rmap :: forall h. RLProxying h l0 => RLProxying h l1 => h l0 -> h l1 -> g r0 -> p (f r1) (f r2)

Instances

(GMap p Record l0 r0 l1 r1 r2) => RMap p Record Record l0 r0 l1 r1 r2
(GMap p Variant l0 r0 l1 r1 r2) => RMap p Variant Record l0 r0 l1 r1 r2
(RProxying f r2) => RMap Function f g l0 r0 l1 r1 r2

#map Source

map :: forall r2 r1 r0 p l1 l0 g f. RMap p f g l0 r0 l1 r1 r2 => RowToList r0 l0 => RowToList r1 l1 => g r0 -> p (f r1) (f r2)

Re-exports from Data.Struct.Match

#RMatch Source

class RMatch (f :: Row Type -> Type) (g :: Row Type -> Type) (v :: Type) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) | l0 -> r0, l1 -> r1 where

Members

rmatch :: forall h. RLProxying h l0 => RLProxying h l1 => h l0 -> h l1 -> f r0 -> g r1 -> v

Instances

(RowToList r0 l0, Union r1 () r1, VariantMatchCases l0 r1 v) => RMatch Record Variant v l0 r0 l1 r1

#match Source

match :: forall v r1 r0 l1 l0 g f. RMatch f g v l0 r0 l1 r1 => RowToList r0 l0 => RowToList r1 l1 => f r0 -> g r1 -> v

Re-exports from Data.Struct.Merge

#RMerge Source

class RMerge (p :: Type -> Type -> Type) (f :: Row Type -> Type) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) (l2 :: RowList) (r2 :: Row Type) | l0 -> r0, l1 -> r1, l2 -> r2 where

Members

rmerge :: forall r3 g. Nub r2 r3 => RLProxying g l0 => RLProxying g l1 => RLProxying g l2 => Union r0 r1 r2 => g l0 -> g l1 -> g l2 -> f r0 -> p (f r1) (f r3)

Instances

(Union r1 r0 r2) => RMerge Builder Record l0 r0 l1 r1 l2 r2
RMerge Function Record l0 r0 l1 r1 l2 r2
RMerge Function RProxy l0 r0 l1 r1 l2 r2

#merge Source

merge :: forall r3 r2 r1 r0 p l2 l1 l0 f. Nub r2 r3 => RMerge p f l0 r0 l1 r1 l2 r2 => RowToList r0 l0 => RowToList r1 l1 => RowToList r2 l2 => Union r0 r1 r2 => f r0 -> p (f r1) (f r3)

Re-exports from Data.Struct.Modify

#RModify Source

class RModify (p :: Type -> Type -> Type) (f :: Row Type -> Type) (g :: Symbol -> Type) (s :: Symbol) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) | l0 -> r0, l1 -> r1 where

Members

rmodify :: forall v1 v0 r h. Cons s v0 r r0 => Cons s v1 r r1 => RLProxying h l0 => RLProxying h l1 => h l0 -> h l1 -> g s -> (v0 -> v1) -> p (f r0) (f r1)

Instances

(IsSymbol s, SProxying g s) => RModify Builder Record g s l0 r0 l1 r1
(IsSymbol s, SProxying g s) => RModify Function Record g s l0 r0 l1 r1
(IsSymbol s, SProxying g s) => RModify Function Variant g s l0 r0 l1 r1
(RProxying f r1) => RModify Function f g s l0 r0 l1 r1

#modify Source

modify :: forall v1 v0 s r1 r0 r p l1 l0 g f. Cons s v0 r r0 => Cons s v1 r r1 => RModify p f g s l0 r0 l1 r1 => RowToList r0 l0 => RowToList r1 l1 => g s -> (v0 -> v1) -> p (f r0) (f r1)

Re-exports from Data.Struct.Nub

#RNub Source

class RNub (p :: Type -> Type -> Type) (f :: Row Type -> Type) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) | l0 -> r0, l1 -> r1 where

Members

rnub :: forall g. Nub r0 r1 => RLProxying g l0 => RLProxying g l1 => g l0 -> g l1 -> p (f r0) (f r1)

Instances

RNub Builder Record l0 r0 l1 r1
RNub Function Record l0 r0 l1 r1
RNub Function Variant l0 r0 l1 r1
(RProxying f r1) => RNub Function f l0 r0 l1 r1

#nub Source

nub :: forall r1 r0 p l1 l0 f. Nub r0 r1 => RNub p f l0 r0 l1 r1 => RowToList r0 l0 => RowToList r1 l1 => p (f r0) (f r1)

Re-exports from Data.Struct.On

#ROn Source

class ROn (f :: Row Type -> Type) (g :: Symbol -> Type) (s :: Symbol) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) | l0 -> r0, l1 -> r1 where

Members

ron :: forall h b a. Cons s a r0 r1 => RLProxying h l0 => RLProxying h l1 => h l0 -> h l1 -> g s -> (a -> b) -> (f r0 -> b) -> f r1 -> b

Instances

(IsSymbol s, SProxying g s) => ROn Variant g s l0 r0 l1 r1

#on Source

on :: forall s r1 r0 l1 l0 g f b a. Cons s a r0 r1 => ROn f g s l0 r0 l1 r1 => RowToList r0 l0 => RowToList r1 l1 => g s -> (a -> b) -> (f r0 -> b) -> f r1 -> b

Re-exports from Data.Struct.OnMatch

#ROnMatch Source

class ROnMatch (f :: Row Type -> Type) (g :: Row Type -> Type) (v :: Type) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) (l2 :: RowList) (r2 :: Row Type) (l3 :: RowList) (r3 :: Row Type) | l0 -> r0, l1 -> r1, l2 -> r2, l3 -> r3 where

Members

ronMatch :: forall h. RLProxying h l0 => RLProxying h l1 => RLProxying h l2 => RLProxying h l3 => Union r1 r2 r3 => h l0 -> h l1 -> h l2 -> h l3 -> f r0 -> (g r2 -> v) -> g r3 -> v

Instances

(RowToList r0 l0, VariantMatchCases l0 r1 v) => ROnMatch Record Variant v l0 r0 l1 r1 l2 r2 l3 r3

#onMatch Source

onMatch :: forall v r3 r2 r1 r0 l3 l2 l1 l0 g f. ROnMatch f g v l0 r0 l1 r1 l2 r2 l3 r3 => RowToList r0 l0 => RowToList r1 l1 => RowToList r2 l2 => RowToList r3 l3 => Union r1 r2 r3 => f r0 -> (g r2 -> v) -> g r3 -> v

Re-exports from Data.Struct.Rename

#RRename Source

class RRename (p :: Type -> Type -> Type) (f :: Row Type -> Type) (g :: Symbol -> Type) (s0 :: Symbol) (s1 :: Symbol) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) | l0 -> r0, l1 -> r1 where

Members

rrename :: forall v r h. Cons s0 v r r0 => Cons s1 v r r1 => Lacks s0 r => Lacks s0 r1 => Lacks s1 r => Lacks s1 r0 => RLProxying h l0 => RLProxying h l1 => h l0 -> h l1 -> g s0 -> g s1 -> p (f r0) (f r1)

Instances

(IsSymbol s0, IsSymbol s1, SProxying g s0, SProxying g s1) => RRename Builder Record g s0 s1 l0 r0 l1 r1
(IsSymbol s0, IsSymbol s1, SProxying g s0, SProxying g s1) => RRename Function Record g s0 s1 l0 r0 l1 r1
(IsSymbol s0, IsSymbol s1, SProxying g s0, SProxying g s1) => RRename Function Variant g s0 s1 l0 r0 l1 r1
(RProxying f r1) => RRename Function f g s0 s1 l0 r0 l1 r1

#rename Source

rename :: forall v s1 s0 r1 r0 r p l1 l0 g f. Cons s0 v r r0 => Cons s1 v r r1 => Lacks s0 r => Lacks s0 r1 => Lacks s1 r => Lacks s1 r0 => RowToList r0 l0 => RowToList r1 l1 => RRename p f g s0 s1 l0 r0 l1 r1 => g s0 -> g s1 -> p (f r0) (f r1)

Re-exports from Data.Struct.RenameMany

#GRenameMany Source

class GRenameMany (l0 :: RowList) (l1 :: RowList) (l2 :: RowList) | l0 l1 -> l2, l0 l2 -> l1

Instances

(GRenameMany_ l0 l1 l2 True) => GRenameMany l0 l1 l2

#RRenameMany Source

class RRenameMany (p :: Type -> Type -> Type) (f :: Row Type -> Type) (g :: Row Type -> Type) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) (l2 :: RowList) (r2 :: Row Type) | l0 -> r0, l1 -> r1, l2 -> r2, l0 l1 -> l2, l0 l2 -> l1 where

Members

rrenameMany :: GRenameMany l0 l1 l2 => g r0 -> p (f r1) (f r2)

Instances

(ListToRow l1 r1, ReifyKeyAndValueSymbols l0, RowToList r0 l0, RowToList r2 l2) => RRenameMany Builder Record g l0 r0 l1 r1 l2 r2
(ListToRow l1 r1, ReifyKeyAndValueSymbols l0, RowToList r0 l0, RowToList r2 l2) => RRenameMany Function Record g l0 r0 l1 r1 l2 r2
(RProxying f r2) => RRenameMany Function f g l0 r0 l1 r1 l2 r2

Re-exports from Data.Struct.Set

#RSet Source

class RSet (p :: Type -> Type -> Type) (f :: Row Type -> Type) (g :: Symbol -> Type) (s :: Symbol) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) | l0 -> r0, l1 -> r1 where

Members

rset :: forall v1 v0 r h. Cons s v0 r r0 => Cons s v1 r r1 => RLProxying h l0 => RLProxying h l1 => h l0 -> h l1 -> g s -> v1 -> p (f r0) (f r1)

Instances

(IsSymbol s, SProxying g s) => RSet Builder Record g s l0 r0 l1 r1
(IsSymbol s, SProxying g s) => RSet Function Record g s l0 r0 l1 r1
(IsSymbol s, SProxying g s) => RSet Function Variant g s l0 r0 l1 r1
(RProxying f r1) => RSet Function f g s l0 r0 l1 r1

#set Source

set :: forall v1 v0 s r r1 r0 p l1 l0 g f. Cons s v0 r r0 => Cons s v1 r r1 => RowToList r0 l0 => RowToList r1 l1 => RSet p f g s l0 r0 l1 r1 => g s -> v1 -> p (f r0) (f r1)

Re-exports from Data.Struct.Singleton

#RSingleton Source

class RSingleton (f :: Row Type -> Type) (g :: Symbol -> Type) (s :: Symbol)  where

Members

rsingleton :: forall v r. Cons s v () r => Lacks s () => g s -> v -> f r

Instances

(IsSymbol s, SProxying g s) => RSingleton Record g s

#singleton Source

singleton :: forall v s r g f. Cons s v () r => Lacks s () => RSingleton f g s => g s -> v -> f r

Re-exports from Data.Struct.Union

#RUnion Source

class RUnion (p :: Type -> Type -> Type) (f :: Row Type -> Type) (l0 :: RowList) (r0 :: Row Type) (l1 :: RowList) (r1 :: Row Type) (l2 :: RowList) (r2 :: Row Type) | l0 -> r0, l1 -> r1, l2 -> r2 where

Members

runion :: forall g. RLProxying g l0 => RLProxying g l1 => RLProxying g l2 => Union r0 r1 r2 => g l0 -> g l1 -> g l2 -> f r0 -> p (f r1) (f r2)

Instances

(Union r1 r0 r2) => RUnion Builder Record l0 r0 l1 r1 l2 r2
RUnion Function Record l0 r0 l1 r1 l2 r2
(RProxying f r2) => RUnion Function f l0 r0 l1 r1 l2 r2

#union Source

union :: forall r2 r1 r0 p l2 l1 l0 f. RowToList r0 l0 => RowToList r1 l1 => RowToList r2 l2 => RUnion p f l0 r0 l1 r1 l2 r2 => Union r0 r1 r2 => f r0 -> p (f r1) (f r2)

Re-exports from Data.Struct.Utils.HasSymbol

#HasSymbol Source

class HasSymbol (l :: RowList) (s :: Symbol) (b :: Boolean) | l s -> b

Instances

(HasSymbol_ l s b True) => HasSymbol l s b

Re-exports from Data.Struct.Utils.HasSymbolValue

#HasSymbolValue Source

class HasSymbolValue (l :: RowList) (s :: Symbol) (b :: Boolean) | l s -> b

Instances

(HasSymbolValue_ l s b True) => HasSymbolValue l s b

Re-exports from Data.Struct.Utils.ReifyKeyAndValueSymbols

#ReifyKeyAndValueSymbols Source

class ReifyKeyAndValueSymbols (l :: RowList)  where

Members

reifyKeyAndValueSymbols' :: forall f. RLProxying f l => f l -> List (Tuple String String)

Instances

ReifyKeyAndValueSymbols Nil
(IsSymbol s0, IsSymbol s1, ReifyKeyAndValueSymbols l') => ReifyKeyAndValueSymbols (Cons s0 (f s1) l')

#reifyKeyAndValueSymbols Source

reifyKeyAndValueSymbols :: forall r l f. ReifyKeyAndValueSymbols l => RowToList r l => f r -> List (Tuple String String)

Modules: Data.Struct; Data.Struct.Compare; Data.Struct.Compare.Compare; Data.Struct.Compare.RCompare; Data.Struct.Const; Data.Struct.Const.Const; Data.Struct.Const.RConst; Data.Struct.Contract; Data.Struct.Contract.Contract; Data.Struct.Contract.GContract; Data.Struct.Contract.RContract; Data.Struct.ContractOrAlt; Data.Struct.ContractOrAlt.ContractOrAlt; Data.Struct.ContractOrAlt.RContractOrAlt; Data.Struct.Delete; Data.Struct.Delete.Delete; Data.Struct.Delete.RDelete; Data.Struct.DisjointUnion; Data.Struct.DisjointUnion.DisjointUnion; Data.Struct.DisjointUnion.RDisjointUnion; Data.Struct.Empty; Data.Struct.Empty.REmpty; Data.Struct.Equal; Data.Struct.Equal.Equal; Data.Struct.Equal.REqual; Data.Struct.Eval; Data.Struct.Eval.Eval; Data.Struct.Eval.REval; Data.Struct.Expand; Data.Struct.Expand.Expand; Data.Struct.Expand.RExpand; Data.Struct.Get; Data.Struct.Get.Get; Data.Struct.Get.RGet; Data.Struct.GetOrAlt; Data.Struct.GetOrAlt.GetOrAlt; Data.Struct.GetOrAlt.RGetOrAlt; Data.Struct.Insert; Data.Struct.Insert.Insert; Data.Struct.Insert.RInsert; Data.Struct.Map; Data.Struct.Map.GMap; Data.Struct.Map.Map; Data.Struct.Map.RMap; Data.Struct.Match; Data.Struct.Match.Match; Data.Struct.Match.RMatch; Data.Struct.Merge; Data.Struct.Merge.Merge; Data.Struct.Merge.RMerge; Data.Struct.Modify; Data.Struct.Modify.Modify; Data.Struct.Modify.RModify; Data.Struct.Nub; Data.Struct.Nub.Nub; Data.Struct.Nub.RNub; Data.Struct.On; Data.Struct.On.On; Data.Struct.On.ROn; Data.Struct.OnMatch; Data.Struct.OnMatch.OnMatch; Data.Struct.OnMatch.ROnMatch; Data.Struct.Rename; Data.Struct.Rename.RRename; Data.Struct.Rename.Rename; Data.Struct.RenameMany; Data.Struct.RenameMany.GRenameMany; Data.Struct.RenameMany.RRenameMany; Data.Struct.Set; Data.Struct.Set.RSet; Data.Struct.Set.Set; Data.Struct.Singleton; Data.Struct.Singleton.RSingleton; Data.Struct.Union; Data.Struct.Union.RUnion; Data.Struct.Union.Union; Data.Struct.Utils.HasSymbol; Data.Struct.Utils.HasSymbolValue; Data.Struct.Utils.Record; Data.Struct.Utils.ReifyKeyAndValueSymbols