K-d tree: Difference between revisions

(Updated to work in Python2 and Python3, use __slots__ for Orthotope, use pep8 style)
Line 1,003:
m = len(exset) // 2
d = exset[m]
while m + 1 < len(exset) and exset[m + 1][split] == d[split]:
m += 1