Iterator模式C++实现

2020-05-05 16:09:14 阅读：331 来源： 互联网

标签：ConcreteIterator Iterator ConcreteAggregate int 模式 C++ Aggregate virtual nIndex

#include <iostream>
using namespace std;
typedef int DATA;
class Iterator;

// 容器的抽象基类
class Aggregate {
public:
    virtual ~Aggregate(){}

    virtual Iterator* CreatIterator(Aggregate *pAggregate)=0;
    virtual int GetSize()=0;
    virtual DATA GetItem(int nIndex)=0;
};

// 迭代器的抽象基类
class Iterator {
public:
    virtual ~Iterator(){}

    virtual void First()=0;
    virtual void Next()=0;
    virtual bool IsDone()=0;
    virtual DATA CurrentItem()=0;
};

// 一个具体的容器类
class ConcreteAggregate : public Aggregate {
public:
    ConcreteAggregate(int nSize);
    virtual ~ConcreteAggregate();

    virtual Iterator* CreatIterator(Aggregate *pAggregate);
    virtual int GetSize();
    virtual DATA GetItem(int nIndex);
private:
    int m_nSize;
    DATA *m_pData;
};

// 访问ConcreteAggregate容器的迭代器类
class ConcreteIterator : public Iterator {
public:
    ConcreteIterator(Aggregate* pAggreagte);
    virtual ~ConcreteIterator(){}

    virtual void First();
    virtual void Next();
    virtual bool IsDone();
    virtual DATA CurrentItem();
private:
    Aggregate *m_pConcreteAggregate;
    int m_nIndex;
};

// ConcreteAggregate
ConcreteAggregate::ConcreteAggregate(int nSize) : m_nSize(nSize), m_pData(NULL) {
    m_pData = new DATA[m_nSize];
    for (int i = 0; i < m_nSize; ++i) {
        m_pData[i] = i;
    }
}
ConcreteAggregate::~ConcreteAggregate() {
    delete [] m_pData;
    m_pData = NULL;
}
Iterator* ConcreteAggregate::CreatIterator(Aggregate *pAggregate) {
    return new ConcreteIterator(this);
}
int ConcreteAggregate::GetSize() {
    return m_nSize;
}
DATA ConcreteAggregate::GetItem(int nIndex) {
    if (nIndex < m_nSize) {
        return m_pData[nIndex];
    }
    else {
        return -1;
    }
}

// ConcreteIterator
ConcreteIterator::ConcreteIterator(Aggregate* pAggreagte) : m_pConcreteAggregate(pAggreagte), m_nIndex(0) {
}
void ConcreteIterator::First() {
    m_nIndex = 0;
}
void ConcreteIterator::Next() {
    if (m_nIndex < m_pConcreteAggregate->GetSize()) {
        ++m_nIndex;
    }
}
bool ConcreteIterator::IsDone() {
    return m_nIndex == m_pConcreteAggregate->GetSize();
}
DATA ConcreteIterator::CurrentItem() {
    return m_pConcreteAggregate->GetItem(m_nIndex);
}

int main() {
    Aggregate * pAggregate = new ConcreteAggregate(10);

    for (Iterator * pIterator = new ConcreteIterator(pAggregate); !pIterator->IsDone(); pIterator->Next()) {
        cout << pIterator->CurrentItem() << endl;
    }
    return 0;
}

标签：ConcreteIterator,Iterator,ConcreteAggregate,int,模式,C++,Aggregate,virtual,nIndex
来源： https://www.cnblogs.com/wstong/p/12831014.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

ICode9

Iterator模式C++实现