src_MSVC/iooper.h

   1 /** @file */
   2 ////////////////////////////////////////////////////////////////////////////////////////
   3 //
   4 //    This file is part of Boost Statechart Viewer.
   5 //
   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.
  10 //
  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.
  15 //
  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/>.
  18 //
  19 ////////////////////////////////////////////////////////////////////////////////////////
  20
  21 #include <fstream>
  22 #include <list>
  23 #include <string>
  24
  25 #include "stringoper.h"
  26
  27 using namespace std;
  28
  29 /**
  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.
  31 */
  32 class IO_operations
  33 {
  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. */
  41         int nState;
  42         int cols, rows;
  43         /** This function finds place in the transition table to put a transition there. */
  44         int find_place(string model, int type)
  45         {
  46                 if(type == 1)
  47                 {
  48                         for(int i = 3;i<cols;i++)
  49                         {
  50                                 if(model.compare(0,model.size(),table[i])==0) return i;
  51                         }
  52                 }
  53                 else
  54                 {
  55                         for(int i = 1;i<rows;i++)
  56                         if(model.compare(0,model.size(),table[i*cols+2])==0) return i;
  57                 }
  58                 return -1;
  59         }
  60         public:
  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 )
  64         {
  65                 outputFilename = outputFile;
  66                 name_of_machine = FSM_name;
  67                 name_of_first_state = firstState;
  68                 transitions = trans;
  69                 states = state;
  70                 events = ev;
  71         }
  72
  73         ~IO_operations() /** destructor. It deallocates the transition table.*/
  74         {
  75                 delete table;
  76         }
  77
  78         void setEvents(list<string> events) /** Set list of events to an attribute */
  79         {
  80                 this->events = events;
  81         }
  82
  83         void setTransitions(list<string> transitions) /** Set list of transitions to an attribute */
  84         {
  85                 this->transitions = transitions;
  86         }
  87
  88         void setStates(list<string> states) /** Set list of states to an attribute */
  89         {
  90                 this->states = states;
  91         }
  92
  93         void setNameOfStateMachine(string name_of_FSM) /** Set name of FSM to an attribute */
  94         {
  95                 name_of_machine = name_of_FSM;
  96         }
  97
  98         void setNameOfFirstState(string first_state) /** Set name of start state to an attribute */
  99         {
 100                 name_of_first_state = first_state;
 101         }
 102
 103         void setOutputFilename(string outputFilename) /** Set name of an output file to an attribute */
 104         {
 105                 this->outputFilename = outputFilename;
 106         }
 107
 108         bool write_states(ofstream& filestr) /** This method write states to the output file and also to transition table. */
 109         {
 110                 int pos1, pos2, cnt, subs;
 111                 nState = 1;
 112                 string context, state, ctx, sState, str;
 113                 list<string> nstates = states;
 114                 context = name_of_machine;
 115                 table[0] = "S";
 116                 table[1] = "Context";
 117                 table[2] = "State";
 118                 for(list<string>::iterator i = nstates.begin();i!=nstates.end();i++) // write all states in the context of the automaton
 119                 {
 120                         state = *i;
 121                         cnt = count(state,',');
 122                         if(cnt==1)
 123                         {
 124                                 pos1 = state.find(",");
 125                                 ctx = cut_namespaces(state.substr(pos1+1));
 126                                 if(ctx.compare(0,context.length(),context)==0)
 127                                 {
 128                                         str = cut_namespaces(state.substr(0,pos1));
 129                                         filestr<<str<<";\n";
 130                                         table[cols*nState+2] = str;
 131                                         table[cols*nState+1] = context;
 132                                         nState+=1;
 133                                         nstates.erase(i);
 134                                         i--;
 135                                         if(str.compare(0,str.length(),name_of_first_state)==0) table[cols*(nState-1)] = "*";
 136                                 }
 137                         }
 138                         if(cnt==2)
 139                         {
 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)
 144                                 {
 145                                         str = cut_namespaces(state.substr(0,pos1));
 146                                         filestr<<str<<";\n";
 147                                         table[cols*nState+2] = str;
 148                                         table[cols*nState+1] = context;
 149                                         nState+=1;
 150                                         if(str.compare(0,str.length(),name_of_first_state)==0) table[cols*(nState-1)] = "*";
 151                                 }
 152                         }
 153                 }
 154                 filestr<<name_of_first_state<<" [peripheries=2] ;\n";
 155                 subs = 0;
 156                 while(!nstates.empty()) // substates ?
 157                 {
 158                         state = nstates.front();
 159                         filestr<<"subgraph cluster"<<subs<<" {\n";
 160                         pos1 = state.find(",");
 161                         pos2 = state.rfind(",");
 162                         if(pos1 == pos2) return false;
 163
 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";
 168                         nstates.pop_front();
 169                         for(list<string>::iterator i = nstates.begin();i!=nstates.end();i++)
 170                         {
 171                                 state = *i;
 172                                 cnt = count(state,',');
 173                                 if(cnt==1)
 174                                 {
 175                                         pos1 = state.find(",");
 176                                         ctx = cut_namespaces(state.substr(pos1+1));
 177                                         if(ctx.compare(0,context.length(),context)==0)
 178                                         {
 179                                                 str = cut_namespaces(state.substr(0,pos1));
 180                                                 filestr<<str<<";\n";
 181                                                 table[cols*nState+2] = str;
 182                                                 table[cols*nState+1] = context;
 183                                                 nState+=1;
 184                                                 nstates.erase(i);
 185                                                 i--;
 186                                                 if(str.compare(0,str.length(),sState)==0) table[cols*(nState-1)] = "*";
 187                                         }
 188                                 }
 189                                 if(cnt==2)
 190                                 {
 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)
 195                                         {
 196                                                 str = cut_namespaces(state.substr(0,pos1));
 197                                                 filestr<<str<<";\n";
 198                                                 table[cols*nState+2] = str;
 199                                                 table[cols*nState+1] = context;
 200                                                 nState+=1;
 201                                                 if(str.compare(0,str.length(),sState)==0) table[cols*(nState-1)] = "*";
 202                                         }
 203                                 }
 204                         }
 205                         filestr<<"}\n";
 206                         subs+=1;
 207                 }
 208                 return true;
 209         }
 210
 211         void write_transitions(ofstream& filestr) /** Write transitions to the output file nad the transition table. */
 212         {
 213                 int pos1, pos2;
 214                 string params, state, event, dest;
 215                 for(list<string>::iterator i = transitions.begin();i!=transitions.end();i++) // write all transitions
 216                 {
 217                         params = *i;
 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));
 223                         filestr<<dest;
 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;
 227                 }
 228                 return;
 229         }
 230
 231         void fill_table_with_events() /** Fill the first row of the transition table with events. */
 232         {
 233                 int j = 3;
 234                 for(list<string>::iterator i = events.begin();i!=events.end();i++)
 235                 {
 236                         table[j] = *i;
 237                         j++;
 238                 }
 239         }
 240
 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. */
 242         {
 243                 if(!name_of_first_state.empty())
 244                 {
 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))
 252                         {
 253                                 cerr<<"Error during writing states.\n";
 254                                 filestr<<"}";
 255                                 filestr.close();
 256                                 return;
 257                         }
 258                         write_transitions(filestr);
 259                         filestr<<"}";
 260                         filestr.close();
 261                         print_table();
 262                 }
 263                 else cout<<"No state machine was found. So no output file was created.\n";
 264                 return;
 265         }
 266
 267         void print_table() /** This function prints the transition table. At first it counts the size of all columns. */
 268         {
 269                 cout<<"\nTRANSITION TABLE\n";
 270                 unsigned * len = new unsigned[cols];
 271                 len[0] = 1;
 272                 string line = "-|---|-";
 273                 for(int i = 1; i<cols; i++)
 274                 {
 275                         len[i] = 0;
 276                         for(int j = 0;j<rows;j++)
 277                         {
 278                                 if(len[i]<table[j*cols+i].length()) len[i] = table[j*cols+i].length();
 279                         }
 280                         for(unsigned k = 0; k<len[i]; k++)
 281                         {
 282                                 line.append("-");
 283                         }
 284                         line.append("-|-");
 285                 }
 286                 cout<<line<<"\n";
 287                 for(int i = 0; i<rows; i++)
 288                 {
 289                         cout<<" | ";
 290                         for(int j = 0;j<cols;j++)
 291                         {
 292                                 cout.width(len[j]);
 293                                 cout<<left<<table[i*cols+j]<<" | ";
 294                         }
 295                         cout<<"\n";
 296                         cout<<line<<"\n";
 297                 }
 298                 delete len;
 299         }
 300
 301         void print_stats() /** Print short statistics about the state machine */
 302         {
 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";
 307                 return;
 308         }
 309
 310 };