def METHOD_NAME(self, uid):
    target_key = _lowbias32(uid + 1)
    mask = self.meta.mask
    cur_index = target_key & self.meta.mask
    while True:
        entry = self._get_table_entry(cur_index)
        if entry is None:
            # Reading the bytes for the entry failed.
            return 0
        if entry.hashed_key == target_key:
            return entry.entity_addr
        if entry.hashed_key == 0:
            # We found an 'empty' entry before our target. It must not exist.
            return 0
        # Although Python supports ints of arbitrary magnitude, it still uses two's complement
        # for binary operations. So, the mask makes this work the same as it would fixed-size 32-bit ints.
        #
        # "psl" stands for "probe sequence length"
        target_psl = (cur_index - target_key) & mask
        entry_psl = (cur_index - entry.hashed_key) & mask
        if target_psl > entry_psl:
            # We've found an entry that the target would have swapped with, if the target existed.
            # The target must not exist.
            return 0
        cur_index = (cur_index + 1) & mask
    # The above loop only terminates via return