ruby-poker 0.1.1 → 0.1.2

data/CHANGELOG

@@ -1,5 +1,10 @@
 2008-01-10 (0.1.0)
     * Initial version
-2008-01-11 (0.1.1)
+2008-01-12 (0.1.1)
     * Ranks are now a class.
-    * Added gem packaging
+    * Extracted card, rank, and arrays methods to individual files
+    * Added gem packaging
+2008-01-12 (0.1.2)
+    * Fixed critical bug that was stopping the whole program to not work
+    * Added some test cases as a result
+    * More test cases coming soon

data/examples/quick_example.rb

@@ -0,0 +1,10 @@
+require 'rubygems'
+require 'ruby-poker'
+
+hand1 = PokerHand.new("8H 9C TC JD QH")
+hand2 = PokerHand.new(["3D", "3C", "3S", "13D", "14H"])
+puts hand1
+puts hand1.rank
+puts hand2
+puts hand2.rank
+puts hand1 > hand2

data/lib/poker_hand.rb

@@ -1,12 +1,10 @@
-# poker_hand.rb
-
-require 'array_helper.rb'
+require 'poker_helper.rb'
 require 'rank.rb'
 require 'card.rb'
 
 class PokerHand
     
-  include ArrayHelper
+  include PokerHelper
   include Comparable
   attr_reader :cards, :values_hash
   
@@ -104,17 +102,17 @@ class PokerHand
         hand1_pair = @values_hash.index(2)  # get key(card value) of the duplicate pair
         hand2_pair = hand2.values_hash.index(2)
         if hand1_pair == hand2_pair
-          return self.values.singles.reverse <=> hand2.values.singles.reverse
+          return singles(self.values).reverse <=> singles(hand2.values).reverse
         else
           return hand1_pair <=> hand2_pair
         end
       when 2  # two people with two pairs
         # check who has the higher pair, if the pairs are the same
         # then remove the pairs and check for highest card
-        hand1_pairs = self.values.duplicates.reverse
-        hand2_pairs = hand2.values.duplicates.reverse
+        hand1_pairs = duplicates(self.values).reverse
+        hand2_pairs = duplicates(hand2.values).reverse
         if hand1_pairs == hand2_pairs
-          return self.values.singles <=> hand2.values.singles   # there will be only one card remaining
+          return singles(self.values) <=> singles(hand2.values)   # there will be only one card remaining
         else
           return hand1_pairs <=> hand2_pairs
         end

data/lib/poker_helper.rb

@@ -0,0 +1,23 @@
+module PokerHelper
+  # Returns array of elements that only occur once
+  # [1, 1, 2, 3] => [2, 3]
+  def singles array1
+    counts = Hash.new(0)
+    array1.each do |value|
+      counts[value] += 1
+    end
+
+    return counts.collect {|key,value| value == 1 ? key : nil }.compact.sort
+  end
+  
+  # Returns an array containing values that we duplicated in the original array
+  # [1, 2, 3, 1] => [1]
+  def duplicates array1
+    counts = Hash.new(0)
+    array1.each do |value|
+      counts[value] += 1
+    end
+
+    return counts.collect {|key,value| value > 1 ? key : nil }.compact.sort
+  end
+end # module ArrayHelper

data/test/tc_poker_hand.rb

@@ -0,0 +1,15 @@
+#!/usr/bin/env ruby
+require 'test/unit'
+require 'rubygems'
+require 'ruby-poker'
+
+class TestPokerHand < Test::Unit::TestCase
+  def setup
+    @hand1 = PokerHand.new("6D 7C 5D 5H 3S")
+    @hand2 = PokerHand.new(["5C", "JC", "2H", "5S", "3D"])
+  end
+  
+  def test_comparable
+    assert_equal(-1, @hand1 <=> @hand2)
+  end
+end

metadata

@@ -1,11 +1,11 @@
 --- !ruby/object:Gem::Specification 
 name: ruby-poker
 version: !ruby/object:Gem::Version 
-  version: 0.1.1
+  version: 0.1.2
 platform: ruby
 authors: 
 - Robert Olson
-autorequire: ruby-poker
+autorequire: 
 bindir: bin
 cert_chain: []
 
@@ -24,11 +24,13 @@ extra_rdoc_files:
 - CHANGELOG
 - LICENSE
 files: 
-- lib/array_helper.rb
+- examples/quick_example.rb
 - lib/card.rb
 - lib/poker_hand.rb
+- lib/poker_helper.rb
 - lib/rank.rb
 - lib/ruby-poker.rb
+- test/tc_poker_hand.rb
 - README
 - CHANGELOG
 - LICENSE
@@ -58,5 +60,5 @@ rubygems_version: 1.0.1
 signing_key: 
 specification_version: 2
 summary: Ruby library for determining the winner in a game of poker.
-test_files: []
-
+test_files: 
+- test/tc_poker_hand.rb

data/lib/array_helper.rb

@@ -1,25 +0,0 @@
-module ArrayHelper
-  class Array < ::Array
-    # Returns array of elements that only occur once
-    # [1, 1, 2, 3] => [2, 3]
-    def singles
-      counts = Hash.new(0)
-      self.each do |value|
-        counts[value] += 1
-      end
-
-      return counts.collect {|key,value| value == 1 ? key : nil }.compact.sort
-    end
-  
-    # Returns an array containing values that we duplicated in the original array
-    # [1, 2, 3, 1] => [1]
-    def duplicates
-      counts = Hash.new(0)
-      self.each do |value|
-        counts[value] += 1
-      end
-
-      return counts.collect {|key,value| value > 1 ? key : nil }.compact.sort
-    end
-  end # class Array
-end # module ArrayHelper