I'd like to do the following:
std::stack <int> s; int h = 0; s.push(2); h = s.pop();
Such as to have h
hold the value 2. When I try my method, I get “void value not ignored as it ought to be”.
Is this not the intention of the .pop()
method? What is the preferred way to do this?
S. pop() does not return any value. Because pop() is void function.
stack::pop() function is an inbuilt function in C++ STL, which is defined in <stack>header file. pop() is used to pop or remove an element from the top of the stack container. The content from the top is removed and the size of the container is reduced by 1.
Underflow happens when we try to pop an item from an empty stack. If top is less than zero this means that an uncaught underflow has occurred.
The standard library containers separate top()
and pop()
: top()
returns a reference to the top element, and pop()
removes the top element. (And similarly for back()
/pop_back()
etc.).
There's a good reason for this separation, and not have pop
remove the top element and return it: One guiding principle of C++ is that you don't pay for what you don't need. A single function would have no choice but to return the element by value, which may be undesired. Separating concerns gives the user the most flexibility in how to use the data structure. (See note #3 in the original STL documentation.)
(As a curiousum, you may notice that for a concurrent container, a pop
-like function is actually forced to remove and return the top value atomically, since in a concurrent context, there is no such notion as "being on top" (or "being empty" for that matter). This is one of the obvious examples of how concurrent data structures take a significant performance hit in order to provide their guarantees.)
You can use:
h = s.top();
then after that use(if you want to remove the most recent value otherwise do nothing)
s.pop();
It works the same way!!
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With