Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical

Re: OOP/Linked List Question

by demerphq (Chancellor)
on Feb 07, 2005 at 16:28 UTC ( #428724=note: print w/replies, xml ) Need Help??

in reply to OOP/Linked List Question

There isnt a huge need for linked lists in perl. However you can implement them using any number of representations. Probably the easiest to read is with HoH's, but AoA's are possible too. Remember that perl simulates 2d data structures by allowing collection objects to hold references to other collection objects. So if we have $obj1={}; and $obj2={}; then $obj1->{next}=$obj2; $obj2->{next}=$obj1 will make a circular data structure. Of course there are all kinds of odd issues associated with circular data structures, most importantly that if improperly used they will result in a memory leak as perls refcoutn based GC wont free them even if your code has "lost" track of the pointers.


Log In?

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

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (8)
As of 2016-10-20 19:55 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (280 votes). Check out past polls.