in reply to Re: Nesting below emptiness and/or inverting a hash.
in thread Nesting below emptiness and/or inverting a hash.

That would be prohibitively slow. The existing version in development can parse a gigabyte in less than a minute. I don't want to slow it down with database calls otherwise I am defeated from the outset.

-M

Free your mind

  • Comment on Re^2: Nesting below emptiness and/or inverting a hash.

Replies are listed 'Best First'.
Re^3: Nesting below emptiness and/or inverting a hash.
by bibliophile (Prior) on Jan 25, 2007 at 15:05 UTC
    Ah. Yes, that would be the "something significant" that I missed.

    :-D