benchmark-trend 0.2.0 → 0.3.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 2684a8a9c5ed41c53e7510602d352dccb111150e7ce757567f3e1340a679eb5f
-  data.tar.gz: 8b7363a4ca90e53557d1a4397e30a5a37a93515976a42773c5225d1715e00ae3
+  metadata.gz: c3e27367eb5b2bd4fdb6f42ae8d142eafb36d20b79391ba1cc316f5e3d816f37
+  data.tar.gz: 5e894156903f8b74f3ce543d1ee01c44567fb1f681b926b8ccfcdc28929773c2
 SHA512:
-  metadata.gz: 4d27391b226536bb79d6dbe5e75ba3d66cf2362993b9d6afcb5409ea2a8a999deef276d7708a6c0bfa9b28eeeaffd9f31d8b2238e9f3daff21e3357baa80397d
-  data.tar.gz: bdae380f8bdaf37432cda9f03820421fb9f7fb00f9633d0c8a9a0b5b575f566ef905f9ec70ab83c4d0eaeb64162c2a43d7fe659722c90576db40ad621a553ed6
+  metadata.gz: cb7f6c061e9fafd944f1ec0abc7112ad551a4065875d8496c3d9463552435263ca443c12be24eb457f7be0340dd0d4d16cd67f42be6dc030b2276b52e2890f85
+  data.tar.gz: 3f077ee1c12866e94f3e8b75cb678830386ead23aa6002db3033701862b9da123841855f29dedbe16c918fb7efcd01f9872551996b8b5b07c2f7a40af69e579f

data/CHANGELOG.md

@@ -1,5 +1,11 @@
 # Change log
 
+## [v0.3.0] - 2019-04-21
+
+### Changed
+* Change to require Ruby >= 2.0.0
+* Change to relax development dependencies
+
 ## [v0.2.0] - 2018-09-30
 
 ### Added
@@ -17,7 +23,8 @@
 
 ## [v0.1.0] - 2018-09-08
 
-* Inital implementation and release
+* Initial implementation and release
 
+[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

@@ -20,7 +20,7 @@
 
 ## Why?
 
-Tests provide safety net that ensures your code works correctly. What you don't know is how fast your code is! How does it scale with different input sizes? Your code may have computational complexity that doens't scale with large workloads. It would be good to know before your application goes into production, wouldn't it?
+Tests provide safety net that ensures your code works correctly. What you don't know is how fast your code is! How does it scale with different input sizes? Your code may have computational complexity that doesn't scale with large workloads. It would be good to know before your application goes into production, wouldn't it?
 
 **Benchmark::Trend** will allow you to uncover performance bugs or confirm that a Ruby code performance scales as expected.
 
@@ -54,11 +54,11 @@ Or install it yourself as:
 
 ## 1. Usage
 
-Let's assume we would like to find out behaviour of a Fibonnacci algorithm:
+Let's assume we would like to find out behaviour of a Fibonacci algorithm:
 
 ```ruby
 def fibonacci(n)
-  n == 1 || n == 0 ? n : fibonacci(n - 1) + fibonacci(n - 2)
+  n < 2 ? n : fibonacci(n - 1) + fibonacci(n - 2)
 end
 ```
 
@@ -143,7 +143,7 @@ For example, let's assume you would like to find out asymptotic behaviour of a F
 
 ```ruby
 def fibonacci(n)
-  n == 1 || n == 0 ? n : fibonacci(n - 1) + fibonacci(n - 2)
+  n < 2 ? n : fibonacci(n - 1) + fibonacci(n - 2)
 end
 ```
 
@@ -254,16 +254,16 @@ print error
 
 ### 2.4 fit_at
 
-If you are interestd 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).
+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:
 
 ```ruby
 # =>
-{:trend=>"1.38 * 0.00^x",
- :slope=>1.382889711685203,
- :intercept=>3.822775903539121e-06,
- :residual=>0.9052392775178072}
+# {:trend=>"1.38 * 0.00^x",
+#  :slope=>1.382889711685203,
+#  :intercept=>3.822775903539121e-06,
+#  :residual=>0.9052392775178072}
 ```
 
 And checking model at input of `50`:
@@ -311,7 +311,7 @@ trend, trends = Benchmark::Trend.infer_trend(array_sizes) do |n, i|
 end
 ```
 
-Unsuprisingly, we discover that Ruby's `max` call scales linearily with the input size:
+Unsurprisingly, we discover that Ruby's `max` call scales linearily with the input size:
 
 ```ruby
 print trend

