Home/ Questions/Q 869811
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-15T10:22:14+00:00

The Perl array is an abstract data type. What’s the internal mechanism for the

  • 0

The Perl array is an abstract data type. What’s the internal mechanism for the Perl array? Is it implemented with dynamic array or linked list?
Since the array elements have random access, I would assume a dynamic array of pointers, or references to scalars make sense. However, with shift and unshift operation at the head of array, would the array have to move all its elements with these operations? sound inefficient to me. Any thought?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Have a look at this: http://www.perlmonks.org/?node_id=17890

    (taken from there:)

    Perl implements lists with an array and first/last element offsets. The array is allocated larger than needed with the offsets originally pointing in the middle of the array so there is room to grow in both directions (unshifts and pushes/inserts) before a re-allocation of the underlying array is necessary. The consequence of this implementation is that all of perl’s primitive list operators (insertion, fetching, determining array size, push, pop, shift, unshift, etc.) perform in O(1) time.

    • 0