27 hide(); |
27 hide(); |
28 } |
28 } |
29 return true; |
29 return true; |
30 } |
30 } |
31 |
31 |
32 NewMapWin::NewMapWin(const std::string& title, NoteBookTab & mw, bool itisedge, bool edgenode):Gtk::Dialog(title, true, true),mytab(mw),node("Create NodeMap"),edge("Create EdgeMap") |
32 NewMapWin::NewMapWin(const std::string& title, NoteBookTab & mw, bool itisedge, bool edgenode, MapType type):Gtk::Dialog(title, true, true),mytab(mw),node("Create NodeMap"),edge("Create EdgeMap"),map_type(type) |
33 { |
33 { |
34 set_default_size(200, 50); |
34 set_default_size(200, 50); |
35 |
35 |
36 signal_key_press_event().connect(sigc::mem_fun(*this, &NewMapWin::closeIfEscapeIsPressed)); |
36 signal_key_press_event().connect(sigc::mem_fun(*this, &NewMapWin::closeIfEscapeIsPressed)); |
37 |
37 |
38 Gtk::VBox * vbox=get_vbox(); |
38 Gtk::VBox * vbox=get_vbox(); |
39 |
39 |
40 //entries |
40 //entries |
41 table=new Gtk::Table(3, 2, false); |
41 table=new Gtk::Table(5, 2, false); |
42 |
42 |
43 label=new Gtk::Label; |
43 label=new Gtk::Label; |
44 label->set_text("Name of new map:"); |
44 label->set_text("Name of new map:"); |
45 name.set_text(""); |
45 name.set_text(""); |
46 |
46 |
47 (*table).attach(*label,0,1,0,1,Gtk::SHRINK,Gtk::SHRINK,10,3); |
47 (*table).attach(*label,0,1,0,1,Gtk::SHRINK,Gtk::SHRINK,10,3); |
48 (*table).attach(name,1,2,0,1,Gtk::SHRINK,Gtk::SHRINK,10,3); |
48 (*table).attach(name,1,2,0,1,Gtk::SHRINK,Gtk::SHRINK,10,3); |
49 |
49 |
|
50 lblType.set_label("Element type:"); |
|
51 if (map_type & NUM) |
|
52 cbType.append_text("Numeric"); |
|
53 if (map_type & STR) |
|
54 cbType.append_text("String"); |
|
55 cbType.set_active(0); |
|
56 |
|
57 (*table).attach(lblType,0,1,1,2,Gtk::SHRINK,Gtk::SHRINK,10,3); |
|
58 (*table).attach(cbType, 1,2,1,2,Gtk::SHRINK,Gtk::SHRINK,10,3); |
|
59 |
50 label=new Gtk::Label; |
60 label=new Gtk::Label; |
51 label->set_text("Default value in the map:"); |
61 label->set_text("Default value in the map:"); |
52 default_value.set_text("0"); |
62 default_value.set_text("0"); |
53 |
63 |
54 (*table).attach(*label,0,1,1,2,Gtk::SHRINK,Gtk::SHRINK,10,3); |
64 (*table).attach(*label,0,1,2,3,Gtk::SHRINK,Gtk::SHRINK,10,3); |
55 (*table).attach(default_value,1,2,1,2,Gtk::SHRINK,Gtk::SHRINK,10,3); |
65 (*table).attach(default_value,1,2,2,3,Gtk::SHRINK,Gtk::SHRINK,10,3); |
56 |
66 |
57 //node vs. edge map selector |
67 //node vs. edge map selector |
58 Gtk::RadioButton::Group group = node.get_group(); |
68 Gtk::RadioButton::Group group = node.get_group(); |
59 edge.set_group(group); |
69 edge.set_group(group); |
60 |
70 |
61 if(edgenode) |
71 if(edgenode) |
62 { |
72 { |
63 (*table).attach(node,0,1,2,3,Gtk::SHRINK,Gtk::SHRINK,10,3); |
73 (*table).attach(node,0,1,3,4,Gtk::SHRINK,Gtk::SHRINK,10,3); |
64 (*table).attach(edge,1,2,2,3,Gtk::SHRINK,Gtk::SHRINK,10,3); |
74 (*table).attach(edge,1,2,3,4,Gtk::SHRINK,Gtk::SHRINK,10,3); |
65 } |
75 } |
66 else |
76 else |
67 { |
77 { |
68 if(itisedge) |
78 if(itisedge) |
69 { |
79 { |
70 edge.set_active(); |
80 edge.set_active(); |
71 } |
81 } |
72 else |
82 else |
73 { |
83 { |
74 node.set_active(); |
84 node.set_active(); |
75 } |
85 } |
76 } |
86 } |
|
87 |
|
88 (*table).attach(lblErrorMsg,0,2,4,5,Gtk::SHRINK,Gtk::SHRINK,10,3); |
77 |
89 |
78 vbox->pack_start(*table); |
90 vbox->pack_start(*table); |
79 |
91 |
80 //OK button |
92 //OK button |
81 add_button(Gtk::Stock::OK, Gtk::RESPONSE_OK); |
93 add_button(Gtk::Stock::OK, Gtk::RESPONSE_OK); |
82 |
94 |
83 show_all_children(); |
95 show_all_children(); |
84 |
96 |
85 } |
97 } |
86 |
98 |
|
99 void NewMapWin::setErrorMsg(const Glib::ustring& msg) |
|
100 { |
|
101 lblErrorMsg.set_markup("<i><small>" + msg + "</small></i>"); |
|
102 } |
|
103 |
|
104 std::vector<double>* NewMapWin::evaluate_expr(const std::string polishform, bool itisedge) |
|
105 { |
|
106 MapStorage& ms = *mytab.mapstorage; |
|
107 |
|
108 std::vector<double>* ret = new std::vector<double>; |
|
109 std::stack<double> polishstack; |
|
110 |
|
111 if (itisedge) |
|
112 { |
|
113 for(EdgeIt k(ms.graph); k!=INVALID; ++k) |
|
114 { |
|
115 for(int i=0;i<(int)polishform.size();i++) |
|
116 { |
|
117 double op1=0, op2=0; |
|
118 bool operation=true; |
|
119 switch(polishform[i]) |
|
120 { |
|
121 case '+': |
|
122 case '-': |
|
123 case '/': |
|
124 case '*': |
|
125 op1=polishstack.top(); |
|
126 polishstack.pop(); |
|
127 op2=polishstack.top(); |
|
128 polishstack.pop(); |
|
129 break; |
|
130 default: |
|
131 //substitute variable |
|
132 std::vector<std::string> maps = ms.getEdgeMapList(NUM); |
|
133 bool itisvar=(std::find(maps.begin(), maps.end(), ch2var[ polishform[i] ]) != maps.end()); |
|
134 if(itisvar) |
|
135 { |
|
136 polishstack.push(ms.get(ch2var[ polishform[i] ], k)); |
|
137 } |
|
138 else |
|
139 { |
|
140 polishstack.push(atof(ch2var[ polishform[i] ].c_str())); |
|
141 } |
|
142 operation=false; |
|
143 break; |
|
144 } |
|
145 if(operation) |
|
146 { |
|
147 double res; |
|
148 switch(polishform[i]) |
|
149 { |
|
150 case '+': |
|
151 res=op1+op2; |
|
152 break; |
|
153 case '-': |
|
154 res=op2-op1; |
|
155 break; |
|
156 case '/': |
|
157 res=op2/op1; |
|
158 break; |
|
159 case '*': |
|
160 res=op1*op2; |
|
161 break; |
|
162 default: |
|
163 std::cout << "How could we get here?" << std::endl; |
|
164 break; |
|
165 } |
|
166 polishstack.push(res); |
|
167 } |
|
168 }//foreach letter in polishform |
|
169 ret->push_back(polishstack.top()); |
|
170 }//foreach edge |
|
171 } |
|
172 else |
|
173 { |
|
174 for(NodeIt k(ms.graph); k!=INVALID; ++k) |
|
175 { |
|
176 for(int i=0;i<(int)polishform.size();i++) |
|
177 { |
|
178 double op1=0, op2=0; |
|
179 bool operation=true; |
|
180 switch(polishform[i]) |
|
181 { |
|
182 case '+': |
|
183 case '-': |
|
184 case '/': |
|
185 case '*': |
|
186 op1=polishstack.top(); |
|
187 polishstack.pop(); |
|
188 op2=polishstack.top(); |
|
189 polishstack.pop(); |
|
190 break; |
|
191 default: |
|
192 //substitute variable |
|
193 std::vector<std::string> maps = ms.getNodeMapList(NUM); |
|
194 bool itisvar=(std::find(maps.begin(), maps.end(), ch2var[ polishform[i] ]) != maps.end()); |
|
195 if(itisvar) |
|
196 { |
|
197 polishstack.push(ms.get(ch2var[ polishform[i] ], k)); |
|
198 } |
|
199 else |
|
200 { |
|
201 polishstack.push(atof(ch2var[ polishform[i] ].c_str())); |
|
202 } |
|
203 operation=false; |
|
204 break; |
|
205 } |
|
206 if(operation) |
|
207 { |
|
208 double res; |
|
209 switch(polishform[i]) |
|
210 { |
|
211 case '+': |
|
212 res=op1+op2; |
|
213 break; |
|
214 case '-': |
|
215 res=op2-op1; |
|
216 break; |
|
217 case '/': |
|
218 res=op2/op1; |
|
219 break; |
|
220 case '*': |
|
221 res=op1*op2; |
|
222 break; |
|
223 default: |
|
224 std::cout << "How could we get here?" << std::endl; |
|
225 break; |
|
226 } |
|
227 polishstack.push(res); |
|
228 } |
|
229 }//foreach letter in polishform |
|
230 ret->push_back(polishstack.top()); |
|
231 }//foreach edge |
|
232 } |
|
233 return ret; |
|
234 } |
|
235 |
87 void NewMapWin::on_response(int response_id) |
236 void NewMapWin::on_response(int response_id) |
88 { |
237 { |
|
238 MapStorage& ms = *mytab.mapstorage; |
|
239 |
89 if(response_id==Gtk::RESPONSE_OK) |
240 if(response_id==Gtk::RESPONSE_OK) |
90 { |
241 { |
91 double def_val=0; |
242 std::string map_name = name.get_text(); |
92 |
243 std::string def_val = default_value.get_text(); |
93 //get and formulate text |
244 |
94 std::string def_val_str=default_value.get_text(); |
245 if (map_name.empty()) |
95 |
246 { |
96 bool only_nums=true; |
247 setErrorMsg("No map name given."); |
97 for(int i=0;i<(int)def_val_str.size() && only_nums;i++) |
248 return; |
98 { |
249 } |
99 if( def_val_str[i]<'0' || def_val_str[i]>'9' ) |
250 |
100 { |
251 // check whether the map already exists |
101 only_nums=false; |
252 if (edge.get_active()) |
102 } |
253 { |
103 } |
254 if (ms.edgeMapExists(map_name)) |
104 std::string polishform; |
255 { |
105 |
256 setErrorMsg("Map '" + map_name + "' already exists."); |
106 if(only_nums) |
257 return; |
107 { |
258 } |
108 def_val=atof(def_val_str.c_str()); |
259 } |
109 } |
260 else |
|
261 { |
|
262 if (ms.nodeMapExists(map_name)) |
|
263 { |
|
264 setErrorMsg("Map '" + map_name + "' already exists."); |
|
265 return; |
|
266 } |
|
267 } |
|
268 |
|
269 Glib::ustring text = cbType.get_active_text(); |
|
270 if (text == "Numeric") |
|
271 { |
|
272 double d; |
|
273 char *endptr; |
|
274 d = strtod(def_val.c_str(), &endptr); |
|
275 if (def_val.c_str() + def_val.length() == endptr) |
|
276 { |
|
277 // the full string was a number |
|
278 if (edge.get_active()) |
|
279 ms.createEdgeMap(map_name, MapValue::NUMERIC, |
|
280 MapValue(d)); |
|
281 else |
|
282 ms.createNodeMap(map_name, MapValue::NUMERIC, |
|
283 MapValue(d)); |
|
284 } |
110 else |
285 else |
111 { |
286 { |
112 polishform=string2Polishform(def_val_str,edge.get_active()); |
287 // let't try to evaluate the string as an arithmetic expression |
113 } |
288 std::string polishform = |
114 |
289 string2Polishform(def_val, edge.get_active()); |
115 //get name of text |
290 if (polishform.empty()) |
116 std::string mapname=name.get_text(); |
291 return; |
117 |
292 std::vector<double>* values = |
118 if(!mapname.empty()&&(!polishform.empty()||only_nums)) |
293 evaluate_expr(polishform, edge.get_active()); |
119 { |
294 if (edge.get_active()) |
120 int abortion=0; |
295 { |
121 if(edge.get_active()) |
296 ms.createEdgeMap(map_name, MapValue::NUMERIC, |
122 { |
297 MapValue(0.0)); |
123 //create the new map |
298 std::vector<double>::const_iterator vit = values->begin(); |
124 Graph::EdgeMap<double> * emptr=new Graph::EdgeMap<double> (mytab.mapstorage->graph, def_val); |
299 for (EdgeIt it(ms.graph); it != INVALID; ++it) |
125 |
300 { |
126 if(!only_nums) |
301 ms.set(map_name, it, MapValue(*vit)); |
127 { |
302 ++vit; |
128 std::stack<double> polishstack; |
303 } |
129 |
304 } |
130 for(EdgeIt k(mytab.mapstorage->graph); k!=INVALID; ++k) |
305 else |
131 { |
306 { |
132 for(int i=0;i<(int)polishform.size();i++) |
307 ms.createNodeMap(map_name, MapValue::NUMERIC, |
133 { |
308 MapValue(0.0)); |
134 double op1=0, op2=0; |
309 std::vector<double>::const_iterator vit = values->begin(); |
135 bool operation=true; |
310 for (NodeIt it(ms.graph); it != INVALID; ++it) |
136 switch(polishform[i]) |
311 { |
137 { |
312 ms.set(map_name, it, MapValue(*vit)); |
138 case '+': |
313 ++vit; |
139 case '-': |
314 } |
140 case '/': |
315 } |
141 case '*': |
316 delete values; |
142 op1=polishstack.top(); |
317 } |
143 polishstack.pop(); |
318 } |
144 op2=polishstack.top(); |
319 else if (text == "String") |
145 polishstack.pop(); |
320 { |
146 break; |
321 if (edge.get_active()) |
147 default: |
322 ms.createEdgeMap(map_name, MapValue::STRING, |
148 //substitute variable |
323 MapValue(def_val)); |
149 std::map< std::string,Graph::EdgeMap<double> * > ems=mytab.mapstorage->edgemap_storage; |
324 else |
150 bool itisvar=(ems.find(ch2var[ polishform[i] ])!=ems.end()); |
325 ms.createNodeMap(map_name, MapValue::STRING, |
151 if(itisvar) |
326 MapValue(def_val)); |
152 { |
327 } |
153 polishstack.push( (*(mytab.mapstorage->edgemap_storage[ ch2var[ polishform[i] ] ]))[k]); |
328 |
154 } |
329 name.set_text(""); |
155 else |
330 default_value.set_text("0"); |
156 { |
331 edge.show(); |
157 polishstack.push(atof(ch2var[ polishform[i] ].c_str())); |
332 node.show(); |
158 } |
333 hide(); |
159 operation=false; |
334 } |
160 break; |
|
161 } |
|
162 if(operation) |
|
163 { |
|
164 double res; |
|
165 switch(polishform[i]) |
|
166 { |
|
167 case '+': |
|
168 res=op1+op2; |
|
169 break; |
|
170 case '-': |
|
171 res=op2-op1; |
|
172 break; |
|
173 case '/': |
|
174 res=op2/op1; |
|
175 break; |
|
176 case '*': |
|
177 res=op1*op2; |
|
178 break; |
|
179 default: |
|
180 std::cout << "How could we get here?" << std::endl; |
|
181 break; |
|
182 } |
|
183 polishstack.push(res); |
|
184 } |
|
185 }//foreach letter in polishform |
|
186 (*emptr)[k]=polishstack.top(); |
|
187 }//foreach edge |
|
188 }//!only_nums |
|
189 |
|
190 //if addition was not successful addEdgeMap returns one. |
|
191 //cause can be that there is already a map named like the new one |
|
192 if(mytab.mapstorage->addEdgeMap(mapname, emptr, def_val)) |
|
193 { |
|
194 abortion=1; |
|
195 } |
|
196 |
|
197 //add it to the list of the displayable maps |
|
198 //furthermore it is done by signals |
|
199 //mytab.registerNewEdgeMap(mapname); |
|
200 |
|
201 //display it |
|
202 //gdc.changeEdgeText(mapname); |
|
203 } |
|
204 else //!edge.get_active() |
|
205 { |
|
206 //create the new map |
|
207 Graph::NodeMap<double> * emptr=new Graph::NodeMap<double> (mytab.mapstorage->graph, def_val); |
|
208 |
|
209 if(!only_nums) |
|
210 { |
|
211 std::stack<double> polishstack; |
|
212 |
|
213 for(NodeIt k(mytab.mapstorage->graph); k!=INVALID; ++k) |
|
214 { |
|
215 for(int i=0;i<(int)polishform.size();i++) |
|
216 { |
|
217 double op1=0, op2=0; |
|
218 bool operation=true; |
|
219 switch(polishform[i]) |
|
220 { |
|
221 case '+': |
|
222 case '-': |
|
223 case '/': |
|
224 case '*': |
|
225 op1=polishstack.top(); |
|
226 polishstack.pop(); |
|
227 op2=polishstack.top(); |
|
228 polishstack.pop(); |
|
229 break; |
|
230 default: |
|
231 std::map< std::string,Graph::NodeMap<double> * > nms=mytab.mapstorage->nodemap_storage; |
|
232 bool itisvar=(nms.find(ch2var[ polishform[i] ])!=nms.end()); |
|
233 if(itisvar) |
|
234 { |
|
235 polishstack.push( (*(mytab.mapstorage->nodemap_storage[ ch2var[ polishform[i] ] ]))[k]); |
|
236 } |
|
237 else |
|
238 { |
|
239 polishstack.push(atof(ch2var[ polishform[i] ].c_str())); |
|
240 } |
|
241 operation=false; |
|
242 break; |
|
243 } |
|
244 if(operation) |
|
245 { |
|
246 double res; |
|
247 switch(polishform[i]) |
|
248 { |
|
249 case '+': |
|
250 res=op1+op2; |
|
251 break; |
|
252 case '-': |
|
253 res=op2-op1; |
|
254 break; |
|
255 case '/': |
|
256 res=op2/op1; |
|
257 break; |
|
258 case '*': |
|
259 res=op1*op2; |
|
260 break; |
|
261 default: |
|
262 std::cout << "How could we get here?" << std::endl; |
|
263 break; |
|
264 } |
|
265 polishstack.push(res); |
|
266 } |
|
267 } |
|
268 (*emptr)[k]=polishstack.top(); |
|
269 } |
|
270 } |
|
271 //if addition was not successful addNodeMap returns one. |
|
272 //cause can be that there is already a map named like the new one |
|
273 if(mytab.mapstorage->addNodeMap(mapname,emptr, def_val)) |
|
274 { |
|
275 abortion=1; |
|
276 } |
|
277 |
|
278 //add it to the list of the displayable maps |
|
279 //furthermore it is done by signals |
|
280 //mytab.registerNewNodeMap(mapname); |
|
281 |
|
282 //display it |
|
283 //gdc.changeNodeText(mapname); |
|
284 } |
|
285 if(!abortion) |
|
286 { |
|
287 name.set_text(""); |
|
288 default_value.set_text("0"); |
|
289 edge.show(); |
|
290 node.show(); |
|
291 hide(); |
|
292 } |
|
293 } |
|
294 } |
|
295 } |
335 } |
296 |
336 |
297 |
337 |
298 std::string NewMapWin::string2Polishform(std::string rawcommand, bool itisedge) |
338 std::string NewMapWin::string2Polishform(std::string rawcommand, bool itisedge) |
299 { |
339 { |
306 std::string variable; |
346 std::string variable; |
307 |
347 |
308 char index='a'; |
348 char index='a'; |
309 |
349 |
310 for(int i=0;(valid_entry&&(i<(int)rawcommand.size()));i++) |
350 for(int i=0;(valid_entry&&(i<(int)rawcommand.size()));i++) |
311 { |
351 { |
312 switch(rawcommand[i]) |
352 switch(rawcommand[i]) |
313 { |
353 { |
314 case '+': |
354 case '+': |
315 case '-': |
355 case '-': |
316 case '*': |
356 case '*': |
317 case '/': |
357 case '/': |
318 case ')': |
358 case ')': |
319 case '(': |
359 case '(': |
320 if(!variable.empty()) |
360 if(!variable.empty()) |
321 { |
361 { |
322 valid_entry=validVariable(variable, itisedge); |
362 valid_entry=validVariable(variable, itisedge); |
323 ch2var[index]=variable; |
363 ch2var[index]=variable; |
324 command+=index; |
364 command+=index; |
325 index++; |
365 index++; |
326 variable.erase(0,variable.size()); |
366 variable.erase(0,variable.size()); |
327 } |
367 } |
328 command+=rawcommand[i]; |
368 command+=rawcommand[i]; |
329 break; |
369 break; |
330 default: |
370 default: |
331 variable+=rawcommand[i]; |
371 variable+=rawcommand[i]; |
332 break; |
372 break; |
333 } |
373 } |
334 } |
374 } |
335 |
375 |
336 if(!variable.empty()&&valid_entry) |
376 if(!variable.empty()&&valid_entry) |
337 { |
377 { |
338 valid_entry=validVariable(variable, itisedge); |
378 valid_entry=validVariable(variable, itisedge); |
339 ch2var[index]=variable; |
379 ch2var[index]=variable; |
340 command+=index; |
380 command+=index; |
341 index++; |
381 index++; |
342 variable.erase(0,variable.size()); |
382 variable.erase(0,variable.size()); |
343 } |
383 } |
344 |
384 |
345 if(valid_entry) |
385 if(valid_entry) |
346 { |
386 { |
347 unsigned int pr=10000; |
387 unsigned int pr=10000; |
348 bool prevmult=false; |
388 bool prevmult=false; |
349 unsigned int prev_change=pr; |
389 unsigned int prev_change=pr; |
350 unsigned int prev_br=pr; |
390 unsigned int prev_br=pr; |
351 int counter=0; |
391 int counter=0; |
352 std::string comm_nobr=""; |
392 std::string comm_nobr=""; |
353 std::vector<unsigned int> p; |
393 std::vector<unsigned int> p; |
354 p.resize(counter+1); |
394 p.resize(counter+1); |
355 |
395 |
356 //limits |
396 //limits |
357 //6 brackets embedded |
397 //6 brackets embedded |
358 //100 operation in a row from the same priority |
398 //100 operation in a row from the same priority |
359 |
399 |
360 for(int i=0;i<(int)command.size();i++) |
400 for(int i=0;i<(int)command.size();i++) |
361 { |
401 { |
362 bool put_in_string=true; |
402 bool put_in_string=true; |
363 switch(command[i]) |
403 switch(command[i]) |
364 { |
404 { |
365 case '(': |
405 case '(': |
366 pr=prev_br+10000; |
406 pr=prev_br+10000; |
367 prev_br=pr; |
407 prev_br=pr; |
368 prevmult=false; |
408 prevmult=false; |
369 put_in_string=false; |
409 put_in_string=false; |
370 break; |
410 break; |
371 case ')': |
411 case ')': |
372 pr=prev_br-10000; |
412 pr=prev_br-10000; |
373 prev_br=pr; |
413 prev_br=pr; |
374 prevmult=false; |
414 prevmult=false; |
375 put_in_string=false; |
415 put_in_string=false; |
376 break; |
416 break; |
377 case '+': |
417 case '+': |
378 case '-': |
418 case '-': |
379 if(prevmult) |
419 if(prevmult) |
380 { |
420 { |
381 pr=prev_change; |
421 pr=prev_change; |
382 } |
422 } |
383 p[counter]=pr; |
423 p[counter]=pr; |
384 pr-=100; |
424 pr-=100; |
385 |
425 |
386 prevmult=false; |
426 prevmult=false; |
387 break; |
427 break; |
388 case '/': |
428 case '/': |
389 case '*': |
429 case '*': |
390 if(!prevmult) |
430 if(!prevmult) |
391 { |
431 { |
392 prev_change=pr; |
432 prev_change=pr; |
393 pr+=200; |
433 pr+=200; |
394 pr-=1; |
434 pr-=1; |
395 } |
435 } |
396 p[counter]=pr; |
436 p[counter]=pr; |
397 pr-=1; |
437 pr-=1; |
398 prevmult=true; |
438 prevmult=true; |
399 break; |
439 break; |
400 default: |
440 default: |
401 p[counter]=65000; |
441 p[counter]=65000; |
402 break; |
442 break; |
403 } |
443 } |
404 if(put_in_string) |
444 if(put_in_string) |
405 { |
445 { |
406 counter++; |
446 counter++; |
407 p.resize(counter+1); |
447 p.resize(counter+1); |
408 comm_nobr=comm_nobr+command[i]; |
448 comm_nobr=comm_nobr+command[i]; |
409 } |
449 } |
410 } |
450 } |
411 |
451 |
412 tree_node * root=weightedString2Tree(comm_nobr, p, 0); |
452 tree_node * root=weightedString2Tree(comm_nobr, p, 0); |
413 |
453 |
414 std::string polishform=postOrder(root); |
454 std::string polishform=postOrder(root); |
415 |
455 |
416 deleteTree(root); |
456 deleteTree(root); |
417 |
457 |
418 return polishform; |
458 return polishform; |
419 } |
459 } |
420 return ""; |
460 return ""; |
421 } |
461 } |
422 |
462 |
423 void NewMapWin::deleteTree(NewMapWin::tree_node * node) |
463 void NewMapWin::deleteTree(NewMapWin::tree_node * node) |
424 { |
464 { |
425 if(node->left_child!=NULL) |
465 if(node->left_child!=NULL) |
426 { |
466 { |
427 deleteTree(node->left_child); |
467 deleteTree(node->left_child); |
428 } |
468 } |
429 if(node->right_child!=NULL) |
469 if(node->right_child!=NULL) |
430 { |
470 { |
431 deleteTree(node->right_child); |
471 deleteTree(node->right_child); |
432 } |
472 } |
433 delete node; |
473 delete node; |
434 } |
474 } |
435 |
475 |
436 NewMapWin::tree_node * NewMapWin::weightedString2Tree(std::string to_tree, std::vector<unsigned int> & p, int offset) |
476 NewMapWin::tree_node * NewMapWin::weightedString2Tree(std::string to_tree, std::vector<unsigned int> & p, int offset) |
437 { |
477 { |
438 unsigned int min=p[offset]; |
478 unsigned int min=p[offset]; |
439 int minplace=0; |
479 int minplace=0; |
440 for(int i=0;i<(int)to_tree.size();i++) |
480 for(int i=0;i<(int)to_tree.size();i++) |
441 { |
481 { |
442 if(min>p[offset+i]) |
482 if(min>p[offset+i]) |
443 { |
483 { |
444 min=p[offset+i]; |
484 min=p[offset+i]; |
445 minplace=i; |
485 minplace=i; |
446 } |
486 } |
447 } |
487 } |
448 tree_node * act_node=new tree_node; |
488 tree_node * act_node=new tree_node; |
449 act_node->ch=to_tree[minplace]; |
489 act_node->ch=to_tree[minplace]; |
450 if(to_tree.size()>=3) |
490 if(to_tree.size()>=3) |
451 { |
491 { |
452 act_node->left_child=weightedString2Tree(to_tree.substr(0,minplace), p, offset); |
492 act_node->left_child=weightedString2Tree(to_tree.substr(0,minplace), p, offset); |
453 act_node->right_child=weightedString2Tree(to_tree.substr(minplace+1,to_tree.size()-minplace-1), p, offset+minplace+1); |
493 act_node->right_child=weightedString2Tree(to_tree.substr(minplace+1,to_tree.size()-minplace-1), p, offset+minplace+1); |
454 } |
494 } |
455 else |
495 else |
456 { |
496 { |
457 act_node->left_child=NULL; |
497 act_node->left_child=NULL; |
458 act_node->right_child=NULL; |
498 act_node->right_child=NULL; |
459 } |
499 } |
460 return act_node; |
500 return act_node; |
461 } |
501 } |
462 |
502 |
463 std::string NewMapWin::postOrder(tree_node * subtree) |
503 std::string NewMapWin::postOrder(tree_node * subtree) |
464 { |
504 { |
465 std::string subtree_to_string; |
505 std::string subtree_to_string; |
466 if(subtree->left_child) |
506 if(subtree->left_child) |
467 { |
507 { |
468 subtree_to_string=postOrder(subtree->left_child); |
508 subtree_to_string=postOrder(subtree->left_child); |
469 } |
509 } |
470 if(subtree->right_child) |
510 if(subtree->right_child) |
471 { |
511 { |
472 subtree_to_string=subtree_to_string+postOrder(subtree->right_child); |
512 subtree_to_string=subtree_to_string+postOrder(subtree->right_child); |
473 } |
513 } |
474 subtree_to_string=subtree_to_string+subtree->ch; |
514 subtree_to_string=subtree_to_string+subtree->ch; |
475 return subtree_to_string; |
515 return subtree_to_string; |
476 } |
516 } |
477 |
517 |
478 bool NewMapWin::validVariable(std::string variable, bool itisedge) |
518 bool NewMapWin::validVariable(std::string variable, bool itisedge) |
479 { |
519 { |
|
520 MapStorage& ms = *mytab.mapstorage; |
|
521 |
480 bool cancel; |
522 bool cancel; |
481 //is it mapname? |
523 //is it mapname? |
482 if(itisedge) |
524 if(itisedge) |
483 { |
525 { |
484 cancel=(mytab.mapstorage->edgemap_storage.find(variable)==mytab.mapstorage->edgemap_storage.end()); |
526 std::vector<std::string> edge_maps = |
485 } |
527 ms.getEdgeMapList(NUM); |
|
528 cancel=(std::find(edge_maps.begin(), edge_maps.end(), variable)==edge_maps.end()); |
|
529 } |
486 else |
530 else |
487 { |
531 { |
488 cancel=(mytab.mapstorage->nodemap_storage.find(variable)==mytab.mapstorage->nodemap_storage.end()); |
532 std::vector<std::string> node_maps = |
489 } |
533 ms.getNodeMapList(NUM); |
|
534 cancel=(std::find(node_maps.begin(), node_maps.end(), variable)==node_maps.end()); |
|
535 } |
490 //maybe it is number |
536 //maybe it is number |
491 int point_num=0; |
537 int point_num=0; |
492 if(cancel) |
538 if(cancel) |
493 { |
539 { |
494 cancel=false; |
540 cancel=false; |
495 for(int j=0;(!cancel)&&(j<(int)variable.size());j++) |
541 for(int j=0;(!cancel)&&(j<(int)variable.size());j++) |
496 { |
542 { |
497 if(((variable[j]<'0')||(variable[j]>'9'))&&(variable[j]!='.')) |
543 if(((variable[j]<'0')||(variable[j]>'9'))&&(variable[j]!='.')) |
498 { |
544 { |
499 cancel=true; |
545 cancel=true; |
500 } |
546 } |
501 else |
547 else |
502 { |
548 { |
503 if(variable[j]=='.') |
549 if(variable[j]=='.') |
504 { |
550 { |
505 point_num++; |
551 point_num++; |
506 if(point_num>1) |
552 if(point_num>1) |
507 { |
553 { |
508 cancel=true; |
554 cancel=true; |
509 } |
555 } |
510 } |
556 } |
511 } |
557 } |
512 } |
558 } |
513 } |
559 } |
514 if(cancel) |
560 if(cancel) |
515 { |
561 { |
516 return false; |
562 return false; |
517 } |
563 } |
518 return true; |
564 return true; |
519 } |
565 } |