amatch 0.1.3 → 0.1.4

data/CHANGES

@@ -1,3 +1,6 @@
+2005-01-20 (0.1.4)
+    * Better argument handling in initialization method
+    * Minor changes in Rakefile and README.en
 2004-09-27 (0.1.3)
     * Rakefile and gem support added.
 2004-09-24 (0.1.2)

data/InstalledFiles

@@ -0,0 +1,5 @@
+/usr/local/stow/ruby/bin/
+/usr/local/stow/ruby/bin/CVS
+/usr/local/stow/ruby/bin/CVS
+/usr/local/stow/ruby/bin/CVS
+/usr/local/stow/ruby/lib/ruby/site_ruby/1.8/i686-linux/.

data/README.en

@@ -10,6 +10,10 @@ Just type into the command line as root:
 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
 =============
 

data/Rakefile

@@ -17,7 +17,7 @@ task :default => [:test]
 
 desc "Run unit tests"
 task(:test => [:compile]) do
-    ruby %{-Iext test.rb}
+    ruby %{-Iext tests/test.rb}
 end
 
 desc "Compiling library"
@@ -79,16 +79,17 @@ EOF
 
     s.has_rdoc = true
     #s.extra_rdoc_files = rd.rdoc_files.reject { |fn| fn =~ /\.rb$/ }.to_a
-    s.rdoc_options <<
-      '--title' <<  'Rake -- Ruby Make' <<
-      '--main' << 'README' <<
-      '--line-numbers'
+    #s.rdoc_options <<
+    #  '--title' <<  'Rake -- Ruby Make' <<
+    #  '--main' << 'README' <<
+    #  '--line-numbers'
+    s.test_files << 'tests/test.rb'
 
     #### Author and project details.
 
     s.author = "Florian Frank"
     s.email = "flori@ping.de"
-    s.homepage = "http://XXX"
+    s.homepage = "http://amatch.rubyforge.org"
     s.rubyforge_project = "amatch"
 end
 
@@ -96,4 +97,6 @@ Rake::GemPackageTask.new(spec) do |pkg|
     pkg.need_tar = true
     pkg.package_files += PKG_FILES
 end
+
+task :release => [ :clean, :compile, :package ]
     # vim: set et sw=4 ts=4:

data/VERSION

@@ -1 +1 @@
-0.1.3
+0.1.4

data/amatch.txt.en

@@ -4,19 +4,19 @@ Approximate Matching/Searching/Comparing
 
 SYNOPSIS
 
-	require 'amatch'
+    require 'amatch'
 
-	m = Amatch.new("pattern")
+    m = Amatch.new("pattern")
 
-	p m.match("pattren")
-	p m.match(["pattren","parent"])
-	p m.matchr("pattren")
-	p m.compare("pattren")
-	p m.comparer("pattren")
-	p m.compare("pattn")
-	p m.comparer("pattn")
-	p m.search("abcpattrendef")
-	p m.searchr("abcpattrendef")
+    p m.match("pattren")
+    p m.match(["pattren","parent"])
+    p m.matchr("pattren")
+    p m.compare("pattren")
+    p m.comparer("pattren")
+    p m.compare("pattn")
+    p m.comparer("pattn")
+    p m.search("abcpattrendef")
+    p m.searchr("abcpattrendef")
 
 DESCRIPTION
 
@@ -52,15 +52,15 @@ is given it has to be set with Amatch#pattern before matching.
 
 METHODS
 
-- Amatch#pattern	pattern string to match against
+- Amatch#pattern    pattern string to match against
 
-- Amatch#subw		weight of one substitution (type Fixnum)
+- Amatch#subw        weight of one substitution (type Fixnum)
 
-- Amatch#delw		weight of one deletion (type Fixnum)
+- Amatch#delw        weight of one deletion (type Fixnum)
 
-- Amatch#insw		weight of one insertion (type Fixnum)
+- Amatch#insw        weight of one insertion (type Fixnum)
 
-- Amatch#resetw		resets all weights to their default values (=1).
+- Amatch#resetw        resets all weights to their default values (=1).
 
 The following methods require the parameter 'strings'. This parameter can be
 of type String or Array of Strings. The method executes the matching operation
@@ -110,7 +110,7 @@ Florian Frank <flori@ping.de>
 
 COPYRIGHT
 
