std::stack<T,Container>::top
From cppreference.com
C++
Containers library
(C++17) | ||||
| Sequence | ||||
(C++11) | ||||
(C++26) | ||||
(C++26) | ||||
(C++11) | ||||
| Associative | ||||
| Unordered associative | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
| Adaptors | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
| Views | ||||
(C++20) | ||||
(C++23) | ||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
std::stack| Member functions | ||||
| Element access | ||||
stack::top | ||||
| Capacity | ||||
| Modifiers | ||||
(C++23) | ||||
(C++11) | ||||
(C++11) | ||||
| Non-member functions | ||||
(C++11) | ||||
| Helper classes | ||||
(C++11) | ||||
(C++23) | ||||
| Deduction guides(C++17) |
| 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().
Contents |
[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
[edit] See also
| inserts element at the top (public member function) [edit] | |
| removes the top element (public member function) [edit] |