Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

  1. notebookStyleHasForwardStepper :: NotebookClass self => ReadAttr self Bool

    gtk Graphics.UI.Gtk.Layout.Notebook

    The notebookStyleHasForwardStepper property determines whether the standard forward arrow button is displayed. Default value : True

    • Available since Gtk version 2.4

  2. notebookStyleHasSecondaryBackwardStepper :: NotebookClass self => ReadAttr self Bool

    gtk Graphics.UI.Gtk.Layout.Notebook

    The notebookStyleHasSecondaryBackwardStepper property determines whether a second backward arrow button is displayed on the opposite end of the tab area. Default value: False

    • Available since Gtk version 2.4

  3. notebookStyleHasSecondaryForwardStepper :: NotebookClass self => ReadAttr self Bool

    gtk Graphics.UI.Gtk.Layout.Notebook

    The notebookStyleHasSecondaryForwardStepper property determines whether a second forward arrow button is displayed on the opposite end of the tab area. Default value: False

    • Available since Gtk version 2.4

  4. adjustmentGetStepIncrement :: Adjustment -> IO Double

    gtk Graphics.UI.Gtk.Misc.Adjustment

    Retrieve the step-increment value.

  5. adjustmentSetStepIncrement :: Adjustment -> Double -> IO ()

    gtk Graphics.UI.Gtk.Misc.Adjustment

    Set the step-increment value.

  6. adjustmentStepIncrement :: Attr Adjustment Double

    gtk Graphics.UI.Gtk.Misc.Adjustment

    The step increment of the adjustment. Default value: 0

  7. data MovementStep

    gtk Graphics.UI.Gtk.Multiline.TextView

    Movement in text widget

  8. type family SimplifyStep p :: Maybe Type

    rerefined Rerefined.Simplify.Core

    Try to perform a single simplification step on the given predicate. Returns Nothing if we were unable to simplify.

  9. data InductionStep

    sbv Data.SBV.Tools.Induction

    A step in an inductive proof. If the tag is present (i.e., Just nm), then the step belongs to the subproof that establishes the strengthening named nm.

  10. simplifyStep :: (SimpleExpr -> SimpleExpr) -> SimpleExpr -> SimpleExpr

    simple-expr Debug.SimpleExpr.Expr

    Minimalistic simplification step.

    Examples of usage

    >>> import Prelude (($), id)

>>> import NumHask ((+), (*), (**))

    >>> simplifyStep id (0 + (0 + (0 + 10)))
0+(0+10)

    >>> simplifyStep id (1 * (0 + (10 ** 1)))
0+(10^1)

Page 72 of many | Previous | Next