Hoogle Search
Within LTS Haskell 24.9 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
toPrintSettings :: PrintSettingsClass o => o -> PrintSettingsgtk Graphics.UI.Gtk.Printing.PrintSettings No documentation available.
-
prettyprinter-combinators Prettyprinter.Combinators No documentation available.
ppIntSetWith :: (Int -> Doc ann) -> IntSet -> Doc annprettyprinter-combinators Prettyprinter.Combinators No documentation available.
C_IntSet :: PrimClassifier IntSetrecover-rtti Debug.RecoverRTTI No documentation available.
type
ConstraintSet = Symbolic ()sbv Data.SBV 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.
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.
-
set-cover Math.SetCover.Exact.Priority No documentation available.
pangoTabArrayIntSetTab :: PrimMonad m => PangoTabArrayInt (PrimState m) -> CInt -> CInt -> m ()simple-pango Graphics.Pango.LowLevel.TabStops No documentation available.
pangoTabArrayIntSetTab :: PrimMonad m => PangoTabArrayInt (PrimState m) -> CInt -> CInt -> m ()simple-pango Graphics.Pango.LowLevel.TabStops.Internal No documentation available.
toIntSet :: forall (m :: Type -> Type) . Monad m => Fold m Int IntSetstreamly-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