20 #ifndef _TLPMUTABLECONTAINER_ 21 #define _TLPMUTABLECONTAINER_ 29 #include <tulip/tulipconf.h> 30 #include <tulip/tuliphash.h> 31 #include <tulip/StoredType.h> 32 #include <tulip/DataSet.h> 33 #include <tulip/Iterator.h> 42 class IteratorValue:
public Iterator<unsigned int> {
45 virtual ~IteratorValue() {}
46 virtual unsigned int nextValue(DataMem&) = 0;
50 template <
typename TYPE>
51 class MutableContainer {
52 friend class MutableContainerTest;
53 friend class GraphUpdatesRecorder;
60 void setAll(
const TYPE &value);
64 void set(
const unsigned int i,
const TYPE &value);
68 void add(
const unsigned int i, TYPE val);
72 typename StoredType<TYPE>::ReturnedConstValue
get(
const unsigned int i)
const;
76 typename StoredType<TYPE>::ReturnedValue
get(
const unsigned int i,
bool& isNotDefault)
const;
80 typename StoredType<TYPE>::ReturnedValue getDefault()
const;
84 bool hasNonDefaultValue(
const unsigned int i)
const;
95 unsigned int numberOfNonDefaultValues()
const;
97 MutableContainer(
const MutableContainer<TYPE> &) {}
98 void operator=(
const MutableContainer<TYPE> &) {}
99 typename StoredType<TYPE>::ReturnedConstValue operator[](
const unsigned int i)
const;
102 void compress(
unsigned int min,
unsigned int max,
unsigned int nbElements);
103 inline void vectset(
const unsigned int i,
typename StoredType<TYPE>::Value value);
104 IteratorValue* findAllValues(
const TYPE &value,
bool equal =
true)
const;
106 std::deque<typename StoredType<TYPE>::Value> *vData;
107 TLP_HASH_MAP<unsigned int, typename StoredType<TYPE>::Value> *hData;
108 unsigned int minIndex,maxIndex;
109 typename StoredType<TYPE>::Value defaultValue;
110 enum State { VECT=0, HASH=1 };
112 unsigned int elementInserted;
121 template <
typename TYPE>
122 class IteratorVect :
public tlp::IteratorValue {
124 IteratorVect(
const TYPE &value,
bool equal, std::deque<
typename StoredType<TYPE>::Value> *vData,
unsigned int minIndex):
130 while (it!=(*vData).end() &&
131 StoredType<TYPE>::equal((*it), _value) != _equal) {
137 return (_pos<UINT_MAX && it!=(*vData).end());
139 unsigned int next() {
140 unsigned int tmp = _pos;
146 while (it!=(*vData).end() &&
147 StoredType<TYPE>::equal((*it), _value) != _equal);
151 unsigned int nextValue(DataMem& val) {
152 ((TypedValueContainer<TYPE>&) val).value = StoredType<TYPE>::get(*it);
153 unsigned int pos = _pos;
159 while (it!=(*vData).end() &&
160 StoredType<TYPE>::equal((*it), _value) != _equal);
168 std::deque<typename StoredType<TYPE>::Value> *vData;
169 typename std::deque<typename StoredType<TYPE>::Value>::const_iterator it;
174 template <
typename TYPE>
175 class IteratorHash :
public IteratorValue {
177 IteratorHash(
const TYPE &value,
bool equal, TLP_HASH_MAP<
unsigned int,
typename StoredType<TYPE>::Value> *hData):
183 while (it!=(*hData).end() &&
184 StoredType<TYPE>::equal((*it).second,_value) != _equal)
188 return (it!=(*hData).end());
190 unsigned int next() {
191 unsigned int tmp = (*it).first;
196 while (it!=(*hData).end() &&
197 StoredType<TYPE>::equal((*it).second,_value) != _equal);
201 unsigned int nextValue(DataMem& val) {
202 ((TypedValueContainer<TYPE>&) val).value =
203 StoredType<TYPE>::get((*it).second);
204 unsigned int pos = (*it).first;
209 while (it!=(*hData).end() &&
210 StoredType<TYPE>::equal((*it).second,_value) != _equal);
217 TLP_HASH_MAP<unsigned int, typename StoredType<TYPE>::Value> *hData;
218 typename TLP_HASH_MAP<unsigned int, typename StoredType<TYPE>::Value>::const_iterator it;
225 #include "cxx/MutableContainer.cxx"
Interface for Tulip iterators. Allows basic iteration operations only.