mathiasbynens / esrever / 43 / 2

81%

master: 81%

Pull #12

travis-ci

Build up result in array instead of strings

Incrementally concatenating strings means a lot of intermediate
strings get allocated only to be thrown away. The result is O(n**2)
in both space and time.

See this post about Shlemiel the painter's algorithm for a good
description about the quadratic behavior involved.

Storing each fragment in an array and joining them all together
in the end at least avoids allocating ever-longer intermediate
strings. I have not run any benchmarks on very long strings,
though. That might still be interesting to do.

16 of 25 branches covered (64.0%)

21 of 26 relevant lines covered (80.77%)

32.38 hits per line