queueaslinkedlist.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: QueueAsLinkedList.cs,v 1.5 2001/10/28 19:50:09 brpreiss Exp $")]
    public class QueueAsLinkedList : AbstractContainer, Opus6.Queue, Container, IComparable, IEnumerable
    {
        public QueueAsLinkedList()
        {
            this.list = new LinkedList();
        }

        public override void Accept(Visitor visitor)
        {
            for (LinkedList.Element element1 = this.list.Head; element1 != null; element1 = element1.Next)
            {
                visitor.Visit(element1.Datum);
                if (visitor.IsDone)
                {
                    return;
                }
            }
        }

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

        public object Dequeue()
        {
            if (base.count == 0)
            {
                throw new ContainerEmptyException();
            }
            object obj1 = this.list.First;
            this.list.Extract(obj1);
            base.count--;
            return obj1;
        }

        public void Enqueue(object obj)
        {
            this.list.Append(obj);
            base.count++;
        }

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

        public static void Main()
        {
            Opus6.Console.WriteLine("QueueAsLinkedList Test");
            Opus6.Queue queue1 = new QueueAsLinkedList();
            QueueAsArray.TestQueue(queue1);
        }

        public override void Purge()
        {
            this.list.Purge();
            base.count = 0;
        }


        public object Head
        {
            get
            {
                if (base.count == 0)
                {
                    throw new ContainerEmptyException();
                }
                return this.list.First;
            }
        }


        protected LinkedList list;


        private class Enumerator : IEnumerator
        {
            internal Enumerator(QueueAsLinkedList queue)
            {
                this.queue = queue;
            }

            public bool MoveNext()
            {
                if (this.position == null)
                {
                    this.position = this.queue.list.Head;
                }
                else
                {
                    this.position = this.position.Next;
                }
                return (this.position != null);
            }

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


            public object Current
            {
                get
                {
                    if (this.position == null)
                    {
                        throw new InvalidOperationException();
                    }
                    return this.position.Datum;
                }
            }


            private LinkedList.Element position;
            private QueueAsLinkedList queue;
        }
    }
}