环形队列是在实际编程极为有用的数据结构,它有如下特点。它是一个首尾相连的FIFO的数据结构，采用数组的线性空间,数据组织简单。能很快知道队列是否满为空。能以很快速度的来存取数据。 因为有简单高效的原因，甚至在硬件都实现了环形队列.环形队列广泛用于网络数据收发，和不同程序间数据交换（比如内核与应用程序大量交换数据,从硬件接收大量数据）均使用了环形队列.(The ring queue is a very useful data structure in practical programming, and it has the following features. It is a data structure of the end to end FIFO, using the linear space array, simple data organization. You can quickly know if the queue is empty. Accessing data at a very fast rate. Because of simple and efficient, even in the hardware implementation of circular queue. Circular queue is widely used in network data transceiver, and data exchange between different applications (such as the kernel and a large number of applications to exchange data, receiving large amounts of data from the hardware) using a circular queue.)