(self, solvers: List[BaseTree])
| 111 | return solver |
| 112 | |
| 113 | def generate_preprocess(self, solvers: List[BaseTree]) -> Tuple[List[str], List[int], List[BaseTree], List[BaseTree]]: |
| 114 | prompts = [] |
| 115 | prompts_span = [0] |
| 116 | valid_solvers = [] |
| 117 | invalid_solvers = [] |
| 118 | |
| 119 | for solver in solvers: |
| 120 | if solver.should_generate_next(): |
| 121 | solver_prompts = solver.create_prompt() |
| 122 | prompts.extend(solver_prompts) |
| 123 | prompts_span.append(prompts_span[-1] + len(solver_prompts)) |
| 124 | valid_solvers.append(solver) |
| 125 | else: |
| 126 | invalid_solvers.append(solver) |
| 127 | return prompts, prompts_span, valid_solvers, invalid_solvers |
| 128 | |
| 129 | def generate_postprocess( |
| 130 | self, |
no test coverage detected