zzh
/
bwa
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fixed a silly bug on sorted merge

This commit is contained in:
Heng Li 2013-02-05 00:41:07 -05:00
parent d6a73c9171
commit 7067af833d
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
bwamem.c
View File

@ -28,7 +28,7 @@ mem_opt_t *mem_opt_init()
o->max_occ = 10; o->max_occ = 10;
o->max_chain_gap = 10000; o->max_chain_gap = 10000;
o->mask_level = 0.50; o->mask_level = 0.50;
o->chain_drop_ratio = 0.33; o->chain_drop_ratio = 0.50;
mem_fill_scmat(o->a, o->b, o->mat); mem_fill_scmat(o->a, o->b, o->mat);
return o; return o;
} }
@ -96,7 +96,7 @@ const bwtintv_v *smem_next(smem_i *itr, int split_len)
i = j = 0; a->n = 0; i = j = 0; a->n = 0;
while (i < itr->matches->n && j < itr->sub->n) { // ordered merge while (i < itr->matches->n && j < itr->sub->n) { // ordered merge
int64_t xi = itr->matches->a[i].info>>32<<32 | (itr->len - (uint32_t)itr->matches->a[i].info); int64_t xi = itr->matches->a[i].info>>32<<32 | (itr->len - (uint32_t)itr->matches->a[i].info);
int64_t xj = itr->matches->a[j].info>>32<<32 | (itr->len - (uint32_t)itr->matches->a[j].info); int64_t xj = itr->sub->a[j].info>>32<<32 | (itr->len - (uint32_t)itr->sub->a[j].info);
if (xi < xj) { if (xi < xj) {
kv_push(bwtintv_t, *a, itr->matches->a[i]); kv_push(bwtintv_t, *a, itr->matches->a[i]);
++i; ++i;