class Node():
     def __init__(self,key,value,level):
         '''
         :param level:每個(gè)node對應(yīng)的nexts層數(shù)不同
         '''
         self.key=key
         self.value=value
         self.nexts=[None]*level#節(jié)點(diǎn)類型next指針，初始值為空

     def __str__(self):
         #return "[key:"+str(self.key)+", value:"+str(self.value)+" len:"+str(len(self.nexts))+"]"
         return "["+str(self.key)+","+str(self.value)+","+str(len(self.nexts))+"]"

'''
跳表 Skip List ，其初衷是為了替代紅黑樹
'''
import random

import mkl_random
import time

class SkipList():
    def __init__(self):
        #頭節(jié)點(diǎn)不存儲任何數(shù)據(jù)
        self.MAX_LEVEL = 32  # 最大level層數(shù)
        self.__first=SkipList.Node(None, None, self.MAX_LEVEL)#頭節(jié)點(diǎn)
        self.__level=0#實(shí)際的level層數(shù)
        self.__size=0#Jiedian個(gè)數(shù)
        self.__p=0.25#用于生成添加節(jié)點(diǎn)時(shí)的隨機(jī)level
        return

    class Node():
        def __init__(self,key,value,level):
            '''
            :param level:每個(gè)node對應(yīng)的nexts層數(shù)不同
            '''
            self.key=key
            self.value=value
            self.nexts=[None]*level

        def __str__(self):
            #return "[key:"+str(self.key)+", value:"+str(self.value)+" len:"+str(len(self.nexts))+"]"
            return "["+str(self.key)+","+str(self.value)+","+str(len(self.nexts))+"]"

    def get(self,key):
        '''
        :param key:
        :return: key對應(yīng)的value
        '''
        self.keyCheck(key)
        node=self.__first
        for level in range(self.__level - 1,-1,-1):
            #在該層查找，key大于節(jié)點(diǎn)的key向前查找
            while node.nexts[level] and node.nexts[level].keykey:
                node=node.nexts[level]
            if node.nexts[level] and node.nexts[level].key==key:#相等則找到，否則向下尋找
                return node.nexts[level].value
        return None

    def put(self,key,value):
        '''
        return:原來的value，原來不存在key則為空
        '''
        self.keyCheck(key)
        prev=[None]*self.__level
        node=self.__first
        for i in range(self.__level - 1, -1, -1):
            while node.nexts[i] and node.nexts[i].keykey:
                node=node.nexts[i]
            if node.nexts[i] and node.nexts[i].key==key:
                oldValue=node.nexts[i].value
                node.nexts[i].value=value
                return oldValue
            prev[i]=node#保存當(dāng)前l(fā)evel小于key的node

        newLevel=self.randomLevel()
        newNode=SkipList.Node(key,value,newLevel)
        for i in range(newLevel):
            if iself.__level:
                newNode.nexts[i]=prev[i].nexts[i]
                prev[i].nexts[i]=newNode
            else:
                self.__first.nexts[i]=newNode
        self.__size+=1
        self.__level=max(self.__level, newLevel)
        return None

    def remove(self,key):
        '''
        :return: 節(jié)點(diǎn)對應(yīng)的value值，不存在則返回None
        '''
        self.keyCheck(key)
        prev=[None]*self.__level
        node=self.__first
        flag=False#該節(jié)點(diǎn)是否被查找到
        for i in range(self.__level - 1, -1, -1):
            while node.nexts[i] and node.nexts[i].keykey:
                node=node.nexts[i]
            if node.nexts[i].key==key:
                flag=True
            prev[i]=node
        if not flag:
            return None
        removedNode=node.nexts[0]#需要被刪除的節(jié)點(diǎn)
        for i in range(len(removedNode.nexts)):#該nexts一定小于等于prev的長度
            prev[i].next[i]=removedNode.nexts[i]
        self.__size-=1
        newLevel=self.__level
        while newLevel>0 and not self.__first.nexts[newLevel - 1]:
            newLevel-=1
        self.__level=newLevel
        return removedNode.value

    def keyCheck(self, key):
        '''
        限制傳入key不能為空
        '''
        if key!=0 and not key:
            raise AttributeError("key can not be None")

    def size(self):
        return self.__size

    def isEmpty(self):
        return self.__size == 0

    def randomLevel(self):#生成一個(gè)隨機(jī)的層數(shù)
        level=1
        while mkl_random.rand()self.__p and levelself.MAX_LEVEL:
            level+=1
        return level

    def __str__(self):
        result=""
        for i in range(self.__level - 1, -1, -1):
            result+=str(i)
            node = self.__first
            while node.nexts[i]:
                result+=str(node.nexts[i])
                node=node.nexts[i]
            result+='\n'
        print("level:"+str(self.__level))
        return result

    def showFirst(self):
        for item in self.__first.nexts:
            print(item,end=' ')
        print()

def timeCalculate(container, size:int):
    begin=time.time()
    for i in range(size):
        if isinstance(container,dict):
            container[i]= i * 3
        else:
            container.put(i, i * 3)
    error_count = 0
    for i in range(size):
        if container.get(i) != i * 3:
            #print("wrong " + str(i) + ":" + str(skipList.get(i)))
            error_count+=1
    end=time.time()
    print(type(container))
    print(f'error rate:{float(error_count) / size:0.5f}')
    print(f'time cost:{float(end-begin)*1000:0.3f} ms')


if __name__=='__main__':
    timeCalculate({},1000000)
    timeCalculate(SkipList(),10000)