polynomials 0.1.0

data/.document

@@ -0,0 +1,5 @@
+lib/**/*.rb
+bin/*
+- 
+features/**/*.feature
+LICENSE.txt

data/Gemfile

@@ -0,0 +1,16 @@
+source "http://rubygems.org"
+# Add dependencies required to use your gem here.
+# Example:
+#   gem "activesupport", ">= 2.3.5"
+
+# Add dependencies to develop your gem here.
+# Include everything needed to run rake, tests, features, etc.
+group :development do
+  gem "shoulda", ">= 0"
+  gem "bundler", "~> 1.0.0"
+  gem "jeweler", "~> 1.6.0"
+  gem "rcov", ">= 0"
+end
+group :development, :tests do
+  gem 'awesome_print'
+end

data/Gemfile.lock

@@ -0,0 +1,22 @@
+GEM
+  remote: http://rubygems.org/
+  specs:
+    awesome_print (0.3.2)
+    git (1.2.5)
+    jeweler (1.6.0)
+      bundler (~> 1.0.0)
+      git (>= 1.2.5)
+      rake
+    rake (0.8.7)
+    rcov (0.9.9)
+    shoulda (2.11.3)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  awesome_print
+  bundler (~> 1.0.0)
+  jeweler (~> 1.6.0)
+  rcov
+  shoulda

data/LICENSE.txt

@@ -0,0 +1,20 @@
+Copyright (c) 2011 Manuel Korfmann
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.rdoc

@@ -0,0 +1,19 @@
+= polynomials
+
+Description goes here.
+
+== Contributing to polynomials
+ 
+* Check out the latest master to make sure the feature hasn't been implemented or the bug hasn't been fixed yet
+* Check out the issue tracker to make sure someone already hasn't requested it and/or contributed it
+* Fork the project
+* Start a feature/bugfix branch
+* Commit and push until you are happy with your contribution
+* Make sure to add tests for it. This is important so I don't break it in a future version unintentionally.
+* Please try not to mess with the Rakefile, version, or history. If you want to have your own version, or is otherwise necessary, that is fine, but please isolate to its own commit so I can cherry-pick around it.
+
+== Copyright
+
+Copyright (c) 2011 Manuel Korfmann. See LICENSE.txt for
+further details.
+

data/Rakefile

@@ -0,0 +1,60 @@
+# encoding: utf-8
+
+require 'rubygems'
+require 'bundler'
+begin
+  Bundler.setup(:default, :development)
+rescue Bundler::BundlerError => e
+  $stderr.puts e.message
+  $stderr.puts "Run `bundle install` to install missing gems"
+  exit e.status_code
+end
+require 'rake'
+
+require 'jeweler'
+Jeweler::Tasks.new do |gem|
+  # gem is a Gem::Specification... see http://docs.rubygems.org/read/chapter/20 for more options
+  gem.name = "polynomials"
+  gem.homepage = "http://github.com/mkorfmann/polynomials"
+  gem.license = "MIT"
+  gem.summary = %Q{Polyomial calculations library}
+  gem.description = %Q{
+* Parses polyomials
+* Provides useful methods on top of the Polyonomial class, like:
+ ** Polyonomial#local_extremums
+ ** Polyonomial#nulls
+ ** Polyonomial#curvature_behaviour
+* Implements root's finding formulas for quadratic, cubic and quartic functions
+  }
+  gem.email = "manu@korfmann.info"
+  gem.authors = ["Manuel Korfmann"]
+  # dependencies defined in Gemfile
+end
+Jeweler::RubygemsDotOrgTasks.new
+
+require 'rake/testtask'
+Rake::TestTask.new(:test) do |test|
+  test.libs << 'lib' << 'test'
+  test.pattern = 'test/**/*_test.rb'
+  test.verbose = true
+end
+
+require 'rcov/rcovtask'
+Rcov::RcovTask.new do |test|
+  test.libs << 'test'
+  test.pattern = 'test/**/*_test.rb'
+  test.verbose = true
+  test.rcov_opts << '--exclude "gems/*"'
+end
+
+task :default => :test
+
+require 'rake/rdoctask'
+Rake::RDocTask.new do |rdoc|
+  version = File.exist?('VERSION') ? File.read('VERSION') : ""
+
+  rdoc.rdoc_dir = 'rdoc'
+  rdoc.title = "polynomials #{version}"
+  rdoc.rdoc_files.include('README*')
+  rdoc.rdoc_files.include('lib/**/*.rb')
+end

data/VERSION

@@ -0,0 +1 @@
+0.1.0

data/lib/core_ext/math.rb

