rehash(size_type n) - change number of buckets to at least n
| 771 | |
| 772 | // rehash(size_type n) - change number of buckets to at least n |
| 773 | void rehash(fl::size n) { |
| 774 | // Ensure n is at least as large as the current number of elements |
| 775 | fl::size min_buckets = _size; |
| 776 | if (n < min_buckets) { |
| 777 | n = min_buckets; |
| 778 | } |
| 779 | |
| 780 | // Only rehash if we need more buckets than we currently have |
| 781 | if (n > _buckets.size()) { |
| 782 | rehash_internal(n); |
| 783 | } |
| 784 | // If n <= current bucket count, do nothing (std::unordered_map behavior) |
| 785 | } |
| 786 | |
| 787 | // reserve(size_type n) - reserve capacity for at least n elements |
| 788 | void reserve(fl::size n) { |
no test coverage detected