https://svn.boost.org/trac10/ticket/5511 <p> Basically the whole library is quite good. But I have a couple of minor complaints. </p> <p> a) The documentation contains sentences like: </p> <pre class="wiki">"iterator begin(); Get the iterator pointing to the beginning of the circular_buffer. </pre><p> I <em>think</em> the refers to the current front of the queue - where ever that falls in the underlying storage. This I could use this iterator to iterate from the oldest item to the most recent item. Naturally the value returned by this function call would change as items are popped of the queue. But it could also refer to the begin (and end) of underlying storage. I don't think it does this - but it's not clear from the documentation. </p> <p> b) I would also like to have a constructor which allows me to pass any pair of random access iterators (ie. a range) and have the circular buffer use that rather than allocating it's own storage. This would make the package more useful to me and i would hope others as well. </p> <p> Robert Ramey </p> en-us /htdocs/site/boost.png https://svn.boost.org/trac10/ticket/5511 Trac 1.4.3 Jan Gaspar Thu, 24 Oct 2013 21:33:59 GMT https://svn.boost.org/trac10/ticket/5511#comment:1 https://svn.boost.org/trac10/ticket/5511#comment:1 <ul> <li><strong>owner</strong> changed from <span class="trac-author">Jan Gaspar</span> to <span class="trac-author">No-Maintainer</span> </li> </ul> Ticket