StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
1391479
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
1
CommunityOwnedDate
CreationDate
2009-09-08T00:55:18.493
FavoriteCount
0
LastActivityDate
2009-09-08T02:17:04.553
LastEditDate
2009-09-08T02:17:04.553
LastEditorUserId
34509
OwnerUserId
34509
ParentId
1390703
PostTypeId
2
Score
54
ViewCount
0
LastEditorDisplayName
text
Body
To add to @StackedCrooked answer, you can overload <code>operator++</code>, <code>operator--</code> and <code>operator*</code> and have iterator like functionality. <pre><code>enum Color { Color_Begin, Color_Red = Color_Begin, Color_Orange, Color_Yellow, Color_Green, Color_Blue, Color_Indigo, Color_Violet, Color_End }; namespace std { template<> struct iterator_traits<Color> { typedef Color value_type; typedef int difference_type; typedef Color *pointer; typedef Color &reference; typedef std::bidirectional_iterator_tag iterator_category; }; } Color &operator++(Color &c) { assert(c != Color_End); c = static_cast<Color>(c + 1); return c; } Color operator++(Color &c, int) { assert(c != Color_End); ++c; return static_cast<Color>(c - 1); } Color &operator--(Color &c) { assert(c != Color_Begin); return c = static_cast<Color>(c - 1); } Color operator--(Color &c, int) { assert(c != Color_Begin); --c; return static_cast<Color>(c + 1); } Color operator*(Color c) { assert(c != Color_End); return c; } </code></pre> Let's test with some <code><algorithm></code> template <pre><code>void print(Color c) { std::cout << c << std::endl; } int main() { std::for_each(Color_Begin, Color_End, &print); } </code></pre> Now, <code>Color</code> is a constant bidirectional iterator. Here is a reusable class i coded while doing it manually above. I noticed it could work for many more enums, so repeating the same code all over again is quite tedious <pre><code>// Code for testing enum_iterator // -------------------------------- namespace color_test { enum Color { Color_Begin, Color_Red = Color_Begin, Color_Orange, Color_Yellow, Color_Green, Color_Blue, Color_Indigo, Color_Violet, Color_End }; Color begin(enum_identity<Color>) { return Color_Begin; } Color end(enum_identity<Color>) { return Color_End; } } void print(color_test::Color c) { std::cout << c << std::endl; } int main() { enum_iterator<color_test::Color> b = color_test::Color_Begin, e; while(b != e) print(*b++); } </code></pre> Implementation follows. <pre><code>template<typename T> struct enum_identity { typedef T type; }; namespace details { void begin(); void end(); } template<typename Enum> struct enum_iterator : std::iterator<std::bidirectional_iterator_tag, Enum> { enum_iterator():c(end()) { } enum_iterator(Enum c):c(c) { assert(c >= begin() && c <= end()); } enum_iterator &operator=(Enum c) { assert(c >= begin() && c <= end()); this->c = c; return *this; } static Enum begin() { using details::begin; // re-enable ADL return begin(enum_identity<Enum>()); } static Enum end() { using details::end; // re-enable ADL return end(enum_identity<Enum>()); } enum_iterator &operator++() { assert(c != end() && "incrementing past end?"); c = static_cast<Enum>(c + 1); return *this; } enum_iterator operator++(int) { assert(c != end() && "incrementing past end?"); enum_iterator cpy(*this); ++*this; return cpy; } enum_iterator &operator--() { assert(c != begin() && "decrementing beyond begin?"); c = static_cast<Enum>(c - 1); return *this; } enum_iterator operator--(int) { assert(c != begin() && "decrementing beyond begin?"); enum_iterator cpy(*this); --*this; return cpy; } Enum operator*() { assert(c != end() && "cannot dereference end iterator"); return c; } Enum get_enum() const { return c; } private: Enum c; }; template<typename Enum> bool operator==(enum_iterator<Enum> e1, enum_iterator<Enum> e2) { return e1.get_enum() == e2.get_enum(); } template<typename Enum> bool operator!=(enum_iterator<Enum> e1, enum_iterator<Enum> e2) { return !(e1 == e2); } </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POEnumerate over an enum in C++
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USJohannes Schaub - litb
UserOwnerUserId
1. USJohannes Schaub - litb
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. POEnumerate over an enum in C++
 singulars
 PostTypePostTypeId
 PTQuestion
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
2. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTAcceptedByOriginator
3. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId
1. CO+1: This is really elegant.
 singulars
 PostPostId
 PO
 UserUserId
 USereOn

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.