64,646
社区成员
发帖
与我相关
我的任务
分享
template <class T> class dNode;
template <class T>
class dlist{
private:
int size;
//other things
public:
class iterator;//nested class
//other things
};
template <class T>
class dlist<T>::iterator{
public:
iterator();
dlist<T>::iterator &operator++() {
//检查正确性
pn=pn->next;
return *this;//这里有问题~
}
private:
dNode<T> *pn; //指向当前节点的指针
};
for(iter=mylist.begin(); iter!=mylist.end(); iter++){
cout<<*iter<<endl;
cout<<*this<<endl;
}
dlist<T>::iterator operator++(int)
{
dlist<T>::iterator ret=*this;
pn=pn->next;
return ret;
}
后缀,retIter=iter++.
template <class T> class dNode;
template <class T>
class dlist{
private:
int size;
//other things
public:
class iterator;//nested class
//other things
};
template <class T>
class dlist<T>::iterator{
public:
iterator();
dlist<T>::iterator &operator++() {
//检查正确性
pn=pn->next;
return *this;//这里有问题~
}
private:
dNode<T> *pn; //指向当前节点的指针
};
for(iter=mylist.begin(); iter!=mylist.end(); iter++){
cout<<*iter<<endl;
}
int a[6]={1, 1, 1, 2, 2};
find(a, &a[5], 2);
#include <iostream>
using namespace std;
int main()
{
char str[] = "hello world!";
char *end = str+sizeof(str);
char *iterator = str;
while(*iterator != *end )
{
cout<<*iterator;
++iterator;
}
return 0;
}
list nlist;//假设已经初始化
list<int>::iterator iter;
iter=nlist.begin();
while(iter != nlist.end();) {
cout<<*iter<<endl;
iter++;
}