-Copyright (c) 2002	Florian Frank <flori@ping.de>
+Copyright (c) 2002        Florian Frank <flori@ping.de>
 
 This is free software; you can redistribute it and/or modify it under the
 terms of the GNU General Public License Version 2 as published by the Free

data/config.save

@@ -0,0 +1,12 @@
+bin-dir=$prefix/bin
+site-ruby=$prefix/lib/ruby/site_ruby/1.8
+prefix=/usr/local/stow/ruby
+ruby-path=/usr/local/stow/ruby/bin/ruby
+make-prog=make
+rb-dir=$site-ruby
+without-ext=no
+ruby-prog=/usr/local/stow/ruby/bin/ruby
+site-ruby-common=$prefix/lib/ruby/site_ruby
+std-ruby=$prefix/lib/ruby/1.8
+data-dir=$prefix/share
+so-dir=$prefix/lib/ruby/site_ruby/1.8/i686-linux

data/ext/Makefile

@@ -0,0 +1,138 @@
+
+SHELL = /bin/sh
+
+#### Start of system configuration section. ####
+
+srcdir = .
+topdir = /usr/local/stow/ruby/lib/ruby/1.9/i686-linux
+hdrdir = $(topdir)
+VPATH = $(srcdir):$(topdir):$(hdrdir)
+prefix = $(DESTDIR)/usr/local/stow/ruby
+exec_prefix = $(prefix)
+sitedir = $(prefix)/lib/ruby/site_ruby
+rubylibdir = $(libdir)/ruby/$(ruby_version)
+builddir = $(ac_builddir)
+archdir = $(rubylibdir)/$(arch)
+sbindir = $(exec_prefix)/sbin
+datadir = $(prefix)/share
+includedir = $(prefix)/include
+infodir = $(prefix)/info
+top_builddir = $(ac_top_builddir)
+sysconfdir = $(prefix)/etc
+mandir = $(prefix)/man
+libdir = $(exec_prefix)/lib
+sharedstatedir = $(prefix)/com
+oldincludedir = $(DESTDIR)/usr/include
+sitearchdir = $(sitelibdir)/$(sitearch)
+bindir = $(exec_prefix)/bin
+localstatedir = $(prefix)/var
+sitelibdir = $(sitedir)/$(ruby_version)
+libexecdir = $(exec_prefix)/libexec
+
+CC = gcc
+LIBRUBY = $(LIBRUBY_SO)
+LIBRUBY_A = lib$(RUBY_SO_NAME)-static.a
+LIBRUBYARG_SHARED = -Wl,-R -Wl,$(libdir) -L$(libdir) -L. -l$(RUBY_SO_NAME)
+LIBRUBYARG_STATIC = -l$(RUBY_SO_NAME)-static
+
+CFLAGS   =  -fPIC -g -O2  -fPIC 
+CPPFLAGS = -I. -I$(topdir) -I$(hdrdir) -I$(srcdir)  
+CXXFLAGS = $(CFLAGS) 
+DLDFLAGS =   
+LDSHARED = $(CC) -shared
+AR = ar
+EXEEXT = 
+
+RUBY_INSTALL_NAME = ruby
+RUBY_SO_NAME = ruby
+arch = i686-linux
+sitearch = i686-linux
+ruby_version = 1.9
+ruby = /usr/local/stow/ruby/bin/ruby
+RUBY = $(ruby)
+RM = rm -f
+MAKEDIRS = $(RUBY) -run -e mkdir -- -p
+INSTALL_PROG = $(RUBY) -run -e install -- -vpm 0755
+INSTALL_DATA = $(RUBY) -run -e install -- -vpm 0644
+COPY = $(RUBY) -run -e cp -- -v
+
+#### End of system configuration section. ####
+
+
+preload = 
+libpath = $(libdir)
+LIBPATH =  -L'$(libdir)' -Wl,-R'$(libdir)'
+DEFFILE = 
+
+CLEANFILES = 
+DISTCLEANFILES = 
+
+extout = 
+extout_prefix = 
+target_prefix = 
+LOCAL_LIBS = 
+LIBS = $(LIBRUBYARG_SHARED)  -lpthread -ldl -lcrypt -lm   -lc
+OBJS = amatch.o
+TARGET = amatch
+DLLIB = $(TARGET).so
+STATIC_LIB = 
+
+RUBYCOMMONDIR = $(sitedir)$(target_prefix)
+RUBYLIBDIR    = $(sitelibdir)$(target_prefix)
+RUBYARCHDIR   = $(sitearchdir)$(target_prefix)
+
+CLEANLIBS     = $(TARGET).so $(TARGET).il? $(TARGET).tds $(TARGET).map
+CLEANOBJS     = *.o *.a *.s[ol] *.pdb *.exp *.bak
+
+all:		$(DLLIB)
+static:		$(STATIC_LIB)
+
+clean:
+		@$(RM) $(CLEANLIBS) $(CLEANOBJS) $(CLEANFILES)
+
+distclean:	clean
+		@$(RM) Makefile extconf.h conftest.* mkmf.log
+		@$(RM) core ruby$(EXEEXT) *~ $(DISTCLEANFILES)
+
+realclean:	distclean
+install: install-so install-rb
+
+install-so: $(RUBYARCHDIR)
+install-so: $(RUBYARCHDIR)/$(DLLIB)
+$(RUBYARCHDIR)/$(DLLIB): $(DLLIB)
+	@$(INSTALL_PROG) $(DLLIB) $(RUBYARCHDIR)
+install-rb: $(RUBYLIBDIR)
+$(RUBYARCHDIR):
+	@$(MAKEDIRS) $@
+$(RUBYLIBDIR):
+	@$(MAKEDIRS) $@
+
+site-install: site-install-so site-install-rb
+site-install-so: install-so
+site-install-rb: install-rb
+
+.SUFFIXES: .c .cc .m .cxx .cpp .C .o
+
+.cc.o:
+	$(CXX) $(CXXFLAGS) $(CPPFLAGS) -c $<
+
+.cpp.o:
+	$(CXX) $(CXXFLAGS) $(CPPFLAGS) -c $<
+
+.cxx.o:
+	$(CXX) $(CXXFLAGS) $(CPPFLAGS) -c $<
+
+.C.o:
+	$(CXX) $(CXXFLAGS) $(CPPFLAGS) -c $<
+
+.c.o:
+	$(CC) $(CFLAGS) $(CPPFLAGS) -c $<
+
+$(DLLIB): $(OBJS)
+	@-$(RM) $@
+	@-$(MAKEDIRS) $(@D)
+	$(LDSHARED) $(DLDFLAGS) $(LIBPATH) -o $@ $(OBJS) $(LOCAL_LIBS) $(LIBS)
+
+
+
+$(OBJS): ruby.h defines.h 

