mirror of
https://github.com/Z3Prover/z3
synced 2025-04-08 02:15:19 +00:00
62 lines
1.9 KiB
C++
62 lines
1.9 KiB
C++
/*++
|
|
Copyright (c) 2012 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
nlsat_clause.h
|
|
|
|
Abstract:
|
|
|
|
Clauses used in the Nonlinear arithmetic satisfiability procedure.
|
|
|
|
Author:
|
|
|
|
Leonardo de Moura (leonardo) 2012-01-02.
|
|
|
|
Revision History:
|
|
|
|
--*/
|
|
#ifndef _NLSAT_CLAUSE_H_
|
|
#define _NLSAT_CLAUSE_H_
|
|
|
|
#include"nlsat_types.h"
|
|
#include"vector.h"
|
|
|
|
namespace nlsat {
|
|
|
|
class clause {
|
|
friend class solver;
|
|
unsigned m_id;
|
|
unsigned m_size;
|
|
unsigned m_capacity:31;
|
|
unsigned m_learned:1;
|
|
unsigned m_activity;
|
|
assumption_set m_assumptions;
|
|
literal m_lits[0];
|
|
static size_t get_obj_size(unsigned num_lits) { return sizeof(clause) + num_lits * sizeof(literal); }
|
|
size_t get_size() const { return get_obj_size(m_capacity); }
|
|
clause(unsigned id, unsigned sz, literal const * lits, bool learned, assumption_set as);
|
|
public:
|
|
unsigned size() const { return m_size; }
|
|
unsigned id() const { return m_id; }
|
|
literal & operator[](unsigned idx) { SASSERT(idx < m_size); return m_lits[idx]; }
|
|
literal const & operator[](unsigned idx) const { SASSERT(idx < m_size); return m_lits[idx]; }
|
|
bool is_learned() const { return m_learned; }
|
|
literal * begin() { return m_lits; }
|
|
literal * end() { return m_lits + m_size; }
|
|
literal const * c_ptr() const { return m_lits; }
|
|
void inc_activity() { m_activity++; }
|
|
void set_activity(unsigned v) { m_activity = v; }
|
|
unsigned get_activity() const { return m_activity; }
|
|
bool contains(literal l) const;
|
|
bool contains(bool_var v) const;
|
|
void shrink(unsigned num_lits) { SASSERT(num_lits <= m_size); if (num_lits < m_size) { m_size = num_lits; } }
|
|
assumption_set assumptions() const { return m_assumptions; }
|
|
};
|
|
|
|
typedef ptr_vector<clause> clause_vector;
|
|
|
|
};
|
|
|
|
#endif
|