mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-07-24 13:18:55 +00:00
Code Activity

Use const refs to reduce copying.

Browse source 
These are things that have been found by `clang-tidy`.
This commit is contained in:
Bruce Mitchener 2018-01-30 21:43:56 +07:00
parent 5a16d3ef7f
commit 177414c0ee
28 changed files with 62 additions and 62 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/duality/duality.h
View file

@ -66,7 +66,7 @@ namespace Duality {
bool is_variable(const Term &t);
FuncDecl SuffixFuncDecl(Term t, int n);
FuncDecl SuffixFuncDecl(const Term &t, int n);
Term SubstRecHide(hash_map<ast, Term> &memo, const Term &t, int number);

4
src/duality/duality_rpfp.cpp
View file

@ -2157,7 +2157,7 @@ namespace Duality {
std::vector<Term> la_pos_vars;
bool fixing;
void IndexLAcoeff(const Term &coeff1, const Term &coeff2, Term t, int id) {
void IndexLAcoeff(const Term &coeff1, const Term &coeff2, const Term &t, int id) {
Term coeff = coeff1 * coeff2;
coeff = coeff.simplify();
Term is_pos = (coeff >= ctx.int_val(0));
@ -3303,7 +3303,7 @@ namespace Duality {
// This returns a new FuncDel with same sort as top-level function
// of term t, but with numeric suffix appended to name.
Z3User::FuncDecl Z3User::SuffixFuncDecl(Term t, int n)
Z3User::FuncDecl Z3User::SuffixFuncDecl(const Term &t, int n)
{
std::string name = t.decl().name().str() + "_" + string_of_int(n);
std::vector<sort> sorts;

2
src/duality/duality_solver.cpp
View file

@ -107,7 +107,7 @@ namespace Duality {
struct InternalError {
std::string msg;
InternalError(const std::string _msg)
InternalError(const std::string & _msg)
: msg(_msg) {}
};

16
src/duality/duality_wrapper.h
View file

@ -191,7 +191,7 @@ namespace Duality {
sort int_sort();
sort real_sort();
sort bv_sort(unsigned sz);
sort array_sort(sort d, sort r);
sort array_sort(const sort & d, const sort & r);
func_decl function(symbol const & name, unsigned arity, sort const * domain, sort const & range);
func_decl function(char const * name, unsigned arity, sort const * domain, sort const & range);
@ -763,11 +763,11 @@ namespace Duality {
unsigned size() const;
func_decl operator[](unsigned i) const;
expr get_const_interp(func_decl f) const {
expr get_const_interp(const func_decl & f) const {
return ctx().cook(m_model->get_const_interp(to_func_decl(f.raw())));
}
func_interp get_func_interp(func_decl f) const {
func_interp get_func_interp(const func_decl & f) const {
return func_interp(ctx(),m_model->get_func_interp(to_func_decl(f.raw())));
}
@ -1169,7 +1169,7 @@ namespace Duality {
::sort *s = m().mk_sort(m_arith_fid, REAL_SORT);
return sort(*this, s);
}
inline sort context::array_sort(sort d, sort r) {
inline sort context::array_sort(const sort & d, const sort & r) {
parameter params[2] = { parameter(d), parameter(to_sort(r)) };
::sort * s = m().mk_sort(m_array_fid, ARRAY_SORT, 2, params);
return sort(*this, s);
@ -1274,11 +1274,11 @@ namespace Duality {
class TermTree {
public:
TermTree(expr _term){
TermTree(const expr &_term){
term = _term;
}
TermTree(expr _term, const std::vector<TermTree *> &_children){
TermTree(const expr &_term, const std::vector<TermTree *> &_children){
term = _term;
children = _children;
}
@ -1302,9 +1302,9 @@ namespace Duality {
return num;
}
inline void setTerm(expr t){term = t;}
inline void setTerm(const expr &t){term = t;}
inline void addTerm(expr t){terms.push_back(t);}
inline void addTerm(const expr &t){terms.push_back(t);}
inline void setChildren(const std::vector<TermTree *> & _children){
children = _children;