/dports/games/stockfish/Stockfish-sf_14/src/ |
H A D | bitbase.cpp | 65 Square ksq[COLOR_NB], psq; member 110 if ( distance(ksq[WHITE], ksq[BLACK]) <= 1 in KPKPosition() 111 || ksq[WHITE] == psq in KPKPosition() 112 || ksq[BLACK] == psq in KPKPosition() 119 && ksq[WHITE] != psq + NORTH in KPKPosition() 126 …&& ( !(attacks_bb<KING>(ksq[BLACK]) & ~(attacks_bb<KING>(ksq[WHITE]) | pawn_attacks_bb(WHITE, psq… in KPKPosition() 127 || (attacks_bb<KING>(ksq[BLACK]) & ~attacks_bb<KING>(ksq[WHITE]) & psq))) in KPKPosition() 159 r |= db[index(BLACK, ksq[BLACK], ksq[WHITE], psq + NORTH)]; in classify() 162 && psq + NORTH != ksq[WHITE] in classify() 163 && psq + NORTH != ksq[BLACK]) in classify() [all …]
|
H A D | movegen.cpp | 79 Square ksq = pos.square<KING>(Them); in generate_pawn_moves() local 80 Bitboard dcCandidatePawns = pos.blockers_for_king(Them) & ~file_bb(ksq); in generate_pawn_moves() 81 b1 &= pawn_attacks_bb(Them, ksq) | shift< Up>(dcCandidatePawns); in generate_pawn_moves() 82 b2 &= pawn_attacks_bb(Them, ksq) | shift<Up+Up>(dcCandidatePawns); in generate_pawn_moves() 187 const Square ksq = pos.square<KING>(Us); in generate_all() local 193 target = Type == EVASIONS ? between_bb(ksq, lsb(pos.checkers())) in generate_all() 205 if (!Checks || pos.blockers_for_king(~Us) & ksq) in generate_all() 207 Bitboard b = attacks_bb<KING>(ksq) & (Type == EVASIONS ? ~pos.pieces(Us) : target); in generate_all() 212 *moveList++ = make_move(ksq, pop_lsb(b)); in generate_all() 217 *moveList++ = make<CASTLING>(ksq, pos.castling_rook_square(cr)); in generate_all() [all …]
|
H A D | pawns.cpp | 231 Score Entry::evaluate_shelter(const Position& pos, Square ksq) const { in evaluate_shelter() 235 Bitboard b = pos.pieces(PAWN) & ~forward_ranks_bb(Them, ksq); in evaluate_shelter() 241 File center = std::clamp(file_of(ksq), FILE_B, FILE_G); in evaluate_shelter() 260 bonus -= KingOnFile[pos.is_on_semiopen_file(Us, ksq)][pos.is_on_semiopen_file(Them, ksq)]; in evaluate_shelter() 272 Square ksq = pos.square<KING>(Us); in do_king_safety() local 273 kingSquares[Us] = ksq; in do_king_safety() 277 Score shelter = evaluate_shelter<Us>(pos, ksq); in do_king_safety() 291 if (pawns & attacks_bb<KING>(ksq)) in do_king_safety() 294 minPawnDist = std::min(minPawnDist, distance(ksq, pop_lsb(pawns))); in do_king_safety()
|
H A D | evaluate.cpp | 353 const Square ksq = pos.square<KING>(Us); in initialize() local 365 attackedBy[Us][KING] = attacks_bb<KING>(ksq); in initialize() 371 Square s = make_square(std::clamp(file_of(ksq), FILE_B, FILE_G), in initialize() 372 std::clamp(rank_of(ksq), RANK_2, RANK_7)); in initialize() 540 const Square ksq = pos.square<KING>(Us); in king() local 554 b1 = attacks_bb<ROOK >(ksq, pos.pieces() ^ pos.pieces(Us, QUEEN)); in king() 555 b2 = attacks_bb<BISHOP>(ksq, pos.pieces() ^ pos.pieces(Us, QUEEN)); in king() 582 knightChecks = attacks_bb<KNIGHT>(ksq) & attackedBy[Them][KNIGHT]; in king() 590 b1 = attackedBy[Them][ALL_PIECES] & KingFlank[file_of(ksq)] & Camp; in king() 592 b3 = attackedBy[Us][ALL_PIECES] & KingFlank[file_of(ksq)] & Camp; in king() [all …]
|
H A D | position.cpp | 320 Square ksq = square<KING>(~sideToMove); in set_check_info() local 322 si->checkSquares[PAWN] = pawn_attacks_bb(~sideToMove, ksq); in set_check_info() 323 si->checkSquares[KNIGHT] = attacks_bb<KNIGHT>(ksq); in set_check_info() 324 si->checkSquares[BISHOP] = attacks_bb<BISHOP>(ksq, pieces()); in set_check_info() 325 si->checkSquares[ROOK] = attacks_bb<ROOK>(ksq, pieces()); in set_check_info() 510 Square ksq = square<KING>(us); in legal() local 519 return !(attacks_bb< ROOK>(ksq, occupied) & pieces(~us, QUEEN, ROOK)) in legal() 520 && !(attacks_bb<BISHOP>(ksq, occupied) & pieces(~us, QUEEN, BISHOP)); in legal() 669 Square ksq = square<KING>(~sideToMove); in gives_check() local 672 return (attacks_bb<ROOK>(rto) & ksq) in gives_check() [all …]
|
/dports/games/stockfish/Stockfish-sf_14/src/nnue/features/ |
H A D | half_ka_v2.cpp | 33 inline IndexType HalfKAv2::make_index(Color perspective, Square s, Piece pc, Square ksq) { in make_index() argument 34 return IndexType(orient(perspective, s) + PieceSquareIndex[perspective][pc] + PS_NB * ksq); in make_index() 43 Square ksq = orient(perspective, pos.square<KING>(perspective)); in append_active_indices() local 48 active.push_back(make_index(perspective, s, pos.piece_on(s), ksq)); in append_active_indices() 56 Square ksq, in append_changed_indices() argument 63 Square oriented_ksq = orient(perspective, ksq); in append_changed_indices()
|
H A D | half_ka_v2.h | 69 static IndexType make_index(Color perspective, Square s, Piece pc, Square ksq); 93 Square ksq,
|
/dports/biology/trimadap/trimadap-0.1-3-gddfef21/ |
H A D | ksw.c | 396 kseq_t *kst, *ksq; in main() local 425 fpq = gzopen(argv[optind+1], "r"); ksq = kseq_init(fpq); in main() 427 while (kseq_read(ksq) > 0) { in main() 430 for (i = 0; i < (int)ksq->seq.l; ++i) ksq->seq.s[i] = seq_nt4_table[(int)ksq->seq.s[i]]; in main() 432 if ((int)ksq->seq.m > max_rseq) { in main() 433 max_rseq = ksq->seq.m; in main() 436 for (i = 0, j = ksq->seq.l - 1; i < (int)ksq->seq.l; ++i, --j) in main() 437 rseq[j] = ksq->seq.s[i] == 4? 4 : 3 - ksq->seq.s[i]; in main() 442 …r = ksw_align(ksq->seq.l, (uint8_t*)ksq->seq.s, kst->seq.l, (uint8_t*)kst->seq.s, 5, mat, gapo, ga… in main() 448 …%s\t%d\t%d\t%d\t%d\t%d\n", kst->name.s, r.tb, r.te+1, ksq->name.s, (int)ksq->seq.l - r.qb, (int)ks… in main() [all …]
|
/dports/www/h2o-devel/h2o-dcc7134/deps/klib/ |
H A D | ksw.c | 571 kseq_t *kst, *ksq; in main() local 600 fpq = gzopen(argv[optind+1], "r"); ksq = kseq_init(fpq); in main() 602 while (kseq_read(ksq) > 0) { in main() 605 for (i = 0; i < (int)ksq->seq.l; ++i) ksq->seq.s[i] = seq_nt4_table[(int)ksq->seq.s[i]]; in main() 607 if ((int)ksq->seq.m > max_rseq) { in main() 608 max_rseq = ksq->seq.m; in main() 611 for (i = 0, j = ksq->seq.l - 1; i < (int)ksq->seq.l; ++i, --j) in main() 612 rseq[j] = ksq->seq.s[i] == 4? 4 : 3 - ksq->seq.s[i]; in main() 617 …r = ksw_align(ksq->seq.l, (uint8_t*)ksq->seq.s, kst->seq.l, (uint8_t*)kst->seq.s, 5, mat, gapo, ga… in main() 623 …%s\t%d\t%d\t%d\t%d\t%d\n", kst->name.s, r.tb, r.te+1, ksq->name.s, (int)ksq->seq.l - r.qb, (int)ks… in main() [all …]
|
/dports/science/qmcpack/qmcpack-3.11.0/src/Particle/LongRange/ |
H A D | EwaldHandler.cpp | 68 kMag[ks] = std::sqrt(KList.ksq[ki]); in fillFk() 85 mRealType t2e = KList.ksq[ki] * kgauss; in fillFk() 86 mRealType uk = knorm * std::exp(-t2e) / KList.ksq[ki]; in fillFk() 97 mRealType t2e = KList.ksq[ki] * kgauss; in fillFk() 98 mRealType uk = knorm * std::exp(-t2e) / KList.ksq[ki]; in fillFk()
|
H A D | EwaldHandler3D.cpp | 68 mRealType t2e = KList.ksq[ki] * kgauss; in fillFk() 69 mRealType uk = knorm * std::exp(-t2e) / KList.ksq[ki]; in fillFk()
|
/dports/biology/bwa/bwa-0.7.17/ |
H A D | ksw.c | 653 kseq_t *kst, *ksq; in main() local 682 fpq = xzopen(argv[optind+1], "r"); ksq = kseq_init(fpq); in main() 684 while (kseq_read(ksq) > 0) { in main() 687 for (i = 0; i < (int)ksq->seq.l; ++i) ksq->seq.s[i] = seq_nt4_table[(int)ksq->seq.s[i]]; in main() 689 if ((int)ksq->seq.m > max_rseq) { in main() 690 max_rseq = ksq->seq.m; in main() 693 for (i = 0, j = ksq->seq.l - 1; i < (int)ksq->seq.l; ++i, --j) in main() 694 rseq[j] = ksq->seq.s[i] == 4? 4 : 3 - ksq->seq.s[i]; in main() 699 …r = ksw_align(ksq->seq.l, (uint8_t*)ksq->seq.s, kst->seq.l, (uint8_t*)kst->seq.s, 5, mat, gapo, ga… in main() 705 …%s\t%d\t%d\t%d\t%d\t%d\n", kst->name.s, r.tb, r.te+1, ksq->name.s, (int)ksq->seq.l - r.qb, (int)ks… in main() [all …]
|
/dports/science/qmcpack/qmcpack-3.11.0/src/QMCWaveFunctions/ElectronGas/ |
H A D | HEGGrid.h | 215 T minus_ksq = -Lattice.ksq(*ns_it); 226 MaxKsq = Lattice.ksq(*((*rs_it).second->begin())); 265 kp->k2 = Lattice.ksq(k); 698 T minus_ksq = -Lattice.ksq(*ns_it); 709 MaxKsq = Lattice.ksq(*((*rs_it).second->begin())); 730 mk2[ikpt] = -Lattice.ksq(twistAngle); 740 T ksq = Lattice.ksq(k0); 742 mk2[ikpt] = -ksq; 746 ksq = Lattice.ksq(k0); 748 mk2[ikpt] = -ksq;
|
/dports/math/fftw3-long/fftw-3.3.9/dft/ |
H A D | bluestein.c | 39 INT k, ksq, n2 = 2 * n; in bluestein_sequence() local 42 ksq = 0; in bluestein_sequence() 44 t->cexp(t, ksq, w+2*k); in bluestein_sequence() 46 ksq += 2*k + 1; while (ksq > n2) ksq -= n2; in bluestein_sequence()
|
/dports/math/fftw3/fftw-3.3.9/dft/ |
H A D | bluestein.c | 39 INT k, ksq, n2 = 2 * n; in bluestein_sequence() local 42 ksq = 0; in bluestein_sequence() 44 t->cexp(t, ksq, w+2*k); in bluestein_sequence() 46 ksq += 2*k + 1; while (ksq > n2) ksq -= n2; in bluestein_sequence()
|
/dports/math/fftw3-float/fftw-3.3.9/dft/ |
H A D | bluestein.c | 39 INT k, ksq, n2 = 2 * n; in bluestein_sequence() local 42 ksq = 0; in bluestein_sequence() 44 t->cexp(t, ksq, w+2*k); in bluestein_sequence() 46 ksq += 2*k + 1; while (ksq > n2) ksq -= n2; in bluestein_sequence()
|
/dports/math/fftw3-quad/fftw-3.3.9/dft/ |
H A D | bluestein.c | 39 INT k, ksq, n2 = 2 * n; in bluestein_sequence() local 42 ksq = 0; in bluestein_sequence() 44 t->cexp(t, ksq, w+2*k); in bluestein_sequence() 46 ksq += 2*k + 1; while (ksq > n2) ksq -= n2; in bluestein_sequence()
|
/dports/math/fxt/fxt/demo/sort/ |
H A D | equivclass-bitstring-demo.cc | 54 ulong ksq = 0; in main() local 55 NXARG(ksq, "Whether to print key-sorted array."); in main() 77 if ( ksq ) in main()
|
H A D | equivclass-necklaces-demo.cc | 54 ulong ksq = 0; in main() local 55 NXARG(ksq, "Whether to print key-sorted array."); in main() 77 if ( ksq ) in main()
|
H A D | equivclass-bracelets-demo.cc | 61 ulong ksq = 0; in main() local 62 NXARG(ksq, "Whether to print key-sorted array."); in main() 84 if ( ksq ) in main()
|
/dports/audio/csound/csound-6.15.0/Opcodes/ |
H A D | pitchtrack.c | 562 double k, ksq, div, ksqQ; in update_coefs() local 567 ksq = k*k; in update_coefs() 568 ksqQ = ksq*Q; in update_coefs() 570 biquad->b1 = (2*Q*(ksq-1.))/div; in update_coefs() 579 ksq = k*k; in update_coefs() 580 biquad->a0 = 1.0 / ( 1.0 + ROOT2 * k + ksq); in update_coefs() 583 biquad->b1 = 2.0 * (1.0 - ksq) * biquad->a0; in update_coefs() 584 biquad->b2 = ( 1.0 - ROOT2 * k + ksq) * biquad->a0; in update_coefs() 589 ksq = k*k; in update_coefs() 590 biquad->a0 = 1.0 / ( 1.0 + ROOT2 * k + ksq); in update_coefs() [all …]
|
/dports/math/fftw3-float/fftw-3.3.9/libbench2/ |
H A D | mp.c | 471 int k, ksq, n2 = 2 * n; in bluestein_sequence() local 473 ksq = 1; /* (-1)^2 */ in bluestein_sequence() 476 ksq = ksq + 2*k - 1; while (ksq > n2) ksq -= n2; in bluestein_sequence() 477 mcexp(ksq, n2, a[2*k], a[2*k+1]); in bluestein_sequence()
|
/dports/math/fftw3/fftw-3.3.9/libbench2/ |
H A D | mp.c | 471 int k, ksq, n2 = 2 * n; in bluestein_sequence() local 473 ksq = 1; /* (-1)^2 */ in bluestein_sequence() 476 ksq = ksq + 2*k - 1; while (ksq > n2) ksq -= n2; in bluestein_sequence() 477 mcexp(ksq, n2, a[2*k], a[2*k+1]); in bluestein_sequence()
|
/dports/math/fftw3-long/fftw-3.3.9/libbench2/ |
H A D | mp.c | 471 int k, ksq, n2 = 2 * n; in bluestein_sequence() local 473 ksq = 1; /* (-1)^2 */ in bluestein_sequence() 476 ksq = ksq + 2*k - 1; while (ksq > n2) ksq -= n2; in bluestein_sequence() 477 mcexp(ksq, n2, a[2*k], a[2*k+1]); in bluestein_sequence()
|
/dports/math/fftw3-quad/fftw-3.3.9/libbench2/ |
H A D | mp.c | 471 int k, ksq, n2 = 2 * n; in bluestein_sequence() local 473 ksq = 1; /* (-1)^2 */ in bluestein_sequence() 476 ksq = ksq + 2*k - 1; while (ksq > n2) ksq -= n2; in bluestein_sequence() 477 mcexp(ksq, n2, a[2*k], a[2*k+1]); in bluestein_sequence()
|