mirror of
https://github.com/gbdev/rgbds.git
synced 2025-11-20 10:12:06 +00:00
Run clang-format on everything
This commit is contained in:
@@ -63,23 +63,23 @@ std::string const &FileStackNode::name() const {
|
|||||||
|
|
||||||
std::string const &FileStackNode::dump(uint32_t curLineNo) const {
|
std::string const &FileStackNode::dump(uint32_t curLineNo) const {
|
||||||
Visitor visitor{
|
Visitor visitor{
|
||||||
[this](std::vector<uint32_t> const &iters) -> std::string const & {
|
[this](std::vector<uint32_t> const &iters) -> std::string const & {
|
||||||
assert(this->parent); // REPT nodes use their parent's name
|
assert(this->parent); // REPT nodes use their parent's name
|
||||||
std::string const &lastName = this->parent->dump(this->lineNo);
|
std::string const &lastName = this->parent->dump(this->lineNo);
|
||||||
fprintf(stderr, " -> %s", lastName.c_str());
|
fprintf(stderr, " -> %s", lastName.c_str());
|
||||||
for (uint32_t i = iters.size(); i--;)
|
for (uint32_t i = iters.size(); i--;)
|
||||||
fprintf(stderr, "::REPT~%" PRIu32, iters[i]);
|
fprintf(stderr, "::REPT~%" PRIu32, iters[i]);
|
||||||
return lastName;
|
return lastName;
|
||||||
},
|
},
|
||||||
[this](std::string const &name) -> std::string const & {
|
[this](std::string const &name) -> std::string const & {
|
||||||
if (this->parent) {
|
if (this->parent) {
|
||||||
this->parent->dump(this->lineNo);
|
this->parent->dump(this->lineNo);
|
||||||
fprintf(stderr, " -> %s", name.c_str());
|
fprintf(stderr, " -> %s", name.c_str());
|
||||||
} else {
|
} else {
|
||||||
fputs(name.c_str(), stderr);
|
fputs(name.c_str(), stderr);
|
||||||
}
|
}
|
||||||
return name;
|
return name;
|
||||||
},
|
},
|
||||||
};
|
};
|
||||||
std::string const &topName = std::visit(visitor, data);
|
std::string const &topName = std::visit(visitor, data);
|
||||||
fprintf(stderr, "(%" PRIu32 ")", curLineNo);
|
fprintf(stderr, "(%" PRIu32 ")", curLineNo);
|
||||||
|
|||||||
@@ -67,26 +67,26 @@ std::string const &FileStackNode::name() const {
|
|||||||
|
|
||||||
std::string const &FileStackNode::dump(uint32_t curLineNo) const {
|
std::string const &FileStackNode::dump(uint32_t curLineNo) const {
|
||||||
Visitor visitor{
|
Visitor visitor{
|
||||||
[this](std::vector<uint32_t> const &iters) -> std::string const & {
|
[this](std::vector<uint32_t> const &iters) -> std::string const & {
|
||||||
assert(this->parent); // REPT nodes use their parent's name
|
assert(this->parent); // REPT nodes use their parent's name
|
||||||
std::string const &lastName = this->parent->dump(this->lineNo);
|
std::string const &lastName = this->parent->dump(this->lineNo);
|
||||||
fprintf(stderr, " -> %s", lastName.c_str());
|
fprintf(stderr, " -> %s", lastName.c_str());
|
||||||
for (uint32_t iter : iters)
|
for (uint32_t iter : iters)
|
||||||
fprintf(stderr, "::REPT~%" PRIu32, iter);
|
fprintf(stderr, "::REPT~%" PRIu32, iter);
|
||||||
return lastName;
|
return lastName;
|
||||||
},
|
},
|
||||||
[this](std::string const &name) -> std::string const & {
|
[this](std::string const &name) -> std::string const & {
|
||||||
if (this->parent) {
|
if (this->parent) {
|
||||||
this->parent->dump(this->lineNo);
|
this->parent->dump(this->lineNo);
|
||||||
fprintf(stderr, " -> %s", name.c_str());
|
fprintf(stderr, " -> %s", name.c_str());
|
||||||
} else {
|
} else {
|
||||||
fputs(name.c_str(), stderr);
|
fputs(name.c_str(), stderr);
|
||||||
}
|
}
|
||||||
return name;
|
return name;
|
||||||
},
|
},
|
||||||
[](std::monostate) -> std::string const & {
|
[](std::monostate) -> std::string const & {
|
||||||
unreachable_(); // This should not be possible
|
unreachable_(); // This should not be possible
|
||||||
},
|
},
|
||||||
};
|
};
|
||||||
std::string const &topName = std::visit(visitor, data);
|
std::string const &topName = std::visit(visitor, data);
|
||||||
fprintf(stderr, "(%" PRIu32 ")", curLineNo);
|
fprintf(stderr, "(%" PRIu32 ")", curLineNo);
|
||||||
|
|||||||
Reference in New Issue
Block a user