erase() [2/3]

template<typename Key, typename Compare = less<Key>, typename Allocator = allocator<Key>>

iterator fl::MultiSetTree< Key, Compare, Allocator >::erase ( const_iterator first, const_iterator last )

inline

Definition at line 264 of file multi_set.h.

                                                              {
        // Erase each element in the range [first, last)
        iterator result = begin();  // Default return
 
        while (first != last) {
            result = erase(first);  // erase(const_iterator pos) returns iterator to next element
            // Update first to point to the next element (which is now at the erased position)
            first = ConstIteratorWrapper(result.mTreeIt);
        }
 
        return result;
    }