data/ext/amatch.c

@@ -7,60 +7,60 @@ static VALUE cAmatch;
  */
 
 typedef struct {
-	int *ptr;
-	int len;
+    int *ptr;
+    int len;
 } vector;
 
 static vector *
 vector_new(len)
-	int len;
+    int len;
 {
-	vector *v;
-	v = ALLOC(vector);
-	if (v == NULL) rb_raise(rb_eNoMemError, "couldn't malloc vector");
-	v->ptr = ALLOC_N(int, len + 1);
-	if (v->ptr == NULL) rb_raise(rb_eNoMemError, "couldn't malloc vector data");
-	v->len = len;
-	return v;
+    vector *v;
+    v = ALLOC(vector);
+    if (v == NULL) rb_raise(rb_eNoMemError, "couldn't malloc vector");
+    v->ptr = ALLOC_N(int, len + 1);
+    if (v->ptr == NULL) rb_raise(rb_eNoMemError, "couldn't malloc vector data");
+    v->len = len;
+    return v;
 }
 
 static void
 vector_print(v)
-	vector *v;
+    vector *v;
 {
-	int i;
-	for(i = 0; i < v->len; i++) printf("%d", v->ptr[i]);
-	puts("");
+    int i;
+    for(i = 0; i < v->len; i++) printf("%d", v->ptr[i]);
+    puts("");
 }
 
 static void
 vector_destroy(v)
-	vector *v;
+    vector *v;
 {
-	xfree(v->ptr);
-	xfree(v);
+    xfree(v->ptr);
+    xfree(v);
 }
 
 static int
 vector_minimum(v)
-	vector *v;
+    vector *v;
 {
-	int i;
-	int min;
-
-	if (v->len == 0) return -1;
-	min = v->ptr[0];
-	for (i = 1; i <= v->len; i++) {
-		if (min > v->ptr[i]) min = v->ptr[i];
-	}
-	return min;
+    int i;
+    int min;
+
+    if (v->len == 0) return -1;
+    min = v->ptr[0];
+    for (i = 1; i <= v->len; i++) {
+        if (min > v->ptr[i]) min = v->ptr[i];
+    }
+    return min;
 }
 
 static int
 vector_last(v)
