1#ifndef INCLUDE_INJA_RENDERER_HPP_
2#define INCLUDE_INJA_RENDERER_HPP_
11#include "exceptions.hpp"
13#include "template.hpp"
22 using Op = FunctionStorage::Operation;
25 const TemplateStorage& template_storage;
29 size_t current_level {0};
30 std::vector<const Template*> template_stack;
31 std::vector<const BlockStatementNode*> block_statement_stack;
33 const json* data_input;
34 std::ostream* output_stream;
37 json* current_loop_data = &additional_data[
"loop"];
39 std::vector<std::shared_ptr<json>> data_tmp_stack;
40 std::stack<const json*> data_eval_stack;
41 std::stack<const DataNode*> not_found_stack;
43 bool break_rendering {
false};
45 static bool truthy(
const json* data) {
46 if (data->is_boolean()) {
47 return data->get<
bool>();
48 }
else if (data->is_number()) {
50 }
else if (data->is_null()) {
53 return !data->empty();
56 void print_data(
const std::shared_ptr<json> value) {
57 if (value->is_string()) {
58 *output_stream << value->get_ref<
const json::string_t&>();
59 }
else if (value->is_number_integer()) {
60 *output_stream << value->get<
const json::number_integer_t>();
61 }
else if (value->is_null()) {
63 *output_stream << value->dump();
67 const std::shared_ptr<json> eval_expression_list(
const ExpressionListNode& expression_list) {
68 if (!expression_list.root) {
69 throw_renderer_error(
"empty expression", expression_list);
72 expression_list.root->accept(*
this);
74 if (data_eval_stack.empty()) {
75 throw_renderer_error(
"empty expression", expression_list);
76 }
else if (data_eval_stack.size() != 1) {
77 throw_renderer_error(
"malformed expression", expression_list);
80 const auto result = data_eval_stack.top();
81 data_eval_stack.pop();
84 if (not_found_stack.empty()) {
85 throw_renderer_error(
"expression could not be evaluated", expression_list);
88 auto node = not_found_stack.top();
89 not_found_stack.pop();
91 throw_renderer_error(
"variable '" +
static_cast<std::string
>(node->name) +
"' not found", *node);
93 return std::make_shared<json>(*result);
96 void throw_renderer_error(
const std::string& message,
const AstNode& node) {
97 SourceLocation loc = get_source_location(current_template->content, node.pos);
101 void make_result(
const json&& result) {
102 auto result_ptr = std::make_shared<json>(result);
103 data_tmp_stack.push_back(result_ptr);
104 data_eval_stack.push(result_ptr.get());
107 template <
size_t N,
size_t N_start = 0,
bool throw_not_found = true> std::array<const json*, N> get_arguments(
const FunctionNode& node) {
108 if (node.arguments.size() < N_start + N) {
109 throw_renderer_error(
"function needs " + std::to_string(N_start + N) +
" variables, but has only found " + std::to_string(node.arguments.size()), node);
112 for (
size_t i = N_start; i < N_start + N; i += 1) {
113 node.arguments[i]->accept(*
this);
116 if (data_eval_stack.size() < N) {
117 throw_renderer_error(
"function needs " + std::to_string(N) +
" variables, but has only found " + std::to_string(data_eval_stack.size()), node);
120 std::array<const json*, N> result;
121 for (
size_t i = 0; i < N; i += 1) {
122 result[N - i - 1] = data_eval_stack.top();
123 data_eval_stack.pop();
125 if (!result[N - i - 1]) {
126 const auto data_node = not_found_stack.top();
127 not_found_stack.pop();
129 if (throw_not_found) {
130 throw_renderer_error(
"variable '" +
static_cast<std::string
>(data_node->name) +
"' not found", *data_node);
137 template <
bool throw_not_found = true> Arguments get_argument_vector(
const FunctionNode& node) {
138 const size_t N = node.arguments.size();
139 for (
auto a : node.arguments) {
143 if (data_eval_stack.size() < N) {
144 throw_renderer_error(
"function needs " + std::to_string(N) +
" variables, but has only found " + std::to_string(data_eval_stack.size()), node);
147 Arguments result {N};
148 for (
size_t i = 0; i < N; i += 1) {
149 result[N - i - 1] = data_eval_stack.top();
150 data_eval_stack.pop();
152 if (!result[N - i - 1]) {
153 const auto data_node = not_found_stack.top();
154 not_found_stack.pop();
156 if (throw_not_found) {
157 throw_renderer_error(
"variable '" +
static_cast<std::string
>(data_node->name) +
"' not found", *data_node);
165 for (
auto& n : node.nodes) {
168 if (break_rendering) {
175 output_stream->write(current_template->content.c_str() + node.pos, node.length);
181 data_eval_stack.push(&node.value);
185 if (additional_data.contains(node.ptr)) {
186 data_eval_stack.push(&(additional_data[node.ptr]));
187 }
else if (data_input->contains(node.ptr)) {
188 data_eval_stack.push(&(*data_input)[node.ptr]);
191 const auto function_data = function_storage.find_function(node.name, 0);
192 if (function_data.operation == FunctionStorage::Operation::Callback) {
193 Arguments empty_args {};
194 const auto value = std::make_shared<json>(function_data.callback(empty_args));
195 data_tmp_stack.push_back(value);
196 data_eval_stack.push(value.get());
198 data_eval_stack.push(
nullptr);
199 not_found_stack.emplace(&node);
205 switch (node.operation) {
207 const auto args = get_arguments<1>(node);
208 make_result(!truthy(args[0]));
211 make_result(truthy(get_arguments<1, 0>(node)[0]) && truthy(get_arguments<1, 1>(node)[0]));
214 make_result(truthy(get_arguments<1, 0>(node)[0]) || truthy(get_arguments<1, 1>(node)[0]));
217 const auto args = get_arguments<2>(node);
218 make_result(std::find(args[1]->begin(), args[1]->end(), *args[0]) != args[1]->end());
221 const auto args = get_arguments<2>(node);
222 make_result(*args[0] == *args[1]);
225 const auto args = get_arguments<2>(node);
226 make_result(*args[0] != *args[1]);
229 const auto args = get_arguments<2>(node);
230 make_result(*args[0] > *args[1]);
232 case Op::GreaterEqual: {
233 const auto args = get_arguments<2>(node);
234 make_result(*args[0] >= *args[1]);
237 const auto args = get_arguments<2>(node);
238 make_result(*args[0] < *args[1]);
240 case Op::LessEqual: {
241 const auto args = get_arguments<2>(node);
242 make_result(*args[0] <= *args[1]);
245 const auto args = get_arguments<2>(node);
246 if (args[0]->is_string() && args[1]->is_string()) {
247 make_result(args[0]->get_ref<const json::string_t&>() + args[1]->get_ref<const json::string_t&>());
248 }
else if (args[0]->is_number_integer() && args[1]->is_number_integer()) {
249 make_result(args[0]->get<const json::number_integer_t>() + args[1]->get<const json::number_integer_t>());
251 make_result(args[0]->get<const json::number_float_t>() + args[1]->get<const json::number_float_t>());
255 const auto args = get_arguments<2>(node);
256 if (args[0]->is_number_integer() && args[1]->is_number_integer()) {
257 make_result(args[0]->get<const json::number_integer_t>() - args[1]->get<const json::number_integer_t>());
259 make_result(args[0]->get<const json::number_float_t>() - args[1]->get<const json::number_float_t>());
262 case Op::Multiplication: {
263 const auto args = get_arguments<2>(node);
264 if (args[0]->is_number_integer() && args[1]->is_number_integer()) {
265 make_result(args[0]->get<const json::number_integer_t>() * args[1]->get<const json::number_integer_t>());
267 make_result(args[0]->get<const json::number_float_t>() * args[1]->get<const json::number_float_t>());
271 const auto args = get_arguments<2>(node);
272 if (args[1]->get<const json::number_float_t>() == 0) {
273 throw_renderer_error(
"division by zero", node);
275 make_result(args[0]->get<const json::number_float_t>() / args[1]->get<const json::number_float_t>());
278 const auto args = get_arguments<2>(node);
279 if (args[0]->is_number_integer() && args[1]->get<const json::number_integer_t>() >= 0) {
280 const auto result =
static_cast<json::number_integer_t
>(std::pow(args[0]->get<const json::number_integer_t>(), args[1]->get<const json::number_integer_t>()));
283 const auto result = std::pow(args[0]->get<const json::number_float_t>(), args[1]->get<const json::number_integer_t>());
288 const auto args = get_arguments<2>(node);
289 make_result(args[0]->get<const json::number_integer_t>() % args[1]->get<const json::number_integer_t>());
292 const auto container = get_arguments<1, 0, false>(node)[0];
293 node.arguments[1]->accept(*
this);
294 if (not_found_stack.empty()) {
295 throw_renderer_error(
"could not find element with given name", node);
297 const auto id_node = not_found_stack.top();
298 not_found_stack.pop();
299 data_eval_stack.pop();
300 data_eval_stack.push(&container->at(id_node->name));
303 const auto args = get_arguments<2>(node);
304 if (args[0]->is_object()) {
305 data_eval_stack.push(&args[0]->at(args[1]->get<std::string>()));
307 data_eval_stack.push(&args[0]->at(args[1]->get<int>()));
311 const auto test_arg = get_arguments<1, 0, false>(node)[0];
312 data_eval_stack.push(test_arg ? test_arg : get_arguments<1, 1>(node)[0]);
314 case Op::DivisibleBy: {
315 const auto args = get_arguments<2>(node);
316 const auto divisor = args[1]->get<
const json::number_integer_t>();
317 make_result((divisor != 0) && (args[0]->get<const json::number_integer_t>() % divisor == 0));
320 make_result(get_arguments<1>(node)[0]->get<const json::number_integer_t>() % 2 == 0);
323 auto&& name = get_arguments<1>(node)[0]->get_ref<
const json::string_t&>();
324 make_result(data_input->contains(json::json_pointer(DataNode::convert_dot_to_ptr(name))));
326 case Op::ExistsInObject: {
327 const auto args = get_arguments<2>(node);
328 auto&& name = args[1]->get_ref<
const json::string_t&>();
329 make_result(args[0]->find(name) != args[0]->end());
332 const auto result = &get_arguments<1>(node)[0]->front();
333 data_eval_stack.push(result);
336 make_result(std::stod(get_arguments<1>(node)[0]->get_ref<const json::string_t&>()));
339 make_result(std::stoi(get_arguments<1>(node)[0]->get_ref<const json::string_t&>()));
342 const auto result = &get_arguments<1>(node)[0]->back();
343 data_eval_stack.push(result);
346 const auto val = get_arguments<1>(node)[0];
347 if (val->is_string()) {
348 make_result(val->get_ref<
const json::string_t&>().length());
350 make_result(val->size());
354 auto result = get_arguments<1>(node)[0]->get<json::string_t>();
355 std::transform(result.begin(), result.end(), result.begin(), [](
char c) { return static_cast<char>(::tolower(c)); });
356 make_result(std::move(result));
359 const auto args = get_arguments<1>(node);
360 const auto result = std::max_element(args[0]->begin(), args[0]->end());
361 data_eval_stack.push(&(*result));
364 const auto args = get_arguments<1>(node);
365 const auto result = std::min_element(args[0]->begin(), args[0]->end());
366 data_eval_stack.push(&(*result));
369 make_result(get_arguments<1>(node)[0]->get<const json::number_integer_t>() % 2 != 0);
372 std::vector<int> result(get_arguments<1>(node)[0]->get<const json::number_integer_t>());
373 std::iota(result.begin(), result.end(), 0);
374 make_result(std::move(result));
377 const auto args = get_arguments<2>(node);
378 const int precision = args[1]->get<
const json::number_integer_t>();
379 const double result = std::round(args[0]->get<const json::number_float_t>() * std::pow(10.0, precision)) / std::pow(10.0, precision);
380 if (precision == 0) {
381 make_result(
int(result));
387 auto result_ptr = std::make_shared<json>(get_arguments<1>(node)[0]->get<std::vector<json>>());
388 std::sort(result_ptr->begin(), result_ptr->end());
389 data_tmp_stack.push_back(result_ptr);
390 data_eval_stack.push(result_ptr.get());
393 auto result = get_arguments<1>(node)[0]->get<json::string_t>();
394 std::transform(result.begin(), result.end(), result.begin(), [](
char c) { return static_cast<char>(::toupper(c)); });
395 make_result(std::move(result));
397 case Op::IsBoolean: {
398 make_result(get_arguments<1>(node)[0]->is_boolean());
401 make_result(get_arguments<1>(node)[0]->is_number());
403 case Op::IsInteger: {
404 make_result(get_arguments<1>(node)[0]->is_number_integer());
407 make_result(get_arguments<1>(node)[0]->is_number_float());
410 make_result(get_arguments<1>(node)[0]->is_object());
413 make_result(get_arguments<1>(node)[0]->is_array());
416 make_result(get_arguments<1>(node)[0]->is_string());
419 auto args = get_argument_vector(node);
420 make_result(node.callback(args));
423 const auto args = get_argument_vector(node);
424 const size_t old_level = current_level;
425 const size_t level_diff = (args.size() == 1) ? args[0]->get<int>() : 1;
426 const size_t level = current_level + level_diff;
428 if (block_statement_stack.empty()) {
429 throw_renderer_error(
"super() call is not within a block", node);
432 if (level < 1 || level > template_stack.size() - 1) {
433 throw_renderer_error(
"level of super() call does not match parent templates (between 1 and " + std::to_string(template_stack.size() - 1) +
")", node);
436 const auto current_block_statement = block_statement_stack.back();
437 const Template* new_template = template_stack.at(level);
438 const Template* old_template = current_template;
439 const auto block_it = new_template->block_storage.find(current_block_statement->name);
440 if (block_it != new_template->block_storage.end()) {
441 current_template = new_template;
442 current_level = level;
443 block_it->second->block.accept(*
this);
444 current_level = old_level;
445 current_template = old_template;
447 throw_renderer_error(
"could not find block with name '" + current_block_statement->name +
"'", node);
449 make_result(
nullptr);
452 const auto args = get_arguments<2>(node);
453 const auto separator = args[1]->get<json::string_t>();
454 std::ostringstream os;
456 for (
const auto& value : *args[0]) {
458 if (value.is_string()) {
459 os << value.get<std::string>();
465 make_result(os.str());
473 print_data(eval_expression_list(node));
481 const auto result = eval_expression_list(node.condition);
482 if (!result->is_array()) {
483 throw_renderer_error(
"object must be an array", node);
486 if (!current_loop_data->empty()) {
487 auto tmp = *current_loop_data;
488 (*current_loop_data)[
"parent"] = std::move(tmp);
492 (*current_loop_data)[
"is_first"] =
true;
493 (*current_loop_data)[
"is_last"] = (result->size() <= 1);
494 for (
auto it = result->begin(); it != result->end(); ++it) {
495 additional_data[
static_cast<std::string
>(node.value)] = *it;
497 (*current_loop_data)[
"index"] = index;
498 (*current_loop_data)[
"index1"] = index + 1;
500 (*current_loop_data)[
"is_first"] =
false;
502 if (index == result->size() - 1) {
503 (*current_loop_data)[
"is_last"] =
true;
506 node.body.accept(*
this);
510 additional_data[
static_cast<std::string
>(node.value)].clear();
511 if (!(*current_loop_data)[
"parent"].empty()) {
512 const auto tmp = (*current_loop_data)[
"parent"];
513 *current_loop_data = std::move(tmp);
515 current_loop_data = &additional_data[
"loop"];
520 const auto result = eval_expression_list(node.condition);
521 if (!result->is_object()) {
522 throw_renderer_error(
"object must be an object", node);
525 if (!current_loop_data->empty()) {
526 (*current_loop_data)[
"parent"] = std::move(*current_loop_data);
530 (*current_loop_data)[
"is_first"] =
true;
531 (*current_loop_data)[
"is_last"] = (result->size() <= 1);
532 for (
auto it = result->begin(); it != result->end(); ++it) {
533 additional_data[
static_cast<std::string
>(node.key)] = it.key();
534 additional_data[
static_cast<std::string
>(node.value)] = it.value();
536 (*current_loop_data)[
"index"] = index;
537 (*current_loop_data)[
"index1"] = index + 1;
539 (*current_loop_data)[
"is_first"] =
false;
541 if (index == result->size() - 1) {
542 (*current_loop_data)[
"is_last"] =
true;
545 node.body.accept(*
this);
549 additional_data[
static_cast<std::string
>(node.key)].clear();
550 additional_data[
static_cast<std::string
>(node.value)].clear();
551 if (!(*current_loop_data)[
"parent"].empty()) {
552 *current_loop_data = std::move((*current_loop_data)[
"parent"]);
554 current_loop_data = &additional_data[
"loop"];
559 const auto result = eval_expression_list(node.condition);
560 if (truthy(result.get())) {
561 node.true_statement.accept(*
this);
562 }
else if (node.has_false_statement) {
563 node.false_statement.accept(*
this);
568 auto sub_renderer =
Renderer(config, template_storage, function_storage);
569 const auto included_template_it = template_storage.find(node.file);
570 if (included_template_it != template_storage.end()) {
571 sub_renderer.render_to(*output_stream, included_template_it->second, *data_input, &additional_data);
572 }
else if (config.throw_at_missing_includes) {
573 throw_renderer_error(
"include '" + node.file +
"' not found", node);
578 const auto included_template_it = template_storage.find(node.file);
579 if (included_template_it != template_storage.end()) {
580 const Template* parent_template = &included_template_it->second;
581 render_to(*output_stream, *parent_template, *data_input, &additional_data);
582 break_rendering =
true;
583 }
else if (config.throw_at_missing_includes) {
584 throw_renderer_error(
"extends '" + node.file +
"' not found", node);
589 const size_t old_level = current_level;
591 current_template = template_stack.front();
592 const auto block_it = current_template->block_storage.find(node.name);
593 if (block_it != current_template->block_storage.end()) {
594 block_statement_stack.emplace_back(&node);
595 block_it->second->block.accept(*
this);
596 block_statement_stack.pop_back();
598 current_level = old_level;
599 current_template = template_stack.back();
603 std::string ptr = node.key;
604 replace_substring(ptr,
".",
"/");
606 additional_data[json::json_pointer(ptr)] = *eval_expression_list(node.expression);
611 : config(config), template_storage(template_storage), function_storage(function_storage) {}
613 void render_to(std::ostream& os,
const Template& tmpl,
const json& data, json* loop_data =
nullptr) {
615 current_template = &tmpl;
618 additional_data = *loop_data;
619 current_loop_data = &additional_data[
"loop"];
622 template_stack.emplace_back(current_template);
623 current_template->root.accept(*
this);
625 data_tmp_stack.clear();
Base node class for the abstract syntax tree (AST).
Definition: node.hpp:56
Class for builtin functions and user-defined callbacks.
Definition: function_storage.hpp:16
Class for rendering a Template with data.
Definition: renderer.hpp:21
Class for render configuration.
Definition: config.hpp:75
Definition: exceptions.hpp:32
Definition: exceptions.hpp:9
The main inja Template.
Definition: template.hpp:17