Painless
A framework to ease parallelization of sequential CDCL SAT solvers
Loading...
Searching...
No Matches
Parsers::SBVAInit Class Reference

A filter for Structured BVA (Binary Variable Addition) More...

#include <StructuredBva.hpp>

Inheritance diagram for Parsers::SBVAInit:
Collaboration diagram for Parsers::SBVAInit:

Public Member Functions

 SBVAInit (std::vector< std::vector< unsigned int > > &litToClause, std::vector< bool > &isClauseDeleted)
 
bool initMembers (unsigned int varCount, unsigned int clauseCount)
 Initialize the processor with problem parameters.
 
bool operator() (simpleClause &clause) override
 Process a clause.
 
- Public Member Functions inherited from Parsers::ClauseProcessor

Detailed Description

A filter for Structured BVA (Binary Variable Addition)

This class implements a clause filter for Structured BVA operations. It inherits from Parsers::ClauseProcessor.

Member Function Documentation

◆ initMembers()

bool Parsers::SBVAInit::initMembers ( unsigned int varCount,
unsigned int clauseCount )
virtual

Initialize the processor with problem parameters.

Parameters
varCountThe number of variables in the formula.
clauseCountThe number of clauses in the formula.
Returns
true if initialization was successful, false otherwise.

Implements Parsers::ClauseProcessor.

◆ operator()()

bool Parsers::SBVAInit::operator() ( simpleClause & clause)
overridevirtual

Process a clause.

Parameters
clauseThe clause to process.
Returns
true if the clause should be kept, false if it should be filtered out.

Implements Parsers::ClauseProcessor.


The documentation for this class was generated from the following file: