more useful options | |
PerlMonks |
Re^8: [OT:] Is this Curriculum right?by LanX (Saint) |
on Nov 27, 2021 at 11:38 UTC ( [id://11139170]=note: print w/replies, xml ) | Need Help?? |
> I have not studied how Perl implements its hash tables; I hope to find more time to study them in the future. see https://st.aticpan.org/source/RURBAN/illguts-0.49/index.html#hv the collisions for a bucket are stored in a linked list. > Agreed. I too find Perl's arrays a delight to use. :) Perl arrays use a doubling trick to ensure that push and unshift are near O(1) like with linked lists. They allocate more memory than needed, and start and end are given by pointers° inside that area. In the rare cases it's exhausted, twice as much memory is dynamically allocated and the data transferred. So its space for time and the cost for re-allocation is reduced to a constant on average. And splice'ing should still be far more expensive than with linked lists.
Cheers Rolf °) kind of a sliding window
In Section
Seekers of Perl Wisdom
|
|