mirror of
https://github.com/Z3Prover/z3
synced 2025-04-07 18:05:21 +00:00
Mark override methods appropriately. (#6207)
This commit is contained in:
parent
8e0d9bf42d
commit
1eb84fe4b9
|
@ -344,7 +344,7 @@ extern "C" {
|
|||
scoped_anum_vector const & m_as;
|
||||
public:
|
||||
vector_var2anum(scoped_anum_vector & as):m_as(as) {}
|
||||
virtual ~vector_var2anum() {}
|
||||
~vector_var2anum() override {}
|
||||
algebraic_numbers::manager & m() const override { return m_as.m(); }
|
||||
bool contains(polynomial::var x) const override { return static_cast<unsigned>(x) < m_as.size(); }
|
||||
algebraic_numbers::anum const & operator()(polynomial::var x) const override { return m_as.get(x); }
|
||||
|
|
|
@ -58,7 +58,7 @@ namespace api {
|
|||
solver_ref s;
|
||||
public:
|
||||
seq_expr_solver(ast_manager& m, params_ref const& p): m(m), p(p) {}
|
||||
lbool check_sat(expr* e) {
|
||||
lbool check_sat(expr* e) override {
|
||||
if (!s) {
|
||||
s = mk_smt_solver(m, p, symbol("ALL"));
|
||||
}
|
||||
|
|
|
@ -239,7 +239,7 @@ class fpa2bv_converter_wrapped : public fpa2bv_converter {
|
|||
fpa2bv_converter_wrapped(ast_manager & m, th_rewriter& rw) :
|
||||
fpa2bv_converter(m),
|
||||
m_rw(rw) {}
|
||||
virtual ~fpa2bv_converter_wrapped() {}
|
||||
~fpa2bv_converter_wrapped() override {}
|
||||
void mk_const(func_decl * f, expr_ref & result) override;
|
||||
void mk_rm_const(func_decl * f, expr_ref & result) override;
|
||||
app_ref wrap(expr * e);
|
||||
|
|
|
@ -49,7 +49,7 @@ protected:
|
|||
bool is_target(func_decl * decl, unsigned num_args, expr * const * args) override;
|
||||
public:
|
||||
ng_push_app_ite_cfg(ast_manager& m): push_app_ite_cfg(m) {}
|
||||
virtual ~ng_push_app_ite_cfg() {}
|
||||
~ng_push_app_ite_cfg() override {}
|
||||
};
|
||||
|
||||
struct push_app_ite_rw : public rewriter_tpl<push_app_ite_cfg> {
|
||||
|
|
|
@ -99,7 +99,7 @@ public:
|
|||
datatype_value_generator(value_generator& g, ast_manager& m):
|
||||
m(m), g(g), dt(m), m_sorts(m) {}
|
||||
|
||||
~datatype_value_generator() {
|
||||
~datatype_value_generator() override {
|
||||
for (auto& kv : m_values) dealloc(kv.m_value);
|
||||
}
|
||||
|
||||
|
|
|
@ -28,8 +28,8 @@ namespace nla {
|
|||
const monic& m_rm;
|
||||
|
||||
factorization_factory_imp(const monic& rm, const core& s);
|
||||
bool find_canonical_monic_of_vars(const svector<lpvar>& vars, unsigned & i) const;
|
||||
virtual bool canonize_sign(const monic& m) const;
|
||||
virtual bool canonize_sign(const factorization& m) const;
|
||||
bool find_canonical_monic_of_vars(const svector<lpvar>& vars, unsigned & i) const override;
|
||||
bool canonize_sign(const monic& m) const override;
|
||||
bool canonize_sign(const factorization& m) const override;
|
||||
};
|
||||
}
|
||||
|
|
|
@ -543,7 +543,7 @@ public:
|
|||
void get_model(std::unordered_map<var_index, mpq> & variable_values) const;
|
||||
void get_rid_of_inf_eps();
|
||||
void get_model_do_not_care_about_diff_vars(std::unordered_map<var_index, mpq> & variable_values) const;
|
||||
std::string get_variable_name(var_index vi) const;
|
||||
std::string get_variable_name(var_index vi) const override;
|
||||
void set_variable_name(var_index vi, std::string);
|
||||
inline unsigned number_of_vars() const { return m_var_register.size(); }
|
||||
inline bool is_base(unsigned j) const { return m_mpq_lar_core_solver.m_r_heading[j] >= 0; }
|
||||
|
@ -651,7 +651,7 @@ public:
|
|||
lar_solver();
|
||||
void set_track_pivoted_rows(bool v);
|
||||
bool get_track_pivoted_rows() const;
|
||||
virtual ~lar_solver();
|
||||
~lar_solver() override;
|
||||
const vector<impq>& r_x() const { return m_mpq_lar_core_solver.m_r_x; }
|
||||
bool column_is_int(unsigned j) const;
|
||||
inline bool column_value_is_int(unsigned j) const { return m_mpq_lar_core_solver.m_r_x[j].is_int(); }
|
||||
|
|
|
@ -149,7 +149,7 @@ public:
|
|||
}
|
||||
|
||||
|
||||
virtual ~lp_solver();
|
||||
~lp_solver() override;
|
||||
|
||||
void flip_costs();
|
||||
|
||||
|
|
|
@ -37,7 +37,7 @@ class subpaving_tactic : public tactic {
|
|||
e2v.mk_inv(m_inv);
|
||||
}
|
||||
|
||||
virtual ~display_var_proc() {}
|
||||
~display_var_proc() override {}
|
||||
|
||||
ast_manager & m() const { return m_inv.get_manager(); }
|
||||
|
||||
|
|
|
@ -32,7 +32,7 @@ namespace nlsat {
|
|||
bool_vector m_assigned;
|
||||
public:
|
||||
assignment(anum_manager & _m):m_values(_m) {}
|
||||
virtual ~assignment() {}
|
||||
~assignment() override {}
|
||||
anum_manager & am() const { return m_values.m(); }
|
||||
void swap(assignment & other) {
|
||||
m_values.swap(other.m_values);
|
||||
|
|
|
@ -189,7 +189,7 @@ namespace euf {
|
|||
|
||||
public:
|
||||
th_euf_solver(euf::solver& ctx, symbol const& name, euf::theory_id id);
|
||||
virtual ~th_euf_solver() {}
|
||||
~th_euf_solver() override {}
|
||||
virtual theory_var mk_var(enode* n);
|
||||
unsigned get_num_vars() const { return m_var2enode.size(); }
|
||||
euf::enode* e_internalize(expr* e);
|
||||
|
|
|
@ -464,7 +464,7 @@ namespace smt {
|
|||
m.limit().inc();
|
||||
}
|
||||
|
||||
virtual ~auf_solver() {
|
||||
~auf_solver() override {
|
||||
flush_nodes();
|
||||
reset_eval_cache();
|
||||
}
|
||||
|
|
|
@ -35,7 +35,7 @@ class tactic : public user_propagator::core {
|
|||
unsigned m_ref_count;
|
||||
public:
|
||||
tactic():m_ref_count(0) {}
|
||||
virtual ~tactic() {}
|
||||
~tactic() override {}
|
||||
|
||||
void inc_ref() { m_ref_count++; }
|
||||
void dec_ref() { SASSERT(m_ref_count > 0); m_ref_count--; if (m_ref_count == 0) dealloc(this); }
|
||||
|
|
|
@ -22,7 +22,7 @@ namespace datalog {
|
|||
public:
|
||||
collector_of_reduced(idx_set & accumulator) : m_acc(accumulator) {}
|
||||
|
||||
virtual void operator()(table_element * func_columns, const table_element * merged_func_columns) {
|
||||
void operator()(table_element * func_columns, const table_element * merged_func_columns) override {
|
||||
m_acc.insert(static_cast<unsigned>(merged_func_columns[0]));
|
||||
}
|
||||
};
|
||||
|
|
|
@ -243,7 +243,7 @@ public:
|
|||
m_value(m_vector.back()) {
|
||||
}
|
||||
|
||||
virtual void undo() {
|
||||
void undo() override {
|
||||
m_vector.push_back(m_value);
|
||||
}
|
||||
};
|
||||
|
|
Loading…
Reference in a new issue