mirror of
https://github.com/JakubVojvoda/design-patterns-cpp.git
synced 2025-12-17 04:44:36 +03:00
151 lines
2.4 KiB
C++
151 lines
2.4 KiB
C++
/*
|
|
* C++ Design Patterns: Iterator
|
|
* Author: Jakub Vojvoda [github.com/JakubVojvoda]
|
|
* 2016
|
|
*
|
|
* Source code is licensed under MIT License
|
|
* (for more details see LICENSE)
|
|
*
|
|
*/
|
|
|
|
#include <iostream>
|
|
#include <stdexcept>
|
|
#include <vector>
|
|
|
|
class Iterator;
|
|
class ConcreteAggregate;
|
|
|
|
/*
|
|
* Aggregate
|
|
* defines an interface for aggregates and it decouples your
|
|
* client from the implementation of your collection of objects
|
|
*/
|
|
class Aggregate
|
|
{
|
|
public:
|
|
virtual ~Aggregate() {}
|
|
|
|
virtual Iterator *createIterator() = 0;
|
|
// ...
|
|
};
|
|
|
|
/*
|
|
* Concrete Aggregate
|
|
* has a collection of objects and implements the method
|
|
* that returns an Iterator for its collection
|
|
*
|
|
*/
|
|
class ConcreteAggregate : public Aggregate
|
|
{
|
|
public:
|
|
ConcreteAggregate( const unsigned int size )
|
|
{
|
|
list = new int[size]();
|
|
count = size;
|
|
}
|
|
|
|
~ConcreteAggregate()
|
|
{
|
|
delete[] list;
|
|
}
|
|
|
|
Iterator *createIterator();
|
|
|
|
unsigned int size() const
|
|
{
|
|
return count;
|
|
}
|
|
|
|
int at( unsigned int index )
|
|
{
|
|
return list[ index ];
|
|
}
|
|
// ...
|
|
|
|
private:
|
|
int *list;
|
|
unsigned int count;
|
|
// ...
|
|
};
|
|
|
|
/*
|
|
* Iterator
|
|
* provides the interface that all iterators must implement and
|
|
* a set of methods for traversing over elements
|
|
*/
|
|
class Iterator
|
|
{
|
|
public:
|
|
virtual ~Iterator() { /* ... */ }
|
|
|
|
virtual void first() = 0;
|
|
virtual void next() = 0;
|
|
virtual bool isDone() const = 0;
|
|
virtual int currentItem() const = 0;
|
|
// ...
|
|
};
|
|
|
|
/*
|
|
* Concrete Iterator
|
|
* implements the interface and is responsible for managing
|
|
* the current position of the iterator
|
|
*/
|
|
class ConcreteIterator : public Iterator
|
|
{
|
|
public:
|
|
ConcreteIterator( ConcreteAggregate *l ) :
|
|
list( l ), index( 0 ) {}
|
|
|
|
~ConcreteIterator() {}
|
|
|
|
void first()
|
|
{
|
|
index = 0;
|
|
}
|
|
|
|
void next()
|
|
{
|
|
index++;
|
|
}
|
|
|
|
bool isDone() const
|
|
{
|
|
return ( index >= list->size() );
|
|
}
|
|
|
|
int currentItem() const
|
|
{
|
|
if ( isDone() )
|
|
{
|
|
return -1;
|
|
}
|
|
return list->at(index);
|
|
}
|
|
// ...
|
|
|
|
private:
|
|
ConcreteAggregate *list;
|
|
unsigned int index;
|
|
// ...
|
|
};
|
|
|
|
Iterator *ConcreteAggregate::createIterator()
|
|
{
|
|
return new ConcreteIterator( this );
|
|
}
|
|
|
|
|
|
int main()
|
|
{
|
|
unsigned int size = 5;
|
|
ConcreteAggregate list = ConcreteAggregate( size );
|
|
|
|
Iterator *it = list.createIterator();
|
|
for ( ; !it->isDone(); it->next())
|
|
{
|
|
std::cout << "Item value: " << it->currentItem() << std::endl;
|
|
}
|
|
|
|
delete it;
|
|
return 0;
|
|
} |