polynomials 0.3.0 → 0.4.0

data/README.markdown

@@ -4,51 +4,50 @@
 
 <pre><code>
 require 'polynomials'
-  require 'gnuplot'
-  include Polynomials
+require 'gnuplot'
+include Polynomials
 
 
-  polynomial = Polynomial.parse(ARGV[0])
+polynomial = Polynomial.parse(ARGV[0])
 
-  points =  polynomial.roots | polynomial.local_extrema | polynomial.inflection_points
+points =  polynomial.roots | polynomial.local_extrema | polynomial.inflection_points
 
-  max_x =  points.max_by(&amp;:x).x
-  min_x =  points.min_by(&amp;:x).x
+max_x =  points.max_by(&amp;:x).x
+min_x =  points.min_by(&amp;:x).x
 
-  start = (min_x - 0.1)
-  stop = (max_x + 0.1)
+start = (min_x - min_x.abs/2)
+stop = (max_x + max_x.abs/2)
 
-  x = start
-  data_x,data_y = [],[]
-  while x &lt; stop
-    data_x &lt;&lt; x
-    data_y &lt;&lt; polynomial.(x)
-    x += 0.005
-  end
+step = (max_x-min_x).abs/200
 
-  Gnuplot.open do |gp|
-    Gnuplot::Plot.new(gp) do |plot|
-      plot.xrange &quot;[#{start}:#{stop}]&quot;
-      plot.title  &quot;Polynomial&quot;
-      plot.ylabel &quot;f(x)&quot;
-      plot.xlabel &quot;x&quot;
-      plot.grid
-      plot.data &lt;&lt; Gnuplot::DataSet.new( [data_x,data_y] ) do |ds|
-        ds.with = &quot;lines&quot;
-        ds.linewidth = 0.1
-        ds.title =  &quot;f(x) = #{polynomial}&quot;
-      end
+pointset = polynomials.pointset(start,stop,step)
+
+data_x = pointset.map(&:x)
+data_y = pointset.map(&:y)
+
+Gnuplot.open do |gp|
+  Gnuplot::Plot.new(gp) do |plot|
+    plot.xrange &quot;[#{start}:#{stop}]&quot;
+    plot.title  &quot;Polynomial&quot;
+    plot.ylabel &quot;f(x)&quot;
+    plot.xlabel &quot;x&quot;
+    plot.grid
+    plot.data &lt;&lt; Gnuplot::DataSet.new( [data_x,data_y] ) do |ds|
+      ds.with = &quot;lines&quot;
+      ds.linewidth = 0.2
+      ds.title =  &quot;f(x) = #{polynomial}&quot;
+    end
 
-      [:inflection_point,:root, :maximum, :minimum].each do |kind_of_point|
-        selected_points = points.select(&amp;:&quot;#{kind_of_point}?&quot;)
-        plot.data &lt;&lt; Gnuplot::DataSet.new([selected_points.map(&amp;:x), selected_points.map(&amp;:y)]) do |ds|
-          ds.with = &quot;points&quot;
-          ds.linewidth = 2
-          ds.title = kind_of_point.to_s.pluralize.titleize
-        end
+    [:inflection_point,:root, :maximum, :minimum].each do |kind_of_point|
+      selected_points = points.select(&amp;:&quot;#{kind_of_point}?&quot;)
+      plot.data &lt;&lt; Gnuplot::DataSet.new([selected_points.map(&amp;:x), selected_points.map(&amp;:y)]) do |ds|
+        ds.with = &quot;points&quot;
+        ds.linewidth = 2
+        ds.title = kind_of_point.to_s.pluralize.titleize
       end
     end
   end
+end
 </code></pre>
 
 ### Bash Command

data/VERSION

@@ -1 +1 @@
-0.3.0
+0.4.0

data/examples/plot_only_mutual_data.rb

@@ -7,19 +7,20 @@ polynomial = Polynomial.parse(ARGV[0])
 
 points =  polynomial.roots | polynomial.local_extrema | polynomial.inflection_points
 
-max_x =  points.max_by(&:x).x
-min_x =  points.min_by(&:x).x
-
-start = (min_x - 0.1)
-stop = (max_x + 0.1)
-
-x = start
-data_x,data_y = [],[]
-while x < stop
-  data_x << x
-  data_y << polynomial.(x)
-  x += 0.005
-end
+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
+
+difference = (max_x-min_x).abs
+
+start = min_x - difference/4.0
+stop = max_x + difference/4.0
+step = difference/200.0
+
+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|
@@ -30,7 +31,7 @@ Gnuplot.open do |gp|
     plot.grid
     plot.data << Gnuplot::DataSet.new( [data_x,data_y] ) do |ds|
       ds.with = "lines"
-      ds.linewidth = 0.1
+      ds.linewidth = 0.2
       ds.title =  "f(x) = #{polynomial}"
     end
 
@@ -44,4 +45,3 @@ Gnuplot.open do |gp|
     end
   end
 end
-

data/lib/polynomials.rb

@@ -7,13 +7,21 @@ ActiveSupport::Inflector.inflections do |inflect|
   inflect.singular /ma$/, '\1mum'
 end
 
-require 'polynomial'
+require 'exceptions'
+require 'formulas'
 require 'set'
-require 'term'
 require 'point'
-require 'formulas'
-require 'exceptions'
+require 'term'
+require 'analyzable'
+require 'polynomial'
 
 
 module Polynomials
+  Infinity = 1.0/0
+end
+
+class Numeric
+  def sign
+    self/self.abs
+  end
 end

data/lib/polynomials/analyzable.rb

@@ -0,0 +1,54 @@
+module Polynomials
+  module Analyzable
+    AfterExtremaCurvatureMapping = { maximum: :right, minimum: :left }
+    MinimumOrMaximum = {[1.0,-1.0] => :maximum,[-1.0,1.0] => :minimum}
+
+    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 }
+    end
+
+    def inflection_points
+      self.derivative.local_extrema.map { |p| InflectionPoint.new(p.x,self.calculate(p.x)) }.to_set
+    end
+
+    def local_extrema
+      derivative = self.derivative
+      possible_extrema = derivative.roots.sort.map(&:x)
+
+      return Set[] if possible_extrema.empty?
+
+      samples = possible_extrema.sort.each_cons(2).map do |before,after|
+        (before + after)/2
+      end
+
+      samples.unshift possible_extrema.first - 1
+      samples.push possible_extrema.last + 1
+
+      possible_extrema.zip(samples.each_cons(2)).inject(Set[]) do |set,(pe,sample)|
+        directions = sample.map { |x| derivative.(x).sign}
+        kind_of_extremum = MinimumOrMaximum[directions]
+        next set unless kind_of_extremum
+        set <<  Extremum.new(pe,self.calculate(pe), kind_of_extremum)
+      end
+    end
+
+    def curvature_behaviour
+      hash = Hash.new {|h,k|h[k]=[]}
+
+      dd = self.derivative.derivative
+      return nil if !(strives_for = derivative.strives_for) || dd.(dd.roots.sort.last.to_f + 1) == 0
+
+      ([[-Infinity,strives_for[0]]] + derivative.local_extrema.sort + [[Infinity,strives_for[-1]]]).each_cons(2).chunk do |b,_|
+        if b.is_a? Point
+          AfterExtremaCurvatureMapping[b.kind_of_extremum]
+        else
+          b.last < 0 ? :left : :right
+        end
+      end.with_index.inject(hash) do |hash,((curvature,values),i)|
+        hash.tap { |h| h[curvature].concat values.each {|a| a.map! { |p| (p.is_a? Point) ? p.x : p.first }}}
+      end
+    end
+  end
+end

data/lib/polynomials/point.rb

@@ -2,6 +2,7 @@ module Polynomials
   class Point
     include Comparable
     attr_accessor :x, :y
+    alias to_f x
 
     def self.inherited(subclass)
       self.class_eval do 

data/lib/polynomials/polynomial.rb

@@ -1,9 +1,6 @@
 module Polynomials
   class Polynomial
-
-    MinMaxMapping = { 1.0 => :maximum, -1.0  => :minimum }
-    AfterExtremaCurvatureMapping = { maximum: :right, minimum: :left }
-    NegPosMinMaxExtremumMapping = {[1.0,-1.0] => :maximum,[-1.0,1.0] => :minimum}
+    include Analyzable
 
     attr_accessor :terms
 
@@ -59,30 +56,6 @@ module Polynomials
       end
     end
 
-    def local_extrema
-      derivative = self.derivative
-      possible_extrema = derivative.roots.sort.map(&:x)
-      return Set[] if possible_extrema.empty?
-      samples = ([possible_extrema.first - 1] + possible_extrema.sort + [possible_extrema.last + 1]).each_cons(2).map do |before,after|
-        (before + after)/2
-      end
-      possible_extrema.zip(samples.each_cons(2)).inject(Set[]) do |set,(pe,(after,before))|
-        yafter = derivative.calculate(after)
-        ybefore = derivative.calculate(before)
-        kind_of_extremum = NegPosMinMaxExtremumMapping[[yafter/yafter.abs,ybefore/ybefore.abs]]
-        set <<  Extremum.new(pe,self.calculate(pe), kind_of_extremum) if kind_of_extremum
-        set
-      end
-    end
-
-    def curvature_behaviour
-      hash = Hash.new {|h,k|h[k]=Set.new}
-      return hash if self.degree > 5
-      self.derivative.extrema.sort.each_cons(2).group_by do |start,_|
-        kind_of_curvature = AfterExtremaCurvatureMapping[start.kind_of_extremum]
-      end.tap { |h| h.values.each { |v| v.map! { |s,e| Range.new(s.x,e.x) }}}
-    end
-
     def degree
       self.terms.keys.max || 0
     end
@@ -99,22 +72,6 @@ module Polynomials
       self.terms.delete_if(&delete_zeros) == other.terms.delete_if(&delete_zeros)
     end
 
-    def extrema
-      extrema = local_extrema
-      unless self.degree == 0
-        a = self.gt.coefficient
-        max_or_min = (self.degree.even? ? [1.0,1.0] : [-1.0,1.0]).map { |n| (n * a)/a.abs  }
-        max_or_min.zip([-Infinity,Infinity]).each do |kind_of_extremum, x|
-          extrema << Extremum.new(x,nil,MinMaxMapping[kind_of_extremum])
-        end
-      end
-      return extrema
-    end
-
-    def inflection_points
-      self.derivative.local_extrema.map { |p| InflectionPoint.new(p.x,self.calculate(p.x)) }.to_set
-    end
-
     def gt
       self.terms[self.degree]
     end
@@ -123,6 +80,16 @@ module Polynomials
       self.terms[self.terms.min_by{ |_,t| t.exponent}.first]
     end
 
+    def pointset(start,stop,step=0.1)
+      data = []
+      x = start
+      while x < stop
+        data << [x,self.(x)]
+        x += step
+      end
+      data << [stop,self.(stop)]
+    end
+
     def coefficients_till(n)
       coefficients = []
       (0..n).each do |e|
@@ -141,4 +108,5 @@ module Polynomials
     end
     protected :alter
   end
+
 end

data/polynomials.gemspec

@@ -5,11 +5,11 @@
 
 Gem::Specification.new do |s|
   s.name = %q{polynomials}
-  s.version = "0.3.0"
+  s.version = "0.4.0"
 
   s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
   s.authors = ["Manuel Korfmann"]
-  s.date = %q{2011-05-15}
+  s.date = %q{2011-05-18}
   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.
@@ -29,12 +29,14 @@ It can solve polynomial equations with a degree up to 4 by implementing formulas
     "VERSION",
     "examples/plot_only_mutual_data.rb",
     "lib/polynomials.rb",
+    "lib/polynomials/analyzable.rb",
     "lib/polynomials/exceptions.rb",
     "lib/polynomials/formulas.rb",
     "lib/polynomials/point.rb",
     "lib/polynomials/polynomial.rb",
     "lib/polynomials/term.rb",
     "polynomials.gemspec",
+    "test/analyzable_test.rb",
     "test/formulas_test.rb",
     "test/point_test.rb",
     "test/polynomial_test.rb",
@@ -44,11 +46,10 @@ It can solve polynomial equations with a degree up to 4 by implementing formulas
   s.homepage = %q{http://github.com/mkorfmann/polynomials}
   s.licenses = ["MIT"]
   s.require_paths = ["lib"]
-  s.rubygems_version = %q{1.3.7}
+  s.rubygems_version = %q{1.6.2}
   s.summary = %q{parsing and computing data on polynomials}
 
   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

data/test/analyzable_test.rb

@@ -0,0 +1,76 @@
+require "#{File.dirname(File.expand_path(__FILE__))}/test_helper"
+Infinity = 1.0/0
+class TestAnalyzable < MiniTest::Unit::TestCase
+  include Polynomials
+
+  def test_local_extrema
+    polynomial = Polynomial.parse('3x^2 + 2x + 1')
+    assert_set_eql(Set[ Extremum.new(-2.0/6.0,polynomial.calculate(-2.0/6.0), :minimum) ], polynomial.local_extrema)
+  end
+
+  def test_local_extrema_with_slope_of_derivative_equal_to_zero
+    polynomial = Polynomial.parse('1x^4')
+    assert_set_eql(Set[ Extremum.new(0.0,polynomial.calculate(0.0), :minimum) ], polynomial.local_extrema)
+  end
+
+  def test_no_local_extrema
+    polynomial = Polynomial.parse('6x^6 - 5x + 50')
+    assert_equal(Set[], polynomial.local_extrema)
+  end
+
+  def test_curvature_behaviour_no_inflection_points
+    polynomial = Polynomial.parse('1 x^4')
+    assert_equal({ left: [[-1.0/0,+1.0/0]] }, polynomial.curvature_behaviour)
+
+    polynomial = Polynomial.parse('-1 x^4')
+    assert_equal({ right: [[-1.0/0,+1.0/0]] }, polynomial.curvature_behaviour)
+
+    polynomial = Polynomial.parse('5x^2')
+    assert_equal({ left: [[-1.0/0,+1.0/0]] }, polynomial.curvature_behaviour)
+  end
+
+  def test_no_curvature
+    polynomials = []
+    polynomials << Polynomial.parse('0')
+    polynomials << Polynomial.parse('4')
+    polynomials.each do |polynomial|
+      assert_equal(nil, polynomial.curvature_behaviour)
+    end
+  end
+
+  def test_no_local_extrema_of_derivative_leads_to_no_curvature
+    polynomial = Polynomial.parse('50x^10 - 20x^2')
+    assert_equal({:left=>[[-Infinity, Infinity]]}, polynomial.curvature_behaviour)
+  end
+
+  def test_curvature_behaviour_two_inflection_points
+    polynomial = Polynomial.parse('+ 1.0 x^4 + 5.0 x^3 - 1.0 x^2 + 3.0 x + 5.0')
+    assert_equal({left:[[-1.0/0,-2.5649778198], [0.0649778198,1.0/0]], right: [[-2.5649778198,0.0649778198]] } , polynomial.curvature_behaviour)
+  end
+
+  def test_curvature_behaviour_three_inflection_points
+    polynomial = Polynomial.new(20,4,0,-1,-200)
+    assert_equal( {:right=>[[(-1/10),0.0]], :left=>[[-Infinity,(-1/10)], [0.0,Infinity]]}, polynomial.curvature_behaviour)
+  end
+
+  def test_inflection_points
+    polynomial = Polynomial.new(20,4,0,-1,-200)
+    assert_set_eql Set[InflectionPoint.new(-1/10,polynomial.(-1/10)),InflectionPoint.new(0,polynomial.(0))], polynomial.inflection_points
+  end
+
+  def test_strives_for
+    polynomial = Polynomial.new(2,0,0)
+    assert_equal [Infinity,Infinity], polynomial.strives_for
+    polynomial = Polynomial.new(-2,0,0)
+    assert_equal [-Infinity,-Infinity], polynomial.strives_for
+    polynomial = Polynomial.new(2,0,0,0)
+    assert_equal [-Infinity,Infinity], polynomial.strives_for
+    polynomial = Polynomial.new(-2,0,0,0)
+    assert_equal [Infinity,-Infinity], polynomial.strives_for
+    polynomial = Polynomial.new(2)
+    assert_equal nil, polynomial.strives_for
+
+    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
+end

data/test/polynomial_test.rb

@@ -44,65 +44,6 @@ class TestPolynomial < MiniTest::Unit::TestCase
     assert_equal 5,Polynomial.parse('3x^5 - 5 x + 3').degree
   end
 
-  def test_extrema
-    polynomial = Polynomial.parse('3x^2 + 2x + 1')
-    assert_set_eql(Set[ Extremum.new(-2.0/6.0,polynomial.calculate(-2.0/6.0), :minimum) ], polynomial.local_extrema)
-    polynomial = Polynomial.parse('5x^3 - 5x^2 + 2x - 2')
-  end
-
-  def test_extrema_with_slope_of_derivative_equal_to_zero
-    polynomial = Polynomial.parse('1x^4')
-    assert_set_eql(Set[ Extremum.new(0.0,polynomial.calculate(0.0), :minimum) ], polynomial.local_extrema)
-    assert_set_eql(Set[*[Infinity,-Infinity].map { |x| Extremum.new(x,nil, :maximum)}, Extremum.new(0.0,polynomial.calculate(0.0), :minimum) ], polynomial.extrema)
-  end
-
-  def test_no_local_extrema
-    polynomial = Polynomial.parse('6x^6 - 5x + 50')
-    assert_equal(Set[], polynomial.local_extrema)
-    assert_set_eql(Set[*[ -1.0/0, 1.0/0 ].map { |x| Extremum.new(x, nil, :maximum)}], polynomial.extrema)
-  end
-
-  def test_curvature_behaviour_no_inflection_points
-    polynomial = Polynomial.parse('1 x^4')
-    assert_equal({ left: [-1.0/0..+1.0/0] }, polynomial.curvature_behaviour)
-
-    polynomial = Polynomial.parse('-1 x^4')
-    assert_equal({ right: [-1.0/0..+1.0/0] }, polynomial.curvature_behaviour)
-
-    polynomial = Polynomial.parse('5x^2')
-    assert_equal({ left: [-1.0/0..+1.0/0] }, polynomial.curvature_behaviour)
-  end
-
-  def test_no_extremums
-    polynomial = Polynomial.parse('5')
-    assert_equal(Set[], polynomial.extrema)
-  end
-
-  def test_no_curvature
-    polynomials = []
-    polynomials << Polynomial.parse('5 x + 4')
-    polynomials << Polynomial.parse('4')
-    polynomials.each do |polynomial|
-      assert_equal({}, polynomial.curvature_behaviour)
-    end
-  end
-
-  def test_local_extrema_of_derivative_leads_to_no_curvature
-    polynomial = Polynomial.parse('50x^10 - 20x^2')
-    assert_equal({}, polynomial.curvature_behaviour)
-  end
-
-  def test_curvature_behaviour_two_inflection_points
-    polynomial = Polynomial.parse('+ 1.0 x^4 + 5.0 x^3 - 1.0 x^2 + 3.0 x + 5.0')
-    assert_equal({left:[-1.0/0..-2.5649778198, 0.0649778198..1.0/0], right: [-2.5649778198..0.0649778198] } , polynomial.curvature_behaviour)
-  end
-
-  def test_curvature_behaviour_three_inflection_points
-    polynomial = Polynomial.new(20,4,0,-1,-200)
-    assert_equal( {:right=>[(-1/10)..0.0], :left=>[-Infinity..(-1/10), 0.0..Infinity]}, polynomial.curvature_behaviour)
-  end
-
-
   def test_efficient_roots_calculation
     polynomial = Polynomial.parse('200x^2342435 + 6x^20')
     assert_set_eql(Set[Root.new(0.0)], polynomial.roots)
@@ -123,8 +64,13 @@ class TestPolynomial < MiniTest::Unit::TestCase
     assert_equal '5x^3 + 2x - 1', polynomial.to_s
   end
 
-  def test_inflection_points
-    polynomial = Polynomial.new(20,4,0,-1,-200)
-    assert_set_eql Set[InflectionPoint.new(-1/10,polynomial.(-1/10)),InflectionPoint.new(0,polynomial.(0))], polynomial.inflection_points
+  def test_pointset
+    polynomial = Polynomial.new(1,0,0)
+    assert_equal (-2..2).step(0.5).map { |x| [x,x**2] },  polynomial.pointset(-2,2,0.5)
+  end
+
+  def test_pointset_with_float_start
+    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
 end

metadata

@@ -1,12 +1,8 @@
 --- !ruby/object:Gem::Specification 
 name: polynomials
 version: !ruby/object:Gem::Version 
-  prerelease: false
-  segments: 
-  - 0
-  - 3
-  - 0
-  version: 0.3.0
+  prerelease: 
+  version: 0.4.0
 platform: ruby
 authors: 
 - Manuel Korfmann
@@ -14,7 +10,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2011-05-15 00:00:00 +02:00
+date: 2011-05-18 00:00:00 +02:00
 default_executable: 
 dependencies: 
 - !ruby/object:Gem::Dependency 
@@ -24,10 +20,6 @@ dependencies:
     requirements: 
     - - ~>
       - !ruby/object:Gem::Version 
-        segments: 
-        - 1
-        - 0
-        - 0
         version: 1.0.0
   type: :development
   prerelease: false
@@ -39,10 +31,6 @@ dependencies:
     requirements: 
     - - ~>
       - !ruby/object:Gem::Version 
-        segments: 
-        - 1
-        - 6
-        - 0
         version: 1.6.0
   type: :development
   prerelease: false
@@ -54,8 +42,6 @@ dependencies:
     requirements: 
     - - ">="
       - !ruby/object:Gem::Version 
-        segments: 
-        - 0
         version: "0"
   type: :development
   prerelease: false
@@ -67,8 +53,6 @@ dependencies:
     requirements: 
     - - ">="
       - !ruby/object:Gem::Version 
-        segments: 
-        - 0
         version: "0"
   type: :development
   prerelease: false
@@ -80,8 +64,6 @@ dependencies:
     requirements: 
     - - ">="
       - !ruby/object:Gem::Version 
-        segments: 
-        - 0
         version: "0"
   type: :development
   prerelease: false
@@ -93,8 +75,6 @@ dependencies:
     requirements: 
     - - ">="
       - !ruby/object:Gem::Version 
-        segments: 
-        - 0
         version: "0"
   type: :development
   prerelease: false
@@ -120,12 +100,14 @@ files:
 - VERSION
 - examples/plot_only_mutual_data.rb
 - lib/polynomials.rb
+- lib/polynomials/analyzable.rb
 - lib/polynomials/exceptions.rb
 - lib/polynomials/formulas.rb
 - lib/polynomials/point.rb
 - lib/polynomials/polynomial.rb
 - lib/polynomials/term.rb
 - polynomials.gemspec
+- test/analyzable_test.rb
 - test/formulas_test.rb
 - test/point_test.rb
 - test/polynomial_test.rb
@@ -145,7 +127,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
-      hash: -1053346155644578569
+      hash: 1327775676768691689
       segments: 
       - 0
       version: "0"
@@ -154,13 +136,11 @@ required_rubygems_version: !ruby/object:Gem::Requirement
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
-      segments: 
-      - 0
       version: "0"
 requirements: []
 
 rubyforge_project: 
-rubygems_version: 1.3.7
+rubygems_version: 1.6.2
 signing_key: 
 specification_version: 3
 summary: parsing and computing data on polynomials