Performance of JSF and HashMap

Question

Using Java profiler I've noticed that with large number of components on the page time of HashMap.put calls plays significant role.
Is there a way to control initial capacity of hash maps in Sun RI?
Does Sun RI tries to set initial capacity and load factor in the code?
Per Java 5 API docs:
An instance of HashMap has two parameters that affect its performance: initial capacity and load factor. The capacity is the number of buckets in the hash table, and the initial capacity is simply the capacity at the time the hash table is created. The load factor is a measure of how full the hash table is allowed to get before its capacity is automatically increased. When the number of entries in the hash table exceeds the product of the load factor and the current capacity, the capacity is roughly doubled by calling the rehash method.
It would be nice if JSF RI could guess more appropriate capacity and load factor to minimize performance impact on extensive HashMap.put() calls.
Thanks

Answer 1

This is an example of what I was talking about in the other thread. I was saying that if you use an unusual page as the basis for your performance tests, you will end up optimizing for the extreme case at the expense of the normal case. If changes are made in this area care must be taken not to cater to the extreme at the expense of the usual.
If the implementation starts with a higher capacity in the map initially, that means more memory is being used. If the capacity is optimized for pages with large numbers of components, the memory is wasted.