mirror of
https://github.com/Z3Prover/z3
synced 2025-04-24 01:25:31 +00:00
remove a hundred implicit constructors/destructors
This commit is contained in:
parent
f8406623b4
commit
f1e0d5dc8a
55 changed files with 30 additions and 140 deletions
|
@ -63,7 +63,6 @@ namespace dimacs {
|
|||
unsigned m_node_id{ 0 };
|
||||
std::string m_name;
|
||||
unsigned_vector m_args;
|
||||
drat_record() {}
|
||||
};
|
||||
|
||||
struct drat_pp {
|
||||
|
@ -111,6 +110,3 @@ namespace dimacs {
|
|||
|
||||
};
|
||||
};
|
||||
|
||||
|
||||
|
||||
|
|
|
@ -52,7 +52,6 @@ namespace sat {
|
|||
|
||||
public:
|
||||
aig_finder(solver& s);
|
||||
~aig_finder() {}
|
||||
void set(std::function<void (literal head, literal_vector const& ands)> const& f) { m_on_aig = f; }
|
||||
void set(std::function<void (literal head, literal cond, literal th, literal el)> const& f) { m_on_if = f; }
|
||||
void operator()(clause_vector& clauses);
|
||||
|
|
|
@ -111,7 +111,6 @@ namespace sat {
|
|||
|
||||
public:
|
||||
anf_simplifier(solver& s) : s(s), m_eval_ts(0) {}
|
||||
~anf_simplifier() {}
|
||||
|
||||
void operator()();
|
||||
void set(config const& cfg) { m_config = cfg; }
|
||||
|
|
|
@ -97,8 +97,6 @@ namespace sat {
|
|||
memset(m_false, 0, sizeof(unsigned) * max_lits);
|
||||
}
|
||||
|
||||
~binspr() {}
|
||||
|
||||
void operator()();
|
||||
|
||||
void updt_params(params_ref const& p) {}
|
||||
|
|
|
@ -69,7 +69,6 @@ namespace sat {
|
|||
lut_finder(solver& s) : s(s), m_max_lut_size(5) {
|
||||
memset(m_masks, 0, sizeof(uint64_t)*7);
|
||||
}
|
||||
~lut_finder() {}
|
||||
|
||||
void set(std::function<void (uint64_t, bool_var_vector const&, bool_var)>& f) { m_on_lut = f; }
|
||||
|
||||
|
|
|
@ -115,7 +115,6 @@ namespace sat {
|
|||
|
||||
public:
|
||||
npn3_finder(solver& s);
|
||||
~npn3_finder() {}
|
||||
void set_on_mux(std::function<void(literal head, literal cond, literal th, literal el)> const& f) { m_on_mux = f; }
|
||||
void set_on_maj(std::function<void(literal head, literal a, literal b, literal c)> const& f) { m_on_maj = f; }
|
||||
void set_on_orand(std::function<void(literal head, literal a, literal b, literal c)> const& f) { m_on_orand = f; }
|
||||
|
|
|
@ -41,7 +41,6 @@ namespace sat {
|
|||
unsigned get_length(unsigned index) const { return m_vectors[index+1]; }
|
||||
unsigned const* get_ptr(unsigned index) const { return m_vectors.data() + index + 2; }
|
||||
public:
|
||||
vector_pool() {}
|
||||
void reserve(unsigned num_owners, unsigned sz);
|
||||
void begin_add_vector(unsigned owner, unsigned n);
|
||||
void end_add_vector();
|
||||
|
|
|
@ -31,9 +31,8 @@ namespace sat {
|
|||
class prob : public i_local_search {
|
||||
|
||||
struct clause_info {
|
||||
clause_info(): m_trues(0), m_num_trues(0) {}
|
||||
unsigned m_trues; // set of literals that are true
|
||||
unsigned m_num_trues; // size of true set
|
||||
unsigned m_trues = 0; // set of literals that are true
|
||||
unsigned m_num_trues = 0; // size of true set
|
||||
bool is_true() const { return m_num_trues > 0; }
|
||||
void add(literal lit) { ++m_num_trues; m_trues += lit.index(); }
|
||||
void del(literal lit) { SASSERT(m_num_trues > 0); --m_num_trues; m_trues -= lit.index(); }
|
||||
|
@ -129,8 +128,6 @@ namespace sat {
|
|||
void add(unsigned sz, literal const* c);
|
||||
|
||||
public:
|
||||
prob() {}
|
||||
|
||||
~prob() override;
|
||||
|
||||
lbool check(unsigned sz, literal const* assumptions, parallel* p) override;
|
||||
|
|
|
@ -62,7 +62,6 @@ namespace sat {
|
|||
|
||||
public:
|
||||
xor_finder(solver& s) : s(s), m_max_xor_size(5) { init_parity(); }
|
||||
~xor_finder() {}
|
||||
|
||||
void set(std::function<void (literal_vector const& lits)>& f) { m_on_xor = f; }
|
||||
|
||||
|
|
|
@ -54,7 +54,6 @@ namespace array {
|
|||
euf::enode_vector m_lambdas; // equivalent nodes that have beta reduction properties
|
||||
euf::enode_vector m_parent_lambdas; // parents that have beta reduction properties
|
||||
euf::enode_vector m_parent_selects; // parents that use array in select position
|
||||
var_data() {}
|
||||
};
|
||||
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue