Rob Stewart wrote:
> From: Jan Gaspar <[EMAIL PROTECTED]> > > > > This is something different - it is an iterator; if it reaches an end of the >container it shifts to its beginning. Cyclic buffer is a > > container with different capabilities. I can send it to you, if you want. > > Of course it is. However, since your circular buffer is merely > adapting a deque, you could just as well use Gennadiy's iterator > adapter to adapt the relevant (probably begin() and end()) > iterators of a deque or vector or.... You could even change your > implementation to use Gennadiy's iterator adapter. Your class > could be just a deque and an adapted iterator. I could but I don't want to. I don't want to mix two different concepts: circular buffer and circular iterator. I think that circular iterator is a standalone concept which can be used over any kind of container (even over circular buffer). BTW I'm improving the circular buffer implementation - it will adapt a vector. This will result in performance increase and improvement of iterator invalidation. > > > > "Neal D. Becker" wrote: > > > > > This is from Gennadiy Rozental. I believe this is the latest > > > version. Please correct me if not. Since it is small, I'll just post it here: > > > ... > > -- > Rob Stewart [EMAIL PROTECTED] > Software Engineer http://www.sig.com > Susquehanna International Group, LLP using std::disclaimer; > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost -- Jan Gaspar | [EMAIL PROTECTED] Whitestein Technologies | www.whitestein.com Panenska 28 | SK-81103 Bratislava | Slovak Republic Tel +421(2)5443-5502 | Fax +421(2)5443-5512 _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
