Value typed fixed size container. It is not random access container. Empty elements are determined by bitfields. Designed to be performant when iterating on all elements. If container is full simple foreach is used.
Not relocating container. Designed for storing a lot of objects in contiguous memory and iterating over them without performance loss. Adding and removing elements is slow (linear).