Stack Basics: last-in, first-out behavior : Stack « Collections « Java Tutorial

1.	Language
2.	Data Type
3.	Operators
4.	Statement Control
5.	Class Definition
6.	Development
7.	Reflection
8.	Regular Expressions
9.	Collections
10.	Thread
11.	File
12.	Generics
13.	I18N
14.	Swing
15.	Swing Event
16.	2D Graphics
17.	SWT
18.	SWT 2D Graphics
19.	Network
20.	Database
21.	Hibernate
22.	JPA
23.	JSP
24.	JSTL
25.	Servlet
26.	Web Services SOA
27.	EJB3
28.	Spring
29.	PDF
30.	Email
31.	J2ME
32.	J2EE Application
33.	XML
34.	Design Pattern
35.	Log
36.	Security
37.	Apache Common
38.	Ant
39.	JUnit

Java Source Code / Java Documentation

Java Open Source

Jar File Download

Photoshop Tutorials

Flash Tutorials

3ds-Max Tutorials

Illustrator Tutorials

C# / CSharp Tutorial

C# / CSharp Open Source

ASP.NET Tutorial

JavaScript DHTML

JavaScript Tutorial

JavaScript Reference

HTML CSS Reference

Python Tutorial

Python Open Source

SQL Server / T-SQL

SQL Server / T-SQL Tutorial

Oracle PL / SQL

Oracle PL/SQL Tutorial

VB.Net Tutorial

Flash / Flex / ActionScript

VBA / Excel / Access / Word

Microsoft Office PowerPoint 2007 Tutorial

Microsoft Office Excel 2007 Tutorial

Microsoft Office Word 2007 Tutorial

Java Tutorial » Collections » Stack

9. 13. 1. Stack Basics: last-in, first-out behavior

The java.util.Stack class is a Collection that behaves in a last-in-first-out (LIFO) manner.


import java.util.Stack;



public class MainClass {

  public static void main (String args[]) {

    Stack s = new Stack();

    s.push("A");

    s.push("B");

    s.push("C");



    System.out.println(s);

  }

}

[A, B, C]

9. 13. Stack
	9. 13. 1.	Stack Basics: last-in, first-out behavior
	9. 13. 2.	Adding Elements: To add an element to a stack, call the push() method
	9. 13. 3.	Removing Elements: To remove an element from the stack, the pop() method
	9. 13. 4.	If the size of the stack is zero, true is returned; otherwise, false is returned
	9. 13. 5.	Checking the Top: To get the element without removing: using the peek() method
	9. 13. 6.	To find out if an element is on the stack: the search() method
	9. 13. 7.	Demonstrate the generic Stack class.
	9. 13. 8.	A faster, smaller stack implementation.
	9. 13. 9.	A simple integer based stack.
	9. 13. 10.	A stack of simple integers
	9. 13. 11.	A very simple unsynchronized stack. This one is faster than the java.util-Version.
	9. 13. 12.	An implementation of the java.util.Stack based on an ArrayList instead of a Vector, so it is not synchronized to protect against multi-threaded access.
	9. 13. 13.	Character Stack
	9. 13. 14.	Growable Object stack with type specific access methods
	9. 13. 15.	Growable String stack with type specific access methods.
	9. 13. 16.	Growable int stack with type specific access methods
	9. 13. 17.	Stack for boolean values
	9. 13. 18.	extends ArrayList to create Stack

www.java2java.com | Contact Us

Copyright 2009 - 12 Demo Source and Support. All rights reserved.

All other trademarks are property of their respective owners.