On Wed, 20 Mar 2002 05:12:16 GMT, nobu.nokada / softhome.net wrote:

>Yes, current implementation is optimized for bigger arrays, it
>takes O(N+M) time, but former was O(N*M), where arrays with N
>and M size.  Perhaps, in this case, GC occurred several times
>per each loops by 1,600,000 items hashes.

I'm curious. How do you do this operation in O(N+M)?

Ronald E Jeffries
http://www.XProgramming.com
http://www.objectmentor.com
I'm giving the best advice I have. You get to decide whether it's true for you.