1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
|
/*
Copyright (C) 2010 Stewart Smith
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include <config.h>
#include <iostream>
#include <string>
#include <map>
#include <boost/unordered_map.hpp>
using namespace std;
typedef multimap<string, string> state_multimap;
typedef multimap<string, string>::value_type state_pair;
typedef multimap<string, string>::iterator state_multimap_iter;
void load_cursor_state_transitions(state_multimap &states);
int main(void)
{
state_multimap states;
load_cursor_state_transitions(states);
cout << "digraph CursorStates {" << endl;
state_multimap_iter it= states.begin();
while(it != states.end())
{
cout << " \"" << (*it).first << "\" -> \"" << (*it).second << "\"\n";
it++;
}
cout << "}" << endl;
}
|