diff options
author | Simon Marlow <simonmar@microsoft.com> | 2006-10-12 11:07:11 +0000 |
---|---|---|
committer | Simon Marlow <simonmar@microsoft.com> | 2006-10-12 11:07:11 +0000 |
commit | bd45ccd370162016fef7d0b4dec3518119ab392c (patch) | |
tree | 1aa4063b81dcc6cda1da26ed6e38fb33c77b29e0 /docs | |
parent | 8150e982f31ebc40582adbd73dd2022ce7e23563 (diff) | |
download | haskell-bd45ccd370162016fef7d0b4dec3518119ab392c.tar.gz |
fix definition of fib in example code
Diffstat (limited to 'docs')
-rw-r--r-- | docs/users_guide/parallel.xml | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/docs/users_guide/parallel.xml b/docs/users_guide/parallel.xml index 7792ea651a..3d14622cf1 100644 --- a/docs/users_guide/parallel.xml +++ b/docs/users_guide/parallel.xml @@ -136,7 +136,7 @@ import Control.Parallel nfib :: Int -> Int nfib n | n <= 1 = 1 - | otherwise = par n1 (seq n2 (n1 + n2)) + | otherwise = par n1 (seq n2 (n1 + n2 + 1)) where n1 = nfib (n-1) n2 = nfib (n-2)</programlisting> @@ -149,8 +149,8 @@ nfib n | n <= 1 = 1 (leaving the parent to evaluate the other branch). Also, we must use <function>seq</function> to ensure that the parent will evaluate <varname>n2</varname> <emphasis>before</emphasis> <varname>n1</varname> - in the expression <literal>(n1 + n2)</literal>. It is not sufficient - to reorder the expression as <literal>(n2 + n1)</literal>, because + in the expression <literal>(n1 + n2 + 1)</literal>. It is not sufficient + to reorder the expression as <literal>(n2 + n1 + 1)</literal>, because the compiler may not generate code to evaluate the addends from left to right.</para> |