/*
 * Stack.cs - A quick and dirty Stack implementation to support System.dll
 *
 * Copyright (C) 2002  Free Software Foundation
 *
 * Author:  Jonathan Springer <address@hidden>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

namespace System.Private
{

using System.Collections;
using System.Reflection;
using System.Resources;

using System;

internal class StackEmptyException : Exception {

	public StackEmptyException() : base() { }

	public StackEmptyException(string s) : base(s) { }
};

internal class Stack : ICollection, IEnumerable
{
	private Object [] o;
	private int _topofstack;

	//
	// Constructors
	//
	public Stack() : this(16) { }

	public Stack(int size) 
	{
		o = new Object [size];
		_topofstack = -1;
	}

	//
	//  Private Maintenance Methods
	//
	private void reallocate()
	{
		Object [] newo = new Object[o.Length * 2];
		for (int i=0; i<o.Length; i++)
		{
			newo[i] = o[i];
		}
		o = newo;
	}

	//
	//  Public Methods
	//
	public void Push(Object topush) 
	{
		++_topofstack;

		if (_topofstack == o.Length) 
		{
			reallocate();
		}
		o[_topofstack] = topush;
	}

	public object Pop() 
	{
		if (_topofstack == -1) 
		{
			throw new StackEmptyException();
		}
		return o[_topofstack--];
	}

	public object Peek() 
	{
		if (_topofstack == -1) 
		{
			throw new StackEmptyException();
		}
		return o[_topofstack];
	}

	//
	//  ICollection Implentation
	//
	public void CopyTo(Array array, int index)
	{
		for (int i=0; i<=_topofstack; i++)
		{
			array.SetValue(o[i],i+index);
		}
	}

	public int Count
	{
		get
		{
			return _topofstack+1;
		}
	}
	
	public bool IsSynchronized
	{
		get
		{
			return true;
		}
	}

	public object SyncRoot
	{
		get
		{
			return this;
		}
	}	

	//
	//  IEnumerable Implemenation
	//
	public IEnumerator GetEnumerator() {
		return o.GetEnumerator();
	}
}; // class Stack

};

public class Test {
	static void Main() {

		System.Private.Stack s;
		
		for (int i=1;i<32;i++)
		{
			// I want to push strings
			Console.Write("Pushing " + i.ToString());
			s.Push(i.ToString());
		}
		s.Push(null);

		while(true)
		{
			try
			{
				Console.WriteLine((string)s.Pop());
			}
			catch (System.Private.StackEmptyException e)
			{
				break;
			}
		}
		return;
	}

}; // class Test

//}; // namespace System.Private