Tree: 4f5b435d9b

master

parse-bytecode

v1.22-release

v1.0

v1.0-rc1

v1.0.1

v1.1

v1.1.1

v1.10

v1.11

v1.12

v1.13

v1.14

v1.15

v1.16

v1.17

v1.18

v1.19

v1.19.1

v1.2

v1.20.0

v1.21.0

v1.22.0

v1.22.0-preview

v1.22.1

v1.22.2

v1.23.0

v1.23.0-preview

v1.24.0-preview

v1.3

v1.3.1

v1.3.10

v1.3.2

v1.3.3

v1.3.4

v1.3.5

v1.3.6

v1.3.7

v1.3.8

v1.3.9

v1.4

v1.4.1

v1.4.2

v1.4.3

v1.4.4

v1.4.5

v1.4.6

v1.5

v1.5.1

v1.5.2

v1.6

v1.7

v1.8

v1.8.1

v1.8.2

v1.8.3

v1.8.4

v1.8.5

v1.8.6

v1.8.7

v1.9

v1.9.1

v1.9.2

v1.9.3

v1.9.4

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from '4f5b435d9b'

${ noResults }

Commit Graph

1 Commits (4f5b435d9bb6da9721051105e187adc5cc39164a)

Author	SHA1	Message	Date
Damien George	77a62d8b5a	tests/stress: Add test to create a dict beyond "maximum" rehash size. 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.	7 years ago