hegyi@42
|
1 |
// -*- C++ -*- //
|
hegyi@42
|
2 |
|
hegyi@42
|
3 |
#ifndef NEWMAPWIN_H
|
hegyi@42
|
4 |
#define NEWMAPWIN_H
|
hegyi@42
|
5 |
|
hegyi@42
|
6 |
class NewMapWin;
|
hegyi@42
|
7 |
|
hegyi@42
|
8 |
#include <all_include.h>
|
hegyi@96
|
9 |
#include <nbtab.h>
|
hegyi@42
|
10 |
#include <libgnomecanvasmm.h>
|
hegyi@42
|
11 |
#include <libgnomecanvasmm/polygon.h>
|
hegyi@88
|
12 |
#include <stack>
|
hegyi@42
|
13 |
|
hegyi@120
|
14 |
///Graphical interface for node/edge map creation.
|
hegyi@120
|
15 |
|
hegyi@42
|
16 |
///This class is responsible for creating a window,
|
hegyi@42
|
17 |
///on which the parameters of a new map can be set.
|
hegyi@90
|
18 |
class NewMapWin : public Gtk::Dialog
|
hegyi@42
|
19 |
{
|
hegyi@120
|
20 |
///The \ref NoteBookTab in which the new map has to be placed.
|
hegyi@96
|
21 |
NoteBookTab & mytab;
|
hegyi@42
|
22 |
|
hegyi@88
|
23 |
public:
|
hegyi@120
|
24 |
|
hegyi@120
|
25 |
///Struct to be able to evaluate expressions.
|
hegyi@120
|
26 |
|
hegyi@120
|
27 |
///Initial values of map elements can be given
|
hegyi@120
|
28 |
///by numbers or by expressions. From expressions
|
hegyi@121
|
29 |
///we build first a tree according to the priorities
|
hegyi@121
|
30 |
///of operations in the expression. This is the data
|
hegyi@121
|
31 |
///structure
|
hegyi@120
|
32 |
///that can store one tree element.
|
hegyi@88
|
33 |
struct tree_node
|
hegyi@88
|
34 |
{
|
hegyi@120
|
35 |
///Character stored in this tree element
|
hegyi@88
|
36 |
char ch;
|
hegyi@120
|
37 |
///Left child of tree element.
|
hegyi@88
|
38 |
tree_node * left_child;
|
hegyi@120
|
39 |
///Right child of tree element.
|
hegyi@88
|
40 |
tree_node * right_child;
|
hegyi@88
|
41 |
};
|
hegyi@88
|
42 |
|
hegyi@120
|
43 |
///Constructor of NewMapWin.
|
hegyi@120
|
44 |
|
hegyi@120
|
45 |
///It creates the widgets shown in
|
hegyi@120
|
46 |
///NewMapWin.
|
hegyi@96
|
47 |
NewMapWin(const std::string& title, NoteBookTab &, bool itisedge=true, bool edgenode=true);
|
hegyi@117
|
48 |
|
hegyi@120
|
49 |
///Callback function for OK button. It creates the map.
|
hegyi@120
|
50 |
|
hegyi@120
|
51 |
///This function determines whether the input is correct:
|
hegyi@120
|
52 |
///the name of new map must not be already used, the expression
|
hegyi@120
|
53 |
///that gives tha initial values of map elements has to be valid.
|
hegyi@120
|
54 |
///If input is correct it creates and registrates the new map
|
hegyi@120
|
55 |
///to the correct place. (\ref mytab)
|
hegyi@90
|
56 |
virtual void on_response(int response_id);
|
hegyi@85
|
57 |
|
hegyi@120
|
58 |
///Close window if Esc key pressed.
|
hegyi@42
|
59 |
virtual bool closeIfEscapeIsPressed(GdkEventKey*);
|
hegyi@42
|
60 |
|
hegyi@120
|
61 |
///Function that creates a tree from an appropriately manipulated string.
|
hegyi@88
|
62 |
|
hegyi@120
|
63 |
///Tree is builded according to priorities of operations in expression given by string.
|
hegyi@120
|
64 |
///Priorities are indicated in a vector that contains weights for each operation.
|
hegyi@120
|
65 |
///\param to_tree string to build tree from
|
hegyi@120
|
66 |
///\param weights weights (priorities)
|
hegyi@120
|
67 |
///\param offset this function call is recursive. This parameter tells us,
|
hegyi@120
|
68 |
///with which part of the string do we have to deal with.
|
hegyi@120
|
69 |
tree_node * weightedString2Tree(std::string to_tree, std::vector<unsigned int> & weights, int offset);
|
hegyi@88
|
70 |
|
hegyi@120
|
71 |
///Function that creates a string from a tree by postorder reading.
|
hegyi@88
|
72 |
|
hegyi@120
|
73 |
///This is the last step of creating polishform
|
hegyi@120
|
74 |
///from a given expression string.
|
hegyi@120
|
75 |
///\param root the root of the tree to read through
|
hegyi@120
|
76 |
std::string postOrder(tree_node * root);
|
hegyi@88
|
77 |
|
hegyi@120
|
78 |
///From the given expression it creates expression given in polish form.
|
hegyi@117
|
79 |
|
hegyi@120
|
80 |
///First it substitutes variables and numbers in the given expression.
|
hegyi@120
|
81 |
///The substitutions will be one character long local variables.
|
hegyi@120
|
82 |
///The substituted-substitution pair is registrated in \ref ch2var.
|
hegyi@120
|
83 |
///After that it gives weights fo each character in substituted expression.
|
hegyi@120
|
84 |
///Weights are calculated according to the priority of operations in expression.
|
hegyi@120
|
85 |
///Then it creates tree (\ref tree_node) from the weighted string. (\ref weightedString2Tree)
|
hegyi@120
|
86 |
///\param to_polish the string to turn into polish_form
|
hegyi@120
|
87 |
///\param itisedge do we have to create an edgemap or a nodemap.
|
hegyi@120
|
88 |
///It is important, because variables are maps and if expression
|
hegyi@120
|
89 |
///citates a map that does not exists the expression is not valid.
|
hegyi@120
|
90 |
///But to determine, whether the map exists we have to know where
|
hegyi@120
|
91 |
///to search for it. And of course for a new edgemap only edgemaps can be serve with values.
|
hegyi@120
|
92 |
std::string string2Polishform(std::string to_polish, bool itisedge);
|
hegyi@120
|
93 |
|
hegyi@120
|
94 |
///Returns whether a string can be used as value in an expression.
|
hegyi@120
|
95 |
|
hegyi@120
|
96 |
///The given string has to be either a mapname or a number. If it is a mapname
|
hegyi@120
|
97 |
///we have to know whether it is an edgemap or a nodemap.
|
hegyi@120
|
98 |
///\param variable the string about the function has to determine whether it is usable in expressions
|
hegyi@120
|
99 |
///\param itisedge should the mapname be between edgemaps, or nodemaps
|
hegyi@120
|
100 |
bool validVariable(std::string variable, bool itisedge);
|
hegyi@120
|
101 |
|
hegyi@120
|
102 |
///Deletes the whole tree created for translating string to polishform.
|
hegyi@120
|
103 |
|
hegyi@120
|
104 |
///\param root
|
hegyi@120
|
105 |
///root of the tree
|
hegyi@120
|
106 |
void deleteTree(tree_node * root);
|
hegyi@120
|
107 |
|
hegyi@120
|
108 |
///Dictionary of substitutions in expression.
|
hegyi@120
|
109 |
|
hegyi@120
|
110 |
///Variables and numbers are substituted with one character long variables in expressions.
|
hegyi@120
|
111 |
///This is the dictionary.
|
hegyi@88
|
112 |
std::map<char, std::string> ch2var;
|
hegyi@88
|
113 |
|
hegyi@120
|
114 |
///Entry which gives us the name of new map.
|
hegyi@120
|
115 |
Gtk::Entry name;
|
hegyi@42
|
116 |
|
hegyi@120
|
117 |
///Entry which gives us the initial values of elements of new map.
|
hegyi@120
|
118 |
|
hegyi@120
|
119 |
///Initial value can be a number or an expression after that the
|
hegyi@120
|
120 |
///initial value for each map element can be calculated.
|
hegyi@120
|
121 |
Gtk::Entry default_value;
|
hegyi@120
|
122 |
|
hegyi@120
|
123 |
///GTK Designing object.
|
hegyi@42
|
124 |
Gtk::Table * table;
|
hegyi@120
|
125 |
|
hegyi@120
|
126 |
///Information holder in window.
|
hegyi@42
|
127 |
Gtk::Label * label;
|
hegyi@42
|
128 |
|
hegyi@120
|
129 |
///If selected, nodemap will be created.
|
hegyi@120
|
130 |
Gtk::RadioButton node;
|
hegyi@120
|
131 |
|
hegyi@120
|
132 |
///If selected, edgemap will be created.
|
hegyi@120
|
133 |
Gtk::RadioButton edge;
|
hegyi@42
|
134 |
};
|
hegyi@42
|
135 |
|
hegyi@42
|
136 |
#endif //NEWMAPWIN_H
|