-	vector *v;
+    vector *v;
 {
-	return v->ptr[v->len];
+    return v->ptr[v->len];
 }
 
 /*
@@ -70,133 +70,133 @@ vector_last(v)
 enum { MATCH = 1, MATCHR, SEARCH, SEARCHR, COMPARE, COMPARER };
 
 static int weight2int(weight, name)
-	VALUE weight;
-	char *name;
+    VALUE weight;
+    char *name;
 {
-	if (TYPE(weight) != T_FIXNUM) {
-		rb_raise(rb_eTypeError,
-			"value of weight %s has to be of type Fixnum (%s given)",
-			"subw", NIL_P(weight) ? "NilClass" : rb_class2name(CLASS_OF(weight)));
-	}
-	return FIX2INT(weight);
+    if (TYPE(weight) != T_FIXNUM) {
+        rb_raise(rb_eTypeError,
+            "value of weight %s has to be of type Fixnum (%s given)",
+            "subw", NIL_P(weight) ? "NilClass" : rb_class2name(CLASS_OF(weight)));
+    }
+    return FIX2INT(weight);
 }
 
 static VALUE
 calculate_distance (self, string, mode)
     VALUE self;
-	VALUE string;
-	char mode;
+    VALUE string;
+    char mode;
 {
-	VALUE pattern, tmp;
-	static VALUE result;
-	int pattern_len, string_len;
-	char *pattern_ptr, *string_ptr;
-	vector *v[2];
-	int weight, sw, dw, iw, i, j, tmpi;
-	int c = 0, p = 1;
-
-	Check_Type(string, T_STRING);
-	string_ptr = RSTRING(string)->ptr;
-	string_len = RSTRING(string)->len;
-
-	pattern = rb_iv_get(self, "@pattern");
-	Check_Type(pattern, T_STRING);
-	pattern_ptr = RSTRING(pattern)->ptr;
-	pattern_len = RSTRING(pattern)->len;
-
-	sw = weight2int(rb_iv_get(self, "@subw"), "subw");
-	dw = weight2int(rb_iv_get(self, "@delw"), "delw");
-	iw = weight2int(rb_iv_get(self, "@insw"), "insw");
-	
-	v[0] = vector_new(string_len);
-	switch (mode) {
-		case MATCH:
-		case MATCHR:
-		case COMPARE:
-		case COMPARER:
-			for (i = 0; i <= v[0]->len; i++) v[0]->ptr[i] = i * iw;
-			break;
-		case SEARCH:
-		case SEARCHR:
-			for (i = 0; i <= v[0]->len; i++) v[0]->ptr[i] = 0;
-			break;
-		default:
-			rb_raise(rb_eFatal, "unknown mode in calculate_distance");
-	}
-
-	v[1] = vector_new(string_len);
-	for (i = 1; i <= pattern_len; i++) {
-		c = i % 2;				/* current row */
-		p = (i - 1) % 2;		/* previous row */
-		v[c]->ptr[0] = i * dw;	/* first column */
-		for (j = 1; j <= string_len; j++) {
-			/* Bellman's principle of optimality: */
-			weight = v[p]->ptr[j - 1] +
-				(pattern_ptr[i - 1] == string_ptr[j - 1] ? 0 : sw);
-		 	if (weight > v[p]->ptr[j] + 1) weight = v[p]->ptr[j] + dw;
-			if (weight > v[c]->ptr[j - 1] + 1) weight = v[c]->ptr[j - 1] + iw;
-			v[c]->ptr[j] = weight;
-		}
-	}
-	switch (mode) {
-		case MATCH:
-			result = INT2FIX(vector_last(v[c]));
-			break;
-		case MATCHR:
-			result = rb_float_new((double) vector_last(v[c]) / pattern_len);
-			break;
-		case SEARCH:
-			tmpi = vector_minimum(v[c]);
-			result = tmpi < 0 ? INT2FIX(pattern_len) : INT2FIX(tmpi);
-			break;
-		case SEARCHR:
-			tmpi = vector_minimum(v[c]);
-			result = rb_float_new( tmpi < 0 ? 1.0 : (double) tmpi / pattern_len);
-			break;
-		case COMPARE:
-			result = INT2FIX((string_len < pattern_len ? -1 : 1) *
-				vector_last(v[c]));
-			break;
-		case COMPARER:
-			result = rb_float_new((double)
-				(string_len < pattern_len ? -1 : 1)	 *
-				vector_last(v[c]) / pattern_len);
-			break;
-		default:
-			rb_raise(rb_eFatal, "unknown mode in calculate_distance");
-	}
-	vector_destroy(v[0]);
-	vector_destroy(v[1]);
-	return result;
+    VALUE pattern, tmp;
+    static VALUE result;
+    int pattern_len, string_len;
+    char *pattern_ptr, *string_ptr;
+    vector *v[2];
+    int weight, sw, dw, iw, i, j, tmpi;
+    int c = 0, p = 1;
+
+    Check_Type(string, T_STRING);
+    string_ptr = RSTRING(string)->ptr;
+    string_len = RSTRING(string)->len;
+
+    pattern = rb_iv_get(self, "@pattern");
+    Check_Type(pattern, T_STRING);
+    pattern_ptr = RSTRING(pattern)->ptr;
+    pattern_len = RSTRING(pattern)->len;
+
+    sw = weight2int(rb_iv_get(self, "@subw"), "subw");
+    dw = weight2int(rb_iv_get(self, "@delw"), "delw");
+    iw = weight2int(rb_iv_get(self, "@insw"), "insw");
+    
+    v[0] = vector_new(string_len);
+    switch (mode) {
+        case MATCH:
+        case MATCHR:
+        case COMPARE:
+        case COMPARER:
+            for (i = 0; i <= v[0]->len; i++) v[0]->ptr[i] = i * iw;
+            break;
+        case SEARCH:
+        case SEARCHR:
+            for (i = 0; i <= v[0]->len; i++) v[0]->ptr[i] = 0;
+            break;
+        default:
+            rb_raise(rb_eFatal, "unknown mode in calculate_distance");
+    }
+
+    v[1] = vector_new(string_len);
+    for (i = 1; i <= pattern_len; i++) {
+        c = i % 2;                /* current row */
+        p = (i - 1) % 2;          /* previous row */
+        v[c]->ptr[0] = i * dw;    /* first column */
+        for (j = 1; j <= string_len; j++) {
+            /* Bellman's principle of optimality: */
+            weight = v[p]->ptr[j - 1] +
+                (pattern_ptr[i - 1] == string_ptr[j - 1] ? 0 : sw);
+             if (weight > v[p]->ptr[j] + 1) weight = v[p]->ptr[j] + dw;
+            if (weight > v[c]->ptr[j - 1] + 1) weight = v[c]->ptr[j - 1] + iw;
+            v[c]->ptr[j] = weight;
+        }
+    }
+    switch (mode) {
+        case MATCH:
+            result = INT2FIX(vector_last(v[c]));
+            break;
+        case MATCHR:
+            result = rb_float_new((double) vector_last(v[c]) / pattern_len);
+            break;
+        case SEARCH:
+            tmpi = vector_minimum(v[c]);
+            result = tmpi < 0 ? INT2FIX(pattern_len) : INT2FIX(tmpi);
+            break;
+        case SEARCHR:
+            tmpi = vector_minimum(v[c]);
+            result = rb_float_new( tmpi < 0 ? 1.0 : (double) tmpi / pattern_len);
+            break;
+        case COMPARE:
+            result = INT2FIX((string_len < pattern_len ? -1 : 1) *
+                vector_last(v[c]));
+            break;
+        case COMPARER:
+            result = rb_float_new((double)
+                (string_len < pattern_len ? -1 : 1)     *
+                vector_last(v[c]) / pattern_len);
+            break;
+        default:
+            rb_raise(rb_eFatal, "unknown mode in calculate_distance");
+    }
+    vector_destroy(v[0]);
+    vector_destroy(v[1]);
+    return result;
 }
 
 static VALUE
 handle_strings(self, strings, mode)
