Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask

Re: Can a hash self reference?

by tphyahoo (Vicar)
on Jul 02, 2005 at 08:48 UTC ( #471894=note: print w/replies, xml ) Need Help??

in reply to Can a hash self reference?

For what it's worth, self-reference is more commonly called circular reference. Objects with circular references need some guidance about how they should be garbage collected; it doesn't happen automatically. There is a very good discussion of this at Proxy Objects: Building Garbage Collected Circular References which also touches on what makes references circular in general, and how you can dissect them using devel::peek and other tools. Good luck!

Replies are listed 'Best First'.
Re^2: Can a hash self reference?
by ysth (Canon) on Jul 03, 2005 at 07:57 UTC
    However, the OP here isn't actually talking about any kind of reference, much less a circular one. He just wants to use a value from one part of a data structure to create a value for another part.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (2)
As of 2021-10-28 00:14 GMT
Find Nodes?
    Voting Booth?
    My first memorable Perl project was:

    Results (95 votes). Check out past polls.