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

Method search_point

intervaltree/node.py:309–320  ·  view source on GitHub ↗

Returns all intervals that contain point.

(self, point, result)

Source from the content-addressed store, hash-verified

307 return result
308
309 def search_point(self, point, result):
310 """
311 Returns all intervals that contain point.
312 """
313 for k in self.s_center:
314 if k.begin <= point < k.end:
315 result.add(k)
316 if point < self.x_center and self[0]:
317 return self[0].search_point(point, result)
318 elif point > self.x_center and self[1]:
319 return self[1].search_point(point, result)
320 return result
321
322 def prune(self):
323 """

Callers 4

search_overlapMethod · 0.95
atMethod · 0.80
envelopMethod · 0.80
overlapMethod · 0.80

Calls 1

addMethod · 0.45

Tested by

no test coverage detected