环形队列的应用

/// <summary>
    /// 环形队列
    /// </summary>
    /// <typeparam name="T"></typeparam>
    public class CircleQueue<T>
    {
        private T[] queue;
        private int length;
        private int capacity;
        /// <summary>
        /// 头部
        /// </summary>
        private int head = 0;
        /// <summary>
        /// 尾部
        /// </summary>
        private int tail = 0;

        public CircleQueue(int capacity)
        {
            this.capacity = capacity;
            this.length = 0;
            this.head = 0;
            this.tail = 0;
            this.queue = new T[capacity];
        }
        /// <summary>
        /// 清空
        /// </summary>
        public void Clear()
        {
            head = 0;
            tail = 0;
            length = 0;
            this.queue = new T[this.capacity];
        }
        /// <summary>
        /// 队列是否为空
        /// </summary>
        /// <returns></returns>
        public bool IsEmpty()
        {
            return length == 0;
        }
        /// <summary>
        /// 队列是否已满
        /// </summary>
        /// <returns></returns>
        public bool IsFull()
        {
            return length == capacity;
        }
        /// <summary>
        /// 队列长度
        /// </summary>
        /// <returns></returns>
        public int Length()
        {
            return length;
        }
        /// <summary>
        /// 获取队列
        /// </summary>
        /// <returns></returns>
        public T[] GetAllQueue()
        {
            return queue;
        }
        /// <summary>
        /// 插入队列
        /// </summary>
        /// <param name="node"></param>
        /// <returns></returns>
        public bool EnQueue(T node)
        {
            if (IsFull() == false)
            {
                queue[tail] = node;
                tail = (++tail) % capacity;
                length++;
                return true;
            }
            return false;
        }
        /// <summary>
        /// 获取队列第一个元素
        /// </summary>
        /// <returns></returns>
        public T DeQueue()
        {
            T node = default(T);
            if (IsEmpty() == false)
            {
                node = queue[head];
                head = (++head) % capacity;
                length--;
            }
            return node;
        }
        /// <summary>
        /// 显示剩余数据
        /// </summary>
        public void ShowItems()
        {
            for (int i = head; i < length + head; i++)
            {
                Console.WriteLine(queue[i % capacity]);
            }
        }
    }//end