Hoogle Search
Within LTS Haskell 24.52 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
extremumNoEq :: Fractional a => (On (Forward (Forward a)) -> On (Forward (Forward a))) -> a -> [a]ad Numeric.AD.Rank1.Newton The extremumNoEq function behaves the same as extremum except that it doesn't truncate the list once the results become constant. This means it can be used with types without an Eq instance.
findZeroNoEq :: Fractional a => (Forward a -> Forward a) -> a -> [a]ad Numeric.AD.Rank1.Newton The findZeroNoEq function behaves the same as findZero except that it doesn't truncate the list once the results become constant. This means it can be used with types without an Eq instance.
fixedPointNoEq :: Fractional a => (Forward a -> Forward a) -> a -> [a]ad Numeric.AD.Rank1.Newton The fixedPointNoEq function behaves the same as fixedPoint except that it doesn't truncate the list once the results become constant. This means it can be used with types without an Eq instance.
inverseNoEq :: Fractional a => (Forward a -> Forward a) -> a -> a -> [a]ad Numeric.AD.Rank1.Newton The inverseNoEq function behaves the same as inverse except that it doesn't truncate the list once the results become constant. This means it can be used with types without an Eq instance.
Sequence :: ASN1ConstructionTypeasn1-encoding Data.ASN1.Prim No documentation available.
sequence :: (Traversable t, Monad m) => t (m a) -> m (t a)base-compat-batteries Control.Monad.Compat Evaluate each monadic action in the structure from left to right, and collect the results. For a version that ignores the results see sequence_.
Examples
Basic usage: The first two examples are instances where the input and and output of sequence are isomorphic.>>> sequence $ Right [1,2,3,4] [Right 1,Right 2,Right 3,Right 4]
>>> sequence $ [Right 1,Right 2,Right 3,Right 4] Right [1,2,3,4]
The following examples demonstrate short circuit behavior for sequence.>>> sequence $ Left [1,2,3,4] Left [1,2,3,4]
>>> sequence $ [Left 0, Right 1,Right 2,Right 3,Right 4] Left 0
sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()base-compat-batteries Control.Monad.Compat Evaluate each monadic action in the structure from left to right, and ignore the results. For a version that doesn't ignore the results see sequence. sequence_ is just like sequenceA_, but specialised to monadic actions.
class
TestEquality (f :: k -> Type)base-compat-batteries Data.Type.Equality.Compat This class contains types where you can learn the equality of two types from information contained in terms. The result should be Just Refl if and only if the types applied to f are equal:
testEquality (x :: f a) (y :: f b) = Just Refl ⟺ a = b
Typically, only singleton types should inhabit this class. In that case type argument equality coincides with term equality:testEquality (x :: f a) (y :: f b) = Just Refl ⟺ a = b ⟺ x = y
isJust (testEquality x y) = x == y
Singleton types are not required, however, and so the latter two would-be laws are not in fact valid in general.testEquality :: forall (a :: k) (b :: k) . TestEquality f => f a -> f b -> Maybe (a :~: b)base-compat-batteries Data.Type.Equality.Compat Conditionally prove the equality of a and b.
liftEq2Const :: Bool -> (a -> b -> Bool) -> (c -> d -> Bool) -> f a c -> f b d -> Boolderiving-compat Data.Deriving.Internal No documentation available.