sequitur 0.0.07 → 0.0.08

checksums.yaml

@@ -1,15 +1,15 @@
 ---
 !binary "U0hBMQ==":
   metadata.gz: !binary |-
-    YjliZTY3NWVkYWRmNzI3ZmZmNDI2YWU5ZjY0NzUxZjg1ZWQ3ZTFmMg==
+    ODkxZDczYzdhYTJhMTk5NzU1MGUzNTZjZWEyZjNlODI5YzRhOGY2Yg==
   data.tar.gz: !binary |-
-    Y2ZjNGYxNDk1NGYxMTE5NTBiYzkyOWYyMGRjYmUyNGMzMGE2MTUxZQ==
+    ZTA2NjA5ZGRhZDI4YjA3ZmJhOWQwNmM2ODMwYTFlZmYxOTcxMzYzNg==
 !binary "U0hBNTEy":
   metadata.gz: !binary |-
-    NzBmZDFiMGQyNWFiNjMzMDAwYTM3ODQ0ZDk4YmUzMTNiYmNjNTE3MGU2ZWZl
-    ZjNmNzdkYzgwOTZiZmZjYjM2NzVkNDIxODhlZDMwMjM1YjIxMDA5ZjhkMTU5
-    ZGNkMDQwNDZkNDRmMWI4NWY2ZWIyMWQwYTAwZDZlZjNjOTVjNWQ=
+    MDJmMDQwYjMxYWI4YzhiZmRmM2IzMjM1ZGM0OGFiNzE0YzI0ZDRhNzNmNTM3
+    N2ExNzNhMTI0ODM3NzcwNDQxY2UxYjJhMzk1NmMwYTcyZDAyMzZkYzZkMDFk
+    MjgwYmQ0ZjdhOTJkNzcxMTRhNjJkYTE3ZTQyZDAzMDg5M2M3MzE=
   data.tar.gz: !binary |-
-    ZDEzY2IyZDk5ZGMxMWY0ZDJiZGMxZDA2ZDM2MzcwNTRhNTRhYWEyODUxNDBl
-    ZTE2OTUxOGM4ZDk4MTdlYmU0ZWI1NGM0ZTNlMWI5MTgzMzg3Y2FmMzhhNTU3
-    ZmYxMTg3NGNkMDljZGQ3MzhmMmQyMWNkZWQ2NjFiYzhlZTlmNTY=
+    ODUwZjc1NDhlNWI1YmQyNjY0ODRlNmZhMTdmMTEzMGEyYzEyYjVmNjk2MWQy
+    MjlmMjQ2NjQ0NmJmZTcyNzM4OTUzMTgxZTE2YzkwOTY4ZGYwZTNmZjNiMmRm
+    MTk3NzRiNDA1NzJjOTAzNDFiOTI1NmZhZmJmZDRkODA2NThjOGY=

data/CHANGELOG.md

@@ -1,3 +1,6 @@
+### 0.0.08 / 2014-08-24
+* [CHANGE] `production_spec.rb`: Improved tests in order to reach 100% code coverage for the Production class.
+
 ### 0.0.07 / 2014-08-24
 * [CHANGE] `digram.rb`: Updated Digram class documentation.
 

data/lib/sequitur/constants.rb

@@ -3,7 +3,7 @@
 
 module Sequitur # Module used as a namespace
   # The version number of the gem.
-  Version = '0.0.07'
+  Version = '0.0.08'
 
   # Brief description of the gem.
   Description = 'Ruby implementation of the Sequitur algorithm'

data/lib/sequitur/digram.rb

@@ -2,7 +2,7 @@
 
 module Sequitur # Module for classes implementing the Sequitur algorithm
 
-# In linguitics, a digram is a sequence of two letters.
+# In linguistics, a digram is a sequence of two letters.
 # In Sequitur a digram is a sequence of two consecutive symbols that
 # appear in a grammar (production) rule. Each symbol in a digram 
 # can be a terminal or not.

data/lib/sequitur/production.rb

@@ -35,7 +35,7 @@ class Production
   end
 
 
-  # Return the set of productions appearing in the rhs
+  # Return the set of productions appearing in the rhs.
   def references()
     return rhs.select { |symb| symb.kind_of?(Production) }
   end
@@ -80,6 +80,8 @@ class Production
   end
 
   # Add a back reference to the given production.
+  # @param aProduction [Production] Assume that production P appears in the 
+  #   RHS of production Q, then a reference count of P is incremented in Q.
   def add_backref(aProduction)
     prod_id = aProduction.object_id
 
@@ -113,7 +115,7 @@ class Production
       case elem
         when String then "'#{elem}'"
         when Production then "#{elem.object_id}"
-      else "#{elem}"
+      else elem.to_s
       end
     end
 

data/spec/sequitur/production_spec.rb

@@ -125,9 +125,10 @@ describe Production do
     end
 
     it 'should emit its text representation' do
-      symbols = [:a, :b, 'c', :d, :e, :f]
+      instance = Production.new
+      symbols = [:a, :b, 'c', :d, :e, 1000, instance]
       symbols.each { |symb| subject.append_symbol(symb) }
-      expectation = "#{subject.object_id} : a b 'c' d e f."
+      expectation = "#{subject.object_id} : a b 'c' d e 1000 #{instance.object_id}."
       expect(subject.to_string).to eq(expectation)
     end
 

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: sequitur
 version: !ruby/object:Gem::Version
-  version: 0.0.07
+  version: 0.0.08
 platform: ruby
 authors:
 - Dimitri Geshef