@@ -0,0 +1,60 @@
+require 'mathn'
+module Math
+  def self.roots_of_cubic_function(a,b,c,d,with_complex = false)
+    f = ((3*c/a) - (b**2/a**2))/3
+    g = (((2*b**3)/a**3) - (9*b*c/a**2) + (27*d/a))/27
+    h = (g**2/4) + (f**3/27)
+    if f == 0 && g == 0 && h == 0
+      f = (3*c/a) - (b**2/a**2)
+      g = (2*b**3/a**3) - (9*b*c/a**2) + (27*d/a)
+      h = (g**2/4) + (f**3/27)
+      [-Math.cbrt(d/a)]
+    elsif h <= 0
+      i = Math.sqrt((g**2/4) - h)
+      j = Math.cbrt(i)
+      k = Math.acos(-(g / (2*i)))
+      l = j * -1
+      m = Math.cos(k/3)
+      n = Math.sqrt(3) * Math.sin(k/3)
+      p = (b/(3*a))*-1
+      [2*j*Math.cos(k/3) - (b/(3*a)), l*(m+n)+p, l*(m-n)+p]
+    else
+      f = (((3*c)/a) - (b**2/a**2))/3
+      g = ((2*b**3/a**3) - (9*b*c/a**2) + ((27*d)/a))/27
+      h = (g**2/4) + (f**3/27)
+      r = -(g/2) + Math.sqrt(h)
+      s = Math.cbrt(r)
+      t = -(g/2) - Math.sqrt(h)
+      u = Math.cbrt(t)
+      roots = [(s + u) - (b/(3*a))]
+      roots |= [1,-1].map do |algebraic_sign|
+        Complex((-(s + u)/2) - (b/(3*a)),algebraic_sign * (s-u)*Math.sqrt(3)/2)
+      end if with_complex
+      roots
+    end.map { |n| n.respond_to?(:round) ? n.round(10) : n }.to_set
+  end
+
+  def self.roots_of_quadratic_function(a,b,c)
+    p = b/a
+    q = c/a
+    denom = (p/2.0)**2 - q
+    return Set[] if denom < 0
+    root = Math.sqrt(denom)
+    Set.new([:+,:-].map{ |operator| (-(p/2.0)).send(operator, root)})
+  end
+
+  def self.roots_of_quartic_function(*args)
+    a,b,c,d,e = args.map { |n| n/args.first }
+    f = c - (3*b**2/8)
+    g = d + (b**3/8) - (b*c/2)
+    h = e - (3*b**4/256) + (b**2 * c/16) - ( b*d/4)
+    roots = self.roots_of_cubic_function(1,(f/2),(((f**2)-(4*h))/16),-(g**2)/64,true)
+    combs = roots.reject{ |n| n == 0}.combination(2)
+    only_complex = combs.select { |comb| comb.all? { |n| n.is_a? Complex }}
+    p,q = (only_complex.empty? ? combs.first : only_complex.first).map { |n| Math.sqrt(n) }
+    r = (-g/(8*p*q))
+    s = b/(4*a)
+    roots = Set.new([p + q + r -s, p - q - r -s, -p + q - r -s, -p - q + r -s].map { |n| n.is_a?(Complex) ? (n.real if n.imaginary == 0) : n }.compact )
+    roots.map { |n| n.respond_to?(:round) ? n.round(10) : n }.to_set
+  end
+end

data/lib/polynomial.rb

