Closed jordan4ibanez closed 1 month ago
In general, the performance should be comparable to that of std::vector
since it uses what is essentially the same strategies. That is:
O(1) element access
Amortized constant performance for push_back (meaning that it will usually not need to resize the array, but will sometimes need to, in which case, there is a O(n) cost to adjusting capacity.
As I cannot find any benchmarking information I thought I'd simply ask.
What is the performance like in comparison to C++ std::vector?