sync/ports
1
0
Fork 0
mirror of https://git.freebsd.org/ports.git synced 2025-07-18 01:39:16 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions

Add p5-AI-Pathfinding-AStar 0.02, Perl implementation of the

Browse source 
A* pathfinding algorithm.

PR:		ports/71014
Submitted by:	Aaron Dalton <aaron@daltons.ca>
This commit is contained in:
Mathieu Arnold 2004-08-27 09:32:45 +00:00
parent eb7041b464
commit 705fc971df
Notes: svn2git 2021-03-31 03:12:20 +00:00 
svn path=/head/; revision=117398
5 changed files with 51 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
devel/Makefile
View file

@ -576,6 +576,7 @@
SUBDIR += p4db
SUBDIR += p4delta
SUBDIR += p4v
SUBDIR += p5-AI-Pathfinding-AStar
SUBDIR += p5-Agent
SUBDIR += p5-Algorithm-Annotate
SUBDIR += p5-Algorithm-Cluster

31
devel/p5-AI-Pathfinding-AStar/Makefile Normal file
View file

@ -0,0 +1,31 @@
# New ports collection makefile for: AI::Pathfinding::AStar
# Date created: 26 August 2004
# Whom: Aaron Dalton <aaron@daltons.ca>
#
# $FreeBSD$
#
PORTNAME= AI-Pathfinding-AStar
PORTVERSION= 0.02
CATEGORIES= devel perl5
MASTER_SITES= ${MASTER_SITE_PERL_CPAN}
MASTER_SITE_SUBDIR= AI
PKGNAMEPREFIX= p5-
MAINTAINER= aaron@daltons.ca
COMMENT= Perl implementation of the A* pathfinding algorithm
BUILD_DEPENDS= ${SITE_PERL}/Heap/Simple.pm:${PORTSDIR}/devel/p5-Heap-Simple
RUN_DEPENDS= ${BUILD_DEPENDS}
PERL_CONFIGURE= yes
MAN3= AI::Pathfinding::AStar.3
.include <bsd.port.pre.mk>
.if ${PERL_LEVEL} < 500600
IGNORE= Uses devel/p5-Heap-Simple, which requires perl5.6, install lang/perl5 or lang/perl5.8
.endif
.include <bsd.port.post.mk>

2
devel/p5-AI-Pathfinding-AStar/distinfo Normal file
View file

@ -0,0 +1,2 @@
MD5 (AI-Pathfinding-AStar-0.02.tar.gz) = 679867a36718f5c9a6bb7bd2d6a28994
SIZE (AI-Pathfinding-AStar-0.02.tar.gz) = 4697

10
devel/p5-AI-Pathfinding-AStar/pkg-descr Normal file
View file

@ -0,0 +1,10 @@
This module implements the A* pathfinding algorithm. It acts as a base class
from which a custom map object can be derived. It requires from the map object
a subroutine named "getSurrounding" and provides to the object a routine called
"findPath" which calculates the shortest (ie. least-expensive) path between two
nodes.
WWW: http://search.cpan.org/dist/AI-Pathfinding-AStar/
- Aaron Dalton
aaron@daltons.ca

7
devel/p5-AI-Pathfinding-AStar/pkg-plist Normal file
View file

@ -0,0 +1,7 @@
%%SITE_PERL%%/AI/Pathfinding/AStar.pm
%%SITE_PERL%%/%%PERL_ARCH%%/auto/AI/Pathfinding/AStar/.packlist
@dirrm %%SITE_PERL%%/%%PERL_ARCH%%/auto/AI/Pathfinding/AStar
@unexec rmdir %D/%%SITE_PERL%%/%%PERL_ARCH%%/auto/AI/Pathfinding 2>/dev/null || true
@unexec rmdir %D/%%SITE_PERL%%/%%PERL_ARCH%%/auto/AI 2>/dev/null || true
@unexec rmdir %D/%%SITE_PERL%%/AI/Pathfinding 2>/dev/null || true
@unexec rmdir %D/%%SITE_PERL%%/AI 2>/dev/null || true