René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Hashtable - Linear probing __setitem__ not considering updates.","articleBody":"Case: Key exists after the first empty slot.\r\nIssue: Code inserts the new (key,value) instead of updating existing (key,value).\r\n``` \r\nCode in question:\r\ndef find_slot(self, key, index):\r\n        prob_range = self.get_prob_range(index)\r\n        for prob_index in prob_range:\r\n            if self.arr[prob_index] is None:\r\n                return prob_index\r\n            if self.arr[prob_index][0] == key:\r\n                return prob_index\r\n        raise Exception(\"Hashmap full\") ```\r\nMaybe this can fix it:\r\ndef find_slot(self, key, index):\r\n        first_slot = None\r\n        prob_range = self.get_prob_range(index)\r\n        for prob_index in prob_range:\r\n            if first_slot == None and self.arr[prob_index] is None:\r\n                first_slot = prob_index\r\n            if self.arr[prob_index][0] == key:\r\n                return prob_index\r\n        if first_slot is not None:\r\n           return first_slot\r\n        raise Exception(\"Hashmap full\")","author":{"url":"https://github.com/ManuMathewVarghese","@type":"Person","name":"ManuMathewVarghese"},"datePublished":"2023-06-28T02:27:25.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":0},"url":"https://github.com/78/data-structures-algorithms-python/issues/78"}