Home
last modified time | relevance | path

Searched refs:gap_max_bits (Results 1 – 25 of 30) sorted by relevance

12

/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/include/util/bitset/
H A Dbmintervals.h350 pos = found_nbit + (nb * bm::gap_max_bits); in find_interval_start()
472 pos = found_nbit + (nb * bm::gap_max_bits); in find_interval_end()
475 pos = found_nbit + (nb * bm::gap_max_bits); in find_interval_end()
515 pos += bm::gap_max_bits; in find_interval_end()
532 pos += bm::gap_max_bits; in find_interval_end()
657 if (gap_block[gap_pos] == bm::gap_max_bits-1) in go_to_impl()
680 gap_buf_.resize(bm::gap_max_bits+64); in go_to_impl()
687 size_type base_idx = (nb * bm::gap_max_bits); in go_to_impl()
693 if (gap_tmp[i] == bm::gap_max_bits - 1) in go_to_impl()
705 if (gap_tmp[i] == bm::gap_max_bits - 1) in go_to_impl()
[all …]
H A Dbmrs.h219 return bm::gap_max_bits; in count()
258 sb_count = (j+1) * bm::gap_max_bits; in rcount()
323 if (bc == (bm::set_sub_array_size * bm::gap_max_bits)) // FULL BLOCK in find()
327 if (rank <= bm::gap_max_bits) in find()
329 rank -= bm::gap_max_bits; in find()
336 BM_ASSERT(rank <= (bm::set_sub_array_size * bm::gap_max_bits)); in find()
395 if (bc == (bm::set_sub_array_size * bm::gap_max_bits)) // FULL BLOCK in find()
401 if (r <= bm::gap_max_bits) in find()
403 r -= bm::gap_max_bits; in find()
482 set_super_block(i, bm::set_sub_array_size * bm::gap_max_bits); in set_full_super_block()
[all …]
H A Dbmconst.h80 const unsigned gap_max_bits = 65536; variable
83 const unsigned gap_max_bits_cmrz = bm::gap_max_bits / 2;
99 const unsigned set_sub_total_bits = bm::set_sub_array_size * bm::gap_max_bits;
102 const unsigned set_total_blocks48 = bm::id_max48 / bm::gap_max_bits;
123 const unsigned sub_block3_size = bm::gap_max_bits / 4;
H A Dbmfunc.h172 idx += (j) * bm::gap_max_bits; in get_block_start()
1043 BM_ASSERT(to < bm::gap_max_bits); in digest_mask()
3175 buf[end] = bm::gap_max_bits-1; in gap_set_value()
3256 buf[end] = bm::gap_max_bits-1; in gap_set_value()
3322 buf[end] = bm::gap_max_bits - 1; in gap_add_value()
3486 if (acc != bm::gap_max_bits - 1) in gap_set_array()
6000 if (nbit == bm::gap_max_bits-1) in bit_block_find_interval_end()
6002 *pos = bm::gap_max_bits-1; in bit_block_find_interval_end()
6032 *pos = bm::gap_max_bits-1; in bit_block_find_interval_end()
7289 return bm::gap_max_bits; in bit_operation_sub_count()
[all …]
H A Dbm.h2562 if (nbit_right == bm::gap_max_bits-1) in block_count_to()
4112 bm::gap_max_bits; in find_reverse()
4182 block_pos = bm::gap_max_bits-1; in find_reverse()
4195 bm::gap_max_bits; in find_reverse()
4196 base_idx += j * bm::gap_max_bits; in find_reverse()
4238 bm::gap_max_bits; in find_reverse()
4473 BM_ASSERT(rank_in <= bm::gap_max_bits); in select()
4928 set_bit_no_check((nblock-1) * bm::gap_max_bits + bm::gap_max_bits-1); in erase()
4944 return test(nb * bm::gap_max_bits); in test_first_block_bit()
6942 (left < bm::gap_max_bits) ? 0 : (left - bm::gap_max_bits); in copy_range_no_check()
[all …]
H A Dbmsparsevec_algo.h1181 size_type total_nb = sv_sz / bm::gap_max_bits + 1; in bind()
1191 for (size_type i = 0; i < sv_sz; i+= bm::gap_max_bits) in bind()
1732 const unsigned min_distance_cutoff = bm::gap_max_bits + bm::gap_max_bits / 2; in bfind_eq_str()
1751 size_type mid = nb_r * bm::gap_max_bits; in bfind_eq_str()
1771 size_type mid = nb_r * bm::gap_max_bits + bm::sub_block3_size; in bfind_eq_str()
1776 mid = nb_r * bm::gap_max_bits + bm::sub_block3_size * 2; in bfind_eq_str()
1781 mid = nb_r * bm::gap_max_bits + bm::sub_block3_size * 3; in bfind_eq_str()
1806 mid = nb * bm::gap_max_bits; in bfind_eq_str()
1809 if (nb == 0 && r > bm::gap_max_bits) in bfind_eq_str()
1810 mid = bm::gap_max_bits; in bfind_eq_str()
H A Dbmserial.h1184 bit_idx_arr_.resize(bm::gap_max_bits); in serializer()
1216 bit_idx_arr_.resize(bm::gap_max_bits); in serializer()
1684 ibc = bm::gap_max_bits - bc; in find_bit_best_encoding_l5()
1733 unsigned min_score = bm::gap_max_bits; in find_bit_best_encoding_l5()
1931 unsigned min_score = bm::gap_max_bits; in find_bit_best_encoding()
1959 unsigned ibc = bm::gap_max_bits - bc; in find_gap_best_encoding()
3564 dst_block[len] = gap_max_bits - 1; in read_gap_block()
3569 gap_set_all(dst_block, bm::gap_max_bits, 0); in read_gap_block()
3758 bit_idx_arr_.resize(bm::gap_max_bits); in deserializer()
3761 sb_bit_idx_arr_.resize(bm::gap_max_bits); in deserializer()
[all …]
H A Dbmrandom.h118 bm::gap_word_t bit_list_[bm::gap_max_bits];
331 bm::gap_max_bits); in get_subset()
H A Dbmxor.h69 stop_gain(bm::gap_max_bits-3), in xor_sim_params()
1182 int new_ibc = int(bm::gap_max_bits) - int(s_bc_) - int(block_ibc_gain); in compute_xor_complexity_descr()
1327 if (xmd.block_gain >= (bm::gap_max_bits-3)) in search_best_xor_mask()
1356 unsigned(float(bm::gap_max_bits) / bie_bits_per_int); in search_best_xor_mask()
1482 unsigned(float(bm::gap_max_bits) / bie_bits_per_int); in compute_sim_model()
1638 unsigned ibc = bm::gap_max_bits - bc; in best_metric()
H A Dbmvmin.h198 gap_set_all((gap_word_t*)m_buf, bm::gap_max_bits, 0); in init_gapbuf()
H A Dbmalgo_impl.h1538 bit_functor.add_range(offset, bm::gap_max_bits); in for_each_bit_blk()
1786 f.add_range(base_idx, bm::gap_max_bits); in for_each_bit_block_range()
1918 typename BV::size_type sb_max_bc = bm::set_sub_array_size * bm::gap_max_bits; in convert_sub_to_arr()
/dports/biology/ncbi-blast+/ncbi-blast-2.12.0+-src/c++/include/util/bitset/
H A Dbmintervals.h350 pos = found_nbit + (nb * bm::gap_max_bits); in find_interval_start()
472 pos = found_nbit + (nb * bm::gap_max_bits); in find_interval_end()
475 pos = found_nbit + (nb * bm::gap_max_bits); in find_interval_end()
515 pos += bm::gap_max_bits; in find_interval_end()
532 pos += bm::gap_max_bits; in find_interval_end()
657 if (gap_block[gap_pos] == bm::gap_max_bits-1) in go_to_impl()
680 gap_buf_.resize(bm::gap_max_bits+64); in go_to_impl()
687 size_type base_idx = (nb * bm::gap_max_bits); in go_to_impl()
693 if (gap_tmp[i] == bm::gap_max_bits - 1) in go_to_impl()
705 if (gap_tmp[i] == bm::gap_max_bits - 1) in go_to_impl()
[all …]
H A Dbmrs.h219 return bm::gap_max_bits; in count()
258 sb_count = (j+1) * bm::gap_max_bits; in rcount()
323 if (bc == (bm::set_sub_array_size * bm::gap_max_bits)) // FULL BLOCK in find()
327 if (rank <= bm::gap_max_bits) in find()
329 rank -= bm::gap_max_bits; in find()
336 BM_ASSERT(rank <= (bm::set_sub_array_size * bm::gap_max_bits)); in find()
395 if (bc == (bm::set_sub_array_size * bm::gap_max_bits)) // FULL BLOCK in find()
401 if (r <= bm::gap_max_bits) in find()
403 r -= bm::gap_max_bits; in find()
482 set_super_block(i, bm::set_sub_array_size * bm::gap_max_bits); in set_full_super_block()
[all …]
H A Dbmconst.h80 const unsigned gap_max_bits = 65536; variable
83 const unsigned gap_max_bits_cmrz = bm::gap_max_bits / 2;
99 const unsigned set_sub_total_bits = bm::set_sub_array_size * bm::gap_max_bits;
102 const unsigned set_total_blocks48 = bm::id_max48 / bm::gap_max_bits;
123 const unsigned sub_block3_size = bm::gap_max_bits / 4;
H A Dbmfunc.h172 idx += (j) * bm::gap_max_bits; in get_block_start()
1043 BM_ASSERT(to < bm::gap_max_bits); in digest_mask()
3175 buf[end] = bm::gap_max_bits-1; in gap_set_value()
3256 buf[end] = bm::gap_max_bits-1; in gap_set_value()
3322 buf[end] = bm::gap_max_bits - 1; in gap_add_value()
3486 if (acc != bm::gap_max_bits - 1) in gap_set_array()
6000 if (nbit == bm::gap_max_bits-1) in bit_block_find_interval_end()
6002 *pos = bm::gap_max_bits-1; in bit_block_find_interval_end()
6032 *pos = bm::gap_max_bits-1; in bit_block_find_interval_end()
7289 return bm::gap_max_bits; in bit_operation_sub_count()
[all …]
H A Dbm.h2562 if (nbit_right == bm::gap_max_bits-1) in block_count_to()
4112 bm::gap_max_bits; in find_reverse()
4182 block_pos = bm::gap_max_bits-1; in find_reverse()
4195 bm::gap_max_bits; in find_reverse()
4196 base_idx += j * bm::gap_max_bits; in find_reverse()
4238 bm::gap_max_bits; in find_reverse()
4473 BM_ASSERT(rank_in <= bm::gap_max_bits); in select()
4928 set_bit_no_check((nblock-1) * bm::gap_max_bits + bm::gap_max_bits-1); in erase()
4944 return test(nb * bm::gap_max_bits); in test_first_block_bit()
6942 (left < bm::gap_max_bits) ? 0 : (left - bm::gap_max_bits); in copy_range_no_check()
[all …]
H A Dbmsparsevec_algo.h1181 size_type total_nb = sv_sz / bm::gap_max_bits + 1; in bind()
1191 for (size_type i = 0; i < sv_sz; i+= bm::gap_max_bits) in bind()
1732 const unsigned min_distance_cutoff = bm::gap_max_bits + bm::gap_max_bits / 2; in bfind_eq_str()
1751 size_type mid = nb_r * bm::gap_max_bits; in bfind_eq_str()
1771 size_type mid = nb_r * bm::gap_max_bits + bm::sub_block3_size; in bfind_eq_str()
1776 mid = nb_r * bm::gap_max_bits + bm::sub_block3_size * 2; in bfind_eq_str()
1781 mid = nb_r * bm::gap_max_bits + bm::sub_block3_size * 3; in bfind_eq_str()
1806 mid = nb * bm::gap_max_bits; in bfind_eq_str()
1809 if (nb == 0 && r > bm::gap_max_bits) in bfind_eq_str()
1810 mid = bm::gap_max_bits; in bfind_eq_str()
H A Dbmserial.h1184 bit_idx_arr_.resize(bm::gap_max_bits); in serializer()
1216 bit_idx_arr_.resize(bm::gap_max_bits); in serializer()
1684 ibc = bm::gap_max_bits - bc; in find_bit_best_encoding_l5()
1733 unsigned min_score = bm::gap_max_bits; in find_bit_best_encoding_l5()
1931 unsigned min_score = bm::gap_max_bits; in find_bit_best_encoding()
1959 unsigned ibc = bm::gap_max_bits - bc; in find_gap_best_encoding()
3564 dst_block[len] = gap_max_bits - 1; in read_gap_block()
3569 gap_set_all(dst_block, bm::gap_max_bits, 0); in read_gap_block()
3758 bit_idx_arr_.resize(bm::gap_max_bits); in deserializer()
3761 sb_bit_idx_arr_.resize(bm::gap_max_bits); in deserializer()
[all …]
H A Dbmrandom.h118 bm::gap_word_t bit_list_[bm::gap_max_bits];
331 bm::gap_max_bits); in get_subset()
H A Dbmxor.h69 stop_gain(bm::gap_max_bits-3), in xor_sim_params()
1182 int new_ibc = int(bm::gap_max_bits) - int(s_bc_) - int(block_ibc_gain); in compute_xor_complexity_descr()
1327 if (xmd.block_gain >= (bm::gap_max_bits-3)) in search_best_xor_mask()
1356 unsigned(float(bm::gap_max_bits) / bie_bits_per_int); in search_best_xor_mask()
1482 unsigned(float(bm::gap_max_bits) / bie_bits_per_int); in compute_sim_model()
1638 unsigned ibc = bm::gap_max_bits - bc; in best_metric()
H A Dbmvmin.h198 gap_set_all((gap_word_t*)m_buf, bm::gap_max_bits, 0); in init_gapbuf()
H A Dbmalgo_impl.h1538 bit_functor.add_range(offset, bm::gap_max_bits); in for_each_bit_blk()
1786 f.add_range(base_idx, bm::gap_max_bits); in for_each_bit_block_range()
1918 typename BV::size_type sb_max_bc = bm::set_sub_array_size * bm::gap_max_bits; in convert_sub_to_arr()
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/util/bitset/stress_test/
H A Drlebtv.h41 m_buf[1] = gap_max_bits - 1;
163 if(sum != bm::gap_max_bits-1) in control()
184 assert(m_buf[i] == bm::gap_max_bits-1); in control()
H A Dgena.h195 … std::uniform_int_distribution<unsigned> dist_f10_max(1, unsigned(factor) * 10 * bm::gap_max_bits);
284 … std::uniform_int_distribution<unsigned> dist_f10_max(1, unsigned(factor) * 10 * bm::gap_max_bits);
H A Dstress32.cpp10339 bvect_mini bvect_min(bm::gap_max_bits); in GAPCheck()
10360 for( i = 0; i < bm::gap_max_bits; ++i) in GAPCheck()
10540 bvect_mini bvect_min(bm::gap_max_bits); in GAPCheck()
10545 gapv.set_bit(bm::gap_max_bits-1); in GAPCheck()
10550 bvect_min.set_bit(bm::gap_max_bits-1); in GAPCheck()
10568 for (i = 0; i < bm::gap_max_bits; ++i) in GAPCheck()
10593 for ( i = 0; i < bm::gap_max_bits; ++i) in GAPCheck()
10661 bvect_mini bvect_min(bm::gap_max_bits); in GAPCheck()
10688 for (i = bm::gap_max_bits; i < 0; --i) in GAPCheck()
11109 bvect_mini bvect_min1(bm::gap_max_bits); in GAPCheck()
[all …]

12