From owner-cvs-all@FreeBSD.ORG Mon May 8 14:25:26 2006 Return-Path: X-Original-To: cvs-all@FreeBSD.org Delivered-To: cvs-all@FreeBSD.org Received: from mx1.FreeBSD.org (mx1.freebsd.org [216.136.204.125]) by hub.freebsd.org (Postfix) with ESMTP id 69D4116A4F5; Mon, 8 May 2006 14:25:26 +0000 (UTC) (envelope-from mnag@FreeBSD.org) Received: from repoman.freebsd.org (repoman.freebsd.org [216.136.204.115]) by mx1.FreeBSD.org (Postfix) with ESMTP id 489EE43D76; Mon, 8 May 2006 14:25:19 +0000 (GMT) (envelope-from mnag@FreeBSD.org) Received: from repoman.freebsd.org (localhost [127.0.0.1]) by repoman.freebsd.org (8.13.1/8.13.1) with ESMTP id k48EPJR8025332; Mon, 8 May 2006 14:25:19 GMT (envelope-from mnag@repoman.freebsd.org) Received: (from mnag@localhost) by repoman.freebsd.org (8.13.1/8.13.1/Submit) id k48EPJRM025331; Mon, 8 May 2006 14:25:19 GMT (envelope-from mnag) Message-Id: <200605081425.k48EPJRM025331@repoman.freebsd.org> From: Marcus Alves Grando Date: Mon, 8 May 2006 14:25:19 +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/py-rbtree Makefile distinfo pkg-descr ports/devel/py-rbtree/files patch-src__rbtree_impl.c X-BeenThere: cvs-all@freebsd.org X-Mailman-Version: 2.1.5 Precedence: list List-Id: CVS commit messages for the entire tree List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 08 May 2006 14:25:26 -0000 mnag 2006-05-08 14:25:19 UTC FreeBSD ports repository Modified files: devel Makefile Added files: devel/py-rbtree Makefile distinfo pkg-descr devel/py-rbtree/files patch-src__rbtree_impl.c Log: - New port devel/py-rbtree An RBTree is a fast, balanced efficient data structure with the following properties: get O(log n) set O(log n) delete O(log n) min O(log n) max O(log n) contains O(log n) Because the worst case timing is minimal across the range of standard dict and ordered data operations it makes sense to use this when you have volatile/dynamic sorted data. In common usage its nearly as fast as the Python dict impl but has a slightly more expensive usage of the compare function as the keys are ordered and not hashed. WWW: http://www.python.org/pypi/RBTree/ Revision Changes Path 1.2196 +1 -0 ports/devel/Makefile 1.1 +40 -0 ports/devel/py-rbtree/Makefile (new) 1.1 +3 -0 ports/devel/py-rbtree/distinfo (new) 1.1 +37 -0 ports/devel/py-rbtree/files/patch-src__rbtree_impl.c (new) 1.1 +19 -0 ports/devel/py-rbtree/pkg-descr (new)