Do not traverse the string twice in String.slice(<str>, <range>)

The approach I've taken here is to keep byte sizes of each codepoint in a list until we reach the end of the string, then we calculate byte offsets and call `binary_part` once.

This uses the amount of memory proportional to the absolute value of the smallest offset in the range just to keep the byte sizes. I can't say exactly how much more memory it uses compared to keeping an accumulator on master.

I've tried replacing lists with binary arithmetic and queues. Both techniques showed worse performance than master.

Feel free to reject this PR as it adds more complexity to the code with not as much gain as I had hoped.

Some graphs (benchmark code – https://gist.github.com/alco/330d7b8a601bfed057dc). The dark green bars are master, the lighter green bars are this PR. The Y axis is execution time in microseconds.
![slice_left](https://cloud.githubusercontent.com/assets/207748/3584137/490364a8-0c14-11e4-87e6-a147556fca72.png)
![slice_right](https://cloud.githubusercontent.com/assets/207748/3584139/5093a46c-0c14-11e4-9378-d9f13b05553f.png)
![slice_both](https://cloud.githubusercontent.com/assets/207748/3584141/54d5b04c-0c14-11e4-8e24-525244a734f3.png)

Here's an example where the right bounds is small (`-8`). Average improvement is 36% less time. Compare that the graph above where the right bound was `-length(str)/2`; there the improvement was 5-7%. This better illustrates the assumption of small negative bounds I explained earlier.
![slice_right_8](https://cloud.githubusercontent.com/assets/207748/3587854/353256b8-0c3d-11e4-9f8a-3ec1f093403d.png)