Hoogle Search
Within Stackage Nightly 2025-10-07 (ghc-9.12.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
type family
Subset (r1 :: Row k) (r2 :: Row k)row-types Data.Row.Internal Is the first row a subset of the second? Or, does the second row contain every binding that the first one does?
type family
Subset (r1 :: Row k) (r2 :: Row k)row-types Data.Row.Records Is the first row a subset of the second? Or, does the second row contain every binding that the first one does?
-
row-types Data.Row.Records Turns a record into a HashMap from values representing the labels to the values of the record.
type family
Subset (r1 :: Row k) (r2 :: Row k)row-types Data.Row.Variants Is the first row a subset of the second? Or, does the second row contain every binding that the first one does?
variationsSetAxis :: FontDescriptionAxis a => a -> Variations -> Variationssimple-pango Data.Font.VariationAxis No documentation available.
variationsSetAxis :: FontDescriptionAxis a => a -> Variations -> Variationssimple-pango Data.Font.VariationAxis.Internal No documentation available.
-
store-core Data.Store.Core How far into the given Ptr to look
toIntSet :: forall (m :: Type -> Type) . Monad m => Fold m Int IntSetstreamly-core Streamly.Data.Fold Fold the input to an int set. For integer inputs this performs better than toSet. Definition:
>>> toIntSet = Fold.foldl' (flip IntSet.insert) IntSet.empty
toSet :: forall (m :: Type -> Type) a . (Monad m, Ord a) => Fold m a (Set a)streamly-core Streamly.Data.Fold Fold the input to a set. Definition:
>>> toSet = Fold.foldl' (flip Set.insert) Set.empty
toIntSet :: forall (m :: Type -> Type) . Monad m => Scanl m Int IntSetstreamly-core Streamly.Data.Scanl Scan the input adding it to an int set. For integer inputs this performs better than toSet. Definition:
>>> toIntSet = Scanl.mkScanl (flip IntSet.insert) IntSet.empty