:: (Num a, Enum a) => [a] -package:tidal-core
equalFuncList Comb.factorial Comb.factorials 1000
Compute the sequence of Catalan numbers by recurrence identity. It is
catalanNumbers !! n == catalanNumber n
equalFuncList Comb.catalanNumber Comb.catalanNumbers 1000
Number of fix-point-free permutations with
n elements.
http://oeis.org/A000166
equalFuncList Comb.derangementNumber Comb.derangementNumbers 1000
List of Bell numbers computed with the recursive formula given in
Wurzel 2004-06, page 136
Epsilon, the empty word (or list)
(ε) = []
(U+3B5, GREEK SMALL LETTER EPSILON)
Look up the previous accumulation
runAccum w look = return (w, w)
runAccum w (look >>= continuation) = runAccum w (continuation w)
Fail the current branch, and prevent backtracking within the nearest
enclosing
call (if any).
Contrast with
empty, which fails the current branch but allows
backtracking.
cutfail >>= k = cutfail
cutfail <|> m = cutfail
Retrieve the environment value.
runReader a (ask >>= k) = runReader a (k a)
Get the current state value.
runState a (get >>= k) = runState a (k a)
A version of
auto that "just works" with type inference, if the
predicate is a type constructor.
Lifted version of
exitFailure.
>>> exitFailure
*** Exception: ExitFailure 1
Lifted version of
exitSuccess.
>>> exitSuccess
*** Exception: ExitSuccess
Lifted version of "System.Exit.exitFailure".
@since 0.1.9.0.
Lifted version of "System.Exit.exitSuccess".
@since 0.1.9.0.
Use this function when the daemon should terminate normally. It logs a
message, and exits with status 0.
Throws a
Pending exception, which will cause the test to be
marked as pending.