Find a subnet that contains ip

find_ip.py

from heapq import heappush
from functools import total_ordering, reduce

def ip(s):
    return reduce(lambda r, c: c + (r << 8), map(int, s.split(".")), 0)

@total_ordering
class Subnet:
    def __init__(self, start, end):
        self.start = start
        self.end = end
    
    def __str__(self):
        return f"{self.start}-{self.end}"
    
    def __repr__(self):
        return f"Subnet({self.start}, {self.end})"

    def __eq__(self, other):
        return self.start == other.start and self.end == other.end
        
    def __lt__(self, other):
        return self.start < other.start
    
    def __getitem__(self, i):
        if i == 0:
            return self.start
        return self.end


class SubnetStorage:
    def __init__(self):
        self.heap = []
    
    def insert(self, subnet):
        heappush(self.heap, subnet)
        
    def find(self, ip):
        first = 0
        last = len(self.heap) - 1

        while first <= last:
            i = (first + last) // 2

            if self.heap[i][1] >= ip >= self.heap[i][0]:
                return self.heap[i]
            elif self.heap[i][0] > ip or self.heap[i][1] > ip:
                last = i - 1
            elif self.heap[i][0] < ip or self.heap[i][1] < ip:
                first = i + 1
            else:
                return None