Skip to content
Snippets Groups Projects
Unverified Commit 7d744d1c authored by boeschf's avatar boeschf Committed by GitHub
Browse files

fix compiler warnings (#2006)

parent 62dbad7e
No related branches found
No related tags found
No related merge requests found
...@@ -111,7 +111,7 @@ void ProcedureInliner::visit(BinaryExpression* e) { ...@@ -111,7 +111,7 @@ void ProcedureInliner::visit(BinaryExpression* e) {
void ProcedureInliner::visit(AssignmentExpression* e) { void ProcedureInliner::visit(AssignmentExpression* e) {
// If we're inlining a call, take care of variable renaming // If we're inlining a call, take care of variable renaming
if (state_ == state::Running) { if (state_ == state::Running) {
if (auto lhs = e->lhs()->is_identifier()) { if (e->lhs()->is_identifier()) {
e->replace_lhs(substitute(e->lhs(), local_arg_map_)); e->replace_lhs(substitute(e->lhs(), local_arg_map_));
} }
if (e->rhs()->is_identifier()) { if (e->rhs()->is_identifier()) {
......
...@@ -169,12 +169,13 @@ TEST(segment_tree, split) { ...@@ -169,12 +169,13 @@ TEST(segment_tree, split) {
EXPECT_THROW(arb::split_at(t, arb::mnpos), arb::arbor_exception); EXPECT_THROW(arb::split_at(t, arb::mnpos), arb::arbor_exception);
EXPECT_THROW(arb::split_at(t, 1), arb::arbor_exception); EXPECT_THROW(arb::split_at(t, 1), arb::arbor_exception);
} }
// gnarly tree /* gnarly tree
// (npos) - 0 - 1 - 4 ** (npos) - 0 - 1 - 4
// \ ** \
// 2 - 3 ** 2 - 3
// \ ** \
// 5 ** 5
*/
// NB: Splitting _will_ re-order segments. So we have to be careful when // NB: Splitting _will_ re-order segments. So we have to be careful when
// building values to compare against. // building values to compare against.
{ {
...@@ -275,12 +276,13 @@ TEST(segment_tree, join) { ...@@ -275,12 +276,13 @@ TEST(segment_tree, join) {
EXPECT_THROW(arb::split_at(t, arb::mnpos), arb::arbor_exception); EXPECT_THROW(arb::split_at(t, arb::mnpos), arb::arbor_exception);
EXPECT_THROW(arb::split_at(t, 1), arb::arbor_exception); EXPECT_THROW(arb::split_at(t, 1), arb::arbor_exception);
} }
// gnarly tree /* gnarly tree
// (npos) - 0 - 1 - 4 ** (npos) - 0 - 1 - 4
// \ ** \
// 2 - 3 ** 2 - 3
// \ ** \
// 5 ** 5
*/
// NB: Joining _will_ re-order segments. So we have to be careful when // NB: Joining _will_ re-order segments. So we have to be careful when
// building values to compare against. // building values to compare against.
{ {
......
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment