Iterative solver for a single depth level. Replaces the former mutually-recursive Solver::solve/continue_search pair. Every former recursive call was a tail call, so each maps to updating (asrl, c, n) and continuing the loop. Backtracking pops from self.choices. */
(&mut self, mut asrl: Database, mut c: FramableClause, mut n: i32)
source not stored for this graph (policy: none)
no test coverage detected