Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

  1. rsubsetC :: forall g (f :: k -> Type) . (RecSubset record rs ss is, Functor g, RecSubsetFCtx record f) => (record f rs -> g (record f rs)) -> record f ss -> g (record f ss)

    vinyl Data.Vinyl.Lens

    This is a lens into a slice of the larger record. Morally, we have: 

    rsubset :: Lens' (Rec f ss) (Rec f rs)

  2. class FieldOffsetAux f ts t RIndex t ts => FieldOffset (f :: k -> Type) (ts :: [k]) (t :: k)

    vinyl Data.Vinyl.SRec

    A more concise constraint equivalent to FieldOffsetAux.

  3. class (RIndex t ts ~ i, RecAll f ts Storable) => FieldOffsetAux (f :: k -> Type) (ts :: [k]) (t :: k) (i :: Nat)

    vinyl Data.Vinyl.SRec

    The ability to work with a particular field of a Rec stored at a Ptr.

  4. fieldOffset :: FieldOffsetAux f ts t i => Int -> StorableAt f t

    vinyl Data.Vinyl.SRec

    Get the byte offset of a field from the given origin and the Storable dictionary needed to work with that field.

  5. srecGetSubset :: forall u (ss :: [u]) (rs :: [u]) (f :: u -> Type) . (RPureConstrained (FieldOffset f ss) rs, RPureConstrained (FieldOffset f rs) rs, RFoldMap rs, RMap rs, RApply rs, Storable (Rec f rs)) => SRec2 f f ss -> SRec2 f f rs

    vinyl Data.Vinyl.SRec

    Get a subset of a record's fields.

  6. srecSetSubset :: forall u (f :: u -> Type) (ss :: [u]) (rs :: [u]) . (rs ⊆ ss, RPureConstrained (FieldOffset f ss) rs, RPureConstrained (FieldOffset f rs) rs, RFoldMap rs, RMap rs, RApply rs, Storable (Rec f ss)) => SRec2 f f ss -> SRec2 f f rs -> SRec2 f f ss

    vinyl Data.Vinyl.SRec

    Set a subset of a record's fields.

  7. data InsOrdHashSet k

    insert-ordered-containers Data.HashSet.InsOrd

    HashSet which tries its best to remember insertion order of elements.

  8. fromHashSet :: HashSet k -> InsOrdHashSet k

    insert-ordered-containers Data.HashSet.InsOrd

    No documentation available.

  9. hashSet :: forall a p f . (Profunctor p, Functor f) => p (HashSet a) (f (HashSet a)) -> p (InsOrdHashSet a) (f (InsOrdHashSet a))

    insert-ordered-containers Data.HashSet.InsOrd

    This is a slight lie, as roundtrip doesn't preserve ordering.

  10. toHashSet :: InsOrdHashSet k -> HashSet k

    insert-ordered-containers Data.HashSet.InsOrd

    No documentation available.

Page 104 of many | Previous | Next