Re^3: Nodes count in Linked List

 [ 3,[2,[2,[3,[3,[3,[1, undef ]]]]]]]].
[download]

But I fear the author if this assignment just lazily copied a task from Lisp and has no big idea what Perl is.

Cheers Rolf
_{(addicted to the Perl Programming Language and ☆☆☆☆ :)}

Comment on Re^3: Nodes count in Linked List Download Code

Replies are listed 'Best First'.
Re^4: Nodes count in Linked List by Corion (Patriarch) on Mar 31, 2015 at 13:26 UTC
This seems to somewhat run counter to my interpretation of this part of the homework: IntList is a dictionary with keys I wouldn't interpret anonymous arrays as "dictionary with keys", especially if the keys have the names `value` and `next`.	[reply] [d/l] [select]
Re^5: Nodes count in Linked List (dictionary?) by LanX (Saint) on Mar 31, 2015 at 13:44 UTC
> I wouldn't interpret anonymous arrays as "dictionary with keys", especially if the keys have the names value and next. Depends how you implement "dictionaries". The arrays here are homogenous 2-tuples with constant indices `value=0` and `next=1` So `$aref->[VALUE]` is just another implementation (just far more efficient than hashes are) (updated) not sure what the generic and neutral definition of "dictionary" is, but imho it's not necessarily a hashmap like in perl Lisp for instance has `name=>value` pairs implemented as association list. But I have to admit that you as a non-emacs user might be handicapped in this respect ;-p xD Cheers Rolf _{(addicted to the Perl Programming Language and ☆☆☆☆ :)} PS: Je suis Charlie! update Added WP links	[reply] [d/l] [select]