Re: Inline::C hash access

Replies are listed 'Best First'.
Re^2: Inline::C hash access by puudeli (Pilgrim) on Sep 04, 2008 at 12:08 UTC
Actually storing the $root info into an item is a good idea, you just have to make sure that when the linked list (or whatever the structure is) is changed (eg. add/delete from the middle) the $root information is also updated. -- `seek $her, $from, $everywhere if exists $true{love};`	[reply] [d/l]
Re^3: Inline::C hash access by fireartist (Chaplain) on Sep 04, 2008 at 12:14 UTC
I've looked into this, but unfortunately the parent can change - and this involves a tree of lots of different types of objects - so keeping track of what type of children need updated sounds like a bug waiting to happen ;)	[reply]
Re^4: Inline::C hash access by puudeli (Pilgrim) on Sep 04, 2008 at 12:19 UTC
This sounds like a place where a doubly-linked list could do the job. Each node knows the previous and the next node, thus you can easily descend/ascend the list whenever you need. -- `seek $her, $from, $everywhere if exists $true{love};`	[reply] [d/l]
Re^5: Inline::C hash access by puudeli (Pilgrim) on Sep 04, 2008 at 12:24 UTC
If you have several branches and many $roots in the tree then of course the $root needs to know that it is the $root. A simple flag would tell the search to stop and return the $root for a particular $node. -- `seek $her, $from, $everywhere if exists $true{love};`	[reply] [d/l]