def btab_reclist_to_interval_list_0basedStart(recs): """ Return chr, list of IntervalNode """ tree = IntervalTree() for rec in recs: tree.insert(rec['rStart1'] - 1, rec['rEnd1']) path = [] tree.traverse(path.append) chr = recs[0]['chr'] return chr, path
def btab_reclist_to_interval_list_0basedStart(recs): """ Return chr, list of IntervalNode """ tree = IntervalTree() for rec in recs: tree.insert(rec['rStart1']-1, rec['rEnd1']) path = [] tree.traverse(path.append) chr = recs[0]['chr'] return chr, path
def btab_reclist_to_interval_list_0basedStart(recs): """ Return chr, list of IntervalNode """ tree = IntervalTree() for rec in recs: tree.insert(rec["rStart1"] - 1, rec["rEnd1"]) path = [] tree.traverse(path.append) seqname = recs[0]["chr"] return seqname, path
def test_empty(self): iv = IntervalTree() self.assertEqual([], iv.find(100, 300)) self.assertEqual([], iv.after(100)) self.assertEqual([], iv.before(100)) self.assertEqual([], iv.after_interval(100)) self.assertEqual([], iv.before_interval(100)) self.assertEqual([], iv.upstream_of_interval(100)) self.assertEqual([], iv.downstream_of_interval(100)) self.assertEqual(None, iv.traverse(lambda x: x.append(1)))