Tree - An N-ary tree River stage two • 10 direct dependents • 14 total dependents

This is meant to be a full-featured N-ary tree representation with configurable error-handling and a simple events system that allows for transparent persistence to a variety of datastores. It is derived from Tree::Simple, but has a simpler interface...

RSAVAGE/Tree-1.14 - 03 Jun 2019 23:43:11 UTC

Tree::Fast - the fastest possible implementation of a tree in pure Perl River stage two • 10 direct dependents • 14 total dependents

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 loo...

RSAVAGE/Tree-1.14 - 03 Jun 2019 23:43:11 UTC

Bio::Tree::Tree - An implementation of the TreeI interface. River stage two • 74 direct dependents • 79 total dependents

This object holds handles to Nodes which make up a tree....

CJFIELDS/BioPerl-1.7.7 - 07 Dec 2019 19:47:42 UTC

B::Tree - Simplified version of B::Graph for demonstration River stage zero No dependents

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 the type of op. It was written as an example of how to write compiler mod...

SIMON/B-Tree-0.02 - 29 Nov 2000 12:36:59 UTC

Tree::R - Perl extension for the R-tree data structure and algorithms River stage one • 3 direct dependents • 6 total dependents

R-tree is a data structure for storing and indexing and efficiently looking up non-zero-size spatial objects. EXPORT None by default....

AJOLMA/Tree-R-0.072 - 14 Sep 2015 08:50:59 UTC

Tree::M - implement M-trees for efficient "metric/multimedia-searches" River stage zero No dependents

(not yet) Ever had the problem of managing multi-dimensional (spatial) data but your database only had one-dimensional indices (b-tree etc.)? Queries like select data from table where latitude > 40 and latitude < 50 and longitude> 50 and longitude< 6...

MLEHMANN/Tree-M-0.031 - 03 Mar 2005 17:56:08 UTC

Tree::RB - Perl implementation of the Red/Black tree, a type of balanced binary search tree. River stage one • 1 direct dependent • 1 total dependent

This is a Perl implementation of the Red/Black tree, a type of balanced binary search tree. A tied hash interface is also provided to allow ordered hashes to be used. See the Wikipedia article at <http://en.wikipedia.org/wiki/Red-black_tree> for furt...

ARUNBEAR/Tree-RB-0.500006 - 07 Oct 2017 13:34:31 UTC

Tree::BK - Structure for efficient fuzzy matching River stage zero No dependents

The Burkhard-Keller, or BK tree, is a structure for efficiently performing fuzzy matching. By default, this module assumes string input and uses "distance" in Text::Levenshtein::XS to compare items and build the tree. However, a subroutine giving the...

NGLENN/Tree-BK-0.02 - 11 Oct 2014 08:52:11 UTC

Tk::Tree - Create and manipulate Tree widgets River stage zero No dependents

The Tree method creates a new window and makes it into a Tree widget and return a reference to it. Additional options, described above, may be specified on the command line or in the option database to configure aspects of the Tree widget such as its...

CTDEAN/Tk-Tree-0.05 - 13 Jan 1998 08:43:11 UTC

Tree::VP - Vantage-Point Tree builder and searcher. River stage zero No dependents

GUGOD/Tree-VP-0.05 - 11 Jul 2016 21:05:48 UTC

TM::Tree - Topic Maps, trait for induced tree retrieval River stage one • 3 direct dependents • 3 total dependents

Obviously, topic maps can carry information which is tree structured. A family pedigree is a typical example of it; associations having a particular type, particular roles and you can derive a tree structure from that. This is exactly what this opera...

DRRHO/TM-1.56 - 08 Nov 2010 06:58:01 UTC

TAP::Tree - TAP (Test Anything Protocol) parser which supported the subtest River stage zero No dependents

TAP::Tree is a simple parser of TAP which supported the subtest. It parses the data of a TAP format to the data of tree structure. Moreover, the iterator for complicated layered tree structure is also prepared....

MAGNOLIA/TAP-Tree-v0.0.5 - 10 Jun 2014 13:20:26 UTC

Tree::Fat - Perl Extension to Implement Fat-Node Trees River stage zero No dependents

Implements object-oriented trees using algorithms adapted from b-trees and AVL trees (without resorting to yucky C++). Fat-node trees are not the best for many niche applications but they do have excellent all-terrain performance. TYPE Speed Flexibil...

JPRIT/Tree-Fat-1.111 - 10 Mar 1999 16:10:50 UTC

Tree::AVL - An AVL (balanced binary) tree for time-efficient storage and retrieval of comparable objects River stage one • 1 direct dependent • 1 total dependent

AVL Trees are balanced binary trees, first introduced in "An Algorithm for the Organization of Information" by Adelson-Velskii and Landis in 1962. Balance is kept in an AVL tree during insertion and deletion by maintaining a 'balance' factor in each ...

MBEEBE/Tree-AVL-1.077 - 13 Nov 2014 19:45:54 UTC

Tree::Ops - Tree operations. River stage zero No dependents

Tree operations. Version 20200725. The following sections describe the methods in each functional area of this module. For an alphabetic listing of all methods by name see Index....

PRBRENAN/Tree-Ops-20200725 - 25 Jul 2020 13:37:59 UTC

Log::Tree - lightweight but highly configurable logging class River stage two • 17 direct dependents • 18 total dependents

TEX/Log-Tree-0.18 - 04 Nov 2016 22:24:20 UTC

Pod::Tree - Create a static syntax tree for a POD River stage one • 2 direct dependents • 2 total dependents

"Pod::Tree" parses a POD into a static syntax tree. Applications walk the tree to recover the structure and content of the POD. See "Pod::Tree::Node" for a description of the tree....

MANWAR/Pod-Tree-1.31 - 22 Feb 2019 10:53:09 UTC

PFT::Tree - Filesystem tree mapping a PFT site River stage one • 1 direct dependent • 1 total dependent

The structure is the following: ├── build ├── content │ └── ... ├── inject ├── pft.yaml └── templates Where: "content" is a directory is handled with a "PFT::Content" instance. "pft.yaml" is a configuration file handled with "PFT::Conf" The remaining...

DACAV/PFT-v1.4.1 - 23 Jul 2019 15:14:22 UTC

SVN::Tree - SVN::Fs plus Tree::Path::Class River stage zero No dependents

This module marries Tree::Path::Class to the Perl Subversion bindings, enabling you to traverse the files and directories of Subversion revisions and transactions, termed roots in Subversion API parlance....

MJGARDNER/SVN-Tree-0.005 - 15 Mar 2012 18:22:52 UTC

Sort::Tree - Organize list of objects into parent/child order. River stage zero No dependents

Sort::Tree includes three routines, list_to_tree, tree_to_list and traverse. These are used to organize an unordered list of objects into a tree form. For example, you'd perform a database query to gain a list of folders in a document system, and the...

BRYCE/Sort-Tree-1.09 - 06 May 2004 21:03:17 UTC

447 results (0.025 seconds)