levenshtein-19 0.3.0 → 0.3.1

data/ext/levenshtein/levenshtein_array.c

@@ -26,7 +26,7 @@ VALUE levenshtein_distance_array(VALUE self, VALUE rb_o1, VALUE rb_o2, VALUE rb_
   /* Do the expensive calculation on a subset of the sequences, if possible, by removing the common prefix. */
 
   offset	= 0;
-  while RTEST(rb_funcall(rb_ary_entry(rb_o1, offset), id_eql, 1, rb_ary_entry(rb_o2, offset))) {
+  while (RTEST(rb_funcall(rb_ary_entry(rb_o1, offset), id_eql, 1, rb_ary_entry(rb_o2, offset)))) {
     offset++;
   }
 

data/lib/levenshtein/version.rb

@@ -1,3 +1,3 @@
 module Levenshtein
-  VERSION = "0.3.0"
+  VERSION = "0.3.1"
 end

metadata

@@ -1,8 +1,8 @@
 --- !ruby/object:Gem::Specification
 name: levenshtein-19
 version: !ruby/object:Gem::Version
-  version: 0.3.0
   prerelease: 
+  version: 0.3.1
 platform: ruby
 authors:
 - Erik Veenstra
@@ -10,7 +10,7 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2011-11-21 00:00:00.000000000Z
+date: 2013-02-11 00:00:00.000000000 Z
 dependencies: []
 description: Calculates the Levenshtein distance between two byte strings.
 email:
@@ -43,22 +43,23 @@ 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
+required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ! '>='
     - !ruby/object:Gem::Version
       version: '0'
+  none: false
 requirements: []
 rubyforge_project: levenshtein-19
-rubygems_version: 1.8.11
+rubygems_version: 1.8.25
 signing_key: 
 specification_version: 3
 summary: Calculates the Levenshtein distance between two byte strings.
 test_files:
 - test/test.rb
+has_rdoc: