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.

  1. type IntSet s = Dict KnownIntSet s

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

  2. intSet :: IntSet -> Unfoldr Int

    deferred-folds DeferredFolds.Unfoldr

    Elements of IntSet.

  3. intSet :: TomlCodec Int -> Key -> TomlCodec IntSet

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

  4. newtype IntSetOf a

    semirings Data.Semiring

    Wrapper to mimic Set (Sum Int), Set (Product Int), etc., while having a more efficient underlying representation.

  5. IntSetOf :: IntSet -> IntSetOf a

    semirings Data.Semiring

    No documentation available.

  6. IntSetWidthFn :: forall (m :: Natural) (n :: Natural) (f :: BaseType -> Type) . (1 <= m, 1 <= n) => !NatRepr m -> !NatRepr n -> MatlabSolverFn f ((EmptyCtx :: Ctx BaseType) '::> BaseBVType m) ('BaseBVType n)

    what4 What4.Expr.MATLAB

    No documentation available.

  7. data IntSetF r

    yaya-containers Yaya.Containers.Pattern.IntSet

    No documentation available.

  8. intSetToEnumSet :: IntSet -> EnumSet k

    enummapset Data.EnumSet

    Wrap IntSet.

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

  10. intSetWidth :: forall (m :: Natural) (n :: Natural) . (IsExprBuilder sym, 1 <= m, 1 <= n) => sym -> SymBV sym m -> NatRepr n -> IO (SymBV sym n)

    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.

Page 3 of many | Previous | Next