cpet/openbsd-ports
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
a239297799
openbsd-ports/devel/gtl/Makefile

45 lines
1.3 KiB
Makefile
Raw Normal View History

o) change maintainer's email address o) move COMMENT into Makefile o) bump NEED_VERSION
2001-03-24 07:51:47 -05:00
# $OpenBSD: Makefile,v 1.5 2001/03/24 12:51:47 reinhard Exp $
COMMENT= 'c++ graph data template library based on the stl'
mark broken: "changed download policy; sources no longer available" requested by maintainer
2001-02-05 05:25:41 -05:00
upgrade to GTL 1.0.0 - WITH THE RELEASE THE DOWNLOAD POLICY FOR GTL HAS BEEN CHANGED. PLEASE SEE THE HOMEPAGE FOR THE DETAILS. - First stable release - Various bugfixes - Optimization of reallocation procedure in node_ and edge_maps - Bump NEED_VERSION from maintainer
2001-02-09 05:05:30 -05:00
PKGNAME= gtl-1.0.0
DISTNAME= GTL-1.0.0
Graph Template Library (GTL) is based on the Standart Template Library (STL), which is supposed to become a part of the C++ standart library and therefore is an ideal basis when writing portable programs. For the design of the GTL's API the API of LEDA is used as a base. GTL contains the classes needed to work with graphs, nodes and edges and some basic algorithms as building blocks for more complex graph algorithms. Further algorithms are under work. Unfortunately, STL has no support for graphs and graph algorithms. However, graphs are widely used to model complex relational structures. MAINTAINER= Peter Valchev <pvalchev@toxiclinux.org>
2001-01-19 11:33:15 -05:00
CATEGORIES= devel
o) change maintainer's email address o) move COMMENT into Makefile o) bump NEED_VERSION
2001-03-24 07:51:47 -05:00
NEED_VERSION= 1.363
Graph Template Library (GTL) is based on the Standart Template Library (STL), which is supposed to become a part of the C++ standart library and therefore is an ideal basis when writing portable programs. For the design of the GTL's API the API of LEDA is used as a base. GTL contains the classes needed to work with graphs, nodes and edges and some basic algorithms as building blocks for more complex graph algorithms. Further algorithms are under work. Unfortunately, STL has no support for graphs and graph algorithms. However, graphs are widely used to model complex relational structures. MAINTAINER= Peter Valchev <pvalchev@toxiclinux.org>
2001-01-19 11:33:15 -05:00
o) change maintainer's email address o) move COMMENT into Makefile o) bump NEED_VERSION
2001-03-24 07:51:47 -05:00
MAINTAINER= Peter Valchev <pvalchev@home.com>
Graph Template Library (GTL) is based on the Standart Template Library (STL), which is supposed to become a part of the C++ standart library and therefore is an ideal basis when writing portable programs. For the design of the GTL's API the API of LEDA is used as a base. GTL contains the classes needed to work with graphs, nodes and edges and some basic algorithms as building blocks for more complex graph algorithms. Further algorithms are under work. Unfortunately, STL has no support for graphs and graph algorithms. However, graphs are widely used to model complex relational structures. MAINTAINER= Peter Valchev <pvalchev@toxiclinux.org>
2001-01-19 11:33:15 -05:00
upgrade to GTL 1.0.0 - WITH THE RELEASE THE DOWNLOAD POLICY FOR GTL HAS BEEN CHANGED. PLEASE SEE THE HOMEPAGE FOR THE DETAILS. - First stable release - Various bugfixes - Optimization of reallocation procedure in node_ and edge_maps - Bump NEED_VERSION from maintainer
2001-02-09 05:05:30 -05:00
PERMIT_PACKAGE_CDROM= "use requires written permission"
PERMIT_PACKAGE_FTP= "use requires written permission"
PERMIT_DISTFILES_CDROM= "use requires written permission"
PERMIT_DISTFILES_FTP= "use requires written permission"
Graph Template Library (GTL) is based on the Standart Template Library (STL), which is supposed to become a part of the C++ standart library and therefore is an ideal basis when writing portable programs. For the design of the GTL's API the API of LEDA is used as a base. GTL contains the classes needed to work with graphs, nodes and edges and some basic algorithms as building blocks for more complex graph algorithms. Further algorithms are under work. Unfortunately, STL has no support for graphs and graph algorithms. However, graphs are widely used to model complex relational structures. MAINTAINER= Peter Valchev <pvalchev@toxiclinux.org>
2001-01-19 11:33:15 -05:00
HOMEPAGE= http://infosun.fmi.uni-passau.de/GTL/
Don't put junk in MASTER_SITES
2001-02-24 12:56:21 -05:00
MASTER_SITES= #see_do-fetch_target
Graph Template Library (GTL) is based on the Standart Template Library (STL), which is supposed to become a part of the C++ standart library and therefore is an ideal basis when writing portable programs. For the design of the GTL's API the API of LEDA is used as a base. GTL contains the classes needed to work with graphs, nodes and edges and some basic algorithms as building blocks for more complex graph algorithms. Further algorithms are under work. Unfortunately, STL has no support for graphs and graph algorithms. However, graphs are widely used to model complex relational structures. MAINTAINER= Peter Valchev <pvalchev@toxiclinux.org>
2001-01-19 11:33:15 -05:00
CONFIGURE_STYLE= gnu
upgrade to GTL 1.0.0 - WITH THE RELEASE THE DOWNLOAD POLICY FOR GTL HAS BEEN CHANGED. PLEASE SEE THE HOMEPAGE FOR THE DETAILS. - First stable release - Various bugfixes - Optimization of reallocation procedure in node_ and edge_maps - Bump NEED_VERSION from maintainer
2001-02-09 05:05:30 -05:00
MAKE_ENV+= GTL_VERS="1.0.0"
do-fetch:
@if [ ! -f ${DISTDIR}/${DISTFILES} ]; then \
echo "" ; \
echo " The source of this port cannot be automatically fetched" ; \
echo " due to licensing restrictions. You MUST visit :" ; \
echo " ${HOMEPAGE}#down" ; \
echo " and follow the instructions - you will have to send e-mail" ; \
echo " with your personal information in order to be accepted." ; \
echo "" ; \
echo " Once ${DISTFILES} has been downloaded, move it to ${DISTDIR}" ; \
echo " and then go back and restart this build." ; \
echo "" ; \
exit 1 ; \
fi
post-install:
Graph Template Library (GTL) is based on the Standart Template Library (STL), which is supposed to become a part of the C++ standart library and therefore is an ideal basis when writing portable programs. For the design of the GTL's API the API of LEDA is used as a base. GTL contains the classes needed to work with graphs, nodes and edges and some basic algorithms as building blocks for more complex graph algorithms. Further algorithms are under work. Unfortunately, STL has no support for graphs and graph algorithms. However, graphs are widely used to model complex relational structures. MAINTAINER= Peter Valchev <pvalchev@toxiclinux.org>
2001-01-19 11:33:15 -05:00
${INSTALL_DATA_DIR} ${PREFIX}/share/doc/gtl
upgrade to GTL 1.0.0 - WITH THE RELEASE THE DOWNLOAD POLICY FOR GTL HAS BEEN CHANGED. PLEASE SEE THE HOMEPAGE FOR THE DETAILS. - First stable release - Various bugfixes - Optimization of reallocation procedure in node_ and edge_maps - Bump NEED_VERSION from maintainer
2001-02-09 05:05:30 -05:00
${INSTALL_DATA} ${WRKSRC}/doc/html/*.html ${PREFIX}/share/doc/gtl
${INSTALL_DATA} ${WRKSRC}/README ${PREFIX}/share/doc/gtl
Graph Template Library (GTL) is based on the Standart Template Library (STL), which is supposed to become a part of the C++ standart library and therefore is an ideal basis when writing portable programs. For the design of the GTL's API the API of LEDA is used as a base. GTL contains the classes needed to work with graphs, nodes and edges and some basic algorithms as building blocks for more complex graph algorithms. Further algorithms are under work. Unfortunately, STL has no support for graphs and graph algorithms. However, graphs are widely used to model complex relational structures. MAINTAINER= Peter Valchev <pvalchev@toxiclinux.org>
2001-01-19 11:33:15 -05:00
.include <bsd.port.mk>
Reference in New Issue Copy Permalink