Add p5-String-LCSS 0.12, to determine the longest common substring shared by

two strings

textproc/p5-String-LCSS/Makefile

@@ -0,0 +1,16 @@
+# Created by: Dan Langille <dvl@FreeBSD.org>
+# $FreeBSD$
+
+PORTNAME=	String-LCSS
+PORTVERSION=	0.12
+CATEGORIES=	textproc perl5
+MASTER_SITES=	CPAN
+PKGNAMEPREFIX=	p5-
+
+MAINTAINER=	dvl@FreeBSD.org
+COMMENT=	Find The Longest Common Substring of Two Strings.
+
+USES=		perl5
+USE_PERL5=	configure
+
+.include <bsd.port.mk>

textproc/p5-String-LCSS/distinfo

@@ -0,0 +1,3 @@
+TIMESTAMP = 1481910782
+SHA256 (String-LCSS-0.12.tar.gz) = 049646e5881c0114998e589616ba9ffaeb59b1ce095d43158fd0fd6d8fe03b39
+SIZE (String-LCSS-0.12.tar.gz) = 2923

textproc/p5-String-LCSS/pkg-descr

@@ -0,0 +1,8 @@
+String::LCSS provides the function "lcss" to ferret out the longest common
+substring shared by two strings passed as arguments. undef is returned if
+the susbstring length is one char or less.
+
+When used in an array context, lcss will returns the indexi of the match root
+in the two args.
+
+WWW: http://search.cpan.org/dist/String-LCSS/

textproc/p5-String-LCSS/pkg-plist

@@ -0,0 +1,2 @@
+%%PERL5_MAN3%%/String::LCSS.3.gz
+%%SITE_PERL%%/String/LCSS.pm