rubylabs 0.9.0 → 0.9.1

data/test/bit_test.rb

@@ -16,25 +16,25 @@ class TestBits < Test::Unit::TestCase
     assert_equal c0.to_s, "1010"
     assert_equal c0.length, 4
     assert_equal c0.value, 10
-    assert_equal c0.base, :binary
+    assert_equal c0.class, Code
     
     c1 = 10.code(6)
     assert_equal c1.to_s, "001010"
     assert_equal c1.length, 6
     assert_equal c1.value, 10
-    assert_equal c1.base, :binary
+    assert_equal c1.class, Code
 
     c2 = 10.code(:hex)
     assert_equal c2.to_s, "A"
     assert_equal c2.length, 4
     assert_equal c2.value, 10
-    assert_equal c2.base, :hex
+    assert_equal c2.class, HexCode
     
     c3 = 10.code(:hex, 2)
     assert_equal c3.to_s, "0A"
     assert_equal c3.length, 8
     assert_equal c3.value, 10
-    assert_equal c3.base, :hex
+    assert_equal c3.class, HexCode
   end
   
   # Parity bit tests

data/test/tsp_test.rb

@@ -137,4 +137,22 @@ class TestTSP < Test::Unit::TestCase
     assert_in_delta (popsize*ngen/2), Tour.count, 100
   end
   
+  # exhaustive search -- a method named xsearch implements the strategy used in 
+  # the test above.
+  
+  def test_13_xsearch
+    assert_equal @@best.cost, xsearch(@@map).cost
+  end
+  
+  # Check the structure and iterators for a random map of 10 cities.
+  
+  def test_14_make_map
+    m = Map.new(10)
+    assert_equal 10, m.size
+    assert_equal Array(0..9), m.labels
+    assert_equal [0,1], m.first
+    m.rest { |i,j| @last_pair = [i,j] }
+    assert_equal [8,9], @last_pair
+  end
+  
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: rubylabs
 version: !ruby/object:Gem::Version 
-  version: 0.9.0
+  version: 0.9.1
 platform: ruby
 authors: 
 - conery
@@ -9,7 +9,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2010-12-19 00:00:00 -08:00
+date: 2011-01-07 00:00:00 -08:00
 default_executable: lab-setup.rb
 dependencies: []