vmap.h: Enables one to create maps with a virtual base class.
1 #include <new_map_win.h>
3 bool NewMapWin::closeIfEscapeIsPressed(GdkEventKey* e)
5 if(e->keyval==GDK_Escape)
12 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")
14 set_default_size(200, 50);
16 signal_key_press_event().connect(sigc::mem_fun(*this, &NewMapWin::closeIfEscapeIsPressed));
18 Gtk::VBox * vbox=get_vbox();
21 table=new Gtk::Table(3, 2, false);
24 label->set_text("Name of new map:");
27 (*table).attach(*label,0,1,0,1,Gtk::SHRINK,Gtk::SHRINK,10,3);
28 (*table).attach(name,1,2,0,1,Gtk::SHRINK,Gtk::SHRINK,10,3);
31 label->set_text("Default value in the map:");
32 default_value.set_text("0");
34 (*table).attach(*label,0,1,1,2,Gtk::SHRINK,Gtk::SHRINK,10,3);
35 (*table).attach(default_value,1,2,1,2,Gtk::SHRINK,Gtk::SHRINK,10,3);
37 //node vs. edge map selector
38 Gtk::RadioButton::Group group = node.get_group();
39 edge.set_group(group);
43 (*table).attach(node,0,1,2,3,Gtk::SHRINK,Gtk::SHRINK,10,3);
44 (*table).attach(edge,1,2,2,3,Gtk::SHRINK,Gtk::SHRINK,10,3);
58 vbox->pack_start(*table);
61 add_button(Gtk::Stock::OK, Gtk::RESPONSE_OK);
67 void NewMapWin::on_response(int response_id)
69 if(response_id==Gtk::RESPONSE_OK)
73 //get and formulate text
74 std::string def_val_str=default_value.get_text();
77 for(int i=0;i<(int)def_val_str.size() && only_nums;i++)
79 if( def_val_str[i]<'0' || def_val_str[i]>'9' )
84 std::string polishform;
88 def_val=atof(def_val_str.c_str());
92 polishform=string2Polishform(def_val_str,edge.get_active());
96 std::string mapname=name.get_text();
98 if(!mapname.empty()&&(!polishform.empty()||only_nums))
101 if(edge.get_active())
104 Graph::EdgeMap<double> * emptr=new Graph::EdgeMap<double> (mytab.mapstorage.graph, def_val);
108 std::stack<double> polishstack;
110 for(EdgeIt k(mytab.mapstorage.graph); k!=INVALID; ++k)
112 for(int i=0;i<(int)polishform.size();i++)
116 switch(polishform[i])
122 op1=polishstack.top();
124 op2=polishstack.top();
128 //substitute variable
129 std::map< std::string,Graph::EdgeMap<double> * > ems=mytab.mapstorage.edgemap_storage;
130 bool itisvar=(ems.find(ch2var[ polishform[i] ])!=ems.end());
133 polishstack.push( (*(mytab.mapstorage.edgemap_storage[ ch2var[ polishform[i] ] ]))[k]);
137 polishstack.push(atof(ch2var[ polishform[i] ].c_str()));
145 switch(polishform[i])
160 std::cout << "How could we get here?" << std::endl;
163 polishstack.push(res);
165 }//foreach letter in polishform
166 (*emptr)[k]=polishstack.top();
170 //if addition was not successful addEdgeMap returns one.
171 //cause can be that there is already a map named like the new one
172 if(mytab.mapstorage.addEdgeMap(mapname, emptr, def_val))
177 //add it to the list of the displayable maps
178 //furthermore it is done by signals
179 //mytab.registerNewEdgeMap(mapname);
182 //gdc.changeEdgeText(mapname);
184 else //!edge.get_active()
187 Graph::NodeMap<double> * emptr=new Graph::NodeMap<double> (mytab.mapstorage.graph, def_val);
191 std::stack<double> polishstack;
193 for(NodeIt k(mytab.mapstorage.graph); k!=INVALID; ++k)
195 for(int i=0;i<(int)polishform.size();i++)
199 switch(polishform[i])
205 op1=polishstack.top();
207 op2=polishstack.top();
211 std::map< std::string,Graph::NodeMap<double> * > nms=mytab.mapstorage.nodemap_storage;
212 bool itisvar=(nms.find(ch2var[ polishform[i] ])!=nms.end());
215 polishstack.push( (*(mytab.mapstorage.nodemap_storage[ ch2var[ polishform[i] ] ]))[k]);
219 polishstack.push(atof(ch2var[ polishform[i] ].c_str()));
227 switch(polishform[i])
242 std::cout << "How could we get here?" << std::endl;
245 polishstack.push(res);
248 (*emptr)[k]=polishstack.top();
251 //if addition was not successful addNodeMap returns one.
252 //cause can be that there is already a map named like the new one
253 if(mytab.mapstorage.addNodeMap(mapname,emptr, def_val))
258 //add it to the list of the displayable maps
259 //furthermore it is done by signals
260 //mytab.registerNewNodeMap(mapname);
263 //gdc.changeNodeText(mapname);
268 default_value.set_text("0");
278 std::string NewMapWin::string2Polishform(std::string rawcommand, bool itisedge)
280 bool valid_entry=true;
282 std::map<std::string, int> str2i;
286 std::string variable;
290 for(int i=0;(valid_entry&&(i<(int)rawcommand.size()));i++)
292 switch(rawcommand[i])
300 if(!variable.empty())
302 valid_entry=validVariable(variable, itisedge);
303 ch2var[index]=variable;
306 variable.erase(0,variable.size());
308 command+=rawcommand[i];
311 variable+=rawcommand[i];
316 if(!variable.empty()&&valid_entry)
318 valid_entry=validVariable(variable, itisedge);
319 ch2var[index]=variable;
322 variable.erase(0,variable.size());
327 unsigned int pr=10000;
329 unsigned int prev_change=pr;
330 unsigned int prev_br=pr;
332 std::string comm_nobr="";
333 std::vector<unsigned int> p;
337 //6 brackets embedded
338 //100 operation in a row from the same priority
340 for(int i=0;i<(int)command.size();i++)
342 bool put_in_string=true;
388 comm_nobr=comm_nobr+command[i];
392 tree_node * root=weightedString2Tree(comm_nobr, p, 0);
394 std::string polishform=postOrder(root);
403 void NewMapWin::deleteTree(NewMapWin::tree_node * node)
405 if(node->left_child!=NULL)
407 deleteTree(node->left_child);
409 if(node->right_child!=NULL)
411 deleteTree(node->right_child);
416 NewMapWin::tree_node * NewMapWin::weightedString2Tree(std::string to_tree, std::vector<unsigned int> & p, int offset)
418 unsigned int min=p[offset];
420 for(int i=0;i<(int)to_tree.size();i++)
428 tree_node * act_node=new tree_node;
429 act_node->ch=to_tree[minplace];
430 if(to_tree.size()>=3)
432 act_node->left_child=weightedString2Tree(to_tree.substr(0,minplace), p, offset);
433 act_node->right_child=weightedString2Tree(to_tree.substr(minplace+1,to_tree.size()-minplace-1), p, offset+minplace+1);
437 act_node->left_child=NULL;
438 act_node->right_child=NULL;
443 std::string NewMapWin::postOrder(tree_node * subtree)
445 std::string subtree_to_string;
446 if(subtree->left_child)
448 subtree_to_string=postOrder(subtree->left_child);
450 if(subtree->right_child)
452 subtree_to_string=subtree_to_string+postOrder(subtree->right_child);
454 subtree_to_string=subtree_to_string+subtree->ch;
455 return subtree_to_string;
458 bool NewMapWin::validVariable(std::string variable, bool itisedge)
464 cancel=(mytab.mapstorage.edgemap_storage.find(variable)==mytab.mapstorage.edgemap_storage.end());
468 cancel=(mytab.mapstorage.nodemap_storage.find(variable)==mytab.mapstorage.nodemap_storage.end());
475 for(int j=0;(!cancel)&&(j<(int)variable.size());j++)
477 if(((variable[j]<'0')||(variable[j]>'9'))&&(variable[j]!='.'))