polynomials 0.1.6 → 0.1.7

data/Gemfile

@@ -6,7 +6,6 @@ source "http://rubygems.org"
 # 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"

data/Gemfile.lock

@@ -9,7 +9,6 @@ GEM
       rake
     rake (0.8.7)
     rcov (0.9.9)
-    shoulda (2.11.3)
 
 PLATFORMS
   ruby
@@ -19,4 +18,3 @@ DEPENDENCIES
   bundler (~> 1.0.0)
   jeweler (~> 1.6.0)
   rcov
-  shoulda

data/VERSION

@@ -1 +1 @@
-0.1.6
+0.1.7

data/lib/polynomials.rb

@@ -38,7 +38,7 @@ class Polynomial
   end
 
   def roots
-    if terms.keys.none?(&:zero?)
+    if !terms.empty? and terms.keys.none?(&:zero?)
       self.alter { |nf, term| nf.terms[term.exponent-1].coefficient = term.coefficient }.roots << 0.0
     else
       case self.degree
@@ -61,7 +61,6 @@ class Polynomial
     max_min_extremum =  Hash.new { |hash,key| hash[key] = Set.new }
     possible_extrema = derivative.roots.sort
     unless 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
@@ -77,20 +76,17 @@ class Polynomial
   end
 
   def curvature_behaviour
-    if degree < 2
-      return {}
-    else
-      extrema = self.derivative.extrema
-      curvature_behaviour = Hash.new {|h,k|h[k]=Set.new}
-      extrema.values.inject(&:|).sort.each_cons(2) do |start_point,end_point|
-        curvature_behaviour[AfterextremaCurvatureMapping[extrema.find { |k,v| v.include?(start_point) }.first]] << Range.new(start_point,end_point)
-      end
+    hash = Hash.new {|h,k|h[k]=Set.new}
+    extrema = self.derivative.extrema
+    extrema.values.inject(Set[],&:|).sort.each_cons(2).inject(hash) do |curvature_behaviour,(start_point,end_point)|
+      kind_of_curvature = AfterextremaCurvatureMapping[extrema.find { |k,v| v.include?(start_point) }.first]
+      curvature_behaviour[kind_of_curvature] << Range.new(start_point,end_point)
+      curvature_behaviour
     end
-    return curvature_behaviour
   end
 
   def degree
-    self.terms.keys.max
+    self.terms.keys.max || 0
   end
 
   def to_s
@@ -107,9 +103,11 @@ class Polynomial
   def extrema
     extrema = local_extrema
     a = self.terms[self.degree].coefficient
-    max_or_min = (self.degree.even? ? [1,1] : [-1,1]).map { |n| (n * a)/a.abs  }
-    extrema[MinMaxMapping[max_or_min.first]] << -1.0/0
-    extrema[MinMaxMapping[max_or_min.last]] << 1.0/0
+    unless self.degree == 0
+      max_or_min = (self.degree.even? ? [1,1] : [-1,1]).map { |n| (n * a)/a.abs  }
+      extrema[MinMaxMapping[max_or_min.first]] << -1.0/0
+      extrema[MinMaxMapping[max_or_min.last]] << 1.0/0
+    end
     return extrema
   end
 

data/polynomials.gemspec

@@ -5,7 +5,7 @@
 
 Gem::Specification.new do |s|
   s.name = %q{polynomials}
-  s.version = "0.1.6"
+  s.version = "0.1.7"
 
   s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
   s.authors = ["Manuel Korfmann"]
@@ -31,6 +31,7 @@ It can solve polynomial equations with a degree up to 4 by implementing formulas
     "lib/polynomials.rb",
     "lib/term.rb",
     "polynomials.gemspec",
+    "tags",
     "test/helper.rb",
     "test/math_test.rb",
     "test/polynomial_test.rb",
@@ -48,20 +49,17 @@ It can solve polynomial equations with a degree up to 4 by implementing formulas
     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"])

data/tags

