You can put any delimiter like '§', '€' or '€£'..., not used.
That's exactly the problem: You have to find an "unused" delimiter. In real-word applications, you can have situations where there is no "unused" delimiter. Any array element may contain any sequence of bytes or characters. Whatever sequence of bytes / characters you could invent, it may also occur as part of an array element.
In the explanation, there are overall 150 elements, so it will be difficult to get 2Gb of array.
Why? 150 elements each allocating 14 MBytes easily break the 2 GByte limit. And yes, 14 MBytes in a single array element are perfectly legal in Perl.
But to have 150 elements in an array is bad ;)
Why? What do you think is the legal upper limit for the number of elements in an array? Heck, even the BASIC of my very first computer back in the 1980s allowed arrays of up to 65535 elements!
Alexander
In reply to Re^6: The most efficient way for searching for an element in an array?
by afoken
in thread The most efficient way for searching for an element in an array?
by Ppeoc
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |