Method put

algorithms/data_structures/hash_table.py:42–68

Insert or update a key-value pair. Args: key: The key to insert. value: The value associated with the key. Raises: ValueError: If the table is full.

(self, key: int, value: object)

        self._values: list[object] = [self._empty] * size

    def put(self, key: int, value: object) -> None:
        """Insert or update a key-value pair.

        Args:
            key: The key to insert.
            value: The value associated with the key.

        Raises:
            ValueError: If the table is full.
        """
        initial_hash = hash_ = self.hash(key)

        while True:
            if self._keys[hash_] is self._empty or self._keys[hash_] is self._deleted:
                self._keys[hash_] = key
                self._values[hash_] = value
                self._len += 1
                return
            elif self._keys[hash_] == key:
                self._keys[hash_] = key
                self._values[hash_] = value
                return

            hash_ = self._rehash(hash_)

            if initial_hash == hash_:
                raise ValueError("Table is full")

    def get(self, key: int) -> object | None:
        """Retrieve the value for a given key.