Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

Re^4: Inline::C hash access

by puudeli (Pilgrim)
on Sep 04, 2008 at 12:19 UTC ( #709001=note: print w/replies, xml ) Need Help??


in reply to Re^3: Inline::C hash access
in thread Inline::C hash access

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};

Replies are listed 'Best First'.
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};

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://709001]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (8)
As of 2021-02-27 15:19 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?