Qt C++ Iterator模式

我们常说的迭代器

iterator.h

#pragma once


#include <QDebug>
template<class T>
class CAggregate
{
public:
CAggregate(){}
virtual ~CAggregate(){}
virtual int getSize() = 0;
virtual T getData(int index) const = 0;
virtual void setData(int index,T value) = 0;
protected:
T *m_pData;
};


template<class T>
class CConcreateAggregate : public CAggregate<T>
{
public:
CConcreateAggregate(int size):m_size(size)
{
m_pData = new T[m_size];
}
virtual ~CConcreateAggregate(){delete []m_pData;}


int getSize(){return m_size;};


void setData(int index,T value)
{
if (index < m_size)
{
m_pData[index] = value;
}
}


T getData(int index) const
{
if (index<m_size)
{
return m_pData[index];
}
return 0;
}
private:
int m_size;
};


template<class T>
class CIterator
{
public:
CIterator(){}
virtual ~CIterator(){}
virtual void first() = 0;
virtual void next() = 0;
virtual bool end() = 0;
virtual T currentItr() = 0;
protected:
int m_index;
};


template<class T>
class CConcreateIterator : public CIterator<T>
{
public:
CConcreateIterator(CAggregate<T> *pData):m_aggregate(pData){m_index = 0;}
virtual ~CConcreateIterator(){}


void first()
{
m_index = 0;
}
void next()
{
if (m_index < m_aggregate->getSize())
{
m_index++;
}
}
bool end()
{
if (m_index == m_aggregate->getSize())
{
return true;
}
return false;
}
T currentItr()
{
return m_aggregate->getData(m_index);
}


private:
CAggregate<T> *m_aggregate;
};

iterator.cpp

#include "iterator.h"

main.cpp

#include <QApplication>
#include "iterator.h"


int main(int argc,char **argv)
{
QApplication app(argc,argv);

CAggregate<int>* aggregate = new CConcreateAggregate<int>(4);

aggregate->setData(0,1);
aggregate->setData(1,2);
aggregate->setData(2,3);
aggregate->setData(3,4);


CIterator<int> *iter = new CConcreateIterator<int>(aggregate);
while(!iter->end())
{
qDebug() << QString::number(iter->currentItr());
iter->next();
}

return app.exec();
}