The Perl Toolchain Summit needs more sponsors. If your company depends on Perl, please support this very important event.

Search results for "tree trie"

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 - Search in distribution

Tree::SEMETrie - Single-Edge Multi-Edge Trie River stage zero No dependents

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

Data::Trie - An implementation of a letter trie River stage zero No dependents

This module implements a letter trie data structure. This is a linked set of nodes representing a set of words. Starting from the root, each letter of an included word is a daughter node of the trie. Hence, if a word is in the trie, there will be a p...

HAMMOND/data-trie-0.01 - 09 Aug 2004 19:39:23 UTC - Search in distribution

FP::Trie - purely functional prefix tree River stage zero No dependents

The trie operations expect an efficiently dissectable sequence (linked list, stream) as the key. Each item denotes the next level in the nested trie levels. The items in the list can be anything with a sensible stringification. To use FP::Trie for st...

PFLANZE/FunctionalPerl-0.72.76 - 22 Jan 2023 15:12:41 UTC - Search in distribution

Net::Patricia - Patricia Trie perl module for fast IP address lookups River stage one • 1 direct dependent • 1 total dependent

This module uses a Patricia Trie data structure to quickly perform IP address prefix matching for applications such as IP subnet, network or routing table lookups. The data structure is based on a radix tree using a radix of two, so sometimes you see...

GRUBER/Net-Patricia-1.22 - 15 Oct 2013 19:45:51 UTC - Search in distribution

perl5160delta - what is new for perl v5.16.0 River stage five • 11292 direct dependents • 32664 total dependents

This document describes differences between the 5.14.0 release and the 5.16.0 release. If you are upgrading from an earlier release such as 5.12.0, first read perl5140delta, which describes differences between 5.12.0 and 5.14.0. Some bug fixes in thi...

PEVANS/perl-5.38.2 - 29 Nov 2023 16:10:36 UTC - Search in distribution

Text::Scan - Fast search for very large numbers of keys in a body of text. River stage zero No dependents

This module provides facilities for fast searching on strings with very many search keys. The basic object behaves somewhat like a perl hash, except that you can retrieve based on a superstring of any keys stored. Simply scan a string as shown above ...

TBUSCH/Text-Scan-0.31 - 02 Sep 2010 18:42:02 UTC - Search in distribution

Hierarchy River stage zero No dependents

AUDREYT/Perl6-Pugs-6.2.13 - 17 Oct 2006 12:51:53 UTC - Search in distribution

Regexp::Assemble - Assemble multiple Regular Expressions into a single RE River stage two • 27 direct dependents • 88 total dependents

Regexp::Assemble takes an arbitrary number of regular expressions and assembles them into a single regular expression (or RE) that matches all that the individual REs match. As a result, instead of having a large list of expressions to loop over, a t...

RSAVAGE/Regexp-Assemble-0.38 - 19 Jun 2017 23:15:38 UTC - Search in distribution

Net::IPTrie - Perl module for building IPv4 and IPv6 address space hierarchies River stage zero No dependents

This module uses a radix tree (or trie) to quickly build the hierarchy of a given address space (both IPv4 and IPv6). This allows the user to perform fast subnet or routing lookups. It is implemented exclusively in Perl....

CVICENTE/Net-IPTrie-0.7 - 20 Aug 2010 20:45:14 UTC - Search in distribution

SuffixTree - Efficient string manipulation data structure interface for Perl. River stage zero No dependents

The intention of this project is to provide an open-source implementation for an efficient data structure for strings manipulation - the Suffix Tree. The code was written with as much consistency with the theoretical algorithm as possible (see refere...

DAVIDO/SuffixTree-0.07 - 02 Jan 2013 08:43:24 UTC - Search in distribution

CPANPLUS::YACSmoke::ReAssemble - Assemble multiple Regular Expressions into a single RE River stage one • 1 direct dependent • 1 total dependent

Regexp::Assemble takes an arbitrary number of regular expressions and assembles them into a single regular expression (or RE) that matches all that the individual REs match. As a result, instead of having a large list of expressions to loop over, a t...

BINGOS/CPANPLUS-YACSmoke-1.08 - 30 Apr 2019 10:47:51 UTC - Search in distribution

Text::Trie River stage one • 1 direct dependent • 1 total dependent

ILYAZ/Text-Trie-0.21 - 10 Aug 1999 02:02:00 UTC - Search in distribution

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 - Search in distribution

AxKit::App::TABOO::Data::Comment - Comment Data object for TABOO River stage zero No dependents

This Data class contains a comment, which may be posted by any registered user of the site. Each object will also contain an identifier of replies to the comment, that may be replaced with a reference to another comment object....

KJETILK/AxKit-App-TABOO-0.52 - 01 Dec 2007 13:26:02 UTC - Search in distribution

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-4.00 - 18 Aug 2022 16:07:38 UTC - Search in distribution

Term::Bash::Completion::Generator - Generate bash completion scripts River stage one • 2 direct dependents • 5 total dependents

Generate bash completion functions or perl scripts to dynamically provide completion for an application....

NKH/Term-Bash-Completion-Generator-0.02.8 - 14 Jan 2009 17:08:54 UTC - Search in distribution

JCM::Net::Patricia - Patricia Trie perl module for fast IP address lookups River stage zero No dependents

This module uses a Patricia Trie data structure to quickly perform IP address prefix matching for applications such as IP subnet, network or routing table lookups. The data structure is based on a radix tree using a radix of two, so sometimes you see...

JMASLAK/JCM-Net-Patricia-1.05 - 29 Mar 2021 18:10:24 UTC - Search in distribution

Regexp::Parsertron - Parse a Perl regexp into a data structure of type Tree River stage zero No dependents

Parses a regexp into a tree object managed by the Tree module, and provides various methods for updating and retrieving that tree's contents. This module uses Marpa::R2 and Moo....

RSAVAGE/Regexp-Parsertron-1.05 - 21 Nov 2018 22:31:29 UTC - Search in distribution

Net::IP::Match::Trie - Efficiently match IP addresses against IP ranges with Trie (prefix tree) River stage one • 2 direct dependents • 2 total dependents

Net::IP::Match::Trie is XS or Pure Perl implementation of matching IP address against Net ranges. Net::IP::Match::Trie uses Trie (prefix tree) data structure, so very fast lookup time (match_ip) but slow setup (add) time. This module is useful for on...

HIROSE/Net-IP-Match-Trie-1.00 - 28 Nov 2013 06:25:44 UTC - Search in distribution
21 results (0.056 seconds)