Stacks Examples

Stacks Examples

Stacks 1 - No Description Available

Stacks 2 - No Description Available

Stacks 3 - No Description Available

Stacks 4 - No Description Available

Stacks 5 - No Description Available


Stacks1 Example Code

// Copyright(c) 1996 ObjectSpace, Inc. import java.util.Enumeration; import jgl.*; public class Stacks1 { public static void main( String[] args ) { Stack stack = new Stack(); stack.push( "bat" ); stack.push( "cat" ); stack.push( "dog" ); System.out.println( "stack = " + stack ); System.out.println(); System.out.println( "Non-destructively enumerate the Stack." ); Enumeration e = stack.elements(); while( e.hasMoreElements() ) System.out.println( e.nextElement() ); System.out.println(); System.out.println( "Pop and print each element." ); while( !stack.isEmpty() ) System.out.println( stack.pop() ); } }

Stacks1 Example Output

stack = Stack( Array( bat, cat, dog ) ) Non-destructively enumerate the Stack. bat cat dog Pop and print each element. dog cat bat

Stacks2 Example Code

// Copyright(c) 1996 ObjectSpace, Inc. import jgl.*; public class Stacks2 { public static void main( String[] args ) { // Use a DList as the underlying data structure. Stack stack = new Stack( new DList() ); stack.push( "bat" ); stack.push( "cat" ); stack.push( "dog" ); System.out.println( "Print the Stack." ); System.out.println( stack ); } }

Stacks2 Example Output

Print the Stack. Stack( DList( bat, cat, dog ) )

Stacks3 Example Code

// Copyright(c) 1996 ObjectSpace, Inc. import java.util.Enumeration; import jgl.*; public class Stacks3 { public static void main( String[] args ) { Queue queue = new Queue(); queue.push( "bat" ); queue.push( "cat" ); queue.push( "dog" ); System.out.println( "queue = " + queue ); System.out.println(); System.out.println( "Non-destructively enumerate the Queue." ); Enumeration e = queue.elements(); while( e.hasMoreElements() ) System.out.println( e.nextElement() ); System.out.println(); System.out.println( "Pop and print each element." ); while( !queue.isEmpty() ) System.out.println( queue.pop() ); } }

Stacks3 Example Output

queue = Queue( SList( bat, cat, dog ) ) Non-destructively enumerate the Queue. bat cat dog Pop and print each element. bat cat dog

Stacks4 Example Code

// Copyright(c) 1996 ObjectSpace, Inc. import java.util.Enumeration; import jgl.*; public class Stacks4 { public static void main( String[] args ) { // Use a HashComparator for comparing elements. Since the hash value of an // Integer is its int value, this will order Integers in descending order. PriorityQueue queue = new PriorityQueue(); queue.push( new Integer( 5 ) ); queue.push( new Integer( -2 ) ); queue.push( new Integer( 10 ) ); queue.push( new Integer( 6 ) ); queue.push( new Integer( 20 ) ); queue.push( new Integer( -10 ) ); System.out.println( "queue = " + queue ); System.out.println(); System.out.println( "Non-destructively enumerate the PriorityQueue." ); Enumeration e = queue.elements(); while( e.hasMoreElements() ) System.out.print( e.nextElement() + " " ); System.out.println(); System.out.println( "Pop and print each element." ); while( !queue.isEmpty() ) System.out.print( queue.pop() + " " ); System.out.println(); } }

Stacks4 Example Output

queue = PriorityQueue( Array( 20, 10, 5, -2, 6, -10 ) ) Non-destructively enumerate the PriorityQueue. 20 10 5 -2 6 -10 Pop and print each element. 20 10 6 5 -2 -10

Stacks5 Example Code

// Copyright(c) 1996 ObjectSpace, Inc. import jgl.*; public class Stacks5 { public static void main( String[] args ) { // Use a GreaterString function object for comparing elements. This will // order strings in ascending order. PriorityQueue queue = new PriorityQueue( new GreaterString() ); queue.push( "cat" ); queue.push( "dog" ); queue.push( "ape" ); queue.push( "bat" ); queue.push( "fox" ); queue.push( "emu" ); System.out.println( "Pop and print each element." ); while( !queue.isEmpty() ) System.out.print( queue.pop() + " "); System.out.println(); } }

Stacks5 Example Output

Pop and print each element. ape bat cat dog emu fox