damerau-levenshtein 1.0.3 → 1.1.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: fb23a6624730fe07063d38530a313e4c9f0e4c72
-  data.tar.gz: f0b3c81c670e9e226a521a0f88dedd45ab3b2da5
+  metadata.gz: 069786523f2031b397b0c45af0841793ba696751
+  data.tar.gz: fae6b9bf74312f37b2bed2b032a46b7ae483da33
 SHA512:
-  metadata.gz: 3438f70897a34ca4522ce2bc6938dd1de4a1d82da6e22904bc049db0bfabf8b4dda6c1e3ad37eae832d87ac645ecba4d527ee2605a1dc69a3dccb77c07a22bce
-  data.tar.gz: e4f6a8098db32de5dcb2a5ec4732676d3e3d468fccb7e45a76f9a57d0fb9404599dceaaffa6d98ea322977d21659f8c39c91bdf7249a36c7b19430921b9cf4e0
+  metadata.gz: 13fb0c92038b6a3d21cf4ab4988996d841f3819d445129309a6db5a53a409151af45c2c2fed042c5f38a0a3921f9ae3346d7a32a5a038d22f5d58ceb0259b78c
+  data.tar.gz: fe8cbd5abd96ee8b2980d8b754cd4817e9529586d612f9816dcc1cafeaa7d3d67dd131b4e6569040081986e16230cb7d445d9732591ed3ad02897872c4b8eb8c

data/.gitignore

@@ -1,3 +1,4 @@
+Gemfile.lock
 *.sw?
 .DS_Store
 tmp

data/.rspec

@@ -1 +1,3 @@
+--format documentation
 --color
+--require spec_helper

data/.rubocop.yml

@@ -0,0 +1,15 @@
+AllCops:
+  Exclude:
+    - features/**/*
+    - db/**/*
+    - bundle_bin/**/*
+  Include:
+    - damerau-levenshtein.gemspec
+Metrics/ModuleLength:
+  Max: 1000
+Style/StringLiterals:
+  EnforcedStyle: double_quotes
+Style/DotPosition:
+  EnforcedStyle: trailing
+Style/FileName:
+  Enabled: false

data/.ruby-version

@@ -1 +1 @@
-2.0.0-p247
+2.1.6

data/.travis.yml

@@ -1,7 +1,8 @@
 rvm:
   - 1.9.3
-  - 2.0.0
-bundler_args: --without development
+  - 2.0
+  - 2.1
+  - 2.2
 script:
   - 'bundle exec rake'
   - 'bundle exec rake features'

data/{CHANGELOG → CHANGELOG.md}

@@ -1,7 +1,12 @@
+damerau-levenshtein CHANGELOG
+=============================
+
+1.1.0 -- relax and update gem dependencies, update specs
+
 1.0.3 -- gems update
 
 1.0.2 -- includes refactoring by https://github.com/luislavena to remove
-dependency on jeweler
+         dependency on jeweler
 
 1.0.1 -- fixed gem dependencies
 

data/Gemfile

@@ -1,19 +1,3 @@
 source 'https://rubygems.org'
 
-gem 'bundler',       '~> 1.3'
-gem 'rake',          '~> 10.0'
-gem 'rake-compiler', '~> 0.8'
-gem 'json',          '~> 1.7.7'
-
-group :development do
-  gem 'debugger',  '~> 1.6'
-end
-
-group :test do
-  gem 'rspec',     '~> 2.13'
-  gem 'cucumber',  '~> 1.3'
-  gem 'ruby-prof', '~> 0.13'
-  gem 'shoulda',   '~> 3.5'
-  gem 'coveralls', require: false
-end
-
+gemspec

data/LICENSE.txt

@@ -1,6 +1,6 @@
 The MIT License (MIT)
 
