19 #include "formula/callable_objects.hpp"
27 #include <boost/algorithm/string.hpp>
28 #include <boost/math/constants/constants.hpp>
34 using namespace boost::math::constants;
37 #define DBG_NG LOG_STREAM(debug, log_engine)
39 #define LOG_SF LOG_STREAM(info, log_scripting_formula)
40 #define WRN_SF LOG_STREAM(warn, log_scripting_formula)
41 #define ERR_SF LOG_STREAM(err, log_scripting_formula)
53 call_stack_manager::call_stack_manager(
const std::string& str)
58 call_stack_manager::~call_stack_manager()
65 std::ostringstream res;
68 res <<
" " << frame <<
"\n";
75 std::string function_expression::str()
const
80 bool first_arg =
true;
97 std::shared_ptr<formula_debugger> fdbp;
98 bool need_wrapper =
false;
106 if(args().
size() == 1) {
108 return args()[0]->evaluate(variables, fdb);
119 variant var = args()[0]->evaluate(variables, fdb);
124 std::vector<variant> res;
125 for(std::size_t
i = 0;
i < inputs.size(); ++
i) {
127 res.emplace_back(input.
name);
135 for(std::size_t
n = 0;
n < args().size() - 1;
n += 2) {
136 if(args()[
n]->evaluate(variables, fdb).as_bool()) {
137 return args()[
n + 1]->evaluate(variables, fdb);
141 if((args().
size() % 2) != 0) {
142 return args().back()->evaluate(variables, fdb);
150 variant var = args()[0]->evaluate(variables, fdb);
152 for(std::size_t
n = 1;
n < args().size() - 1;
n += 2) {
153 variant val = args()[
n]->evaluate(variables, fdb);
156 return args()[
n + 1]->evaluate(variables, fdb);
160 if((args().
size() % 2) == 0) {
161 return args().back()->evaluate(variables, fdb);
169 const variant input = args()[0]->evaluate(variables, fdb);
172 return variant(
n >= 0 ?
n : -
n, variant::DECIMAL_VARIANT);
181 variant res = args()[0]->evaluate(variables, fdb);
187 res = *std::min_element(res.
begin(), res.
end());
190 for(std::size_t
n = 1;
n < args().size(); ++
n) {
191 variant v = args()[
n]->evaluate(variables, fdb);
198 v = *std::min_element(v.
begin(), v.
end());
211 variant res = args()[0]->evaluate(variables, fdb);
217 res = *std::max_element(res.
begin(), res.
end());
220 for(std::size_t
n = 1;
n < args().size(); ++
n) {
221 variant v = args()[
n]->evaluate(variables, fdb);
228 v = *std::max_element(v.
begin(), v.
end());
241 void display_float(
const map_location& location,
const std::string& text)
244 gd->float_label(location, text,
color_t(255, 0, 0));
251 const args_list& arguments = args();
252 const variant var0 = arguments[0]->evaluate(variables, fdb);
253 variant var1 = arguments[1]->evaluate(variables, fdb);
258 if(arguments.size() == 2) {
260 display_float(location, text);
263 const variant var2 = arguments[2]->evaluate(variables, fdb);
265 display_float(location, text);
272 std::string speaker =
"WFL";
275 if(args().
size() == 2) {
276 speaker = args()[0]->evaluate(variables, fdb).string_cast();
280 variant value = args()[i_value]->evaluate(variables, fdb);
283 LOG_SF << speaker <<
": " << str;
295 std::string speaker =
"WFL";
298 if(args().
size() == 2) {
299 speaker = args()[0]->evaluate(variables, fdb).string_cast();
303 const variant value = args()[i_value]->evaluate(variables, fdb);
304 const int run_count = 1000;
305 std::chrono::steady_clock::duration run_time;
307 for(
int i = 0;
i < run_count;
i++) {
308 const auto start = std::chrono::steady_clock::now();
309 args()[i_value]->evaluate(variables, fdb);
310 run_time += std::chrono::steady_clock::now() -
start;
314 auto average_ms = std::chrono::duration_cast<std::chrono::milliseconds>(run_time / run_count);
316 std::ostringstream str;
317 #ifdef __cpp_lib_format
318 str <<
"Evaluated in " << average_ms <<
" on average";
320 str <<
"Evaluated in " << average_ms.count() <<
" ms on average";
323 LOG_SF << speaker <<
": " << str.str();
335 const variant map = args()[0]->evaluate(variables, fdb);
341 const variant map = args()[0]->evaluate(variables, fdb);
347 const variant var = args()[0]->evaluate(variables, fdb);
349 std::vector<variant> tmp;
359 const variant var_1 = args()[0]->evaluate(variables, fdb);
361 std::map<variant, variant> tmp;
363 if(args().
size() == 2) {
364 const variant var_2 = args()[1]->evaluate(variables, fdb);
370 tmp[var_1[
i]] = var_2[
i];
375 tmp[kv->query_value(
"key")] = kv->query_value(
"value");
377 auto map_it = tmp.find(*it);
379 if(map_it == tmp.end()) {
382 map_it->second =
variant(map_it->second.as_int() + 1);
393 std::string result = args()[0]->evaluate(variables, fdb).as_string();
395 int offset = args()[1]->evaluate(variables, fdb).as_int();
397 offset += result.size();
403 if(
static_cast<std::size_t
>(offset) >= result.size()) {
408 if(args().
size() > 2) {
409 int size = args()[2]->evaluate(variables, fdb).as_int();
413 offset = std::max(0, offset -
size + 1);
419 return variant(result.substr(offset));
424 std::string result = args()[0]->evaluate(variables, fdb).as_string();
425 std::string replacement = args().back()->evaluate(variables, fdb).as_string();
427 int offset = args()[1]->evaluate(variables, fdb).as_int();
429 offset += result.size();
435 if(
static_cast<std::size_t
>(offset) >= result.size()) {
440 if(args().
size() > 3) {
441 int size = args()[2]->evaluate(variables, fdb).as_int();
445 offset = std::max(0, offset -
size + 1);
448 return variant(result.replace(offset,
size, replacement));
451 return variant(result.replace(offset, std::string::npos, replacement));
456 std::string result = args()[0]->evaluate(variables, fdb).as_string();
457 std::string needle = args()[1]->evaluate(variables, fdb).as_string();
458 std::string replacement = args().back()->evaluate(variables, fdb).as_string();
459 boost::replace_all(result, needle, replacement);
465 std::string str = args()[0]->evaluate(variables, fdb).as_string();
466 std::string prefix = args()[1]->evaluate(variables, fdb).as_string();
467 return variant(boost::starts_with(str, prefix));
472 std::string str = args()[0]->evaluate(variables, fdb).as_string();
473 std::string prefix = args()[1]->evaluate(variables, fdb).as_string();
474 return variant(boost::ends_with(str, prefix));
479 std::string result = args()[0]->evaluate(variables, fdb).as_string();
480 std::string
insert = args().back()->evaluate(variables, fdb).as_string();
482 int offset = args()[1]->evaluate(variables, fdb).as_int();
484 offset += result.size();
489 }
else if(
static_cast<std::size_t
>(offset) >= result.size()) {
498 return variant(args()[0]->evaluate(variables, fdb).as_string().length());
504 args()[0]->evaluate(variables, fdb).as_string(),
505 args()[1]->evaluate(variables, fdb).as_int()));
512 result += arg->evaluate(variables, fdb).string_cast();
520 std::string str = args()[0]->evaluate(variables, fdb).as_string();
521 std::transform(str.begin(), str.end(), str.begin(),
static_cast<int (*)(
int)
>(std::toupper));
527 std::string str = args()[0]->evaluate(variables, fdb).as_string();
528 std::transform(str.begin(), str.end(), str.begin(),
static_cast<int (*)(
int)
>(std::tolower));
534 const double angle = args()[0]->evaluate(variables, fdb).as_decimal() / 1000.0;
535 const double result = std::sin(angle * pi<double>() / 180.0);
536 return variant(result, variant::DECIMAL_VARIANT);
541 const double angle = args()[0]->evaluate(variables, fdb).as_decimal() / 1000.0;
542 const double result = std::cos(angle * pi<double>() / 180.0);
543 return variant(result, variant::DECIMAL_VARIANT);
548 const double angle = args()[0]->evaluate(variables, fdb).as_decimal() / 1000.0;
549 const double result = std::tan(angle * pi<double>() / 180.0);
550 if(std::isnan(result) || result <= std::numeric_limits<int>::min() || result >= std::numeric_limits<int>::max()) {
554 return variant(result, variant::DECIMAL_VARIANT);
559 const double num = args()[0]->evaluate(variables, fdb).as_decimal() / 1000.0;
560 const double result = std::asin(num) * 180.0 / pi<double>();
561 if(std::isnan(result)) {
565 return variant(result, variant::DECIMAL_VARIANT);
570 const double num = args()[0]->evaluate(variables, fdb).as_decimal() / 1000.0;
571 const double result = std::acos(num) * 180.0 / pi<double>();
572 if(std::isnan(result)) {
576 return variant(result, variant::DECIMAL_VARIANT);
581 if(args().
size() == 1) {
582 const double num = args()[0]->evaluate(variables, fdb).as_decimal() / 1000.0;
583 const double result = std::atan(num) * 180.0 / pi<double>();
584 return variant(result, variant::DECIMAL_VARIANT);
586 const double y = args()[0]->evaluate(variables, fdb).as_decimal() / 1000.0;
587 const double x = args()[1]->evaluate(variables, fdb).as_decimal() / 1000.0;
588 const double result = std::atan2(y, x) * 180.0 / pi<double>();
589 return variant(result, variant::DECIMAL_VARIANT);
595 const double num = args()[0]->evaluate(variables, fdb).as_decimal() / 1000.0;
596 const double result = std::sqrt(num);
597 if(std::isnan(result)) {
601 return variant(result, variant::DECIMAL_VARIANT);
606 const double num = args()[0]->evaluate(variables, fdb).as_decimal() / 1000.0;
607 const double result = num < 0 ? -std::pow(-num, 1.0 / 3.0) : std::pow(num, 1.0 / 3.0);
608 return variant(result, variant::DECIMAL_VARIANT);
613 const double base = args()[0]->evaluate(variables, fdb).as_decimal() / 1000.0;
614 const double root = args()[1]->evaluate(variables, fdb).as_decimal() / 1000.0;
615 const double result = base < 0 && std::fmod(root, 2) == 1 ? -std::pow(-base, 1.0 / root) : std::pow(base, 1.0 / root);
616 if(std::isnan(result)) {
620 return variant(result, variant::DECIMAL_VARIANT);
625 const double num = args()[0]->evaluate(variables, fdb).as_decimal() / 1000.0;
626 if(args().
size() == 1) {
627 const double result = std::log(num);
628 if(std::isnan(result)) {
632 return variant(result, variant::DECIMAL_VARIANT);
635 const double base = args()[1]->evaluate(variables, fdb).as_decimal() / 1000.0;
636 const double result = std::log(num) / std::log(base);
637 if(std::isnan(result)) {
641 return variant(result, variant::DECIMAL_VARIANT);
646 const double num = args()[0]->evaluate(variables, fdb).as_decimal() / 1000.0;
647 const double result = std::exp(num);
648 if(result == 0 || result >= std::numeric_limits<int>::max()) {
654 return variant(result, variant::DECIMAL_VARIANT);
659 return variant(pi<double>(), variant::DECIMAL_VARIANT);
664 const double x = args()[0]->evaluate(variables, fdb).as_decimal() / 1000.0;
665 const double y = args()[1]->evaluate(variables, fdb).as_decimal() / 1000.0;
666 return variant(std::hypot(x, y), variant::DECIMAL_VARIANT);
671 const variant value = args()[0]->evaluate(variables, fdb);
672 const variant list = args()[1]->evaluate(variables, fdb);
675 if(list[
i] == value) {
685 const variant items = args()[0]->evaluate(variables, fdb);
689 if(args().
size() == 2) {
700 const std::string
self = args()[1]->evaluate(variables, fdb).as_string();
703 self_callable.
add(
self, *it);
705 const variant val = args().back()->evaluate(
724 const int value = args()[0]->evaluate(variables, fdb).as_int() % 1000;
725 const double angle = 2.0 * pi<double>() * (
static_cast<double>(value) / 1000.0);
726 return variant(
static_cast<int>(std::sin(angle) * 1000.0));
731 const double lo = args()[0]->evaluate(variables,
add_debug_info(fdb, 0,
"lerp:lo")).as_decimal() / 1000.0;
732 const double hi = args()[1]->evaluate(variables,
add_debug_info(fdb, 1,
"lerp:hi")).as_decimal() / 1000.0;;
733 const double alpha = args()[2]->evaluate(variables,
add_debug_info(fdb, 2,
"lerp:alpha")).as_decimal() / 1000.0;;
734 return variant(
static_cast<int>((lo + alpha * (hi - lo)) * 1000.0), variant::DECIMAL_VARIANT);
739 const std::vector<variant> items = args()[0]->evaluate(variables, fdb).as_list();
740 if(items.empty())
return variant();
741 const double alpha = args()[1]->evaluate(variables, fdb).as_decimal() / 1000.0;
743 const double val_scaled = std::clamp(0.01 * alpha, 0.0, 1.0);
744 const int idx = int(std::nearbyint((items.size() - 1) * val_scaled));
750 const std::string name = args()[0]->evaluate(variables, fdb).as_string();
751 std::vector<color_t> colors;
752 if(name ==
"red_green_scale") {
754 }
else if(name ==
"red_green_scale_text") {
756 }
else if(name ==
"blue_white_scale") {
758 }
else if(name ==
"blue_white_scale_text") {
763 std::vector<variant> result;
764 result.reserve(colors.size());
765 for(
auto clr : colors) {
766 result.emplace_back(std::make_shared<color_callable>(clr));
795 bool operator()(
const variant& a,
const variant&
b)
const
799 return expr_->evaluate(*this).as_bool();
803 variant get_value(
const std::string& key)
const
807 }
else if(key ==
"b") {
827 variant list = args()[0]->evaluate(variables, fdb);
829 std::vector<variant> vars;
833 vars.push_back(list[
n]);
836 if(args().
size() == 1) {
837 std::sort(vars.begin(), vars.end());
839 std::sort(vars.begin(), vars.end(), variant_comparator(args()[1], variables));
847 const variant& arg = args()[0]->evaluate(variables, fdb);
850 std::string str = args()[0]->evaluate(variables, fdb).
as_string();
855 std::vector<variant> list = args()[0]->evaluate(variables, fdb).as_list();
866 std::string str = args()[0]->evaluate(variables, fdb).as_string();
867 std::string key = args()[1]->evaluate(variables, fdb).as_string();
869 return variant(str.find(key) != std::string::npos);
874 const std::string str = args()[0]->evaluate(variables, fdb).as_string();
875 const std::string key = args()[1]->evaluate(variables, fdb).as_string();
877 std::size_t pos = str.find(key);
878 return variant(
static_cast<int>(pos));
883 std::vector<variant> list_vars;
884 std::map<variant, variant> map_vars;
886 const variant items = args()[0]->evaluate(variables, fdb);
888 if(args().
size() == 2) {
894 map_vars[(*it).get_member(
"key")] = (*it).
get_member(
"value");
896 list_vars.push_back(*it);
902 const std::string
self = args()[1]->evaluate(variables, fdb).as_string();
905 self_callable.
add(
self, *it);
907 const variant val = args()[2]->evaluate(
912 map_vars[(*it).get_member(
"key")] = (*it).
get_member(
"value");
914 list_vars.push_back(*it);
929 const variant items = args()[0]->evaluate(variables, fdb);
931 if(args().
size() == 2) {
940 const std::string
self = args()[1]->evaluate(variables, fdb).as_string();
943 self_callable.
add(
self, *it);
945 const variant val = args().back()->evaluate(
959 std::vector<variant> list_vars;
960 std::map<variant, variant> map_vars;
961 const variant items = args()[0]->evaluate(variables, fdb);
963 if(args().
size() == 2) {
967 map_vars[(*it).get_member(
"key")] = val;
969 list_vars.push_back(val);
974 const std::string
self = args()[1]->evaluate(variables, fdb).as_string();
977 self_callable.
add(
self, *it);
979 const variant val = args().back()->evaluate(
983 map_vars[(*it).get_member(
"key")] = val;
985 list_vars.push_back(val);
999 const variant& items = args()[0]->evaluate(variables, fdb);
1002 for(; it != items.
end(); ++it) {
1010 std::vector<variant> result(items.
begin(), it);
1018 explicit indexer(std::size_t
i)
1023 variant operator()(
const variant& v)
const
1025 if(
i >= v.num_elements()) {
1038 bool operator()(
const variant& a,
const variant&
b)
const
1040 return a.num_elements() <
b.num_elements();
1044 std::vector<variant> get_input(
1045 const function_expression::args_list& args,
1046 const formula_callable& variables,
1047 formula_debugger* fdb)
1049 if(args.size() == 1) {
1050 const variant list = args[0]->evaluate(variables, fdb);
1051 return std::vector<variant>(list.begin(), list.end());
1053 std::vector<variant> input;
1054 input.reserve(args.size());
1057 input.push_back(
expr->evaluate(variables, fdb));
1067 const std::vector<variant> input = get_input(args(), variables, fdb);
1068 std::vector<variant>
output;
1072 std::size_t max_i = std::max_element(input.begin(), input.end(), comparator())->num_elements();
1075 for(std::size_t
i = 0;
i < max_i;
i++) {
1076 std::vector<variant> elem(input.size());
1078 output.emplace_back(elem);
1086 const variant items = args()[0]->evaluate(variables, fdb);
1087 variant initial = args().size() == 2 ?
variant() : args()[1]->evaluate(variables, fdb);
1095 if(res != initial) {
1100 for(; it != items.
end(); ++it) {
1101 self_callable.
add(
"a", res);
1102 self_callable.
add(
"b", *it);
1103 res = args().back()->evaluate(
1113 const variant items = args()[0]->evaluate(variables, fdb);
1115 if(items[0].is_list()) {
1116 std::vector<variant> tmp;
1118 if(args().
size() >= 2) {
1119 res = args()[1]->evaluate(variables, fdb);
1123 }
else if(items[0].
is_map()) {
1124 std::map<variant, variant> tmp;
1126 if(args().
size() >= 2) {
1127 res = args()[1]->evaluate(variables, fdb);
1132 if(args().
size() >= 2) {
1133 res = args()[1]->evaluate(variables, fdb);
1139 res = res + items[
n];
1147 const variant items = args()[0]->evaluate(variables, fdb);
1149 if(it == items.
end()) {
1153 if(args().
size() == 1) {
1157 const int n = items.
num_elements(), req = args()[1]->evaluate(variables, fdb).as_int();
1158 const int count = req < 0 ?
n - std::min(-req,
n) : std::min(req,
n);
1161 std::advance(end, count);
1163 std::vector<variant> res;
1164 std::copy(it, end, std::back_inserter(res));
1170 const variant items = args()[0]->evaluate(variables, fdb);
1172 if(it == items.
begin()) {
1176 if(args().
size() == 1) {
1180 const int n = items.
num_elements(), req = args()[1]->evaluate(variables, fdb).as_int();
1181 const int count = req < 0 ?
n - std::min(-req,
n) : std::min(req,
n);
1183 std::advance(it, -count);
1184 std::vector<variant> res;
1186 std::copy(it, items.
end(), std::back_inserter(res));
1192 const variant items = args()[0]->evaluate(variables, fdb);
1198 if(!args().empty()) {
1199 for(std::size_t
i = 0;
i < args().size(); ++
i) {
1200 args()[
i]->evaluate(variables, fdb);
1209 variant decimal = args()[0]->evaluate(variables, fdb);
1210 int d = decimal.as_decimal();
1212 if((
d >= 0) && (
d % 1000 != 0)) {
1223 variant decimal = args()[0]->evaluate(variables, fdb);
1224 int d = decimal.as_decimal();
1230 }
else if(
f <= -500) {
1241 variant decimal = args()[0]->evaluate(variables, fdb);
1242 int d = decimal.as_decimal();
1244 if((
d < 0) && (
d % 1000 != 0)) {
1255 variant decimal = args()[0]->evaluate(variables, fdb);
1256 int d = decimal.as_int();
1263 variant decimal = args()[0]->evaluate(variables, fdb);
1264 int d = decimal.as_decimal();
1267 return variant(
d, variant::DECIMAL_VARIANT);
1272 variant decimal = args()[0]->evaluate(variables, fdb);
1273 int d = decimal.as_decimal();
1284 variant decimal = args()[0]->evaluate(variables, fdb);
1285 int d = decimal.as_decimal();
1287 return variant(
d, variant::DECIMAL_VARIANT);
1293 args()[0]->evaluate(variables,
add_debug_info(fdb, 0,
"loc:x")).as_int(),
1300 return variant(std::make_shared<key_value_pair>(
1301 args()[0]->evaluate(variables,
add_debug_info(fdb, 0,
"pair:key")),
1302 args()[1]->evaluate(variables,
add_debug_info(fdb, 1,
"pair_value"))
1309 ->evaluate(variables,
add_debug_info(fdb, 0,
"distance_between:location_A"))
1314 ->evaluate(variables,
add_debug_info(fdb, 1,
"distance_between:location_B"))
1324 ->evaluate(variables,
add_debug_info(fdb, 0,
"adjacent_locs:location"))
1328 std::vector<variant> v;
1330 v.emplace_back(std::make_shared<location_callable>(adj));
1340 int range = args()[1]->evaluate(variables, fdb).as_int();
1347 return variant(std::make_shared<location_callable>(
loc));
1350 std::vector<map_location> res;
1354 std::vector<variant> v;
1355 v.reserve(res.size() + 1);
1356 v.emplace_back(std::make_shared<location_callable>(
loc));
1358 for(std::size_t
n = 0;
n != res.size(); ++
n) {
1359 v.emplace_back(std::make_shared<location_callable>(res[
n]));
1368 ->evaluate(variables,
add_debug_info(fdb, 0,
"are_adjacent:location_A"))
1373 ->evaluate(variables,
add_debug_info(fdb, 1,
"are_adjacent:location_B"))
1383 ->evaluate(variables,
add_debug_info(fdb, 0,
"relative_dir:location_A"))
1388 ->evaluate(variables,
add_debug_info(fdb, 1,
"relative_dir:location_B"))
1398 ->evaluate(variables,
add_debug_info(fdb, 0,
"direction_from:location"))
1402 const std::string dir_str =
1403 args()[1]->evaluate(variables,
add_debug_info(fdb, 1,
"direction_from:dir")).as_string();
1405 int n = args().size() == 3
1406 ? args()[2]->evaluate(variables,
add_debug_info(fdb, 2,
"direction_from:count")).as_int()
1415 ->evaluate(variables,
add_debug_info(fdb, 0,
"direction_from:center"))
1420 ->evaluate(variables,
add_debug_info(fdb, 1,
"direction_from:location"))
1424 int n = args().size() == 3
1425 ? args()[2]->evaluate(variables,
add_debug_info(fdb, 2,
"direction_from:count")).as_int()
1433 const variant& v = args()[0]->evaluate(variables, fdb);
1443 const variant main = args()[0]->evaluate(variables, fdb);
1446 return variant(std::make_shared<safe_call_callable>(
main, backup_formula));
1451 return variant(std::make_shared<set_var_callable>(
1452 args()[0]->evaluate(variables,
add_debug_info(fdb, 0,
"set_var:key")).as_string(),
1453 args()[1]->evaluate(variables,
add_debug_info(fdb, 1,
"set_var:value"))));
1458 variant key_value_pair::get_value(
const std::string& key)
const
1462 }
else if(key ==
"value") {
1471 add_input(inputs,
"key");
1472 add_input(inputs,
"value");
1475 void key_value_pair::serialize_to_string(std::string& str)
const
1478 str += key_.serialize_to_string();
1480 str +=
value_.serialize_to_string();
1484 formula_function_expression::formula_function_expression(
const std::string& name,
1488 const std::vector<std::string>& arg_names)
1490 , formula_(std::move(
formula))
1491 , precondition_(std::move(precondition))
1492 , arg_names_(arg_names)
1506 static std::string
indent;
1511 const auto begin_time = std::chrono::steady_clock::now();
1525 DBG_NG <<
"FAILED function precondition for function '" <<
formula_->str() <<
"' with arguments: ";
1528 DBG_NG <<
" arg " << (
n + 1) <<
": " <<
args()[
n]->evaluate(variables, fdb).to_debug_string();
1535 const auto taken = std::chrono::steady_clock::now() - begin_time;
1544 const std::vector<expression_ptr>& args)
const
1550 : parent(parent ? parent : get_builtins())
1560 const std::string& fn,
const std::vector<expression_ptr>& args)
const
1564 return i->second->generate_function_expression(args);
1579 std::set<std::string> res;
1581 res =
parent->get_function_names();
1595 if(functions_table.
empty()) {
1596 functions_table.
parent =
nullptr;
1598 using namespace builtins;
std::unique_ptr< PangoAttribute, void(*)(PangoAttribute *)> value_
void add_chat_message(const std::chrono::system_clock::time_point &time, const std::string &speaker, int side, const std::string &msg, events::chat_handler::MESSAGE_TYPE type, bool bell)
static game_display * get_singleton()
display_chat_manager & get_chat_manager()
action_function_symbol_table(const std::shared_ptr< function_symbol_table > &parent=nullptr)
const args_list & args() const
std::vector< expression_ptr > args_list
static std::shared_ptr< function_symbol_table > get_builtins()
expression_ptr create_function(const std::string &fn, const std::vector< expression_ptr > &args) const
function_symbol_table(const std::shared_ptr< function_symbol_table > &parent=nullptr)
void add_function(const std::string &name, formula_function_ptr &&fcn)
std::set< std::string > get_function_names() const
std::shared_ptr< function_symbol_table > parent
functions_map custom_formulas_
Iterator class for the variant.
int as_decimal() const
Returns variant's internal representation of decimal number: ie, 1.234 is represented as 1234.
variant_iterator begin() const
variant get_values() const
const_formula_callable_ptr as_callable() const
std::size_t num_elements() const
std::shared_ptr< T > convert_to() const
variant get_member(const std::string &name) const
const std::string & as_string() const
std::string string_cast() const
variant_iterator end() const
bool as_bool() const
Returns a boolean state of the variant value.
std::string type_string() const
Gets string name of the current value type.
std::string to_debug_string(bool verbose=false, formula_seen_stack *seen=nullptr) const
bool is_null() const
Functions to test the type of the internal value.
const formula_callable * fallback_
static lg::log_domain log_engine("engine")
static lg::log_domain log_scripting_formula("scripting/formula")
#define DEFINE_WFL_FUNCTION(name, min_args, max_args)
Helper macro to declare an associated class for a WFL function.
#define DECLARE_WFL_FUNCTION(name)
Declares a function name in the local function table functions_table.
void get_adjacent_tiles(const map_location &a, map_location *res)
Function which, given a location, will place all adjacent locations in res.
std::size_t distance_between(const map_location &a, const map_location &b)
Function which gives the number of hexes between two tiles (i.e.
bool tiles_adjacent(const map_location &a, const map_location &b)
Function which tells if two locations are adjacent.
static std::ostream & output()
Standard logging facilities (interface).
EXIT_STATUS start(bool clear_id, const std::string &filename, bool take_screenshot, const std::string &screenshot_filename)
Main interface for launching the editor from the title screen.
bool is_map(const std::string &filename)
Returns true if the file ends with the mapfile extension.
std::vector< color_t > red_green_scale_text
const std::vector< color_t > & tc_info(std::string_view name)
std::vector< color_t > blue_white_scale
std::vector< color_t > red_green_scale
std::vector< color_t > blue_white_scale_text
std::string & insert(std::string &str, const std::size_t pos, const std::string &insert)
Insert a UTF-8 string at the specified position.
std::size_t size(std::string_view str)
Length in characters of a UTF-8 string.
std::size_t index(std::string_view str, const std::size_t index)
Codepoint index corresponding to the nth character in a UTF-8 string.
auto * find(Container &container, const Value &value)
Convenience wrapper for using find on a container without needing to comare to end()
formula_debugger * add_debug_info(formula_debugger *fdb, int arg_number, const std::string &f_name)
std::vector< formula_input > formula_input_vector
std::shared_ptr< const formula > const_formula_ptr
std::shared_ptr< formula_expression > expression_ptr
static thread_local std::deque< std::string > call_stack
For printing error messages when WFL parsing or evaluation fails, this contains the names of the WFL ...
std::shared_ptr< function_expression > function_expression_ptr
std::shared_ptr< formula_function > formula_function_ptr
void get_tiles_in_radius(const map_location ¢er, const int radius, std::vector< map_location > &result)
Function that will add to result all locations within radius tiles of center (excluding center itself...
The basic class for representing 8-bit RGB or RGBA colour values.
Encapsulates the map of the game.
static std::string write_direction(direction dir)
map_location get_direction(direction dir, unsigned int n=1u) const
map_location rotate_right_around_center(const map_location ¢er, int k) const
direction get_relative_dir(const map_location &loc, map_location::RELATIVE_DIR_MODE mode) const
static direction parse_direction(const std::string &str)
static map_location::direction n
static map_location::direction s