more_math 0.3.3 → 1.0.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
-SHA1:
-  metadata.gz: 8592c5f27e6c601ae312bf1870259967e7763b28
-  data.tar.gz: b1e23ffdfc15ee89ff25f8cf7d0a3f9ca8f27aa5
+SHA256:
+  metadata.gz: 1a9d46106c13337d7b3b949a3984d57de664ba0f8f7931a4ac8aa91139e36a2b
+  data.tar.gz: ce02a111f04c4bc8aab30603d172e47bae8f62bd500484a5ea9b20d2438cb5cd
 SHA512:
-  metadata.gz: 0a0bf6510034861d95b94abbe7bc6d13d38fa5c5db9d5eb62dec371b8b6a846a76e15de6fd0a1a8151d6459cdb0819fe85ea5503025c4cf49e331a39f7dcd8a8
-  data.tar.gz: f841cbc883d82f78a834044e84857bc25d212c54da766085e5ea7fe0f7dcebf44044896a5009565a09e6d6183ad6fc991fab166a688f6ec2db57daf1ee9a48c2
+  metadata.gz: 44864c937a9f957f6aaf9a7fad4d5a300c75e4db9e69f882f1fc42ff07c9f811b405c70d7c0a8b312e698053aef63f787d26bb66a7b37f86c58c22e8bfcafdd2
+  data.tar.gz: 9a0dfb7c53d2c1487cb2f8597268b921dfdb0898e3130ca894cb0222dad2a1ee2ee54d466c56ae51ddc17063d35a7b05dde4e3a3c6fa080e720eba0ae9a00d44

data/Gemfile

@@ -3,4 +3,3 @@
 source 'https://rubygems.org'
 
 gemspec
-gem 'byebug', platform: :mri

data/{README.rdoc → README.md}

@@ -1,20 +1,21 @@
-= MoreMath - More mathematics in Ruby
+# MoreMath - More mathematics in Ruby
 
-== Description
+## Description
 
 Ruby library that contains various mathematical functions and algorithms.
 
-== Download
+## Download
 
 The homepage of this library is located at
 
-* http://github.com/flori/more_math
+*   http://github.com/flori/more_math
 
-== Author
+
+## Author
 
 Florian Frank mailto:flori@ping.de
 
-== License
+## License
 
 This software is licensed under the X11 (or MIT) license:
 http://www.xfree86.org/3.3.6/COPYRIGHT2.html#3

data/Rakefile

@@ -12,8 +12,10 @@ GemHadar do
   test_dir    'tests'
   ignore      '.*.sw[pon]', 'pkg', 'Gemfile.lock', 'coverage', '.rvmrc',
     '.AppleDouble', 'tags', '.byebug_history', '.DS_Store'
-  readme      'README.rdoc'
+  readme      'README.md'
   title       "#{name.camelize} -- More Math in Ruby"
+  package_ignore '.all_images.yml', '.gitignore', 'VERSION',
+    *Dir.glob('.github/**/*', File::FNM_DOTMATCH)
 
   required_ruby_version '>= 2.0'
   dependency  'tins', '~>1.0'
@@ -21,6 +23,7 @@ GemHadar do
   development_dependency 'rake'
   development_dependency 'simplecov'
   development_dependency 'test-unit'
-  development_dependency "codeclimate-test-reporter"
+  development_dependency 'debug'
+  development_dependency 'all_images'
   licenses << 'MIT'
 end

data/lib/more_math/continued_fraction.rb

@@ -14,11 +14,13 @@ module MoreMath
   #                            ...
   #
   class ContinuedFraction
+    SIMPLE_B = proc { 1 }
+
     # Creates a continued fraction instance. With the defaults for_a { 1 } and
     # for_b { 1 } it approximates the golden ration phi if evaluated.
     def initialize
-      @a = proc { 1.0 }
-      @b = proc { 1.0 }
+      @a = proc { 1 }
+      @b = SIMPLE_B
     end
 
     # Creates a ContinuedFraction instances and passes its arguments to a call
@@ -35,7 +37,7 @@ module MoreMath
 
     def for_arg(arg = nil, &block)
       if arg and !block
-        arg
+        arg.freeze
       elsif block and !arg
         block
       else
@@ -44,6 +46,17 @@ module MoreMath
     end
     private :for_arg
 
+    def self.from(number)
+      number = number.to_r
+      n, d = number.numerator, number.denominator
+      as = []
+      while d > 0
+        n, (a, d) = d, n.divmod(d)
+        as << a
+      end
+      for_a(as)
+    end
+
     # This method either takes a block or an argument +arg+. The argument +arg+
     # has to respond to an integer index n >= 0 and return the value a_n. The
     # block has to return the value for a_n when +n+ is passed as the first
