StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
1904839
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2009-12-15T02:18:08.183
FavoriteCount
0
LastActivityDate
2009-12-15T03:06:56.663
LastEditDate
2009-12-15T03:06:56.663
LastEditorUserId
231352
OwnerUserId
231352
ParentId
1217403
PostTypeId
2
Score
1
ViewCount
0
LastEditorDisplayName
text
Body
<p>I solved a similar problem using the wxWidgets tree control. I used a singleton reference counter to track the objects I was putting in the control, and an iterator to traverse them. Here's an example.</p> <pre><code>class ReferenceCounter { public: // Singleton pattern. Implementation left up to you. static ReferenceCounter& get(); void add(const TreeData& data) { mCounter[data.getId()].push_back(&data); } void remove(const TreeData& data) { const CounterType::const_iterator itr = mCounter.find(data.getId()); if (itr != mCounter.end()) { ItemType& items = itr->second; items.erase(std::remove(items.begin(), items.end(), &data), items.end()); if (items.empty()) { mCounter.erase(itr); } } } typedef std::vector<TreeData*> ItemType; ItemType::iterator begin(const TreeData& data) { const CounterType::const_iterator itr = mCounter.find(data.getId()); if (itr != mCounter.end()) { return itr->second.begin(); } // Else condition handling left up to you. } ItemType::iterator end(const TreeData& data) { const CounterType::const_iterator itr = mCounter.find(data.getId()); if (itr != mCounter.end()) { return itr->second.end(); } // Else condition handling left up to you. } private: typedef std::map<int, ItemType> CounterType; CounterType mCounter; }; class TreeData { public: TreeData() { ReferenceCounter::get().add(*this); } ~TreeData() { ReferenceCounter::get().remove(*this); } // Get database rows or whatever your tree is tracking. int getId() const; }; </code></pre> <p>So given any TreeData, you can look up all the other TreeData's with matching ids in the reference counter. This makes it easy and fast keeping names and stuff up to date. Our tree handles over 1,000,000 nodes without a problem. In my implementation, I wrapped the iteration stuff up in a <code>boost::iterator_facade</code> class for easier use.</p>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POHierachical data in TreeViews and TreeView updating technique
  singulars
  PostTypePostTypeId
  PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USFrank Mitchell
UserOwnerUserId
1. USFrank Mitchell
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.