1
0
mirror of https://git.FreeBSD.org/ports.git synced 2024-12-28 05:29:48 +00:00

This is a Ruby library for approximate string matching and searching

using a dynamic programming algorithm to compute the Levenstein
distance between strings.  Written in C for speed.

WWW: http://flori.github.io/amatch/
This commit is contained in:
Dirk Meyer 2014-09-21 15:13:07 +00:00
parent 5c5de92aa5
commit 4b310fd5a0
Notes: svn2git 2021-03-31 03:12:20 +00:00
svn path=/head/; revision=368767
4 changed files with 23 additions and 0 deletions

View File

@ -1292,6 +1292,7 @@
SUBDIR += ruby-xmlparser
SUBDIR += ruby-xmlscan
SUBDIR += rubygem-albino
SUBDIR += rubygem-amatch
SUBDIR += rubygem-asciidoctor
SUBDIR += rubygem-augeas
SUBDIR += rubygem-charlock_holmes

View File

@ -0,0 +1,15 @@
# $FreeBSD$
PORTNAME= amatch
PORTVERSION= 0.3.0
CATEGORIES= textproc rubygems
MASTER_SITES= RG
MAINTAINER= ruby@FreeBSD.org
COMMENT= Ruby library for approximate string matching and searching
USE_RUBY= yes
USE_RUBYGEMS= yes
RUBYGEM_AUTOPLIST= yes
.include <bsd.port.mk>

View File

@ -0,0 +1,2 @@
SHA256 (rubygem/amatch-0.3.0.gem) = 669bac06769ab21d2fbd87839b5aa1b1d9e0eb39971b4404fe88de103685f45d
SIZE (rubygem/amatch-0.3.0.gem) = 28672

View File

@ -0,0 +1,5 @@
This is a Ruby library for approximate string matching and searching
using a dynamic programming algorithm to compute the Levenstein
distance between strings. Written in C for speed.
WWW: http://flori.github.io/amatch/