2 ////////////////////////////////////////////////////////////////////////////////////////
4 // This file is part of Boost Statechart Viewer.
6 // Boost Statechart Viewer is free software: you can redistribute it and/or modify
7 // it under the terms of the GNU General Public License as published by
8 // the Free Software Foundation, either version 3 of the License, or
9 // (at your option) any later version.
11 // Boost Statechart Viewer is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // You should have received a copy of the GNU General Public License
17 // along with Boost Statechart Viewer. If not, see <http://www.gnu.org/licenses/>.
19 ////////////////////////////////////////////////////////////////////////////////////////
25 #include "stringoper.h"
30 * This class provides saving information about state machine to a specified output file. It saves states and transitions and also it creates the transition table.
34 list<string> transitions; /** list of transitions */
35 list<string> states; /** list of states */
36 list<string> events; /** list of events */
37 string outputFilename;
38 string name_of_machine;
39 string name_of_first_state;
40 string *table; /** transition table. It is being allocated when starting the creation of output file. */
43 /** This function finds place in the transition table to put a transition there. */
44 int find_place(string model, int type)
48 for(int i = 3;i<cols;i++)
50 if(model.compare(0,model.size(),table[i])==0) return i;
55 for(int i = 1;i<rows;i++)
56 if(model.compare(0,model.size(),table[i*cols+2])==0) return i;
61 IO_operations() {} /** Implicit constructor */
62 /** Constructor that fill in all private variables in this class */
63 IO_operations( const string outputFile, const string FSM_name, const string firstState, const list<string> trans, const list<string> state, const list<string> ev )
65 outputFilename = outputFile;
66 name_of_machine = FSM_name;
67 name_of_first_state = firstState;
73 ~IO_operations() /** destructor. It deallocates the transition table.*/
78 void setEvents(list<string> events) /** Set list of events to an attribute */
80 this->events = events;
83 void setTransitions(list<string> transitions) /** Set list of transitions to an attribute */
85 this->transitions = transitions;
88 void setStates(list<string> states) /** Set list of states to an attribute */
90 this->states = states;
93 void setNameOfStateMachine(string name_of_FSM) /** Set name of FSM to an attribute */
95 name_of_machine = name_of_FSM;
98 void setNameOfFirstState(string first_state) /** Set name of start state to an attribute */
100 name_of_first_state = first_state;
103 void setOutputFilename(string outputFilename) /** Set name of an output file to an attribute */
105 this->outputFilename = outputFilename;
108 bool write_states(ofstream& filestr) /** This method write states to the output file and also to transition table. */
110 int pos1, pos2, cnt, subs;
112 string context, state, ctx, sState, str;
113 list<string> nstates = states;
114 context = name_of_machine;
116 table[1] = "Context";
118 for(list<string>::iterator i = nstates.begin();i!=nstates.end();i++) // write all states in the context of the automaton
121 cnt = count(state,',');
124 pos1 = state.find(",");
125 ctx = cut_namespaces(state.substr(pos1+1));
126 if(ctx.compare(0,context.length(),context)==0)
128 str = cut_namespaces(state.substr(0,pos1));
130 table[cols*nState+2] = str;
131 table[cols*nState+1] = context;
135 if(str.compare(0,str.length(),name_of_first_state)==0) table[cols*(nState-1)] = "*";
140 pos1 = state.find(",");
141 pos2 = state.rfind(",");
142 ctx = cut_namespaces(state.substr(pos1+1,pos2-pos1-1));
143 if(ctx.compare(0,context.length(),context)==0)
145 str = cut_namespaces(state.substr(0,pos1));
147 table[cols*nState+2] = str;
148 table[cols*nState+1] = context;
150 if(str.compare(0,str.length(),name_of_first_state)==0) table[cols*(nState-1)] = "*";
154 filestr<<name_of_first_state<<" [peripheries=2] ;\n";
156 while(!nstates.empty()) // substates ?
158 state = nstates.front();
159 filestr<<"subgraph cluster"<<subs<<" {\n";
160 pos1 = state.find(",");
161 pos2 = state.rfind(",");
162 if(pos1 == pos2) return false;
164 context = cut_namespaces(state.substr(0,pos1));
165 filestr<<"label=\""<<context<<"\";\n";
166 sState = cut_namespaces(state.substr(pos2+1));
167 filestr<<sState<<" [peripheries=2] ;\n";
169 for(list<string>::iterator i = nstates.begin();i!=nstates.end();i++)
172 cnt = count(state,',');
175 pos1 = state.find(",");
176 ctx = cut_namespaces(state.substr(pos1+1));
177 if(ctx.compare(0,context.length(),context)==0)
179 str = cut_namespaces(state.substr(0,pos1));
181 table[cols*nState+2] = str;
182 table[cols*nState+1] = context;
186 if(str.compare(0,str.length(),sState)==0) table[cols*(nState-1)] = "*";
191 pos1 = state.find(",");
192 pos2 = state.rfind(",");
193 ctx = cut_namespaces(state.substr(pos1+1,pos2-pos1-1));
194 if(ctx.compare(0,context.length(),context)==0)
196 str = cut_namespaces(state.substr(0,pos1));
198 table[cols*nState+2] = str;
199 table[cols*nState+1] = context;
201 if(str.compare(0,str.length(),sState)==0) table[cols*(nState-1)] = "*";
211 void write_transitions(ofstream& filestr) /** Write transitions to the output file nad the transition table. */
214 string params, state, event, dest;
215 for(list<string>::iterator i = transitions.begin();i!=transitions.end();i++) // write all transitions
218 pos1 = params.find(",");
219 state = cut_namespaces(params.substr(0,pos1));
220 filestr<<state<<"->";
221 pos2 = params.rfind(",");
222 dest = cut_namespaces(params.substr(pos2+1));
224 event = cut_namespaces(params.substr(pos1+1,pos2-pos1-1));
225 filestr<<"[label=\""<<event<<"\"];\n";
226 table[find_place(state,2)*cols+find_place(event,1)]=dest;
231 void fill_table_with_events() /** Fill the first row of the transition table with events. */
234 for(list<string>::iterator i = events.begin();i!=events.end();i++)
241 void save_to_file() /** Create output file stream and write there the name of state machine. It controls the whole process of writing into output files. */
243 if(!name_of_first_state.empty())
245 ofstream filestr(outputFilename.c_str());
246 filestr<<"digraph "<< name_of_machine<< " {\n";
247 cols = events.size()+3;
248 rows = states.size()+1;
249 table = new string [cols*rows];
250 fill_table_with_events();
251 if(!write_states(filestr))
253 cerr<<"Error during writing states.\n";
258 write_transitions(filestr);
263 else cout<<"No state machine was found. So no output file was created.\n";
267 void print_table() /** This function prints the transition table. At first it counts the size of all columns. */
269 cout<<"\nTRANSITION TABLE\n";
270 unsigned * len = new unsigned[cols];
272 string line = "-|---|-";
273 for(int i = 1; i<cols; i++)
276 for(int j = 0;j<rows;j++)
278 if(len[i]<table[j*cols+i].length()) len[i] = table[j*cols+i].length();
280 for(unsigned k = 0; k<len[i]; k++)
287 for(int i = 0; i<rows; i++)
290 for(int j = 0;j<cols;j++)
293 cout<<left<<table[i*cols+j]<<" | ";
301 void print_stats() /** Print short statistics about the state machine */
303 cout<<"\n"<<"Statistics: \n";
304 cout<<"Number of states: "<<states.size()<<"\n";
305 cout<<"Number of events: "<<events.size()<<"\n";
306 cout<<"Number of transitions: "<<transitions.size()<<"\n\n";