@@ -64,6 +77,30 @@ module MoreMath
       self
     end
 
+    def simple?
+      @b == SIMPLE_B
+    end
+
+    def inspect
+      "#<#{self.class} #{to_s}>"
+    end
+
+    include Enumerable
+    def each(&block)
+      if simple?
+        (0..Float::INFINITY).lazy.map { |i| @a[i] }.take_while { |x| x }.each(&block)
+      end
+    end
+
+    def to_s(length: 10)
+      if simple?
+        convergents = take(length)
+        "[#{convergents[0]}; #{convergents[1..-1] * ', '}#{",…" if convergents.size >= length}]"
+      else
+        "CF(a=#@a, b=#@b)"
+      end
+    end
+
     def value(v, n, x = nil)
       result = if x
         v[n, x]
@@ -86,7 +123,7 @@ module MoreMath
     # Evaluates the continued fraction for the value +x+ (if any) with the
     # accuracy +epsilon+ and +max_iterations+ as the maximum number of
     # iterations using the Wallis-method with scaling.
-    def call(x = nil, epsilon = 1E-16, max_iterations = 1 << 31)
+    def call(x = nil, epsilon: 1E-16, max_iterations: 1 << 31)
       c_0, c_1 = 1.0, a(0, x)
       c_1 == nil and return 0 / 0.0
       d_0, d_1 = 0.0, 1.0
@@ -127,8 +164,18 @@ module MoreMath
       result
     end
 
+    def reciprocal
+      if @a[0] > 0
+        dup.for_a { |i| i == 0 ? 0 : @a[i - 1] }
+      else
+        dup.for_a { |i| @a[i + 1] }
+      end
+    end
+
     alias [] call
 
+    alias to_f call
+
     # Returns this continued fraction as a Proc object which takes the same
     # arguments like its call method does.
     def to_proc

data/lib/more_math/functions.rb

@@ -15,6 +15,7 @@ module MoreMath
       end
     else
       def log_gamma(x)
+        x = x.to_f
         if x.nan? || x <= 0
           0 / 0.0
         else
@@ -33,6 +34,15 @@ module MoreMath
       end
     end
 
+    # Returns the value of the gamma function, extended to a negative domain.
+    def gamma(x)
+      if x < 0.0
+        return PI / (sin(PI * x) * exp(log_gamma(1 - x)))
+      else
+        exp(log_gamma(x))
+      end
+    end
+
     # Returns the natural logarithm of the beta function value for +(a, b)+.
     def log_beta(a, b)
       log_gamma(a) + log_gamma(b) - log_gamma(a + b)
@@ -40,16 +50,25 @@ module MoreMath
       0 / 0.0
     end
 
+    # Returns the value of the beta function for +(a, b)+, +a > 0, b > 0'.
+    def beta(a, b)
+      if a > 0 && b > 0
+        exp(log_beta(a, b))
+      else
+        0.0 / 0
+      end
+    end
+
     # Return an approximation value of Euler's regularized beta function for
     # +x+, +a+, and +b+ with an error <= +epsilon+, but only iterate
     # +max_iterations+-times.
-    def beta_regularized(x, a, b, epsilon = 1E-16, max_iterations = 1 << 16)
+    def beta_regularized(x, a, b, epsilon: 1E-16, max_iterations: 1 << 16)
       x, a, b = x.to_f, a.to_f, b.to_f
       case
       when a.nan? || b.nan? || x.nan? || a <= 0 || b <= 0 || x < 0 || x > 1
         0 / 0.0
       when x > (a + 1) / (a + b + 2)
-        1 - beta_regularized(1 - x, b, a, epsilon, max_iterations)
+        1 - beta_regularized(1 - x, b, a, epsilon: epsilon, max_iterations: max_iterations)
       else
         fraction = ContinuedFraction.for_b do |n, y|
           if n % 2 == 0
@@ -61,7 +80,7 @@ module MoreMath
           end
         end
         exp(a * log(x) + b * log(1.0 - x) - log(a) - log_beta(a, b)) /
-          fraction[x, epsilon, max_iterations]
+          fraction[x, epsilon: epsilon, max_iterations: max_iterations]
       end
     rescue Errno::ERANGE, Errno::EDOM
       0 / 0.0
@@ -70,7 +89,7 @@ module MoreMath
     # Return an approximation of the regularized gammaP function for +x+ and
     # +a+ with an error of <= +epsilon+, but only iterate
     # +max_iterations+-times.
