Use initial capacity for interner hashmap

[Dandandan]

Is your feature request related to a problem or challenge? Please describe what you are trying to do.
Writing dictionary encoded arrays using parquet spends lot of time rehashing arrays.

Describe the solution you'd like

Use am initial capacity for the interner hashmap. This saves reallocating and shuffling around the table every time the capacity is too low (each time the size doubles).

Describe alternatives you've considered

n/a

Additional context