Graph.Tree vs Graph.PatriciaTree

[Alp Mestan]

Hi Thomas,

You can use the good old 'time' command.
But for a more precise analysis of what's going on, may I advise you to take
a look at criterion [1] ?
It has been written for benchmarking or more generally performance analysis.
You should appreciate it.

More generally, you may want to take a look at the standard tool chain for
Haskell projects [2].

[1] http://hackage.haskell.org/package/criterion
[2] http://haskell.org/haskellwiki/Development_Libraries_and_Tools

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 Mestan
http://alpmestan.wordpress.com/
http://alp.developpez.com/
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://projects.haskell.org/pipermail/hnn/attachments/20100203/99832605/attachment.htm