On 06/14/2011 04:42 PM, KC wrote: > How is the compiler to know the else branch is never executed at run-time? > If you do, then why is it there in your source code?
The algorithm is divide-and-conquer, and I want to create sparks as long as I have cores (capabilities), and use the linear algorithm below that. The bug report is that the linear algorithm (if called from inside my program, at the leaves of the recursion tree) is much slower than when called on its own. This bug already shows when the tree has height 0, but this is really just for the bug report - in real life, both branches will be executed. J.W.
signature.asc
Description: OpenPGP digital signature
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
