To check the topmost element unfortunately you must explicitly index it var top = stack[stack.length-1]; the syntax stack[-1] (that would work in Python) doesn’t work: negative indexes are valid only as parameters to slice call. // The same as stack[stack.length-1], just slower and NOT idiomatic var top = stack.slice(-1)[0]; To extract an element there is … Read more
I’ve no idea why GCC organizes its stack the way it does (though I guess you could crack open its source or this paper and find out), but I can tell you how to guarantee the order of specific stack variables if for some reason you need to. Simply put them in a struct: void … Read more
Stack overflow is [a] cause, segmentation fault is the result. At least on x86 and ARM, the “stack” is a piece of memory reserved for placing local variables and return addresses of function calls. When the stack is exhausted, the memory outside of the reserved area will be accessed. But the app did not ask … Read more
To fully understand what emplace_back does, one must first understand variadic templates and rvalue references. This is a fairly advanced, and deep concept in modern C++. On a map, it would be labeled “there be dragons”. You say that you’re new to C++ and trying to learn this stuff. This may not be the answer … Read more
Your code has some confusion in its handling of the ‘{‘ and ‘}’ characters. It should be entirely parallel to how you handle ‘(‘ and ‘)’. This code, modified slightly from yours, seems to work properly: public static boolean isParenthesisMatch(String str) { if (str.charAt(0) == ‘{‘) return false; Stack<Character> stack = new Stack<Character>(); char c; … Read more
Kalyanaraman Santhanam: Edit: Will I encounter any issues if I use add(…) instead of push(…)? Definitly, you will not encounter any issues, because add is part of List interface as well as the Stack, but you should to notice the further readability of your code and your intentions in it by other programmers. push method … Read more
In the “debug perspective”, show the view named “debug”. For each thread that is currently halted, this view shows the full call stack. Clicking on one element of this stack switches the editor view to display the corresponding class, and “variables” view will show variables of this stack element.
If you need to remove items that aren’t on the top, then you need something other than a stack. Try making your own implementation of a stack from a List. Then you get to implement your own push and pop functions (add & remove on the list), and your own special PopFromTheMiddle function. For example … Read more
Instead of using .Count() == 0, just use .Count == 0. This is using the stack’s property rather than the linq extension method.
Stack orientation is an implementation detail. For example, Joy can be implemented using rewriting – no stack. This is why some prefer to say “concatenative” or “compositional”. With quotations and combinators you can code without thinking about the stack. Expressing yourself with pure composition and without locals or named arguments is the key. It’s extremely … Read more