morphological_metrics 1.2.0 → 1.3.0

data/test/mm/test_search.rb

@@ -1,89 +1,83 @@
-require 'mm/search'
-require_relative '../helpers.rb'
-
-class TestMM < Minitest::Test; end
-
-class TestMM::TestSearch < Minitest::Test
-  include TestHelpers
-
-  def setup
-    @starting_point = 0.4
-    @search = MM::Search.new(@starting_point)
-  end
-
-  def test_search_exists
-    refute @search.nil?
-  end
-
-  def test_cost_function_accessor
-    @search.cost_function = ->(){0.5}
-    assert_equal 0.5, @search.cost_function
-  end
-
-  def test_calculate_cost_gets_cost_for_candidates
-    @search.cost_function = ->(x){x - 0.1}
-    candidates = [0.3, 0.5]
-    assert_nested_in_delta [0.2, 0.4], @search.calculate_cost(candidates)
-  end
-
-  def test_current_cost_initially_gets_cost_of_starting_point
-    @search.cost_function = ->(x){x - 0.1}
-    assert_in_delta 0.3, @search.current_cost
-  end
-
-  def test_current_cost_gets_cost_of_current_point
-    @search.cost_function = ->(x){x - 0.1}
-    @search.instance_variable_set(:@current_point, 0.3)
-    assert_in_delta 0.2, @search.current_cost
-  end
-
-  def test_adjacent_points_function_accessor
-    @search.adjacent_points_function = ->(current) {[-0.1, 0.1].map {|x| current + x}}
-    assert_nested_in_delta [0.3, 0.5], @search.get_adjacent_points
-  end
-
-  # Testing the final #find method!
-  def test_find
-    @search.adjacent_points_function = ->(current) {[-0.1, 0.1].map {|x| current + x}}
-    @search.cost_function = ->(x){x - 0.1}
-    assert_in_delta 0.1, @search.find
-  end
-
-  def test_find_returns_nil_when_nothing_found
-    @starting_point = [0.1, 0.2, 0.3]
-    @search = MM::Search.new(@starting_point)
-    @search.delta = 0.001
-    @search.starting_point = [0.1, 0.2, 0.3]
-    @search.adjacent_points_function = ->(current) {current.repeated_combination(3)}
-    @search.cost_function = ->(x) { x.inject(0, :+) / x.size }
-    assert_equal nil, @search.find
-  end
-
-  def test_backtrack_removes_point_and_adds_it_to_banned
-    @search.path = [0.1, 0.2]
-    @search.backtrack
-    assert_equal [0.1], @search.path
-    assert_equal [0.2], @search.banned
-  end
-
-  # Stack overflows at (approximately)
-  # 9000 - for integer
-  # 9000 - for Rational
-  # 9000 - for MM::Ratio
-  def test_find_stack_overflow
-    skip # because it takes *forever*
-    @starting_point = MM::Ratio.new(1,1)
-    @search = MM::Search.new(@starting_point)
-    @search.delta = 0.001
-    @search.adjacent_points_function = ->(current) {
-      [MM::Ratio.new(1,1), MM::Ratio.new(-1,1)].map {|m| m + current}
-    }
-    goal = MM::Ratio.new(9000,1)
-    @search.cost_function = ->(x) {
-      (x - goal).abs
-    }
-    assert_equal goal, @search.find
-    puts @search.iterations
-  end
-end
-
+require 'mm/search'
+require_relative '../helpers.rb'
+
+class TestMM < Minitest::Test; end
+
+class TestMM::TestSearch < Minitest::Test
+  include TestHelpers
+
+  def setup
+    @starting_point = 0.4
+    @search = MM::Search.new(@starting_point)
+  end
+
+  def test_search_exists
+    refute @search.nil?
+  end
+
+  def test_cost_function_accessor
+    @search.cost_function = ->(){0.5}
+    assert_equal 0.5, @search.cost_function
+  end
+
+  def test_calculate_cost_gets_cost_for_candidates
+    @search.cost_function = ->(x){x - 0.1}
+    candidates = [0.3, 0.5]
+    assert_nested_in_delta [0.2, 0.4], @search.calculate_cost(candidates)
+  end
+
+  def test_current_cost_initially_gets_cost_of_starting_point
+    @search.cost_function = ->(x){x - 0.1}
+    assert_in_delta 0.3, @search.current_cost
+  end
+
+  def test_current_cost_gets_cost_of_current_point
+    @search.cost_function = ->(x){x - 0.1}
+    @search.instance_variable_set(:@current_point, 0.3)
+    assert_in_delta 0.2, @search.current_cost
+  end
+
+  def test_adjacent_points_function_accessor
+    @search.adjacent_points_function = ->(current) {[-0.1, 0.1].map {|x| current + x}}
+    assert_nested_in_delta [0.3, 0.5], @search.get_adjacent_points
+  end
+
+  # Testing the final #find method!
+  def test_find
+    @search.adjacent_points_function = ->(current) {[-0.1, 0.1].map {|x| current + x}}
+    @search.cost_function = ->(x){x - 0.1}
+    assert_in_delta 0.1, @search.find
+  end
+
+  def test_find_returns_nil_when_nothing_found
+    @starting_point = [0.1, 0.2, 0.3]
+    @search = MM::Search.new(@starting_point)
+    @search.delta = 0.001
+    @search.starting_point = [0.1, 0.2, 0.3]
+    @search.adjacent_points_function = ->(current) {current.repeated_combination(3)}
+    @search.cost_function = ->(x) { x.inject(0, :+) / x.size }
+    assert_equal nil, @search.find
+  end
+
+  def test_backtrack_removes_point_and_adds_it_to_banned
+    @search.path = [0.1, 0.2]
+    @search.backtrack
+    assert_equal [0.1], @search.path
+    assert_equal [0.2], @search.banned
+  end
+
+  # Stack overflows at (approximately)
+  # 9000 - for integer
+  # 9000 - for Rational
+  # 9000 - for MM::Ratio
+  def test_find_stack_overflow
+    skip # because it takes *forever*
+    @starting_point = MM::Ratio.new(1,1)
+    @search = MM::Search.new(@starting_point)
+    @search.delta = 0.001
+    @search.adjacent_points_function = ->(current) {
+      [MM::Ratio.new(1,1), MM::Ratio.new(-1,1)].map {|m| m + current}
+    }
+    goal = MM::Ratio.new(9000,1)
+    @search.cost_function = ->(x) {
+      (x - go

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: morphological_metrics
 version: !ruby/object:Gem::Version
-  version: 1.2.0
+  version: 1.3.0
 platform: ruby
 authors:
 - Andrew C. Smith
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2016-10-05 00:00:00.000000000 Z
+date: 2017-10-29 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: RubyInline
@@ -106,7 +106,7 @@ files:
 - test/mm/test_ratio.rb
 - test/mm/test_scaling.rb
 - test/mm/test_search.rb
-homepage: https://www.github.com/andrewcsmith/mm
+homepage: https://github.com/andrewcsmith/mm
 licenses:
 - MIT
 metadata: {}
@@ -128,7 +128,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '1.4'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.5.1
+rubygems_version: 2.6.13
 signing_key: 
 specification_version: 4
 summary: Implements some Morphological Metrics, described by Larry Polansky.