StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
14734409
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2013-02-06T16:49:28.997
FavoriteCount
0
LastActivityDate
2013-02-06T17:06:20.003
LastEditDate
2013-02-06T17:06:20.003
LastEditorUserId
743214
OwnerUserId
743214
ParentId
14732918
PostTypeId
2
Score
1
ViewCount
0
LastEditorDisplayName
text
Body
You are erasing elements in the vector while at the same time iterating over it. So when erasing an element, you always jump over the next element, since you increase <code>i</code> while having just shortened the vector at <code>i</code> (it would be even worse, had you used a proper iterator loop instead of an index loop). The best way to do this would be to seperate both opretions, first "marking" (or rather reordering) the elements for removal and then erasing them from the vector. This is in practice best done using the <a href="http://en.wikipedia.org/wiki/Erase-remove_idiom" rel="nofollow">erase-remove idiom</a> (<code>vector.erarse(std::remove(...), vector.end())</code>), which first uses <a href="http://en.cppreference.com/w/cpp/algorithm/remove" rel="nofollow"><code>std::remove(_if)</code></a> to reorganize the data with the non-removed elements at the beginning and returns the new end of the range, which can then be used to really delete those removed elements from the range (effectively just shortening the whole vector), using <a href="http://en.cppreference.com/w/cpp/container/vector/erase" rel="nofollow"><code>std::vector::erase</code></a>. Using a C++11 lambda, the removal condition can be expressed quite easily: <pre><code>vector1.erase(std::remove_if( //erase range starting here vector1.begin(), vector1.end(), //iterate over whole vector [&vector2](unsigned int i) //call this for each element { return vector2.at(i).var; }), //return true to remove vector1.end()); //erase up to old end </code></pre> EDIT: And by the way, as always be sure if you really need <code>std::vector::at</code> instead of just <code>[]</code> and keep in mind the implications of both (in particular the overhead of the former and "maybe insecurity" of the latter).
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POErasing elements in a vector
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USChristian Rau
UserOwnerUserId
1. USChristian Rau
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.