benchmarking Ruby string slicing

string_slicing_benchmark.rb

require 'benchmark'

# generate some random strings
n = 5_000_000
string_n = ''
string_2n = ''
letters = ('a'..'z').to_a
n.times { string_n << letters.sample }
(n * 2).times { string_2n << letters.sample }

n = 1_000
puts 'Slice half of string:'
Benchmark.bm do |b|
  b.report('includes last character; n') do
    n.times do
      string_n[(string_n.length / 2)..-1]
    end
  end

  b.report('includes last character; 2n') do
    n.times do
      string_2n[(string_2n.length / 2)..-1]
    end
  end

  b.report("doesn't include last character; n") do
    n.times do
      string_n[((string_n.length / 2) - 1)..-2]
    end
  end

  b.report("doesn't include last character; 2n") do
    n.times do
      string_2n[((string_2n.length / 2) - 1)..-2]
    end
  end
end

results.txt

Slice half of string:
       user     system      total        real
includes last character; n  0.000000   0.000000   0.000000 (  0.000378)
includes last character; 2n  0.000000   0.000000   0.000000 (  0.000343)
doesn't include last character; n  0.540000   0.430000   0.970000 (  1.028334)
doesn't include last character; 2n  1.270000   0.760000   2.030000 (  2.069830)

Interesting idea, and very plausible. I suspect you might be right. That would indeed be a bear to debug. If correct, it's tantalizing to think about the performance gain that would be possible for Ruby, but for the (relatively small, I would think) set of Ruby applications that need to use C libraries to work with Ruby-sliced strings. On the other hand, I guess if one has to slice a 2.5 megabyte substring 1,000 times just for it to take 1 second on a laptop computer, then maybe there aren't really too many noteworthy, real-world performance gains being left on the table, except for a very small set of apps that are doings a lot of slicing of large strings. Back on the other hand, every little bit helps. And transforming an operation from O(n) to O(1) is just so satisfying. :)