Tree::DAG_Node - An N-ary tree River stage two • 25 direct dependents • 55 total dependents

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.31 - 13 Feb 2018 22:19:15 GMT

Tree::DAG_Node::Persist - Persist multiple trees in a single db table, preserving child order River stage one • 1 direct dependent • 1 total dependent

Tree::DAG_Node::Persist reads/writes multiple trees from/to a single database table, where those trees are built using Tree::DAG_Node. See the "FAQ" for details of the table structure....

RSAVAGE/Tree-DAG_Node-Persist-1.12 - 05 May 2016 11:40:09 GMT

Tree::DAG_Node::XPath - Add XPath support to Tree::DAG_Node River stage one • 1 direct dependent • 1 total dependent

This package extends Tree::DAG_Node to add XPath queries to it It adds the findnodes, matches and find methods to the base "Tree::DAG_Node" class. With a little customization it can also add the findnodes_as_string and findvalue methods....

MIROD/Tree-DAG_Node-XPath-0.11 - 24 Aug 2010 17:27:44 GMT

Tree::Template::Declare::DAG_Node - adaptor for Tree::DAG_Node River stage zero No dependents

DAKKAR/Tree-Template-Declare-0.7 - 28 Mar 2015 12:48:42 GMT

lib/Tree/DAG_Node/Persist/Create.pm River stage one • 1 direct dependent • 1 total dependent

RSAVAGE/Tree-DAG_Node-Persist-1.12 - 05 May 2016 11:40:09 GMT

Tree - An N-ary tree River stage two • 9 direct dependents • 10 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 GMT

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

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

DBIx::Tree - Generate a tree from a self-referential database table River stage zero No dependents

When you've got one of those nasty self-referential tables that you want to bust out into a tree, this is the module to check out. Assuming there are no horribly broken nodes in your tree and (heaven forbid) any circular references, this module will ...

RSAVAGE/DBIx-Tree-1.97 - 18 Dec 2014 02:06:05 GMT

Tree::Node - Memory-efficient tree nodes in Perl River stage one • 1 direct dependent • 1 total dependent

This module implements a memory-efficient node type (for trees, skip lists and similar data structures) for Perl. You may ask "Why bother implementing an ordered structure such as a tree when Perl has hashes built-in?" Since Perl is optimized for spe...

RRWO/Tree-Node-0.08 - 20 Jul 2007 09:56:22 GMT

Tree::Simple - A simple tree object River stage three • 17 direct dependents • 708 total dependents

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.33 - 06 Jan 2018 06:10:38 GMT

Tree::Binary - An Object Oriented Binary Tree for Perl River stage one • 2 direct dependents • 2 total dependents

This module is a fully object oriented implementation of a binary tree. Binary trees are a specialized type of tree which has only two possible branches, a left branch and a right branch. While it is possible to use an *n*-ary tree, like Tree::Simple...

RSAVAGE/Tree-Binary-1.08 - 17 Jul 2016 04:43:41 GMT

Tree::Cladogram - Render a cladogram using Imager or Image::Magick River stage zero No dependents

"Tree::Cladogram" provides a mechanism to turn a tree into a cladogram image. The image is generated using Imager or Image::Magic. The image type created is determined by the suffix of the output file. See "What image formats are supported?" for deta...

RSAVAGE/Tree-Cladogram-1.03 - 04 Sep 2016 07:59:14 GMT

Tree::RB::Node - A node class for implementing Red/Black trees River stage one • 1 direct dependent • 1 total dependent

A Tree::RB tree is made up of nodes that are objects of type Tree::RB::Node...

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

Tree::XPathEngine - a re-usable XPath engine River stage one • 5 direct dependents • 9 total dependents

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 more or...

MIROD/Tree-XPathEngine-0.05 - 15 Feb 2006 15:48:34 GMT

Tree::Simple::View - A set of classes for viewing Tree::Simple hierarchies River stage one • 3 direct dependents • 5 total dependents

This serves as an abstract base class to the Tree::Simple::View::* classes. There are two implementing classes included here; Tree::Simple::View::HTML and Tree::Simple::View::DHTML. Other Tree::Simple::View::* classes are also being planned, see the ...

RSAVAGE/Tree-Simple-View-0.19 - 17 Apr 2017 03:12:28 GMT

DBIx::Tree::Persist - Play with Tree and Tree::Persist a la DBIx::Tree River stage zero No dependents

DBIx::Tree::Persist provides sample code for playing with Tree and Tree::Persist a la DBIx::Tree....

RSAVAGE/DBIx-Tree-Persist-1.04 - 08 Nov 2012 03:52:49 GMT

Tickit::Widget::Tree - tree widget implementation for Tickit River stage one • 2 direct dependents • 3 total dependents

NOTE: Versions 0.003 and below used a custom graph management implementation which had various problems with rendering glitches and performance. This version has been rewritten from scratch to use Tree::DAG_Node to handle the tree structure, and as s...

TEAM/Tickit-Widget-Tree-0.114 - 06 Feb 2015 19:39:32 GMT

Tree::Binary::Search - A Binary Search Tree for perl River stage one • 2 direct dependents • 2 total dependents

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.08 - 17 Jul 2016 04:43:41 GMT

Tree::Template::Declare - easily build tree structures River stage zero No dependents

DAKKAR/Tree-Template-Declare-0.7 - 28 Mar 2015 12:48:42 GMT

Tree::Transform::XSLTish - transform tree data, like XSLT but in Perl River stage zero No dependents

This module allows you to transform tree with Perl subroutines, just like XSLT does for XML documents. It tries to model as closely as reasonable the semantic of XSLT....

DAKKAR/Tree-Transform-XSLTish-0.3 - 13 Feb 2011 14:45:10 GMT

21 results (0.033 seconds)