Good afternoon all, I\'m using a java.lang.StringBuilder to store some characters. I have no idea how many characters I\'m going to store in advance, except that:
There are two factors here: time and memory consumption. The time is mostly influenced by the number of times java.lang.AbstractStringBuilder.expandCapacity()
is called. Of course the cost of each call is linear to the current size of the buffer, but I am simplifying here and just counting them:
expandCapacity()
(time)StringBuilder
will expand 0 timesStringBuilder
will expand 8 timesStringBuilder
will expand 11 timesThe expected number of expandCapacity
is 3,23.
StringBuilder
will expand 0 timesStringBuilder
will expand 3 timesThe expected number of expandCapacity
is 0,03.
As you can see the second scenario seems much faster, as it very rarely has to expand the StringBuilder
(three time per every 100 inputs). Note however that first expands are less significant (copying small amount of memory); also if you add strings to the builder in huge chunks, it will expand more eagerly in less iterations.
On the other hand the memory consumption grows:
StringBuilder
will occupy 16 charactersStringBuilder
will occupy 4K charactersStringBuilder
will occupy 32K charactersThe expected average memory consumption is: 1935 characters.
StringBuilder
will occupy 4K charactersStringBuilder
will occupy 32K charactersThe expected average memory consumption is: 4383 characters.
This makes me believe that enlarging the initial buffer to 4K will increase the memory consumption by more than two times while speeding up the program by two orders of magnitude.
The bottom line is: try! It is not that hard to write a benchmark that will process million strings of various length with different initial capacity. But I believe a bigger buffer might be a good choice.