-    def gammaP_regularized(x, a, epsilon = 1E-16, max_iterations = 1 << 16)
+    def gammaP_regularized(x, a, epsilon: 1E-16, max_iterations: 1 << 16)
       x, a = x.to_f, a.to_f
       case
       when a.nan? || x.nan? || a <= 0 || x < 0
@@ -78,7 +97,7 @@ module MoreMath
       when x == 0
         0.0
       when 1 <= a && a < x
-        1 - gammaQ_regularized(x, a, epsilon, max_iterations)
+        1 - gammaQ_regularized(x, a, epsilon: epsilon, max_iterations: max_iterations)
       else
         n = 0
         an = 1 / a
@@ -101,7 +120,7 @@ module MoreMath
     # Return an approximation of the regularized gammaQ function for +x+ and
     # +a+ with an error of <= +epsilon+, but only iterate
     # +max_iterations+-times.
-    def gammaQ_regularized(x, a, epsilon = 1E-16, max_iterations = 1 << 16)
+    def gammaQ_regularized(x, a, epsilon: 1E-16, max_iterations: 1 << 16)
       x, a = x.to_f, a.to_f
       case
       when a.nan? || x.nan? || a <= 0 || x < 0
@@ -109,7 +128,7 @@ module MoreMath
       when x == 0
         1.0
       when a > x || a < 1
-        1 - gammaP_regularized(x, a, epsilon, max_iterations)
+        1 - gammaP_regularized(x, a, epsilon: epsilon, max_iterations: max_iterations)
       else
         fraction = ContinuedFraction.for_a do |n, y|
           (2 * n + 1) - a + y
@@ -117,7 +136,7 @@ module MoreMath
           n * (a - n)
         end
         exp(-x + a * log(x) - log_gamma(a)) *
-          fraction[x, epsilon, max_iterations] ** -1
+          fraction[x, epsilon: epsilon, max_iterations: max_iterations] ** -1
       end
     rescue Errno::ERANGE, Errno::EDOM
       0 / 0.0
@@ -130,9 +149,11 @@ module MoreMath
         r = sqrt(1 - exp(-x ** 2 * (4 / Math::PI + erf_a * x ** 2) / (1 + erf_a * x ** 2)))
         x < 0 ? -r : r
       end
-    else
-      def erf(x)
-        Math.erf(x)
+    end
+
+    unless Math.respond_to?(:erfc)
+      def erfc(x)
+        1.0 - erf(x)
       end
     end
 

data/lib/more_math/histogram.rb

@@ -4,7 +4,14 @@ module MoreMath
     Bin = Struct.new(:left, :right, :count)
 
     # Create a Histogram for the elements of +sequence+ with +bins+ bins.
-    def initialize(sequence, bins = 10)
+    def initialize(sequence, arg = 10)
+      @with_counts = false
+      if arg.is_a?(Hash)
+        bins = arg.fetch(:bins, 10)
+        wc = arg[:with_counts] and @with_counts = wc
+      else
+        bins = arg
+      end
       @sequence = sequence
       @bins = bins
       @result = compute
@@ -29,9 +36,8 @@ module MoreMath
     # Display this histogram to +output+, +width+ is the parameter for
     # +prepare_display+
     def display(output = $stdout, width = 50)
-      d = prepare_display(width)
-      for l, bar, r in d
-        output << "%11.5f -|%s\n" % [ (l + r) / 2.0, "*" * bar ]
+      for r in rows
+        output << output_row(r, width)
       end
       output << "max_count=#{max_count}\n"
       self
@@ -43,13 +49,26 @@ module MoreMath
 
     private
 
-    # Returns an array of tuples (l, c, r) where +l+ is the left bin edge, +c+
-    # the +width+-normalized frequence count value, and +r+ the right bin
-    # edge. +width+ is usually an integer number representing the width of a
-    # histogram bar.
-    def prepare_display(width)
-      factor = width.to_f / max_count
-      @result.reverse_each.map { |bin| [ bin.left, (bin.count * factor).round, bin.right ] }
+    def output_row(row, width)
+      left, right, count = row
+      if @with_counts
+        left_width = width - (counts.map { |x| x.to_s.size }.max + 1)
+      else
+        left_width = width
+      end
+      factor    = left_width.to_f / max_count
+      bar_width = (count * factor).ceil
+      bar       = ?* * bar_width
+      if @with_counts
+        bar += count.to_s.rjust(width - bar_width)
+      end
+      "%11.5f -|%s\n" % [ (left + right) / 2.0, bar ]
+    end
+
+    def rows
+      @result.reverse_each.map { |bin|
+        [ bin.left, bin.right, bin.count ]
+      }
     end
 
     # Computes the histogram and returns it as an array of tuples (l, c, r).

data/lib/more_math/linear_regression.rb