@@ -0,0 +1,91 @@
+!_TAG_FILE_FORMAT	2	/extended format; --format=1 will not append ;" to lines/
+!_TAG_FILE_SORTED	1	/0=unsorted, 1=sorted, 2=foldcase/
+!_TAG_PROGRAM_AUTHOR	Darren Hiebert	/dhiebert@users.sourceforge.net/
+!_TAG_PROGRAM_NAME	Exuberant Ctags	//
+!_TAG_PROGRAM_URL	http://ctags.sourceforge.net	/official site/
+!_TAG_PROGRAM_VERSION	5.8	//
+==	lib/polynomials.rb	/^  def ==(other)$/;"	f	class:Polynomial
+==	lib/term.rb	/^  def ==(other)$/;"	f	class:Term
+AfterExtremumsCurvatureMapping	rdoc/Polynomial.html	/^				<dt><a name="AfterExtremumsCurvatureMapping">AfterExtremumsCurvatureMapping<\/a><\/dt>$/;"	a
+Math	lib/core_ext/math.rb	/^module Math$/;"	m
+MinMaxMapping	rdoc/Polynomial.html	/^				<dt><a name="MinMaxMapping">MinMaxMapping<\/a><\/dt>$/;"	a
+NegPosMinMaxExtremumMapping	rdoc/Polynomial.html	/^				<dt><a name="NegPosMinMaxExtremumMapping">NegPosMinMaxExtremumMapping<\/a><\/dt>$/;"	a
+Polynomial	lib/polynomials.rb	/^class Polynomial$/;"	c
+Term	lib/term.rb	/^class Term$/;"	c
+Test	test/helper.rb	/^class Test::Unit::TestCase$/;"	c
+TestMath	test/math_test.rb	/^class TestMath < MiniTest::Unit::TestCase$/;"	c
+TestPolynomial	test/polynomial_test.rb	/^class TestPolynomial < MiniTest::Unit::TestCase$/;"	c
+TestTerm	test/term_test.rb	/^class TestTerm < MiniTest::Unit::TestCase$/;"	c
+alter	lib/polynomials.rb	/^  def alter$/;"	f	class:Polynomial
+calculate	lib/polynomials.rb	/^  def calculate(x)$/;"	f	class:Polynomial
+coefficient	rdoc/Term.html	/^				<a name="coefficient"><\/a>$/;"	a
+coefficient=	rdoc/Term.html	/^				<a name="coefficient="><\/a>$/;"	a
+coefficients_till	lib/polynomials.rb	/^  def coefficients_till(n)$/;"	f	class:Polynomial
+curvature_behaviour	lib/polynomials.rb	/^  def curvature_behaviour$/;"	f	class:Polynomial
+degree	lib/polynomials.rb	/^  def degree$/;"	f	class:Polynomial
+derivative	lib/polynomials.rb	/^  def derivative$/;"	f	class:Polynomial
+dup	lib/term.rb	/^  def dup$/;"	f	class:Term
+exponent	rdoc/Term.html	/^				<a name="exponent"><\/a>$/;"	a
+exponent=	rdoc/Term.html	/^				<a name="exponent="><\/a>$/;"	a
+extrema	lib/polynomials.rb	/^  def extrema$/;"	f	class:Polynomial
+initialize	lib/polynomials.rb	/^  def initialize$/;"	f	class:Polynomial
+initialize	lib/term.rb	/^  def initialize(exponent = 0, coefficient = 0)$/;"	f	class:Term
+local_extrema	lib/polynomials.rb	/^  def local_extrema$/;"	f	class:Polynomial
+method-c-new	rdoc/Polynomial.html	/^				<a name="method-c-new"><\/a>$/;"	a
+method-c-new	rdoc/Term.html	/^				<a name="method-c-new"><\/a>$/;"	a
+method-c-parse	rdoc/Polynomial.html	/^				<a name="method-c-parse"><\/a>$/;"	a
+method-c-parse	rdoc/Term.html	/^				<a name="method-c-parse"><\/a>$/;"	a
+method-c-roots_of_cubic_function	rdoc/Math.html	/^				<a name="method-c-roots_of_cubic_function"><\/a>$/;"	a
+method-c-roots_of_quadratic_function	rdoc/Math.html	/^				<a name="method-c-roots_of_quadratic_function"><\/a>$/;"	a
+method-c-roots_of_quartic_function	rdoc/Math.html	/^				<a name="method-c-roots_of_quartic_function"><\/a>$/;"	a
+method-i-%3D%3D	rdoc/Polynomial.html	/^				<a name="method-i-%3D%3D"><\/a>$/;"	a
+method-i-%3D%3D	rdoc/Term.html	/^				<a name="method-i-%3D%3D"><\/a>$/;"	a
+method-i-alter	rdoc/Polynomial.html	/^				<a name="method-i-alter"><\/a>$/;"	a
+method-i-calculate	rdoc/Polynomial.html	/^				<a name="method-i-calculate"><\/a>$/;"	a
+method-i-coefficients_till	rdoc/Polynomial.html	/^				<a name="method-i-coefficients_till"><\/a>$/;"	a
+method-i-curvature_behaviour	rdoc/Polynomial.html	/^				<a name="method-i-curvature_behaviour"><\/a>$/;"	a
+method-i-degree	rdoc/Polynomial.html	/^				<a name="method-i-degree"><\/a>$/;"	a
+method-i-derivative	rdoc/Polynomial.html	/^				<a name="method-i-derivative"><\/a>$/;"	a
+method-i-dup	rdoc/Term.html	/^				<a name="method-i-dup"><\/a>$/;"	a
+method-i-extremums	rdoc/Polynomial.html	/^				<a name="method-i-extremums"><\/a>$/;"	a
+method-i-local_extremums	rdoc/Polynomial.html	/^				<a name="method-i-local_extremums"><\/a>$/;"	a
+method-i-nulls	rdoc/Polynomial.html	/^				<a name="method-i-nulls"><\/a>$/;"	a
+method-i-to_s	rdoc/Polynomial.html	/^				<a name="method-i-to_s"><\/a>$/;"	a
+method-i-to_s	rdoc/Term.html	/^				<a name="method-i-to_s"><\/a>$/;"	a
+parse	lib/polynomials.rb	/^  def self.parse(string)$/;"	F	class:Polynomial
+parse	lib/term.rb	/^  def self.parse(string)$/;"	F	class:Term
+roots	lib/polynomials.rb	/^  def roots$/;"	f	class:Polynomial
+roots_of_cubic_function	lib/core_ext/math.rb	/^  def self.roots_of_cubic_function(a,b,c,d,with_complex = false)$/;"	F	class:Math
+roots_of_quadratic_function	lib/core_ext/math.rb	/^  def self.roots_of_quadratic_function(a,b,c)$/;"	F	class:Math.roots_of_cubic_function
+roots_of_quartic_function	lib/core_ext/math.rb	/^  def self.roots_of_quartic_function(*args)$/;"	F	class:Math.roots_of_cubic_function
+terms	rdoc/Polynomial.html	/^				<a name="terms"><\/a>$/;"	a
+terms=	rdoc/Polynomial.html	/^				<a name="terms="><\/a>$/;"	a
+test_calculation	test/polynomial_test.rb	/^  def test_calculation$/;"	f	class:TestPolynomial
+test_degree	test/polynomial_test.rb	/^  def test_degree$/;"	f	class:TestPolynomial
+test_derivative_functions_with_higher_degree	test/polynomial_test.rb	/^  def test_derivative_functions_with_higher_degree$/;"	f	class:TestPolynomial
+test_derivative_of_linear_functions	test/polynomial_test.rb	/^  def test_derivative_of_linear_functions$/;"	f	class:TestPolynomial
+test_equality	test/polynomial_test.rb	/^  def test_equality$/;"	f	class:TestPolynomial
+test_extrema	test/polynomial_test.rb	/^  def test_extrema$/;"	f	class:TestPolynomial
+test_extrema_with_slope_of_derivative_equal_to_zero	test/polynomial_test.rb	/^  def test_extrema_with_slope_of_derivative_equal_to_zero$/;"	f	class:TestPolynomial
+test_initializer	test/term_test.rb	/^  def test_initializer$/;"	f	class:TestTerm
+test_no_curve_and_no_inflection_points	test/polynomial_test.rb	/^  def test_no_curve_and_no_inflection_points$/;"	f	class:TestPolynomial
+test_no_inflection_points	test/polynomial_test.rb	/^  def test_no_inflection_points$/;"	f	class:TestPolynomial
+test_no_local_extrema	test/polynomial_test.rb	/^  def test_no_local_extrema$/;"	f	class:TestPolynomial
+test_parsing	test/polynomial_test.rb	/^  def test_parsing$/;"	f	class:TestPolynomial
+test_parsing_variable_omitted	test/term_test.rb	/^  def  test_parsing_variable_omitted$/;"	f	class:TestTerm
+test_parsing_with_default_coefficient_equal_to_one	test/term_test.rb	/^  def test_parsing_with_default_coefficient_equal_to_one$/;"	f	class:TestTerm
+test_parsing_with_default_exponent_equal_to_one	test/term_test.rb	/^  def test_parsing_with_default_exponent_equal_to_one$/;"	f	class:TestTerm
+test_parsing_with_standard_format	test/term_test.rb	/^  def test_parsing_with_standard_format$/;"	f	class:TestTerm
+test_roots_biquadratic_equation	test/math_test.rb	/^  def test_roots_biquadratic_equation$/;"	f	class:TestMath
+test_roots_for_constant_functions	test/math_test.rb	/^  def test_roots_for_constant_functions$/;"	f	class:TestMath
+test_roots_for_cubic_functions	test/math_test.rb	/^  def test_roots_for_cubic_functions$/;"	f	class:TestMath
+test_roots_for_cubic_functions_one_real_all_equal	test/math_test.rb	/^  def test_roots_for_cubic_functions_one_real_all_equal$/;"	f	class:TestMath
+test_roots_for_cubic_functions_with_complex	test/math_test.rb	/^  def test_roots_for_cubic_functions_with_complex$/;"	f	class:TestMath
+test_roots_for_linear_functions	test/math_test.rb	/^  def test_roots_for_linear_functions$/;"	f	class:TestMath
+test_roots_for_quartic_functions	test/math_test.rb	/^  def test_roots_for_quartic_functions$/;"	f	class:TestMath
+test_roots_quadratic_functions	test/math_test.rb	/^  def test_roots_quadratic_functions$/;"	f	class:TestMath
+test_roots_without_term_with_exponent_of_zero	test/math_test.rb	/^  def test_roots_without_term_with_exponent_of_zero$/;"	f	class:TestMath
+test_to_s	test/polynomial_test.rb	/^  def test_to_s$/;"	f	class:TestPolynomial
+test_two_inflection_points	test/polynomial_test.rb	/^  def test_two_inflection_points$/;"	f	class:TestPolynomial
+to_s	lib/polynomials.rb	/^  def to_s$/;"	f	class:Polynomial
+to_s	lib/term.rb	/^  def to_s$/;"	f	class:Term

