MCPcopy Create free account
hub / github.com/chaimleib/intervaltree / begin

Method begin

intervaltree/intervaltree.py:941–949  ·  view source on GitHub ↗

Returns the lower bound of the first interval in the tree. Completes in O(1) time.

(self)

Source from the content-addressed store, hash-verified

939 return result
940
941 def begin(self):
942 """
943 Returns the lower bound of the first interval in the tree.
944
945 Completes in O(1) time.
946 """
947 if not self.boundary_table:
948 return 0
949 return self.boundary_table.keys()[0]
950
951 def end(self):
952 """

Callers 9

test_list_initFunction · 0.95
test_generator_initFunction · 0.95
test_empty_queriesFunction · 0.95
rangeMethod · 0.95
spanMethod · 0.95
__getitem__Method · 0.95
test_emptying_partialFunction · 0.80
assert_tree_boundsFunction · 0.80
test_spanFunction · 0.80

Calls

no outgoing calls

Tested by 6

test_list_initFunction · 0.76
test_generator_initFunction · 0.76
test_empty_queriesFunction · 0.76
test_emptying_partialFunction · 0.64
assert_tree_boundsFunction · 0.64
test_spanFunction · 0.64