This turns a hard crash in a recursive generator into a 'maximum recursion depth exceeded' exception.
There is a finite list of ascending primes used for the size of a hash table, and this test tests that the code can handle a dict larger than the maximum value in that list of primes. Adding this tests gets py/map.c to 100% coverage.
