95daa67471
Tree::RedBlack is a perl implementation of the Red/Black tree algorithm found in the book "Algorithms", by Cormen, Leiserson & Rivest (more commonly known as "CLR" or "The White Book"). A Red/Black tree is a binary tree which remains "balanced"- that is, the longest length from root to a node is at most one more than the shortest such length. It is fairly efficient; no operation takes more than O(lg(n)) time. A Tree::RedBlack object supports the following methods: new(), root(), cmp(&), insert($, $), delete($), find($), node($), min() and max(). WWW: http://search.cpan.org/dist/Tree-RedBlack/
23 lines
481 B
Makefile
23 lines
481 B
Makefile
# New ports collection makefile for: p5-Tree-RedBlack
|
|
# Date created: 2011-09-11
|
|
# Whom: Sunpoet Po-Chuan Hsieh <sunpoet@FreeBSD.org>
|
|
#
|
|
# $FreeBSD$
|
|
#
|
|
|
|
PORTNAME= Tree-RedBlack
|
|
PORTVERSION= 0.5
|
|
CATEGORIES= devel perl5
|
|
MASTER_SITES= CPAN
|
|
PKGNAMEPREFIX= p5-
|
|
|
|
MAINTAINER= sunpoet@FreeBSD.org
|
|
COMMENT= Perl implementation of Red/Black tree, a type of balanced tree
|
|
|
|
PERL_CONFIGURE= yes
|
|
|
|
MAN3= Tree::Node.3 \
|
|
Tree::RedBlack.3
|
|
|
|
.include <bsd.port.pre.mk>
|
|
.include <bsd.port.post.mk>
|