Haven’t uploaded those yet. I concentrated on stuff that could easily be implemented in terms of std::array. They’ll be something like the way I made std::forward_list, the underlying allocator is std::array which sets its max capacity, but it’s “size” varies with the actual number of elements inserted, up to the size of the allocator. std::begin, ::end, algorithms, etc only see this “size” (allegedly).