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.
In reply to Re: OOP/Linked List Question
by demerphq
in thread OOP/Linked List Question
by hok_si_la
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |