otter_sat 0.1.0

A library for determining the satisfiability of boolean formulas written in conjunctive normal form, developed to support investigation into solvers by researchers, developers, or anyone curious.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47

use std::collections::HashSet;

use crate::{
    config::Config,
    context::Context,
    db::ClauseKey,
    structures::{clause::CClause, literal::CLiteral},
};

/// A structure which bundles a context with some structures to the IPASIR API.
pub struct ContextBundle {
    /// A context.
    pub context: Context,

    /// A buffer to hold the literals of a clause being added to the solver.
    pub clause_buffer: CClause,

    /// The keys to a an unsatisfiable core of the formula.
    pub core_keys: Vec<ClauseKey>,

    /// The literals which occur in the unsatisfiable core identified by [core_keys](ContextBundle::core_keys).
    pub core_literals: HashSet<CLiteral>,
}

impl ContextBundle {
    /// Refreshes the bundled context and clears bundled structures if the context was not already fresh.
    pub fn keep_fresh(&mut self) {
        match self.context.refresh() {
            true => {
                self.core_keys.clear();
                self.core_literals.clear();
            }
            false => {}
        }
    }
}

impl Default for ContextBundle {
    fn default() -> Self {
        ContextBundle {
            context: Context::from_config(Config::default()),
            clause_buffer: Vec::default(),
            core_keys: Vec::default(),
            core_literals: HashSet::default(),
        }
    }
}