[cairo] [cairo-commit] 8 commits - configure.ac src/cairo-bentley-ottmann.c src/cairo.c src/cairoint.h src/cairo-os2.h src/cairo-path-fill.c src/cairo-path-fixed.c src/cairo-path-in-fill.c src/cairo-path-stroke.c src/cairo-pen.c src/cairo-polygon.c src/cairo-skiplist.c src/cairo-spline.c src/cairo-type1-subset.c src/cairo-types-private.h src/Makefile.am test/any2ppm.c test/Makefile.am

[Jeff Muizelaar]

On Sun, Nov 16, 2008 at 08:25:45AM -0800, Chris Wilson wrote:
> commit e44c1f26e48cfb2f74834b6a8ef8532b0bd28982
> Author: M Joonas Pihlaja <jpihlaja at cc.helsinki.fi>
> Date:   Sat Oct 18 01:15:44 2008 +0300
> 
>     Use a smaller and faster random number generator.
>     
>     The previous LFSR generator used a large table to be speedy.  The
>     replacement generator is the single stage generator (1) from section
>     5.4 of [HP2007], requires no tables or extra state.  I've run the
>     generator through Rob Brown's extended Dieharder test suite and it
>     passes all but one self-proclaimed buggy test (-d2) and the 2D sphere
>     minimum distance test (-d12).
>     
>     [HP2007] Hars L. and Petruska G., ``Pseudorandom Recursions: Small and Fast Pseurodandom Number Generators for Embedded Applications'',
>     Hindawi Publishing Corporation
>     EURASIP Journal on Embedded Systems
>     Volume 2007, Article ID 98417, 13 pages
>     doi:10.1155/2007/98417
>     http://www.hindawi.com/getarticle.aspx?doi=10.1155/2007/98417&e=cta
> 

It would probably be good to include a citation in the actual code. It's
also a good idea to include a comment about why you chose this generator
over the other ones in the paper.

-Jeff