@@ -0,0 +1,127 @@
+require 'set'
+require_relative 'term'
+require_relative 'core_ext/math'
+class Polynomial
+  MinMaxMapping = { 1.0 => :max, -1.0  => :min }
+  AfterExtremumsCurvatureMapping = { max: :right, min: :left }
+  NegPosMinMaxExtremumMapping = {[1.0,-1.0] => :max,[-1.0,1.0] => :min}
+  attr_accessor :terms
+
+  def self.parse(string)
+    polynomial = self.new
+    string.split(/(?=[-+])/).each do |term|
+      parsed = Term.parse(term)
+      polynomial.terms[parsed.exponent].coefficient += parsed.coefficient
+    end
+    return polynomial
+  end
+
+  def initialize
+    self.terms = Hash.new { |hash, key| hash[key] = Term.new(key) }
+  end
+
+  def calculate(x)
+    self.terms.values.inject(0.0) do |acc,t|
+      acc + (t.coefficient.to_f * (x**t.exponent))
+    end
+  end
+
+  def derivative
+      new_function = self.alter do |nf, term|
+        nf.terms[term.exponent - 1].coefficient += term.exponent * term.coefficient
+      end
+      new_function.terms.reject! { |_,t| t.coefficient == 0 }
+    return new_function
+  end
+
+  def alter
+    new_function = self.class.new
+    self.terms.values.each do |term|
+      yield new_function, term
+    end
+    return new_function
+  end
+
+  def nulls
+    if terms.keys.none?(&:zero?)
+      self.alter { |nf, term| nf.terms[term.exponent-1].coefficient = term.coefficient }.nulls << 0.0
+    else
+      case self.degree
+      when 1
+        Set[-self.terms[0].coefficient / self.terms[1].coefficient]
+      when 2
+        Math.roots_of_quadratic_function(*coefficients_till(2))
+      when 3
+        Math.roots_of_cubic_function(*coefficients_till(3))
+      when 4
+        Math.roots_of_quartic_function(*coefficients_till(4))
+      else
+        Set[]
+      end
+    end
+  end
+
+  def local_extremums
+    derivative = self.derivative
+    possible_extremums = derivative.nulls.sort
+    max_min_extremum =  Hash.new { |hash,key| hash[key] = Set.new }
+
+    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
+    end
+    return max_min_extremum
+  end
+
+  def curvature_behaviour
+    if degree < 2
+      return {}
+    else
+      extremums = self.derivative.extremums
+      curvature_behaviour = Hash.new {|h,k|h[k]=Set.new}
+      extremums.values.inject(&:|).sort.each_cons(2) do |start_point,end_point|
+        curvature_behaviour[AfterExtremumsCurvatureMapping[extremums.find { |k,v| v.include?(start_point) }.first]] << Range.new(start_point,end_point)
+      end
+    end
+    return curvature_behaviour
+  end
+
+  def degree
+    self.terms.keys.max
+  end
+
+  def to_s
+    terms.delete_if { |_,t| t.coefficient.zero? }.sort_by { |_,t| -t.exponent }.inject("") do |string,(_,term)|
+      string << term.to_s
+    end.strip
+  end
+
+  def ==(other)
+    delete_zeros = proc{ |_,t| t.coefficient.zero? }
+    self.terms.delete_if(&delete_zeros) == other.terms.delete_if(&delete_zeros)
+  end
+
+  def extremums
+    extremums = local_extremums
+    a = self.terms[self.degree].coefficient
+    max_or_min = (self.degree.even? ? [1,1] : [-1,1]).map { |n| (n * a)/a.abs  }
+    extremums[MinMaxMapping[max_or_min.first]] << -1.0/0
+    extremums[MinMaxMapping[max_or_min.last]] << 1.0/0
+    return extremums
+  end
+
+ private
+  def coefficients_till(n)
+    coefficients = []
+    (0..n).each do |e|
+      coefficients << self.terms[e].coefficient
+    end
+    return coefficients.reverse
+  end
+end

data/lib/term.rb

