You too eh? My next target (ive got Trie's, Efficient Huffman Encoding, 2-3 trees, Pagoda Heaps under my belt so far) is a Treap. Any idea of a good place to look for documentation? Knuth only provided the most fleeting mention in AoP, and apparently they outperform splay trees and normal heap implementations (while being fully ordered) so I really want to release a CPAN implementation (especially as IMO the Heap:: heirarchy chews)
BTW thanks for the nod. :-)
Yves / DeMerphq
---
Writing a good benchmark isnt as easy as it might look.
In reply to Re: Re: Judy arrays and Perl
by demerphq
in thread Judy arrays and Perl
by husker
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |