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.

  1. type family (l :: Row k) .\\ (r :: Row k) :: Row k

    row-types Data.Row

    Type level Row difference. That is, l .\\ r is the row remaining after removing any matching elements of r from l.

  2. type family (r :: Row k) .! (t :: Symbol) :: k

    row-types Data.Row.Internal

    Type level label fetching

  3. type family (l :: Row k) .+ (r :: Row k) :: Row k

    row-types Data.Row.Internal

    Type level Row append

  4. type family (r :: Row k) .- (s :: Symbol) :: Row k

    row-types Data.Row.Internal

    Type level Row element removal

  5. type family (l :: Row k) .// (r :: Row k) :: Row k

    row-types Data.Row.Internal

    The overwriting union, where the left row overwrites the types of the right row where the labels overlap.

  6. type family (r :: Row k) .\ (l :: Symbol)

    row-types Data.Row.Internal

    Does the row lack (i.e. it does not have) the specified label?

  7. type family (l :: Row k) .\/ (r :: Row k) :: Row k

    row-types Data.Row.Internal

    The minimum join of the two rows.

  8. type family (l :: Row k) .\\ (r :: Row k) :: Row k

    row-types Data.Row.Internal

    Type level Row difference. That is, l .\\ r is the row remaining after removing any matching elements of r from l.

  9. type family (r :: Row k) .! (t :: Symbol) :: k

    row-types Data.Row.Records

    Type level label fetching

  10. (.!) :: forall (l :: Symbol) (r :: Row Type) . KnownSymbol l => Rec r -> Label l -> r .! l

    row-types Data.Row.Records

    Record selection

Page 38 of many | Previous | Next