forked from Lainports/freebsd-ports
4b310fd5a0
using a dynamic programming algorithm to compute the Levenstein distance between strings. Written in C for speed. WWW: http://flori.github.io/amatch/
15 lines
274 B
Makefile
15 lines
274 B
Makefile
# $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>
|