Newsgroups: php.internals
Path: news.php.net
Xref: news.php.net php.internals:30113
Mailing-List: contact internals-help@lists.php.net; run by ezmlm
Received-SPF: error (pb1.pair.com: domain php.net from 213.75.38.114 cause and error)
Message-ID: <4666A000.70109@php.net>
Date: Wed, 06 Jun 2007 13:52:32 +0200
User-Agent: Thunderbird 2.0.0.0 (Windows/20070326)
MIME-Version: 1.0
To: Christian Schneider <cschneid@cschneid.com>
CC: Daniel Penning <dpenning@daniel-penning.de>,  internals@lists.php.net
References: <4665D15F.2040501@cyanox.nl> <200706060015.51543.pstradomski@gmail.com> <46666C72.9030402@daniel-penning.de> <46668D58.7080406@cschneid.com>
In-Reply-To: <46668D58.7080406@cschneid.com>
Content-Type: text/plain; charset=ISO-8859-2; format=flowed
Content-Transfer-Encoding: 7bit
Subject: Re: [PHP-DEV] Recursive classes ... possible bug?
From: tularis@php.net ("M. Sokolewicz")

Christian Schneider wrote:
> Daniel Penning wrote:
>> Checking if the reference is equal and then doing the member-by-member
>> comparison if they differ would prevent too deep recursion in most cases.
> 
> That would solve this particular case (and might be worth doing for
> performance reasons anyway I'd say) but won't solve the general problem.
> Imagine comparing o1->o2->o1 (object 1 having a reference to object 2
> which in turn has a reference back to object 1) with o3->o4->o3. You'd
> still get the same result as now (nesting too deep) and there is no easy
> way around it.
> 
> - Chris

It might just be me, but I thought there was a student with a google 
summer of code project who was working on circular references and how to 
properly free memory for them. Perhaps some of the algorithms devised 
for that could be used to resolve problems as noted above?

- Tul