Namensräume
Varianten
Aktionen

std::map::insert

Aus cppreference.com
< cpp‎ | container‎ | map

 
 
 
std::map
Member-Funktionen
Original:
Member functions
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
map::map
map::~map
map::operator=
map::get_allocator
Elementzugriff zerstört
Original:
Element access
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
map::at
map::operator[]
Iteratoren
Original:
Iterators
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
map::begin
map::cbegin

(C++11)
map::end
map::cend

(C++11)
map::rbegin
map::crbegin

(C++11)
map::rend
map::crend

(C++11)
Kapazität
Original:
Capacity
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
map::empty
map::size
map::max_size
Modifiers
Original:
Modifiers
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
map::clear
map::insert
map::emplace(C++11)
map::emplace_hint(C++11)
map::erase
map::swap
Lookup
Original:
Lookup
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
map::count
map::find
map::equal_range
map::lower_bound
map::upper_bound
Beobachter
Original:
Observers
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
map::key_comp
map::value_comp
 
std::pair<iterator,bool> insert( const value_type& value );
(1)
template <class P>
std::pair<iterator,bool> insert( P&& value );
(2) (seit C++11)
iterator insert( iterator hint, const value_type& value );
iterator insert( const_iterator hint, const value_type& value );
(3) (bis C + +11)
(seit C++11)
template <class P>
iterator insert( const_iterator hint, P&& value );
(4) (seit C++11)
template< class InputIt >
void insert( InputIt first, InputIt last );
(5)
void insert( std::initializer_list<value_type> ilist );
(6) (seit C++11)

Inserts element(s) to the container, if the container doesn't already contain an element with equivalent key.

1-2)
Einsätze value.
Original:
inserts value.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

3-4) inserts value in the position as close as possible, just prior(seit C++11), to hint.

5)
Einsätze Elemente aus Bereich [first, last) .
Original:
inserts elements from range [first, last).
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
6)
Einsätze Elemente aus Initialisierungsliste ilist .
Original:
inserts elements from initializer list ilist.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

No iterators or references are invalidated.

Inhaltsverzeichnis

[Bearbeiten] Parameter

hint -
Iterator, als Anregung, wo den Inhalt einfügen verwendet
Original:
iterator, used as a suggestion as to where to insert the content
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
value -
Wert des Elements einfügen
Original:
element value to insert
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
first, last -
Bereich von Elementen einzufügen
Original:
range of elements to insert
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
ilist -
Initialisierungsliste um die Werte aus einzufügen
Original:
initializer list to insert the values from
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Type requirements
-
InputIt must meet the requirements of InputIterator.

[Bearbeiten] Rückgabewert

1-2) returns a pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place.

3-4) returns an iterator to the inserted element, or to the element that prevented the insertion.

5-6)
keine .
Original:
none.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

[Bearbeiten] Komplexität

1-2) Logarithmic in the size of the container, O(log(size())).

3-4) Amortized constant if the insertion happens in the position just after(bis C + +11)/before(seit C++11) the hint, logarithmic in the size of the container otherwise.

5-6) O(N*log(size() + N)), where N is the number of elements to insert.

[Bearbeiten] Siehe auch

(C++11)
constructs element in-place
(öffentliche Elementfunktion) [edit]
baut Elemente in-place mit einem Hinweis
Original:
constructs elements in-place using a hint
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

(öffentliche Elementfunktion) [edit]