polynomials 0.1.2 → 0.1.4

data/VERSION

@@ -1 +1 @@
-0.1.2
+0.1.4

data/lib/polynomials.rb

@@ -43,9 +43,9 @@ class Polynomial
     return new_function
   end
 
-  def nulls
+  def roots
     if terms.keys.none?(&:zero?)
-      self.alter { |nf, term| nf.terms[term.exponent-1].coefficient = term.coefficient }.nulls << 0.0
+      self.alter { |nf, term| nf.terms[term.exponent-1].coefficient = term.coefficient }.roots << 0.0
     else
       case self.degree
       when 1
@@ -64,18 +64,20 @@ class Polynomial
 
   def local_extremums
     derivative = self.derivative
-    possible_extremums = derivative.nulls.sort
     max_min_extremum =  Hash.new { |hash,key| hash[key] = Set.new }
+    unless derivative.degree == 0 
+      possible_extremums = derivative.roots.sort
 
-    samples = ([possible_extremums.first - 1] + possible_extremums.sort + [possible_extremums.last + 1]).each_cons(2).map do |before,after|
-      (before + after)/2
-    end
+      samples = ([possible_extremums.first - 1] + possible_extremums.sort + [possible_extremums.last + 1]).each_cons(2).map do |before,after|
+        (before + after)/2
+      end
 
-    possible_extremums.zip(samples.each_cons(2)).each do |pe,(after,before)|
-      yafter = derivative.calculate(after)
-      ybefore = derivative.calculate(before)
-      kind_of_extremum = NegPosMinMaxExtremumMapping[[yafter/yafter.abs,ybefore/ybefore.abs]]
-      max_min_extremum[kind_of_extremum] << pe if kind_of_extremum
+      possible_extremums.zip(samples.each_cons(2)).each do |pe,(after,before)|
+        yafter = derivative.calculate(after)
+        ybefore = derivative.calculate(before)
+        kind_of_extremum = NegPosMinMaxExtremumMapping[[yafter/yafter.abs,ybefore/ybefore.abs]]
+        max_min_extremum[kind_of_extremum] << pe if kind_of_extremum
+      end
     end
     return max_min_extremum
   end

data/polynomials.gemspec

@@ -5,11 +5,11 @@
 
 Gem::Specification.new do |s|
   s.name = %q{polynomials}
-  s.version = "0.1.2"
+  s.version = "0.1.4"
 
   s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
   s.authors = ["Manuel Korfmann"]
