Searched refs:current_answer (Results 1 – 8 of 8) sorted by relevance
| /dports/devel/rust-analyzer/rust-analyzer-2021-12-20/cargo-crates/chalk-recursive-0.75.0/src/ |
| H A D | fixed_point.rs | 212 let current_answer = solver_stuff.solve_iteration(self, &canonical_goal, minimums); in solve_new_subgoal() localVariable
216 current_answer, minimums in solve_new_subgoal()
222 self.search_graph[dfn].solution = current_answer; in solve_new_subgoal()
227 std::mem::replace(&mut self.search_graph[dfn].solution, current_answer); in solve_new_subgoal()
|
| H A D | recursive.rs | 86 current_answer: &Fallible<Solution<I>>, in reached_fixed_point()
90 old_answer == current_answer || { in reached_fixed_point()
94 match ¤t_answer { in reached_fixed_point()
|
| /dports/lang/rust/rustc-1.58.1-src/vendor/chalk-recursive/src/ |
| H A D | fixed_point.rs | 212 let current_answer = solver_stuff.solve_iteration(self, &canonical_goal, minimums); in solve_new_subgoal() localVariable
216 current_answer, minimums in solve_new_subgoal()
222 self.search_graph[dfn].solution = current_answer; in solve_new_subgoal()
227 std::mem::replace(&mut self.search_graph[dfn].solution, current_answer); in solve_new_subgoal()
|
| H A D | recursive.rs | 86 current_answer: &Fallible<Solution<I>>, in reached_fixed_point()
90 old_answer == current_answer || { in reached_fixed_point()
94 match ¤t_answer { in reached_fixed_point()
|
| /dports/lang/yap/yap-6.2.2/OPTYap/ |
| H A D | or.macros.h | 562 qg_ans_fr_ptr current_answer, next_answer; in CUT_free_solution_frame() local
564 current_answer = SolFr_first(solution); in CUT_free_solution_frame()
566 next_answer = AnsFr_next(current_answer); in CUT_free_solution_frame()
567 FREE_QG_ANSWER_FRAME(current_answer); in CUT_free_solution_frame()
568 current_answer = next_answer; in CUT_free_solution_frame()
569 } while (current_answer); in CUT_free_solution_frame()
|
| H A D | tab.macros.h | 1008 tg_ans_fr_ptr current_answer, next_answer; in CUT_free_tg_solution_frame() local
1010 current_answer = TgSolFr_first(solution); in CUT_free_tg_solution_frame()
1012 next_answer = TgAnsFr_next(current_answer); in CUT_free_tg_solution_frame()
1013 FREE_TG_ANSWER_FRAME(current_answer); in CUT_free_tg_solution_frame()
1014 current_answer = next_answer; in CUT_free_tg_solution_frame()
1015 } while (current_answer); in CUT_free_tg_solution_frame()
|
| /dports/games/wesnoth/wesnoth-1.14.17/data/test/scenarios/ |
| H A D | characterize_pathfinding.cfg | 47 {VARIABLE current_answer $answers[$answer_counter|].val|}
50 message="$current_answer , $observed_answer"
54 {ASSERT ({VARIABLE_CONDITIONAL observed_answer equals $current_answer}) }
|
| /dports/x11-toolkits/open-motif/motif-2.3.8/lib/Xm/ |
| H A D | Container.c | 8881 int current_answer,next_trial; in Isqrt() local
8885 current_answer = n; in Isqrt()
8887 while(current_answer > next_trial) in Isqrt()
8889 current_answer = next_trial; in Isqrt()
8892 if (current_answer * current_answer < n) in Isqrt()
8893 current_answer++; in Isqrt()
8894 return(current_answer); in Isqrt()
|