Assertion: set's element | /r/HasProperty | inserted
Facets:
Source sentences:
text: The parameters determine how many elements are inserted and to which values they are initialized:
text: single element (1) pair<iterator,bool> insert (const value_type& val); with hint (2) iterator insert (iterator position, const value_type& val); range (3) template <class InputIterator> void insert (InputIterator first, InputIterator last); single element (1) pair<iterator,bool> insert (const value_type& val); pair<iterator,bool> insert (value_type&& val); with hint (2) iterator insert (const_iterator position, const value_type& val); iterator insert (const_iterator position, value_type&& val); range (3) template <class InputIterator> void insert (InputIterator first, InputIterator last); initializer list (4) void insert (initializer_list<value_type> il);
text: The parameters determine how many elements are inserted and to which values they are initialized:
text: position Hint for the position where the element can be inserted.
text: The single element versions (1) return a pair::first set to an iterator pointing to either the newly inserted element or to the equivalent element already in the pair::second element in the true if a new element was inserted or false if an equivalent element already existed.
text: If a single element is inserted, logarithmic in position given is the optimal.
text: If N elements are inserted,in general, but linear inif the elements are already sorted according to the same ordering criterion used by the container.
text: If N elements are inserted,Implementations may optimize if the range is already sorted.
text: If a single element is inserted, logarithmic in size in general, but amortized constant if a hint is given and thegiven is the optimal.
text: If a single element is to be inserted, there are no changes in the container in case of exception (strong guarantee).
text: If a single element is to be inserted, there are no changes in the container in case of exception (strong
text: single element (1) pair<iterator,bool> insert (const value_type& val); with hint (2) iterator insert (iterator position, const value_type& val); range (3) template <class InputIterator> void insert (InputIterator first, InputIterator last); single element (1) pair<iterator,bool> insert (const value_type& val); pair<iterator,bool> insert (value_type&& val); with hint (2) iterator insert (const_iterator position, const value_type& val); iterator insert (const_iterator position, value_type&& val); range (3) template <class InputIterator> void insert (InputIterator first, InputIterator last); initializer list (4) void insert (initializer_list<value_type> il);
text: single element (1) pair<iterator,bool> insert (const value_type& val); with hint (2) iterator insert (iterator position, const value_type& val); range (3) template <class InputIterator> void insert (InputIterator first, InputIterator last); single element (1) pair<iterator,bool> insert (const value_type& val); pair<iterator,bool> insert (value_type&& val); with hint (2) iterator insert (const_iterator position, const value_type& val); iterator insert (const_iterator position, value_type&& val); range (3) template <class InputIterator> void insert (InputIterator first, InputIterator last); initializer list (4) void insert (initializer_list<value_type> il);
text: single element (1) pair<iterator,bool> insert (const value_type& val); with hint (2) iterator insert (iterator position, const value_type& val); range (3) template <class InputIterator> void insert (InputIterator first, InputIterator last); single element (1) pair<iterator,bool> insert (const value_type& val); pair<iterator,bool> insert (value_type&& val); with hint (2) iterator insert (const_iterator position, const value_type& val); iterator insert (const_iterator position, value_type&& val); range (3) template <class InputIterator> void insert (InputIterator first, InputIterator last); initializer list (4) void insert (initializer_list<value_type> il);