Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. class is ~ RImage rs ss => RecSubset (record :: k -> Type -> [k1] -> Type) (rs :: [k1]) (ss :: [k1]) (is :: [Nat])

   vinyl	Data.Vinyl.Lens

   If one field set is a subset another, then a lens of from the latter's record to the former's is evident. That is, we can either cast a larger record to a smaller one, or we may replace the values in a slice of a record.

2. 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)
   

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

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

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

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

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

8. data InsOrdHashSet k

   insert-ordered-containers	Data.HashSet.InsOrd

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

9. fromHashSet :: HashSet k -> InsOrdHashSet k

   insert-ordered-containers	Data.HashSet.InsOrd

   No documentation available.

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

Page 104 of many | Previous | Next