| 424 | } |
| 425 | |
| 426 | void resize(size_t n) { |
| 427 | const size_t old_size = storage_.size_; |
| 428 | if (n > storage_.size_) { |
| 429 | storage_.bump_size(n - old_size); |
| 430 | auto* p = storage_.storage_ptr(); |
| 431 | for (size_t i = old_size; i < n; ++i) { |
| 432 | p[i].construct(T{}); |
| 433 | } |
| 434 | } else { |
| 435 | auto* p = storage_.storage_ptr(); |
| 436 | for (size_t i = n; i < old_size; ++i) { |
| 437 | p[i].destroy(); |
| 438 | } |
| 439 | storage_.reduce_size(old_size - n); |
| 440 | } |
| 441 | } |
| 442 | |
| 443 | void resize(size_t n, const T& value) { |
| 444 | const size_t old_size = storage_.size_; |