Hoogle Search

Within LTS Haskell 24.51 (ghc-9.10.3)

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

Exact lookup

1. unsafeAdjust :: (a -> a) -> Int -> SmallArray a -> SmallArray a

   primitive-extras	PrimitiveExtras.SmallArray

   No documentation available.

2. unsafeAdjustWithSize :: (a -> a) -> Int -> Int -> SmallArray a -> SmallArray a

   primitive-extras	PrimitiveExtras.SmallArray

   No documentation available.

3. hoistDMapWithKeyWithAdjust :: forall k v v' t m p . (Adjustable t m, MonadHold t m, PatchTarget (p k (Constant (Behavior t Builder) :: Type -> Type)) ~ DMap k (Constant (Behavior t Builder) :: Type -> Type), Patch (p k (Constant (Behavior t Builder) :: Type -> Type))) => (forall (vv :: Type -> Type) (vv' :: Type -> Type) . () => (forall a . () => k a -> vv a -> m (vv' a)) -> DMap k vv -> Event t (p k vv) -> m (DMap k vv', Event t (p k vv'))) -> (forall (vv :: Type -> Type) (vv' :: Type -> Type) . () => (forall a . () => vv a -> vv' a) -> p k vv -> p k vv') -> (forall a . () => k a -> v a -> StaticDomBuilderT t m (v' a)) -> DMap k v -> Event t (p k v) -> StaticDomBuilderT t m (DMap k v', Event t (p k v'))

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

   No documentation available.

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

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

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

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

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

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

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

Page 115 of many | Previous | Next