/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/src/motion/mc/ |
H A D | mc_move_control.F | 298 moves%bond%successes = moves%bond%successes & 308 moves%rot%successes = moves%rot%successes & 310 moves%hmc%successes = moves%hmc%successes & 323 moves%trans_dis = moves%trans_dis + moves%qtrans_dis 324 moves%cltrans_dis = moves%cltrans_dis + moves%qcltrans_dis 370 moves%bond%successes, moves%bond%attempts 372 moves%angle%successes, moves%angle%attempts 376 moves%trans%successes, moves%trans%attempts 380 moves%rot%successes, moves%rot%attempts 382 moves%swap%successes, moves%swap%attempts [all …]
|
H A D | mc_misc.F | 224 moves => all_moves(itype)%moves 244 moves%bond%attempts + moves%angle%attempts + & 246 moves%bond%successes + moves%angle%successes + & 248 REAL(moves%bond%successes + moves%angle%successes + & 250 REAL(moves%bond%attempts + moves%angle%attempts + & 301 moves%swap%attempts, & 302 moves%empty, & 308 moves%swap%attempts, & 309 moves%grown, & 315 moves%swap%attempts, & [all …]
|
/dports/science/cp2k-data/cp2k-7.1.0/src/motion/mc/ |
H A D | mc_move_control.F | 298 moves%bond%successes = moves%bond%successes & 308 moves%rot%successes = moves%rot%successes & 310 moves%hmc%successes = moves%hmc%successes & 323 moves%trans_dis = moves%trans_dis + moves%qtrans_dis 324 moves%cltrans_dis = moves%cltrans_dis + moves%qcltrans_dis 370 moves%bond%successes, moves%bond%attempts 372 moves%angle%successes, moves%angle%attempts 376 moves%trans%successes, moves%trans%attempts 380 moves%rot%successes, moves%rot%attempts 382 moves%swap%successes, moves%swap%attempts [all …]
|
H A D | mc_misc.F | 224 moves => all_moves(itype)%moves 244 moves%bond%attempts + moves%angle%attempts + & 246 moves%bond%successes + moves%angle%successes + & 248 REAL(moves%bond%successes + moves%angle%successes + & 250 REAL(moves%bond%attempts + moves%angle%attempts + & 301 moves%swap%attempts, & 302 moves%empty, & 308 moves%swap%attempts, & 309 moves%grown, & 315 moves%swap%attempts, & [all …]
|
/dports/math/gap/gap-4.11.0/pkg/simpcomp/src/ |
H A D | reduce_complex.cpp | 33 bistellar_move_list_t moves; in reduce_complex() local 38 while (moves.empty()) in reduce_complex() 95 moves.insert(moves.begin(), temp.begin(), temp.end()); in reduce_complex() 113 moves.insert(moves.begin(), temp.begin(), temp.end()); in reduce_complex() 138 moves.insert(moves.begin(), temp.begin(), temp.end()); in reduce_complex() 141 moves.insert(moves.begin(), temp.begin(), temp.end()); in reduce_complex() 162 moves.insert(moves.begin(), temp.begin(), temp.end()); in reduce_complex() 190 moves.insert(moves.begin(), temp.begin(), temp.end()); in reduce_complex() 200 moves.insert(moves.begin(), temp.begin(), temp.end()); in reduce_complex() 257 if (moves.size() == 0) in reduce_complex() [all …]
|
/dports/games/gnugo/gnugo-3.8/engine/ |
H A D | reading.c | 70 (moves).pos[(moves).num] = move; \ 71 (moves).score[(moves).num] = this_score; \ 72 (moves).message[(moves).num] = this_message; \ 82 (moves).pos[u] = (moves).pos[(moves).num - 1]; \ 83 (moves).score[u] = (moves).score[(moves).num - 1]; \ 84 (moves).message[u] = (moves).message[(moves).num - 1]; \ 163 moves.num_tried = moves.num; \ 209 moves.num_tried = moves.num; \ 5104 if (moves->num - moves->num_tried < 2) { in order_moves() 5289 moves->pos[max_at] = moves->pos[i]; in order_moves() [all …]
|
/dports/math/py-brial/BRiAl-1.2.10/cudd/ |
H A D | cuddAnneal.c | 373 moves = NULL; 475 moves = move; 522 moves = NULL; 546 moves = move; 554 moves = move; 587 moves = NULL; 598 moves = move; 613 moves = move; 657 moves = move; 672 moves = move; [all …]
|
/dports/math/cudd/cudd-3.0.0/cudd/ |
H A D | cuddAnneal.c | 330 moves = NULL; in ddExchange() 432 moves = move; in ddExchange() 477 moves = NULL; in ddJumpingAux() 501 moves = move; in ddJumpingAux() 509 moves = move; in ddJumpingAux() 540 moves = NULL; in ddJumpingUp() 551 moves = move; in ddJumpingUp() 566 moves = move; in ddJumpingUp() 608 moves = move; in ddJumpingDown() 623 moves = move; in ddJumpingDown() [all …]
|
/dports/math/brial/BRiAl-1.2.10/cudd/ |
H A D | cuddAnneal.c | 373 moves = NULL; in ddExchange() 475 moves = move; in ddExchange() 522 moves = NULL; in ddJumpingAux() 546 moves = move; in ddJumpingAux() 554 moves = move; in ddJumpingAux() 587 moves = NULL; in ddJumpingUp() 598 moves = move; in ddJumpingUp() 613 moves = move; in ddJumpingUp() 657 moves = move; in ddJumpingDown() 672 moves = move; in ddJumpingDown() [all …]
|
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bdd/cudd/ |
H A D | cuddAnneal.c | 377 moves = NULL; in ddExchange() 469 moves = move; in ddExchange() 479 moves = move; in ddExchange() 487 moves = move; in ddExchange() 526 moves = NULL; in ddJumpingAux() 550 moves = move; in ddJumpingAux() 591 moves = NULL; in ddJumpingUp() 611 return(moves); in ddJumpingUp() 650 moves = NULL; in ddJumpingDown() 670 return(moves); in ddJumpingDown() [all …]
|
/dports/games/freecell-solver/freecell-solver-6.2.0/ |
H A D | fc_pro_iface_pos.h | 30 fcs_extended_move *moves; member 38 const fcs_moves_processed *const moves) in fc_solve_moves_processed_get_moves_left() argument 40 return moves->num_moves - moves->next_move_idx; in fc_solve_moves_processed_get_moves_left() 44 fcs_moves_processed *const moves, fcs_extended_move *const move) in fc_solve_moves_processed_get_next_move() argument 46 if (moves->next_move_idx == moves->num_moves) in fc_solve_moves_processed_get_next_move() 50 *move = moves->moves[moves->next_move_idx++]; in fc_solve_moves_processed_get_next_move() 55 fcs_moves_processed *const moves) in fc_solve_moves_processed_free() argument 57 free(moves->moves); in fc_solve_moves_processed_free() 58 moves->moves = NULL; in fc_solve_moves_processed_free()
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/libcxx/test/std/algorithms/alg.modifying.operations/alg.move/ |
H A D | contiguous_trivial_optimization.pass.cpp | 64 constexpr TCBNTM(int& moves) : p(&moves) {} in TCBNTM() 73 int moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() local 74 TCBNTM ia[] = { moves, moves, moves, moves }; in test_trivial_copyassign_but_no_trivial_moveassign() 75 TCBNTM ib[] = { moves, moves, moves, moves }; in test_trivial_copyassign_but_no_trivial_moveassign() 77 assert(moves == 4); in test_trivial_copyassign_but_no_trivial_moveassign() 78 moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() 80 assert(moves == 4); in test_trivial_copyassign_but_no_trivial_moveassign() 82 moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() 84 assert(moves == 4); in test_trivial_copyassign_but_no_trivial_moveassign() 85 moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() [all …]
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/libcxx/test/std/algorithms/alg.modifying.operations/alg.move/ |
H A D | contiguous_trivial_optimization.pass.cpp | 61 constexpr TCBNTM(int& moves) : p(&moves) {} in TCBNTM() 70 int moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() local 71 TCBNTM ia[] = { moves, moves, moves, moves }; in test_trivial_copyassign_but_no_trivial_moveassign() 72 TCBNTM ib[] = { moves, moves, moves, moves }; in test_trivial_copyassign_but_no_trivial_moveassign() 74 assert(moves == 4); in test_trivial_copyassign_but_no_trivial_moveassign() 75 moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() 77 assert(moves == 4); in test_trivial_copyassign_but_no_trivial_moveassign() 79 moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() 81 assert(moves == 4); in test_trivial_copyassign_but_no_trivial_moveassign() 82 moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() [all …]
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/libcxx/test/std/algorithms/alg.modifying.operations/alg.move/ |
H A D | contiguous_trivial_optimization.pass.cpp | 64 constexpr TCBNTM(int& moves) : p(&moves) {} in TCBNTM() 73 int moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() local 74 TCBNTM ia[] = { moves, moves, moves, moves }; in test_trivial_copyassign_but_no_trivial_moveassign() 75 TCBNTM ib[] = { moves, moves, moves, moves }; in test_trivial_copyassign_but_no_trivial_moveassign() 77 assert(moves == 4); in test_trivial_copyassign_but_no_trivial_moveassign() 78 moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() 80 assert(moves == 4); in test_trivial_copyassign_but_no_trivial_moveassign() 82 moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() 84 assert(moves == 4); in test_trivial_copyassign_but_no_trivial_moveassign() 85 moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() [all …]
|
/dports/devel/llvm13/llvm-project-13.0.1.src/libcxx/test/std/algorithms/alg.modifying.operations/alg.move/ |
H A D | contiguous_trivial_optimization.pass.cpp | 64 constexpr TCBNTM(int& moves) : p(&moves) {} in TCBNTM() 73 int moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() local 74 TCBNTM ia[] = { moves, moves, moves, moves }; in test_trivial_copyassign_but_no_trivial_moveassign() 75 TCBNTM ib[] = { moves, moves, moves, moves }; in test_trivial_copyassign_but_no_trivial_moveassign() 77 assert(moves == 4); in test_trivial_copyassign_but_no_trivial_moveassign() 78 moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() 80 assert(moves == 4); in test_trivial_copyassign_but_no_trivial_moveassign() 82 moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() 84 assert(moves == 4); in test_trivial_copyassign_but_no_trivial_moveassign() 85 moves = 0; in test_trivial_copyassign_but_no_trivial_moveassign() [all …]
|
/dports/games/openomf/libShadowDive-b2c34a6/src/ |
H A D | rec.c | 38 if(rec->moves) { in sd_rec_free() 42 free(rec->moves); in sd_rec_free() 156 rec->moves = realloc(rec->moves, rec->move_count * sizeof(sd_rec_move)); in sd_rec_load() 266 rec->moves + number, in sd_rec_delete_action() 267 rec->moves + number + 1, in sd_rec_delete_action() 273 rec->moves = realloc(rec->moves, rec->move_count * sizeof(sd_rec_move)); in sd_rec_delete_action() 275 if(rec->moves == NULL) { in sd_rec_delete_action() 290 rec->moves = realloc(rec->moves, (rec->move_count+1) * sizeof(sd_rec_move)); in sd_rec_insert_action() 291 if(rec->moves == NULL) { in sd_rec_insert_action() 301 rec->moves + number, in sd_rec_insert_action() [all …]
|
/dports/lang/v8/v8-9.6.180.12/src/compiler/backend/ |
H A D | gap-resolver.cc | 96 size_t nmoves = moves->size(); in Resolve() 101 if (i < nmoves) (*moves)[i] = (*moves)[nmoves]; in Resolve() 112 if (nmoves != moves->size()) moves->resize(nmoves); in Resolve() 129 auto move = (*moves)[i]; in Resolve() 147 auto move = (*moves)[i]; in Resolve() 176 auto other = (*moves)[i]; in PerformMove() 199 PerformMove(moves, other); in PerformMove() 219 std::find_if(moves->begin(), moves->end(), [&](MoveOperands* move) { in PerformMove() 223 if (blocker == moves->end()) { in PerformMove() 241 auto other = (*moves)[i]; in PerformMove() [all …]
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/v8/src/compiler/backend/ |
H A D | gap-resolver.cc | 96 size_t nmoves = moves->size(); in Resolve() 101 if (i < nmoves) (*moves)[i] = (*moves)[nmoves]; in Resolve() 112 if (nmoves != moves->size()) moves->resize(nmoves); in Resolve() 129 auto move = (*moves)[i]; in Resolve() 147 auto move = (*moves)[i]; in Resolve() 176 auto other = (*moves)[i]; in PerformMove() 199 PerformMove(moves, other); in PerformMove() 219 std::find_if(moves->begin(), moves->end(), [&](MoveOperands* move) { in PerformMove() 223 if (blocker == moves->end()) { in PerformMove() 241 auto other = (*moves)[i]; in PerformMove() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/v8/src/compiler/backend/ |
H A D | gap-resolver.cc | 96 size_t nmoves = moves->size(); in Resolve() 101 if (i < nmoves) (*moves)[i] = (*moves)[nmoves]; in Resolve() 112 if (nmoves != moves->size()) moves->resize(nmoves); in Resolve() 129 auto move = (*moves)[i]; in Resolve() 147 auto move = (*moves)[i]; in Resolve() 176 auto other = (*moves)[i]; in PerformMove() 199 PerformMove(moves, other); in PerformMove() 219 std::find_if(moves->begin(), moves->end(), [&](MoveOperands* move) { in PerformMove() 223 if (blocker == moves->end()) { in PerformMove() 241 auto other = (*moves)[i]; in PerformMove() [all …]
|
/dports/www/node10/node-v10.24.1/deps/v8/src/compiler/ |
H A D | gap-resolver.cc | 88 (*moves)[i] = moves->back(); in Resolve() 89 moves->pop_back(); in Resolve() 106 auto move = (*moves)[i]; in Resolve() 114 auto move = (*moves)[i]; in Resolve() 124 auto move = (*moves)[i]; in Resolve() 153 auto other = (*moves)[i]; in PerformMove() 176 PerformMove(moves, other); in PerformMove() 196 std::find_if(moves->begin(), moves->end(), [&](MoveOperands* move) { in PerformMove() 200 if (blocker == moves->end()) { in PerformMove() 218 auto other = (*moves)[i]; in PerformMove() [all …]
|
/dports/games/scid/scid/engines/phalanx-scid/ |
H A D | levels.c | 34 moves = atoi(l); in l_level() 62 if( moves==0 ) in l_level() 73 if( moves == 0 ) moves = 80; in l_level() 76 (increment+minutes*60/moves) in l_level() 84 Flag.moves = moves; in l_level() 95 int moves; in l_startsearch() local 101 if( Flag.moves > 0 ) moves = 2*Flag.moves; in l_startsearch() 104 moves = Counter + in l_startsearch() 107 moves += 60 - Counter/4; in l_startsearch() 108 else moves += 30; in l_startsearch() [all …]
|
/dports/games/sjeng/Sjeng-Free-11.2/ |
H A D | search.c | 242 gen (&moves[0]); in perft() 370 gen (&moves[0]); in qsearch() 691 gen(&moves[0]); in search() 933 history_h[moves[i].from][moves[i].target] += depth * depth; in search() 939 if (moves[i].from == killer1[ply].from && moves[i].target == in search() 944 else if (moves[i].from == killer2[ply].from && moves[i].target == in search() 960 else if (moves[i].from == killer3[ply].from && moves[i].target == in search() 1147 gen(&moves[0]); in search_root() 1330 if (moves[i].from == killer1[ply].from && moves[i].target == in search_root() 1374 history_h[moves[i].from][moves[i].target] += depth * depth; in search_root() [all …]
|
/dports/math/chuffed/chuffed-e04bedd/chuffed/branching/ |
H A D | branching.cpp | 49 moves.clear(); in branch() 56 int best_i = moves[ rand() % moves.size() ]; in branch() 64 moves.clear(); in branch() 71 moves.clear(); in branch() 73 moves.push(i); in branch() 81 if (so.branch_random) best_i = moves[rand()%moves.size()]; in branch() 160 int best_i = moves[rand() % moves.size()]; in branch() 168 moves.clear(); in branch() 175 moves.clear(); in branch() 177 moves.push(i); in branch() [all …]
|
/dports/games/phalanx/Phalanx-XXV/ |
H A D | levels.c | 29 int moves, seconds, minutes, increment; in l_level() local 32 moves = atoi(l); in l_level() 59 if( moves==0 ) in l_level() 66 moves, minutes, seconds, increment ); in l_level() 69 Flag.moves = moves; in l_level() 79 int moves; in l_startsearch() local 99 if( Flag.moves > 0 ) moves = 2*Flag.moves; in l_startsearch() 102 moves = Counter + in l_startsearch() 105 moves += 60 - Counter/4; in l_startsearch() 106 else moves += 30; in l_startsearch() [all …]
|
/dports/devel/py-future/future-0.18.2/tests/test_future/ |
H A D | test_standard_library.py | 383 import future.moves.urllib 384 import future.moves.urllib.parse 535 from future.moves import html 537 import future.moves.html.parser 539 from future.moves import http 540 import future.moves.http.client 543 import future.moves.http.server 545 from future.moves import queue 554 from future.moves import urllib 569 from future.moves import xmlrpc [all …]
|