-	VALUE self;
-	VALUE strings;
-	char mode;
+    VALUE self;
+    VALUE strings;
+    char mode;
 {
-	if (TYPE(strings) == T_ARRAY) {
-		int i;
-		VALUE result = rb_ary_new2(RARRAY(strings)->len);
-		for (i = 0; i < RARRAY(strings)->len; i++) {
-			VALUE string = rb_ary_entry(strings, i);
-			if (TYPE(string) != T_STRING) {
-				rb_raise(rb_eTypeError,
-					"array has to contain only strings (%s given)",
-					NIL_P(string) ? "NilClass" :
-									rb_class2name(CLASS_OF(string)));
-			}
-			rb_ary_push(result, calculate_distance(self, string, mode));
-		}
-		return result;
-	} else if (TYPE(strings) == T_STRING) {
-		return calculate_distance(self, strings, mode);
-	} else {
-		rb_raise(rb_eTypeError,
-			"value of strings needs to be string or array (%s given)",
-			NIL_P(strings) ? "NilClass" : rb_class2name(CLASS_OF(strings)));
-	}
+    if (TYPE(strings) == T_ARRAY) {
+        int i;
+        VALUE result = rb_ary_new2(RARRAY(strings)->len);
+        for (i = 0; i < RARRAY(strings)->len; i++) {
+            VALUE string = rb_ary_entry(strings, i);
+            if (TYPE(string) != T_STRING) {
+                rb_raise(rb_eTypeError,
+                    "array has to contain only strings (%s given)",
+                    NIL_P(string) ? "NilClass" :
+                                    rb_class2name(CLASS_OF(string)));
+            }
+            rb_ary_push(result, calculate_distance(self, string, mode));
+        }
+        return result;
+    } else if (TYPE(strings) == T_STRING) {
+        return calculate_distance(self, strings, mode);
+    } else {
+        rb_raise(rb_eTypeError,
+            "value of strings needs to be string or array (%s given)",
+            NIL_P(strings) ? "NilClass" : rb_class2name(CLASS_OF(strings)));
+    }
 }
 
 /*
@@ -207,105 +207,100 @@ static VALUE
 rb_amatch_resetw(self)
     VALUE self;
 {
-	rb_iv_set(self, "@subw", INT2FIX(1));
-	rb_iv_set(self, "@delw", INT2FIX(1));
-	rb_iv_set(self, "@insw", INT2FIX(1));
+    rb_iv_set(self, "@subw", INT2FIX(1));
+    rb_iv_set(self, "@delw", INT2FIX(1));
+    rb_iv_set(self, "@insw", INT2FIX(1));
 
-	return Qtrue;
+    return Qtrue;
 }
 
 static VALUE
-rb_amatch_initialize(argc, argv, self)
-    int argc;
-    VALUE* argv;
+rb_amatch_initialize(self, pattern)
     VALUE self;
-{
     VALUE pattern;
+{
 
-    rb_scan_args(argc, argv, "01", &pattern);
-	Check_Type(pattern, T_STRING);
-	rb_iv_set(self, "@pattern", pattern);
-
-	rb_amatch_resetw(self);
-
+    Check_Type(pattern, T_STRING);
+    rb_iv_set(self, "@pattern", pattern);
+    rb_amatch_resetw(self);
     return self;
 }
 
 static VALUE
 rb_amatch_pattern_is(self, pattern)
     VALUE self;
-	VALUE pattern;
+    VALUE pattern;
 {
-	Check_Type(pattern, T_STRING);
-	rb_iv_set(self, "@pattern", pattern);
+    Check_Type(pattern, T_STRING);
+    rb_iv_set(self, "@pattern", pattern);
 
-	return pattern;
+    return pattern;
 }
 
 
 static VALUE
 rb_amatch_match(self, strings)
-	VALUE self;
-	VALUE strings; 
+    VALUE self;
+    VALUE strings; 
 {
-	return handle_strings(self, strings, MATCH);
+    return handle_strings(self, strings, MATCH);
 }
 
 static VALUE
 rb_amatch_matchr(self, strings)
-	VALUE self;
-	VALUE strings;
+    VALUE self;
+    VALUE strings;
 {
-	return handle_strings(self, strings, MATCHR);
+    return handle_strings(self, strings, MATCHR);
 }
 
 static VALUE
 rb_amatch_compare(self, strings)
-	VALUE self;
-	VALUE strings;
+    VALUE self;
+    VALUE strings;
 {
-	return handle_strings(self, strings, COMPARE);
+    return handle_strings(self, strings, COMPARE);
 }
 
 static VALUE
 rb_amatch_comparer(self, strings)
-	VALUE self;
-	VALUE strings;
+    VALUE self;
+    VALUE strings;
 {
-	return handle_strings(self, strings, COMPARER);
+    return handle_strings(self, strings, COMPARER);
 }
 
 
 static VALUE
 rb_amatch_search(self, strings)
-	VALUE self;
-	VALUE strings;
+    VALUE self;
+    VALUE strings;
 {
-	return handle_strings(self, strings, SEARCH);
+    return handle_strings(self, strings, SEARCH);
 }
 
 static VALUE
 rb_amatch_searchr(self, strings)
-	VALUE self;
-	VALUE strings;
+    VALUE self;
+    VALUE strings;
 {
-	return handle_strings(self, strings, SEARCHR);
+    return handle_strings(self, strings, SEARCHR);
 }
 
 void
 Init_amatch()
 {
-	cAmatch = rb_define_class("Amatch", rb_cObject);
-    rb_define_method(cAmatch, "initialize", rb_amatch_initialize, -1);
+    cAmatch = rb_define_class("Amatch", rb_cObject);
+    rb_define_method(cAmatch, "initialize", rb_amatch_initialize, 1);
 
-	rb_define_attr(cAmatch, "debug", 1, 1);
-	rb_define_attr(cAmatch, "subw", 1, 1);
-	rb_define_attr(cAmatch, "delw", 1, 1);
-	rb_define_attr(cAmatch, "insw", 1, 1);
+    rb_define_attr(cAmatch, "debug", 1, 1);
+    rb_define_attr(cAmatch, "subw", 1, 1);
+    rb_define_attr(cAmatch, "delw", 1, 1);
+    rb_define_attr(cAmatch, "insw", 1, 1);
     rb_define_method(cAmatch, "resetw", rb_amatch_resetw, 0);
 
     rb_define_method(cAmatch, "pattern=", rb_amatch_pattern_is, 1);
-	rb_define_attr(cAmatch, "pattern", 1, 0);
+    rb_define_attr(cAmatch, "pattern", 1, 0);
 
     rb_define_method(cAmatch, "match", rb_amatch_match, 1);
     rb_define_method(cAmatch, "matchr", rb_amatch_matchr, 1);
@@ -314,4 +309,4 @@ Init_amatch()
     rb_define_method(cAmatch, "search", rb_amatch_search, 1);
     rb_define_method(cAmatch, "searchr", rb_amatch_searchr, 1);
 }
-	/* vim: set cin sw=4 ts=4: */
+    /* vim: set et cin sw=4 ts=4: */

