c++ loop data structure

Question

Possible Duplicate:
Does a standard implementation of a Circular List exist for C++?

Is there ready a template class in some c++ library that is some kind of a loop: A liked list where the last node references the first one.

Admittedly this wouldn't always be a practical class to use since there couldn't exist a end() iterator nor a well defined begin() iterator. But I could really have use for one and I was hoping that I wouldn't have to code it myself.

Edit:

Thank you both (Vivek Goel and madmik3) and for your answers, but unfortunately they have nothing to do with my question (I suggest http://en.wikipedia.org/wiki/Linked_list to you both). I also found the same question here, didn't find it yesterday. I apologise for posting the same question.

@petter I am still curious why the two answers have nothing to do with what you need? They seem to be perfect answers? — jogojapan, Oct 21 '12 at 10:14
They are not liked. Their iterators do not loop. There is a risk of writing over nodes and pointers may then not point to what you would expect them to point at. I know that you could make a circular linked list wrapper using circular buffer, but I don't see any advantage in doing so. — petter, Oct 22 '12 at 04:45

score 1 · Answer 1 · edited Oct 20 '12 at 21:22

1

What about Circular Buffer from boost http://www.boost.org/doc/libs/1_51_0/libs/circular_buffer/doc/circular_buffer.html

edited Oct 20 '12 at 21:22

Griwes

8,805
2
43
70

answered Oct 20 '12 at 21:20

Vivek Goel

22,942
29
114
186

score 0 · Answer 2 · edited Oct 20 '12 at 21:23

0

Boost has a circular buffer.

http://www.boost.org/doc/libs/1_51_0/libs/circular_buffer/doc/circular_buffer.html

You can also see sample code here:

http://en.wikipedia.org/wiki/Ring_buffer

edited Oct 20 '12 at 21:23

Griwes

8,805
2
43
70

answered Oct 20 '12 at 21:21

madmik3

6,975
3
38
60

c++ loop data structure

2 Answers2