Namespaces
Variants

    std::hive<T,Allocator>::erase

    From cppreference.com

    [edit template]
     
    C++
     
    Containers library
     
    std::hive
     
    iterator erase( const_iterator pos );
    		(1) (since C++26) 
    iterator erase( const_iterator first, const_iterator last );
    		(2) (since C++26)

    Erases the specified elements from the container.

    1) Removes the element at pos.
    2) Removes the elements in the range [first, last).

    Iterators and references to the erased element are invalidated. If the element is the last element in the container, the end() iterator is also invalidated. Other references and iterators are not affected.

    The iterator pos must be valid and dereferenceable. Thus the end() iterator (which is valid, but is not dereferenceable) cannot be used as a value for pos.

    The iterator first does not need to be dereferenceable if first == last: erasing an empty range is a no-op.

    Parameters

    pos - iterator to the element to remove
    first, last - the pair of iterators defining the range of elements to remove

    Return value

    Iterator following the last removed element.

    1) If pos refers to the last element, then the end() iterator is returned.
    2) If last == end() prior to removal, then the updated end() iterator is returned.
    If [first, last) is an empty range, then last is returned.

    Complexity

    1) Constant.
    2) Linear in the number of elements erased.

    Additionally, if any active blocks become empty of elements as a result of the function call, — at worst linear in the number of element blocks.

    Notes

    When container elements need to be erased based on a predicate, rather than iterating the container and calling unary erase, the iterator range overload is generally used with std::remove()/std::remove_if() to minimize the number of moves of the remaining (non-removed) elements, — this is the erase-remove idiom. std::erase_if() replaces the erase-remove idiom.

    Example

    Run this code
    #include <hive>
#include <print>

int main()
{
    std::hive v{0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
    std::println("{}", v);

    v.erase(v.begin());
    std::println("{}", v);

    v.erase(std::next(v.begin(), 2), std::next(v.begin(), 5));
    std::println("{}", v);

    // Erase all even numbers
    for (auto it{v.begin()}; it != v.end();)
        if (*it % 2 == 0)
            it = v.erase(it);
        else
            ++it;
    std::println("{}", v);
}

    Output: 

    [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
[1, 2, 3, 4, 5, 6, 7, 8, 9]
[1, 2, 6, 7, 8, 9]
[1, 7, 9]

    See also

    (C++26)
    		 erases all elements satisfying specific criteria
    (function template) [edit]
    		clears the contents
    (public member function) [edit]