-Copyright (c) 2011-2013 Marine Biological Laboratory
+Copyright (c) 2011-2015 Marine Biological Laboratory
 
 Permission is hereby granted, free of charge, to any person obtaining
 a copy of this software and associated documentation files (the

data/README.md

@@ -1,64 +1,78 @@
 damerau-levenshtein
 ===================
 
-[![Gem Version][1]][2]
-[![Continuous Integration Status][3]][4]
-[![Dependency Status][5]][6]
-[![Coverage Status][7]][8]
-
-The damerau-levenshtein gem allows to find edit distance between two UTF-8 
-or ASCII encoded strings with O(N*M) efficiency.
-
-This gem implements pure Levenshtein algorithm, Damerau modification of it 
-(where 2 character transposition counts as 1 edit distance). It also includes 
-Boehmer & Rees 2008 modification of Damerau algorithm, where transposition 
-of bigger than 1 character blocks is taken in account as well 
+[![Gem Version][gem_svg]][gem]
+[![Continuous Integration Status][ci_svg]][ci]
+[![Dependency Status][dep_svg]][dep]
+[![Coverage Status][cov_svg]][cov]
+
+The damerau-levenshtein gem allows to find edit distance between two UTF-8
+or ASCII encoded strings with O(N\*M) efficiency.
+
+This gem implements pure Levenshtein algorithm, Damerau modification of it
+(where 2 character transposition counts as 1 edit distance). It also includes
+Boehmer & Rees 2008 modification of Damerau algorithm, where transposition
+of bigger than 1 character blocks is taken in account as well
 (Boehmer & Rees 2008).
-    
-    require 'damerau-levenshtein'
-    DamerauLevenshtein.distance('Something', 'Smoething') #returns 1
 
-Gem damerau-levenshtein is compatible with ruby versions 1.8.7 
+```ruby
+require 'damerau-levenshtein'
+DamerauLevenshtein.distance('Something', 'Smoething') #returns 1
+```
+
+Gem damerau-levenshtein is compatible with ruby versions 1.8.7
 and 1.9.2 and higher, as well as 2.0.0 and higher
 
 Installation
 ------------
 
-    gem install damerau-levenshtein
+    $ gem install damerau-levenshtein
 
 Examples
 --------
-    
-    require 'rubygems' #not needed for ruby >= 1.9.0
-    require 'damerau-levenshtein'
-    dl = DamerauLevenshtein
+
+```ruby
+require 'rubygems' #not needed for ruby >= 1.9.0
+require 'damerau-levenshtein'
+dl = DamerauLevenshtein
+```
 
 * compare using Damerau Levenshtein algorithm
 
-    `dl.distance("Something", "Smoething") #returns 1`
+```ruby
+dl.distance("Something", "Smoething") #returns 1
+```
 
 * compare using Levensthein algorithm
-  
-    `dl.distance("Something", "Smoething", 0) #returns 2`
+
+```ruby
+dl.distance("Something", "Smoething", 0) #returns 2
+```
 
 * compare using Boehmer & Rees modification
 
-    `dl.distance("Something", "meSothing", 2) #returns 2 instead of 4`
+```ruby
+dl.distance("Something", "meSothing", 2) #returns 2 instead of 4
+```
 
 * comparison of words with utf-8 characters should work fine:
 
-    `dl.distance("Sjöstedt", "Sjostedt") #returns 1`
+```ruby
+dl.distance("Sjöstedt", "Sjostedt") #returns 1
+```
 
 API Description
 -----------
 
 Gem defines two methods
 
-    DamerauLevenshtein.version 
-    #returns version number of the gem
-    
-    DamerauLevenshtein.distance(string1, string2, block_size, max_distance)
-    #returns [edit distance][9] between 2 strings
+```ruby
+DamerauLevenshtein.version
+#returns version number of the gem
+
+DamerauLevenshtein.distance(string1, string2, block_size, max_distance)
+#returns [edit distance][ed] between 2 strings
+```
 
 
 
@@ -71,79 +85,80 @@ DamerauLevenshtein.distance takes 4 arguments:
 
 `block_size` determines maximum number of characters in a transposition block:
 
-    block_size = 0 
+    block_size = 0
     (transposition does not count -- it is a pure Levenshtein algorithm)
-    
-    block_size = 1 
-    (transposition between 2 adjustent characters -- 
+
+    block_size = 1
+    (transposition between 2 adjustent characters --
     it is pure Damerau-Levenshtein algorithm)
-    
-    block_size = 2 
-    (transposition between blocks as big as 2 characters -- so abcd and cdab 
+
+    block_size = 2
+    (transposition between blocks as big as 2 characters -- so abcd and cdab
     counts as edit distance 2, not 4)
-    
-    block_size = 3 
-    (transposition between blocks as big as 3 characters -- 
+
+    block_size = 3
+    (transposition between blocks as big as 3 characters --
     so abcdef and defabc counts as edit distance 3, not 6)
-    
+
     etc.
 
-`max_distance` -- is a threshold after which algorithm gives up and 
+`max_distance` -- is a threshold after which algorithm gives up and
 returns max_distance instead of real edit distance.
 
-Levenshtein algorithm is expensive, so it makes sense to give up when edit 
+Levenshtein algorithm is expensive, so it makes sense to give up when edit
 distance is becoming too big. The argument max_distance does just that.
 
-    DamerauLevenshtein.distance('abcdefg', '1234567', 0, 3) 
-    # output: 4 -- it gave up when edit distance exceeded 3
-
+```ruby
+DamerauLevenshtein.distance('abcdefg', '1234567', 0, 3)
+# output: 4 -- it gave up when edit distance exceeded 3
+```
 
 Contributing to damerau-levenshtein
 -----------------------------------
- 
-* Check out the latest master to make sure the feature hasn't been 
+
+* Check out the latest master to make sure the feature hasn't been
 implemented or the bug hasn't been fixed yet
-* Check out the issue tracker to make sure someone already hasn't requested 
+* Check out the issue tracker to make sure someone already hasn't requested
 it and/or contributed it
 * Fork the project
 * Start a feature/bugfix branch
 * Commit and push until you are happy with your contribution
-* Make sure to add tests for it. This is important so I don't break it 
+* Make sure to add tests for it. This is important so I don't break it
 in a future version unintentionally.
-* Please try not to mess with the Rakefile, version, or history. If you want 
-to have your own version, or is otherwise necessary, that is fine, but please 
+* Please try not to mess with the Rakefile, version, or history. If you want
+to have your own version, or is otherwise necessary, that is fine, but please
 isolate to its own commit so I can cherry-pick around it.
 
 Versioning
 ----------
 
-This gem is following practices of [Semantic Versioning][10]
+This gem is following practices of [Semantic Versioning][semver]
 
 Authors
 -------
 
-[Dmitry Mozzherin][11]
+[Dmitry Mozzherin][dimus]
 
 Contributors
 ------------
 
-[lazylester][12]
+[lazylester][lazylester]
 
 Copyright
 ---------
 
-Copyright (c) 2011-2013 Marine Biological Laboratory. See LICENSE.txt for
+Copyright (c) 2011-2015 Marine Biological Laboratory. See LICENSE.txt for
 further details.
 
-[1]: https://badge.fury.io/rb/damerau-levenshtein.png
-[2]: http://badge.fury.io/rb/damerau-levenshtein
-[3]: https://secure.travis-ci.org/GlobalNamesArchitecture/damerau-levenshtein.png
-[4]: http://travis-ci.org/GlobalNamesArchitecture/damerau-levenshtein
-[5]: https://gemnasium.com/GlobalNamesArchitecture/damerau-levenshtein.png
-[6]: https://gemnasium.com/GlobalNamesArchitecture/damerau-levenshtein
-[7]: https://coveralls.io/repos/GlobalNamesArchitecture/damerau-levenshtein/badge.png?branch=master
-[8]: https://coveralls.io/r/GlobalNamesArchitecture/damerau-levenshtein?branch=master
-[9]: http://en.wikipedia.org/wiki/Edit_distance
-[10]: http://semver.org/
-[11]: https://github.com/dimus
-[12]: https://github.com/lazylester
+[gem_svg]: https://badge.fury.io/rb/damerau-levenshtein.svg
+[gem]: http://badge.fury.io/rb/damerau-levenshtein
+[ci_svg]: https://secure.travis-ci.org/GlobalNamesArchitecture/damerau-levenshtein.svg
+[ci]: http://travis-ci.org/GlobalNamesArchitecture/damerau-levenshtein
+[dep_svg]: https://gemnasium.com/GlobalNamesArchitecture/damerau-levenshtein.svg
+[dep]: https://gemnasium.com/GlobalNamesArchitecture/damerau-levenshtein
+[cov_svg]: https://coveralls.io/repos/GlobalNamesArchitecture/damerau-levenshtein/badge.svg?branch=master
+[cov]: https://coveralls.io/r/GlobalNamesArchitecture/damerau-levenshtein?branch=master
+[ed]: http://en.wikipedia.org/wiki/Edit_distance
+[semver]: http://semver.org/
+[dimus]: https://github.com/dimus
+[lazylester]: https://github.com/lazylester

data/Rakefile

@@ -1,29 +1,16 @@
-# encoding: utf-8
-
-require 'rubygems'
-require 'bundler'
-
-Bundler::GemHelper.install_tasks
-
-begin
-  Bundler.setup(:default, :development)
-rescue Bundler::BundlerError => e
-  $stderr.puts e.message
-  $stderr.puts 'Run `bundle install` to install missing gems'
-  exit e.status_code
-end
-
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+require 'cucumber/rake/task'
+require "rubocop/rake_task"
 require 'rake/dsl_definition'
 require 'rake'
 require 'rake/extensiontask'
 require 'rspec'
-require 'rspec/core/rake_task'
 
-RSpec::Core::RakeTask.new(:spec) do |spec|
-  spec.pattern = FileList['spec/**/*_spec.rb']
+RSpec::Core::RakeTask.new(:spec) do |rspec|
+  rspec.pattern = FileList['spec/**/*_spec.rb']
 end
 
-require 'cucumber/rake/task'
 Cucumber::Rake::Task.new(:features)
 
 Rake::ExtensionTask.new('damerau_levenshtein') do |extension|
@@ -33,4 +20,6 @@ end
 
 Rake::Task[:spec].prerequisites << :compile
 Rake::Task[:features].prerequisites << :compile
-task :default => :spec
+
+RuboCop::RakeTask.new
+task :default => [:rubocop, :spec]

data/damerau-levenshtein.gemspec

@@ -1,23 +1,37 @@
-$:.push File.expand_path('../lib', __FILE__)
+$LOAD_PATH.push File.expand_path("../lib", __FILE__)
 
-require 'damerau-levenshtein/version'
+require "damerau-levenshtein/version"
 
-# Describe your gem and declare its dependencies:
 Gem::Specification.new do |s|
-  s.name = 'damerau-levenshtein'
+  s.name = "damerau-levenshtein"
   s.version = DamerauLevenshtein::VERSION
-  s.homepage = 'https://github.com/GlobalNamesArchitecture/damerau-levenshtein'
-  s.license = 'MIT'
-  s.summary = %Q{Calculation of editing distance for 2 strings \
-    using Levenshtein or Damerau-Levenshtein algorithms}
-  s.description = %Q{This gem implements pure Levenshtein algorithm, \
-    Damerau modification of it (where 2 character transposition counts \
-    as 1 edit distance). It also includes Boehmer & Rees 2008 modification \
-    of Damerau algorithm, where transposition of bigger than 1 character \
-    blocks is taken in account as well (Boehmer & Rees 2008).}
-  s.authors = ['Dmitry Mozzherin']
-  s.email = 'dmozzherin@gmail.com'
-  s.files = `git ls-files`.split("\n")
-  s.extensions = ['ext/damerau_levenshtein/extconf.rb']
-  s.require_paths = ['lib', 'lib/damerau-levenshtein']
+  s.homepage = "https://github.com/GlobalNamesArchitecture/damerau-levenshtein"
+  s.authors = ["Dmitry Mozzherin"]
+  s.email = "dmozzherin@gmail.com"
+  s.license = "MIT"
+  s.summary = "Calculation of editing distance for 2 strings " \
+              "using Levenshtein or Damerau-Levenshtein algorithms"
+  s.description = "This gem implements pure Levenshtein algorithm, " \
+                  "Damerau modification of it (where 2 character " \
+                  "transposition counts as 1 edit distance). It also " \
+                  "includes Boehmer & Rees 2008 modification " \
+                  "of Damerau algorithm, where transposition of bigger than " \
+                  "1 character blocks is taken in account as well " \
+                  "(Boehmer & Rees 2008)."
+  s.files = `git ls-files -z`.split("\x0").
+    reject { |f| f.match(%r{^(test|spec|features)/}) }
+  s.extensions = ["ext/damerau_levenshtein/extconf.rb"]
+  s.require_paths = ["lib", "lib/damerau-levenshtein"]
+
+  s.add_dependency "bundler", "~> 1.7"
+  s.add_dependency "rake", "~> 10.4"
+  s.add_dependency "rake-compiler", "~> 0.9"
+  s.add_dependency "json", "~> 1.8"
+
+  s.add_development_dependency "rspec", "~> 3.2"
+  s.add_development_dependency "cucumber", "~> 2.0"
+  s.add_development_dependency "ruby-prof", "~> 0.15"
+  s.add_development_dependency "shoulda", "~> 3.5"
+  s.add_development_dependency "rubocop", "~> 0.30"
+  s.add_development_dependency "coveralls", "~> 0.8"
 end

data/ext/damerau_levenshtein/extconf.rb

@@ -1,8 +1,8 @@
 # Loads mkmf which is used to make makefiles for Ruby extensions
-require 'mkmf'
+require "mkmf"
 
 # The destination
-dir_config('damerau-levenshtein/damerau_levenshtein')
+dir_config("damerau-levenshtein/damerau_levenshtein")
 
 # Do the work
-create_makefile('damerau-levenshtein/damerau_levenshtein')
+create_makefile("damerau-levenshtein/damerau_levenshtein")

data/lib/damerau-levenshtein.rb

@@ -1,8 +1,9 @@
 # encoding: UTF-8
 
-require 'damerau-levenshtein/version'
-require 'damerau-levenshtein/damerau_levenshtein'
+require "damerau-levenshtein/version"
+require "damerau-levenshtein/damerau_levenshtein"
 
+# Damerau-Levenshtein algorithm
 module DamerauLevenshtein
   extend DamerauLevenshteinBinding
 
@@ -11,6 +12,6 @@ module DamerauLevenshtein
   end
 
   def self.distance(str1, str2, block_size = 1, max_distance = 10)
-    distance_utf(str1.unpack('U*'), str2.unpack('U*'), block_size, max_distance)
+    distance_utf(str1.unpack("U*"), str2.unpack("U*"), block_size, max_distance)
   end
 end

data/lib/damerau-levenshtein/version.rb

@@ -1,3 +1,4 @@
+# Damerau Levenshtein algorithm
 module DamerauLevenshtein
-  VERSION = '1.0.3'
+  VERSION = "1.1.0"
 end

metadata

@@ -1,47 +1,182 @@
 --- !ruby/object:Gem::Specification
 name: damerau-levenshtein
 version: !ruby/object:Gem::Version
-  version: 1.0.3
+  version: 1.1.0
 platform: ruby
 authors:
 - Dmitry Mozzherin
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-09-03 00:00:00.000000000 Z
-dependencies: []
-description: This gem implements pure Levenshtein algorithm,     Damerau modification
-  of it (where 2 character transposition counts     as 1 edit distance). It also includes
-  Boehmer & Rees 2008 modification     of Damerau algorithm, where transposition of
-  bigger than 1 character     blocks is taken in account as well (Boehmer & Rees 2008).
+date: 2015-05-20 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.7'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.7'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.4'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.4'
+- !ruby/object:Gem::Dependency
+  name: rake-compiler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.9'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.9'
+- !ruby/object:Gem::Dependency
+  name: json
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.8'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.8'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.2'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.2'
+- !ruby/object:Gem::Dependency
+  name: cucumber
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.0'
+- !ruby/object:Gem::Dependency
+  name: ruby-prof
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.15'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.15'
+- !ruby/object:Gem::Dependency
+  name: shoulda
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.5'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.5'
+- !ruby/object:Gem::Dependency
+  name: rubocop
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.30'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.30'
+- !ruby/object:Gem::Dependency
+  name: coveralls
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.8'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.8'
+description: This gem implements pure Levenshtein algorithm, Damerau modification
+  of it (where 2 character transposition counts as 1 edit distance). It also includes
+  Boehmer & Rees 2008 modification of Damerau algorithm, where transposition of bigger
+  than 1 character blocks is taken in account as well (Boehmer & Rees 2008).
 email: dmozzherin@gmail.com
 executables: []
 extensions:
 - ext/damerau_levenshtein/extconf.rb
 extra_rdoc_files: []
 files:
-- .document
-- .gitignore
-- .rspec
-- .ruby-version
-- .travis.yml
-- CHANGELOG
+- ".document"
+- ".gitignore"
+- ".rspec"
+- ".rubocop.yml"
+- ".ruby-version"
+- ".travis.yml"
+- CHANGELOG.md
 - Gemfile
-- Gemfile.lock
 - LICENSE.txt
 - README.md
 - Rakefile
 - damerau-levenshtein.gemspec
 - ext/damerau_levenshtein/damerau_levenshtein.c
 - ext/damerau_levenshtein/extconf.rb
-- features/damerau-levenshtein.feature
-- features/step_definitions/damerau-levenshtein_steps.rb
-- features/support/env.rb
 - lib/damerau-levenshtein.rb
+- lib/damerau-levenshtein/damerau_levenshtein.so
 - lib/damerau-levenshtein/version.rb
-- spec/damerau-levenshtein_spec.rb
-- spec/damerau_levenshtein_test.txt
-- spec/spec_helper.rb
 homepage: https://github.com/GlobalNamesArchitecture/damerau-levenshtein
 licenses:
 - MIT
@@ -53,19 +188,19 @@ require_paths:
 - lib/damerau-levenshtein
 required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
-  - - '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
-  - - '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.0.3
+rubygems_version: 2.2.3
 signing_key: 
 specification_version: 4
-summary: Calculation of editing distance for 2 strings     using Levenshtein or Damerau-Levenshtein
+summary: Calculation of editing distance for 2 strings using Levenshtein or Damerau-Levenshtein
   algorithms
 test_files: []

data/Gemfile.lock

@@ -1,83 +0,0 @@
-GEM
-  remote: https://rubygems.org/
-  specs:
-    activesupport (4.0.0)
-      i18n (~> 0.6, >= 0.6.4)
-      minitest (~> 4.2)
-      multi_json (~> 1.3)
-      thread_safe (~> 0.1)
-      tzinfo (~> 0.3.37)
-    atomic (1.1.13)
-    builder (3.2.2)
-    colorize (0.5.8)
-    columnize (0.3.6)
-    coveralls (0.6.7)
-      colorize
-      multi_json (~> 1.3)
-      rest-client
-      simplecov (>= 0.7)
-      thor
-    cucumber (1.3.6)
-      builder (>= 2.1.2)
-      diff-lcs (>= 1.1.3)
-      gherkin (~> 2.12.0)
-      multi_json (~> 1.7.5)
-      multi_test (>= 0.0.2)
-    debugger (1.6.1)
-      columnize (>= 0.3.1)
-      debugger-linecache (~> 1.2.0)
-      debugger-ruby_core_source (~> 1.2.3)
-    debugger-linecache (1.2.0)
-    debugger-ruby_core_source (1.2.3)
-    diff-lcs (1.2.4)
-    gherkin (2.12.1)
-      multi_json (~> 1.3)
-    i18n (0.6.5)
-    json (1.7.7)
-    mime-types (1.25)
-    minitest (4.7.5)
-    multi_json (1.7.9)
-    multi_test (0.0.2)
-    rake (10.1.0)
-    rake-compiler (0.9.1)
-      rake
-    rest-client (1.6.7)
-      mime-types (>= 1.16)
-    rspec (2.14.1)
-      rspec-core (~> 2.14.0)
-      rspec-expectations (~> 2.14.0)
-      rspec-mocks (~> 2.14.0)
-    rspec-core (2.14.5)
-    rspec-expectations (2.14.2)
-      diff-lcs (>= 1.1.3, < 2.0)
-    rspec-mocks (2.14.3)
-    ruby-prof (0.13.0)
-    shoulda (3.5.0)
-      shoulda-context (~> 1.0, >= 1.0.1)
-      shoulda-matchers (>= 1.4.1, < 3.0)
-    shoulda-context (1.1.5)
-    shoulda-matchers (2.3.0)
-      activesupport (>= 3.0.0)
-    simplecov (0.7.1)
-      multi_json (~> 1.0)
-      simplecov-html (~> 0.7.1)
-    simplecov-html (0.7.1)
-    thor (0.18.1)
-    thread_safe (0.1.2)
-      atomic
-    tzinfo (0.3.37)
-
-PLATFORMS
-  ruby
-
-DEPENDENCIES
-  bundler (~> 1.3)
-  coveralls
-  cucumber (~> 1.3)
-  debugger (~> 1.6)
-  json (~> 1.7.7)
-  rake (~> 10.0)
-  rake-compiler (~> 0.8)
-  rspec (~> 2.13)
-  ruby-prof (~> 0.13)
-  shoulda (~> 3.5)

data/features/damerau-levenshtein.feature

@@ -1,39 +0,0 @@
-Feature: something something
-  In order to something something
-  A user something something
-  something something something
-
-  Scenario: find edit distance between two unicode (utf8) strings
-    Given strings "Sjostedt" and "Sojstedt", block size "0", and a maximum allowed distance "4"
-    When I run "DamerauLevenshtein" method "distance"
-    Then I should receive edit distance "2"
-
-  Scenario: find edit distance between two unicode (utf8) strings
-    Given strings "Sjostedt" and "Sojstedt", block size "1", and a maximum allowed distance "4"
-    When I run "DamerauLevenshtein" method "distance"
-    Then I should receive edit distance "1"
-  
-  Scenario: find edit distance between two unicode (utf8) strings
-    Given strings "Choriozopella trägårdhi" and "Choriozopella tragardhi", block size "1", and a maximum allowed distance "4"
-    When I run "DamerauLevenshtein" method "distance"
-    Then I should receive edit distance "2"
-  
-  Scenario: find edit distance between two strings with non-alphanumeric characters
-    Given strings "abcd" and "ab-cd", block size "1", and a maximum allowed distance "4"
-    When I run "DamerauLevenshtein" method "distance"
-    Then I should receive edit distance "1"
-  
-  Scenario: find edit distance between one-character and multicharacter strings
-    Given strings "a" and "ab", block size "0", and a maximum allowed distance "4"
-    When I run "DamerauLevenshtein" method "distance"
-    Then I should receive edit distance "1"
-  
-  Scenario: find edit distance between one-character and multicharacter strings
-    Given strings "a" and "ab", block size "1", and a maximum allowed distance "4"
-    When I run "DamerauLevenshtein" method "distance"
-    Then I should receive edit distance "1"
-  
-  Scenario: limit distance to maximum distance + 1
-    Given strings "abcdefg#$%123" and "higklmnop(*&ç123", block size "0", and a maximum allowed distance "4"
-    When I run "DamerauLevenshtein" method "distance"
-    Then I should receive edit distance "5"

data/features/step_definitions/damerau-levenshtein_steps.rb

@@ -1,15 +0,0 @@
-Given /^strings "([^\"]*)" and "([^\"]*)", block size "([^\"]*)", and a maximum allowed distance "([^\"]*)"$/ do |str1, str2, block_size, max_distance|
-  @str1 = str1
-  @str2 = str2
-  @block_size = block_size.to_i
-  @max_distance = max_distance.to_i
-end
-
-When /^I run "([^\"]*)" method "([^\"]*)"$/ do |klass, meth|
-  dl = eval(klass)
-  @distance = dl.distance(@str1, @str2, @block_size, @max_distance)
-end
-
-Then /^I should receive edit distance "([^\"]*)"$/ do |edit_distance|
-  @distance.should == edit_distance.to_i
-end

data/features/support/env.rb

@@ -1,13 +0,0 @@
-require 'bundler'
-begin
-  Bundler.setup(:default, :development)
-rescue Bundler::BundlerError => e
-  $stderr.puts e.message
-  $stderr.puts "Run `bundle install` to install missing gems"
-  exit e.status_code
-end
-
-$LOAD_PATH.unshift(File.dirname(__FILE__) + '/../../lib')
-require 'damerau-levenshtein'
-
-require 'rspec/expectations'

data/spec/damerau-levenshtein_spec.rb

@@ -1,24 +0,0 @@
-require File.expand_path(File.dirname(__FILE__) + '/spec_helper')
-
-describe DamerauLevenshtein do
-
-  it 'should return version' do
-    ver = DamerauLevenshtein::VERSION
-    ver.should =~ /^\d+\.\d+\.\d+$/
-    DamerauLevenshtein::version.should == ver
-  end
-
-  it 'should get tests' do
-    tests = File.expand_path(File.dirname(__FILE__)) + 
-              '/damerau_levenshtein_test.txt'
-
-    read_test_file(tests, 5) do |y|
-      dl = DamerauLevenshtein
-      if y
-        res = dl.distance(y[0], y[1], y[3].to_i, y[2].to_i)
-        puts y if res != y[4].to_i
-        res.should == y[4].to_i
-      end
-    end
-  end
-end

data/spec/damerau_levenshtein_test.txt

@@ -1,89 +0,0 @@
-######################
-# Tests for modified Damerau Levenshtein Distance algorithm (UTF-8 compatible)
-#
-# * B. Boehmer, T. Rees, Modified Damerau-Levenshtein Distance, Boehmer & Rees 2008
-# * F.J. Damerau. A technique for computer detection and correction of spelling errors, Communications of the ACM, 1964
-#
-# Fields:
-# String1|String2|maximum distance|transposition block size|expected distance
-#  - String1, String2
-#     compared strings
-#  - maximum distance
-#     stops execution of the algorithm when calculated distance exceeds the maximum distance number
-#  - transosition block size
-#     determines how many characters can be transposed. Block size 1 returns score according to Damerau-Levenshtein algorithm
-#  - expected distance
-#     resulting distance that has to be achieved by the algorithm
-#  Note: algorithm does not try to normalize or interpret strings in any way.
-######################
-
-#it whould recognize the exact match
-Pomatomus|Pomatomus|10|1|0
-
-#it should not try to normalize incoming strings
- Pomatomus|Pomatomus|10|1|1
-Pomatomus|pomatomus|10|1|1
-
-#it should calculate special cases
-Pomatomus||10|1|9
-|Pomatomus|10|1|9
-P|p|10|1|1
-ab|a|10|0|1
-a|ab|10|0|1
-ab|a|10|1|1
--b|-|10|0|1
--b|-|10|1|1
-ab|-|10|0|2
-a|ab|10|1|1
-L|Linneaus|10|1|7
-
-
-#it should calculate Damerau Levenshtein distance with 1 character transpositions, insertions, deletions, substitutions (block size 1)
-# 1 substitution
-Pomatomus|Pomatomux|10|1|1
-# 1 deletion
-Pmatomus|Pomatomus|10|1|1
-# 1 deletion 
-Pomatomus|Pmatomus|10|1|1
-# 1 substitution 
-Rpmatomus|Pomatomus|10|1|2
-# 1 substitution
-Pommtomus|Pomatomus|10|1|1
-# 2 substitutions
-Potamomus|Pomatomus|10|1|2
-# 1 utf-8 substitution
-Cedarinia scabra Sjöstedt 1921|Cedarinia scabra Sjostedt 1921|10|1|1
-# transposition (Levenshtein takes it as 2 substitutions)
-Pomatomus|oPmatomus|10|0|2
-Pomatomus|oPmatomus|10|1|1
-# transposition (Levenshtein takes it as 2 substitutions)
-Pomatomus|Pomatomsu|10|0|2
-Pomatomus|Pomatomsu|10|1|1
-# transposition
-Pomtaomus|Pomatomus|10|0|2
-Pomtaomus|Pomatomus|10|1|1
-# transposition
-Pomatoums|Pomatomus|10|0|2
-Pomatoums|Pomatomus|10|1|1
-# transposition + substitution
-PoamtosusPomatomus|10|0|3
-PoamtosusPomatomus|10|1|2
-
-# transposition with utf-8 char
-Cedarinia scabra Sjöstedt 1921|Cedarinia scabra Söjstedt 1921|10|0|2
-Cedarinia scabra Sjöstedt 1921|Cedarinia scabra Söjstedt 1921|10|1|1
-
-#it should calculate Modified Damerau Levenshtein distance with 2 or more characters transposition (block size > 2)
-serrulatus|serratulus|10|2|2
-Pomatomus|Poomumats|10|3|3
-vesiculosus|vecusilosus|10|1|4
-vesiculosus|vecusilosus|10|2|2
-trimerophyton|mertriophyton|10|1|6
-trimerophyton|mertriophyton|10|3|3
-
-#it should stop trying if distance exceeds maximum allowed distance
-Pxxxxomus|Pomatomus|10|1|4
-Pxxxxomus|Pomatomus|2|1|3
-
-#
-PUNCTATA|PUNCTATA|10|1|0

data/spec/spec_helper.rb

@@ -1,27 +0,0 @@
-require 'coveralls'
-Coveralls.wear!
-$LOAD_PATH.unshift(File.join(File.dirname(__FILE__), '..', 'lib'))
-$LOAD_PATH.unshift(File.dirname(__FILE__))
-require 'rspec'
-require 'damerau-levenshtein'
-
-# Requires supporting files with custom matchers and macros, etc,
-# in ./support/ and its subdirectories.
-Dir["#{File.dirname(__FILE__)}/support/**/*.rb"].each {|f| require f}
-
-RSpec.configure do |config|
-  
-end
-
-def read_test_file(file, fields_num)
-  f = open(file)
-  f.each do |line|
-    fields = line.split("|")
-    if line.match(/^\s*#/) == nil && fields.size == fields_num
-      fields[-1] = fields[-1].split('#')[0].strip
-      yield(fields)
-    else
-      yield(nil)
-    end
-  end
-end