StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
3113369
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
1
CommunityOwnedDate
CreationDate
2010-06-24T19:46:48.870
FavoriteCount
0
LastActivityDate
2010-06-25T10:03:37.753
LastEditDate
2010-06-25T10:03:37.753
LastEditorUserId
123111
OwnerUserId
123111
ParentId
3113018
PostTypeId
2
Score
5
ViewCount
0
LastEditorDisplayName
text
Body
The following line of code returns <code>true</code> only if all elements from <code>v</code> are not present in <code>m</code>: <pre><code>bool a = v.end() == std::find_if( v.begin(), v.end(), boost::bind( &str_map_t::const_iterator::operator!=, boost::bind<str_map_t::const_iterator>( &str_map_t::find, &m, _1 ), m.end() ) ); </code></pre> <hr> Explanation: Here we have two functors: <ol> <li><code>boost::bind<str_map_t::const_iterator>( &str_map_t::find, &m, _1 )</code> This functor will return <code>const_iterator</code> which points to the element from <code>m</code> or to <code>m.end()</code> if not found. Here you should explicitly point return type <code>str_map_t::const_iterator</code> for <code>boost::bind</code> to get rid of ambiguity. </li> <li><code>boost::bind( &str_map_t::const_iterator::operator!=, _1, _2 )</code> This one will return <code>true</code> if <code>_1!=_2</code> and <code>false</code> otherwise.</li> </ol> Combine 1 and 2 and we'll get the full code: <pre><code>#include <iostream> #include <vector> #include <algorithm> #include <iterator> #include <string> #include <map> #include <boost/bind.hpp> using namespace std; int main(int argc, char *argv[]) { vector<string> v; v.push_back("x"); v.push_back("a"); v.push_back("6"); typedef map<string, string> str_map_t; str_map_t m; m.insert( str_map_t::value_type( "b", "f" ) ); bool a = v.end() == std::find_if( v.begin(), v.end(), boost::bind( &str_map_t::const_iterator::operator!=, boost::bind<str_map_t::const_iterator>( &str_map_t::find, &m, _1 ), m.end() ) ); std::cout << a << endl; return 0; } </code></pre> I wouldn't say it is readable code and I'd recommend to write a custom functor to get it more readable. A more readable version could look like the following (without <code>bind</code>): <pre><code>struct not_in_map { not_in_map( const str_map_t& map ) : map_(map) {} bool operator()( const string& val ) { return map_.end() != map_.find( val ); } private: const str_map_t& map_; }; bool a = v.end() == std::find_if( v.begin(), v.end(), not_in_map(m) ); </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POtrying to see if vector<string> has no values in map<string, string>
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USKirill V. Lyadvinsky
UserOwnerUserId
1. USKirill V. Lyadvinsky
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. POtrying to see if vector<string> has no values in map<string, string>
 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
 VTUpMod
3. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId
1. COYes, I wont let such code get to see the daylight but still want to learn these nifty features. Thanks for a great answer.
 singulars
 PostPostId
 PO
 UserUserId
 USSWKK

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.