Normalize count to use has()
| 220 | |
| 221 | // Normalize count to use has() |
| 222 | fl::size count(const Key& key) const { |
| 223 | return Base::has(key) ? 1 : 0; |
| 224 | } |
| 225 | |
| 226 | // Erase is now properly implemented in unsorted_map_fixed base class |
| 227 | // This just calls the base implementation which actually removes the element |