levenshtein-ffi 1.0.0

data/.gitignore

@@ -0,0 +1,2 @@
+README.markdown.html
+*.rbc

data/Gemfile

@@ -0,0 +1,8 @@
+source :rubygems
+
+gem 'ffi'
+
+group :test do
+  gem 'rspec', '1.3.1'
+  gem 'jeweler'
+end

data/README.markdown

@@ -0,0 +1,60 @@
+levenshtein-ffi
+===============
+
+Converted to FFI by David Balatero for Ruby portability.
+
+This gem originally based on levenshtein.
+
+Tested on:
+
+* MRI 1.8.6
+* MRI 1.8.7
+* MRI 1.9.1
+* MRI 1.9.2
+* Rubinius 1.1.0
+
+Including in Gemfile
+====================
+
+    gem 'levenshtein-ffi', :require => 'levenshtein'
+
+Original README
+===============
+
+The levenshtein module implements fast Damerau-Levenshtein edit distance
+computation in O(n) memory and O(n^2) time, using a C wrapper. The module has a
+single function:
+
+    require 'levenshtein'
+    Levenshtein.distance("string1", "string2") == 1 # returns true
+
+This function can be used as a drop-in replacement for
+Text::Levenshtein.levenshtein, which is pure Ruby and rather slow. That's it!
+
+The code is made available under the following BSD license:
+
+Copyright (c) 2009, Schuyler Erle.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice,
+      this list of conditions and the following disclaimer.
+
+    * Redistributions in binary form must reproduce the above copyright notice,
+      this list of conditions and the following disclaimer in the documentation
+      and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+- end -

data/Rakefile

@@ -0,0 +1,19 @@
+begin
+  require 'jeweler'
+  Jeweler::Tasks.new do |gemspec|
+    gemspec.name = "levenshtein-ffi"
+    gemspec.summary = "An FFI version of the levenshtein gem."
+    gemspec.description = "Provides a fast, cross-Ruby implementation of the levenshtein distance algorithm."
+    gemspec.email = "dbalatero@gmail.com"
+    gemspec.homepage = "http://github.com/dbalatero/levenshtein-ffi"
+    gemspec.authors = ["David Balatero"]
+    gemspec.add_dependency "ffi"
+    gemspec.add_development_dependency "rspec"
+    gemspec.add_development_dependency "jeweler"
+  end
+
+  Jeweler::GemcutterTasks.new
+rescue LoadError
+  puts "Jeweler not available. Install it with: gem install jeweler"
+end
+

data/VERSION

@@ -0,0 +1 @@
+1.0.0

data/ext/levenshtein/.gitignore

@@ -0,0 +1,3 @@
+*.bundle
+*.o
+Makefile

data/ext/levenshtein/extconf.rb

@@ -0,0 +1,2 @@
+require 'mkmf'
+create_makefile('levenshtein')

data/ext/levenshtein/levenshtein.c

