Class iterator

src/fl/stl/unordered_map_small.h:44–71

    // Forward iterator that skips unoccupied slots.
    struct iterator {
        using reference = value_type&;
        using pointer = value_type*;
        using iterator_category = fl::forward_iterator_tag;

        iterator() FL_NOEXCEPT : mMap(nullptr), mIdx(0) {}
        iterator(unordered_map_small* map, size_type idx) FL_NOEXCEPT
            : mMap(map), mIdx(idx) { advance_to_occupied(); }

        reference operator*() const FL_NOEXCEPT { return mMap->mData[mIdx]; }
        pointer operator->() const FL_NOEXCEPT { return &mMap->mData[mIdx]; }

        iterator& operator++() FL_NOEXCEPT { ++mIdx; advance_to_occupied(); return *this; }
        iterator operator++(int) FL_NOEXCEPT { iterator t = *this; ++(*this); return t; }

        bool operator==(const iterator& o) const FL_NOEXCEPT { return mIdx == o.mIdx; }
        bool operator!=(const iterator& o) const FL_NOEXCEPT { return mIdx != o.mIdx; }

      private:
        void advance_to_occupied() FL_NOEXCEPT {
            if (!mMap) return;
            size_type cap = mMap->mData.size();
            while (mIdx < cap && !mMap->mOccupied.test(mIdx)) ++mIdx;
        }
        unordered_map_small* mMap;
        size_type mIdx;
        friend class unordered_map_small;
    };

    struct const_iterator {
        using reference = const value_type&;