/dports/misc/ompl/ompl-1.5.2/tests/base/ |
H A D | PlannerTest.h | 67 bool solved = planner_->solve(timedPlannerTerminationCondition(1.0)); in testSolveAndClear() local 68 BOOST_CHECK(solved); in testSolveAndClear() 72 solved = planner_->solve(timedPlannerTerminationCondition(1.0)); in testSolveAndClear() 73 BOOST_CHECK(solved); in testSolveAndClear() 75 solved = planner_->solve(timedPlannerTerminationCondition(1.0)); in testSolveAndClear() 76 BOOST_CHECK(solved); in testSolveAndClear() 83 solved = planner_->solve(0.1); in testSolveAndClear() 84 if (!solved) in testSolveAndClear() 85 solved = planner_->solve(timedPlannerTerminationCondition(1.0)); in testSolveAndClear() 86 BOOST_CHECK(solved); in testSolveAndClear()
|
/dports/games/supertuxkart/SuperTuxKart-1.2-src/src/challenges/ |
H A D | challenge_status.cpp | 50 std::string solved; in load() local 51 if (node->get("solved", &solved)) in load() 54 if (solved == "easy") in load() 56 else if (solved == "medium") in load() 58 else if (solved == "hard") in load() 60 else if (solved == "best") in load()
|
/dports/misc/ompl/ompl-1.5.2/src/ompl/geometric/src/ |
H A D | GeneticSearch.cpp | 83 bool solved = false; in solve() local 104 solved = true; in solve() 123 solved = true; in solve() 141 solved = true; in solve() 170 solved = true; in solve() 186 solved = true; in solve() 210 solved = true; in solve() 218 if (!solved) in solve() 238 if (solved) in solve() 271 if (solved) in solve() [all …]
|
/dports/astro/siril/siril/src/registration/matching/ |
H A D | apply_match.c | 115 static int proc_star_file(image_solved *solved, TRANS *trans); 117 int apply_match(image_solved *solved, TRANS trans) { in apply_match() argument 120 if (proc_star_file(solved, &trans) != SH_SUCCESS) { in apply_match() 151 static int proc_star_file(image_solved *solved, TRANS *trans) { in proc_star_file() argument 158 SirilWorldCS *px_cat_center = get_image_solved_px_cat_center(solved); in proc_star_file() 167 xval = get_image_solved_x(solved); //s[i]->xpos; in proc_star_file() 168 yval = get_image_solved_y(solved); //s[i]->ypos; in proc_star_file() 252 update_image_center_coord(solved, alpha, delta); in proc_star_file()
|
/dports/math/asymptote/asymptote-2.67/ |
H A D | flatguide.h | 28 bool solved; variable 84 solved=false; in clearPath() 93 if (solved) { in update() 94 solved=false; in update() 103 : solved(true), precycle(false), p(), out(&open), in(&open) {} in flatguide() 177 if (solved) 182 solved=true;
|
/dports/print/texlive-base/texlive-20150521-source/utils/asymptote/ |
H A D | flatguide.h | 28 bool solved; variable 84 solved=false; in clearPath() 93 if (solved) { in update() 94 solved=false; in update() 103 : solved(true), precycle(false), p(), out(&open), in(&open) {} in flatguide() 177 if (solved) 182 solved=true;
|
/dports/math/maxima/maxima-5.43.2/tests/ |
H A D | rtestparser_continuations_cr.mac | 81 [nfunc,NewtonMatrix,det,Solutions,Increments,numdet,solved:false,i,j,k, 107 solved:true, 109 solved:solved and abs(Increments[i][1]) < NEWTONEPSILON, 110 if solved then return(0)), 111 if solved = false 123 ,numdet,solved:false,i,j,k,keep\ 156 ,solved:true,for i thru nfunc d\ 157 o solved:solved and abs(Increme\ 159 olved then return(0)),if solved\
|
H A D | rtestparser_continuations_crnl.mac | 81 [nfunc,NewtonMatrix,det,Solutions,Increments,numdet,solved:false,i,j,k, 107 solved:true, 109 solved:solved and abs(Increments[i][1]) < NEWTONEPSILON, 110 if solved then return(0)), 111 if solved = false 123 ,numdet,solved:false,i,j,k,keep\ 156 ,solved:true,for i thru nfunc d\ 157 o solved:solved and abs(Increme\ 159 olved then return(0)),if solved\
|
H A D | rtestparser_continuations_nl.mac | 81 [nfunc,NewtonMatrix,det,Solutions,Increments,numdet,solved:false,i,j,k, 107 solved:true, 109 solved:solved and abs(Increments[i][1]) < NEWTONEPSILON, 110 if solved then return(0)), 111 if solved = false 123 ,numdet,solved:false,i,j,k,keep\ 156 ,solved:true,for i thru nfunc d\ 157 o solved:solved and abs(Increme\ 159 olved then return(0)),if solved\
|
/dports/math/arpack++/arpackpp-2.3.0/examples/band/sym/ |
H A D | README | 13 is solved using the regular mode. 16 is solved using the shift and invert mode. 19 is solved using the regular mode. 22 is solved using the shift and invert mode. 25 is solved using the buckling mode. 28 is solved using the Cayley mode.
|
/dports/math/arpack++/arpackpp-2.3.0/examples/dense/sym/ |
H A D | README | 13 is solved using the regular mode. 16 is solved using the shift and invert mode. 19 is solved using the regular mode. 22 is solved using the shift and invert mode. 25 is solved using the buckling mode. 28 is solved using the Cayley mode.
|
/dports/astro/astrometry/astrometry.net-0.85/solver/ |
H A D | mergesolved.c | 33 anbool* solved; in main() local 70 solved = calloc(N, sizeof(anbool)); in main() 76 solved[il_get(slist, j) - 1] = TRUE; in main() 79 if (solvedfile_set_file(outfile, solved, N)) { in main() 84 free(solved); in main()
|
/dports/games/pushover/pushover-0.0.5/src/ |
H A D | main.cpp | 325 solvedMap_c solved; in main() local 568 if (sel < solved.getNumberOfUsers()) in main() 570 solved.selectUser(sel); in main() 576 else if (sel == solved.getNumberOfUsers()) in main() 580 else if (sel == solved.getNumberOfUsers()+1) in main() 604 if (s+1 < solved.getNumberOfUsers()) in main() 609 if (s+1 == solved.getCurrentUser()) in main() 611 solved.selectUser(0); in main() 616 solved.deleteUser(s+1); in main() 1007 solved.addLevel(l.getChecksum()); in main() [all …]
|
/dports/math/arpack++/arpackpp-2.3.0/examples/product/sym/ |
H A D | README | 14 is solved using the regular mode. 17 is solved using the shift and invert mode. 20 is solved using the regular mode. 23 is solved using the shift and invert mode. 26 is solved using the buckling mode. 29 is solved using the Cayley mode.
|
/dports/math/arpack++/arpackpp-2.3.0/examples/reverse/sym/ |
H A D | README | 13 is solved using the regular mode. 16 is solved using the shift and invert mode. 19 is solved using the regular mode. 22 is solved using the shift and invert mode. 25 is solved using the buckling mode. 28 is solved using the Cayley mode.
|
/dports/math/asymptote/asymptote-2.67/doc/ |
H A D | mexicanhat.asy | 10 path solved; 16 solved=solved..z; 21 draw(solved,dashed);
|
/dports/print/texlive-base/texlive-20150521-source/utils/asymptote/doc/ |
H A D | mexicanhat.asy | 10 path solved; 16 solved=solved..z; 21 draw(solved,dashed);
|
/dports/math/arpack++/arpackpp-2.3.0/examples/superlu/sym/ |
H A D | README | 14 is solved using the regular mode. 17 is solved using the shift and invert mode. 20 is solved using the regular mode. 23 is solved using the shift and invert mode. 26 is solved using the buckling mode. 29 is solved using the Cayley mode.
|
/dports/math/arpack++/arpackpp-2.3.0/examples/umfpack/sym/ |
H A D | README | 14 is solved using the regular mode. 17 is solved using the shift and invert mode. 20 is solved using the regular mode. 23 is solved using the shift and invert mode. 26 is solved using the buckling mode. 29 is solved using the Cayley mode.
|
/dports/math/oink/oink-c1259fe/src/ |
H A D | game.cpp | 149 solved = other.solved; in Game() 435 solved[id] = false; in parse_pgsolver() 500 if (solved.any()) { in parse_pgsolver() 546 solved[ident] = true; in parse_solution() 607 if (solved[i]) { in write_sol() 710 { bool b = solved[k]; solved[k] = solved[i]; solved[i] = b; } in unsafe_permute() 920 std::swap(solved, other.solved); in swap() 932 solved.reset(); in reset_solution() 940 solved = other.solved; in copy_solution() 969 solved.resize(v_allocated); in v_sizeup() [all …]
|
/dports/math/arpack++/arpackpp-2.3.0/examples/areig/sym/ |
H A D | README | 14 is solved using the regular mode. 17 is solved using the shift and invert mode. 20 is solved using the regular mode. 23 is solved using the shift and invert mode. 26 is solved using the buckling mode. 29 is solved using the Cayley mode.
|
/dports/math/scilab/scilab-6.1.1/scilab/modules/scicos/src/modelica_compiler/ |
H A D | bipartiteGraph.ml | 28 mutable solved : bool; RecordField 43 solved = false; 58 (* Invariant: when an edge's flow is full, its source and destination nodes are solved *) 66 if node.solved = true || node'.solved = true && !flow = Empty then invalid_arg "fill" 67 else flow := Full; node.solved <- true; node'.solved <- true 73 | x when not x.solved -> x.mark <- Source; first_mark (i - 1) (x :: marked_left_nodes) 86 | x :: _ when not x.solved -> x.solved <- true; update_edges_from x; Succeed 94 | { mark = Source } -> node.solved <- true
|
/dports/games/frogatto/frogatto-1.3.1/modules/cube_trains/data/object_prototypes/ |
H A D | ct-train.cfg | 26 on_solve: "if(not solved.error, [ 27 set(midpoint_x, solved.pos[0]), 28 set(midpoint_y, solved.pos[1] + vars.yOffset), 42 …angle(midpoint_x, midpoint_y*1.75, solved.pos[0], (solved.pos[1] + vars.yOffset)*1.75) + angleOffs… 65 …rances don't fire this soon enough and it clips. To fix, perhaps move to solved instead of solvedL… 75 fire_event(level.player, 'train_crashed', {'error': solved.error, 'a': self})), 77 ]) where solved = vars.on_track.solve(vars.offset+vars.speed+10,vars.track,vars.reversed),
|
/dports/math/minizinc/libminizinc-2.5.5/tests/spec/unit/general/ |
H A D | wolfgoatetc.mzn | 8 solved: 15 13 solved: 15 58 var step: solved :: add_to_output; 61 L[solved, W] = market 62 /\ L[solved, G] = market 63 /\ L[solved, C] = market; 103 [ bool2int(s < solved) * 116 minimize solved;
|
/dports/math/arpack++/arpackpp-2.3.0/examples/product/nonsym/ |
H A D | README | 14 is solved using the regular mode. 17 is solved using the shift and invert mode. 20 is solved using the regular mode. 23 is solved using the real shift and invert mode. 26 is solved using the complex shift and invert mode 30 is solved using the complex shift and invert mode
|