amatch 0.2.3 → 0.2.4

data/README.en

@@ -1,31 +0,0 @@
-Installation
-============
-
-Just type into the command line as root:
-
-# ruby install.rb config
-# ruby install.rb setup
-# ruby install.rb install
-
-install.rb was taken from Minero Aoki's setup project:
-	http://www.ruby-lang.org/en/raa-list.rhtml?name=setup.rb
-
-If you have installed rake (rake.rubyforge.org), you can also type:
-
-# rake install
-
-Documentation
-=============
-
-More documentation about this extension can be found in amatch.txt.en.
-
-Author
-======
-
-Florian Frank <flori@ping.de>
-
-License
-=======
-
-GNU General Public License, Version 2 (GPLv2)
-

data/ext/MANIFEST

@@ -1,2 +0,0 @@
-amatch.c
-extconf.rb

data/ext/tags

@@ -1,24 +0,0 @@
-CAST2FLOAT	amatch.c	/^#define CAST2FLOAT(obj) \\$/
-DEF_ALLOCATOR	amatch.c	/^#define DEF_ALLOCATOR(type)                       /
-DEF_CONSTRUCTOR	amatch.c	/^#define DEF_CONSTRUCTOR(klass, type)              /
-DEF_ITERATE_STRINGS	amatch.c	/^#define DEF_ITERATE_STRINGS(type)                 /
-DEF_PATTERN_ACCESSOR	amatch.c	/^#define DEF_PATTERN_ACCESSOR(type)                /
-DEF_RB_FREE	amatch.c	/^#define DEF_RB_FREE(klass, type)                  /
-DEF_RB_READER	amatch.c	/^#define DEF_RB_READER(type, function, name, conver/
-DEF_RB_WRITER	amatch.c	/^#define DEF_RB_WRITER(type, function, name, vtype,/
-FLOAT2C	amatch.c	/^#define FLOAT2C(obj) RFLOAT(obj)->value$/
-GET_STRUCT	amatch.c	/^#define GET_STRUCT(klass)                 \\$/
-Init_amatch	amatch.c	/^void Init_amatch()$/
-Levenshtein_search	amatch.c	/^static VALUE Levenshtein_search(Levenshtein *amatc/
-PairDistance_match	amatch.c	/^static VALUE PairDistance_match($/
-amatch_LongestSubstring	amatch.c	/^static VALUE amatch_LongestSubstring(General *amat/
-hamming	amatch.c	/^static VALUE hamming(General *amatch, VALUE string/
-longest_subsequence	amatch.c	/^static VALUE longest_subsequence(General *amatch, /
-rb_Levenshtein_initialize	amatch.c	/^static VALUE rb_Levenshtein_initialize(VALUE self,/
-rb_Levenshtein_search	amatch.c	/^static VALUE rb_Levenshtein_search(VALUE self, VAL/
-rb_str_Levenshtein_match	amatch.c	/^static VALUE rb_str_Levenshtein_match(VALUE self, /
-rb_str_Levenshtein_search	amatch.c	/^static VALUE rb_str_Levenshtein_search(VALUE self,/
-rb_str_hamming	amatch.c	/^static VALUE rb_str_hamming(VALUE self, VALUE stri/
-rb_str_longest_subsequence	amatch.c	/^static VALUE rb_str_longest_subsequence(VALUE self/
-rb_str_longest_substring	amatch.c	/^static VALUE rb_str_longest_substring(VALUE self, /
-rb_str_pair_distance	amatch.c	/^static VALUE rb_str_pair_distance(VALUE self, VALU/

data/tests/runner.rb

@@ -1,26 +0,0 @@
-#!/usr/bin/env ruby
-
-require 'test/unit/ui/console/testrunner'
-require 'test/unit/testsuite'
-$:.unshift File.expand_path(File.dirname($0))
-require 'test_levenshtein'
-require 'test_sellers'
-require 'test_pair_distance'
-require 'test_hamming'
-require 'test_longest_subsequence'
-require 'test_longest_substring'
-
-class TS_AllTests
-  def self.suite
-    suite = Test::Unit::TestSuite.new 'All tests'
-    suite << TC_Levenshtein.suite
-    suite << TC_Sellers.suite
-    suite << TC_PairDistance.suite
-    suite << TC_Hamming.suite
-    suite << TC_LongestSubsequence.suite
-    suite << TC_LongestSubstring.suite
-    suite
-  end
-end
-Test::Unit::UI::Console::TestRunner.run(TS_AllTests)
-  # vim: set et sw=2 ts=2: