benchmark-trend 0.3.0 → 0.4.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: c3e27367eb5b2bd4fdb6f42ae8d142eafb36d20b79391ba1cc316f5e3d816f37
-  data.tar.gz: 5e894156903f8b74f3ce543d1ee01c44567fb1f681b926b8ccfcdc28929773c2
+  metadata.gz: 6729682c2148955fb9411b540070d10a51d3dd2d0ab6907fcedc909c250da34f
+  data.tar.gz: 391408701a394ddf0d61561ddc27d367a82b77a46c61e2d244ec4f1f8f444bd0
 SHA512:
-  metadata.gz: cb7f6c061e9fafd944f1ec0abc7112ad551a4065875d8496c3d9463552435263ca443c12be24eb457f7be0340dd0d4d16cd67f42be6dc030b2276b52e2890f85
-  data.tar.gz: 3f077ee1c12866e94f3e8b75cb678830386ead23aa6002db3033701862b9da123841855f29dedbe16c918fb7efcd01f9872551996b8b5b07c2f7a40af69e579f
+  metadata.gz: 14612b7218f12783d8b7cb935a04cd1e9146361faa4a0004b4b221c02e0215c63dcdfb235298a49375f39096b95a15efcf8503660452469ad1bde9cf9f455eb2
+  data.tar.gz: dc5a88b5536c9879c2f893e9710980926aae76d8af9c4ae47322727753eac59df9bb4614be6f1d7761f0cbb5b3d4141b0eb89862cbea823bc67248a35fd5147a

data/CHANGELOG.md

@@ -1,5 +1,14 @@
 # Change log
 
+## [v0.4.0] - 2020-03-07
+
+### Added
+* Add Clock for monotonic time measuring
+
+### Changed
+* Change to remove benchmark requirement
+* Change gemspec to add metadata, remove test artefacts
+
 ## [v0.3.0] - 2019-04-21
 
 ### Changed
@@ -25,6 +34,7 @@
 
 * Initial implementation and release
 
+[v0.4.0]: https://github.com/piotrmurach/benchmark-trend/compare/v0.3.0...v0.4.0
 [v0.3.0]: https://github.com/piotrmurach/benchmark-trend/compare/v0.2.0...v0.3.0
 [v0.2.0]: https://github.com/piotrmurach/benchmark-trend/compare/v0.1.0...v0.2.0
 [v0.1.0]: https://github.com/piotrmurach/benchmark-trend/compare/v0.1.0

data/README.md

