Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

  1. hoistIntMapWithKeyWithAdjust :: (Adjustable t m, MonadHold t m, Functor p, Patch (p (Behavior t Builder)), PatchTarget (p (Behavior t Builder)) ~ IntMap (Behavior t Builder)) => (forall x . () => (Key -> a -> m x) -> IntMap a -> Event t (p a) -> m (IntMap x, Event t (p x))) -> (Key -> a -> StaticDomBuilderT t m b) -> IntMap a -> Event t (p a) -> StaticDomBuilderT t m (IntMap b, Event t (p b))

    reflex-dom-core Reflex.Dom.Builder.Static

    No documentation available.

  2. adjust :: Text -> Text

    registry Data.Registry.Internal.Dot

    We need to process the node descriptions - we add quotes arountd the text - we remove quotes (") inside the text - we escape newlines

  3. pattern IsJust :: forall (l :: Symbol) r . (AllUniqueLabels r, KnownSymbol l) => Label l -> (r .! l) -> Var r

    row-types Data.Row

    A pattern for variants; can be used to both destruct a variant when in a pattern position or construct one in an expression position.

  4. pattern IsJust :: forall (l :: Symbol) r . (AllUniqueLabels r, KnownSymbol l) => Label l -> (r .! l) -> Var r

    row-types Data.Row.Variants

    A pattern for variants; can be used to both destruct a variant when in a pattern position or construct one in an expression position.

  5. fromJust :: SymVal a => SMaybe a -> SBV a

    sbv Data.SBV.Maybe

    Return the value of an optional value. The behavior is undefined if passed Nothing, i.e., it can return any value. Compare to fromMaybe. 

    >>> fromJust (sJust (literal 'a'))
'a' :: SChar

>>> prove $ \x -> fromJust (sJust x) .== (x :: SChar)
Q.E.D.

>>> sat $ \x -> x .== (fromJust sNothing :: SChar)
Satisfiable. Model:
s0 = 'A' :: Char
    Note how we get a satisfying assignment in the last case: The behavior is unspecified, thus the SMT solver picks whatever satisfies the constraints, if there is one.

  6. isJust :: SymVal a => SMaybe a -> SBool

    sbv Data.SBV.Maybe

    Check if the symbolic value is not nothing. 

    >>> isJust (sNothing :: SMaybe Integer)
False

>>> isJust (sJust (literal "yep"))
True

>>> prove $ \x -> isJust (sJust (x :: SInteger))
Q.E.D.

  7. sJust :: SymVal a => SBV a -> SMaybe a

    sbv Data.SBV.Maybe

    Construct an SMaybe a from an SBV a. 

    >>> sJust (3 :: SInteger)
Just 3 :: SMaybe Integer

  8. weekendJustOver :: IO OptimizeResult

    sbv Documentation.SBV.Examples.Optimization.Enumerate

    Using optimization, find the first day after the weekend. We have: 

    >>> weekendJustOver
Optimal model:
weekendJustOver       = Mon :: Day
DayAsWord8(first-day) =   0 :: Word8
first-day             = Mon :: Day

  9. getJustify :: Justify -> Bool

    simple-pango Graphics.Pango.Basic.LayoutObjects.PangoLayout

    No documentation available.

  10. getJustify :: Justify -> Bool

    simple-pango Graphics.Pango.Basic.LayoutObjects.PangoLayout.Internal

    No documentation available.

Page 103 of many | Previous | Next