mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-06-25 07:13:41 +00:00
Code Activity

Merge pull request #2315 from waywardmonkeys/reduce-copies

Browse source 
Use const& to reduce copies.
This commit is contained in:
Nikolaj Bjorner 2019-06-02 05:04:21 +02:00 • committed by GitHub
commit 14923bad52
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
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; return nullptr;
} }
sort* s = to_sort(parameters[i].get_ast()); 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()) { if (sz1.is_finite()) {
r *= rational(sz1.size(),rational::ui64()); 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()) { else if (p.is_rational()) {
// HACK: ast pretty printer does not work with rationals. // HACK: ast pretty printer does not work with rationals.
rational r = p.get_rational(); rational const& r = p.get_rational();
if (r.is_int32()) { if (r.is_int32()) {
params.push_back(parameter(r.get_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 { 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); return (i.first < j.first);
} }
} interval_comp; } interval_comp;

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

@ -370,7 +370,7 @@ struct pb2bv_rewriter::imp {
rational m_min_cost; rational m_min_cost;
vector<rational> m_base; 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) { if (cost >= m_min_cost) {
return; return;
} }

4
src/math/automata/automaton.h
View file

@ -495,7 +495,7 @@ public:
moves const& get_moves_to(unsigned state) const { return m_delta_inv[state]; } moves const& get_moves_to(unsigned state) const { return m_delta_inv[state]; }
bool initial_state_is_source() const { return m_delta_inv[m_init].empty(); } bool initial_state_is_source() const { return m_delta_inv[m_init].empty(); }
bool is_final_state(unsigned s) const { return m_final_set.contains(s); } bool is_final_state(unsigned s) const { return m_final_set.contains(s); }
bool is_final_configuration(uint_set s) const { bool is_final_configuration(uint_set const& s) const {
for (unsigned i : s) { for (unsigned i : s) {
if (is_final_state(i)) if (is_final_state(i))
return true; return true;
@ -547,7 +547,7 @@ public:
void get_moves_from(unsigned state, moves& mvs, bool epsilon_closure = true) const { void get_moves_from(unsigned state, moves& mvs, bool epsilon_closure = true) const {
get_moves(state, m_delta, mvs, epsilon_closure); get_moves(state, m_delta, mvs, epsilon_closure);
} }
void get_moves_from_states(uint_set states, moves& mvs, bool epsilon_closure = true) const { void get_moves_from_states(uint_set const& states, moves& mvs, bool epsilon_closure = true) const {
for (unsigned i : states) { for (unsigned i : states) {
moves curr; moves curr;
get_moves(i, m_delta, curr, epsilon_closure); get_moves(i, m_delta, curr, epsilon_closure);