#include <SolverTypes.h>
Definition at line 134 of file SolverTypes.h.
◆ abstraction()
| uint32_t Gluco2::Clause::abstraction |
( |
| ) |
const |
|
inline |
◆ activity()
| float & Gluco2::Clause::activity |
( |
| ) |
|
|
inline |
◆ calcAbstraction()
| void Gluco2::Clause::calcAbstraction |
( |
| ) |
|
|
inline |
Definition at line 175 of file SolverTypes.h.
175 {
178 for (
int i = 0; i <
size(); i++)
uint32_t abstraction() const
◆ canBeDel()
| bool Gluco2::Clause::canBeDel |
( |
| ) |
|
|
inline |
◆ has_extra()
| bool Gluco2::Clause::has_extra |
( |
| ) |
const |
|
inline |
◆ last()
| const Lit & Gluco2::Clause::last |
( |
| ) |
const |
|
inline |
Definition at line 190 of file SolverTypes.h.
190{ return data[header.size-1].lit; }
◆ lbd()
| unsigned int Gluco2::Clause::lbd |
( |
| ) |
const |
|
inline |
◆ learnt()
| bool Gluco2::Clause::learnt |
( |
| ) |
const |
|
inline |
◆ mark() [1/2]
◆ mark() [2/2]
◆ operator const Lit *()
| Gluco2::Clause::operator const Lit * |
( |
void | | ) |
const |
|
inline |
◆ operator[]() [1/2]
| Lit & Gluco2::Clause::operator[] |
( |
int | i | ) |
|
|
inline |
◆ operator[]() [2/2]
| Lit Gluco2::Clause::operator[] |
( |
int | i | ) |
const |
|
inline |
◆ pop()
| void Gluco2::Clause::pop |
( |
| ) |
|
|
inline |
◆ relocate()
| void Gluco2::Clause::relocate |
( |
CRef | c | ) |
|
|
inline |
Definition at line 194 of file SolverTypes.h.
194{ header.reloced = 1; data[0].rel = c; }
◆ relocation()
| CRef Gluco2::Clause::relocation |
( |
| ) |
const |
|
inline |
◆ reloced()
| bool Gluco2::Clause::reloced |
( |
| ) |
const |
|
inline |
◆ setCanBeDel()
| void Gluco2::Clause::setCanBeDel |
( |
bool | b | ) |
|
|
inline |
◆ setLBD()
| void Gluco2::Clause::setLBD |
( |
int | i | ) |
|
|
inline |
◆ setSizeWithoutSelectors()
| void Gluco2::Clause::setSizeWithoutSelectors |
( |
unsigned int | n | ) |
|
|
inline |
Definition at line 212 of file SolverTypes.h.
212{header.szWithoutSelectors = n; }
◆ shrink()
| void Gluco2::Clause::shrink |
( |
int | i | ) |
|
|
inline |
Definition at line 184 of file SolverTypes.h.
184{
assert(i <=
size());
if (header.has_extra) data[header.size-i] = data[header.size]; header.size -= i; }
◆ size()
| int Gluco2::Clause::size |
( |
| ) |
const |
|
inline |
◆ sizeWithoutSelectors()
| unsigned int Gluco2::Clause::sizeWithoutSelectors |
( |
| ) |
const |
|
inline |
Definition at line 213 of file SolverTypes.h.
213{ return header.szWithoutSelectors; }
◆ strengthen()
| void Gluco2::Clause::strengthen |
( |
Lit | p | ) |
|
|
inline |
◆ subsumes()
Definition at line 408 of file SolverTypes.h.
409{
410
411
413 assert(header.has_extra);
assert(other.header.has_extra);
414 if (other.header.size < header.size || (data[header.size].abs & ~other.data[other.header.size].abs) != 0)
416
418 const Lit* c = (const Lit*)(*this);
419 const Lit* d = (const Lit*)other;
420
421 for (unsigned i = 0; i < header.size; i++) {
422
423 for (unsigned j = 0; j < other.header.size; j++)
424 if (c[i] == d[j])
425 goto ok;
426 else if (ret ==
lit_Undef && c[i] == ~d[j]){
427 ret = c[i];
428 goto ok;
429 }
430
431
433 ok:;
434 }
435
436 return ret;
437}
◆ ClauseAllocator
◆ abs
◆ act
| float Gluco2::Clause::act |
◆ canbedel
| unsigned Gluco2::Clause::canbedel |
◆ has_extra
| unsigned Gluco2::Clause::has_extra |
◆ lbd
| unsigned Gluco2::Clause::lbd |
◆ learnt
| unsigned Gluco2::Clause::learnt |
◆ lit
◆ mark
| unsigned Gluco2::Clause::mark |
◆ rel
◆ reloced
| unsigned Gluco2::Clause::reloced |
◆ size
| unsigned Gluco2::Clause::size |
◆ szWithoutSelectors
| unsigned Gluco2::Clause::szWithoutSelectors |
The documentation for this class was generated from the following file: