/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/util/bitset/test/ |
H A D | bmtest32.cpp | 1606 bvt0 &= bv_tmp; in SubTest() 1663 bvect bv_tmp; in XorCountTest() local 1668 bv_tmp |= *bv1; in XorCountTest() 1669 bv_tmp ^= *bv2; in XorCountTest() 1716 bvect bv_tmp; in XorCountTest() local 1721 bv_tmp |= *bv1; in XorCountTest() 1722 bv_tmp ^= *bv2; in XorCountTest() 1752 bvect bv_tmp; in XorCountTest() local 1804 bvect bv_tmp; in AndCountTest() local 1857 bvect bv_tmp; in AndCountTest() local [all …]
|
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/include/util/bitset/ |
H A D | bmserial.h | 6380 bv.swap(bv_tmp); in process_operation() 6383 bv.bit_or(bv_tmp); in process_operation() 6386 bv.bit_sub(bv_tmp); in process_operation() 6389 bv.bit_xor(bv_tmp); in process_operation() 6438 bvector_type bv_tmp; in deserialize_xor() local 6511 bv.swap(bv_tmp); in deserialize_xor() 6514 bv -= bv_tmp; in deserialize_xor() 6517 bv ^= bv_tmp; in deserialize_xor() 6661 bvector_type bv_tmp; in deserialize_range() local 6872 bv &= bv_tmp; in process_id_list() [all …]
|
H A D | bmsparsevec_algo.h | 208 typename SV::bvector_type bv_tmp; // TODO: get rid of temp bv variable 209 bv_tmp.resize(sv2.size()); 210 bv_tmp.invert(); // turn into true NULL vector 213 bool f = bv_null1->find_first_mismatch(bv_tmp, midx, mismatch); 221 typename SV::bvector_type bv_tmp; // TODO: get rid of temp bv variable 222 bv_tmp.resize(sv1.size()); 223 bv_tmp.invert(); 225 bool f = bv_null2->find_first_mismatch(bv_tmp, midx, mismatch);
|
H A D | bmintervals.h | 759 const BV* bv_tmp = bv_; in swap() local 761 ien.bv_ = bv_tmp; in swap()
|
H A D | bmalgo_impl.h | 1303 BV bv_tmp; in combine_and() local 1304 combine_or(bv_tmp, first, last); in combine_and() 1305 bv &= bv_tmp; in combine_and()
|
H A D | bm.h | 3624 bvector<Alloc> bv_tmp; // TODO: better optimize for SORTED case (avoid temp) in keep() local 3625 bv_tmp.import(ids, ids_size, so); in keep() 3628 bool found = bv_tmp.find_reverse(last); in keep() 3631 bv_tmp.resize(last+1); in keep() 3632 bit_and(bv_tmp); in keep() 3651 bvector<Alloc> bv_tmp; // TODO: better optimize for SORTED case (avoid temp) in clear() local 3652 bv_tmp.import(ids, ids_size, so); in clear() 3655 bool found = bv_tmp.find_reverse(last); in clear() 3658 bv_tmp.resize(last+1); in clear() 3659 bit_sub(bv_tmp); in clear()
|
/dports/biology/ncbi-blast+/ncbi-blast-2.12.0+-src/c++/include/util/bitset/ |
H A D | bmserial.h | 6380 bv.swap(bv_tmp); in process_operation() 6383 bv.bit_or(bv_tmp); in process_operation() 6386 bv.bit_sub(bv_tmp); in process_operation() 6389 bv.bit_xor(bv_tmp); in process_operation() 6438 bvector_type bv_tmp; in deserialize_xor() local 6511 bv.swap(bv_tmp); in deserialize_xor() 6514 bv -= bv_tmp; in deserialize_xor() 6517 bv ^= bv_tmp; in deserialize_xor() 6661 bvector_type bv_tmp; in deserialize_range() local 6872 bv &= bv_tmp; in process_id_list() [all …]
|
H A D | bmsparsevec_algo.h | 208 typename SV::bvector_type bv_tmp; // TODO: get rid of temp bv variable 209 bv_tmp.resize(sv2.size()); 210 bv_tmp.invert(); // turn into true NULL vector 213 bool f = bv_null1->find_first_mismatch(bv_tmp, midx, mismatch); 221 typename SV::bvector_type bv_tmp; // TODO: get rid of temp bv variable 222 bv_tmp.resize(sv1.size()); 223 bv_tmp.invert(); 225 bool f = bv_null2->find_first_mismatch(bv_tmp, midx, mismatch);
|
H A D | bmintervals.h | 759 const BV* bv_tmp = bv_; in swap() local 761 ien.bv_ = bv_tmp; in swap()
|
H A D | bmalgo_impl.h | 1303 BV bv_tmp; in combine_and() local 1304 combine_or(bv_tmp, first, last); in combine_and() 1305 bv &= bv_tmp; in combine_and()
|
H A D | bm.h | 3624 bvector<Alloc> bv_tmp; // TODO: better optimize for SORTED case (avoid temp) in keep() local 3625 bv_tmp.import(ids, ids_size, so); in keep() 3628 bool found = bv_tmp.find_reverse(last); in keep() 3631 bv_tmp.resize(last+1); in keep() 3632 bit_and(bv_tmp); in keep() 3651 bvector<Alloc> bv_tmp; // TODO: better optimize for SORTED case (avoid temp) in clear() local 3652 bv_tmp.import(ids, ids_size, so); in clear() 3655 bool found = bv_tmp.find_reverse(last); in clear() 3658 bv_tmp.resize(last+1); in clear() 3659 bit_sub(bv_tmp); in clear()
|
/dports/math/minizinc/libminizinc-2.5.5/solvers/gecode/ |
H A D | gecode_solverinstance.cpp | 1974 BoolVarArgs bv_tmp(introduced); in createBranchers() local 1981 bv_tmp[j++] = currentSpace->bv[i]; in createBranchers() 2069 currentSpace->bvAux = BoolVarArray(*this->currentSpace, bv_tmp); in createBranchers()
|
/dports/math/gecode/gecode-0916a1a/gecode/flatzinc/ |
H A D | flatzinc.cpp | 1390 BoolVarArgs bv_tmp(introduced); in createBranchers() local 1398 bv_tmp[j++] = bv[i]; in createBranchers() 1501 bv_aux = BoolVarArray(*this, bv_tmp); in createBranchers()
|
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/util/bitset/stress_test/ |
H A D | stress64.cpp | 5679 bvect bv_tmp; in ShiftRight() local 5681 bvect::bulk_insert_iterator bi = bv_tmp.inserter(); in ShiftRight() 5695 bv->swap(bv_tmp); in ShiftRight() 6083 bvect bv_tmp; in BVectorInsert() local 6085 bv_tmp.copy_range(*bv, 0, pos-1); in BVectorInsert() 6104 bv->swap(bv_tmp); in BVectorInsert() 6233 bvect bv_tmp; in BVectorErase() local 6235 bv_tmp.copy_range(*bv, 0, pos-1); in BVectorErase() 6247 bv->swap(bv_tmp); in BVectorErase() 6722 bvect bv_tmp; in SerializationOperation() local [all …]
|
H A D | stress32.cpp | 1036 bvect bv_tmp; in ShiftRight() local 1038 bvect::bulk_insert_iterator bi = bv_tmp.inserter(); in ShiftRight() 1052 bv->swap(bv_tmp); in ShiftRight() 1059 bvect bv_tmp; in BVectorInsert() local 1061 bv_tmp.copy_range(*bv, 0, pos-1); in BVectorInsert() 1080 bv->swap(bv_tmp); in BVectorInsert() 1088 bvect bv_tmp; in BVectorErase() local 1090 bv_tmp.copy_range(*bv, 0, pos-1); in BVectorErase() 1103 bv->swap(bv_tmp); in BVectorErase() 1116 bvect bv_tmp; in SerializationOperation() local [all …]
|