erase() [2/4]

template<typename Key, typename Less = fl::less<Key>>

iterator fl::flat_set< Key, Less >::erase ( const_iterator first, const_iterator last )

inline

Definition at line 273 of file flat_set.h.

                                                              {
        // Erase range [first, last) by repeatedly erasing the element at first
        fl::size count = last - first;
        iterator pos = const_cast<iterator>(first);
 
        for (fl::size i = 0; i < count && pos != end(); ++i) {
            // Erase the element at pos. After erase, pos points to the next element
            // (because all elements shift left)
            mData.erase(pos);
            // Don't increment pos - it already points to the next element after erase
        }
        return pos;
    }

References count(), end(), mData, and pos.

Here is the call graph for this function: