fn push(&mut self, constraint: Constraint) -> bool {
        if self.queried.insert(constraint) {
            let dnf = preconditions(self.cfg, constraint);

            if dnf.is_trivially_true() {
                // Optimization: if the precondition of an implication is trivially true, we don't
                // need to examine its conditions, we can just assert the truth of its consequent
                self.insert_fact(constraint);
            } else {
                self.queue.push_back(Implication {
                    preconditions: dnf,
                    consequent: constraint,
                });
            }

            true
        } else {
            false
        }
    }
/// Push a constraint into the solver's state, returning whether or not it is currently known to
/// be true.
Push a constraint into the solver's state, returning whether or not it is currently known to
be true.
Push a constraint into the solver ' s state returning whether or not it is currently known to be true .
fn push(&mut self, constraint: Constraint) -> bool {
        if self.queried.insert(constraint) {
            let dnf = preconditions(self.cfg, constraint);
            if dnf.is_trivially_true() {
                // Optimization: if the precondition of an implication is trivially true, we don't
                // need to examine its conditions, we can just assert the truth of its consequent
                self.insert_fact(constraint);
            } else {
                self.queue.push_back(Implication {
                    preconditions: dnf,
                    consequent: constraint,
                });
            }
            true
        } else {
            false
        }
    }
fn push ( & mut self , constraint : Constraint ) -> bool { if self . queried . insert ( constraint ) { let dnf = preconditions ( self . cfg , constraint ) ; if dnf . is_trivially_true ( ) { // Optimization: if the precondition of an implication is trivially true, we don't // need to examine its conditions, we can just assert the truth of its consequent self . insert_fact ( constraint ) ; } else { self . queue . push_back ( Implication { preconditions : dnf , consequent : constraint , } ) ; } true } else { false } }
Push a constraint into the solver's state, returning whether or not it is currently known to
be true.
Push a constraint into the solver ' s state returning whether or not it is currently known to be true .
&mut self
constraint
Constraint