@@ -0,0 +1,68 @@
+# include <string.h>
+# include <stdlib.h>
+
+# ifdef LEV_CASE_INSENSITIVE
+# include <ctype.h>
+# define eq(x, y) (tolower(x) == tolower(y))
+# else
+# define eq(x, y) ((x) == (y))
+# endif
+
+# define min(x, y) ((x) < (y) ? (x) : (y))
+
+unsigned int levenshtein (const char *word1, const char *word2) {
+    size_t len1 = strlen(word1),
+           len2 = strlen(word2);
+    unsigned int *v = calloc(len2 + 1, sizeof(unsigned int));
+    unsigned int i, j, current, next, cost;
+
+    /* strip common prefixes */
+    while (len1 > 0 && len2 > 0 && eq(word1[0], word2[0]))
+        word1++, word2++, len1--, len2--;
+
+    /* handle degenerate cases */
+    if (!len1) return len2;
+    if (!len2) return len1;
+    
+    /* initialize the column vector */
+    for (j = 0; j < len2 + 1; j++)
+        v[j] = j;
+
+    for (i = 0; i < len1; i++) {
+        /* set the value of the first row */
+        current = i + 1;
+        /* for each row in the column, compute the cost */
+        for (j = 0; j < len2; j++) {
+            /*
+             * cost of replacement is 0 if the two chars are the same, or have
+             * been transposed with the chars immediately before. otherwise 1.
+             */
+            cost = !(eq(word1[i], word2[j]) || (i && j &&
+                     eq(word1[i-1], word2[j]) && eq(word1[i],word2[j-1])));
+            /* find the least cost of insertion, deletion, or replacement */
+            next = min(min( v[j+1] + 1,
+                            current + 1 ),
+                            v[j] + cost );
+            /* stash the previous row's cost in the column vector */
+            v[j] = current;
+            /* make the cost of the next transition current */
+            current = next;
+        }
+        /* keep the final cost at the bottom of the column */
+        v[len2] = next;
+    }
+    free(v);
+    return next;
+}
+
+# ifdef TEST
+# include <stdio.h>
+# include "levenshtein.h"
+
+int main (int argc, char **argv) {
+    unsigned int distance;
+    if (argc < 3) return -1;
+    distance = levenshtein(argv[1], argv[2]);
+    printf("%s vs %s: %u\n", argv[1], argv[2],distance);
+}
+# endif

data/ext/levenshtein/levenshtein.h

@@ -0,0 +1 @@
+unsigned levenshtein(const char *, const char *);

data/levenshtein-ffi.gemspec

