Tree-RB-0.3

Arun Prasaad /

Tree-RB-0.3

Changes for version 0.3

Tree iteration is now seekable. Hash iteration is now seekable and reversible. Use enum as it leads to more natural syntax than constant.

Perl implementation of the Red/Black tree, a type of balanced binary search tree.

A node class for implementing Red/Black trees

Tree::RB guts

To install Tree::RB, copy and paste the appropriate command in to your terminal.

cpanm Tree::RB

perl -MCPAN -e shell
install Tree::RB

For more information on module installation, please visit the detailed CPAN module installation guide.

	Global
`s`	Focus search bar
`?`	Bring up this help dialog

	GitHub
`g` `p`	Go to pull requests
`g` `i`	go to github issues (only if github is preferred repository)

	Search terms
module: (e.g. module:Plugin)
distribution: (e.g. distribution:Dancer auth)
author: (e.g. author:SONGMU Redis)
version: (e.g. version:1.00)