data/test/polynomial_test.rb

@@ -67,6 +67,11 @@ class TestPolynomial < MiniTest::Unit::TestCase
     assert_equal({ left: Set[-1.0/0..+1.0/0] }, polynomial.curvature_behaviour)
   end
 
+  def test_no_extremums
+    polynomial = Polynomial.parse('5')
+    assert_equal({}, polynomial.extrema)
+  end
+
   def test_no_curve_and_no_inflection_points
     polynomials = []
     polynomials << Polynomial.parse('5 x + 4')

metadata

@@ -5,8 +5,8 @@ version: !ruby/object:Gem::Version
   segments: 
   - 0
   - 1
-  - 6
-  version: 0.1.6
+  - 7
+  version: 0.1.7
 platform: ruby
 authors: 
 - Manuel Korfmann
@@ -17,22 +17,9 @@ cert_chain: []
 date: 2011-05-13 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 
+  requirement: &id001 !ruby/object:Gem::Requirement 
     none: false
     requirements: 
     - - ~>
@@ -44,10 +31,10 @@ dependencies:
         version: 1.0.0
   type: :development
   prerelease: false
-  version_requirements: *id002
+  version_requirements: *id001
 - !ruby/object:Gem::Dependency 
   name: jeweler
-  requirement: &id003 !ruby/object:Gem::Requirement 
+  requirement: &id002 !ruby/object:Gem::Requirement 
     none: false
     requirements: 
     - - ~>
