|
34 | 34 | #include "executable/bytecode/instructions/Instructions.hpp" |
35 | 35 | #include "executable/bytecode/instructions/Jump.hpp" |
36 | 36 | #include "executable/bytecode/instructions/JumpForward.hpp" |
| 37 | +#include "executable/bytecode/instructions/JumpIfExceptionMatch.hpp" |
37 | 38 | #include "executable/bytecode/instructions/JumpIfFalse.hpp" |
38 | 39 | #include "executable/bytecode/instructions/JumpIfFalseOrPop.hpp" |
39 | | -#include "executable/bytecode/instructions/JumpIfExceptionMatch.hpp" |
40 | 40 | #include "executable/bytecode/instructions/JumpIfNotExceptionMatch.hpp" |
41 | 41 | #include "executable/bytecode/instructions/JumpIfTrue.hpp" |
42 | 42 | #include "executable/bytecode/instructions/JumpIfTrueOrPop.hpp" |
@@ -277,7 +277,7 @@ void BytecodeGenerator::store_name(const std::string &name, BytecodeValue *src) |
277 | 277 | ASSERT(visibility->second->type == VariablesResolver::Scope::Type::CLASS); |
278 | 278 | return *it; |
279 | 279 | } else if (auto it = visibility->second->symbol_map.get_visible_symbol(name); |
280 | | - it.has_value()) { |
| 280 | + it.has_value()) { |
281 | 281 | return *it; |
282 | 282 | } else { |
283 | 283 | TODO(); |
@@ -396,7 +396,7 @@ void BytecodeGenerator::delete_var(const std::string &name) |
396 | 396 | ASSERT(visibility->second->type == VariablesResolver::Scope::Type::CLASS); |
397 | 397 | return *it; |
398 | 398 | } else if (auto it = visibility->second->symbol_map.get_visible_symbol(name); |
399 | | - it.has_value()) { |
| 399 | + it.has_value()) { |
400 | 400 | return *it; |
401 | 401 | } else { |
402 | 402 | TODO(); |
@@ -699,7 +699,7 @@ Value *BytecodeGenerator::generate_function(const FunctionType *node) |
699 | 699 | idx++; |
700 | 700 | } |
701 | 701 | for (size_t idx = node->args()->argument_names().size(); |
702 | | - const auto &arg_name : node->args()->kw_only_argument_names()) { |
| 702 | + const auto &arg_name : node->args()->kw_only_argument_names()) { |
703 | 703 | varnames.push_back(arg_name); |
704 | 704 | ASSERT(symbol_map.get_visible_symbol(arg_name).has_value()); |
705 | 705 | if (std::find(cellvars.begin(), cellvars.end(), arg_name) != cellvars.end()) { |
@@ -950,7 +950,7 @@ Value *BytecodeGenerator::visit(const Lambda *node) |
950 | 950 | idx++; |
951 | 951 | } |
952 | 952 | for (size_t idx = node->args()->argument_names().size(); |
953 | | - const auto &arg_name : node->args()->kw_only_argument_names()) { |
| 953 | + const auto &arg_name : node->args()->kw_only_argument_names()) { |
954 | 954 | varnames.push_back(arg_name); |
955 | 955 | ASSERT(symbol_map.get_visible_symbol(arg_name).has_value()); |
956 | 956 | if (std::find(cellvars.begin(), cellvars.end(), arg_name) != cellvars.end()) { |
|
0 commit comments