Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

  1. KSet :: Kind -> Kind

    sbv Data.SBV.Trans

    No documentation available.

  2. isSet :: HasKind a => a -> Bool

    sbv Data.SBV.Trans

    No documentation available.

  3. sSetBitTo :: SFiniteBits a => SBV a -> SBV a -> SBool -> SBV a

    sbv Data.SBV.Trans

    Variant of setBitTo when the index is symbolic. If the index it out-of-bounds, then the result is underspecified.

  4. solverSetOptions :: SMTConfig -> [SMTOption]

    sbv Data.SBV.Trans

    Options to set as we start the solver

  5. checkSatAssumingWithUnsatisfiableSet :: (MonadIO m, MonadQuery m) => [SBool] -> m (CheckSatResult, Maybe [SBool])

    sbv Data.SBV.Trans.Control

    Generalization of checkSatAssumingWithUnsatisfiableSet

  6. resetAssertions :: (MonadIO m, MonadQuery m) => m ()

    sbv Data.SBV.Trans.Control

    Generalization of resetAssertions

  7. variationsSetAxis :: FontDescriptionAxis a => a -> Variations -> Variations

    simple-pango Data.Font.VariationAxis

    No documentation available.

  8. variationsSetAxis :: FontDescriptionAxis a => a -> Variations -> Variations

    simple-pango Data.Font.VariationAxis.Internal

    No documentation available.

  9. type Offset = Int

    store-core Data.Store.Core

    How far into the given Ptr to look

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

Page 163 of many | Previous | Next