Hash Tree

Tie::Hash::RegexKeys will match hash keys using Regular Expressions. SYNOPSIS use Tie::Hash::RegexKeys; use Data::Dumper; my %h; tie %h, Tie::Hash::RegexKeys; my $a = .1.2.3.4.5.6.2; my $b = .1.2.3.4.5.7; my $c = .1.2.3.4.5.6.1; my $d = .1.2.3.4.5.6.1.6; $h{$a}="key1";... Platforms: *nix

HTML::Tree::AboutObjects is an article: "Users View of Object-Oriented Modules". SYNOPSIS # This an article, not a module. The following article by Sean M. Burke first appeared in The Perl Journal #17 and is copyright 2000 The Perl Journal. It appears courtesy of Jon Orwant and The Perl... Platforms: *nix

Bio::Tree::DistanceFactory is a Perl module to construct a tree using distance based methods. SYNOPSIS use Bio::Tree::DistanceFactory; use Bio::AlignIO; use Bio::Align::DNAStatistics; my $tfactory = Bio::Tree::DistanceFactory->new(-method => "NJ"); my $stats =... Platforms: *nix

Bio::Tree::Tree is an implementation of TreeI interface. SYNOPSIS # like from a TreeIO my $treeio = new Bio::TreeIO(-format => newick, -file => treefile.dnd); my $tree = $treeio->next_tree; my @nodes = $tree->get_nodes; my $root = $tree->get_root_node; This object holds handles to Nodes... Platforms: *nix

Basset::Container::Hash Perl module implements a layered hash. The easiest way to explain is with an example: my %x = (a => b); tie my %y, Basset::Container::Hash, %x; #<- %x is the parent of y. print $x{a}; #prints b print $y{a}; #prints b (inherited from x) $y{a} = foo; $y{z} = bar;... Platforms: *nix

Tie::Hash::Sorted Perl module presents hashes in sorted order. SYNOPSIS use Tie::Hash::Sorted; my %ages = ( John => 33, Jacob => 29, Jingle => 15, Heimer => 48, Smitz => 12, ); my $sort_by_numeric_value = sub { my $hash = shift; [ sort {$hash->{$b} <=> $hash->{$a}} keys %$hash ];... Platforms: *nix

Hash::Type module contains pseudo-hashes as arrays tied to a "type" (list of fields). SYNOPSIS use Hash::Type; # create a Hash::Type my $personType = new Hash::Type(qw(firstname lastname city)); # create and populate some hashes tied to $personType tie %wolfgang, $personType, "wolfgang... Platforms: *nix

Class::Method::hash is a Perl module that helps you create methods for handling a hash value. SYNOPSIS use Class::MethodMaker [ hash => [qw/ x /] ]; $instance->x; # empty $instance->x(a => 1, b => 2, c => 3); $instance->x_count == 3; # true $instance->x = (b => 5, d => 8); # Note this... Platforms: *nix

Tie::Proxy::Hash is a Perl module created to efficiently merge & translate hashes. SYNOPSIS my (%hash, $ref); $ref = tie %hash, Tie::Proxy::Hash, (bart => +{a => 1, b => 2}, maggie => +{a => 5, c => 6, e => 10}, ); $hash{a} == 1; # true $hash{b} == 2; # true (bart supercedes maggie)... Platforms: *nix

Hash::Merge Perl module merges arbitrarily deep hashes into a single hash. SYNOPSIS use Hash::Merge qw( merge ); my %a = ( foo => 1, bar => [ qw( a b e ) ], querty => { bob => alice }, ); my %b = ( foo => 2, bar => [ qw(c d) ], querty => { ted => margeret }, ); my %c = %{ merge(... Platforms: *nix

Tie::Hash::Stack is a Perl module which maintains an array of hashes like a stack. SYNOPSIS use Tie::Hash::Stack qw(pop_hash push_hash merge_hash); my %hash; tie( %hash, "Tie::Hash::Stack" ); # Ties the hash $hash{ 1 } = "one"; $hash{ 2 } = "two"; $hash{ 3 } = "three"; push_hash... Platforms: *nix

Tree::XPathEngine is a re-usable XPath engine. This module provides an XPath engine, that can be re-used by other module/classes that implement trees. It is designed to be compatible with Class::XPath, ie it passes its tests if you replace Class::XPath by Tree::XPathEngine. This code is a... Platforms: *nix

Hash::Diff::Dispatch allows to execute code depending on difference between hashes. SYNOPSIS my $hash_watcher = Hash::Diff::Dispatch->new( {}, # Sets the starting hash # The events will be called using the order returned # by calling keys on these values... b => &bold, i => &italic,... Platforms: *nix

Tree::Visualize is a Perl module for visualizing Tree structures. SYNOPSIS use Tree::Visualize; use Tree::Binary; my $tree = Tree::Binary->new("*") ->setLeft( Tree::Binary->new("+") ->setLeft(Tree::Binary->new("2")) ->setRight(Tree::Binary->new("2")) ) ->setRight(... Platforms: *nix

Tree::Binary is a Object Oriented Binary Tree for Perl. SYNOPSIS use Tree::Binary; # a tree representaion of the expression: # ((2 + 2) * (4 + 5)) my $btree = Tree::Binary->new("*") ->setLeft( Tree::Binary->new("+") ->setLeft(Tree::Binary->new("2")) ->setRight(Tree::Binary->new("2"))... Platforms: *nix

Tree::Simple::SAX is a set of classes for using Tree::Simple with XML. SYNOPSIS use Tree::Simple::SAX; use XML::SAX::ParserFactory; my $handler = Tree::Simple::SAX::Handler->new(Tree::Simple->new()); my $p = XML::SAX::ParserFactory->parser(Handler => $handler); $p->parse_string(... Platforms: *nix

Ports Tree Explorer (PTE) is a small tool that allows you to navigate through your /usr/ports tree, showing you information about a selected port, tree view, software categories (/usr/ports main dirs) and finally allows you to install a selected port using childs for the installation. PTE... Platforms: *nix

HTML::Tree::Scanning contains an article: "Scanning HTML". SYNOPSIS # This an article, not a module. The following article by Sean M. Burke first appeared in The Perl Journal #19 and is copyright 2000 The Perl Journal. It appears courtesy of Jon Orwant and The Perl Journal. This document... Platforms: *nix

HTML::Tree::AboutTrees is a article on tree-shaped data structures in Perl. This an article, not a module. The following article by Sean M. Burke first appeared in The Perl Journal #18 and is copyright 2000 The Perl Journal. It appears courtesy of Jon Orwant and The Perl Journal. This... Platforms: *nix

B::Tree is a simplified version of B::Graph for demonstration. SYNOPSIS perl -MO=Tree program | dot -Tps > tree.ps This is a very cut-down version of B::Graph; it generates minimalist tree graphs of the op tree of a Perl program, merely connecting the op nodes and labelling each node with... Platforms: *nix