stack : Java Glossary

go to home page S words local find full screen, hide local find menu Google search web for more information on this topic jump to foot of page translate this page with Babelfish punctuation 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z (all) ©1996-2009 Roedy Green, Canadian Mind Products
stack
A stack is a sort of LIFO (last in first out) queue. Stacks behave like the stacking trays at a cafeteria. The JVM uses a hidden stack to keep track of which method called which method and with what parameters. Every thread has its own private stack of about one megabyte. There is no Collection called Stack, but is fairly easy to write one. Adding to a stack is called pushing and retrieving the top element is called popping. Discarding the top element is called dropping. Duplicating the top element is called duping.

In Forth and PostScript the stacks are explicit. In Java they are hidden, except for printStackTrace.

Local variables are often called stack variables because they are stored on the stack. In Java, the stack contains the local variables for each running method is the thread, and the places to return to in the calling program for each level of call. If you call too many methods without returning (usually by using recursion) you will generate a StackOverFlowError.

Collection
debugging
Forth
local scope
PostScript
printStackTrace
recursion
tracing
CMP homejump to top You can get the freshest copy of this page from: or possibly from your local J: drive (Java virtual drive/mindprod.com website mirror)
http://mindprod.com/jgloss/stack.html J:\mindprod\jgloss\stack.html
CMP logofeedback Please email your feedback for publication, errors, omissions, typos, formatting errors, ambiguities, unclear wording, broken/redirected link reports, suggestions to improve this page or comments to Roedy Green : feedback email
mindprod.com IP:[65.110.21.43]
view BlogYour face IP:[38.107.191.101]
You are visitor number 15,626.