/*_############################################################################
_##
_## 測試堆棧的執行個體
_## Author: xwlee
_## Time: 2006.12.30
_## Chang'an University
_## Development condition: win2003 Server+VC6.0
_##
_## temp.cpp 檔案
_##########################################################################*/
#include<iostream>
#include <ctime>
#include <iomanip>
#include "stack.h"
using namespace std;
int main()
{
STACK_TYPE temp=10;
int i;
cout << "is_empty()=" << is_empty() << endl;
cout << "is_full()=" << is_full() << endl;
push( temp );
cout << "top()=" << top() << endl;
pop();
cout << "is_empty()=" << is_empty() << endl;
cout << "is_full()=" << is_full() << endl;
cout<< "=======================================================" << endl;
srand( (unsigned)time( NULL ) ); // srand()函數產生一個以目前時間開始的隨機種子.
for(i=0; i<100; i++)
push( 1+rand()%1000 );
for(i=0; i<100; 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;
return 0;
}