Home
last modified time | relevance | path

Searched refs:number_of_solutions (Results 1 – 11 of 11) sorted by relevance

/dports/games/crafty/crafty-25.2_1/
H A Dtest.c111 number_of_solutions = 0; in Test()
124 solutions[number_of_solutions] = move; in Test()
125 Print(4095, "%d. %s", (number_of_solutions++) + 1, OutputMove(tree, in Test()
145 for (i = 0; i < number_of_solutions; i++) { in Test()
326 number_of_solutions = 0; in TestEPD()
336 solutions[number_of_solutions] = move; in TestEPD()
337 Print(4095, "%d. %s", (number_of_solutions++) + 1, OutputMove(tree, in TestEPD()
368 for (i = 0; i < number_of_solutions; i++) { in TestEPD()
H A Ddata.h66 extern int number_of_solutions;
H A Diterate.c452 for (i = 0; i < number_of_solutions; i++) { in Iterate()
H A Ddata.c18 int number_of_solutions; variable
/dports/science/mcstas-comps/mcstas-comps-2.5-src/share/
H A DGeometry_functions.c538 int number_of_solutions; in existence_of_intersection() local
543 if (number_of_solutions > 0) { in existence_of_intersection()
545 if (number_of_solutions == 2) { in existence_of_intersection()
918 int iterate,number_of_solutions,solutions,number_of_positions = 30; in cylinder_overlaps_cylinder() local
944 if (number_of_solutions == 2) { in cylinder_overlaps_cylinder()
966 if (number_of_solutions == 2) { in cylinder_overlaps_cylinder()
984 if (number_of_solutions == 2) { in cylinder_overlaps_cylinder()
1137 int iterate,number_of_solutions,solutions,number_of_positions = 30; in cylinder_within_cylinder() local
1167 if (number_of_solutions == 2) { in cylinder_within_cylinder()
1212 if (number_of_solutions == 2) { in cylinder_within_cylinder()
[all …]
H A DUnion_functions.c1609 int number_of_solutions; in draw_line_with_highest_priority() local
1636 … = Geometries[volume_index]->intersect_function(temp_intersection,&number_of_solutions,r1,directio… in draw_line_with_highest_priority()
1638 for (iterate=0;iterate<number_of_solutions;iterate++) { in draw_line_with_highest_priority()
/dports/math/py-Pyomo/Pyomo-6.1.2/pyomo/solvers/plugins/solvers/
H A Dmosek_direct.py746 self.results.problem.number_of_solutions = 1
753 if self.results.problem.number_of_solutions > 0:
828 if self.results.problem.number_of_solutions > 0:
H A Dxpress_direct.py667 self.results.problem.number_of_solutions = xprob_attrs.mipsols if is_mip else 1
H A Dgurobi_direct.py650 self.results.problem.number_of_solutions = gprob.SolCount
/dports/biology/ugene/ugene-40.1/src/plugins_3rdparty/ball/src/include/BALL/MATHS/
H A DanalyticalGeometry.h802 …short number_of_solutions = SolveQuadraticEquation (line.d * line.d, (line.p - sphere.p) * line.d … in GetIntersection() local
804 if (number_of_solutions == 0) in GetIntersection()
/dports/science/mcstas-comps/mcstas-comps-2.5-src/contrib/union/
H A DUnion_master.comp45 …e_found, next_volume, next_volume_priority, done, current_volume, number_of_solutions, number_of_…
122 int *number_of_solutions;
713 number_of_solutions = &number_of_solutions_static;
1008 …ersect_function(intersection_time_table.intersection_times[*check],number_of_solutions,r_start,v,&…
1023 …rent_volume]->geometry.mask_intersect_list.elements[mask_iterate]],number_of_solutions,r_start,v,&…
1074 …unction(intersection_time_table.intersection_times[current_volume],number_of_solutions,r_start,v,&…
1075 …ersect_function(intersection_time_table.intersection_times[*check],number_of_solutions,r_start,v,&…