Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. (.==) :: forall (l :: Symbol) a . KnownSymbol l => Label l -> a -> Rec (l .== a)

    row-types Data.Row

    The singleton record

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

    row-types Data.Row

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

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

    row-types Data.Row

    The minimum join of the two rows.

  4. 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.

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

    row-types Data.Row.Internal

    Type level label fetching

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

    row-types Data.Row.Internal

    Type level Row append

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

    row-types Data.Row.Internal

    Type level Row element removal

  8. 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.

  9. 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?

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

    row-types Data.Row.Internal

    The minimum join of the two rows.

Page 41 of many | Previous | Next