Hoogle Search
Within LTS Haskell 24.36 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
divideMaybe :: C a => a -> a -> a -> Maybe anumeric-prelude Number.ResidueClass The division may be ambiguous. In this case an arbitrary quotient is returned.
0:4 * 2:4 == 0/:4 2:4 * 2:4 == 0/:4
isCompatibleMaybe :: Eq a => Maybe a -> Maybe a -> Boolnumeric-prelude Number.ResidueClass.Maybe No documentation available.
matchMaybe :: Maybe a -> Maybe a -> Maybe anumeric-prelude Number.ResidueClass.Maybe No documentation available.
-
parameterized-utils Data.Parameterized.Map Applies a function to the pairwise common elements of two maps. Formally, we have that intersectWithKeyMaybe f x y contains a binding from a key k to a value v if and only if x and y bind k to x_k and y_k and f x_k y_k = Just v.
mapMaybeWithKey :: (forall (tp :: v) . () => k tp -> f tp -> Maybe (g tp)) -> MapF k f -> MapF k gparameterized-utils Data.Parameterized.Map Map keys and elements and collect Just results.
fromMaybeS :: a -> MaybeS a -> aparameterized-utils Data.Parameterized.Utils.BinTree No documentation available.
elemAtMaybe :: forall (n :: Natural) a . Int -> Vector n a -> Maybe aparameterized-utils Data.Parameterized.Vector Get the element at the given index. O(1)
insertAtMaybe :: forall a (n :: Natural) . Int -> a -> Vector n a -> Maybe (Vector n a)parameterized-utils Data.Parameterized.Vector Insert an element at the given index. Return Nothing if the element is outside the vector bounds. O(n).
mapMaybeNoNull :: (a -> Maybe b) -> MonoidalMap token a -> Maybe (MonoidalMap token b)reflex Data.AppendMap Like mapMaybe but indicates whether the resulting container is empty
class
FunctorMaybe (f :: Type -> Type)reflex Reflex.Class Deprecated: Use Filterable from Data.Witherable instead