From owner-cvs-all@FreeBSD.ORG Tue Sep 20 08:56:56 2011 Return-Path: Delivered-To: cvs-all@FreeBSD.org Received: from mx1.freebsd.org (mx1.freebsd.org [IPv6:2001:4f8:fff6::34]) by hub.freebsd.org (Postfix) with ESMTP id 00178106564A; Tue, 20 Sep 2011 08:56:55 +0000 (UTC) (envelope-from sunpoet@FreeBSD.org) Received: from repoman.freebsd.org (repoman.freebsd.org [IPv6:2001:4f8:fff6::29]) by mx1.freebsd.org (Postfix) with ESMTP id E3B8B8FC13; Tue, 20 Sep 2011 08:56:55 +0000 (UTC) Received: from repoman.freebsd.org (localhost [127.0.0.1]) by repoman.freebsd.org (8.14.4/8.14.4) with ESMTP id p8K8utJn096909; Tue, 20 Sep 2011 08:56:55 GMT (envelope-from sunpoet@repoman.freebsd.org) Received: (from sunpoet@localhost) by repoman.freebsd.org (8.14.4/8.14.4/Submit) id p8K8utTn096908; Tue, 20 Sep 2011 08:56:55 GMT (envelope-from sunpoet) Message-Id: <201109200856.p8K8utTn096908@repoman.freebsd.org> From: Sunpoet Po-Chuan Hsieh Date: Tue, 20 Sep 2011 08:56:55 +0000 (UTC) To: ports-committers@FreeBSD.org, cvs-ports@FreeBSD.org, cvs-all@FreeBSD.org X-FreeBSD-CVS-Branch: HEAD Cc: Subject: cvs commit: ports/devel Makefile ports/devel/p5-Tree-RedBlack Makefile distinfo pkg-descr pkg-plist X-BeenThere: cvs-all@freebsd.org X-Mailman-Version: 2.1.5 Precedence: list List-Id: **OBSOLETE** CVS commit messages for the entire tree List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 20 Sep 2011 08:56:56 -0000 sunpoet 2011-09-20 08:56:55 UTC FreeBSD ports repository Modified files: devel Makefile Added files: devel/p5-Tree-RedBlack Makefile distinfo pkg-descr pkg-plist Log: - Add p5-Tree-RedBlack 0.5 Tree::RedBlack is a perl implementation of the Red/Black tree algorithm found in the book "Algorithms", by Cormen, Leiserson & Rivest (more commonly known as "CLR" or "The White Book"). A Red/Black tree is a binary tree which remains "balanced"- that is, the longest length from root to a node is at most one more than the shortest such length. It is fairly efficient; no operation takes more than O(lg(n)) time. A Tree::RedBlack object supports the following methods: new(), root(), cmp(&), insert($, $), delete($), find($), node($), min() and max(). WWW: http://search.cpan.org/dist/Tree-RedBlack/ Revision Changes Path 1.4555 +1 -0 ports/devel/Makefile 1.1 +23 -0 ports/devel/p5-Tree-RedBlack/Makefile (new) 1.1 +2 -0 ports/devel/p5-Tree-RedBlack/distinfo (new) 1.1 +11 -0 ports/devel/p5-Tree-RedBlack/pkg-descr (new) 1.1 +7 -0 ports/devel/p5-Tree-RedBlack/pkg-plist (new)