python segmentation fault是什么意思-A Python Segmentation Fault?

This generates a Segmentation Fault: 11 and I have no clue why.

Before I get into it, here's the code:

import numpy.random as nprnd

import heapq

import sys

sys.setrecursionlimit(10**6)

def rlist(size, limit_low, limit_high):

for _ in xrange(size):

yield nprnd.randint(limit_low, limit_high)

def iterator_mergesort(iterator, size):

return heapq.merge(

iterator_mergesort(

(iterator.__next__ for _ in xrange(size/2)), size/2),

iterator_mergesort(

iterator, size - (size/2))

)

def test():

size = 10**3

randomiterator = rlist(size, 0, size)

sortediterator = iterator_mergesort(randomiterator, size)

assert sortediterator == sorted(randomiterator)

if __name__ == '__main__':

test()

Basically, it's just a mergesort that works on iterators and generator expressions instead of working on lists so as to minimize the memory footprint at any one time. It's nothing special, and uses the heapq.merge() built-in method for merging iterators, so I was quite surprised when everything breaks.

Running the code quickly gives Segmentation Fault: 11 and an error window telling me python has crashed. I have no idea where to look or how to debug this one, so any help would be much appreciated.