Hoogle Search
Within LTS Haskell 24.67 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mkOrdLessEqual :: Typeable a => (a -> a -> Bool) -> [Expr]express Data.Express.Instances O(1). Builds a reified Ord instance from the given <= function. (cf. reifyOrd, mkOrd)
reifyEq :: (Typeable a, Eq a) => a -> [Expr]express Data.Express.Instances O(1). Reifies an Eq instance into a list of Exprs. The list will contain == and /= for the given type. (cf. mkEq, mkEquation)
> reifyEq (undefined :: Int) [ (==) :: Int -> Int -> Bool , (/=) :: Int -> Int -> Bool ]
> reifyEq (undefined :: Bool) [ (==) :: Bool -> Bool -> Bool , (/=) :: Bool -> Bool -> Bool ]
> reifyEq (undefined :: String) [ (==) :: [Char] -> [Char] -> Bool , (/=) :: [Char] -> [Char] -> Bool ]
reifyEqOrd :: (Typeable a, Ord a) => a -> [Expr]express Data.Express.Instances channelUpdateFreq :: Channel -> Maybe Integerfeed Text.RSS1.Syntax No documentation available.
class (IsList c, Item c ~ Element c, Monoid c, Collection c) =>
Sequential cfoundation Foundation A set of methods for ordered colection
deepseq :: NormalForm a => a -> b -> bfoundation Foundation No documentation available.
-
foundation Foundation The value of seq a b is bottom if a is bottom, and otherwise equal to b. In other words, it evaluates the first argument a to weak head normal form (WHNF). seq is usually introduced to improve performance by avoiding unneeded laziness. A note on evaluation order: the expression seq a b does not guarantee that a will be evaluated before b. The only guarantee given by seq is that the both a and b will be evaluated before seq returns a value. In particular, this means that b may be evaluated before a. If you need to guarantee a specific order of evaluation, you must use the function pseq from the "parallel" package.
frequency :: NonEmpty [(Word, Gen a)] -> Gen afoundation Foundation.Check Call one of the generator weighted
class (IsList c, Item c ~ Element c, Monoid c, Collection c) =>
Sequential cfoundation Foundation.Collection A set of methods for ordered colection
sequence :: (Mappable collection, Applicative m, Monad m) => collection (m a) -> m (collection a)foundation Foundation.Collection Evaluate each actions of the given collections, from left to right, and collect the results. For a version that ignores the results, see sequence_