amatch 0.2.3 → 0.2.4

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
data/README.en DELETED
@@ -1,31 +0,0 @@
1
- Installation
2
- ============
3
-
4
- Just type into the command line as root:
5
-
6
- # ruby install.rb config
7
- # ruby install.rb setup
8
- # ruby install.rb install
9
-
10
- install.rb was taken from Minero Aoki's setup project:
11
- http://www.ruby-lang.org/en/raa-list.rhtml?name=setup.rb
12
-
13
- If you have installed rake (rake.rubyforge.org), you can also type:
14
-
15
- # rake install
16
-
17
- Documentation
18
- =============
19
-
20
- More documentation about this extension can be found in amatch.txt.en.
21
-
22
- Author
23
- ======
24
-
25
- Florian Frank <flori@ping.de>
26
-
27
- License
28
- =======
29
-
30
- GNU General Public License, Version 2 (GPLv2)
31
-
@@ -1,2 +0,0 @@
1
- amatch.c
2
- extconf.rb
data/ext/tags DELETED
@@ -1,24 +0,0 @@
1
- CAST2FLOAT amatch.c /^#define CAST2FLOAT(obj) \\$/
2
- DEF_ALLOCATOR amatch.c /^#define DEF_ALLOCATOR(type) /
3
- DEF_CONSTRUCTOR amatch.c /^#define DEF_CONSTRUCTOR(klass, type) /
4
- DEF_ITERATE_STRINGS amatch.c /^#define DEF_ITERATE_STRINGS(type) /
5
- DEF_PATTERN_ACCESSOR amatch.c /^#define DEF_PATTERN_ACCESSOR(type) /
6
- DEF_RB_FREE amatch.c /^#define DEF_RB_FREE(klass, type) /
7
- DEF_RB_READER amatch.c /^#define DEF_RB_READER(type, function, name, conver/
8
- DEF_RB_WRITER amatch.c /^#define DEF_RB_WRITER(type, function, name, vtype,/
9
- FLOAT2C amatch.c /^#define FLOAT2C(obj) RFLOAT(obj)->value$/
10
- GET_STRUCT amatch.c /^#define GET_STRUCT(klass) \\$/
11
- Init_amatch amatch.c /^void Init_amatch()$/
12
- Levenshtein_search amatch.c /^static VALUE Levenshtein_search(Levenshtein *amatc/
13
- PairDistance_match amatch.c /^static VALUE PairDistance_match($/
14
- amatch_LongestSubstring amatch.c /^static VALUE amatch_LongestSubstring(General *amat/
15
- hamming amatch.c /^static VALUE hamming(General *amatch, VALUE string/
16
- longest_subsequence amatch.c /^static VALUE longest_subsequence(General *amatch, /
17
- rb_Levenshtein_initialize amatch.c /^static VALUE rb_Levenshtein_initialize(VALUE self,/
18
- rb_Levenshtein_search amatch.c /^static VALUE rb_Levenshtein_search(VALUE self, VAL/
19
- rb_str_Levenshtein_match amatch.c /^static VALUE rb_str_Levenshtein_match(VALUE self, /
20
- rb_str_Levenshtein_search amatch.c /^static VALUE rb_str_Levenshtein_search(VALUE self,/
21
- rb_str_hamming amatch.c /^static VALUE rb_str_hamming(VALUE self, VALUE stri/
22
- rb_str_longest_subsequence amatch.c /^static VALUE rb_str_longest_subsequence(VALUE self/
23
- rb_str_longest_substring amatch.c /^static VALUE rb_str_longest_substring(VALUE self, /
24
- rb_str_pair_distance amatch.c /^static VALUE rb_str_pair_distance(VALUE self, VALU/
@@ -1,26 +0,0 @@
1
- #!/usr/bin/env ruby
2
-
3
- require 'test/unit/ui/console/testrunner'
4
- require 'test/unit/testsuite'
5
- $:.unshift File.expand_path(File.dirname($0))
6
- require 'test_levenshtein'
7
- require 'test_sellers'
8
- require 'test_pair_distance'
9
- require 'test_hamming'
10
- require 'test_longest_subsequence'
11
- require 'test_longest_substring'
12
-
13
- class TS_AllTests
14
- def self.suite
15
- suite = Test::Unit::TestSuite.new 'All tests'
16
- suite << TC_Levenshtein.suite
17
- suite << TC_Sellers.suite
18
- suite << TC_PairDistance.suite
19
- suite << TC_Hamming.suite
20
- suite << TC_LongestSubsequence.suite
21
- suite << TC_LongestSubstring.suite
22
- suite
23
- end
24
- end
25
- Test::Unit::UI::Console::TestRunner.run(TS_AllTests)
26
- # vim: set et sw=2 ts=2: