std::stack<T,Container>::top
From cppreference.com
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::stack reference top();
(1)
const_reference top() const;
(2)
Returns reference to the top element in the stack. This is the most recently pushed element. This element will be removed on a call to pop() . Equivalent to: c .back().
[edit] Parameters
(none)
[edit] Return value
Reference to the last element.
[edit] Complexity
Constant.
[edit] Example
Run this code
#include <iostream> #include <stack> void reportStackSize(const std::stack <int>& s) { std::cout << s.size() << " elements on stack\n"; } void reportStackTop(const std::stack <int>& s) { // Leaves element on stack std::cout << "Top element: " << s.top() << '\n'; } int main() { std::stack <int> s; s.push(2); s.push(6); s.push(51); reportStackSize(s); reportStackTop(s); reportStackSize(s); s.pop(); reportStackSize(s); reportStackTop(s); }
Output:
3 elements on stack Top element: 51 3 elements on stack 2 elements on stack Top element: 6