Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://en.cppreference.com/w/cpp/language/../../cpp/container/inplace_vector/insert.html below:

std::inplace_vector<T,N>::insert - cppreference.com

constexpr iterator insert( const_iterator pos, const T& value );

constexpr iterator insert( const_iterator pos, T&& value );

constexpr iterator insert( const_iterator pos, size_type count, const T& value );

template< class InputIt >
constexpr iterator insert( const_iterator pos, InputIt first, InputIt last );

Inserts elements at the specified location in the container.

1) Inserts a copy of value before pos.

2) Inserts value before pos, possibly using move semantics.

3) Inserts count copies of the value before pos.

Inserts elements from range

before

. This overload participates in overload resolution only if

is

(to avoid ambiguity with the overload

).

Each iterator in [first, last) is dereferenced once.

If first and last are iterators into *this, the behavior is undefined.

5) Inserts elements from initializer list ilist before pos. Equivalent to: insert(pos, ilist.begin(), ilist.end());.

1,2) Iterator pointing to the inserted value.

3) Iterator pointing to the first element inserted, or pos if count == 0.

4) Iterator pointing to the first element inserted, or pos if first == last.

5) Iterator pointing to the first element inserted, or pos if ilist is empty.

Linear in the number of elements inserted plus the distance between pos and end() of the container.

• Throws std::bad_alloc if before invocation size() == capacity(). The function has no effects (strong exception safety guarantee).
• Any exception thrown by initialization of inserted element or by any LegacyInputIterator operation. Elements in [​0​, pos) are not modified.

#include <initializer_list>
#include <inplace_vector>
#include <iterator>
#include <new>
#include <print>
 
int main()
{
    std::inplace_vector<int, 14> v(3, 100);
    std::println("1. {}", v);
 
    auto pos = v.begin();
    pos = v.insert(pos, 200); // overload (1)
    std::println("2. {}", v);
 
    v.insert(pos, 2, 300); // overload (3)
    std::println("3. {}", v);
 
    int arr[] = {501, 502, 503};
    v.insert(v.begin(), arr, arr + std::size(arr)); // overload (4)
    std::println("4. {}", v);
 
    v.insert(v.end(), {601, 602, 603}); // overload (5)
    std::println("5. {}", v);
 
    const auto list = {-13, -12, -11};
    try
    {
        v.insert(v.begin(), list); // throws: no space
    }
    catch(const std::bad_alloc&)
    {
        std::println("bad_alloc: v.capacity()={} < v.size()={} + list.size()={}",
                     v.capacity(), v.size(), list.size());
    }
}

Output:

1. [100, 100, 100]
2. [200, 100, 100, 100]
3. [300, 300, 200, 100, 100, 100]
4. [501, 502, 503, 300, 300, 200, 100, 100, 100]
5. [501, 502, 503, 300, 300, 200, 100, 100, 100, 601, 602, 603]
bad_alloc: v.capacity()=14 < v.size()=12 + list.size()=3

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4