Bart Lateur wrote:
> But isn't there going to be a large overhead, in populating such a
> "hash"?
If you need an ordered data structure the overhead would be lower
than using a hash.
> Doesn't the tree have to be reorganized every time you add a
> single new entry?
No. Sometimes you may have to
On Mon, 16 Oct 2000 11:28:37 PDT, Carl Wuebker wrote:
> I'd like to put in a pitch for RFC 124 in Perl 6. Balanced binary
>trees (such as AVL or red-black trees) allow O(log2 n) insertion, searching,
>outputting ranges of keys & deletion. I wouldn't want to touch existing Perl
>hashes, but
At 11:28 AM 10/16/00 -0700, Carl Wuebker wrote:
> I'd like to put in a pitch for RFC 124 in Perl 6. Balanced binary
>trees (such as AVL or red-black trees) allow O(log2 n) insertion, searching,
>outputting ranges of keys & deletion. I wouldn't want to touch existing Perl
>hashes, but it wo
