Graph.Tree vs Graph.PatriciaTree

[Alp Mestanogullari]

You may want to take a look at a new tool : Progression [1]

[1]
http://chplib.wordpress.com/2010/02/04/progression-supporting-optimisation-in-haskell/

On Wed, Feb 3, 2010 at 11:17 AM, Thomas Bereknyei <tomberek at gmail.com>wrote:

> For 10000 steps of 23 sigmoid neurons I unscientifically tested and
> found that the PatriciaTree version takes half the time.
>
> Is there an easy way to time things in Haskell?
>
> -Tom
>
> _______________________________________________
> Hnn mailing list
> Hnn at projects.haskell.org
> http://projects.haskell.org/cgi-bin/mailman/listinfo/hnn
>



-- 
Alp Mestanogullari
http://alpmestan.wordpress.com/
http://alp.developpez.com/
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://projects.haskell.org/pipermail/hnn/attachments/20100205/3e0c71f7/attachment.htm