[Ur] little benchmark on querying a table only

[Marc Weber]

Excerpts from Marc Weber's message of Mon Dec 20 23:19:37 +0100 2010:
> Excerpts from Chris Double's message of Mon Dec 20 09:56:27 +0100 2010:
> > I tried a quick version that uses an 'each' instead of a List.app of a
> > temporary list. Unfortunately my initial attempt resulted in a program
> > that never seems to complete compilation. See mantis issue 44.
 

Adams reply on mantis:
> 
>       This is an undocumented behavior of the optimizer, which tries to
>       remove all uses of higher-order functions. For your example, this
>       involves building a version of [each] for every possible argument,
>       which of course includes 1000 different possibilities here! If you
>       separate [f] into a separate argument, and put it first (since the
>       optimizer only specializes a prefix of initial arguments with
>       function types), then everything works fine.
> 

Another question: Does ml provide some profiling ? Or how do you find
out where the compiler is spending most time?

Did you use this: http://www.smlnj.org/doc/Compiler/pages/profile.html ?

Marc Weber