在std或boost中是否有类似round_advance的东西？

Question

lets say I want to go through container in a circular way:

idx = 0, idx =1 .. idx = size()-1, idx =0, idx =1 ...

Is there a way to do in with std or boost? I know that algorithms operate on ranges not on containers so I guess Im out of luck, but I just wanted to check.

PS No need for manual implementations, it is trivial(if you dont forget about seq points :P ), just

curr_idx= (curr_idx+1) % my_cont.size()

Answer 1

我不知道类似的任何功能，但是此答案显示了如何使用Boost.Iterator创建在集合上循环的迭代器适配器。