summaryrefslogtreecommitdiff
path: root/src/theory/quantifiers
diff options
context:
space:
mode:
authorAndres Noetzli <andres.noetzli@gmail.com>2020-02-27 09:03:12 -0800
committerGitHub <noreply@github.com>2020-02-27 09:03:12 -0800
commit0f75e689f02def2a726887bfd927f534ddc0305a (patch)
tree1cc745df05031b4d5665e8548f786f0ad1707605 /src/theory/quantifiers
parent87f3741db6ed41d3a776774bc1b60fd696585391 (diff)
Fix -Wshadow warnings in common headers (#3826)
Diffstat (limited to 'src/theory/quantifiers')
-rw-r--r--src/theory/quantifiers/cegqi/ceg_bv_instantiator.cpp16
1 files changed, 8 insertions, 8 deletions
diff --git a/src/theory/quantifiers/cegqi/ceg_bv_instantiator.cpp b/src/theory/quantifiers/cegqi/ceg_bv_instantiator.cpp
index 59e9aedcb..92f3e6d0d 100644
--- a/src/theory/quantifiers/cegqi/ceg_bv_instantiator.cpp
+++ b/src/theory/quantifiers/cegqi/ceg_bv_instantiator.cpp
@@ -619,14 +619,14 @@ struct SortBvExtractInterval
Assert(j.getKind() == BITVECTOR_EXTRACT);
BitVectorExtract ie = i.getOperator().getConst<BitVectorExtract>();
BitVectorExtract je = j.getOperator().getConst<BitVectorExtract>();
- if (ie.high > je.high)
+ if (ie.d_high > je.d_high)
{
return true;
}
- else if (ie.high == je.high)
+ else if (ie.d_high == je.d_high)
{
- Assert(ie.low != je.low);
- return ie.low > je.low;
+ Assert(ie.d_low != je.d_low);
+ return ie.d_low > je.d_low;
}
return false;
}
@@ -675,15 +675,15 @@ void BvInstantiatorPreprocess::registerCounterexampleLemma(
Trace("cegqi-bv-pp") << " " << i << " : " << curr_vec[i] << std::endl;
BitVectorExtract e =
curr_vec[i].getOperator().getConst<BitVectorExtract>();
- if (std::find(boundaries.begin(), boundaries.end(), e.high + 1)
+ if (std::find(boundaries.begin(), boundaries.end(), e.d_high + 1)
== boundaries.end())
{
- boundaries.push_back(e.high + 1);
+ boundaries.push_back(e.d_high + 1);
}
- if (std::find(boundaries.begin(), boundaries.end(), e.low)
+ if (std::find(boundaries.begin(), boundaries.end(), e.d_low)
== boundaries.end())
{
- boundaries.push_back(e.low);
+ boundaries.push_back(e.d_low);
}
}
std::sort(boundaries.rbegin(), boundaries.rend());
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback