(formula: MathJSON)
| 1344 | if (depth === vars.length) return true; |
| 1345 | const wc = '_' + vars[depth]; |
| 1346 | for (let c = 0; c < candidates[depth].length; c++) { |
| 1347 | sub[wc] = boxed[depth][c]; |
| 1348 | seed[wc] = candidates[depth][c]; |
| 1349 | let ok = true; |
| 1350 | for (let i = 0; i < guards.length && ok; i++) { |
| 1351 | if (guardDepth[i] !== depth) continue; |
| 1352 | if (budget-- <= 0) return false; |
| 1353 | ok = closures[i](sub); |
| 1354 | } |
| 1355 | if (ok && dfs(depth + 1)) return true; |
| 1356 | if (budget <= 0) return false; |
| 1357 | } |
| 1358 | delete sub[wc]; |
no test coverage detected