| 840 | }; |
| 841 | |
| 842 | static fl::size next_power_of_two(fl::size n) { |
| 843 | fl::size p = 1; |
| 844 | while (p < n) |
| 845 | p <<= 1; |
| 846 | return p; |
| 847 | } |
| 848 | |
| 849 | pair<fl::size, bool> find_slot(const Key &key) const { |
| 850 | const fl::size cap = _buckets.size(); |
no outgoing calls
no test coverage detected