Tree::Trie - A data structure optimized for prefix lookup. River stage one • 3 direct dependents • 8 total dependents

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::SEMETrie - Single-Edge Multi-Edge Trie River stage zero No dependents

MORNINDED/Tree-SEMETrie-0.04 - 14 Dec 2011 22:04:18 UTC

lib/Tree/SEMETrie/Iterator.pm River stage zero No dependents

MORNINDED/Tree-SEMETrie-0.04 - 14 Dec 2011 22:04:18 UTC

Tree::Simple - A simple tree object River stage two • 15 direct dependents • 34 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.34 - 02 Feb 2021 01:26:51 UTC

Net::IPAM::Tree - A CIDR/Block tree library for fast IP lookup with longest-prefix-match. River stage zero No dependents

A module for fast IP-routing-table lookups and IP-ACLs (Access Control Lists). It is NOT a standard patricia-trie implementation. This isn't possible for general blocks not represented by bitmasks. Every tree item is a Net::IPAM::Block or a subclass ...

GAISSMAI/Net-IPAM-Tree-3.00 - 05 Apr 2021 13:02:03 UTC
5 results (0.028 seconds)