stackasarray.cs

Data Structures and Algorithms with Object-Oriented Design Patterns in C# 这本书的范例代码dll自己反编译的source

namespace Opus6
{
    using System;
    using System.Collections;

    [Copyright("Copyright (c) 2001 by Bruno R. Preiss, P.Eng."), Version("$Id: StackAsArray.cs,v 1.5 2001/10/28 19:50:09 brpreiss Exp $")]
    public class StackAsArray : AbstractContainer, Opus6.Stack, Container, IComparable, IEnumerable
    {
        public StackAsArray(int size)
        {
            this.array = new object[size];
        }

        public override void Accept(Visitor visitor)
        {
            for (int num1 = 0; num1 < base.count; num1++)
            {
                visitor.Visit(this.array[num1]);
                if (visitor.IsDone)
                {
                    return;
                }
            }
        }

        public override int CompareTo(object obj)
        {
            throw new MethodNotImplementedException();
        }

        public override IEnumerator GetEnumerator()
        {
            return new Opus6.StackAsArray.Enumerator(this);
        }

        public static void Main()
        {
            Opus6.Console.WriteLine("StackAsArray Test");
            Opus6.Stack stack1 = new StackAsArray(5);
            StackAsArray.TestStack(stack1);
        }

        public object Pop()
        {
            if (base.count == 0)
            {
                throw new ContainerEmptyException();
            }
            object obj1 = this.array[--base.count];
            this.array[base.count] = null;
            return obj1;
        }

        public override void Purge()
        {
            while (base.count > 0)
            {
                this.array[--base.count] = null;
            }
        }

        public void Push(object obj)
        {
            if (base.count == this.array.Length)
            {
                throw new ContainerFullException();
            }
            this.array[base.count++] = obj;
        }

        internal static void TestStack(Opus6.Stack stack)
        {
            for (int num1 = 0; num1 < 6; num1++)
            {
                if (stack.IsFull)
                {
                    break;
                }
                stack.Push(new Association(num1, num1));
            }
            Opus6.Console.WriteLine(stack);
            while (!stack.IsEmpty)
            {
                object obj1 = stack.Pop();
                Opus6.Console.WriteLine(obj1);
            }
        }


        public override bool IsFull
        {
            get
            {
                return (base.count == this.array.Length);
            }
        }

        public object Top
        {
            get
            {
                if (base.count == 0)
                {
                    throw new ContainerEmptyException();
                }
                return this.array[base.count - 1];
            }
        }


        protected object[] array;


        private class Enumerator : IEnumerator
        {
            internal Enumerator(StackAsArray stack)
            {
                this.position = -1;
                this.stack = stack;
            }

            public bool MoveNext()
            {
                if (++this.position == this.stack.count)
                {
                    this.position = -1;
                }
                return (this.position >= 0);
            }

            public void Reset()
            {
                this.position = -1;
            }


            public object Current
            {
                get
                {
                    if (this.position < 0)
                    {
                        throw new InvalidOperationException();
                    }
                    return this.stack.array[this.position];
                }
            }


            protected int position;
            private StackAsArray stack;
        }
    }
}