-  s.date = %q{2011-05-12}
+  s.date = %q{2011-05-13}
   s.description = %q{
 * Parses polynomials
 * Provides useful methods on top of the Polynomial class, like:
@@ -34,7 +34,6 @@ Gem::Specification.new do |s|
     "lib/core_ext/math.rb",
     "lib/polynomials.rb",
     "lib/term.rb",
-    "polynomial.gemspec",
     "polynomials.gemspec",
     "test/helper.rb",
     "test/math_test.rb",

data/test/math_test.rb

@@ -1,65 +1,65 @@
 require 'test_helper'
 class TestMath < MiniTest::Unit::TestCase
-  def test_nulls_for_constant_functions
+  def test_roots_for_constant_functions
     polynomial = Polynomial.parse('5')
-    assert_equal Set[],polynomial.nulls
+    assert_equal Set[],polynomial.roots
   end
 
-  def test_nulls_for_linear_functions
+  def test_roots_for_linear_functions
     polynomial = Polynomial.parse('5x + 2')
-    assert_equal Set[-2.0/5.0],polynomial.nulls
+    assert_equal Set[-2.0/5.0],polynomial.roots
   end
 
-  def test_nulls_quadratic_functions
+  def test_roots_quadratic_functions
     polynomial = Polynomial.parse('3x^2 + 2x - 40')
     p = 2.0/3.0
     q = -40.0/3.0
     root = Math.sqrt((p/2)**2 - q)
     fraction = -(p/2)
-    assert_equal Set[(fraction - root).round(10), (fraction + root).round(10)],polynomial.nulls
+    assert_equal Set[(fraction - root).round(10), (fraction + root).round(10)],polynomial.roots
 
     polynomial = Polynomial.parse('3x^2 - 40')
-    assert_equal Set[Math.sqrt(40.0/3).round(10), -Math.sqrt(40.0/3).round(10)], polynomial.nulls
+    assert_equal Set[Math.sqrt(40.0/3).round(10), -Math.sqrt(40.0/3).round(10)], polynomial.roots
   end
 
-  def test_nulls_for_cubic_functions
+  def test_roots_for_cubic_functions
     polynomial = Polynomial.parse('1x^3  + 1x^2  + 2x - 1')
-    assert_equal(1, polynomial.nulls.size)
-    assert_equal Set[0.3926467817], polynomial.nulls
+    assert_equal(1, polynomial.roots.size)
+    assert_equal Set[0.3926467817], polynomial.roots
 
     polynomial = Polynomial.parse('2x^3  - 4x^2  - 22x + 24')
-    assert_equal Set[4.0,-3.0,1.0], polynomial.nulls
+    assert_equal Set[4.0,-3.0,1.0], polynomial.roots
   end
 
-  def test_nulls_for_cubic_functions_with_complex
+  def test_roots_for_cubic_functions_with_complex
     coefficients = Polynomial.parse('3x^3   - 10x^2   + 14x + 27').terms.first(4).map{ |t| t.last.coefficient }
     assert_equal Set[-1.0, Complex(2.1666666666666634,2.0749832663314605), Complex(2.1666666666666634,-2.0749832663314605)],Math.roots_of_cubic_function(*coefficients, true)
   end
 
-  def test_nulls_for_cubic_functions_one_real_all_equal
+  def test_roots_for_cubic_functions_one_real_all_equal
     polynomial = Polynomial.parse('1x^3   + 6x^2   + 12x + 8')
-    assert_equal(1, polynomial.nulls.size)
-    assert_equal(-2, polynomial.nulls.first)
+    assert_equal(1, polynomial.roots.size)
+    assert_equal(-2, polynomial.roots.first)
   end
 
-  def test_nulls_for_quartic_functions
+  def test_roots_for_quartic_functions
     polynomial = Polynomial.parse('3x^4   + 6x^3   - 123x^2   - 126x + 1080')
-    assert_equal Set[5.0, 3.0, -4.0, -6.0], polynomial.nulls
+    assert_equal Set[5.0, 3.0, -4.0, -6.0], polynomial.roots
 
     polynomial = Polynomial.parse('-20x^4   + 5x^3   + 17x^2   - 29x + 87')
-    assert_equal Set[-1.6820039266,1.4875831103], polynomial.nulls
+    assert_equal Set[-1.6820039266,1.4875831103], polynomial.roots
   end
 
-  def test_nulls_without_term_with_exponent_of_zero
+  def test_roots_without_term_with_exponent_of_zero
     polynomial = Polynomial.parse('3x^3 + 3x^2')
-    assert_equal Set[0.0,-1.0], polynomial.nulls
+    assert_equal Set[0.0,-1.0], polynomial.roots
 
     polynomial = Polynomial.parse('1 x^4')
-    assert_equal Set[0.0], polynomial.nulls
+    assert_equal Set[0.0], polynomial.roots
   end
 
-  def test_nulls_biquadratic_equation
+  def test_roots_biquadratic_equation
     polynomial = Polynomial.parse('4x^4 + 2x^2 - 1')
-    assert_equal Set[0.5558929703, -0.5558929703], polynomial.nulls
+    assert_equal Set[0.5558929703, -0.5558929703], polynomial.roots
   end
 end

data/test/polynomial_test.rb

@@ -56,6 +56,9 @@ class TestPolynomial < MiniTest::Unit::TestCase
 
     polynomial = Polynomial.parse('-1 x^4')
     assert_equal({ right: Set[-1.0/0..+1.0/0] }, polynomial.curvature_behaviour)
+
+    polynomial = Polynomial.parse('5x^2')
+    assert_equal({ left: Set[-1.0/0..+1.0/0] }, polynomial.curvature_behaviour)
   end
 
   def test_no_curve_and_no_inflection_points

metadata

@@ -5,8 +5,8 @@ version: !ruby/object:Gem::Version
   segments: 
   - 0
   - 1
-  - 2
-  version: 0.1.2
+  - 4
+  version: 0.1.4
 platform: ruby
 authors: 
 - Manuel Korfmann
@@ -14,7 +14,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2011-05-12 00:00:00 +02:00
+date: 2011-05-13 00:00:00 +02:00
 default_executable: 
 dependencies: 
 - !ruby/object:Gem::Dependency 
@@ -109,7 +109,6 @@ files:
 - lib/core_ext/math.rb
 - lib/polynomials.rb
 - lib/term.rb
-- polynomial.gemspec
 - polynomials.gemspec
 - test/helper.rb
 - test/math_test.rb
@@ -130,7 +129,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
-      hash: -894786567939167734
+      hash: -100517783123906074
       segments: 
       - 0
       version: "0"

data/polynomial.gemspec

@@ -1,76 +0,0 @@
-# Generated by jeweler
-# DO NOT EDIT THIS FILE DIRECTLY
-# Instead, edit Jeweler::Tasks in Rakefile, and run 'rake gemspec'
-# -*- encoding: utf-8 -*-
-
-Gem::Specification.new do |s|
-  s.name = %q{polynomial}
-  s.version = "0.1.1"
-
-  s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
-  s.authors = ["Manuel Korfmann"]
-  s.date = %q{2011-05-12}
-  s.description = %q{
-* Parses polynomials
-* Provides useful methods on top of the Polynomial class, like:
- ** Polynomial#local_extremums
- ** Polynomial#nulls
- ** Polynomial#curvature_behaviour
-* Implements root's finding formulas for quadratic, cubic and quartic functions
-  }
-  s.email = %q{manu@korfmann.info}
-  s.extra_rdoc_files = [
-    "LICENSE.txt",
-    "README.rdoc"
-  ]
-  s.files = [
-    ".document",
-    "Gemfile",
-    "Gemfile.lock",
-    "LICENSE.txt",
-    "README.rdoc",
-    "Rakefile",
-    "VERSION",
-    "lib/core_ext/math.rb",
-    "lib/polynomials.rb",
-    "lib/term.rb",
-    "polynomial.gemspec",
-    "polynomials.gemspec",
-    "test/helper.rb",
-    "test/math_test.rb",
-    "test/polynomial_test.rb",
-    "test/term_test.rb",
-    "test/test_helper.rb"
-  ]
-  s.homepage = %q{http://github.com/mkorfmann/polynomials}
-  s.licenses = ["MIT"]
-  s.require_paths = ["lib"]
-  s.rubygems_version = %q{1.3.7}
-  s.summary = %q{Polyomial calculations library}
-
-  if s.respond_to? :specification_version then
-    current_version = Gem::Specification::CURRENT_SPECIFICATION_VERSION
-    s.specification_version = 3
-
-    if Gem::Version.new(Gem::VERSION) >= Gem::Version.new('1.2.0') then
-      s.add_development_dependency(%q<shoulda>, [">= 0"])
-      s.add_development_dependency(%q<bundler>, ["~> 1.0.0"])
-      s.add_development_dependency(%q<jeweler>, ["~> 1.6.0"])
-      s.add_development_dependency(%q<rcov>, [">= 0"])
-      s.add_development_dependency(%q<awesome_print>, [">= 0"])
-    else
-      s.add_dependency(%q<shoulda>, [">= 0"])
-      s.add_dependency(%q<bundler>, ["~> 1.0.0"])
-      s.add_dependency(%q<jeweler>, ["~> 1.6.0"])
-      s.add_dependency(%q<rcov>, [">= 0"])
-      s.add_dependency(%q<awesome_print>, [">= 0"])
-    end
-  else
-    s.add_dependency(%q<shoulda>, [">= 0"])
-    s.add_dependency(%q<bundler>, ["~> 1.0.0"])
-    s.add_dependency(%q<jeweler>, ["~> 1.6.0"])
-    s.add_dependency(%q<rcov>, [">= 0"])
-    s.add_dependency(%q<awesome_print>, [">= 0"])
-  end
-end
-