std::deque<T,Allocator>::push_front

From cppreference.com
< cpp‎ | container‎ | deque

 
 
Containers library
Sequence
(C++11)
Associative
Unordered associative
Adaptors
Views
(C++20)
 
 
void push_front( const T& value );
void push_front( T&& value );
(since C++11)

Prepends the given element value to the beginning of the container.

All iterators, including the past-the-end iterator, are invalidated. No references are invalidated.

Parameters

value - the value of the element to prepend

Return value

(none)

Complexity

Constant.

Exceptions

If an exception is thrown, this function has no effect (strong exception guarantee).

Example

#include <deque>
#include <iostream>
#include <iomanip>
#include <string>
 
int main()
{
    std::deque<std::string> letters;
 
    letters.push_front("abc");
    std::string s{"def"};
    letters.push_front(std::move(s));
 
    std::cout << "std::deque `letters` holds: ";
    for (auto&& e : letters) std::cout << std::quoted(e) << ' ';
 
    std::cout << "\nMoved-from string `s` holds: " << std::quoted(s) << '\n';
}

Possible output:

std::deque `letters` holds: "def" "abc" 
Moved-from string `s` holds: ""

See also

constructs an element in-place at the beginning
(public member function)
adds an element to the end
(public member function)
removes the first element
(public member function)
creates a std::front_insert_iterator of type inferred from the argument
(function template)