- 论坛徽章:
- 0
|
有个程序编译不过。。。C++新手,STL新手
- #include <list>
- #include <set>
- #include <algorithm>
- using std::list;
- using std::set;
- typedef struct
- {
- int id;
- list<int> l;
- }mc;
- bool operator == (const mc&o, int id )
- {
- return o.id == id;
- }
- bool operator < (const mc& o, const mc& n)
- {
- return o.id < n.id;
- }
- int main()
- {
- mc s;
- set<mc> mcset;
- //init
- for(int i=0;i<5;i++)
- {
- s.id = i;
- mcset.insert( s );
- }
- //想在set中查找符合的,在修改它的list
- //search
- set<mc>::iterator it = find( mcset.begin(), mcset.end(), 3);
- if( mcset.end() == it )
- return -1;
- //
- it->l.push_back(100);
- }
复制代码
刚学习,猜是iterator用错了
[ 本帖最后由 andyY 于 2006-5-26 17:00 编辑 ] |
|