Updated docs.

README

@@ -8,9 +8,36 @@ Where possible, we give citations and computational complexity
 estimates for the algorithms used.
 
 
-Source code
+Performance
 -----------
 
+This library has been carefully optimised for high performance.  To
+obtain the best runtime efficiency, it is imperative to compile
+libraries and applications that use this library using a high level of
+optimisation.
+
+Suggested GHC options:
+
+  -O -fvia-C -funbox-strict-fields
+
+To illustrate, here are the times (in seconds) to generate and sum 250
+million random Word32 values, on a laptop with a 2.4GHz Core2 Duo
+P8600 processor, running Fedora 11 and GHC 6.10.3:
+
+  no flags   200+
+  -O           1.249
+  -O -fvia-C   0.991
+
+As the numbers above suggest, compiling without optimisation will
+yield unacceptable performance.
+
+
+Get involved!
+-------------
+
+Please feel welcome to contribute new code or bug fixes.  You can
+fetch the source repository from here:
+
 darcs get http://darcs.serpentine.com/statistics
 
 

statistics.cabal

@@ -65,6 +65,6 @@ library
   -- gather extensive profiling data for now
   ghc-prof-options: -auto-all
 
-  ghc-options: -Wall -funbox-strict-fields -O2
+  ghc-options: -Wall -funbox-strict-fields -O2 -- -fvia-C
   if impl(ghc >= 6.8)
     ghc-options: -fwarn-tabs

tests/T.hs

@@ -21,9 +21,9 @@ time act = do
   e <- ret `seq` getTime
   return (e-s, ret)
 
-count = 100 * 1000000
+count = 250 * 1000000
 
-type T = Double
+type T = Word32
 
 --summ :: [T] -> T
 --summ = foldl' (+) 0