Tree::Fast The fastest possible implementation of a tree in pure Perl
Download

Tree::Fast Ranking & Summary

Tree::Fast Tags

Perl module Tree perl class Perl tree

Tree::Fast Description

The fastest possible implementation of a tree in pure Perl Tree::Fast is the fastest possible implementation of a tree in pure Perl.SYNOPSIS my $tree = Tree->new( 'root' ); my $child = Tree->new( 'child' ); $tree->add_child( {}, $child ); $tree->add_child( { at => 0 }, Tree->new( 'first child' ) ); $tree->add_child( { at => -1 }, Tree->new( 'last child' ) ); my @children = $tree->children; my @some_children = $tree->children( 0, 2 ); $tree->remove_child( 0 ); my @nodes = $tree->traverse( $tree->POST_ORDER ); my $traversal = $tree->traverse( $tree->POST_ORDER ); while ( my $node = $traversal->() ) { # Do something with $node here } my $clone = $tree->clone; my $mirror = $tree->clone->mirror;This is meant to be the core implementation for Tree, stripped down as much as possible. There is no error-checking, bounds-checking, event-handling, convenience methods, or anything else of the sort. If you want something fuller- featured, please look at Tree, which is a wrapper around Tree::Fast. Requirements: · Perl

Tree::Fast Related Software