Hoogle Search
Within LTS Haskell 24.3 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
type
IntSet s = Dict KnownIntSet srefined-containers Data.IntSet.Refined A IntSet whose contents are tracked by the type parameter s. This is a "singleton": for a given s there's only one value of this type. Since this is just a Dict, you can freely convert between the value (IntSet) and the constraint (KnownIntSet). This library prefers to use the constraint.
intSet :: IntSet -> Unfoldr Intdeferred-folds DeferredFolds.Unfoldr Elements of IntSet.
intSet :: TomlCodec Int -> Key -> TomlCodec IntSettomland Toml.Codec.Combinator.Set Codec for IntSet. Represented in TOML as an array of tables. Example: Haskell IntSet can look like this in your TOML file:
foo = [ {a = 1} , {a = 2} ]
Decodes to an empty IntSet in case of the missing field in TOML.-
semirings Data.Semiring Wrapper to mimic Set (Sum Int), Set (Product Int), etc., while having a more efficient underlying representation.
IntSetOf :: IntSet -> IntSetOf asemirings Data.Semiring No documentation available.
-
what4 What4.Expr.MATLAB No documentation available.
-
yaya-containers Yaya.Containers.Pattern.IntSet No documentation available.
intSetToEnumSet :: IntSet -> EnumSet kenummapset Data.EnumSet Wrap IntSet.
intSetFromSetAssigns :: Ord a => [Assign label (Set a)] -> [Assign label IntSet]set-cover Math.SetCover.Exact Like bitVectorFromSetAssigns but generates IntSet instead of Integer bitvectors. Since containers-0.5.5 as shipped with GHC-7.8.4, IntSet should usually be more efficient than Integer.
-
what4 What4.Interface Convert a signed bitvector to the nearest signed bitvector with the given width. If the resulting width is smaller, this clamps the value to min-int or max-int when necessary.