我使用python实现循环队列，但却发现与数组队列时间差别不大

# 具体遇到的问题
我使用python实现循环队列，但却发现与数组队列时间差别不大
# 报错信息的截图
python：

​

java：

# 尝试过的解决思路和结果

我完全是按照同样的思想实现的，可是两者差别却不像java那样明显
我想知道这是python语言特性的问题，还是我的实现方法有误？

import array as builtin_array


class LoopQueue:
def __init__(self, capacity: int = 20):
self._typeCode = 'h'
        self.__data = builtin_array.array(self._typeCode, (0, ) * (capacity + 1))
# print(self.__data)
        # print(len(self.__data))
        self.__front = 0
        self.__tail = 0

    def getCapacity(self) -> int:
return len(self.__data) - 1

    def isEmpty(self) -> bool:
return self.__front == self.__tail

def enqueue(self, e) -> None:
if (self.__tail + 1) % len(self.__data) == self.__front:
self.__resize(2 * self.getCapacity())
self.__data[self.__tail] = e
self.__tail = (self.__tail + 1) % len(self.__data)

def dequeue(self):
if self.isEmpty():
raise ValueError("不可从空队列中弹出元素！")
        temp = self.__data[self.__front]
# 这步可要可不要
        # self.__data[self.__front] = 0
        self.__front = (self.__front + 1) % len(self.__data)
if self.getSize() <= self.getCapacity() / 4 and int(self.getCapacity() / 2):
self.__resize(int(self.getCapacity() / 2))
return temp

def getFront(self):
if self.isEmpty():
raise ValueError("不可从空队列中查看元素！")
return self.__data[self.__front]

def getSize(self) -> int:
if self.__tail >= self.__front:
return self.__tail - self.__front
else:
return len(self.__data) - self.__front + self.__tail

def __resize(self, newCapacity: int) -> None:
        tempArray = builtin_array.array(self._typeCode, (0, ) * (newCapacity + 1))
        i = 0
        for i in range(self.getSize()):
            tempArray[i] = self.__data[(self.__front + i) % len(self.__data)]
self.__front = 0
        # 这里很重要，range不会为i加一，需要我们自己加
        self.__tail = i + 1
        self.__data = tempArray

def __str__(self):
        string = "Queue: size=%d, capacity=%d, front[" % (self.getSize(), self.getCapacity())
        i = self.__front
while not i == self.__tail:
            string += str(self.__data[i])
if not (i + 1) % len(self.__data) == self.__tail:
                string += ", "
            i = (i + 1) % len(self.__data)
        string += "] tail"
        return string


if __name__ == '__main__':
    loop_queue = LoopQueue(5)
# for i in range(100):
    #     loop_queue.enqueue(i)
    #     if i % 3 == 0:
    #         loop_queue.dequeue()
    #     print(loop_queue)

    for i in range(100):
        loop_queue.enqueue(i)
for i in range(100):
        loop_queue.dequeue()

import random

from ep2_SelectionSort.Clocker import clock
from ep5_Queue.ArrayQueue import ArrayQueue
from ep5_Queue.LoopQueue import LoopQueue


@clock
def timer(capacity, queueInstance):
for i in range(capacity):
        queueInstance.enqueue(random.randint(0, 2**15 - 1))
for i in range(capacity):
        queueInstance.dequeue()
return capacity


if __name__ == '__main__':
    capacity = 1000000
    arrayQueue = ArrayQueue()
    loopQueue = LoopQueue()
    timer(capacity, arrayQueue)
    timer(capacity, loopQueue)

import time


def clock(func):
def clocked(*args):
        t0 = time.perf_counter()
        result = func(*args)
        elapsed = time.perf_counter() - t0
name = func.__name__
        print('Time elapsed: %0.8fs, sequence length=%d' % (elapsed, result))
return result
return clocked

在这里输入代码，可通过选择【代码语言】突出显示