Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: OOP/Linked List Question

by holli (Monsignor)
on Feb 07, 2005 at 16:22 UTC ( #428721=note: print w/ replies, xml ) Need Help??


in reply to OOP/Linked List Question

You can build a real linked list, you donīt even need objects:

use strict; use warnings; #build a cyclic list of hashes my $root = {value => 0, next => undef}; my $last = $root; for (my $i=1; $i<5; $i++) { my $node = { value=>$i, next => undef}; $last->{next} = $node; $last = $node; } $last->{next} = $root; #cycle: my $node = $root; for ( my $j=0; $j<10; $j++ ) { print $node->{value}, "\n"; $node = $node->{next}; }
Update:
The basic algorithms are the same than in any other language. The most important here is an understanding of how references work (see perlre), so i leave the rest as excercise for the interested reader.
holli, /regexed monk/


Comment on Re: OOP/Linked List Question
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (10)
As of 2015-07-07 09:00 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (88 votes), past polls