stack : Java Glossary

by Roedy Green ©1996-2008 Canadian Mind Products
Go to : 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)

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

	Please email your feedback for publication, errors, omissions, broken/redirected link reports and suggestions to improve this page to Roedy Green :
	Canadian Mind Products
	mindprod.com IP:[65.110.21.43]
	Your face IP:[38.103.63.18]	The information on this page is for non-military use only.
	You are visitor number 11,901.	Military use includes use by defence contractors.
	You can get a fresh copy of this page from:	or possibly from your local J: drive (Java virtual drive/Mindprod website mirror)
	http://mindprod.com/jgloss/stack.html	J:\mindprod\jgloss\stack.html