Author: Armin Rigo <ar...@tunes.org>
Branch: extradoc
Changeset: r4009:749fa78eeb73
Date: 2012-01-10 17:24 +0100
http://bitbucket.org/pypy/extradoc/changeset/749fa78eeb73/
Log: Rewrite to remove the emphasis on **per iteration** --- all the
other numbers are also per iteration.
diff --git a/blog/draft/laplace.rst b/blog/draft/laplace.rst
--- a/blog/draft/laplace.rst
+++ b/blog/draft/laplace.rst
@@ -64,8 +64,8 @@
advantage of the knowledge that the data is independent, but it is in the same
ballpark - **15% - 170%** slower than C, but the algorithm you choose matters
more than the language. By comparison, the slow versions take about **5.75s**
-each on CPython 2.6 **per iteration**, and by estimating, are about **200x**
-slower than the PyPy equivalent. I didn't measure the full run though :)
+each on CPython 2.6 per iteration, and by estimating, would be about **200x**
+slower than the PyPy equivalent if had the patience to measure the full run.
The next step is to use NumPy expressions. The first problem we run into is
that computing the error requires walking the entire array a second time. This
_______________________________________________
pypy-commit mailing list
pypy-commit@python.org
http://mail.python.org/mailman/listinfo/pypy-commit
