abst 0.2.0

data/test/test_prime_mpqs.rb

@@ -0,0 +1,24 @@
+require 'minitest/unit'
+require 'minitest/autorun'
+require 'abst'
+
+class TC_PrimeMPQS < MiniTest::Unit::TestCase
+	def test_primes_list
+		test = lambda do |n|
+			factor = Abst.mpqs(n)
+			assert(1 < factor && factor < n)
+			assert_equal(0, n % factor)
+		end
+
+		test.call(23916353875143281737)
+		test.call(56428599095241190007)
+		test.call(24559500716705748943)
+		test.call(43381522922949440477)
+		test.call(19238749214625480671)
+		test.call(25498058878476331907)
+		test.call(9530738504299322287)
+		test.call(18193861945465859131)
+		test.call(79670656009259581439)
+		test.call(19256936255213267029)
+	end
+end

data/test/test_rational.rb

@@ -0,0 +1,33 @@
+require 'minitest/unit'
+require 'minitest/autorun'
+require 'abst'
+
+class TC_Rational < MiniTest::Unit::TestCase
+	def test_to_rds
+		assert_equal("0.5", Rational(1, 2).to_rds)
+		assert_equal("0.(3)", Rational(1, 3).to_rds)
+		assert_equal("0.25", Rational(1, 4).to_rds)
+		assert_equal("0.2", Rational(1, 5).to_rds)
+		assert_equal("0.1(6)", Rational(1, 6).to_rds)
+		assert_equal("0.(142857)", Rational(1, 7).to_rds)
+		assert_equal("0.125", Rational(1, 8).to_rds)
+		assert_equal("0.(1)", Rational(1, 9).to_rds)
+		assert_equal("0.1", Rational(1, 10).to_rds)
+		assert_equal("0.1005e3", Rational(201, 2).to_rds(10))
+		assert_equal("0.(10)", Rational(2, 3).to_rds(2))
+	end
+
+	def test_to_ds
+		assert_equal("0.5", Rational(1, 2).to_ds)
+		assert_equal("0." + "3" * 15, Rational(1, 3).to_ds(15))
+		assert_equal("0.25", Rational(1, 4).to_ds)
+		assert_equal("0.2", Rational(1, 5).to_ds)
+		assert_equal("0.1" + "6" * 31, Rational(1, 6).to_ds(32))
+		assert_equal("0." + "142857" * 10, Rational(1, 7).to_ds(60, 10))
+		assert_equal("0.125", Rational(1, 8).to_ds)
+		assert_equal("0.11111", Rational(1, 9).to_ds(5))
+		assert_equal("0.1", Rational(1, 10).to_ds)
+		assert_equal("0.1005e3", Rational(201, 2).to_ds(10))
+		assert_equal("0." + "10" * 15, Rational(2, 3).to_ds(30, 2))
+	end
+end

data/test/test_sequence.rb

@@ -0,0 +1,55 @@
+require 'minitest/unit'
+require 'minitest/autorun'
+require 'abst'
+
+class TC_Fundamental < MiniTest::Unit::TestCase
+	def test_fibonacci
+		assert_equal(1, Abst.fibonacci(1))
+		assert_equal(1, Abst.fibonacci(2))
+		assert_equal(2, Abst.fibonacci(3))
+		assert_equal(3, Abst.fibonacci(4))
+		assert_equal(5, Abst.fibonacci(5))
+		assert_equal(12586269025, Abst.fibonacci(50))
+		assert_equal(354224848179261915075, Abst.fibonacci(100))
+	end
+
+	def test_triangle
+		assert_equal(1, Abst.triangle(1))
+		assert_equal(3, Abst.triangle(2))
+		assert_equal(6, Abst.triangle(3))
+		assert_equal(10, Abst.triangle(4))
+		assert_equal(15, Abst.triangle(5))
+	end
+
+	def test_pentagonal
+		assert_equal(1, Abst.pentagonal(1))
+		assert_equal(5, Abst.pentagonal(2))
+		assert_equal(12, Abst.pentagonal(3))
+		assert_equal(22, Abst.pentagonal(4))
+		assert_equal(35, Abst.pentagonal(5))
+	end
+
+	def test_hexagonal
+		assert_equal(1, Abst.hexagonal(1))
+		assert_equal(6, Abst.hexagonal(2))
+		assert_equal(15, Abst.hexagonal(3))
+		assert_equal(28, Abst.hexagonal(4))
+		assert_equal(45, Abst.hexagonal(5))
+	end
+
+	def test_heptagonal
+		assert_equal(1, Abst.heptagonal(1))
+		assert_equal(7, Abst.heptagonal(2))
+		assert_equal(18, Abst.heptagonal(3))
+		assert_equal(34, Abst.heptagonal(4))
+		assert_equal(55, Abst.heptagonal(5))
+	end
+
+	def test_octagonal
+		assert_equal(1, Abst.octagonal(1))
+		assert_equal(8, Abst.octagonal(2))
+		assert_equal(21, Abst.octagonal(3))
+		assert_equal(40, Abst.octagonal(4))
+		assert_equal(65, Abst.octagonal(5))
+	end
+end

data/test/test_set.rb

