levenshtein-19 0.3.1 → 0.3.2
Sign up to get free protection for your applications and to get access to all the features.
@@ -28,7 +28,7 @@ VALUE levenshtein_distance_generic(VALUE self, VALUE rb_o1, VALUE rb_o2, VALUE r
|
|
28
28
|
/* Do the expensive calculation on a subset of the sequences, if possible, by removing the common prefix. */
|
29
29
|
|
30
30
|
offset = 0;
|
31
|
-
while RTEST(rb_funcall(rb_funcall(rb_o1, id_get, 1, INT2FIX(offset)), id_equal, 1, rb_funcall(rb_o2, id_get, 1, INT2FIX(offset)))) {
|
31
|
+
while (RTEST(rb_funcall(rb_funcall(rb_o1, id_get, 1, INT2FIX(offset)), id_equal, 1, rb_funcall(rb_o2, id_get, 1, INT2FIX(offset))))) {
|
32
32
|
offset++;
|
33
33
|
}
|
34
34
|
|
data/lib/levenshtein/version.rb
CHANGED
metadata
CHANGED
@@ -2,7 +2,7 @@
|
|
2
2
|
name: levenshtein-19
|
3
3
|
version: !ruby/object:Gem::Version
|
4
4
|
prerelease:
|
5
|
-
version: 0.3.
|
5
|
+
version: 0.3.2
|
6
6
|
platform: ruby
|
7
7
|
authors:
|
8
8
|
- Erik Veenstra
|
@@ -10,7 +10,7 @@ authors:
|
|
10
10
|
autorequire:
|
11
11
|
bindir: bin
|
12
12
|
cert_chain: []
|
13
|
-
date: 2013-02-
|
13
|
+
date: 2013-02-12 00:00:00.000000000 Z
|
14
14
|
dependencies: []
|
15
15
|
description: Calculates the Levenshtein distance between two byte strings.
|
16
16
|
email:
|