dequeaslinkedlist.cs

来自「Data Structures and Algorithms with Obj」· CS 代码 · 共 61 行

namespace Opus6
{
    using System;
    using System.Collections;

    [Copyright("Copyright (c) 2001 by Bruno R. Preiss, P.Eng."), Version("$Id: DequeAsLinkedList.cs,v 1.3 2001/09/11 12:04:04 brpreiss Exp $")]
    public class DequeAsLinkedList : QueueAsLinkedList, Deque, Container, IComparable, IEnumerable
    {
        public object DequeueHead()
        {
            return base.Dequeue();
        }

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

        public void EnqueueHead(object obj)
        {
            base.list.Prepend(obj);
            base.count++;
        }

        public void EnqueueTail(object obj)
        {
            base.Enqueue(obj);
        }

        public static void Main()
        {
            Opus6.Console.WriteLine("DequeAsLinkedList Test");
            Deque deque1 = new DequeAsLinkedList();
            QueueAsArray.TestQueue((Opus6.Queue) deque1);
            DequeAsArray.TestDeque(deque1);
        }


        public object Tail
        {
            get
            {
                if (base.count == 0)
                {
                    throw new ContainerEmptyException();
                }
                return base.list.Last;
            }
        }

    }
}