1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
#ifndef COMMON_LIST_INTERN_H
#define COMMON_LIST_INTERN_H
#include "common/scummsys.h"
namespace Common {
template<typename T> class List;
namespace ListInternal {
struct NodeBase {
NodeBase *_prev;
NodeBase *_next;
};
template<typename T>
struct Node : public NodeBase {
T _data;
Node(const T &x) : _data(x) {}
};
template<typename T> struct ConstIterator;
template<typename T>
struct Iterator {
typedef Iterator<T> Self;
typedef Node<T> * NodePtr;
typedef T & ValueRef;
typedef T * ValuePtr;
typedef T ValueType;
NodeBase *_node;
Iterator() : _node(0) {}
explicit Iterator(NodeBase *node) : _node(node) {}
// Prefix inc
Self &operator++() {
if (_node)
_node = _node->_next;
return *this;
}
// Postfix inc
Self operator++(int) {
Self tmp(_node);
++(*this);
return tmp;
}
// Prefix dec
Self &operator--() {
if (_node)
_node = _node->_prev;
return *this;
}
// Postfix dec
Self operator--(int) {
Self tmp(_node);
--(*this);
return tmp;
}
ValueRef operator*() const {
assert(_node);
return static_cast<NodePtr>(_node)->_data;
}
ValuePtr operator->() const {
return &(operator*());
}
bool operator==(const Self &x) const {
return _node == x._node;
}
bool operator!=(const Self &x) const {
return _node != x._node;
}
};
template<typename T>
struct ConstIterator {
typedef ConstIterator<T> Self;
typedef const Node<T> * NodePtr;
typedef const T & ValueRef;
typedef const T * ValuePtr;
const NodeBase *_node;
ConstIterator() : _node(0) {}
explicit ConstIterator(const NodeBase *node) : _node(node) {}
ConstIterator(const Iterator<T> &x) : _node(x._node) {}
// Prefix inc
Self &operator++() {
if (_node)
_node = _node->_next;
return *this;
}
// Postfix inc
Self operator++(int) {
Self tmp(_node);
++(*this);
return tmp;
}
// Prefix dec
Self &operator--() {
if (_node)
_node = _node->_prev;
return *this;
}
// Postfix dec
Self operator--(int) {
Self tmp(_node);
--(*this);
return tmp;
}
ValueRef operator*() const {
assert(_node);
return static_cast<NodePtr>(_node)->_data;
}
ValuePtr operator->() const {
return &(operator*());
}
bool operator==(const Self &x) const {
return _node == x._node;
}
bool operator!=(const Self &x) const {
return _node != x._node;
}
};
template<typename T>
bool operator==(const Iterator<T>& a, const ConstIterator<T>& b) {
return a._node == b._node;
}
template<typename T>
bool operator!=(const Iterator<T>& a, const ConstIterator<T>& b) {
return a._node != b._node;
}
}
} // End of namespace Common
#endif
|