The much faster way.
3 * This file is a part of LEMON, a generic C++ optimization library
5 * Copyright (C) 2003-2006
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
19 #include <new_map_win.h>
21 bool NewMapWin::closeIfEscapeIsPressed(GdkEventKey* e)
23 if(e->keyval==GDK_Escape)
30 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 set_default_size(200, 50);
34 signal_key_press_event().connect(sigc::mem_fun(*this, &NewMapWin::closeIfEscapeIsPressed));
36 Gtk::VBox * vbox=get_vbox();
39 table=new Gtk::Table(3, 2, false);
42 label->set_text("Name of new map:");
45 (*table).attach(*label,0,1,0,1,Gtk::SHRINK,Gtk::SHRINK,10,3);
46 (*table).attach(name,1,2,0,1,Gtk::SHRINK,Gtk::SHRINK,10,3);
49 label->set_text("Default value in the map:");
50 default_value.set_text("0");
52 (*table).attach(*label,0,1,1,2,Gtk::SHRINK,Gtk::SHRINK,10,3);
53 (*table).attach(default_value,1,2,1,2,Gtk::SHRINK,Gtk::SHRINK,10,3);
55 //node vs. edge map selector
56 Gtk::RadioButton::Group group = node.get_group();
57 edge.set_group(group);
61 (*table).attach(node,0,1,2,3,Gtk::SHRINK,Gtk::SHRINK,10,3);
62 (*table).attach(edge,1,2,2,3,Gtk::SHRINK,Gtk::SHRINK,10,3);
76 vbox->pack_start(*table);
79 add_button(Gtk::Stock::OK, Gtk::RESPONSE_OK);
85 void NewMapWin::on_response(int response_id)
87 if(response_id==Gtk::RESPONSE_OK)
91 //get and formulate text
92 std::string def_val_str=default_value.get_text();
95 for(int i=0;i<(int)def_val_str.size() && only_nums;i++)
97 if( def_val_str[i]<'0' || def_val_str[i]>'9' )
102 std::string polishform;
106 def_val=atof(def_val_str.c_str());
110 polishform=string2Polishform(def_val_str,edge.get_active());
114 std::string mapname=name.get_text();
116 if(!mapname.empty()&&(!polishform.empty()||only_nums))
119 if(edge.get_active())
122 Graph::EdgeMap<double> * emptr=new Graph::EdgeMap<double> (mytab.mapstorage.graph, def_val);
126 std::stack<double> polishstack;
128 for(EdgeIt k(mytab.mapstorage.graph); k!=INVALID; ++k)
130 for(int i=0;i<(int)polishform.size();i++)
134 switch(polishform[i])
140 op1=polishstack.top();
142 op2=polishstack.top();
146 //substitute variable
147 std::map< std::string,Graph::EdgeMap<double> * > ems=mytab.mapstorage.edgemap_storage;
148 bool itisvar=(ems.find(ch2var[ polishform[i] ])!=ems.end());
151 polishstack.push( (*(mytab.mapstorage.edgemap_storage[ ch2var[ polishform[i] ] ]))[k]);
155 polishstack.push(atof(ch2var[ polishform[i] ].c_str()));
163 switch(polishform[i])
178 std::cout << "How could we get here?" << std::endl;
181 polishstack.push(res);
183 }//foreach letter in polishform
184 (*emptr)[k]=polishstack.top();
188 //if addition was not successful addEdgeMap returns one.
189 //cause can be that there is already a map named like the new one
190 if(mytab.mapstorage.addEdgeMap(mapname, emptr, def_val))
195 //add it to the list of the displayable maps
196 //furthermore it is done by signals
197 //mytab.registerNewEdgeMap(mapname);
200 //gdc.changeEdgeText(mapname);
202 else //!edge.get_active()
205 Graph::NodeMap<double> * emptr=new Graph::NodeMap<double> (mytab.mapstorage.graph, def_val);
209 std::stack<double> polishstack;
211 for(NodeIt k(mytab.mapstorage.graph); k!=INVALID; ++k)
213 for(int i=0;i<(int)polishform.size();i++)
217 switch(polishform[i])
223 op1=polishstack.top();
225 op2=polishstack.top();
229 std::map< std::string,Graph::NodeMap<double> * > nms=mytab.mapstorage.nodemap_storage;
230 bool itisvar=(nms.find(ch2var[ polishform[i] ])!=nms.end());
233 polishstack.push( (*(mytab.mapstorage.nodemap_storage[ ch2var[ polishform[i] ] ]))[k]);
237 polishstack.push(atof(ch2var[ polishform[i] ].c_str()));
245 switch(polishform[i])
260 std::cout << "How could we get here?" << std::endl;
263 polishstack.push(res);
266 (*emptr)[k]=polishstack.top();
269 //if addition was not successful addNodeMap returns one.
270 //cause can be that there is already a map named like the new one
271 if(mytab.mapstorage.addNodeMap(mapname,emptr, def_val))
276 //add it to the list of the displayable maps
277 //furthermore it is done by signals
278 //mytab.registerNewNodeMap(mapname);
281 //gdc.changeNodeText(mapname);
286 default_value.set_text("0");
296 std::string NewMapWin::string2Polishform(std::string rawcommand, bool itisedge)
298 bool valid_entry=true;
300 std::map<std::string, int> str2i;
304 std::string variable;
308 for(int i=0;(valid_entry&&(i<(int)rawcommand.size()));i++)
310 switch(rawcommand[i])
318 if(!variable.empty())
320 valid_entry=validVariable(variable, itisedge);
321 ch2var[index]=variable;
324 variable.erase(0,variable.size());
326 command+=rawcommand[i];
329 variable+=rawcommand[i];
334 if(!variable.empty()&&valid_entry)
336 valid_entry=validVariable(variable, itisedge);
337 ch2var[index]=variable;
340 variable.erase(0,variable.size());
345 unsigned int pr=10000;
347 unsigned int prev_change=pr;
348 unsigned int prev_br=pr;
350 std::string comm_nobr="";
351 std::vector<unsigned int> p;
355 //6 brackets embedded
356 //100 operation in a row from the same priority
358 for(int i=0;i<(int)command.size();i++)
360 bool put_in_string=true;
406 comm_nobr=comm_nobr+command[i];
410 tree_node * root=weightedString2Tree(comm_nobr, p, 0);
412 std::string polishform=postOrder(root);
421 void NewMapWin::deleteTree(NewMapWin::tree_node * node)
423 if(node->left_child!=NULL)
425 deleteTree(node->left_child);
427 if(node->right_child!=NULL)
429 deleteTree(node->right_child);
434 NewMapWin::tree_node * NewMapWin::weightedString2Tree(std::string to_tree, std::vector<unsigned int> & p, int offset)
436 unsigned int min=p[offset];
438 for(int i=0;i<(int)to_tree.size();i++)
446 tree_node * act_node=new tree_node;
447 act_node->ch=to_tree[minplace];
448 if(to_tree.size()>=3)
450 act_node->left_child=weightedString2Tree(to_tree.substr(0,minplace), p, offset);
451 act_node->right_child=weightedString2Tree(to_tree.substr(minplace+1,to_tree.size()-minplace-1), p, offset+minplace+1);
455 act_node->left_child=NULL;
456 act_node->right_child=NULL;
461 std::string NewMapWin::postOrder(tree_node * subtree)
463 std::string subtree_to_string;
464 if(subtree->left_child)
466 subtree_to_string=postOrder(subtree->left_child);
468 if(subtree->right_child)
470 subtree_to_string=subtree_to_string+postOrder(subtree->right_child);
472 subtree_to_string=subtree_to_string+subtree->ch;
473 return subtree_to_string;
476 bool NewMapWin::validVariable(std::string variable, bool itisedge)
482 cancel=(mytab.mapstorage.edgemap_storage.find(variable)==mytab.mapstorage.edgemap_storage.end());
486 cancel=(mytab.mapstorage.nodemap_storage.find(variable)==mytab.mapstorage.nodemap_storage.end());
493 for(int j=0;(!cancel)&&(j<(int)variable.size());j++)
495 if(((variable[j]<'0')||(variable[j]>'9'))&&(variable[j]!='.'))