Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
(
.! ) :: forall (l :: Symbol) (r :: Row Type) . KnownSymbol l => Rec r -> Label l -> r .! lrow-types Data.Row Record selection
type family (l :: Row k)
.+ (r :: Row k) :: Row krow-types Data.Row Type level Row append
(
.+ ) :: forall (l :: Row Type) (r :: Row Type) . FreeForall l => Rec l -> Rec r -> Rec (l .+ r)row-types Data.Row Record disjoint union (commutative)
type family (r :: Row k)
.- (s :: Symbol) :: Row krow-types Data.Row Type level Row element removal
(
.- ) :: forall (l :: Symbol) (r :: Row Type) . KnownSymbol l => Rec r -> Label l -> Rec (r .- l)row-types Data.Row Record restriction. Remove the label l from the record.
type family (l :: Row k)
.// (r :: Row k) :: Row krow-types Data.Row The overwriting union, where the left row overwrites the types of the right row where the labels overlap.
(
.// ) :: forall (r :: Row Type) (r' :: Row Type) . Rec r -> Rec r' -> Rec (r .// r')row-types Data.Row Record overwrite. The operation r .// r' creates a new record such that:
- Any label that is in both r and r' is in the resulting record with the type and value given by the fields in r,
- Any label that is only found in r is in the resulting record.
- Any label that is only found in r' is in the resulting record.
(
.== ) :: forall (l :: Symbol) a . KnownSymbol l => Label l -> a -> Rec (l .== a)row-types Data.Row The singleton record
type family (r :: Row k)
.\ (l :: Symbol)row-types Data.Row Does the row lack (i.e. it does not have) the specified label?
type family (l :: Row k)
.\/ (r :: Row k) :: Row krow-types Data.Row The minimum join of the two rows.