@@ -32,9 +32,9 @@ module MoreMath
       t.abs <= td.inverse_probability(1 - alpha.abs / 2.0).abs
     end
 
-    # Returns the residues of this linear regression in relation to the given
+    # Returns the residuals of this linear regression in relation to the given
     # domain and image.
-    def residues
+    def residuals
       result = []
       @domain.zip(@image) do |x, y|
         result << y - (@a * x + @b)
@@ -42,13 +42,21 @@ module MoreMath
       result
     end
 
+    def r2
+      image_seq = MoreMath::Sequence.new(@image)
+      sum_res   = residuals.inject(0.0) { |s, r| s + r ** 2 }
+      [
+        1.0 -  sum_res / image_seq.sum_of_squares,
+        0.0,
+      ].max
+    end
+
     private
 
     def compute
       size = @image.size
       sum_xx = sum_xy = sum_x = sum_y = 0.0
       @domain.zip(@image) do |x, y|
-        x += 1
         sum_xx += x ** 2
         sum_xy += x * y
         sum_x += x

data/lib/more_math/sequence.rb

@@ -74,6 +74,12 @@ module MoreMath
       Math.sqrt(variance)
     end
 
+    # Returns the Z-score sequence derived from the current sequence.
+    memoize method:
+    def z_score
+      self.class.new(elements.map { |t| t.to_f - mean / standard_deviation })
+    end
+
     # Returns the standard deviation of the elements in percentage of the
     # arithmetic mean.
     memoize method:
@@ -289,7 +295,7 @@ module MoreMath
     # Returns the d-value for the Durbin-Watson statistic. The value is d << 2
     # for positive, d >> 2 for negative and d around 2 for no autocorrelation.
     def durbin_watson_statistic
-      e = linear_regression.residues
+      e = linear_regression.residuals
       e.size <= 1 and return 2.0
       (1...e.size).inject(0.0) { |s, i| s + (e[i] - e[i - 1]) ** 2 } /
         e.inject(0.0) { |s, x| s + x ** 2 }

data/lib/more_math/version.rb

@@ -1,6 +1,6 @@
 module MoreMath
   # MoreMath version
-  VERSION         = '0.3.3'
+  VERSION         = '1.0.0'
   VERSION_ARRAY   = VERSION.split('.').map(&:to_i) # :nodoc:
   VERSION_MAJOR   = VERSION_ARRAY[0] # :nodoc:
   VERSION_MINOR   = VERSION_ARRAY[1] # :nodoc:

data/more_math.gemspec

@@ -1,52 +1,46 @@
 # -*- encoding: utf-8 -*-
-# stub: more_math 0.3.3 ruby lib
+# stub: more_math 1.0.0 ruby lib
 
 Gem::Specification.new do |s|
   s.name = "more_math".freeze
-  s.version = "0.3.3"
+  s.version = "1.0.0"
 
   s.required_rubygems_version = Gem::Requirement.new(">= 0".freeze) if s.respond_to? :required_rubygems_version=
   s.require_paths = ["lib".freeze]
   s.authors = ["Florian Frank".freeze]
-  s.date = "2017-07-04"
+  s.date = "2023-05-26"
   s.description = "Library that provides more mathematical functions/algorithms than standard Ruby.".freeze
   s.email = "flori@ping.de".freeze
