std::set::insert

[]	Google. . , . , . ( . .)

`std::pair<iterator,bool> insert( const value_type& value );`	(1)
`std::pair<iterator, bool> insert( value_type&& value );`	(2)	( C++11)
`iterator insert( iterator hint, const value_type& value ); iterator insert( const_iterator hint, const value_type& value );`	(3)	( C++11) ( C++11)
`iterator insert( const_iterator hint, value_type&& value );`	(4)	( C++11)
`template< class InputIt > void insert( InputIt first, InputIt last );`	(5)
`void insert( std::initializer_list<value_type> ilist );`	(6)	( C++11)

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

1-2)

value.

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

5)

[first, last).

6)

ilist.

.

1-2) ( , ), bool, , .

3-4) , , .

5-6) .

1-2) , O(log(size())).

3-4) , . .	( C++11)
3-4) , . .	( C++11)

5-6) O(N*log(size() + N)), N .

emplace (C++11)	(public -) []
emplace_hint (C++11)	, (public -) []

-
set::set
set::~set
set::operator=
set::get_allocator

set::beginset::cbegin (C++11)
set::endset::cend (C++11)
set::rbeginset::crbegin (C++11)
set::rendset::crend (C++11)

set::empty
set::size
set::max_size

set::clear
set::insert
set::insert_range (C++23)
set::emplace (C++11)
set::emplace_hint (C++11)
set::erase
set::swap
set::extract (C++17)
set::merge (C++17)

set::count
set::find
set::contains (C++20)
set::equal_range
set::lower_bound
set::upper_bound

set::key_comp
set::value_comp
,
std::swap
erase_if (C++20)
operator==operator!=operator<operator>operator<=operator>=operator<=> ( C++20)( C++20)( C++20)( C++20)( C++20)(C++20)
(C++17)