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

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

std::set<Key,Compare,Allocator>::insert - cppreference.com

iterator insert( iterator pos, const value_type& value );

iterator insert( const_iterator pos, const value_type& value );

iterator insert( const_iterator pos, value_type&& value );

template< class InputIt >
void insert( InputIt first, InputIt last );

insert_return_type insert( node_type&& nh );

iterator insert( const_iterator pos, node_type&& nh );

template< class K >
iterator insert( const_iterator pos, K&& x );

Attempts to insert element(s) into *this.

• If *this already contain an element with an equivalent key, does nothing.
• Otherwise, inserts the element(s) into *this.

Inserts

. If

is provided,

will be inserted as close as possible to the position just prior to

.

If

is not

into

, the behavior is undefined.

If

is not

into

, the behavior is undefined.

5) Inserts elements from range [first, last).

If any of the following conditions is satisfied, the behavior is undefined:

• first or last is an iterator into *this.

6) Inserts elements from initializer list ilist.

Equivalent to insert(ilist.begin(), ilist.end()).

If

is an empty

, does nothing. Otherwise, inserts the element owned by

into the container , if the container doesn't already contain an element with a key equivalent to

. The behavior is undefined if

is not empty and

.

If

is an empty

, does nothing and returns the end iterator. Otherwise, inserts the element owned by

into the container, if the container doesn't already contain an element with a key equivalent to

, and returns the iterator pointing to the element with key equivalent to

(regardless of whether the insert succeeded or failed). If the insertion succeeds,

is moved from, otherwise it retains ownership of the element. The element is inserted as close as possible to the position just prior to

. The behavior is undefined if

is not empty and

.

Constructs an object

of type

with

and then inserts

into

. The existence of the equivalent key is determined transparently using

before constructing

.

If any of the folllowing conditions is satisfied, the behavior is undefined:

• value_type is not EmplaceConstructible into set from std::forward<K>(x).
• equal_range(u) == equal_range(x) is false.

This overload participates in overload resolution only if

is

.

10) u will be inserted as close as possible to the position just prior to pos.

No iterators or references are invalidated. If the insertion is successful, pointers and references to the element obtained while it is held in the node handle are invalidated, and pointers and references obtained to that element before it was extracted become valid.(since C++17)

1,2) A pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool value set to true if and only if the insertion took place.

3,4) An iterator to the inserted element, or to the element that prevented the insertion.

An object of

with the members initialized as follows:

• If nh is empty, inserted is false, position is end(), and node is empty.
• Otherwise if the insertion took place, inserted is true, position points to the inserted element, and node is empty.
• If the insertion failed, inserted is false, node has the previous value of nh, and position points to an element with a key equivalent to nh.key().

8) End iterator if nh was empty, iterator pointing to the inserted element if insertion took place, and iterator pointing to an element with a key equivalent to nh.key() if it failed.

9) A pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool value set to true if and only if the insertion took place.

10) An iterator to the inserted element, or to the element that prevented the insertion.

If an exception is thrown by any operation during the insertion of a single element, the insertion has no effect.

Given \(\scriptsize N\)N as size():

1,2) \(\scriptsize \log(N)\)log(N)

3,4) Amortized constant if the insertion happens in the position just after(until C++11)before(since C++11) pos, \(\scriptsize \log(N)\)log(N) otherwise.

5,6) \(\scriptsize \log(N + M)\)log(N+M), where \(\scriptsize M\)M is the number of elements to insert.

7) \(\scriptsize \log(N)\)log(N)

8) Amortized constant if the insertion happens in the position just before pos, \(\scriptsize \log(N)\)log(N) otherwise.

9) \(\scriptsize \log(N)\)log(N)

10) Amortized constant if the insertion happens in the position just before pos, \(\scriptsize \log(N)\)log(N) otherwise.

The hinted insert ((3,4), (8) and (10)) does not return a boolean in order to be signature-compatible with positional insert on sequential containers, such as std::vector::insert. This makes it possible to create generic inserters such as std::inserter. One way to check success of a hinted insert is to compare size() before and after.

The overloads (5,6) are often implemented as a loop that calls the overload (3) with end() as the hint; they are optimized for appending a sorted sequence (such as another std::set) whose smallest element is greater than the last element in *this.

If multiple elements in the range have keys that compare equivalent, it is unspecified which element is inserted (pending LWG2844).

#include <cassert>
#include <iostream>
#include <set>
 
int main()
{
    std::set<int> set;
 
    auto result_1 = set.insert(3);
    assert(result_1.first != set.end()); // it is a valid iterator
    assert(*result_1.first == 3);
    if (result_1.second)
        std::cout << "insert done\n";
 
    auto result_2 = set.insert(3);
    assert(result_2.first == result_1.first); // same iterator
    assert(*result_2.first == 3);
    if (!result_2.second)
        std::cout << "no insertion\n";
}

Output:

The following behavior-changing defect reports were applied retroactively to previously published C++ standards.

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