| Home | Documentation | Recent | Preferences | Modules | Distributions | Authors |
|
|
| |||||||
| Tree-Authz
inheritance-based authorization scheme |
Tree-AVL
An AVL (balanced binary) tree for time-efficient storage and retrieval of comparable objects |
Tree-Base
a base class for trees |
| Tree-Binary
A Object Oriented Binary Tree for Perl |
Tree-Binary-Dictionary
A dictionary API to a binary tree |
Tree-BPTree
Perl implementation of B+ trees |
| Tree-Builder
Takes path like strings and builds a tree of hashes of hashes. |
Tree-Compat
a compatibility layer for Tree |
Tree-DAG_Node
(super)class for representing nodes in a tree |
| Tree-DAG_Node-Persist
Persist multiple trees in a single db table, preserving child order |
Tree-DAG_Node-XPath
Add XPath support to Tree::DAG_Node |
Tree-Easy
An easy, simple & fast N-ary tree datatype |
| Tree-Family
Represent and visualize a family tree. |
Tree-Fat
Embeddable F-Tree algorithm suite |
Tree-File
store a data structure in a file tree |
| Tree-FP
Perl implementation of the FP-Tree SYNOPSIS use Tree:FP; $fptree = Tree::FP->new('a','b','c'); $insert_successful = $fptree->insert_tree('c','a','b'); $decimal_support = $fptree->support; $fptree->set_support(0.3); $decimal_confidence = $fptree->confidenc |
Tree-M
implement M-trees for efficient "metric/multimedia-searches" |
Tree-MultiNode
lib/Tree/MultiNode.pm |
| Tree-Nary
Perl implementation of N-ary search trees |
Tree-Nary-Extended
Tree::Nary with substantial load/save from/to sql/hash |
Tree-Node
Memory-efficient tree nodes in Perl |
| Tree-Numbered-DB
a tree that is stored in / tied to a DB table. |
Tree-Numbered-Tools
Perl module to create tree objects using different sources. |
Tree-Parser
Module to parse formatted files into tree structures |
| Tree-Persist
|
Tree-Predicate
a balanced, splittable tree for SQL predicates |
Tree-PseudoIncLib
Perl class encapsulating a description of pseudo-INC array. |
| Tree-R
Perl extension for the Rtree data structure and algorithms |
Tree-RB
Perl implementation of the Red/Black tree, a type of balanced binary search tree. |
Tree-RedBlack
Perl implementation of Red/Black tree, a type of balanced tree. |
| Tree-Simple
A simple tree object |
Tree-Simple-Manager
A class for managing multiple Tree::Simple hierarchies |
Tree-Simple-SAX
A set of classes for using Tree::Simple with XML |
| Tree-Simple-View
A set of classes for viewing Tree::Simple hierarchies |
Tree-Simple-VisitorFactory
A factory object for dispensing Visitor objects |
Tree-Suffix
Perl interface to the libstree library. |
| Tree-Template-Declare
easily build tree structures |
Tree-Ternary
Perl implementation of ternary search trees |
Tree-Ternary_XS
XS implementation of ternary search trees |
| Tree-Transform-XSLTish
transform tree data, like XSLT but in Perl |
Tree-Trie
A data structure optimized for prefix lookup. |
Tree-Visualize
A module for visualizing Tree structures |
| Tree-XPathEngine
a re-usable XPath engine |
| Problems, suggestions, or comments to Randy Kobes. | Questions? Check the FAQ. | |
| Enable installations using PAR::WebStart. |