data/benchmark-trend.gemspec

@@ -6,15 +6,15 @@ Gem::Specification.new do |spec|
   spec.name          = "benchmark-trend"
   spec.version       = Benchmark::Trend::VERSION
   spec.authors       = ["Piotr Murach"]
-  spec.email         = [""]
+  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,examples}/**/*.rb']
-  spec.files        += Dir['{bin,exe,tasks}/*', 'benchmark-trend.gemspec']
+  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) }
@@ -22,7 +22,7 @@ Gem::Specification.new do |spec|
 
   spec.required_ruby_version = '>= 2.0.0'
 
-  spec.add_development_dependency "bundler", "~> 1.16"
-  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "bundler", ">= 1.5.0"
+  spec.add_development_dependency "rake"
   spec.add_development_dependency "rspec", "~> 3.0"
 end

data/lib/benchmark/trend/version.rb

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

metadata

@@ -1,43 +1,43 @@
 --- !ruby/object:Gem::Specification
 name: benchmark-trend
 version: !ruby/object:Gem::Version
-  version: 0.2.0
+  version: 0.3.0
 platform: ruby
 authors:
 - Piotr Murach
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2018-09-30 00:00:00.000000000 Z
+date: 2019-04-21 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '1.16'
+        version: 1.5.0
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '1.16'
+        version: 1.5.0
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '10.0'
+        version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '10.0'
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: rspec
   requirement: !ruby/object:Gem::Requirement
@@ -57,9 +57,8 @@ 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:
-- ''
-executables:
-- bench-trend
+- me@piotrmurach.com
+executables: []
 extensions: []
 extra_rdoc_files: []
 files:
@@ -68,11 +67,6 @@ files:
 - README.md
 - Rakefile
 - benchmark-trend.gemspec
-- bin/console
-- bin/setup
-- examples/fib_constant.rb
-- examples/fib_linear.rb
-- exe/bench-trend
 - lib/benchmark-trend.rb
 - lib/benchmark/trend.rb
 - lib/benchmark/trend/version.rb
@@ -108,8 +102,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubyforge_project: 
-rubygems_version: 2.7.3
+rubygems_version: 3.0.3
 signing_key: 
 specification_version: 4
 summary: Measure pefromance trends of Ruby code based on the input size distribution.

data/bin/console

@@ -1,14 +0,0 @@
-#!/usr/bin/env ruby
-
-require "bundler/setup"
-require "benchmark/trend"
-
-# You can add fixtures and/or initialization code here to make experimenting
-# with your gem easier. You can also use a different console, if you like.
-
-# (If you use this, don't forget to add pry to your Gemfile!)
-# require "pry"
-# Pry.start
-
-require "irb"
-IRB.start(__FILE__)

data/bin/setup

@@ -1,8 +0,0 @@
-#!/usr/bin/env bash
-set -euo pipefail
-IFS=$'\n\t'
-set -vx
-
-bundle install
-
-# Do any other automated setup that you need to do here

data/examples/fib_constant.rb

@@ -1,16 +0,0 @@
-require_relative '../lib/benchmark-trend'
-
-# constant
-def fib_const(n)
-  phi = (1 + Math.sqrt(5))/2
-  (phi ** n / Math.sqrt(5)).round
-end
-
-numbers = Benchmark::Trend.range(1, 1400, ratio: 2)
-trend, trends = Benchmark::Trend.infer_trend(numbers, repeat: 100) do |n|
-  fib_const(n)
-end
-
-puts "Trend: #{trend}"
-puts "Trend data:"
-pp trends

data/examples/fib_linear.rb

@@ -1,17 +0,0 @@
-require_relative '../lib/benchmark-trend'
-
-# linear
-def fib_iter(n)
-  a, b = 0, 1
-  n.times { a, b = b, a + b}
-  a
-end
-
-numbers = Benchmark::Trend.range(1, 20_000)
-trend, trends = Benchmark::Trend.infer_trend(numbers) do |n|
-  fib_iter(n)
-end
-
-puts "Trend: #{trend}"
-puts "Trend data:"
-pp trends

data/exe/bench-trend

@@ -1,3 +0,0 @@
-#!/usr/bin/env ruby
-
-require "benchmark/trend"