-  s.extra_rdoc_files = ["README.rdoc".freeze, "lib/more_math.rb".freeze, "lib/more_math/cantor_pairing_function.rb".freeze, "lib/more_math/constants/functions_constants.rb".freeze, "lib/more_math/continued_fraction.rb".freeze, "lib/more_math/distributions.rb".freeze, "lib/more_math/entropy.rb".freeze, "lib/more_math/exceptions.rb".freeze, "lib/more_math/functions.rb".freeze, "lib/more_math/histogram.rb".freeze, "lib/more_math/linear_regression.rb".freeze, "lib/more_math/newton_bisection.rb".freeze, "lib/more_math/numberify_string_function.rb".freeze, "lib/more_math/permutation.rb".freeze, "lib/more_math/ranking_common.rb".freeze, "lib/more_math/sequence.rb".freeze, "lib/more_math/sequence/moving_average.rb".freeze, "lib/more_math/sequence/refinement.rb".freeze, "lib/more_math/string_numeral.rb".freeze, "lib/more_math/subset.rb".freeze, "lib/more_math/version.rb".freeze]
-  s.files = [".codeclimate.yml".freeze, ".gitignore".freeze, ".rubocop.yml".freeze, ".travis.yml".freeze, "CHANGES".freeze, "Gemfile".freeze, "LICENSE".freeze, "README.rdoc".freeze, "Rakefile".freeze, "VERSION".freeze, "lib/more_math.rb".freeze, "lib/more_math/cantor_pairing_function.rb".freeze, "lib/more_math/constants/functions_constants.rb".freeze, "lib/more_math/continued_fraction.rb".freeze, "lib/more_math/distributions.rb".freeze, "lib/more_math/entropy.rb".freeze, "lib/more_math/exceptions.rb".freeze, "lib/more_math/functions.rb".freeze, "lib/more_math/histogram.rb".freeze, "lib/more_math/linear_regression.rb".freeze, "lib/more_math/newton_bisection.rb".freeze, "lib/more_math/numberify_string_function.rb".freeze, "lib/more_math/permutation.rb".freeze, "lib/more_math/ranking_common.rb".freeze, "lib/more_math/sequence.rb".freeze, "lib/more_math/sequence/moving_average.rb".freeze, "lib/more_math/sequence/refinement.rb".freeze, "lib/more_math/string_numeral.rb".freeze, "lib/more_math/subset.rb".freeze, "lib/more_math/version.rb".freeze, "more_math.gemspec".freeze, "tests/cantor_pairing_function_test.rb".freeze, "tests/continued_fraction_test.rb".freeze, "tests/distribution_test.rb".freeze, "tests/entropy_test.rb".freeze, "tests/functions_test.rb".freeze, "tests/histogram_test.rb".freeze, "tests/newton_bisection_test.rb".freeze, "tests/numberify_string_function_test.rb".freeze, "tests/permutation_test.rb".freeze, "tests/sequence_moving_average_test.rb".freeze, "tests/sequence_test.rb".freeze, "tests/string_numeral_test.rb".freeze, "tests/subset_test.rb".freeze, "tests/test_helper.rb".freeze]
+  s.extra_rdoc_files = ["README.md".freeze, "lib/more_math.rb".freeze, "lib/more_math/cantor_pairing_function.rb".freeze, "lib/more_math/constants/functions_constants.rb".freeze, "lib/more_math/continued_fraction.rb".freeze, "lib/more_math/distributions.rb".freeze, "lib/more_math/entropy.rb".freeze, "lib/more_math/exceptions.rb".freeze, "lib/more_math/functions.rb".freeze, "lib/more_math/histogram.rb".freeze, "lib/more_math/linear_regression.rb".freeze, "lib/more_math/newton_bisection.rb".freeze, "lib/more_math/numberify_string_function.rb".freeze, "lib/more_math/permutation.rb".freeze, "lib/more_math/ranking_common.rb".freeze, "lib/more_math/sequence.rb".freeze, "lib/more_math/sequence/moving_average.rb".freeze, "lib/more_math/sequence/refinement.rb".freeze, "lib/more_math/string_numeral.rb".freeze, "lib/more_math/subset.rb".freeze, "lib/more_math/version.rb".freeze]
+  s.files = ["CHANGES".freeze, "Gemfile".freeze, "LICENSE".freeze, "README.md".freeze, "Rakefile".freeze, "lib/more_math.rb".freeze, "lib/more_math/cantor_pairing_function.rb".freeze, "lib/more_math/constants/functions_constants.rb".freeze, "lib/more_math/continued_fraction.rb".freeze, "lib/more_math/distributions.rb".freeze, "lib/more_math/entropy.rb".freeze, "lib/more_math/exceptions.rb".freeze, "lib/more_math/functions.rb".freeze, "lib/more_math/histogram.rb".freeze, "lib/more_math/linear_regression.rb".freeze, "lib/more_math/newton_bisection.rb".freeze, "lib/more_math/numberify_string_function.rb".freeze, "lib/more_math/permutation.rb".freeze, "lib/more_math/ranking_common.rb".freeze, "lib/more_math/sequence.rb".freeze, "lib/more_math/sequence/moving_average.rb".freeze, "lib/more_math/sequence/refinement.rb".freeze, "lib/more_math/string_numeral.rb".freeze, "lib/more_math/subset.rb".freeze, "lib/more_math/version.rb".freeze, "more_math.gemspec".freeze, "tests/cantor_pairing_function_test.rb".freeze, "tests/continued_fraction_test.rb".freeze, "tests/distribution_test.rb".freeze, "tests/entropy_test.rb".freeze, "tests/functions_test.rb".freeze, "tests/histogram_test.rb".freeze, "tests/newton_bisection_test.rb".freeze, "tests/numberify_string_function_test.rb".freeze, "tests/permutation_test.rb".freeze, "tests/sequence/refinement_test.rb".freeze, "tests/sequence_moving_average_test.rb".freeze, "tests/sequence_test.rb".freeze, "tests/string_numeral_test.rb".freeze, "tests/subset_test.rb".freeze, "tests/test_helper.rb".freeze]
   s.homepage = "http://flori.github.com/more_math".freeze
   s.licenses = ["MIT".freeze]
