polynomials 0.4.0 → 0.4.1

data/.travis.yml

@@ -0,0 +1,4 @@
+script: "rake"
+rvm:
+  - 1.9.2
+

data/README.markdown

@@ -1,5 +1,7 @@
 # Polynomials
 
+[![Build Status](http://travis-ci.org/mkorfmann/polynomials.png)](http://travis-ci.org/mkorfmann/polynomials)
+
 ## Usage
 
 <pre><code>
@@ -14,16 +16,18 @@ points =  polynomial.roots | polynomial.local_extrema | polynomial.inflection_po
 
 max_x =  points.max_by(&amp;:x).x
 min_x =  points.min_by(&amp;:x).x
+max_x = max_x ? max_x.x : 1
+min_x = min_x ? min_x.x : -1
 
-start = (min_x - min_x.abs/2)
-stop = (max_x + max_x.abs/2)
-
-step = (max_x-min_x).abs/200
+difference = (max_x-min_x).abs
 
-pointset = polynomials.pointset(start,stop,step)
+start = min_x - difference/4.0
+stop = max_x + difference/4.0
+step = difference/200.0
 
-data_x = pointset.map(&:x)
-data_y = pointset.map(&:y)
+pointset = polynomial.pointset(start,stop,step)
+data_x =  pointset.map(&:first)
+data_y = pointset.map(&:last)
 
 Gnuplot.open do |gp|
   Gnuplot::Plot.new(gp) do |plot|

data/VERSION

@@ -1 +1 @@
-0.4.0
+0.4.1

data/examples/plot_only_mutual_data.rb

@@ -9,14 +9,14 @@ points =  polynomial.roots | polynomial.local_extrema | polynomial.inflection_po
 
 max_x =  points.max_by(&:x)
 min_x =  points.min_by(&:x)
-max_x = max_x ? max_x.x : 1
-min_x = min_x ? min_x.x : -1
+max_x = max_x == 0 ? max_x.x : 1
+min_x = min_x == 0 ? min_x.x : -1
 
 difference = (max_x-min_x).abs
 
 start = min_x - difference/4.0
 stop = max_x + difference/4.0
-step = difference/200.0
+step = (start-stop).abs/1000.0
 
 pointset = polynomial.pointset(start,stop,step)
 data_x=  pointset.map(&:first)
@@ -33,6 +33,7 @@ Gnuplot.open do |gp|
       ds.with = "lines"
       ds.linewidth = 0.2
       ds.title =  "f(x) = #{polynomial}"
+      ds.smooth
     end
 
     [:inflection_point,:root, :maximum, :minimum].each do |kind_of_point|

data/lib/polynomials/analyzable.rb

@@ -5,8 +5,9 @@ module Polynomials
 
     def strives_for
       roots = self.roots.map(&:x)
-      return nil if roots.empty?
-      [self.(roots.min - 1).sign, self.(roots.max + 1).sign].map { |d| d * Infinity }
+      local_extrema = self.local_extrema.map(&:x)
+      return nil if roots.empty? && local_extrema.empty?
+      [self.((roots.min || local_extrema.min) - 1).sign, self.((roots.max || local_extrema.max) + 1).sign].map { |d| d * Infinity }
     end
 
     def inflection_points

data/lib/polynomials/polynomial.rb

@@ -31,14 +31,13 @@ module Polynomials
 
     def derivative
       new_function = self.alter do |nf, term|
-        nf.terms[term.exponent - 1].coefficient += term.exponent * term.coefficient
+        (nf.terms[term.exponent - 1].coefficient += term.exponent * term.coefficient) unless term.exponent.zero?
       end
-      new_function.terms.reject! { |_,t| t.coefficient == 0 }
-      return new_function
+
     end
 
     def roots
-      if !terms.empty? and terms.keys.none?(&:zero?)
+      if !terms.empty? and (terms.keys.none?(&:zero?) || terms[0].coefficient.zero?)
         self.alter { |nf, term| nf.terms[term.exponent-self.lt.exponent].coefficient = term.coefficient }.roots << Root.new(0.0)
       else
         case self.degree
@@ -77,7 +76,7 @@ module Polynomials
     end
 
     def lt
-      self.terms[self.terms.min_by{ |_,t| t.exponent}.first]
+      self.terms[self.terms.reject { |_,t| t.coefficient.zero? }.min_by{ |_,t| t.exponent}.first]
     end
 
     def pointset(start,stop,step=0.1)
@@ -90,6 +89,16 @@ module Polynomials
       data << [stop,self.(stop)]
     end
 
+    def grouped_pointset(start,stop,step=0.1,grouped)
+      grouped.each do |key,intervals|
+        intervals.reject! { |s,e| e < start || s > stop }
+        intervals.map! do |s,e|
+          self.pointset([s,start].max, [e,stop].min, step)
+        end
+      end
+      return grouped
+    end
+
     def coefficients_till(n)
       coefficients = []
       (0..n).each do |e|

data/polynomials.gemspec

@@ -5,11 +5,11 @@
 
 Gem::Specification.new do |s|
   s.name = %q{polynomials}
-  s.version = "0.4.0"
+  s.version = "0.4.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-18}
+  s.date = %q{2011-05-19}
   s.description = %q{
 This is a gem dedicated to parsing, manipulating and finding roots,extrema and inflection points of polynomials.
 It can solve polynomial equations with a degree up to 4 by implementing formulas for solving quadratic, cubic and quartic functions.
@@ -21,6 +21,7 @@ It can solve polynomial equations with a degree up to 4 by implementing formulas
   ]
   s.files = [
     ".document",
+    ".travis.yml",
     "Gemfile",
     "Gemfile.lock",
     "LICENSE.txt",

data/test/analyzable_test.rb

@@ -73,4 +73,19 @@ class TestAnalyzable < MiniTest::Unit::TestCase
     polynomial = Polynomial.parse('+ 1.0 x^4 + 5.0 x^3 - 1.0 x^2 + 3.0 x + 5.0').derivative
     assert_equal [-Infinity,Infinity], polynomial.strives_for
   end
+
+  def test_inflection_points_some_coefficients_of_derivative2_zero
+    polynomial = Polynomial.parse('x^5 + x^1')
+    assert_set_eql Set[], polynomial.inflection_points
+  end
+
+  def test_curvature_behaviour_degree_4
+    polynomial = Polynomial.parse('x^5 + x^1')
+    assert_equal({ :right => [[-Infinity,0.0]], :left => [[0.0, Infinity]] }, polynomial.curvature_behaviour)
+  end
+
+  def test_strives_for_no_roots
+    polynomial = Polynomial.new(1,0,0,0,0)
+    assert_equal [Infinity,Infinity], polynomial.strives_for
+  end
 end

data/test/polynomial_test.rb

@@ -73,4 +73,16 @@ class TestPolynomial < MiniTest::Unit::TestCase
     polynomial = Polynomial.new(1,0,0)
     assert_equal [[0.1,0.1**2],[0.2,0.2**2],[0.25,0.25**2]],  polynomial.pointset(0.1,0.25,0.1)
   end
+
+  def test_grouped_pointset
+    polynomial = Polynomial.new(1,0,0)
+    assert_equal({ :jellyfish => [[[-0.1,0.1**2,],[0,0.0]]] , :peanut_butter => [[[0,0.0],[0.1,0.1**2],[0.2,0.2**2],[0.25,0.25**2]]]},
+                 polynomial.grouped_pointset(-0.1,0.25,0.1, { :jellyfish => [[-Infinity,0]], :peanut_butter => [[0,Infinity]] }))
+  end
+
+  def test_grouped_pointset_omitting_inteval_through_start_out_of_range
+    polynomial = Polynomial.new(1,0,0)
+    assert_equal({ :jellyfish => [[[-0.005,0.005**2,],[0,0.0]]] , :peanut_butter => [[[0,0.0],[0.1,0.1**2],[0.2,0.2**2],[0.25,0.25**2]]]},
+                 polynomial.grouped_pointset(-0.005,0.25,0.1, { :jellyfish => [[-0.01,0]], :peanut_butter => [[-Infinity,-0.1],[0,Infinity]] }))
+  end
 end

metadata

@@ -2,7 +2,7 @@
 name: polynomials
 version: !ruby/object:Gem::Version 
   prerelease: 
-  version: 0.4.0
+  version: 0.4.1
 platform: ruby
 authors: 
 - Manuel Korfmann
@@ -10,7 +10,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2011-05-18 00:00:00 +02:00
+date: 2011-05-19 00:00:00 +02:00
 default_executable: 
 dependencies: 
 - !ruby/object:Gem::Dependency 
@@ -92,6 +92,7 @@ extra_rdoc_files:
 - README.markdown
 files: 
 - .document
+- .travis.yml
 - Gemfile
 - Gemfile.lock
 - LICENSE.txt
@@ -127,7 +128,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
-      hash: 1327775676768691689
+      hash: 805629987972417453
       segments: 
       - 0
       version: "0"