svn commit: r414165 - head/textproc/re_graph
Dmitry Marakasov
amdmi3 at FreeBSD.org
Thu Apr 28 09:03:24 UTC 2016
Author: amdmi3
Date: Thu Apr 28 09:03:22 2016
New Revision: 414165
URL: https://svnweb.freebsd.org/changeset/ports/414165
Log:
- Add LICENSE
- Switch to USES=tar
- Add NO_ARCH
- Switch to options helpers
- Pet portlint
Modified:
head/textproc/re_graph/Makefile
head/textproc/re_graph/pkg-descr
Modified: head/textproc/re_graph/Makefile
==============================================================================
--- head/textproc/re_graph/Makefile Thu Apr 28 08:51:02 2016 (r414164)
+++ head/textproc/re_graph/Makefile Thu Apr 28 09:03:22 2016 (r414165)
@@ -7,27 +7,31 @@ PORTREVISION= 3
CATEGORIES= textproc
MASTER_SITES= http://www.oualline.com/sw/re/
DISTNAME= ${PORTNAME:S/_/-/}_${PORTVERSION:S/.//}
-EXTRACT_SUFX= .tar
MAINTAINER= ports at FreeBSD.org
COMMENT= Regular Expression Graphing Program
+LICENSE= GPLv2
+LICENSE_FILE= ${WRKSRC}/COPYING
+
RUN_DEPENDS= p5-GD>=0:graphics/p5-GD \
p5-GD-Arrow>=0:graphics/p5-GD-Arrow
-USES= perl5
+USES= tar perl5
+USE_PERL5= run
NO_WRKSUBDIR= yes
NO_BUILD= yes
-USE_PERL5= run
+NO_ARCH= yes
PLIST_FILES= bin/re_graph
+PORTDOCS= *
OPTIONS_DEFINE= DOCS
-PORTDOCS= *
-
do-install:
${INSTALL_SCRIPT} ${WRKSRC}/re_graph.pl ${STAGEDIR}${PREFIX}/bin/re_graph
+
+do-install-DOCS-on:
@${MKDIR} ${STAGEDIR}${DOCSDIR}
${INSTALL_DATA} ${WRKSRC}/re_graph.html ${STAGEDIR}${DOCSDIR}
${INSTALL_DATA} ${WRKSRC}/tut* ${STAGEDIR}${DOCSDIR}
Modified: head/textproc/re_graph/pkg-descr
==============================================================================
--- head/textproc/re_graph/pkg-descr Thu Apr 28 08:51:02 2016 (r414164)
+++ head/textproc/re_graph/pkg-descr Thu Apr 28 09:03:22 2016 (r414165)
@@ -1,17 +1,17 @@
The re_graph.pl program graphs regular expressions. The guts of the regular
-expression engine is a simple state machine. The various states and operations
-in the regular expression parser can be displayed using a surprisingly simple
-diagram.
+expression engine is a simple state machine. The various states and
+operations in the regular expression parser can be displayed using a
+surprisingly simple diagram.
A few notes on what you are looking at:
- * The nodes Start and Stop denote the beginning and end of the regular
- expression.
- * The solid squares denote atoms. Lines indicate the next state. When a
- line splits, the state machine will take the top line first. If it's
- path is blocked it will backup and take the next lower line. This is
- repeated until it finds a path to the end or all paths are exhausted.
- * Brown boxes indicate a grouping operation, i.e. ().
- * Green boxes indicate a zero with test. The state machine will perform the
- test inside the box before moving ahead.
+ * The nodes Start and Stop denote the beginning and end of the regular
+ expression.
+ * The solid squares denote atoms. Lines indicate the next state. When a
+ line splits, the state machine will take the top line first. If it's
+ path is blocked it will backup and take the next lower line. This is
+ repeated until it finds a path to the end or all paths are exhausted.
+ * Brown boxes indicate a grouping operation, i.e. ().
+ * Green boxes indicate a zero with test. The state machine will perform
+ the test inside the box before moving ahead.
WWW: http://www.oualline.com/sw/
More information about the svn-ports-all
mailing list