summaryrefslogtreecommitdiff
path: root/src/squelch/automatizer.cc
blob: c3c52b1b1134cf458685a1f2827cc9edcd7027ba (plain)
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
#include "tome/squelch/automatizer_fwd.hpp"
#include "tome/squelch/automatizer.hpp"

#include "tome/squelch/rule.hpp"
#include "tome/squelch/cursor.hpp"
#include "tome/squelch/tree_printer.hpp"
#include "util.hpp"
#include "z-term.h"

namespace squelch {

/**
 * Parse rules from JSON array
 */
static std::vector< std::shared_ptr < Rule > > parse_rules(json_t *rules_j)
{
	std::vector< std::shared_ptr < Rule > > rules;

	if (!json_is_array(rules_j))
	{
		msg_format("Error 'rules' is not an array");
		return rules;
	}

	for (size_t i = 0; i < json_array_size(rules_j); i++)
	{
		json_t *rule_j = json_array_get(rules_j, i);
		auto rule = Rule::parse_rule(rule_j);
		if (rule)
		{
			rules.push_back(rule);
		}
	}

	return rules;
}

//----------------------------------------------------------
// Automatizer
//----------------------------------------------------------

int Automatizer::append_rule(std::shared_ptr< Rule > rule)
{
	m_rules.push_back(rule);
	return m_rules.size() - 1;
}

void Automatizer::swap_rules(int i, int j)
{
	swap(m_rules.at(i), m_rules.at(j));
}

bool Automatizer::apply_rules(object_type *o_ptr, int item_idx) const
{
	for (auto rule : m_rules)
	{
		if (rule->apply_rule(o_ptr, item_idx))
		{
			return true;
		}
	}

	return false;
}

std::shared_ptr<json_t> Automatizer::to_json() const
{
	auto rules_json = std::shared_ptr<json_t>(json_array(), &json_decref);

	for (auto rule : m_rules)
	{
		json_array_append_new(rules_json.get(), rule->to_json());
	}

	return rules_json;
}

void Automatizer::load_json(json_t *json)
{
	// Go through all the found rules
	auto rules = parse_rules(json);

	// Load rule
	for (auto rule : rules)
	{
		append_rule(rule);
	}
}

int Automatizer::remove_current_selection()
{
	assert(!m_rules.empty());

	// Previously selected rule
	int prev_selected_rule = m_selected_rule;
	int new_selected_rule;

	// If the cursor is at the top level then we want to delete
	// the rule itself
	if (m_cursor->size() < 1)
	{
		// Remove rule
		m_rules.erase(m_rules.begin() + m_selected_rule);
		// Select previous
		new_selected_rule = prev_selected_rule - 1;
	}
	else
	{
		// Delete the currently selected condition in rule.
		m_rules.at(m_selected_rule)->delete_selected_condition(m_cursor.get());
		// Keep selection
		new_selected_rule = m_selected_rule;
	}

	// Do we need to adjust to select a different rule?
	if ((prev_selected_rule != new_selected_rule) && (new_selected_rule >= 0))
	{
		select_rule(new_selected_rule);
	}

	// Return the selected rule.
	return m_selected_rule;
}

void Automatizer::reset_view()
{
	// Clear cursor
	m_cursor->clear();

	// Empty rules?
	if (m_rules.empty())
	{
		return;
	}

	// Reset scroll position
	m_tree_printer->reset_scroll();

	// Put the top-level condition into cursor
	auto condition = m_rules.at(m_selected_rule)->get_condition();
	if (condition)
	{
		m_cursor->push(condition.get());
	}
}

void Automatizer::show_current() const
{
	if (m_rules.empty())
	{
		return;
	}

	m_tree_printer->reset();
	m_rules.at(m_selected_rule)->write_tree(
		m_tree_printer.get(),
		m_cursor.get());
}

void Automatizer::scroll_up()
{
	m_tree_printer->scroll_up();
}

void Automatizer::scroll_down()
{
	m_tree_printer->scroll_down();
}

void Automatizer::scroll_left()
{
	m_tree_printer->scroll_left();
}

void Automatizer::scroll_right()
{
	m_tree_printer->scroll_right();
}

void Automatizer::move_up()
{
	m_cursor->move_up();
}

void Automatizer::move_down()
{
	m_cursor->move_down();
}

void Automatizer::move_left()
{
	m_cursor->move_left();
}

void Automatizer::move_right()
{
	m_cursor->move_right();
}

void Automatizer::add_new_condition(std::function<std::shared_ptr<Condition> ()> factory)
{
	m_rules.at(m_selected_rule)->add_new_condition(
		m_cursor.get(),
		factory);
}

void Automatizer::get_rule_names(std::vector<const char *> *names) const
{
	names->resize(m_rules.size());
	for (size_t i = 0; i < m_rules.size(); i++)
	{
		(*names)[i] = m_rules.at(i)->get_name();
	}
}

int Automatizer::rules_count() const
{
	return m_rules.size();
}

int Automatizer::rules_begin() const
{
	return m_begin;
}

void Automatizer::select_rule(int selected_rule)
{
	m_selected_rule = selected_rule;

	int wid, hgt;
	Term_get_size(&wid, &hgt);

	// Adjust selection to conform to bounds.
	{
		int rules_size = m_rules.size(); // Convert to int to avoid warnings

		if (m_selected_rule < 0)
		{
			m_selected_rule = rules_size - 1;
			m_begin = m_selected_rule - hgt + 3;
			if (m_begin < 0)
			{
				m_begin = 0;
			}
		}

		if (m_selected_rule < m_begin)
		{
			m_begin = m_selected_rule;
		}

		if (m_selected_rule >= rules_size)
		{
			m_selected_rule = 0;
			m_begin = 0;
		}

		if (m_selected_rule >= m_begin + hgt - 2)
		{
			m_begin++;
		}
	}

	// Adjust tree printer and cursor.
	reset_view();
}

int Automatizer::selected_rule() const
{
	return m_selected_rule;
}

std::shared_ptr<Rule> Automatizer::current_rule()
{
	return m_rules.at(m_selected_rule);
}

} // namespace