freebsd-ports/databases/p5-DBIx-Class-Tree/Makefile

# New ports collection makefile for:	DBIx::Class::Tree
# Date created:		17 Mar 2011
# Whom:			Jun Kuriyama <kuriyama@FreeBSD.org>
#
# $FreeBSD$
#

PORTNAME=	DBIx-Class-Tree
PORTVERSION=	0.03003
CATEGORIES=	databases perl5
MASTER_SITES=	CPAN
PKGNAMEPREFIX=	p5-

MAINTAINER=	kuriyama@FreeBSD.org
COMMENT=	Perl extension to manipulate and analyze tree structured data

RUN_DEPENDS=	\
	p5-DBIx-Class>=0.08100:${PORTSDIR}/databases/p5-DBIx-Class
BUILD_DEPENDS:=	${RUN_DEPENDS}
TEST_DEPENDS=	p5-Test-Exception>=0:${PORTSDIR}/devel/p5-Test-Exception \
		p5-DBD-SQLite>=0:${PORTSDIR}/databases/p5-DBD-SQLite

PERL_CONFIGURE=	yes

MAN3=	DBIx::Class::Tree.3 \
	DBIx::Class::Tree::AdjacencyList.3 \
	DBIx::Class::Tree::AdjacencyList::Ordered.3

.include <bsd.port.mk>
This module provides methods for working with adjacency lists. The adjacency list model is a very common way of representing a tree structure. In this model each row in a table has a prent ID column that references the primary key of another row in the same table. Because of this the primary key must only be one column and is usually some sort of integer. The row with a parent ID of 0 is the root node and is usually the parent of all other rows. Although, there is no limitation in this module that would stop you from having multiple root nodes. WWW: http://search.cpan.org/dist/DBIx-Class-Tree/ 2011-03-18 02:22:11 +01:00			`# New ports collection makefile for: DBIx::Class::Tree`
			`# Date created: 17 Mar 2011`
			`# Whom: Jun Kuriyama <kuriyama@FreeBSD.org>`
			`#`
			`# $FreeBSD$`
			`#`

			`PORTNAME= DBIx-Class-Tree`
			`PORTVERSION= 0.03003`
			`CATEGORIES= databases perl5`
			`MASTER_SITES= CPAN`
			`PKGNAMEPREFIX= p5-`

			`MAINTAINER= kuriyama@FreeBSD.org`
Fix typos in COMMENT 2012-07-24 09:19:21 +02:00			`COMMENT= Perl extension to manipulate and analyze tree structured data`
This module provides methods for working with adjacency lists. The adjacency list model is a very common way of representing a tree structure. In this model each row in a table has a prent ID column that references the primary key of another row in the same table. Because of this the primary key must only be one column and is usually some sort of integer. The row with a parent ID of 0 is the root node and is usually the parent of all other rows. Although, there is no limitation in this module that would stop you from having multiple root nodes. WWW: http://search.cpan.org/dist/DBIx-Class-Tree/ 2011-03-18 02:22:11 +01:00
			`RUN_DEPENDS= \`
			`p5-DBIx-Class>=0.08100:${PORTSDIR}/databases/p5-DBIx-Class`
- Convert all remaining instances of BUILD_DEPENDS=${RUN_DEPENDS} or RUN_DEPENDS=${BUILD_DEPENDS} to use := which portlint has warned about for a while. PR: ports/168208 Approved by: portmgr (miwi) 2012-06-10 20:42:48 +02:00			`BUILD_DEPENDS:= ${RUN_DEPENDS}`
- Add TEST_DEPENDS to enable testing PR: ports/164342 Submitted by: swills (myself) Approved by: maintainer (blanket) 2012-01-29 22:34:01 +01:00			`TEST_DEPENDS= p5-Test-Exception>=0:${PORTSDIR}/devel/p5-Test-Exception \`
			`p5-DBD-SQLite>=0:${PORTSDIR}/databases/p5-DBD-SQLite`
This module provides methods for working with adjacency lists. The adjacency list model is a very common way of representing a tree structure. In this model each row in a table has a prent ID column that references the primary key of another row in the same table. Because of this the primary key must only be one column and is usually some sort of integer. The row with a parent ID of 0 is the root node and is usually the parent of all other rows. Although, there is no limitation in this module that would stop you from having multiple root nodes. WWW: http://search.cpan.org/dist/DBIx-Class-Tree/ 2011-03-18 02:22:11 +01:00
			`PERL_CONFIGURE= yes`

			`MAN3= DBIx::Class::Tree.3 \`
			`DBIx::Class::Tree::AdjacencyList.3 \`
			`DBIx::Class::Tree::AdjacencyList::Ordered.3`

			`.include <bsd.port.mk>`