Graph.Tree vs Graph.PatriciaTree

[Alp Mestanogullari]

Indeed, but IIRC, it's more about space profiling, whereas Thomas seems to
be focusing on time performances for the moment.

On Wed, Feb 3, 2010 at 3:43 PM, Jorden Mauro <jrm8005 at gmail.com> wrote:

> There is a profiler that comes with GHC, too.
>
> On Wed, Feb 3, 2010 at 5: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
> >
>
> _______________________________________________
> 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/20100203/aa484582/attachment.htm