@@ -0,0 +1,63 @@
+# Generated by jeweler
+# DO NOT EDIT THIS FILE DIRECTLY
+# Instead, edit Jeweler::Tasks in Rakefile, and run the gemspec command
+# -*- encoding: utf-8 -*-
+
+Gem::Specification.new do |s|
+  s.name = %q{levenshtein-ffi}
+  s.version = "1.0.0"
+
+  s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
+  s.authors = ["David Balatero"]
+  s.date = %q{2010-11-03}
+  s.description = %q{Provides a fast, cross-Ruby implementation of the levenshtein distance algorithm.}
+  s.email = %q{dbalatero@gmail.com}
+  s.extensions = ["ext/levenshtein/extconf.rb"]
+  s.extra_rdoc_files = [
+    "README.markdown"
+  ]
+  s.files = [
+    ".gitignore",
+     "Gemfile",
+     "README.markdown",
+     "Rakefile",
+     "VERSION",
+     "ext/levenshtein/.gitignore",
+     "ext/levenshtein/extconf.rb",
+     "ext/levenshtein/levenshtein.c",
+     "ext/levenshtein/levenshtein.h",
+     "levenshtein-ffi.gemspec",
+     "lib/levenshtein.rb",
+     "spec/levenshtein_spec.rb",
+     "spec/spec_helper.rb"
+  ]
+  s.homepage = %q{http://github.com/dbalatero/levenshtein-ffi}
+  s.rdoc_options = ["--charset=UTF-8"]
+  s.require_paths = ["lib"]
+  s.rubygems_version = %q{1.3.7}
+  s.summary = %q{An FFI version of the levenshtein gem.}
+  s.test_files = [
+    "spec/levenshtein_spec.rb",
+     "spec/spec_helper.rb"
+  ]
+
+  if s.respond_to? :specification_version then
+    current_version = Gem::Specification::CURRENT_SPECIFICATION_VERSION
+    s.specification_version = 3
+
+    if Gem::Version.new(Gem::VERSION) >= Gem::Version.new('1.2.0') then
+      s.add_runtime_dependency(%q<ffi>, [">= 0"])
+      s.add_development_dependency(%q<rspec>, [">= 0"])
+      s.add_development_dependency(%q<jeweler>, [">= 0"])
+    else
+      s.add_dependency(%q<ffi>, [">= 0"])
+      s.add_dependency(%q<rspec>, [">= 0"])
+      s.add_dependency(%q<jeweler>, [">= 0"])
+    end
+  else
+    s.add_dependency(%q<ffi>, [">= 0"])
+    s.add_dependency(%q<rspec>, [">= 0"])
+    s.add_dependency(%q<jeweler>, [">= 0"])
+  end
+end
+

data/lib/levenshtein.rb

@@ -0,0 +1,14 @@
+require 'ffi'
+
+module Levenshtein
+  extend FFI::Library
+
+  library = File.dirname(__FILE__) + "/../ext/levenshtein/levenshtein"
+  begin
+    ffi_lib(library)
+  rescue LoadError
+    ffi_lib(library + ".bundle")
+  end
+
+  attach_function :distance, :levenshtein, [:string, :string], :int
+end

data/spec/levenshtein_spec.rb

@@ -0,0 +1,24 @@
+require 'spec_helper'
+
+describe Levenshtein do
+  before(:each) do
+    @fixtures = [
+      ["hello", "hello", 0],
+      ["hello", "helo", 1],
+      ["hello", "jello", 1],
+      ["hello", "helol", 1],
+      ["hello", "hellol", 1],
+      ["hello", "heloll", 2],
+      ["hello", "cheese", 4],
+      ["hello", "saint", 5],
+      ["hello", "", 5],
+    ]
+  end
+
+  it "should calculate correct distances" do
+    @fixtures.each do |w1, w2, d|
+      Levenshtein.distance(w1, w2).should == d
+      Levenshtein.distance(w2, w1).should == d
+    end
+  end
+end

data/spec/spec_helper.rb

@@ -0,0 +1,3 @@
+require 'spec'
+
+require File.dirname(__FILE__) + "/../lib/levenshtein"

metadata

@@ -0,0 +1,121 @@
+--- !ruby/object:Gem::Specification 
+name: levenshtein-ffi
+version: !ruby/object:Gem::Version 
+  hash: 23
+  prerelease: false
+  segments: 
+  - 1
+  - 0
+  - 0
+  version: 1.0.0
+platform: ruby
+authors: 
+- David Balatero
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2010-11-03 00:00:00 -07:00
+default_executable: 
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: ffi
+  prerelease: false
+  requirement: &id001 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        hash: 3
+        segments: 
+        - 0
+        version: "0"
+  type: :runtime
+  version_requirements: *id001
+- !ruby/object:Gem::Dependency 
+  name: rspec
+  prerelease: false
+  requirement: &id002 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        hash: 3
+        segments: 
+        - 0
+        version: "0"
+  type: :development
+  version_requirements: *id002
+- !ruby/object:Gem::Dependency 
+  name: jeweler
+  prerelease: false
+  requirement: &id003 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        hash: 3
+        segments: 
+        - 0
+        version: "0"
+  type: :development
+  version_requirements: *id003
+description: Provides a fast, cross-Ruby implementation of the levenshtein distance algorithm.
+email: dbalatero@gmail.com
+executables: []
+
+extensions: 
+- ext/levenshtein/extconf.rb
+extra_rdoc_files: 
+- README.markdown
+files: 
+- .gitignore
+- Gemfile
+- README.markdown
+- Rakefile
+- VERSION
+- ext/levenshtein/.gitignore
+- ext/levenshtein/extconf.rb
+- ext/levenshtein/levenshtein.c
+- ext/levenshtein/levenshtein.h
+- levenshtein-ffi.gemspec
+- lib/levenshtein.rb
+- spec/levenshtein_spec.rb
+- spec/spec_helper.rb
+has_rdoc: true
+homepage: http://github.com/dbalatero/levenshtein-ffi
+licenses: []
+
+post_install_message: 
+rdoc_options: 
+- --charset=UTF-8
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
+      version: "0"
+requirements: []
+
+rubyforge_project: 
+rubygems_version: 1.3.7
+signing_key: 
+specification_version: 3
+summary: An FFI version of the levenshtein gem.
+test_files: 
+- spec/levenshtein_spec.rb
+- spec/spec_helper.rb