std::deque::emplace_back

 

C++

Language

Concepts

Utilities library

Strings library

Containers library

Algorithms library

Iterators library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

 

Containers library

array (C++11)

vector

deque

forward_list (C++11)

list

set

multiset

map

multimap

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

stack

queue

priority_queue

 

std::deque

Member functions

deque::deque

deque::~deque

deque::operator=

deque::assign

deque::get_allocator

Element access

deque::front

deque::back

Iterators

deque::begin deque::cbegin (C++11)

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

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

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

Capacity

deque::empty

deque::size

deque::max_size

deque::shrink_to_fit

Modifiers

deque::clear

deque::insert

deque::emplace

deque::erase

deque::push_front

deque::emplace_front

deque::pop_front

deque::push_back

deque::emplace_back

deque::pop_back

deque::resize

deque::swap

 

template< class... Args > void emplace_back( Args&&... args );		(since C++11)

Appends a new element to the end of the container. 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.

All iterators are invalidated. No references are invalidated.

Parameters

args

-

arguments to forward to the constructor of the element

Return value

(none)

Complexity

Constant.

Example

The following code uses emplace_back to add an element to a std::deque of an arbitrary class (President). It uses the parameters of President constructor. It also shows how using emplace_back saves the extra copy or move operation required when using push_back.

#include <deque>
#include <string>
#include <iostream>
 
struct President
{
  std::string name;
  std::string country;
  int year;
 
  President(std::string && p_name, std::string && p_country, int p_year)
    :name(std::move(p_name)), country(std::move(p_country)), year(p_year)
  {
      std::cout << "I am being constructed.\n";
  }
  President(President&& other)
    :name(std::move(other.name)), country(std::move(other.country)), year(other.year)
  {
    std::cout << "I am being moved.\n";
  }
  President& operator=(const President& other) = default;
 
};
 
int main()
{
  std::deque<President> elections;
  std::cout << "emplace_back:\n";
  elections.emplace_back("Nelson Mandela", "South Africa", 1994);
 
  std::deque<President> reElections;
  std::cout << "\npush_back:\n";
  reElections.push_back(President("Franklin Delano Roosevelt", "the USA", 1936));
 
  std::cout << "\nContents:\n";
  for (President & president: elections)
  {
    std::cout << president.name << " was elected president of "
      << president.country << " in " << president.year << ".\n";
  }
  for (President & president: reElections)
  {
    std::cout << president.name << " was re-elected president of "
      << president.country << " in " << president.year << ".\n";
  }
}

Output:

emplace_back:
I am being constructed.
 
push_back:
I am being constructed.
I am being moved.
 
Contents:
Nelson Mandela was elected president of South Africa in 1994.
Franklin Delano Roosevelt was re-elected president of the USA in 1936.

See also

push_back	adds elements to the end (public member function)