测试链式堆栈的实例

/*_############################################################################
  _##
  _##  测试链式堆栈的实例
  _##  Author: xwlee                        
  _##  Time: 2006.12.31 
  _##  Chang'an University
  _##  Development condition: win2003 Server+VC6.0
  _##
  _##  temp.cpp 文件
  _##########################################################################*/
#include<iostream>
#include <ctime>
#include <iomanip>
#include "stack.h"
using namespace std;

#define TEMP_SIZE 40

int main()
{  
    STACK_TYPE temp=10;
    int i;

    //create_stack( 1 );
     push( temp );
    cout << "top()=" << top() << endl;
    pop();
    cout << "is_empty()=" << is_empty() << endl;
    cout << "is_full()=" << is_full() << endl;
    //destroy_stack();

    //create_stack( TEMP_SIZE );
    cout<< "=======================================================" << endl;
    srand( (unsigned)time( NULL ) ); // srand()函数产生一个以当前时间开始的随机种子.
    for(i=0; i < TEMP_SIZE; i++)
        push( 1+rand()%1000 );
       
    for(i=0; i < TEMP_SIZE; i++)
    {
        cout << setw(5) << top();
        pop();
        if( (i+1) % 10 == 0 )
            cout << endl;
    }
    cout<< "=======================================================" << endl;
   
    cout << "is_empty()=" << is_empty() << endl;
    cout << "is_full()=" << is_full() << endl;

    destroy_stack();
   
    return 0;
}