[Arech]

Erm, actually, all STL implementations I've seen use a simple C-style array under the hood to store `std::array` data, not a much more complex tuple. But it doesn't matter much in the context of the question: the whole point of `std::array` is to provide fixed inplace storage for the data, basically just a safe version of a C-array. Implementing it on top of dynamically sized vector, like the author did, is... just missing the whole idea. This thing was the first I noticed while looking at the sources... And I don't want to look any more further now.

[quietbritishjim]

I think that's what parent comment meant by "tuple": a list-like structure that can't be resized.

[mauvia]

Dynamically allocated static array might be closer to truth for what they implemented, I think.