找到一个作者的关于环形队列的源码，分享一下

boost 已经有了一个这样

的缓冲区,circular_buffer，由Jan Gaspar设计实现，它的数据结构跟传统的环形队列(很多数

据结构书上有相关介绍)一样，速度比传统的环形队列快得多。只不过我对它的表现还是不

太满意，觉得它还不够快。为此，我设计了一个简单的循环双端队列，它的数据结构与

circular_buffer 没什么两样，但没有编写迭代器，也没有给出太多公有成员函数，只不过它

的速度要快一些-To find a queue of the source on the ring, to share such a boost already have a buffer, circular_buffer, designed and implemented by the Jan Gaspar, and its data structure with the traditional circular queue (a lot of data structures related presentations on the book) as , the speed is much faster than the traditional circular queue. But I am still not satisfied with its performance, that it is not fast enough. To this end, I designed a simple double-ended queue, circular, and its data structure and circular_buffer no different, but did not write iterators, nor give too much public member function, but some of its faster