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
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
|
/***************************************************************************
TargetList.cpp - description
-------------------
begin : Sun Mar 30 2003
copyright : (C) 2003 by Emmanuel Promayon
email : Emmanuel.Promayon@imag.fr
***************************************************************************/
/***************************************************************************
* *
* 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. *
* *
***************************************************************************/
#include "TargetList.h"
#include <sstream>
// --------------- constructor ---------------
TargetList::TargetList() {}
TargetList::TargetList(const std::string l) {
add(l);
}
TargetList::TargetList(const TargetList & t) {
add(t.toString()); // not very efficient but particularly easy todo!
}
// --------------- add ---------------
void TargetList::add(const unsigned int index) {
indexedTargetList.push_back(index);
}
// --------------- add ---------------
// from a list using the list syntax (eg: 1-4,7,9-11) stored in s
// insert all the corresponding target to currentL target list (above ex insert targets : 1 2 3 4 7 9 10 11)
#define isDigit(c) ((c)>='0' && (c)<='9')
void TargetList::add(const std::string s) {
int begin, end, len, i,j;
// inits
len = s.size();
begin = end = -1;
i = 0;
// examine all the string
while (i<len) {
if (isDigit(s[i])) {
// the current char is a digit
if (begin == -1) {
// begin is to be set now
begin = s[i++] - '0';
// Loop to construct the target nr
while (i<len && isDigit(s[i]))
begin = begin*10 + s[i++] - '0';
// here begin is equal to the target index to begin with
} else {
// it is end's turn (meaning we already get the target index for the beginning)
end = s[i++] - '0';
while (i<len && isDigit(s[i]))
end = end*10 + s[i++] - '0';
// here end is equal to the target index to end with
}
}
// here something (that was not a digit) was encoutered
while (i<len && !isDigit(s[i])) {
if (s[i]==',') {
// if it was a comma, save from begin to end
if (end==-1) // end was not find, only target index 'begin'
add(begin);
else {
// target index from begin..save are to be inserted
for (j=begin;j<=end;j++)
add(j);
}
// init to start again
begin=end=-1;
}
else {
if (s[i]!='-') {
// this is not a comma, read till the end or the next comma
// because this is a new component name
std::string name;
while (i<len) {
name = "";
while (i<len && s[i]!=',') {
name += s[i];
i++;
}
namedTargetList.push_back(name);
i++;
}
}
}
// if it was something else than a ","... well, do nothing
i++;
}
}
// Here the target list ended, see if there was not something in begin and end
if (begin != -1) { // smth to save
if (end==-1) // end was not find
add(begin);
else {
// regions from begin..save are to be saved
for (j=begin;j<=end;j++)
add(j);
}
}
}
// --------------- getNumberOfTargets ---------------
unsigned int TargetList::getNumberOfTargets() const {
if (indexedTargets()) {
return indexedTargetList.size();
} else {
return namedTargetList.size();
}
}
// --------------- getIndexedTarget ---------------
int TargetList::getIndexedTarget(const unsigned int targetIndex) const {
if (targetIndex < indexedTargetList.size())
return indexedTargetList[targetIndex];
else
return -1;
}
// --------------- getNamedTarget ---------------
std::string TargetList::getNamedTarget(const unsigned int targetIndexInList) const {
if (targetIndexInList < namedTargetList.size())
return namedTargetList[targetIndexInList];
else
return "";
}
// --------------- clear ---------------
void TargetList::clear() {
indexedTargetList.clear();
namedTargetList.clear();
}
// --------------- toString ---------------
std::string TargetList::toString() const {
std::stringstream s(std::stringstream::out);
if (indexedTargets()) {
unsigned int i=0;
unsigned int beginId, beginIndex;
unsigned int endId, endIndex;
while (i<indexedTargetList.size()) {
// init begin of the possible interval
beginIndex = i;
beginId = indexedTargetList[beginIndex];
// find an interval
do {
endIndex = i;
endId = indexedTargetList[endIndex];
i++;
} while (i<indexedTargetList.size() && (indexedTargetList[i]==(endId+1)));
// add a comma for separation
if (beginIndex!=0)
s << ",";
// if there is not interval
if (endIndex==beginIndex) {
s << beginId;
} else {
s << beginId << "-" << endId;
}
}
} else {
// targets are named
for (unsigned int i=0;i<namedTargetList.size();i++) {
s << namedTargetList[i];
if (i!=namedTargetList.size()-1)
s << ",";
}
}
return s.str();
}
// --------------- toAnsys ---------------
std::string TargetList::toAnsys() const {
std::stringstream s(std::stringstream::out);
s << "! --- selection of target list: " << toString() << std::endl;
if (indexedTargets()) {
unsigned int i=0;
unsigned int beginId, beginIndex;
unsigned int endId, endIndex;
while (i<indexedTargetList.size()) {
// init begin of the possible interval
beginIndex = i;
beginId = indexedTargetList[beginIndex];
// find an interval
do {
endIndex = i;
endId = indexedTargetList[endIndex];
i++;
} while (i<indexedTargetList.size() && (indexedTargetList[i]==(endId+1)));
// add a comma for separation
if (beginIndex!=0)
// add to the selection
s << "NSEL, A,,, ";
else
// define a new selection
s << "NSEL, S,,, ";
// if there is not interval
if (endIndex==beginIndex) {
s << beginId;
} else {
s << beginId << "," << endId << ",1" << std::endl;
}
}
}
return s.str();
}
// --------------- toAnsys ---------------
bool TargetList::indexedTargets() const {
return (indexedTargetList.size()>0);
}
// --------------- isIn ---------------
bool TargetList::isIn(unsigned int id) const {
if (indexedTargetList.size()==0 && namedTargetList.size()==1 && namedTargetList[0]=="*")
return true;
bool found=false;
unsigned int i=0;
while(i<indexedTargetList.size() && !found) {
found = (indexedTargetList[i]==id);
i++;
}
return found;
}
|
