Data Structure – codewindow.in

class HashTable:
    def __init__(self):
        self.size = 100
        self.table = [[] for _ in range(self.size)]

    def hash(self, key):
        return hash(key) % self.size

    def set(self, key, value):
        h = self.hash(key)
        for i, (k, v) in enumerate(self.table[h]):
            if k == key:
                self.table[h][i] = (key, value)
                break
        else:
            self.table[h].append((key, value))

    def get(self, key):
        h = self.hash(key)
        for k, v in self.table[h]:
            if k == key:
                return v
        raise KeyError(key)

    def delete(self, key):
        h = self.hash(key)
        for i, (k, v) in enumerate(self.table[h]):
            if k == key:
                del self.table[h][i]
                break
        else:
            raise KeyError(key)