-  s.rdoc_options = ["--title".freeze, "MoreMath -- More Math in Ruby".freeze, "--main".freeze, "README.rdoc".freeze]
+  s.rdoc_options = ["--title".freeze, "MoreMath -- More Math in Ruby".freeze, "--main".freeze, "README.md".freeze]
   s.required_ruby_version = Gem::Requirement.new(">= 2.0".freeze)
-  s.rubygems_version = "2.6.11".freeze
+  s.rubygems_version = "3.3.26".freeze
   s.summary = "Library that provides more mathematics.".freeze
-  s.test_files = ["tests/cantor_pairing_function_test.rb".freeze, "tests/continued_fraction_test.rb".freeze, "tests/distribution_test.rb".freeze, "tests/entropy_test.rb".freeze, "tests/functions_test.rb".freeze, "tests/histogram_test.rb".freeze, "tests/newton_bisection_test.rb".freeze, "tests/numberify_string_function_test.rb".freeze, "tests/permutation_test.rb".freeze, "tests/sequence_moving_average_test.rb".freeze, "tests/sequence_test.rb".freeze, "tests/string_numeral_test.rb".freeze, "tests/subset_test.rb".freeze, "tests/test_helper.rb".freeze]
+  s.test_files = ["tests/cantor_pairing_function_test.rb".freeze, "tests/continued_fraction_test.rb".freeze, "tests/distribution_test.rb".freeze, "tests/entropy_test.rb".freeze, "tests/functions_test.rb".freeze, "tests/histogram_test.rb".freeze, "tests/newton_bisection_test.rb".freeze, "tests/numberify_string_function_test.rb".freeze, "tests/permutation_test.rb".freeze, "tests/sequence/refinement_test.rb".freeze, "tests/sequence_moving_average_test.rb".freeze, "tests/sequence_test.rb".freeze, "tests/string_numeral_test.rb".freeze, "tests/subset_test.rb".freeze, "tests/test_helper.rb".freeze]
 
   if s.respond_to? :specification_version then
     s.specification_version = 4
+  end
 
-    if Gem::Version.new(Gem::VERSION) >= Gem::Version.new('1.2.0') then
-      s.add_development_dependency(%q<gem_hadar>.freeze, ["~> 1.9.1"])
-      s.add_development_dependency(%q<rake>.freeze, [">= 0"])
-      s.add_development_dependency(%q<simplecov>.freeze, [">= 0"])
-      s.add_development_dependency(%q<test-unit>.freeze, [">= 0"])
-      s.add_development_dependency(%q<codeclimate-test-reporter>.freeze, [">= 0"])
-      s.add_runtime_dependency(%q<tins>.freeze, ["~> 1.0"])
-      s.add_runtime_dependency(%q<mize>.freeze, [">= 0"])
-    else
-      s.add_dependency(%q<gem_hadar>.freeze, ["~> 1.9.1"])
-      s.add_dependency(%q<rake>.freeze, [">= 0"])
-      s.add_dependency(%q<simplecov>.freeze, [">= 0"])
-      s.add_dependency(%q<test-unit>.freeze, [">= 0"])
-      s.add_dependency(%q<codeclimate-test-reporter>.freeze, [">= 0"])
-      s.add_dependency(%q<tins>.freeze, ["~> 1.0"])
-      s.add_dependency(%q<mize>.freeze, [">= 0"])
-    end
+  if s.respond_to? :add_runtime_dependency then
+    s.add_development_dependency(%q<gem_hadar>.freeze, ["~> 1.12.0"])
+    s.add_development_dependency(%q<rake>.freeze, [">= 0"])
+    s.add_development_dependency(%q<simplecov>.freeze, [">= 0"])
+    s.add_development_dependency(%q<test-unit>.freeze, [">= 0"])
+    s.add_development_dependency(%q<debug>.freeze, [">= 0"])
+    s.add_development_dependency(%q<all_images>.freeze, [">= 0"])
+    s.add_runtime_dependency(%q<tins>.freeze, ["~> 1.0"])
+    s.add_runtime_dependency(%q<mize>.freeze, [">= 0"])
   else
-    s.add_dependency(%q<gem_hadar>.freeze, ["~> 1.9.1"])
+    s.add_dependency(%q<gem_hadar>.freeze, ["~> 1.12.0"])
     s.add_dependency(%q<rake>.freeze, [">= 0"])
     s.add_dependency(%q<simplecov>.freeze, [">= 0"])
     s.add_dependency(%q<test-unit>.freeze, [">= 0"])
