Welcome to the Monastery | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
> Ideally need a balanced tree like Red Black or AVL, the Perl hash takes 4 seconds Not surprisingly, the Perl hash, at 4 seconds, is a lot faster than the (pure Perl) Tree::RB, at 33 seconds, when running your (unpublished) benchmark. Is there any functional reason why you can't just use a hash? Since you mentioned AVL, have you tried AVLTree from CPAN? It uses a XS wrapper around Julienne Walker's AVL Tree C library, so should be a lot faster than Tree::RB.
References
In reply to Re^3: Anyone with XS experience willing to create a high performance data type for Perl?
by eyepopslikeamosquito
|
|