more_math 0.4.0 → 1.0.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: f0225a838150eb806c43ab9f127a48d4e3413a112d790c471a30a523a9ba232a
-  data.tar.gz: 280a109a31687d7d1206a4242b70d45c569109104a806f12a76335d469571cef
+  metadata.gz: 1a9d46106c13337d7b3b949a3984d57de664ba0f8f7931a4ac8aa91139e36a2b
+  data.tar.gz: ce02a111f04c4bc8aab30603d172e47bae8f62bd500484a5ea9b20d2438cb5cd
 SHA512:
-  metadata.gz: 28d4b17002c51d638cac2df07f1e183c507f27dc963c18579fd0ba6a6796f3ae119fd4c1ffc77bfa7125dfb69b00d5d6fac48b90f9449d9596a36c2f139e4bd8
-  data.tar.gz: 2ebdea2b609ada67acd58764c1983dd5ec773866f94bd3900213ea73e7119b758467fdff7b576a7552669cf4dbb5431462b9321a40393e7d89564acb11bcffd0
+  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/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:

data/lib/more_math/version.rb

@@ -1,6 +1,6 @@
 module MoreMath
   # MoreMath version
-  VERSION         = '0.4.0'
+  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.4.0 ruby lib
+# stub: more_math 1.0.0 ruby lib
 
 Gem::Specification.new do |s|
   s.name = "more_math".freeze
-  s.version = "0.4.0"
+  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 = "2019-06-13"
+  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 = "3.0.3".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

@@ -344,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

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: more_math
 version: !ruby/object:Gem::Version
-  version: 0.4.0
+  version: 1.0.0
 platform: ruby
 authors:
 - Florian Frank
-autorequire: 
+autorequire:
 bindir: bin
 cert_chain: []
-date: 2019-06-13 00:00:00.000000000 Z
+date: 2023-05-26 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: gem_hadar
@@ -16,14 +16,14 @@ dependencies:
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 1.9.1
+        version: 1.12.0
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 1.9.1
+        version: 1.12.0
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
@@ -67,7 +67,21 @@ dependencies:
       - !ruby/object:Gem::Version
         version: '0'
 - !ruby/object:Gem::Dependency
-  name: codeclimate-test-reporter
+  name: debug
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: all_images
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - ">="
@@ -114,7 +128,7 @@ email: flori@ping.de
 executables: []
 extensions: []
 extra_rdoc_files:
-- README.rdoc
+- README.md
 - lib/more_math.rb
 - lib/more_math/cantor_pairing_function.rb
 - lib/more_math/constants/functions_constants.rb
@@ -136,16 +150,11 @@ extra_rdoc_files:
 - lib/more_math/subset.rb
 - lib/more_math/version.rb
 files:
-- ".codeclimate.yml"
-- ".gitignore"
-- ".rubocop.yml"
-- ".travis.yml"
 - CHANGES
 - Gemfile
 - LICENSE
-- README.rdoc
+- README.md
 - Rakefile
-- VERSION
 - lib/more_math.rb
 - lib/more_math/cantor_pairing_function.rb
 - lib/more_math/constants/functions_constants.rb
@@ -176,6 +185,7 @@ files:
 - tests/newton_bisection_test.rb
 - tests/numberify_string_function_test.rb
 - tests/permutation_test.rb
+- tests/sequence/refinement_test.rb
 - tests/sequence_moving_average_test.rb
 - tests/sequence_test.rb
 - tests/string_numeral_test.rb
@@ -185,12 +195,12 @@ homepage: http://flori.github.com/more_math
 licenses:
 - MIT
 metadata: {}
-post_install_message: 
+post_install_message:
 rdoc_options:
 - "--title"
 - MoreMath -- More Math in Ruby
 - "--main"
-- README.rdoc
+- README.md
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
@@ -204,8 +214,8 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.0.3
-signing_key: 
+rubygems_version: 3.3.26
+signing_key:
 specification_version: 4
 summary: Library that provides more mathematics.
 test_files:
@@ -218,6 +228,7 @@ test_files:
 - tests/newton_bisection_test.rb
 - tests/numberify_string_function_test.rb
 - tests/permutation_test.rb
+- tests/sequence/refinement_test.rb
 - tests/sequence_moving_average_test.rb
 - tests/sequence_test.rb
 - tests/string_numeral_test.rb