数据结构与算法（二十三）

映射抽象数据类型及Python实现

#哈希表实现：
class Hashtable:
    def __init__(self,n):
        self.size = n #根据实际情况设定
        self.slots = [None] * self.size
        self.data = [None] * self.size

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

    def rehash(self,oldhash):
        return (oldhash+1)%self.size

    def put(self,key,data):
        hashvalue = self.hashfuncation(key) #求出key所对应的散列值
        if self.slots[hashvalue] == None:
            self.slots[hashvalue] = key
            self.data[hashvalue] = data

        else:
            if self.slots[hashvalue] == key:
                self.data[hashvalue] = data
            else:
                nextslot = self.rehash(hashvalue)
                while self.slots[nextslot] != None and self.slots[nextslot] != key:
                    nextslot = self.rehash(nextslot)
                if self.slots[nextslot] == None:
                    self.slots[nextslot] = key
                    self.data[nextslot] = data
                else:
                    self.data[nextslot] = data

    def get(self,key):
        startslot = self.hashfuncation(key)
        data = None
        stop = False
        found = False
        position = startslot
        while self.slots[position] != None and not found and not stop:
            if self.slots[position] == key :
                found = True
                data = self.data[position]

            else:
                position = self.rehash(position)
                if position == startslot :
                    stop = True
        return data
    def __getitem__(self, key):
        return self.get(key)
    def __setitem__(self, key, data):
        self.put(key,data)