In earlier versions of FORTRAN this data structure could only be allocated statically so the largest possible size had to be used. It's not a hash table, but Bloom filters use this as their underlying data structure, as do heaps. Randomly accessing an element takes only constant time, and these data structures are cache friendly, unlike linked lists. For 10 points name this data structure which is a collection of elements stored in a block of contiguous memory.
In earlier versions of FORTRAN this data structure could only be allocated statically so the largest possible size had to be used. It's not a hash table, but Bloom filters use this as their underlying data structure, as do heaps. Randomly accessing an element takes only constant time, and these data structures are cache friendly, unlike linked lists. For 10 points name this data structure which is a collection of elements stored in a block of contiguous memory.
In earlier versions of FORTRAN this data structure could only be allocated statically so the largest possible size had to be used.