-    s.add_dependency(%q<codeclimate-test-reporter>.freeze, [">= 0"])
+    s.add_dependency(%q<debug>.freeze, [">= 0"])
+    s.add_dependency(%q<all_images>.freeze, [">= 0"])
     s.add_dependency(%q<tins>.freeze, ["~> 1.0"])
     s.add_dependency(%q<mize>.freeze, [">= 0"])
   end

data/tests/histogram_test.rb

@@ -17,13 +17,30 @@ class HistogramTest < Test::Unit::TestCase
   def test_histogram_display
     sequence = Sequence.new [ 1, 2, 3, 0, 2 ]
     histogram = Histogram.new sequence, 3
-    assert_equal [[2.0, 25, 3.0], [1.0, 50, 2.0], [0.0, 50, 1.0]],
-      histogram.instance_eval { prepare_display(50) }
+    assert_equal [[2.0, 3.0, 1], [1.0, 2.0, 2], [0.0, 1.0, 2]],
+      histogram.instance_eval { rows }
     output = StringIO.new
     histogram.display output
-    output_expected =
-      "    2.50000 -|*************************\n    1.50000 -|*******************************"\
-      "*******************\n    0.50000 -|**************************************************\nmax_count=2\n"
-    assert_equal output_expected, output.string
+    assert_equal <<~end, output.string
+        2.50000 -|*************************
+        1.50000 -|**************************************************
+        0.50000 -|**************************************************
+    max_count=2
+    end
+  end
+
+  def test_histogram_display_with_counts
+    sequence = Sequence.new [ 1, 2, 3, 0, 2 ]
+    histogram = Histogram.new sequence, with_counts: true, bins: 3
+    assert_equal [[2.0, 3.0, 1], [1.0, 2.0, 2], [0.0, 1.0, 2]],
+      histogram.instance_eval { rows }
+    output = StringIO.new
+    histogram.display output
+    assert_equal <<~end, output.string
+        2.50000 -|************************                         1
+        1.50000 -|************************************************ 2
+        0.50000 -|************************************************ 2
+    max_count=2
+    end
   end
 end

data/tests/sequence/refinement_test.rb

@@ -0,0 +1,13 @@
+#!/usr/bin/env ruby
+
+require 'test_helper'
+require 'more_math'
+
+using MoreMath::Sequence::Refinement
+
+class SequenceTest < Test::Unit::TestCase
+  def test_refinement
+    assert_kind_of MoreMath::Sequence, [1,2,3].to_seq
+  end
+end
+

data/tests/sequence_test.rb

@@ -126,8 +126,8 @@ class SequenceTest < Test::Unit::TestCase
       3, 94, 5, 79, 11, 16, 0, 90, 81, 42, 64, 76, 92, 25,
       3, 90, 51, 15, 0, 74, 98, 93, 90, 14, 81, 85, 28, 30,
       73, 32, 88])
