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 would be very useful to be able to associate a sort routine
>with certain hashes & have those hashes maintained as balanced binary trees.
>The speed advantage would be in not having to sort keys every time the hash
>is changed.
This is a great place for a user-defined hash implementation. Perl doesn't
have to provide sorted hashes as a base type, since anyone that likes can
build one of their own... (Granted, it'd make things easier all around if
they came with the standard perl library)
Dan
--------------------------------------"it's like this"-------------------
Dan Sugalski even samurai
[EMAIL PROTECTED] have teddy bears and even
teddy bears get drunk
