Python中的“真正的埃拉托色尼的筛子”——为什么heapq比dict?

Following M. O'Neill's great paper, I tried implementing some lazy, infinite versions of the Sieve of Eratosthenes in Python. I was surprised to find that the heap-based version, that the paper claims should run faster, was actually over two times slower for me., I tried imp