HI Maurice, On 5/10/07, Maurice Makaay <[EMAIL PROTECTED]> wrote:
> That is very peculiar... it should never be slower than an > implementation in PHP - unless your algorithm isn't optimal. > The timing for large numbers of nodes got slower due to a linear lookup (as explained in a previous message too). I implemented a hash table lookup as a replacement. This still does not use a lot of memory and the speed does no longer decrease at large quantities of nodes.
Only for the record, You may have missed it, there was some work done in this area by Sterling a couple of years ago (well, too many ;). He thought there was a need for such functions. He began to work on an extension called advanced data types (adt) in pecl . It may be something you can consider and bring it back to life :) ? Or at least it could be a good idea to continue your work in PECL, in a single tree extension. At some point point, the new functions/classes may be in php or maybe not. But you will at least have a place to stabilize/improve, publish or maintain. Please note that these are only suggestions, I would like to have advance data types like tree (or derived) n php but for what I see, we are not ready yet to understand their importance :) --Pierre -- PHP Internals - PHP Runtime Development Mailing List To unsubscribe, visit: http://www.php.net/unsub.php
