This java code essentially actualizes stack usefulness. It can Pop and Push a thing in stack with the assistance of exhibit. The thing must be a whole number and inernally the java system uses clusters to keep up things in stack.
/*******************************************************
* MYCPLUS Sample Code - http://www.mycplus.com *
*
* This code is made accessible as a support of our *
* guests and is given entirely to the *
* motivation behind delineation. *
*
* Please guide all request to saqib at mycplus.com *
*******************************************************/
import java.awt.event.*;
import java.awt.*;
import javax.swing.*;
open class ArrayStack executes Stack
{
/Construct the stack.
open ArrayStack( )
{
theArray = (AnyType []) new Object[ DEFAULT_CAPACITY ];
topOfStack = - 1;
}
open boolean isEmpty( )
{
return topOfStack == - 1;
}
open void makeEmpty( )
{
topOfStack = - 1;
}
open AnyType top( )
{
in the event that( isEmpty( )
toss new UnderflowException( "ArrayStack top" );
return theArray[ topOfStack ];
}
open void pop( )
{
on the off chance that( isEmpty( )
toss new UnderflowException( "ArrayStack pop" );
topOfStack- - ;
}
open AnyType topAndPop( )
{
on the off chance that( isEmpty( )
toss new UnderflowException( "ArrayStack topAndPop" );
return theArray[ topOfStack- - ];
}
/Insert another thing into the stack.
open void push( AnyType x )
{
on the off chance that( topOfStack + 1 == theArray.length )
doubleArray( );
theArray[ ++topOfStack ] = x;
}
/Internal strategy to develop theArray.
private void doubleArray( )
{
AnyType [ ] newArray;
newArray = (AnyType []) new Object[ theArray.length * 2 ];
for( int i = 0; i < theArray.length; i++ )
newArray[ i ] = theArray[ i ];
theArray = newArray;
}
private AnyType [ ] theArray;
private int topOfStack;
private static last int DEFAULT_CAPACITY = 10;
}
