Hoogle Search

Within LTS Haskell 24.49 (ghc-9.10.3)

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

Exact lookup

1. lift2Maybe :: Eq i => (a -> b -> c) -> T i a -> T i b -> Maybe (T i c)

   numeric-prelude	Number.Physical

   No documentation available.

2. ratPowMaybe :: C a => T Int -> T i a -> Maybe (T i a)

   numeric-prelude	Number.Physical

   No documentation available.

3. subMaybe :: (Eq i, C a) => T i a -> T i a -> Maybe (T i a)

   numeric-prelude	Number.Physical

   Subtract two values if the units match, otherwise return Nothing

4. ratScaleMaybe :: T Int -> T i -> Maybe (T i)

   numeric-prelude	Number.Physical.Unit

   No documentation available.

5. ratScaleMaybe2 :: T Int -> T i -> Map i (Maybe Int)

   numeric-prelude	Number.Physical.Unit

   No documentation available.

6. divideMaybe :: C a => a -> a -> a -> Maybe a

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

7. isCompatibleMaybe :: Eq a => Maybe a -> Maybe a -> Bool

   numeric-prelude	Number.ResidueClass.Maybe

   No documentation available.

8. matchMaybe :: Maybe a -> Maybe a -> Maybe a

   numeric-prelude	Number.ResidueClass.Maybe

   No documentation available.

9. intersectWithKeyMaybe :: OrdF k => (forall (tp :: v) . () => k tp -> a tp -> b tp -> Maybe (c tp)) -> MapF k a -> MapF k b -> MapF k c

   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.

10. mapMaybeWithKey :: (forall (tp :: v) . () => k tp -> f tp -> Maybe (g tp)) -> MapF k f -> MapF k g

    parameterized-utils	Data.Parameterized.Map

    Map keys and elements and collect Just results.

Page 186 of many | Previous | Next