Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

What is the optimal StringBuffer initial capacity for inputs with drastically varying lengths?

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:

  1. 60% of the time, it is only (exactly) 7 characters
  2. 39% of the time, it is (roughly) 3500 characters
  3. 1% of the time, it is roughly 20k characters

How do we go about calculating the optimal initial buffer length that should be used?

Currently I'm using new java.lang.StringBuilder(4000) but that's just because I was too lazy to think previously.

like image 428
Pacerier Avatar asked Jan 21 '12 13:01

Pacerier


People also ask

What is the initial capacity of StringBuffer object?

Constructs a string buffer with no characters in it and an initial capacity of 16 characters.

What is the capacity of StringBuffer?

By default, an empty StringBuffer contains 16 character capacity.

What is the maximum capacity of String and StringBuffer?

Java StringBuffer capacity() method The capacity refers to the total amount of characters storage size in string buffer. An empty StringBuffer class contains the default 16 character capacity.

How can you find the length and capacity of a StringBuffer?

To find the length of the StringBuffer object, the length() function is used. It is a method of the StringBuffer Class. The method returns the count of characters in the sequence.


1 Answers

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:

Number of expandCapacity() (time)

Default configuration (16 characters capacity)

  • In 60% of the cases the StringBuilder will expand 0 times
  • In 39% of the cases the StringBuilder will expand 8 times
  • In 1% of the cases the StringBuilder will expand 11 times

The expected number of expandCapacity is 3,23.

Initial capacity of 4096 characters

  • In 99% of the cases the StringBuilder will expand 0 times
  • In 1% of the cases the StringBuilder will expand 3 times

The 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:

Memory consumption

Default configuration (16 characters capacity)

  • In 60% of the cases the StringBuilder will occupy 16 characters
  • In 39% of the cases the StringBuilder will occupy 4K characters
  • In 1% of the cases the StringBuilder will occupy 32K characters

The expected average memory consumption is: 1935 characters.

Initial capacity of 4096 characters

  • In 99% of the cases the StringBuilder will occupy 4K characters
  • In 1% of the cases the StringBuilder will occupy 32K characters

The expected average memory consumption is: 4383 characters.


TL;DR

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.

like image 148
Tomasz Nurkiewicz Avatar answered Nov 09 '22 10:11

Tomasz Nurkiewicz