> 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.
Disclaimer: I have no experience using any of these, just did a quick google for you.
Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
Want more info? How to link or
or How to display code and escape characters
are good places to start.