Hoogle Search
Within LTS Haskell 24.18 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
- 
hashmap Data.HashSet The abstract type of a Set. Its interface is a suitable subset of IntSet.
 - 
hedn Data.EDN #{a set} - 
hedn Data.EDN.AST.Types.Value #{a set} class
Set (b :: Type -> Type) (m :: Type -> Type) a v | m -> b, a -> b vmetrics Data.Metrics.Types Update a metric by performing wholesale replacement of a value.
- 
This module provides set-specific multimap functionality.
 - 
The type RS.RSet a is like Set a, but allows recursive definitions:
>>> :{ let s1 = RS.insert 23 s2 s2 = RS.insert 42 s1 in RS.get s1 :} fromList [23,42] - 
This module provides a type TSet c, which is a set of list of some characters. It serves almost same purpose to Set [c], and functions of this module mirrors functions with same name from Data.Set module. The advantages to use this module over Data.Set are:
- Faster member.
 - Partial match provided by beginWith function.
 - Efficient append, prefixes, and suffixes functions.
 
- Some operations are slower than Set [c]. Especially, count is much much slower than size (because Set.size is already recorded in the data structure). Consider TSet.count be like length of list.
 - Constructed TSet c from a list of lists [[c]] do not share each member lists with original list unlike Set [c] does. This means holding both TSet c and [[c]] in memory consumes much more memory than Set [c] and [[c]].
 
 - 
ecstasy Data.Ecstasy Set the current value.
 - 
ecstasy Data.Ecstasy.Types Set the current value.
 - 
redis-resp Data.Redis.Command No documentation available.