Merge pull request #40 from ProgVal/begin-end-complexity

Complexity of IntervalTree.{begin,end} is O(1), not O(n).
chaimleib · Dec 10, 2017 · 02f40c6 · 02f40c6
2 parents 1115db4 + e3f747d
commit 02f40c6
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/intervaltree/intervaltree.py b/intervaltree/intervaltree.py
@@ -818,7 +818,7 @@ def begin(self):
         """
         Returns the lower bound of the first interval in the tree.
         
-        Completes in O(n) time.
+        Completes in O(1) time.
         """
         if not self.boundary_table:
             return 0
@@ -828,7 +828,7 @@ def end(self):
         """
         Returns the upper bound of the last interval in the tree.
         
-        Completes in O(n) time.
+        Completes in O(1) time.
         """
         if not self.boundary_table:
             return 0