@@ -0,0 +1,36 @@
+require 'minitest/unit'
+require 'minitest/autorun'
+require 'abst'
+
+class TC_Set < MiniTest::Unit::TestCase
+	def test_add
+		assert_equal(Set.new([1, 2, 3]), Set.new([1, 3]).add(2))
+		assert_equal(Set.new([2, 1, 2, 3]), Set.new([1, 2, 3]).add(2))
+		assert_equal(Set.new([3, 1, 2, 3, 5]), Set.new([5, 2, 3, 1]).add(2))
+	end
+
+	def test_dup
+		s1 = Set.new([1, 2, 3])
+		s2 = s1.dup
+		s2.add(4)
+
+		assert_equal(Set.new([1, 2, 3]), s1)
+	end
+end
+
+class TC_SortableSet < MiniTest::Unit::TestCase
+	def test_add
+		assert_equal(SortableSet.new([1, 2, 3]), SortableSet.new([1, 3]).add(2))
+		assert_equal(SortableSet.new([2, 1, 2, 3]), SortableSet.new([1, 2, 3]).add(2))
+		assert_equal(SortableSet.new([3, 1, 2, 3, 5]), SortableSet.new([5, 2, 3, 1]).add(2))
+	end
+
+	def test_dup
+		s1 = SortableSet.new([1, 2, 3]){|a, b| b <=> a}
+		s2 = s1.dup
+		assert_equal(s1.to_a, s2.to_a)
+
+		s2.add(4)
+		assert_equal(Set.new([1, 2, 3]), s1)
+	end
+end

data/test/test_vector.rb

@@ -0,0 +1,37 @@
+require 'minitest/unit'
+require 'minitest/autorun'
+require 'abst'
+
+class TC_Vector < MiniTest::Unit::TestCase
+	def test_Vector
+		vector = Abst::Vector(Rational, 3)
+		assert_equal("Rational", vector.coef_class.name)
+		assert_equal(3, vector.size)
+
+		v = Abst::Vector(Rational, [2, 3, 4])
+		assert_equal([2, 3, 4], v.to_a)
+	end
+
+	def test_add
+		vector = Abst::Vector(Integer, 4)
+		v1 = vector.new([3, 4, 5, 6])
+		v2 = vector.new([1, 1, 1, 3])
+
+		assert_equal([4, 5, 6, 9], (v1 + v2).to_a)
+	end
+
+	def test_sub
+		vector = Abst::Vector(Integer, 4)
+		v1 = vector.new([3, 4, 5, 6])
+		v2 = vector.new([1, 1, 1, 3])
+
+		assert_equal([2, 3, 4, 3], (v1 - v2).to_a)
+	end
+
+	def test_squared_length
+		vector = Abst::Vector(Integer, 4)
+		v = vector.new([3, 4, 5, 6])
+
+		assert_equal(9 + 16 + 25 + 36, v.squared_length)
+	end
+end

metadata

@@ -0,0 +1,98 @@
+--- !ruby/object:Gem::Specification
+name: abst
+version: !ruby/object:Gem::Version
+  version: 0.2.0
+  prerelease: 
+platform: ruby
+authors:
+- Yasunori Miyamoto
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2012-03-13 00:00:00.000000000 Z
+dependencies: []
+description: prime,matrix, polynomial,etc
+email: 
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/abst.rb
+- lib/config.rb
+- lib/include/array.rb
+- lib/include/bisect.rb
+- lib/include/cache.rb
+- lib/include/compatibility.rb
+- lib/include/complex.rb
+- lib/include/float.rb
+- lib/include/fundamental.rb
+- lib/include/graph.rb
+- lib/include/group.rb
+- lib/include/integer.rb
+- lib/include/matrix.rb
+- lib/include/polynomial.rb
+- lib/include/prime.rb
+- lib/include/prime_mpqs.rb
+- lib/include/rational.rb
+- lib/include/residue.rb
+- lib/include/ring.rb
+- lib/include/sequence.rb
+- lib/include/set.rb
+- lib/include/vector.rb
+- test/test_all.rb
+- test/test_array.rb
+- test/test_bisect.rb
+- test/test_combination.rb
+- test/test_float.rb
+- test/test_fundamental.rb
+- test/test_group.rb
+- test/test_integer.rb
+- test/test_matrix.rb
+- test/test_polynomial.rb
+- test/test_prime.rb
+- test/test_prime_mpqs.rb
+- test/test_rational.rb
+- test/test_sequence.rb
+- test/test_set.rb
+- test/test_vector.rb
+homepage: 
+licenses: []
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.11
+signing_key: 
+specification_version: 3
+summary: Ruby based algebraic number theory system
+test_files:
+- test/test_all.rb
+- test/test_array.rb
+- test/test_bisect.rb
+- test/test_combination.rb
+- test/test_float.rb
+- test/test_fundamental.rb
+- test/test_group.rb
+- test/test_integer.rb
+- test/test_matrix.rb
+- test/test_polynomial.rb
+- test/test_prime.rb
+- test/test_prime_mpqs.rb
+- test/test_rational.rb
+- test/test_sequence.rb
+- test/test_set.rb
+- test/test_vector.rb