@@ -256,9 +256,19 @@ print error
 
 If you are interested how a model scales for a given input use `fit_at`. This method expects that there is a fit model generated using [infer_trend](#22-infer_trend).
 
-For example, measuring Fibonacci recursive algorithm we have the following results:
+For example, measuring Fibonacci recursive algorithm:
 
 ```ruby
+numbers = Benchmark::Trend.range(1, 28, ratio: 2)
+trend, trends = Benchmark::Trend.infer_trend(numbers) do |n, i|
+  fibonacci(n)
+end
+```
+
+We get the following results:
+
+```ruby
+trends[trend]
 # =>
 # {:trend=>"1.38 * 0.00^x",
 #  :slope=>1.382889711685203,
@@ -269,7 +279,7 @@ For example, measuring Fibonacci recursive algorithm we have the following resul
 And checking model at input of `50`:
 
 ```ruby
-Benchamrk::Trend.fit_at(:exponential, slope: 1.382889711685203, intercept: 3.822775903539121e-06, n: 50)
+Benchamrk::Trend.fit_at(trend, n: 50, slope: trends[trend][:slope], intercept: trends[trend][:intercept])
 # => 41.8558455915123
 ```
 
@@ -278,7 +288,7 @@ We can see that Fibonacci with just a number 50 will take around 42 seconds to g
 How about Fibonacci with 100 as an input?
 
 ```ruby
-Benchamrk::Trend.fit_at(:exponential, slope: 1.382889711685203, intercept: 3.822775903539121e-06, n: 100)
+Benchamrk::Trend.fit_at(trend, n: 100, slope: trends[trend][:slope], intercept: trends[trend][:intercept])
 # => 458282633.9777338
 ```
 

data/lib/benchmark-trend.rb

@@ -1 +1 @@
-require_relative 'benchmark/trend'
+require_relative "benchmark/trend"

data/lib/benchmark/trend.rb

@@ -1,8 +1,7 @@
 # frozen_string_literal: true
 
-require 'benchmark'
-
-require_relative 'trend/version'
+require_relative "trend/clock"
+require_relative "trend/version"
 
 module Benchmark
   module Trend
@@ -14,31 +13,6 @@ module Benchmark
       private_class_method(method)
     end
 
-    if defined?(Process::CLOCK_MONOTONIC)
-      # Object representing current time
-      def time_now
-        Process.clock_gettime Process::CLOCK_MONOTONIC
-      end
-      module_function :time_now
-    else
-      # Object represeting current time
-      def time_now
-        Time.now
-      end
-      module_function :time_now
-    end
-
-    # Measure time elapsed with a monotonic clock
-    #
-    # @public
-    def clock_time
-      before = time_now
-      yield
-      after = time_now
-      after - before
-    end
-    module_function :clock_time
-
     # Generate a range of inputs spaced by powers.
     #
     # The default range is generated in the multiples of 8.
@@ -106,7 +80,7 @@ module Benchmark
         measurements = []
 
         repeat.times do
-          measurements << clock_time { work.(input, i) }
+          measurements << Clock.measure { work.(input, i) }
         end
 
         times << measurements.reduce(&:+).to_f / measurements.size

data/lib/benchmark/trend/clock.rb

@@ -0,0 +1,67 @@
+# frozen_string_literal: true
+
+module Benchmark
+  module Trend
+    # Clock that represents monotonic time
+    module Clock
+      # Microseconds per second
+      MICROSECONDS_PER_SECOND = 1_000_000
+
+      # Microseconds per 100ms
+      MICROSECONDS_PER_100MS = 100_000
+
+      class_definition = Class.new do
+        def initialize
+          super()
+          @last_time = Time.now.to_f
+          @lock = Mutex.new
+        end
+
+        if defined?(Process::CLOCK_MONOTONIC)
+          # @api private
+          def now
+            Process.clock_gettime(Process::CLOCK_MONOTONIC)
+          end
+        else
+          # @api private
+          def now
+            @lock.synchronize do
+              current = Time.now.to_f
+              if @last_time < current
+                @last_time = current
+              else # clock moved back in time
+                @last_time += 0.000_001
+              end
+            end
+          end
+        end
+      end
+
+      MONOTONIC_CLOCK = class_definition.new
+      private_constant :MONOTONIC_CLOCK
+
+      # Current monotonic time
+      #
+      # @return [Float]
+      #
+      # @api public
+      def now
+        MONOTONIC_CLOCK.now
+      end
+      module_function :now
+
+      # Measure time elapsed with a monotonic clock
+      #
+      # @return [Float]
+      #
+      # @public
+      def measure
+        before = now
+        yield
+        after = now
+        after - before
+      end
+      module_function :measure
+    end # Clock
+  end # Perf
+end # Benchmark

data/lib/benchmark/trend/version.rb

@@ -2,6 +2,6 @@
 
 module Benchmark
   module Trend
-    VERSION = "0.3.0"
+    VERSION = "0.4.0"
   end # Trend
 end # Benchmark

metadata

@@ -1,29 +1,15 @@
 --- !ruby/object:Gem::Specification
 name: benchmark-trend
 version: !ruby/object:Gem::Version
-  version: 0.3.0
+  version: 0.4.0
 platform: ruby
 authors:
 - Piotr Murach
 autorequire: 
-bindir: exe
+bindir: bin
 cert_chain: []
-date: 2019-04-21 00:00:00.000000000 Z
+date: 2020-03-07 00:00:00.000000000 Z
 dependencies:
-- !ruby/object:Gem::Dependency
-  name: bundler
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: 1.5.0
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: 1.5.0
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
@@ -57,36 +43,31 @@ description: Benchmark::Trend will help you estimate the computational complexit
   times, and then fitting these observations into a model that best predicts how a
   given Ruby code will scale as a function of growing workload.
 email:
-- me@piotrmurach.com
+- piotr@piotrmurach.com
 executables: []
 extensions: []
-extra_rdoc_files: []
+extra_rdoc_files:
+- README.md
+- CHANGELOG.md
+- LICENSE.txt
 files:
 - CHANGELOG.md
 - LICENSE.txt
 - README.md
-- Rakefile
-- benchmark-trend.gemspec
 - lib/benchmark-trend.rb
 - lib/benchmark/trend.rb
+- lib/benchmark/trend/clock.rb
 - lib/benchmark/trend/version.rb
-- spec/spec_helper.rb
-- spec/unit/fit_at_spec.rb
-- spec/unit/fit_exp_spec.rb
-- spec/unit/fit_linear_spec.rb
-- spec/unit/fit_log_spec.rb
-- spec/unit/fit_power_spec.rb
-- spec/unit/format_fit_spec.rb
-- spec/unit/infer_trend_spec.rb
-- spec/unit/measure_execution_time_spec.rb
-- spec/unit/range_spec.rb
-- tasks/console.rake
-- tasks/coverage.rake
-- tasks/spec.rake
 homepage: https://github.com/piotrmurach/benchmark-trend
 licenses:
 - MIT
-metadata: {}
+metadata:
+  allowed_push_host: https://rubygems.org
+  bug_tracker_uri: https://github.com/piotrmurach/benchmark-trend/issues
+  changelog_uri: https://github.com/piotrmurach/benchmark-trend/CHANGELOG.md
+  documentation_uri: https://www.rubydoc.info/gems/benchmark-trend
+  homepage_uri: https://github.com/piotrmurach/benchmark-trend
+  source_code_uri: https://github.com/piotrmurach/benchmark-trend
 post_install_message: 
 rdoc_options: []
 require_paths:
@@ -102,8 +83,8 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.0.3
+rubygems_version: 3.1.2
 signing_key: 
 specification_version: 4
-summary: Measure pefromance trends of Ruby code based on the input size distribution.
+summary: Measure performance trends of Ruby code based on the input size distribution.
 test_files: []

data/Rakefile

@@ -1,8 +0,0 @@
-require "bundler/gem_tasks"
-
-FileList['tasks/**/*.rake'].each(&method(:import))
-
-desc 'Run all specs'
-task ci: %w[ spec ]
-
-task default: :spec

data/benchmark-trend.gemspec

@@ -1,28 +0,0 @@
-lib = File.expand_path("../lib", __FILE__)
-$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
-require 'benchmark/trend/version'
-
-Gem::Specification.new do |spec|
-  spec.name          = "benchmark-trend"
-  spec.version       = Benchmark::Trend::VERSION
-  spec.authors       = ["Piotr Murach"]
-  spec.email         = ["me@piotrmurach.com"]
-
-  spec.summary       = %q{Measure pefromance trends of Ruby code based on the input size distribution.}
-  spec.description   = %q{Benchmark::Trend will help you estimate the computational complexity of Ruby code by running it on inputs increasing in size, measuring their execution times, and then fitting these observations into a model that best predicts how a given Ruby code will scale as a function of growing workload.}
-  spec.homepage      = "https://github.com/piotrmurach/benchmark-trend"
-  spec.license       = "MIT"
-
-  spec.files         = Dir['{lib,spec}/**/*.rb']
-  spec.files        += Dir['tasks/*', 'benchmark-trend.gemspec']
-  spec.files        += Dir['README.md', 'CHANGELOG.md', 'LICENSE.txt', 'Rakefile']
-  spec.bindir        = "exe"
-  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
-  spec.require_paths = ["lib"]
-
-  spec.required_ruby_version = '>= 2.0.0'
-
-  spec.add_development_dependency "bundler", ">= 1.5.0"
-  spec.add_development_dependency "rake"
-  spec.add_development_dependency "rspec", "~> 3.0"
-end

data/spec/spec_helper.rb

@@ -1,31 +0,0 @@
-# frozen_string_literal: true
-
-if ENV['COVERAGE'] || ENV['TRAVIS']
-  require 'simplecov'
-  require 'coveralls'
-
-  SimpleCov.formatter = SimpleCov::Formatter::MultiFormatter[
-    SimpleCov::Formatter::HTMLFormatter,
-    Coveralls::SimpleCov::Formatter
-  ]
-
-  SimpleCov.start do
-    command_name 'spec'
-    add_filter 'spec'
-  end
-end
-
-require "bundler/setup"
-require "benchmark/trend"
-
-RSpec.configure do |config|
-  # Enable flags like --only-failures and --next-failure
-  config.example_status_persistence_file_path = ".rspec_status"
-
-  # Disable RSpec exposing methods globally on `Module` and `main`
-  config.disable_monkey_patching!
-
-  config.expect_with :rspec do |c|
-    c.syntax = :expect
-  end
-end

data/spec/unit/fit_at_spec.rb

@@ -1,39 +0,0 @@
-# frozen_string_literal: true
-
-RSpec.describe Benchmark::Trend, '#fit_at' do
-  it "evalutes logarithmic fit model at a given value" do
-    val = Benchmark::Trend.fit_at(:logarithmic, slope: 1.5, intercept: 2, n: 10)
-
-    expect(val).to be_within(0.1).of(5.45)
-  end
-
-  it "evalutes linear fit model at a given value" do
-    val = Benchmark::Trend.fit_at(:linear, slope: 1.5, intercept: 2, n: 10)
-
-    expect(val).to eq(17)
-  end
-
-  it "evalutes power fit model at a given value" do
-    val = Benchmark::Trend.fit_at(:power, slope: 1.5, intercept: 2, n: 10)
-
-    expect(val).to be_within(0.1).of(63.24)
-  end
-
-  it "evalutes power fit model at a given value" do
-    val = Benchmark::Trend.fit_at(:exponential, slope: 1.5, intercept: 2, n: 10)
-
-    expect(val).to be_within(0.1).of(115.33)
-  end
-
-  it "doesn't recognise fit model" do
-    expect {
-      Benchmark::Trend.fit_at(:unknown, slope: 1.5, intercept: 2, n: 10)
-    }.to raise_error(ArgumentError, "Unknown fit type: unknown")
-  end
-
-  it "doesn't allow incorrect input size" do
-    expect {
-      Benchmark::Trend.fit_at(:linear, slope: 1.5, intercept: 2, n: -1)
-    }.to raise_error(ArgumentError, "Incorrect input size: -1")
-  end
-end

data/spec/unit/fit_exp_spec.rb

@@ -1,26 +0,0 @@
-# frozen_string_literal: true
-
-RSpec.describe Benchmark::Trend, '#fit_exp' do
-  it "calculates a perfect exponential fit" do
-    xs = [1, 2, 3, 4, 5]
-    ys = xs.map { |x| 1.5 * (2 ** x) }
-
-    a, b, rr = Benchmark::Trend.fit_exp(xs, ys)
-
-    expect(a).to be_within(0.001).of(2.0)
-    expect(b).to be_within(0.001).of(1.5)
-    expect(rr).to be_within(0.001).of(0.999)
-  end
-
-  it "calculates best exponential fit of y = 1.30*(1.46)^x" do
-    # the number y (in millions) of mobiles subscriberes from 1988 to 1997 USA
-    xs = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
-    ys = [1.6, 2.7, 4.4, 6.4, 8.9, 13.1, 19.3, 28.2, 38.2, 48.7]
-
-    a, b, rr = Benchmark::Trend.fit_exp(xs, ys)
-
-    expect(a).to be_within(0.001).of(1.458)
-    expect(b).to be_within(0.001).of(1.300)
-    expect(rr).to be_within(0.001).of(0.993)
-  end
-end

data/spec/unit/fit_linear_spec.rb

@@ -1,56 +0,0 @@
-# frozen_string_literal: true
-
-RSpec.describe Benchmark::Trend, '#fit_linear' do
-  it "calculates perfect linear fit" do
-    xs = [1, 2, 3, 4, 5]
-    ys = xs.map { |x| 3.0 * x + 1.0 }
-
-    a, b, rr = Benchmark::Trend.fit_linear(xs, ys)
-
-    expect(a).to eq(3.0)
-    expect(b).to eq(1.0)
-    expect(rr).to be_within(0.1).of(1)
-  end
-
-  it "calculates linear fit with noise" do
-    xs = [3.4, 3.8, 4.1, 2.2, 2.6, 2.9, 2.0, 2.7, 1.9, 3.4]
-    ys = [5.5, 5.9, 6.5, 3.3, 3.6, 4.6, 2.9, 3.6, 3.1, 4.9]
-
-    a, b, rr = Benchmark::Trend.fit_linear(xs, ys)
-
-    expect(a).to be_within(0.1).of(1.64)
-    expect(b).to be_within(0.1).of(-0.36)
-    expect(rr).to be_within(0.001).of(0.953)
-  end
-
-  it "calculates perfect constant fit" do
-    xs = [1, 2, 3, 4, 5]
-    ys = [6.0, 6.0, 6.0, 6.0, 6.0]
-
-    a, b, rr = Benchmark::Trend.fit_linear(xs, ys)
-
-    expect(a).to eq(0)
-    expect(b).to eq(6)
-    expect(rr).to eq(1)
-  end
-
-  it "calculates constant fit with noise" do
-    xs = [1, 2, 3, 4, 5]
-    ys = [1.0, 0.9, 1.0, 1.1, 1.0]
-
-    a, b, rr = Benchmark::Trend.fit_linear(xs, ys)
-
-    expect(a).to eq(0.02)
-    expect(b).to be_within(0.01).of(0.94)
-    expect(rr).to be_within(0.01).of(0.19)
-  end
-
-  it "raises when no variation in data" do
-    xs = [1, 1, 1, 1, 1]
-    ys = [1.0, 0.9, 1.0, 1.1, 1.0]
-
-    expect {
-      Benchmark::Trend.fit_linear(xs, ys)
-    }.to raise_error(ArgumentError, "No variation in data [1, 1, 1, 1, 1]")
-  end
-end

data/spec/unit/fit_log_spec.rb

@@ -1,26 +0,0 @@
-# frozen_string_literal: true
-
-RSpec.describe Benchmark::Trend, '#fit_log' do
-  it "calculates perfect logarithmic fit" do
-    xs = [1, 2, 3, 4, 5]
-    ys = xs.map { |x|  1.5 * Math.log(x) + 1.0 }
-
-    a, b, rr = Benchmark::Trend.fit_log(xs, ys)
-
-    expect(a).to be_within(0.001).of(1.5)
-    expect(b).to be_within(0.001).of(1.0)
-    expect(rr).to be_within(0.001).of(1)
-  end
-
-  it "calculates logarithmic fit with noise" do
-    # life expectancy in USA data from 1900 in 10 years periods
-    xs = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]
-    ys = [47.3, 50.0, 54.1, 59.7, 62.9, 68.2, 69.7, 70.8, 73.7, 75.4, 76.8, 78.7]
-
-    a, b, rr = Benchmark::Trend.fit_log(xs, ys)
-
-    expect(a).to be_within(0.001).of(13.857)
-    expect(b).to be_within(0.001).of(42.527)
-    expect(rr).to be_within(0.001).of(0.956)
-  end
-end

data/spec/unit/fit_power_spec.rb

@@ -1,26 +0,0 @@
-# frozen_string_literal: true
-
-RSpec.describe Benchmark::Trend, '#fit_power' do
-  it 'calculates perfect power fit' do
-    xs = [1, 2, 3, 4, 5]
-    ys = xs.map { |x| 1.5 * (x ** 2) }
-
-    a, b, rr = Benchmark::Trend.fit_power(xs, ys)
-
-    expect(a).to be_within(0.001).of(2.0)
-    expect(b).to be_within(0.001).of(1.5)
-    expect(rr).to be_within(0.001).of(1.0)
-  end
-
-  it "calcualtes best power fit of y = x^1.5" do
-    #    Mercury Venus Earth  Mars  Jupiter Saturn
-    xs = [0.387, 0.723, 1.00, 1.524, 5.203,  9.539]  # distance from the sun
-    ys = [0.241, 0.615, 1.00, 1.881, 11.862, 29.458] # period in Earth's years
-
-    a, b, rr = Benchmark::Trend.fit_power(xs, ys)
-
-    expect(a).to be_within(0.001).of(1.5)
-    expect(b).to be_within(0.001).of(1.0)
-    expect(rr).to be_within(0.001).of(0.999)
-  end
-end

data/spec/unit/format_fit_spec.rb

@@ -1,29 +0,0 @@
-# frozen_string_literal: true
-
-RSpec.describe Benchmark::Trend, '#format_fit' do
-  it "returns a logarithmic template" do
-    format = Benchmark::Trend.format_fit(:logarithmic)
-    expect(format).to eq("%.2f + %.2f*ln(x)")
-  end
-
-  it "returns a linear template" do
-    format = Benchmark::Trend.format_fit(:linear)
-    expect(format).to eq("%.2f + %.2f*x")
-  end
-
-  it "returns a power template" do
-    format = Benchmark::Trend.format_fit(:power)
-    expect(format).to eq("%.2f * x^%.2f")
-  end
-
-  it "returns a exponential template" do
-    format = Benchmark::Trend.format_fit(:exponential)
-    expect(format).to eq("%.2f * %.2f^x")
-  end
-
-  it "fails to recognise fit type" do
-    expect {
-      Benchmark::Trend.format_fit(:unknown)
-    }.to raise_error(ArgumentError, "Unknown type: 'unknown'")
-  end
-end

data/spec/unit/infer_trend_spec.rb

@@ -1,97 +0,0 @@
-# frozen_string_literal: true
-
-RSpec.describe Benchmark::Trend, '#infer_trend' do
-  # exponential
-  def fibonacci(n)
-    n == 1 || n == 0 ? n : fibonacci(n - 1) + fibonacci(n - 2)
-  end
-
-  # linear
-  def fib_mem(n, acc = {"0" => 0, "1" => 1})
-    return n if n < 2
-
-    if !acc.key?(n.to_s)
-      acc[n.to_s] = fib_mem(n - 1, acc) + fib_mem(n - 2, acc)
-    end
-    acc[n.to_s]
-  end
-
-  # linear
-  def fib_iter(n)
-    a, b = 0, 1
-    n.times { a, b = b, a + b}
-    a
-  end
-
-  # logarithmic
-  def fib_const(n)
-    phi = (1 + Math.sqrt(5))/2
-    (phi ** n / Math.sqrt(5)).round
-  end
-
-  it "infers constant trend" do
-    numbers = Benchmark::Trend.range(1, 100_000)
-    trend, = Benchmark::Trend.infer_trend(numbers, repeat: 100) do |n|
-      n
-    end
-
-    expect(trend).to eq(:constant)
-  end
-
-  it "infers fibonacci classic algorithm trend to be exponential" do
-    trend, trends = Benchmark::Trend.infer_trend((1..20), repeat: 10) do |n|
-      fibonacci(n)
-    end
-
-    expect(trend).to eq(:exponential)
-    expect(trends).to match(
-      hash_including(:exponential, :power, :linear, :logarithmic))
-    expect(trends[:exponential]).to match(
-      hash_including(:trend, :slope, :intercept, :residual)
-    )
-  end
-
-  it "infers fibonacci iterative algorithm trend to be linear" do
-    numbers = Benchmark::Trend.range(1, 20_000)
-    trend, _ = Benchmark::Trend.infer_trend(numbers) do |n|
-      fib_iter(n)
-    end
-
-    expect(trend).to eq(:linear)
-  end
-
-  it "infers fibonacci constant algorithm trend to be constant" do
-    # exponetiation by squaring has logarithmic complexity
-    numbers = Benchmark::Trend.range(1, 1400, ratio: 2)
-    trend, trends = Benchmark::Trend.infer_trend(numbers, repeat: 100) do |n|
-      fib_const(n)
-    end
-
-    expect(trend).to eq(:constant)
-    expect(trends[trend][:slope]).to be_within(0.0001).of(0)
-  end
-
-  it "infers finding maximum value trend to be linear" do
-    array_sizes = Benchmark::Trend.range(1, 100_000)
-    numbers = array_sizes.map { |n| Array.new(n) { rand(n) } }
-
-    trend, trends = Benchmark::Trend.infer_trend(array_sizes, repeat: 10) do |n, i|
-      numbers[i].max
-    end
-
-    expect(trend).to eq(:linear)
-    expect(trends[trend][:slope]).to be_within(0.0001).of(0)
-  end
-
-  it "infers binary search trend to be constant" do
-    range = Benchmark::Trend.range(10, 8 << 10, ratio: 2)
-    numbers = range.reduce([]) { |acc, n| acc << (1..n).to_a; acc }
-
-    trend, trends = Benchmark::Trend.infer_trend(range, repeat: 100) do |n, i|
-      numbers[i].bsearch { |x| x == n/2 }
-    end
-
-    expect(trend).to eq(:constant)
-    expect(trends[trend][:slope]).to be_within(0.0001).of(0)
-  end
-end

data/spec/unit/measure_execution_time_spec.rb

@@ -1,19 +0,0 @@
-# frozen_string_literal: true
-#
-RSpec.describe Benchmark::Trend, "#measure_execution_time" do
-  it "measures performance times" do
-    func = -> (x, i) { x ** 2 }
-
-    data = Benchmark::Trend.measure_execution_time(&func)
-
-    expect(data[0]).to eq([1, 8, 64, 512, 4096, 10000])
-    expect(data[1]).to match([
-      be_within(0.001).of(0.00001),
-      be_within(0.001).of(0.00001),
-      be_within(0.001).of(0.00001),
-      be_within(0.001).of(0.00001),
-      be_within(0.001).of(0.00001),
-      be_within(0.001).of(0.00001)
-    ])
-  end
-end

data/spec/unit/range_spec.rb

@@ -1,31 +0,0 @@
-# frozen_string_literal: true
-
-RSpec.describe Benchmark::Trend, '#range' do
-  it "creates default range" do
-    range = Benchmark::Trend.range(8, 8 << 10)
-    expect(range).to eq([8, 64, 512, 4096, 8192])
-  end
-
-  it "creates range with 2 multiplier" do
-    range = Benchmark::Trend.range(8, 8 << 10, ratio: 2)
-    expect(range).to eq([8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192])
-  end
-
-  it "checks range start to be valid" do
-    expect { 
-      Benchmark::Trend.range(-2, 10_000)
-    }.to raise_error(ArgumentError, "Range value: -2 needs to be greater than 0")
-  end
-
-  it "checks range end to be greater than start" do
-    expect { 
-      Benchmark::Trend.range(8, 2)
-    }.to raise_error(ArgumentError, "Range value: 2 needs to be greater than 8")
-  end
-
-  it "checks multiplier to be valid" do
-    expect { 
-      Benchmark::Trend.range(8, 32, ratio: 1)
-    }.to raise_error(ArgumentError, "Range value: 1 needs to be greater than 2")
-  end
-end

data/tasks/console.rake

@@ -1,11 +0,0 @@
-# encoding: utf-8
-
-desc 'Load gem inside irb console'
-task :console do
-  require 'irb'
-  require 'irb/completion'
-  require File.join(__FILE__, '../../lib/benchmark-trend')
-  ARGV.clear
-  IRB.start
-end
-task c: %w[ console ]

data/tasks/coverage.rake

@@ -1,11 +0,0 @@
-# encoding: utf-8
-
-desc 'Measure code coverage'
-task :coverage do
-  begin
-    original, ENV['COVERAGE'] = ENV['COVERAGE'], 'true'
-    Rake::Task['spec'].invoke
-  ensure
-    ENV['COVERAGE'] = original
-  end
-end

data/tasks/spec.rake

@@ -1,29 +0,0 @@
-# encoding: utf-8
-
-begin
-  require 'rspec/core/rake_task'
-
-  desc 'Run all specs'
-  RSpec::Core::RakeTask.new(:spec) do |task|
-    task.pattern = 'spec/{unit,integration}{,/*/**}/*_spec.rb'
-  end
-
-  namespace :spec do
-    desc 'Run unit specs'
-    RSpec::Core::RakeTask.new(:unit) do |task|
-      task.pattern = 'spec/unit{,/*/**}/*_spec.rb'
-    end
-
-    desc 'Run integration specs'
-    RSpec::Core::RakeTask.new(:integration) do |task|
-      task.pattern = 'spec/integration{,/*/**}/*_spec.rb'
-    end
-  end
-
-rescue LoadError
-  %w[spec spec:unit spec:integration].each do |name|
-    task name do
-      $stderr.puts "In order to run #{name}, do `gem install rspec`"
-    end
-  end
-end