StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
9167031
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2012-02-06T20:48:37.273
FavoriteCount
0
LastActivityDate
2012-02-06T22:02:31.977
LastEditDate
2012-02-06T22:02:31.977
LastEditorUserId
1193266
OwnerUserId
1193266
ParentId
2616643
PostTypeId
2
Score
2
ViewCount
0
LastEditorDisplayName
text
Body
<p>This should provide some ideas/solutions: 2 renditions, the second is a little lighter in weight. Both tested using a subrange of a vector and a list ...</p> <pre><code>#include <vector> template <typename T, typename Container = std::vector<T>, typename Iterator = Container::iterator> class RingIterator : public std::iterator <std::bidirectional_iterator_tag, T, ptrdiff_t> { Container& data; Iterator cursor; Iterator begin; Iterator end; public: RingIterator (Container& v) : data(v), cursor(v.begin()), begin(v.begin()), end(v.end()) {} RingIterator (Container& v, const Iterator& i) : data(v), cursor(i), begin(v.begin()), end(v.end()) {} RingIterator (Container& v, const Iterator& i, const Iterator& j) : data(v), cursor(i), begin(i), end(j) {} RingIterator (Container& v, size_t i) : data(v), cursor(v.begin() + i % v.size()), begin(v.begin()), end(v.end()) {} bool operator == (const RingIterator& x) const { return cursor == x.cursor; } bool operator != (const RingIterator& x) const { return ! (*this == x); } reference operator*() const { return *cursor; } RingIterator& operator++() { ++cursor; if (cursor == end) cursor = begin; return *this; } RingIterator operator++(int) { RingIterator ring = *this; ++*this; return ring; } RingIterator& operator--() { if (cursor == begin) cursor = end; --cursor; return *this; } RingIterator operator--(int) { RingIterator ring = *this; --*this; return ring; } RingIterator insert (const T& x) { return RingIterator (data, data.insert (cursor, x)); } RingIterator erase() { return RingIterator (data, data.erase (cursor)); } }; template <typename T, typename Iterator> class CyclicIterator : public std::iterator <std::bidirectional_iterator_tag, T, ptrdiff_t> { Iterator cursor; Iterator begin; Iterator end; public: CyclicIterator (const Iterator& i, const Iterator& j) : cursor(i), begin(i), end(j) {} bool operator == (const CyclicIterator& x) const { return cursor == x.cursor; } bool operator != (const CyclicIterator& x) const { return ! (*this == x); } reference operator*() const { return *cursor; } CyclicIterator& operator++() { ++cursor; if (cursor == end) cursor = begin; return *this; } CyclicIterator operator++(int) { CyclicIterator ring = *this; ++*this; return ring; } CyclicIterator& operator--() { if (cursor == begin) cursor = end; --cursor; return *this; } CyclicIterator operator--(int) { CyclicIterator ring = *this; --*this; return ring; } }; #include <iostream> #include <iomanip> #include <list> enum { CycleSize = 9, ContainerSize }; template <typename cyclicIterator> void test (cyclicIterator& iterator, size_t mn) { int m = mn; while (m--) for (int n = mn; n--; ++iterator) std::cout << std::setw(3) << *iterator << ' '; --iterator; m = mn; while (m--) for (int n = mn; n--; --iterator) std::cout << std::setw(3) << *iterator << ' '; } template <typename containers> void load (containers& container) { while (container.size() < ContainerSize) container.push_back (container.size()); } void main (void) { typedef std::vector<int> vContainer; typedef vContainer::iterator vIterator; typedef std::list<int> lContainer; typedef lContainer::iterator lIterator; vContainer v; load (v); vIterator vbegin = v.begin() + 1; RingIterator <int, vContainer, vIterator> vring (v, vbegin, v.end()); CyclicIterator <int, vIterator> vcycle (vbegin, v.end()); lContainer l; load (l); lIterator lbegin = l.begin(); ++lbegin; RingIterator <int, lContainer, lIterator> lring (l, lbegin, l.end()); CyclicIterator <int, lIterator> lcycle (lbegin, l.end()); test (vring, CycleSize); test (vcycle, CycleSize); test (lring, CycleSize); test (lcycle, CycleSize); } </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POIs there a standard cyclic iterator in C++
  singulars
  PostTypePostTypeId
  PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USMikal Keenan
UserOwnerUserId
1. USMikal Keenan
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
  singulars
  PostPostId
  PO
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTUpMod
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.