Search results for "module:Tree::M"
Tree::M - implement M-trees for efficient "metric/multimedia-searches"
(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 - An N-ary tree
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.16 - 24 Jul 2023 00:28:36 UTC
Tree::Ops - Tree operations.
Tree operations. Version 20201030. 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-20201030 - 31 Oct 2020 23:11:16 UTC
Pod::Tree - Create a static syntax tree for a POD
"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
HTML::Tree - build and scan parse-trees of HTML
HTML-Tree is a suite of Perl modules for making parse trees out of HTML source. It consists of mainly two modules, whose documentation you should refer to: HTML::TreeBuilder and HTML::Element. HTML::TreeBuilder is the module that builds the parse tre...
KENTNL/HTML-Tree-5.07 - 31 Aug 2017 08:53:16 UTC
Tree::Trie - A data structure optimized for prefix lookup.
This module implements a trie data structure. The term "trie" comes from the word retrieval, but is generally pronounced like "try". A trie is a tree structure (or directed acyclic graph), the nodes of which represent letters in a word. For example, ...
AVIF/Tree-Trie-1.9 - 02 Dec 2011 00:54:09 UTC
Tree::Simple - A simple tree object
This module in an fully object-oriented implementation of a simple n-ary tree. It is built upon the concept of parent-child relationships, so therefore every Tree::Simple object has both a parent and a set of children (who themselves may have childre...
RSAVAGE/Tree-Simple-1.34 - 02 Feb 2021 01:26:51 UTC
Tree::DAG_Node - An N-ary tree
This class encapsulates/makes/manipulates objects that represent nodes in a tree structure. The tree structure is not an object itself, but is emergent from the linkages you create between nodes. This class provides the methods for making linkages th...
RSAVAGE/Tree-DAG_Node-1.32 - 02 Feb 2021 00:08:31 UTC
Tree::BPTree - Perl implementation of B+ trees
B+ trees are balanced trees which provide an ordered map from keys to values. They are useful for indexing large bodies of data. They are similar to 2-3-4 Trees and Red-Black Trees. This implementation supports B+ trees using an arbitrary *n* value. ...
HANENKAMP/Tree-BPTree-1.08 - 23 Dec 2007 23:43:58 UTC
Tree::DeepClone - A subclass of Tree::Fast which does deep cloning
This module simply adds deep cloning to Tree::Fast. As per the Synopsis, you must use Tree::DeepClone everywhere you want this feature....
RSAVAGE/Tree-1.16 - 24 Jul 2023 00:28:36 UTC
Tree::PseudoIncLib - Perl class encapsulating a description of pseudo-INC array.
Detailed description of Perl library on the system is extremely helpful for every perl developer. It could be benefitial for the system administrator too in order to ensure a proper structure of system libraries. This module encapsulates the descript...
SLAVA/Tree-PseudoIncLib-0.05 - 08 Nov 2004 15:24:25 UTC
XML::Handler::Trees - PerlSAX handlers for building tree structures
XML::Handler::Trees provides three PerlSAX handler classes for building tree structures. XML::Handler::Tree builds the same type of tree as the "Tree" style in XML::Parser. XML::Handler::EasyTree builds the same type of tree as the "EasyTree" style a...
EBOHLMAN/XML-Handler-Trees-0.02 - 20 Nov 2001 03:53:37 UTC
Algorithm::Tree::NCA - Constant time retrieval of Nearest Common Ancestor
This package provides constant-time retrieval of the Nearest Common Ancestor (NCA) of nodes in a tree. The implementation is based on the algorithm by Harel and which can, after linear-time preprocessing, retrieve the nearest common ancestor of two n...
MATKIN/Algorithm-Tree-NCA-0.02 - 14 Nov 2007 11:00:13 UTC
Tree::Binary::Search - A Binary Search Tree for perl
This module implements a binary search tree, which is a specialized usage of a binary tree. The basic principle is that all elements to the left are less than the root, all elements to the right are greater than the root. This reduces the search time...
RSAVAGE/Tree-Binary-1.09 - 01 Feb 2021 23:46:40 UTC
Tree::Nary::Extended - Tree::Nary with substantial load/save from/to sql/hash
This module is not inheriting from Tree::Nary, but adds service methods to the namespace. So it an be seen as an "extended", but a bit "fishy" replacement for Tree::Nary. It loads "Tree::Nary" in the background and relies on some private innerts, whi...
MUENALAN/Tree-Nary-Extended-0.01 - 20 Jul 2003 20:34:26 UTC
DBIx::Tree::NestedSet
This module implements a "Nested Set" parent/child tree, and is focused (at least in my mind) towards offering methods that make developing web applications easier. It should be generally useful, though. See the "SEE ALSO" section for resources that ...
DJCP/DBIx-Tree-NestedSet-0.16 - 09 Sep 2004 02:54:21 UTC
Bio::Tree::Statistics - Calculate certain statistics for a Tree
This should be where Tree statistics are calculated. It was previously where statistics from a Coalescent simulation. It now contains several methods for calculating Tree-Trait statistics....
CJFIELDS/BioPerl-1.7.8 - 03 Feb 2021 05:15:14 UTC
Bio::Tree::Compatible - Testing compatibility of phylogenetic trees with nested taxa.
NB: This module has exclusively class methods that work on Bio::Tree::TreeI objects. An instance of Bio::Tree::Compatible cannot itself represent a tree, and so typically there is no need to create one. Bio::Tree::Compatible is a Perl tool for testin...
CJFIELDS/BioPerl-1.7.8 - 03 Feb 2021 05:15:14 UTC
Bio::Tree::RandomFactory - TreeFactory for generating Random Trees
Builds a random tree every time next_tree is called or up to -maxcount times. This module was originally written for Coalescent simulations see Bio::PopGen::Simulation::Coalescent. I've left the next_tree method intact although it is not generating r...
CJFIELDS/BioPerl-1.7.8 - 03 Feb 2021 05:15:14 UTC
Bio::Tree::DistanceFactory - Construct a tree using distance based methods
This is a factory which will construct a phylogenetic tree based on the pairwise sequence distances for a set of sequences. Currently UPGMA (Sokal and Michener 1958) and NJ (Saitou and Nei 1987) tree construction methods are implemented....
CJFIELDS/BioPerl-1.7.8 - 03 Feb 2021 05:15:14 UTC