std::priority_queue<T,Container,Compare>::emplace
From cppreference.com
< cpp | container | priority queue
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Containers library
(C++17)
(C++11)
(C++26)
(C++26)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++23)
(C++23)
(C++23)
(C++20)
(C++23)
Tables
std::priority_queue template< class... Args >
void emplace( Args&&... args );
(since C++11)
void emplace( Args&&... args );
Pushes a new element to the priority queue. 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.
Effectively callsc.emplace_back(std::forward <Args>(args)...); std::push_heap (c.begin(), c.end(), comp);
[edit] Parameters
args
-
arguments to forward to the constructor of the element
[edit] Return value
(none)
[edit] Complexity
Logarithmic number of comparisons plus the complexity of Container::emplace_back.
[edit] Example
Run this code
#include <iostream> #include <queue> struct S { int id; S(int i, double d, std::string s) : id{i} { std::cout << "S::S(" << i << ", " << d << ", \"" << s << "\");\n"; } friend bool operator< (S const& x, S const& y) { return x.id < y.id; } }; int main() { std::priority_queue <S> queue; queue.emplace(42, 3.14, "C++"); std::cout << "id: " << queue.top().id << '\n'; }
Output:
S::S(42, 3.14, "C++") id = 42