Espacios de nombres
Variantes
Acciones

std::unordered_set::emplace_hint

De cppreference.com

 
 
 
std :: unordered_set
Las funciones miembro
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.
unordered_set::unordered_set
unordered_set::~unordered_set
unordered_set::operator=
unordered_set::get_allocator
Los iteradores
Original:
Iterators
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_set::begin
unordered_set::cbegin
unordered_set::end
unordered_set::cend
Capacidad
Original:
Capacity
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_set::erase
unordered_set::size
unordered_set::max_size
Modificadores
Original:
Modifiers
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_set::clear
unordered_set::insert
unordered_set::emplace
unordered_set::emplace_hint
unordered_set::erase
unordered_set::swap
Buscar
Original:
Lookup
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_set::count
unordered_set::find
unordered_set::equal_range
Bucket interfaz
Original:
Bucket interface
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_set::begin2
unordered_set::end2
unordered_set::bucket_count
unordered_set::max_bucket_count
unordered_set::bucket_size
unordered_set::bucket
Política Hash
Original:
Hash policy
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_set::load_factor
unordered_set::max_load_factor
unordered_set::rehash
unordered_set::reserve
Los observadores
Original:
Observers
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_set::hash_function
unordered_set::key_eq
 
template <class... Args>
iterator emplace_hint( const_iterator hint, Args&&... args );
(desde C++11)
Inserta un elemento nuevo en el recipiente, usando hint como una sugerencia en donde el elemento debe ir. El elemento se construye en el lugar, es decir, no copiar o mover las operaciones se realizan. The constructor of the element is called with exactly the same arguments as supplied to the function, forwarded with std::forward<Args>(args)....
Original:
Inserts a new element to the container, using hint as a suggestion where the element should go. The element is constructed in-place, i.e. no copy or move operations are performed. The constructor of the element is called with exactly the same arguments as supplied to the function, forwarded with std::forward<Args>(args)....
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

If rehashing occurs due to the insertion, all iterators are invalidated. Otherwise iterators are not affected. References are not invalidated. Rehashing occurs only if the new number of elements is higher than max_load_factor()*bucket_count().

Contenido

[editar] Parámetros

hint -
iterador, usado como una sugerencia en cuanto a dónde insertar el nuevo elemento
Original:
iterator, used as a suggestion as to where to insert the new element
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
args -
argumentos que transmitan al constructor del elemento
Original:
arguments to forward to the constructor of the element
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

[editar] Valor de retorno

Devuelve un iterador al elemento recién insertado .
Original:
Returns an iterator to the newly inserted element.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

If the insertion failed because the element already exists, returns an iterator to the already existing element with the equivalent key.

[editar] Complejidad

Amortized constant on average, worst case linear in the size of the container.

[editar] Ver también

constructs element in-place
(miembro público función) [edit]
Inserta elementos
Original:
inserts elements
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

(miembro público función) [edit]