1 |
/* |
2 |
* Copyright (C) 2000-2004 Object Oriented Parallel Simulation Engine (OOPSE) project |
3 |
* |
4 |
* Contact: oopse@oopse.org |
5 |
* |
6 |
* This program is free software; you can redistribute it and/or |
7 |
* modify it under the terms of the GNU Lesser General Public License |
8 |
* as published by the Free Software Foundation; either version 2.1 |
9 |
* of the License, or (at your option) any later version. |
10 |
* All we ask is that proper credit is given for our work, which includes |
11 |
* - but is not limited to - adding the above copyright notice to the beginning |
12 |
* of your source code files, and to any copyright notice that you may distribute |
13 |
* with programs based on this work. |
14 |
* |
15 |
* This program is distributed in the hope that it will be useful, |
16 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
17 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
18 |
* GNU Lesser General Public License for more details. |
19 |
* |
20 |
* You should have received a copy of the GNU Lesser General Public License |
21 |
* along with this program; if not, write to the Free Software |
22 |
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
23 |
* |
24 |
*/ |
25 |
|
26 |
/** |
27 |
* @file LocalIndexManager.hpp |
28 |
* @author tlin |
29 |
* @date 11/02/2004 |
30 |
* @version 1.0 |
31 |
*/ |
32 |
|
33 |
#ifndef UTILS_LOCALINDEXMANAGER_HPP |
34 |
#define UTILS_LOCALINDEXMANAGER_HPP |
35 |
#include <algorithm> |
36 |
#include <iostream> |
37 |
#include <cassert> |
38 |
#include <list> |
39 |
#include <utility> |
40 |
|
41 |
namespace oopse { |
42 |
|
43 |
/** |
44 |
* @class IndexListContainer |
45 |
* @brief |
46 |
* @todo documentation |
47 |
*/ |
48 |
class IndexListContainer{ |
49 |
public: |
50 |
static const int MAX_INTEGER = 2147483647; |
51 |
typedef std::list<std::pair<int, int> >::iterator IndexListContainerIterator; |
52 |
|
53 |
|
54 |
IndexListContainer(int minIndex = 0, int maxIndex = MAX_INTEGER) |
55 |
:minIndex_(minIndex), maxIndex_(maxIndex) { |
56 |
|
57 |
indexContainer_.push_back(std::make_pair(minIndex, maxIndex)); |
58 |
} |
59 |
|
60 |
int pop() { |
61 |
|
62 |
if (indexContainer_.empty()) { |
63 |
std::cerr << "" << std::endl; |
64 |
} |
65 |
|
66 |
IndexListContainerIterator i = indexContainer_.begin(); |
67 |
int result; |
68 |
|
69 |
result = indexContainer_.front().first; |
70 |
|
71 |
if (indexContainer_.front().first == indexContainer_.front().second) { |
72 |
indexContainer_.pop_front(); |
73 |
} else if (indexContainer_.front().first < indexContainer_.front().second) { |
74 |
--indexContainer_.front().first; |
75 |
} else { |
76 |
std::cerr << "" << std::endl; |
77 |
} |
78 |
|
79 |
return result; |
80 |
} |
81 |
|
82 |
|
83 |
/** |
84 |
* |
85 |
*/ |
86 |
void insert(int index) { |
87 |
IndexListContainerIterator insertPos = internalInsert(index, index); |
88 |
merge(insertPos); |
89 |
} |
90 |
|
91 |
/** |
92 |
* Reclaims an index range |
93 |
* @param beginIndex |
94 |
* @param endIndex |
95 |
*/ |
96 |
void insert(int beginIndex, int endIndex) { |
97 |
IndexListContainerIterator insertPos = internalInsert(beginIndex, endIndex); |
98 |
merge(insertPos); |
99 |
} |
100 |
|
101 |
/** |
102 |
* Reclaims an index array. |
103 |
* @param indices |
104 |
*/ |
105 |
void insert(std::vector<int>& indices){ |
106 |
|
107 |
if (indices.empty()) { |
108 |
return; |
109 |
} |
110 |
|
111 |
std::sort(indices.begin(), indices.end()); |
112 |
std::unique(indices.begin(), indices.end()); |
113 |
|
114 |
std::vector<int>::iterator i; |
115 |
IndexListContainerIterator insertPos; |
116 |
int beginIndex; |
117 |
int endIndex; |
118 |
|
119 |
beginIndex = indices[0]; |
120 |
|
121 |
for ( i = indices.begin() + 1 ; i != indices.end(); ++i) { |
122 |
if (*i != *(i -1) + 1) { |
123 |
insert(beginIndex, *(i-1)); |
124 |
beginIndex = *i; |
125 |
} |
126 |
} |
127 |
|
128 |
|
129 |
} |
130 |
|
131 |
std::vector<int> getIndicesBefore(int index) { |
132 |
std::vector<int> result; |
133 |
IndexListContainerIterator i; |
134 |
|
135 |
for(i = indexContainer_.begin(); i != indexContainer_.end(); ++i) { |
136 |
if ((*i).first > index) { |
137 |
//we locate the node whose minimum index is greater that index |
138 |
indexContainer_.erase(indexContainer_.begin(), i); |
139 |
break; |
140 |
} else if ((*i).second < index) { |
141 |
//The biggest index current node hold is less than the index we want |
142 |
for (int j = (*i).first; j <= (*i).second; ++j) { |
143 |
result.push_back(j); |
144 |
} |
145 |
continue; |
146 |
} else if ((*i).first == (*i).second) { |
147 |
//the index happen to equal to a node which only contains one index |
148 |
result.push_back((*i).first); |
149 |
indexContainer_.erase(indexContainer_.begin(), i); |
150 |
break; |
151 |
} else { |
152 |
|
153 |
for (int j = (*i).first; j < index; ++j) { |
154 |
result.push_back(j); |
155 |
} |
156 |
|
157 |
(*i).first = index; |
158 |
indexContainer_.erase(indexContainer_.begin(), i); |
159 |
break; |
160 |
} |
161 |
|
162 |
} |
163 |
|
164 |
return result; |
165 |
|
166 |
} |
167 |
|
168 |
int getMaxIndex() { |
169 |
return maxIndex_; |
170 |
} |
171 |
|
172 |
private: |
173 |
|
174 |
IndexListContainerIterator internalInsert(int beginIndex, int endIndex) { |
175 |
|
176 |
if (beginIndex > endIndex) { |
177 |
std::swap(beginIndex, endIndex); |
178 |
std::cerr << "" << std::endl; |
179 |
} |
180 |
|
181 |
if (endIndex > maxIndex_) { |
182 |
std::cerr << "" << std::endl; |
183 |
} |
184 |
|
185 |
|
186 |
IndexListContainerIterator j; |
187 |
|
188 |
IndexListContainerIterator i = indexContainer_.begin(); |
189 |
for (; i != indexContainer_.end(); ++i) { |
190 |
if ((*i).first > endIndex) { |
191 |
indexContainer_.insert(i, std::make_pair(beginIndex, endIndex)); |
192 |
return --i; |
193 |
} else if ((*i).second < beginIndex) { |
194 |
continue; |
195 |
} else { |
196 |
std::cerr << "" << std::endl; |
197 |
} |
198 |
} |
199 |
|
200 |
indexContainer_.push_back(std::make_pair(beginIndex, endIndex)); |
201 |
return --indexContainer_.end(); |
202 |
|
203 |
} |
204 |
|
205 |
void merge(IndexListContainerIterator i) { |
206 |
IndexListContainerIterator j; |
207 |
|
208 |
//check whether current node can be merged with its previous node |
209 |
if ( i != indexContainer_.begin()) { |
210 |
j = i; |
211 |
--j; |
212 |
if (j != indexContainer_.begin() && (*j).second + 1 == (*i).first) { |
213 |
(*i).first = (*j).first; |
214 |
indexContainer_.erase(j); |
215 |
} |
216 |
} |
217 |
|
218 |
//check whether current node can be merged with its next node |
219 |
if ( i != indexContainer_.end()) { |
220 |
j = i; |
221 |
++j; |
222 |
|
223 |
if (j != indexContainer_.end() && (*i).second + 1 == (*j).first) { |
224 |
(*i).second = (*j).second; |
225 |
indexContainer_.erase(j); |
226 |
} |
227 |
} |
228 |
|
229 |
} |
230 |
int minIndex_; |
231 |
int maxIndex_; |
232 |
std::list<std::pair<int, int> > indexContainer_; |
233 |
}; |
234 |
|
235 |
|
236 |
/** |
237 |
* @class LocalIndexManager LocalIndexManager.hpp "utils/LocalIndexManager.hpp" |
238 |
* @brief |
239 |
*/ |
240 |
class LocalIndexManager { |
241 |
public: |
242 |
|
243 |
int getNextAtomIndex() { |
244 |
return atomIndexContainer_.pop(); |
245 |
} |
246 |
|
247 |
std::vector<int> getAtomIndicesBefore(int index) { |
248 |
return atomIndexContainer_.getIndicesBefore(index); |
249 |
} |
250 |
|
251 |
void releaseAtomIndex(int index) { |
252 |
atomIndexContainer_.insert(index); |
253 |
} |
254 |
|
255 |
void releaseAtomIndex(int beginIndex, int endIndex) { |
256 |
atomIndexContainer_.insert(beginIndex, endIndex); |
257 |
} |
258 |
|
259 |
void releaseAtomIndex(std::vector<int> indices) { |
260 |
atomIndexContainer_.insert(indices); |
261 |
} |
262 |
|
263 |
int getNextRigidBodyIndex() { |
264 |
return rigidBodyIndexContainer_.pop(); |
265 |
} |
266 |
|
267 |
std::vector<int> getRigidBodyIndicesBefore(int index) { |
268 |
return rigidBodyIndexContainer_.getIndicesBefore(index); |
269 |
} |
270 |
|
271 |
void releaseRigidBodyIndex(int index) { |
272 |
rigidBodyIndexContainer_.insert(index); |
273 |
} |
274 |
|
275 |
void releaseRigidBodyIndex(int beginIndex, int endIndex) { |
276 |
rigidBodyIndexContainer_.insert(beginIndex, endIndex); |
277 |
} |
278 |
|
279 |
void releaseRigidBodyIndex(std::vector<int> indices) { |
280 |
rigidBodyIndexContainer_.insert(indices); |
281 |
} |
282 |
|
283 |
private: |
284 |
|
285 |
IndexListContainer atomIndexContainer_; |
286 |
IndexListContainer rigidBodyIndexContainer_; |
287 |
}; |
288 |
|
289 |
} //end namespace oopse |
290 |
#endif //UTILS_LOCALINDEXMANAGER_HPP |