mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-23 09:05:31 +00:00
Code Activity

Use const& to reduce copies.

Browse source
This commit is contained in:
Bruce Mitchener 2019-06-02 09:58:32 +07:00
parent 62de187d02
commit a12de12515
5 changed files with 6 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/ast/dl_decl_plugin.cpp
View file

@ -75,7 +75,7 @@ namespace datalog {
return nullptr;
}
sort* s = to_sort(parameters[i].get_ast());
sort_size sz1 = s->get_num_elements();
sort_size const& sz1 = s->get_num_elements();
if (sz1.is_finite()) {
r *= rational(sz1.size(),rational::ui64());
}

2
src/ast/pb_decl_plugin.cpp
View file

@ -70,7 +70,7 @@ func_decl * pb_decl_plugin::mk_func_decl(decl_kind k, unsigned num_parameters, p
}
else if (p.is_rational()) {
// HACK: ast pretty printer does not work with rationals.
rational r = p.get_rational();
rational const& r = p.get_rational();
if (r.is_int32()) {
params.push_back(parameter(r.get_int32()));
}

2
src/ast/rewriter/bv_bounds.cpp
View file

@ -590,7 +590,7 @@ bool bv_bounds::is_sat() {
}
struct interval_comp_t {
bool operator() (bv_bounds::interval i, bv_bounds::interval j) {
bool operator() (bv_bounds::interval const& i, bv_bounds::interval const& j) {
return (i.first < j.first);
}
} interval_comp;

2
src/ast/rewriter/pb2bv_rewriter.cpp
View file

@ -370,7 +370,7 @@ struct pb2bv_rewriter::imp {
rational m_min_cost;
vector<rational> m_base;
void create_basis(vector<rational> const& seq, rational carry_in, rational cost) {
void create_basis(vector<rational> const& seq, rational const& carry_in, rational const& cost) {
if (cost >= m_min_cost) {
return;
}