[−][src]Struct rate_common::parser::Parser
CNF and DRAT/DPR parser.
Fields
redundancy_property: RedundancyProperty
The redundancy property identifying the proof format.
maxvar: Variable
The highest variable parsed so far
clause_pivot: Vector<Literal>
For RAT, the pivot (first literal) for each clause
It is necessary to store this because the clauses will be sorted (and watches will be shuffled).
proof_start: Clause
The first clause that is part of the proof (and not the input formula)
proof: Vector<ProofStep>
The proof steps
max_proof_steps: Option<usize>
How many proof steps we want to parse
verbose: bool
Print diagnostics and timing information
clause_db: ClauseDatabase
Clause store
witness_db: WitnessDatabase
Witness store
Methods
impl Parser
[src]
Trait Implementations
impl Debug for Parser
[src]
impl Default for Parser
[src]
fn default() -> Parser
[src]
Create a new parser.
Note: this allocates the static clause and witness databases, so this should only be called once.
impl HeapSpace for Parser
[src]
fn heap_space(&self) -> usize
[src]
impl PartialEq<Parser> for Parser
[src]
impl StructuralPartialEq for Parser
[src]
Auto Trait Implementations
impl RefUnwindSafe for Parser
impl Send for Parser
impl Sync for Parser
impl Unpin for Parser
impl UnwindSafe for Parser
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T> HeapSpace for T where
T: Copy,
[src]
T: Copy,
fn heap_space(&Self) -> usize
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,