INNER CODE UNIT · JavaScript

b

lh3/pangene · pangene.js:376

			let b = bb[bid], par = -2, nested = true;
			for (let j = 0; j < b.seg.length; ++j) {
				const seg = b.seg[j];
				if (par == -2) par = flag3[seg];
				else if (par != flag3[seg]) nested = false;
				flag3[seg] = bid;
			}
			b.par = nested? par : -2; // -2 if not nested
		}
		return bb;
	}
}

/********************************
 * Intrusive double linked list *
 ********************************/

class LinkedList {

View source record →

📰 Research Paper
Loading…
⏳ Fetching content…