Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. type ConstraintSet = Symbolic ()

    sbv Data.SBV.Trans

    A constraint set is a symbolic program that returns no values. The idea is that the constraints/min-max goals will serve as the collection of constraints that will be used for sat/optimize calls.

  2. queueIntSet :: MethodsIntSet

    set-cover Math.SetCover.Exact.Priority

    No documentation available.

  3. pangoTabArrayIntSetTab :: PrimMonad m => PangoTabArrayInt (PrimState m) -> CInt -> CInt -> m ()

    simple-pango Graphics.Pango.LowLevel.TabStops

    No documentation available.

  4. pangoTabArrayIntSetTab :: PrimMonad m => PangoTabArrayInt (PrimState m) -> CInt -> CInt -> m ()

    simple-pango Graphics.Pango.LowLevel.TabStops.Internal

    No documentation available.

  5. toIntSet :: forall (m :: Type -> Type) . Monad m => Fold m Int IntSet

    streamly-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

  6. toIntSet :: forall (m :: Type -> Type) . Monad m => Fold m Int IntSet

    streamly-core Streamly.Internal.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

  7. UIntSetWidthFn :: 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.

  8. uintSetWidth :: 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 an unsigned bitvector to the nearest unsigned bitvector with the given width (clamp on overflow).

  9. toIntSet :: [Int] -> IntSet

    discrimination Data.Discrimination

    O(n). Construct an IntSet in linear time. This is an asymptotically faster version of fromList, which exploits ordered discrimination.

  10. toIntSet :: [Int] -> IntSet

    discrimination Data.Discrimination.Sorting

    O(n). Construct an IntSet in linear time. This is an asymptotically faster version of fromList, which exploits ordered discrimination.

Page 34 of many | Previous | Next