Hoogle Search
Within LTS Haskell 24.60 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
No documentation available.
-
No documentation available.
class
SubHSet (els :: [Type]) (els2 :: [Type])hset Data.HSet.SubHSet Takes subset of some hset, including subset of same elements in different order
>>> let x = (HSCons "hello" $ HSCons 1234 $ HSCons 12.123 HSNil) :: HSet '[String, Int, Double]
>>> subHSet x :: HSet '[Double, Int] HSCons (12.123) (HSCons (1234) (HSNil))
>>> subHSet x :: HSet '[String, Double] HSCons ("hello") (HSCons (12.123) (HSNil))>>> subHSet x :: HSet '[Int, String] HSCons (1234) (HSCons ("hello") (HSNil))-
hset Data.HSet.SubHSet No documentation available.
subHSet :: SubHSet els els2 => HSet els -> HSet els2hset Data.HSet.SubHSet No documentation available.
-
hset Data.HSet.Type Heterogeneous set (list of elements) with unique types. Useful with MonadReader.
fromSet :: MonoidNull v => (k -> v) -> Set k -> MonoidMap k vmonoidmap Data.MonoidMap Constructs a MonoidMap from a Set and a function from keys to values. Satisfies the following property for all possible keys k:
get k (fromSet f ks) == if Set.member k ks then f k else mempty
This function performs canonicalisation of null values, and has a time complexity that is linear in the size of the set.groupingSets :: AggregatingSetList a -> AggregateKey arelational-query Database.Relational Finalize grouping set list.
type
AggregatingPowerSet = QueryA AggregatingPowerSetrelational-query Database.Relational.Arrow Arrow type corresponding to AggregatingPowerSet
type
AggregatingSet = QueryA AggregatingSetrelational-query Database.Relational.Arrow Arrow type corresponding to AggregatingSet