StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
10207100
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2012-04-18T10:01:04.487
FavoriteCount
0
LastActivityDate
2012-04-18T10:01:04.487
LastEditDate
LastEditorUserId
0
OwnerUserId
80003
ParentId
9985693
PostTypeId
2
Score
0
ViewCount
0
LastEditorDisplayName
text
Body
You are using the <code>lower_bound</code> function for searching. Its purpose is a little different than that. <a href="http://www.cplusplus.com/reference/algorithm/lower_bound/" rel="nofollow">This</a> is what lower_bound does: <blockquote> Returns an iterator pointing to the first element in the sorted range [first,last) which does not compare less than value. </blockquote> And another definition from <a href="http://www.sgi.com/tech/stl/lower_bound.html" rel="nofollow">here</a>: <blockquote> Specifically, it returns the first position where value could be inserted without violating the ordering. </blockquote> So for example, if the thing you are looking for is not in the vector, it will return an iterator that points after the last item in the vector, and that iterator can't be dereferenced because it does not exist. Take a look at this example: <pre><code>int myints[] = {10,20,30,30,20,10,10,20}; vector<int> v(myints,myints+8); // 10 20 30 30 20 10 10 20 vector<int>::iterator low; sort (v.begin(), v.end()); // 10 10 10 20 20 20 30 30 low=lower_bound (v.begin(), v.end(), 60); // ^it will point here cout << "lower_bound at position " << int(low- v.begin()) << endl; </code></pre> As you can see from the output, the iterator will point to the 9th element in the vector (index 8). But the vector only has 8 elements (indexed 0-7). The explanation for this is that you can insert the new item in the vector at index 8 without violating the ordering. I think that what you really want is the <a href="http://www.cplusplus.com/reference/algorithm/find/" rel="nofollow"><code>find</code></a> function. Here is an example: <pre><code>int myints[] = {10,20,30,30,20,10,10,20}; vector<int> v(myints,myints+8); // 10 20 30 30 20 10 10 20 vector<int>::iterator find_it1 = find(v.begin(), v.end(), 30); vector<int>::iterator find_it2 = find(v.begin(), v.end(), 80); if(find_it1 == v.end()) cout << "30 not found" << endl; else cout << "30 found at position " << int(find_it1 - v.begin()) << endl; if(find_it2 == v.end()) cout << "80 not found" << endl; else cout << "80 found at position " << int(find_it2 - v.begin()) << endl; </code></pre> Here is the output: <pre><code>30 found at position 2 80 not found </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. PORun-time error - Vector iterator not dereferencable?
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USOve
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. This table or related slice is empty.
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.