From owner-svn-ports-all@FreeBSD.ORG Sun Mar 8 02:29:39 2015 Return-Path: Delivered-To: svn-ports-all@freebsd.org Received: from mx1.freebsd.org (mx1.freebsd.org [IPv6:2001:1900:2254:206a::19:1]) (using TLSv1.2 with cipher AECDH-AES256-SHA (256/256 bits)) (No client certificate requested) by hub.freebsd.org (Postfix) with ESMTPS id 7E946A7B; Sun, 8 Mar 2015 02:29:39 +0000 (UTC) Received: from svn.freebsd.org (svn.freebsd.org [IPv6:2001:1900:2254:2068::e6a:0]) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (Client did not present a certificate) by mx1.freebsd.org (Postfix) with ESMTPS id 69897855; Sun, 8 Mar 2015 02:29:39 +0000 (UTC) Received: from svn.freebsd.org ([127.0.1.70]) by svn.freebsd.org (8.14.9/8.14.9) with ESMTP id t282Tdf0017984; Sun, 8 Mar 2015 02:29:39 GMT (envelope-from vanilla@FreeBSD.org) Received: (from vanilla@localhost) by svn.freebsd.org (8.14.9/8.14.9/Submit) id t282TcLs017979; Sun, 8 Mar 2015 02:29:38 GMT (envelope-from vanilla@FreeBSD.org) Message-Id: <201503080229.t282TcLs017979@svn.freebsd.org> X-Authentication-Warning: svn.freebsd.org: vanilla set sender to vanilla@FreeBSD.org using -f From: "Vanilla I. Shu" Date: Sun, 8 Mar 2015 02:29:38 +0000 (UTC) To: ports-committers@freebsd.org, svn-ports-all@freebsd.org, svn-ports-head@freebsd.org Subject: svn commit: r380723 - in head/devel: . p5-Tree-Trie X-SVN-Group: ports-head MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit X-BeenThere: svn-ports-all@freebsd.org X-Mailman-Version: 2.1.18-1 Precedence: list List-Id: SVN commit messages for the ports tree List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sun, 08 Mar 2015 02:29:39 -0000 Author: vanilla Date: Sun Mar 8 02:29:37 2015 New Revision: 380723 URL: https://svnweb.freebsd.org/changeset/ports/380723 QAT: https://qat.redports.org/buildarchive/r380723/ Log: Add p5-Tree-Trie 1.9, data structure optimized for prefix lookup. PR: 198100 Submitted by: gebhart@secnetix.de Added: head/devel/p5-Tree-Trie/ head/devel/p5-Tree-Trie/Makefile (contents, props changed) head/devel/p5-Tree-Trie/distinfo (contents, props changed) head/devel/p5-Tree-Trie/pkg-descr (contents, props changed) head/devel/p5-Tree-Trie/pkg-plist (contents, props changed) Modified: head/devel/Makefile Modified: head/devel/Makefile ============================================================================== --- head/devel/Makefile Sun Mar 8 00:35:38 2015 (r380722) +++ head/devel/Makefile Sun Mar 8 02:29:37 2015 (r380723) @@ -3148,6 +3148,7 @@ SUBDIR += p5-Tree-Simple SUBDIR += p5-Tree-Simple-View SUBDIR += p5-Tree-Simple-VisitorFactory + SUBDIR += p5-Tree-Trie SUBDIR += p5-Type-Tie SUBDIR += p5-Type-Tiny SUBDIR += p5-Type-Tiny-XS Added: head/devel/p5-Tree-Trie/Makefile ============================================================================== --- /dev/null 00:00:00 1970 (empty, because file is newly added) +++ head/devel/p5-Tree-Trie/Makefile Sun Mar 8 02:29:37 2015 (r380723) @@ -0,0 +1,16 @@ +# Created by: gebhart@secnetix.de +# $FreeBSD$ + +PORTNAME= Tree-Trie +PORTVERSION= 1.9 +CATEGORIES= devel perl5 +MASTER_SITES= CPAN +PKGNAMEPREFIX= p5- + +MAINTAINER= gebhart@secnetix.de +COMMENT= Data structure optimized for prefix lookup + +USES= perl5 +USE_PERL5= configure + +.include Added: head/devel/p5-Tree-Trie/distinfo ============================================================================== --- /dev/null 00:00:00 1970 (empty, because file is newly added) +++ head/devel/p5-Tree-Trie/distinfo Sun Mar 8 02:29:37 2015 (r380723) @@ -0,0 +1,2 @@ +SHA256 (Tree-Trie-1.9.tar.gz) = cb05722f6d67a99a83f3af1427c5974da7a5509e1416f257aefbc93f3c9682bd +SIZE (Tree-Trie-1.9.tar.gz) = 41528 Added: head/devel/p5-Tree-Trie/pkg-descr ============================================================================== --- /dev/null 00:00:00 1970 (empty, because file is newly added) +++ head/devel/p5-Tree-Trie/pkg-descr Sun Mar 8 02:29:37 2015 (r380723) @@ -0,0 +1,16 @@ +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, the final lookup for the word 'bob' would look +something like $ref->{'b'}{'o'}{'b'}{'00'} (the 00 being an end marker). +Only nodes which would represent words in the trie exist, making the structure +slightly smaller than a hash of the same data set. + +The advantages of the trie over other data storage methods is that lookup times +are O(1) WRT the size of the index. For sparse data sets, it is probably not as +efficient as performing a binary search on a sorted list, and for small files, +it has a lot of overhead. The main advantage (at least from my perspective) is +that it provides a relatively cheap method for finding a list of words in a +large, dense data set which begin with a certain string. + +WWW: http://search.cpan.org/dist/Tree-Trie/ Added: head/devel/p5-Tree-Trie/pkg-plist ============================================================================== --- /dev/null 00:00:00 1970 (empty, because file is newly added) +++ head/devel/p5-Tree-Trie/pkg-plist Sun Mar 8 02:29:37 2015 (r380723) @@ -0,0 +1,2 @@ +%%SITE_PERL%%/Tree/Trie.pm +%%PERL5_MAN3%%/Tree::Trie.3.gz