From 91f5692ffc456d0338158b724c30236f3fc7b815 Mon Sep 17 00:00:00 2001
From: obache <obache>
Date: Sat, 26 Jan 2013 10:49:03 +0000
Subject: Import ruby-levenshtein-0.2.2 as textproc/ruby-levenshtein.

The Levenshtein distance is a metric for measuring the amount
of difference between two sequences (i.e., the so called edit
distance). The Levenshtein distance between two sequences is
given by the minimum number of operations needed to transform
one sequence into the other, where an operation is an
insertion, deletion, or substitution of a single element.

The two sequences can be two strings, two arrays, or two other
objects responding to :each. All sequences are by generic
(fast) C code.

All objects in the sequences should respond to :hash and :eql?.

More information about the Levenshtein distance algorithm:
http://en.wikipedia.org/wiki/Levenshtein_distance .
---
 textproc/ruby-levenshtein/DESCR    | 15 +++++++++++++++
 textproc/ruby-levenshtein/Makefile | 12 ++++++++++++
 textproc/ruby-levenshtein/PLIST    | 14 ++++++++++++++
 textproc/ruby-levenshtein/distinfo |  5 +++++
 4 files changed, 46 insertions(+)
 create mode 100644 textproc/ruby-levenshtein/DESCR
 create mode 100644 textproc/ruby-levenshtein/Makefile
 create mode 100644 textproc/ruby-levenshtein/PLIST
 create mode 100644 textproc/ruby-levenshtein/distinfo

diff --git a/textproc/ruby-levenshtein/DESCR b/textproc/ruby-levenshtein/DESCR
new file mode 100644
index 00000000000..de18effb8b0
--- /dev/null
+++ b/textproc/ruby-levenshtein/DESCR
@@ -0,0 +1,15 @@
+The Levenshtein distance is a metric for measuring the amount
+of difference between two sequences (i.e., the so called edit
+distance). The Levenshtein distance between two sequences is
+given by the minimum number of operations needed to transform
+one sequence into the other, where an operation is an
+insertion, deletion, or substitution of a single element.
+
+The two sequences can be two strings, two arrays, or two other
+objects responding to :each. All sequences are by generic
+(fast) C code.
+
+All objects in the sequences should respond to :hash and :eql?.
+
+More information about the Levenshtein distance algorithm:
+http://en.wikipedia.org/wiki/Levenshtein_distance .
diff --git a/textproc/ruby-levenshtein/Makefile b/textproc/ruby-levenshtein/Makefile
new file mode 100644
index 00000000000..39258bfc932
--- /dev/null
+++ b/textproc/ruby-levenshtein/Makefile
@@ -0,0 +1,12 @@
+# $NetBSD: Makefile,v 1.1 2013/01/26 10:49:03 obache Exp $
+
+DISTNAME=	levenshtein-0.2.2
+CATEGORIES=	textproc
+
+MAINTAINER=	pkgsrc-users@NetBSD.org
+HOMEPAGE=	http://www.erikveen.dds.nl/levenshtein/doc/index.html
+COMMENT=	Calculates the Levenshtein distance between two byte strings
+LICENSE=	gnu-gpl-v2
+
+.include "../../lang/ruby/gem.mk"
+.include "../../mk/bsd.pkg.mk"
diff --git a/textproc/ruby-levenshtein/PLIST b/textproc/ruby-levenshtein/PLIST
new file mode 100644
index 00000000000..619881253e5
--- /dev/null
+++ b/textproc/ruby-levenshtein/PLIST
@@ -0,0 +1,14 @@
+@comment $NetBSD: PLIST,v 1.1 2013/01/26 10:49:03 obache Exp $
+${GEM_HOME}/cache/${GEM_NAME}.gem
+${GEM_LIBDIR}/CHANGELOG
+${GEM_LIBDIR}/LICENSE
+${GEM_LIBDIR}/README
+${GEM_LIBDIR}/VERSION
+${GEM_LIBDIR}/ext/levenshtein/extconf.rb
+${GEM_LIBDIR}/ext/levenshtein/levenshtein.h
+${GEM_LIBDIR}/ext/levenshtein/levenshtein_fast.c
+${GEM_LIBDIR}/lib/levenshtein.rb
+${GEM_LIBDIR}/lib/levenshtein/levenshtein_fast.so
+${GEM_LIBDIR}/lib/levenshtein/version.rb
+${GEM_LIBDIR}/test/test.rb
+${GEM_HOME}/specifications/${GEM_NAME}.gemspec
diff --git a/textproc/ruby-levenshtein/distinfo b/textproc/ruby-levenshtein/distinfo
new file mode 100644
index 00000000000..5cef759bb33
--- /dev/null
+++ b/textproc/ruby-levenshtein/distinfo
@@ -0,0 +1,5 @@
+$NetBSD: distinfo,v 1.1 2013/01/26 10:49:03 obache Exp $
+
+SHA1 (levenshtein-0.2.2.gem) = 7408d9adc53cba7ad4b37dd82026a9b8fabb49de
+RMD160 (levenshtein-0.2.2.gem) = e75ce89b5692a0853d93eb94a6dd20242e4dec07
+Size (levenshtein-0.2.2.gem) = 7680 bytes
-- 
cgit v1.2.3