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

Method from_sorted_intervals

intervaltree/node.py:77–85  ·  view source on GitHub ↗

:rtype : Node

(cls, intervals)

Source from the content-addressed store, hash-verified

75
76 @classmethod
77 def from_sorted_intervals(cls, intervals):
78 """
79 :rtype : Node
80 """
81 if not intervals:
82 return None
83 node = Node()
84 node = node.init_from_sorted(intervals)
85 return node
86
87 def init_from_sorted(self, intervals):
88 # assumes that intervals is a non-empty collection.

Callers 2

from_intervalsMethod · 0.80
init_from_sortedMethod · 0.80

Calls 2

init_from_sortedMethod · 0.95
NodeClass · 0.85

Tested by

no test coverage detected