You should perhaps also be aware that the values in a static array gets assigned to the array one element at a time. So
That's an unpleasant surprise. I was always under the impression statically initialized data was stored along with the string constants, like in C. This means a generated perfect has table wouldn't have much of an advantage over, let's say, a simple binary tree loaded with the values in proper order so that the tree becomes automatically balanced (without rotations like rb-trees do).
It would make sense, however, to properly initialitze initial size values for the various hashmaps currently used.