# This is a shell archive.  Save it in a file, remove anything before
# this line, and then unpack it by entering "sh file".  Note, it may
# create directories; files and directories will be owned by you and
# have default permissions.
#
# This archive contains:
#
#	py-pytst
#	py-pytst/Makefile
#	py-pytst/distinfo
#	py-pytst/pkg-descr
#
echo c - py-pytst
mkdir -p py-pytst > /dev/null 2>&1
echo x - py-pytst/Makefile
sed 's/^X//' >py-pytst/Makefile << 'END-of-py-pytst/Makefile'
X# New ports collection makefile for:	py-pytst
X# Date created:				05 Jul 2006
X# Whom:					Marcus Alves Grando <mnag@FreeBSD.org>
X#
X# $FreeBSD$
X#
X
XPORTNAME=	pytst
XPORTVERSION=	1.14
XCATEGORIES=	devel python
XMASTER_SITES=	http://nicolas.lehuen.com/download/pytst/
XPKGNAMEPREFIX=	${PYTHON_PKGNAMEPREFIX}
X
XMAINTAINER=	mnag@FreeBSD.org
XCOMMENT=	An implementation of a Ternary Search Tree (TST) in C++
X
XDIST_SUBDIR=	python
XUSE_ZIP=	yes
XUSE_PYTHON=	yes
XUSE_PYDISTUTILS=	yes
X
XDOCSDIR=	${PREFIX}/share/doc/${PKGNAMEPREFIX}${PORTNAME}
X
XPLIST_FILES=	%%PYTHON_SITELIBDIR%%/_tst.so \
X		%%PYTHON_SITELIBDIR%%/tst.py \
X		%%PYTHON_SITELIBDIR%%/tst.pyc \
X		%%PYTHON_SITELIBDIR%%/tst.pyo
X
XPORTDOCS=	*
X
X.include <bsd.port.pre.mk>
X
X.if ${OSVERSION} < 500000
XBROKEN=		Does not build
X.endif
X
Xpost-install:
X.if !defined(NOPORTDOCS)
X	@${MKDIR} ${DOCSDIR}
X	${INSTALL_DATA} ${WRKSRC}/README.html ${DOCSDIR}
X.endif
X
X.include <bsd.port.post.mk>
END-of-py-pytst/Makefile
echo x - py-pytst/distinfo
sed 's/^X//' >py-pytst/distinfo << 'END-of-py-pytst/distinfo'
XMD5 (python/pytst-1.14.zip) = 2c70ff87c49b1490d350fb9fbb298ea5
XSHA256 (python/pytst-1.14.zip) = e42168856f9deb53a12155f3efd816568361b1104c504ce520ed66f362d987ce
XSIZE (python/pytst-1.14.zip) = 85971
END-of-py-pytst/distinfo
echo x - py-pytst/pkg-descr
sed 's/^X//' >py-pytst/pkg-descr << 'END-of-py-pytst/pkg-descr'
XIt behaves like a dictionary, but the keys can only be plain strings (sorry,
Xnot Unicode strings yet). So why bother ? Because TSTs are a lot smarter than
Xdictionaries when it comes to:
X
X* Prefix-matching : find the longest entry in the TST which is a prefix to a
X  given string. Handy for things like scanners, url matchers and so on.
X* Scanning (corollary of the previous one) : using the Aho-Corasick algorithm,
X  you can implement pretty efficient scanners with a TST. The good thing it 
X  that it can scale up to tens of thousands of entries and still perform well.
X* Spelling correctors : find a set of entries which spelling is close to a
X  given string. The distance used is the Levenshtein distance.
X
XWWW:	http://nicolas.lehuen.com/index.php/Pytst
END-of-py-pytst/pkg-descr
exit