@@ -0,0 +1,32 @@
+class Term
+  attr_accessor :coefficient, :exponent
+
+  def initialize(exponent = 0, coefficient = 0)
+    @coefficient, @exponent = coefficient, exponent
+  end
+
+  def self.parse(string)
+    term = self.new
+    float = /(\d*(?:\.\d*)?)/
+    integer = /(\d*)/
+    raw_data = string.match(/([-+]?)\s*#{float}\s*(x.*)?\s*\Z/)
+    term.coefficient = (raw_data[1] + raw_data[2]).to_f
+    term.exponent = (raw_data[3] ? (raw_data[3] =~ /x\^#{integer}/ ?  $1.to_i : 1) : 0)
+    term
+  end
+
+  def to_s
+    "#{ (coefficient < 0) ? '-' : '+' } #{coefficient.abs} #{ "x#{"^#{exponent}" unless exponent == 1}" unless exponent.zero?} "
+  end
+
+  def dup
+    duplicate = self.class.new
+    duplicate.coefficient = self.coefficient
+    duplicate.exponent = self.exponent
+    duplicate
+  end
+
+  def ==(other)
+    self.coefficient == other.coefficient && self.exponent == other.exponent
+  end
+end

data/polynomials.gemspec

@@ -0,0 +1,75 @@
+# 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{polynomials}
+  s.version = "0.1.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-12}
+  s.description = %q{
+* Parses polyomials
+* Provides useful methods on top of the Polyonomial class, like:
+ ** Polyonomial#local_extremums
+ ** Polyonomial#nulls
+ ** Polyonomial#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/polynomial.rb",
+    "lib/term.rb",
+    "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
+

data/test/helper.rb

@@ -0,0 +1,18 @@
+require 'rubygems'
+require 'bundler'
+begin
+  Bundler.setup(:default, :development)
+rescue Bundler::BundlerError => e
+  $stderr.puts e.message
+  $stderr.puts "Run `bundle install` to install missing gems"
+  exit e.status_code
+end
+require 'test/unit'
+require 'shoulda'
+
+$LOAD_PATH.unshift(File.join(File.dirname(__FILE__), '..', 'lib'))
+$LOAD_PATH.unshift(File.dirname(__FILE__))
+require 'polynomials'
+
+class Test::Unit::TestCase
+end

data/test/math_test.rb

@@ -0,0 +1,65 @@
+require 'test_helper'
+class TestMath < MiniTest::Unit::TestCase
+  def test_nulls_for_constant_functions
+    polynomial = Polynomial.parse('5')
+    assert_equal Set[],polynomial.nulls
+  end
+
+  def test_nulls_for_linear_functions
+    polynomial = Polynomial.parse('5x + 2')
+    assert_equal Set[-2.0/5.0],polynomial.nulls
+  end
+
+  def test_nulls_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, fraction + root],polynomial.nulls
+
+    polynomial = Polynomial.parse('3x^2 - 40')
+    assert_equal Set[Math.sqrt(40.0/3), -Math.sqrt(40.0/3)], polynomial.nulls
+  end
+
+  def test_nulls_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
+
+    polynomial = Polynomial.parse('2x^3  - 4x^2  - 22x + 24')
+    assert_equal Set[4.0,-3.0,1.0], polynomial.nulls
+  end
+
+  def test_nulls_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
+    polynomial = Polynomial.parse('1x^3   + 6x^2   + 12x + 8')
+    assert_equal(1, polynomial.nulls.size)
+    assert_equal(-2, polynomial.nulls.first)
+  end
+
+  def test_nulls_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
+
+    polynomial = Polynomial.parse('-20x^4   + 5x^3   + 17x^2   - 29x + 87')
+    assert_equal Set[-1.6820039266,1.4875831103], polynomial.nulls
+  end
+
+  def test_nulls_without_term_with_exponent_of_zero
+    polynomial = Polynomial.parse('3x^3 + 3x^2')
+    assert_equal Set[0.0,-1.0], polynomial.nulls
+
+    polynomial = Polynomial.parse('1 x^4')
+    assert_equal Set[0.0], polynomial.nulls
+  end
+
+  def test_nulls_biquadratic_equation
+    polynomial = Polynomial.parse('4x^4 + 2x^2 - 1')
+    assert_equal Set[0.5558929703, -0.5558929703], polynomial.nulls
+  end
+end

data/test/polynomial_test.rb

@@ -0,0 +1,74 @@
+require_relative 'test_helper'
+
+class TestPolynomial < MiniTest::Unit::TestCase
+  def test_to_s
+    polynomial = Polynomial.parse('5x + 2x^2 + 20')
+    assert_equal '+ 2.0 x^2 + 5.0 x + 20.0', polynomial.to_s
+  end
+
+  def test_derivative_of_linear_functions
+    polynomial = Polynomial.parse('5x + 2')
+    assert_equal Polynomial.parse('5') ,polynomial.derivative
+  end
+
+  def test_derivative_functions_with_higher_degree
+    polynomial = Polynomial.parse('5.5x^4 + 3.5x^3 + 2x^2 + 2x + 50')
+    assert_equal Polynomial.parse('22x^3 + 10.5x^2 + 4x + 2'), polynomial.derivative
+  end
+
+  def test_calculation
+    polynomial = Polynomial.parse('2x^4 - 1 x')
+    assert_equal 1245, polynomial.calculate(5)
+  end
+
+  def test_parsing
+    assert_equal 0, Polynomial.parse('2').terms.values.first.exponent
+    assert_equal 2, Polynomial.parse('2').terms.values.first.coefficient
+
+    terms = Polynomial.parse('2x^2 + 5.5x^1 - 20').terms.values.sort_by(&:exponent).reverse
+    assert_equal [2,1,0], terms.map(&:exponent)
+    assert_equal [2,5.5,-20], terms.map(&:coefficient)
+  end
+
+  def test_equality
+    assert_equal Polynomial.parse('3x^1 + 5'), Polynomial.parse('3x + 5 x^0')
+  end
+
+  def test_degree
+    assert_equal 5,Polynomial.parse('3x^5 - 5 x + 3').degree
+  end
+
+  def test_extremums
+    polynomial = Polynomial.parse('3x^2 + 2x + 1')
+    assert_equal({ min: Set[-2.0/6.0] }, polynomial.local_extremums)
+    polynomial = Polynomial.parse('5x^3 - 5x^2 + 2x - 2')
+  end
+
+  def test_extremums_with_slope_of_derivative_equal_to_zero
+    polynomial = Polynomial.parse('1x^4')
+    assert_equal({ min: Set[0.0] }, polynomial.local_extremums)
+    assert_equal({ max: Set[1.0/0, -1.0/0], min: Set[0.0]}, polynomial.extremums)
+  end
+
+  def test_no_inflection_points
+    polynomial = Polynomial.parse('1 x^4')
+    assert_equal({ left: Set[-1.0/0..+1.0/0] }, polynomial.curvature_behaviour)
+
+    polynomial = Polynomial.parse('-1 x^4')
+    assert_equal({ right: Set[-1.0/0..+1.0/0] }, polynomial.curvature_behaviour)
+  end
+
+  def test_no_curve_and_no_inflection_points
+    polynomials = []
+    polynomials << Polynomial.parse('5 x + 4')
+    polynomials << Polynomial.parse('4')
+    polynomials.each do |polynomial|
+      assert_equal({}, polynomial.curvature_behaviour)
+    end
+  end
+
+  def test_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:Set[-1.0/0..-2.5649778198382918, 0.06497781983829176..1.0/0], right: Set[-2.5649778198382918..0.06497781983829176] } , polynomial.curvature_behaviour)
+  end
+end

data/test/term_test.rb

@@ -0,0 +1,12 @@
+require_relative 'test_helper'
+class TestTerm < MiniTest::Unit::TestCase
+  def test_initializer
+    assert_equal 0, Term.new.coefficient
+    assert_equal 0, Term.new.exponent
+  end
+
+  def test_parsing
+    assert_equal 4, Term.parse('4x^2').coefficient
+    assert_equal 2, Term.parse('4x^2').exponent
+  end
+end

data/test/test_helper.rb

@@ -0,0 +1,3 @@
+require 'awesome_print'
+require 'minitest/autorun'
+require_relative '../lib/polynomial.rb'

metadata

@@ -0,0 +1,152 @@
+--- !ruby/object:Gem::Specification 
+name: polynomials
+version: !ruby/object:Gem::Version 
+  prerelease: false
+  segments: 
+  - 0
+  - 1
+  - 0
+  version: 0.1.0
+platform: ruby
+authors: 
+- Manuel Korfmann
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2011-05-12 00:00:00 +02:00
+default_executable: 
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: shoulda
+  requirement: &id001 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        version: "0"
+  type: :development
+  prerelease: false
+  version_requirements: *id001
+- !ruby/object:Gem::Dependency 
+  name: bundler
+  requirement: &id002 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ~>
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 1
+        - 0
+        - 0
+        version: 1.0.0
+  type: :development
+  prerelease: false
+  version_requirements: *id002
+- !ruby/object:Gem::Dependency 
+  name: jeweler
+  requirement: &id003 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ~>
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 1
+        - 6
+        - 0
+        version: 1.6.0
+  type: :development
+  prerelease: false
+  version_requirements: *id003
+- !ruby/object:Gem::Dependency 
+  name: rcov
+  requirement: &id004 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        version: "0"
+  type: :development
+  prerelease: false
+  version_requirements: *id004
+- !ruby/object:Gem::Dependency 
+  name: awesome_print
+  requirement: &id005 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        version: "0"
+  type: :development
+  prerelease: false
+  version_requirements: *id005
+description: "\n\
+  * Parses polyomials\n\
+  * Provides useful methods on top of the Polyonomial class, like:\n ** Polyonomial#local_extremums\n ** Polyonomial#nulls\n ** Polyonomial#curvature_behaviour\n\
+  * Implements root's finding formulas for quadratic, cubic and quartic functions\n  "
+email: manu@korfmann.info
+executables: []
+
+extensions: []
+
+extra_rdoc_files: 
+- LICENSE.txt
+- README.rdoc
+files: 
+- .document
+- Gemfile
+- Gemfile.lock
+- LICENSE.txt
+- README.rdoc
+- Rakefile
+- VERSION
+- lib/core_ext/math.rb
+- lib/polynomial.rb
+- lib/term.rb
+- polynomials.gemspec
+- test/helper.rb
+- test/math_test.rb
+- test/polynomial_test.rb
+- test/term_test.rb
+- test/test_helper.rb
+has_rdoc: true
+homepage: http://github.com/mkorfmann/polynomials
+licenses: 
+- MIT
+post_install_message: 
+rdoc_options: []
+
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: -515319334687155051
+      segments: 
+      - 0
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      segments: 
+      - 0
+      version: "0"
+requirements: []
+
+rubyforge_project: 
+rubygems_version: 1.3.7
+signing_key: 
+specification_version: 3
+summary: Polyomial calculations library
+test_files: []
+