metadata

@@ -3,14 +3,14 @@ rubygems_version: 0.8.1
 specification_version: 1
 name: amatch
 version: !ruby/object:Gem::Version 
-  version: 0.1.3
-date: 2004-09-27
+  version: 0.1.4
+date: 2005-01-20
 summary: Approximate String Matching library
 require_paths: 
   - lib
 author: Florian Frank
 email: flori@ping.de
-homepage: http://XXX
+homepage: http://amatch.rubyforge.org
 rubyforge_project: amatch
 description: Amatch is a library for approximate string matching and searching using a dynamic programming algorithm to compute the Levenstein distance between strings.
 autorequire: amatch
@@ -32,22 +32,23 @@ files:
   - bin
   - bin/agrep.rb
   - ext
+  - ext/Makefile
   - ext/MANIFEST
   - ext/amatch.c
   - ext/extconf.rb
+  - ext/amatch.o
+  - ext/amatch.so
   - Rakefile
   - VERSION
   - amatch.txt.en
   - install.rb
-  - test.rb
-  - index.html
-test_files: []
-rdoc_options: 
-  - "--title"
-  - "Rake -- Ruby Make"
-  - "--main"
-  - README
-  - "--line-numbers"
+  - config.save
+  - InstalledFiles
+  - tests
+  - tests/test.rb
+test_files: 
+  - tests/test.rb
+rdoc_options: []
 extra_rdoc_files: []
 executables: 
   - agrep.rb

data/index.html

@@ -1,9 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Refresh" content="0; URL=http://www.rubyforge.org/projects/amatch/"/>
-<title>Approximate String Matching</title>
-</head>
-<body>
-Redirecting to project <a href="http://www.rubyforge.org/projects/amatch/">Approximate String Matching</a> on Rubyforge.
-</body>
-</html>