Re: how to suppress carefully a recursive tree
- From: fj <francois.jacq@xxxxxxx>
- Date: Tue, 22 Jan 2008 23:10:15 -0800 (PST)
On 23 jan, 01:12, David BL <davi...@xxxxxxxxxxxx> wrote:
On Jan 23, 1:10 am, fj <francois.j...@xxxxxxx> wrote:
On 22 jan, 15:52, Jan Hidders <hidd...@xxxxxxxxx> wrote:
On 22 jan, 12:04, fj <francois.j...@xxxxxxx> wrote:
I know how to suppress a normal tree but I meet the following kind of
situation :
I'm guessing that when you say "suppress" you mean "represent in a
database". Correct?
No : I want to destroy, remove, kill ... a part of the data (a
complete tree or just a branch), but without destroying data shared by
other trees or branches.
Would the mark and sweep algorithm suit you purposes?
No
the mark and sweep algorithm needs to know all the tree roots in order
to mark all the used objects.
In my example I indicates that the node b3 belongs to the root r2
just for information to explain the storage count. But the deletion
routine I want to write just receives "r1" as argument, nothing else.
It does not know that r2 exists too ... It is just able to detect the
existence of other objects via the storage count of b3 which is a
little bit too high for being just referenced by r1 !
.
- Follow-Ups:
- Re: how to suppress carefully a recursive tree
- From: David BL
- Re: how to suppress carefully a recursive tree
- From: David Cressey
- Re: how to suppress carefully a recursive tree
- References:
- how to suppress carefully a recursive tree
- From: fj
- Re: how to suppress carefully a recursive tree
- From: Jan Hidders
- Re: how to suppress carefully a recursive tree
- From: fj
- Re: how to suppress carefully a recursive tree
- From: David BL
- how to suppress carefully a recursive tree
- Prev by Date: Re: Principle of Orthogonal Design
- Next by Date: Re: how to suppress carefully a recursive tree
- Previous by thread: Re: how to suppress carefully a recursive tree
- Next by thread: Re: how to suppress carefully a recursive tree
- Index(es):
Relevant Pages
|
|
