INNER CODE UNIT · C

n_less

lh3/bedtk · cgranges.c:209

	n_less = cr->n_r - n;
	cr->n_r = n;
	return n_less;
}

/************
 * Indexing *
 ************/

void cr_index_prepare(cgranges_t *cr, int32_t merge)
{
	int64_t i, st;
	if (!cr_is_sorted(cr)) cr_sort(cr);
	if (merge) cr_merge_pre_index(cr);
	for (st = 0, i = 1; i <= cr->n_r; ++i) {
		if (i == cr->n_r || cr->r[i].x>>32 != cr->r[st].x>>32) {
			int32_t ctg = cr->r[st].x>>32;
			cr->ctg[ctg].off = st;

View source record →

📰 Research Paper
Loading…
⏳ Fetching content…