BSD Ports

devel/p5-Tree-RedBlack 0.5_1 DragonFly

Perl implementation of Red/Black tree, a type of balanced tree

System
DragonFly
Repository
DPorts
Maintainer
[email protected] (as in FreeBSD)
License
ART10
Categories
devel, perl5
Package size
11.3 KiB, 24.1 KiB installed

Description

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().

In the other systems

The newest version among them is 0.5, as upstream numbers it.

SystemPortVersionVulnerabilitiesStatusMaintainerLast update
DragonFlydevel/p5-Tree-RedBlack0.5_1 newestnone known-[email protected]-
FreeBSDdevel/p5-Tree-RedBlack0.5_1 newestnone known-[email protected]-
HardenedBSDdevel/p5-Tree-RedBlack0.5_1 newestno data-[email protected]-
GhostBSDdevel/p5-Tree-RedBlack0.5_1 newestno data-[email protected]-

Install

Binary package:

pkg install p5-Tree-RedBlack

From DPorts:

cd /usr/dports/devel/p5-Tree-RedBlack && make install clean

Dependency graph

Ports that need it on the left, what it needs to run on the right; at most 8 of each. "Dependencies" below lists them all.

Dependencies

Run dependencies 1

No port depends on this one.