@@ -59,10 +46,10 @@ dependencies:
         version: 1.6.0
   type: :development
   prerelease: false
-  version_requirements: *id003
+  version_requirements: *id002
 - !ruby/object:Gem::Dependency 
   name: rcov
-  requirement: &id004 !ruby/object:Gem::Requirement 
+  requirement: &id003 !ruby/object:Gem::Requirement 
     none: false
     requirements: 
     - - ">="
@@ -72,10 +59,10 @@ dependencies:
         version: "0"
   type: :development
   prerelease: false
-  version_requirements: *id004
+  version_requirements: *id003
 - !ruby/object:Gem::Dependency 
   name: awesome_print
-  requirement: &id005 !ruby/object:Gem::Requirement 
+  requirement: &id004 !ruby/object:Gem::Requirement 
     none: false
     requirements: 
     - - ">="
@@ -85,7 +72,7 @@ dependencies:
         version: "0"
   type: :development
   prerelease: false
-  version_requirements: *id005
+  version_requirements: *id004
 description: "\n\
   This is a gem dedicated to parsing, manipulating and finding roots,extrema and inflection points of polynomials.\n\
   It can solve polynomial equations with a degree up to 4 by implementing formulas for solving quadratic, cubic and quartic functions.\n  "
@@ -109,6 +96,7 @@ files:
 - lib/polynomials.rb
 - lib/term.rb
 - polynomials.gemspec
+- tags
 - test/helper.rb
 - test/math_test.rb
 - test/polynomial_test.rb
@@ -128,7 +116,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
-      hash: 1846189921572599385
+      hash: -2463697157255217048
       segments: 
       - 0
       version: "0"