Newsgroups: php.internals
Path: news.php.net
Xref: news.php.net php.internals:29403
Mailing-List: contact internals-help@lists.php.net; run by ezmlm
Received-SPF: pass (pb1.pair.com: domain gmail.com designates 64.233.162.232 as permitted sender)
DomainKey-Status: bad
DomainKey-Signature: a=rsa-sha1; c=nofws;
        d=gmail.com; s=beta;
        h=received:message-id:date:from:to:subject:cc:in-reply-to:mime-version:content-type:content-transfer-encoding:content-disposition:references;
        b=MjjXNP2UZDUbhf+yIuHOSWgptPya18xV35JQNoAyt8+jEmV667+BxgtbdoKjoRhCpgfVndA2gHKP81EzzR5av2WXwse5m8YjC100mXhaDlMRbXzgJ8oMd/wwAQTv39PVZgGx+OLacdjQ0ySnitfiODFQpbziOcCy9wWoN0FSzQ4=
Message-ID: <fe05d1540705110126s147e86cx6d274d7be342d4e8@mail.gmail.com>
Date: Fri, 11 May 2007 10:26:18 +0200
To: maurice@phorum.org
Cc: "Derick Rethans" <derick@php.net>, 
	"Michael Walter" <michael.walter@gmail.com>, 
	RQuadling@googlemail.com, "Brian Moon" <brianm@dealnews.com>, 
	internals@lists.php.net
In-Reply-To: <46432F0B.8080506@phorum.org>
MIME-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
Content-Disposition: inline
References: <4641D92C.4050208@dealnews.com>
	 <10845a340705090743v6aba7896y45b9f7d60a4e77ba@mail.gmail.com>
	 <4641E3DD.8040807@phorum.org>
	 <877e9a170705090913i320359cag81b0a3bf203e2c86@mail.gmail.com>
	 <464202D9.8080509@phorum.org>
	 <alpine.DEB.0.98.0705091927300.15448@kossu.ez.no>
	 <46432F0B.8080506@phorum.org>
Subject: Re: [PHP-DEV] Tree sort in C
From: pierre.php@gmail.com (Pierre)

HI Maurice,

On 5/10/07, Maurice Makaay <maurice@phorum.org> 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