#include <sweep.hpp>
Definition at line 33 of file sweep.hpp.
◆ Sweeper()
| CaDiCaL::Sweeper::Sweeper |
( |
Internal * | internal | ) |
|
◆ ~Sweeper()
| CaDiCaL::Sweeper::~Sweeper |
( |
| ) |
|
◆ backbone
| vector<int> CaDiCaL::Sweeper::backbone |
◆ binaries
◆ blit
| int CaDiCaL::Sweeper::blit |
◆ blockable
| vector<int> CaDiCaL::Sweeper::blockable |
◆ blocked_clauses
◆ clause
| vector<int> CaDiCaL::Sweeper::clause |
◆ clauses [1/2]
◆ clauses [2/2]
| unsigned CaDiCaL::Sweeper::clauses |
◆ core
◆ current_ticks
| uint64_t CaDiCaL::Sweeper::current_ticks |
◆ depth
| unsigned CaDiCaL::Sweeper::depth |
◆ depths
| vector<unsigned> CaDiCaL::Sweeper::depths |
◆ encoded
| unsigned CaDiCaL::Sweeper::encoded |
◆ first
| int CaDiCaL::Sweeper::first |
◆ flush_blocked_clauses
| bool CaDiCaL::Sweeper::flush_blocked_clauses |
◆ internal
◆ last
| int CaDiCaL::Sweeper::last |
◆ [struct]
| struct { ... } CaDiCaL::Sweeper::limit |
◆ next
| vector<int> CaDiCaL::Sweeper::next |
◆ partition
| vector<int> CaDiCaL::Sweeper::partition |
◆ prev
| vector<int> CaDiCaL::Sweeper::prev |
◆ prev_units
◆ propagate
| vector<int> CaDiCaL::Sweeper::propagate |
◆ random
| Random CaDiCaL::Sweeper::random |
◆ reprs
| int* CaDiCaL::Sweeper::reprs |
◆ save
| unsigned CaDiCaL::Sweeper::save |
◆ ticks
| uint64_t CaDiCaL::Sweeper::ticks |
◆ vars [1/2]
| vector<int> CaDiCaL::Sweeper::vars |
◆ vars [2/2]
| unsigned CaDiCaL::Sweeper::vars |
The documentation for this struct was generated from the following files: