HashTable_midSquare.py

class HashTable:
    def __init__(self,size):
        self.slots=[None]*size
        self.data=[None]*size

    def store(self,item,data):
        #hashvalue=self.hashfunction(item,len(self.slots))
        hashvalue=self.mid_square(item,len(self.slots))
        
        if self.slots[hashvalue]==None:
            self.slots[hashvalue]=item
            self.data[hashvalue]=data
        else:
            nextslot=self.rehash(hashvalue,len(self.slots))
            
            while self.slots[nextslot] !=None:
                nextslot=self.rehash(nextslot,len(self.slots))
            self.slots[nextslot]=item
            self.data[nextslot]=data
            
    def hashfunction(self,item,size):
        return item%size
    
    def rehash(self,oldhash,size):
        return (oldhash+1)%size
    #mid_square Calışma sorusunun gerçeklemesi
    def mid_square(self,item,size):
        temp=item**2
        orta=int(str(temp)[(len(str(temp))/2):])
        return orta%size

    
    def search(self,item):
        #startslot=self.hashfunction(item,len(self.slots))
        startslot=self.mid_square(item,len(self.slots))
        data=None
        stop = False
        found = False

        position=startslot

        while self.slots[position] != None and \
              not found and not stop:
            if self.slots[position]==item:
                found=True
                data=self.data[position]
            else:
                position=self.rehash(position,len(self.slots))
                if position == startslot:
                    stop=True
        return data
    def __getitem__(self,item):
        return self.search(item)
    def __setitem__(self,item,data):
        self.store(item,data)