Description: 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
To Search:
File list (Check if you may need any files):
circular_deque\circular_deque.cbp
..............\circular_deque.hpp
..............\circular_deque_traditional.hpp
..............\compare.hpp
..............\delay.hpp
..............\performance of circular_buffer.pdf
..............\test.cpp
..............\timer.hpp
circular_deque
Download