-    @rand_up = Sequence.new(Array.new(rand.size) { |i| rand[i] * (1 - 4.0 / (i + 1)) })
-    @rand_down = Sequence.new(Array.new(rand.size) { |i| rand[i] * (1 + 4.0 / (i + 1)) })
+    @rand_up = Sequence.new(Array.new(rand.size) { |i| rand[i] + 10 * i })
+    @rand_down = Sequence.new(Array.new(rand.size) { |i| rand[i] - 10 * i })
     @rasi = Sequence.new(
       [ 0.0, 11.7813239550446, 23.8742291678261, 0.368124552684678,
       20.233654312272, 7.64120827980215, 61.609239533582, 69.346191849821,
@@ -186,7 +186,8 @@ class SequenceTest < Test::Unit::TestCase
     assert_in_delta 0.3, @flat.median, 1E-8
     assert_in_delta 0.3, @flat.percentile(75), 1E-8
     assert_equal 100, @flat.histogram(10).each_bin.first.count
-    assert @flat.linear_regression.residues.all? { |r| r.abs <= 1E-6 }
+    assert @flat.linear_regression.residuals.all? { |r| r.abs <= 1E-6 }
+    assert_in_delta 0.0, @flat.linear_regression.r2, 1E-8
   end
 
   def test_half
@@ -207,7 +208,8 @@ class SequenceTest < Test::Unit::TestCase
     assert_in_delta 37.375, @half.percentile(75), 1E-8
     assert_equal [10] * 10, counts = @half.histogram(10).counts
     assert_equal 100, counts.inject { |s, x| s + x }
-    assert @half.linear_regression.residues.all? { |r| r.abs <= 0.5 }
+    assert @half.linear_regression.residuals.all? { |r| r.abs <= 0.5 }
+    assert_in_delta 1.0, @half.linear_regression.r2, 1E-8
   end
 
   def test_rand
@@ -227,13 +229,15 @@ class SequenceTest < Test::Unit::TestCase
     assert_in_delta 50.0, @rand.median, 1E-8
     assert_in_delta 81, @rand.percentile(75), 1E-8
     assert_in_delta 0.05660, @rand.linear_regression.a, 1E-4
-    assert_in_delta 47.9812, @rand.linear_regression.b, 1E-4
+    assert_in_delta 48.0378, @rand.linear_regression.b, 1E-4
     assert @rand.linear_regression.slope_zero?
-    assert_in_delta(-0.4019, @rand_down.linear_regression.a, 1E-4)
-    assert_in_delta 82.7303, @rand_down.linear_regression.b, 1E-4
+    assert_in_delta(-9.9433, @rand_down.linear_regression.a, 1E-4)
+    assert_in_delta 48.0378, @rand_down.linear_regression.b, 1E-4
+    assert_in_delta 0.9883, @rand_down.linear_regression.r2, 1E-4
     assert !@rand_down.linear_regression.slope_zero?
-    assert_in_delta 0.5151, @rand_up.linear_regression.a, 1E-4
-    assert_in_delta(13.2320, @rand_up.linear_regression.b, 1E-4)
+    assert_in_delta 10.0566, @rand_up.linear_regression.a, 1E-4
+    assert_in_delta 48.0378, @rand_up.linear_regression.b, 1E-4
+    assert_in_delta 0.98857, @rand_up.linear_regression.r2, 1E-4
     assert !@rand_up.linear_regression.slope_zero?
     assert_nil @rand.detect_outliers
     assert !@rand.detect_autocorrelation[:detected]
@@ -258,7 +262,8 @@ class SequenceTest < Test::Unit::TestCase
     assert_in_delta 0.0, @rasi.median, 1E-2
     assert_in_delta 30.58, @rasi.percentile(75), 1E-2
     assert_in_delta(-0.41, @rasi.linear_regression.a, 1E-2)
-    assert_in_delta(24.35, @rasi.linear_regression.b, 1E-2)
+    assert_in_delta(23.94, @rasi.linear_regression.b, 1E-2)
+    assert_in_delta 0.0887, @rasi.linear_regression.r2, 1E-4
     assert !@rasi.linear_regression.slope_zero?
     assert_equal 13, @rasi.detect_outliers[:high]
     assert @rasi.detect_autocorrelation[:detected]
@@ -284,8 +289,9 @@ class SequenceTest < Test::Unit::TestCase
     assert_in_delta 51.5, @book.median, 1E-2
     assert_in_delta 58.25, @book.percentile(75), 1E-2
     assert_in_delta(-0.0952, @book.linear_regression.a, 1E-4)
-    assert_in_delta(54.6372, @book.linear_regression.b, 1E-4)
+    assert_in_delta(54.5420, @book.linear_regression.b, 1E-4)
     assert @book.linear_regression.slope_zero?
+    assert_in_delta 0.0249, @book.linear_regression.r2, 1E-4
     assert_equal 7, @book.detect_outliers[:high]
     ought = [1.0, -0.39, 0.3, -0.17, 0.07, -0.10, 0.05, 0.04, -0.04, -0.01,
       0.01, 0.11, -0.07, 0.15, 0.04, -0.01
@@ -297,7 +303,7 @@ class SequenceTest < Test::Unit::TestCase
     assert_equal [3, 4, 9, 12, 18, 14, 4, 5, 0, 1],
       counts = @book.histogram(10).counts
     assert_equal 70, counts.inject { |s, x| s + x }
-    assert @flat.linear_regression.residues.all? { |r| r.abs <= 1E-6 }
+    assert @flat.linear_regression.residuals.all? { |r| r.abs <= 1E-6 }
   end
 
   def test_cover
@@ -338,4 +344,16 @@ class SequenceTest < Test::Unit::TestCase
     assert_not_same seq2, seq
     assert_equal [ 1, 2, 3 ], seq2.elements
   end
+
+  def test_z_score
+    s = MoreMath::Sequence.new(
+      [
+        697.195, 913.583, 793.187, 363.926, 111.559, 296.687, 500.225,
+        303.019, 4.702, 378.132,
+      ]
+    )
+    assert_equal s.size, s.z_score.size
+    assert_in_delta 276.57, s.z_score.standard_deviation, 1E-2
+    assert_in_delta 434.64, s.z_score.mean, 1E-2
+  end
 end