"be consistent" | |
PerlMonks |
Re^4: What makes an array sorted and a hash unsorted?by ikegami (Patriarch) |
on Jun 04, 2009 at 16:52 UTC ( [id://768502]=note: print w/replies, xml ) | Need Help?? |
I don't see why you think they aren't. Perl arrays are a continuous series of equally sized records, allowing for instant addressing of any element. That definitely fits the traditional formal definition.
Perl arrays aren't sparse. There are no holes. Every element exists. (Those three statements are synonymous.)
Stacks (and queues, and ...) can be implemented using an array. They're not mutually exclusive. The presence of utility functions to manipulate a data structure doesn't change the data structure.
In Section
Meditations
|
|