From b4924eae4d66dc341883ee88027d64dd331a1ca8 Mon Sep 17 00:00:00 2001 From: Torsten Veller Date: Sun, 25 Oct 2009 20:16:03 +0000 Subject: Remove drizzt from metadata.xml (#149111) (Portage version: 2.2_rc46/cvs/Linux x86_64) --- dev-ruby/rbtree/ChangeLog | 5 ++++- dev-ruby/rbtree/metadata.xml | 4 ---- 2 files changed, 4 insertions(+), 5 deletions(-) (limited to 'dev-ruby') diff --git a/dev-ruby/rbtree/ChangeLog b/dev-ruby/rbtree/ChangeLog index ad3e05a8cda2..d3aa590ea2df 100644 --- a/dev-ruby/rbtree/ChangeLog +++ b/dev-ruby/rbtree/ChangeLog @@ -1,6 +1,9 @@ # ChangeLog for dev-ruby/rbtree # Copyright 1999-2009 Gentoo Foundation; Distributed under the GPL v2 -# $Header: /var/cvsroot/gentoo-x86/dev-ruby/rbtree/ChangeLog,v 1.1 2009/03/21 16:04:36 drizzt Exp $ +# $Header: /var/cvsroot/gentoo-x86/dev-ruby/rbtree/ChangeLog,v 1.2 2009/10/25 20:16:03 tove Exp $ + + 25 Oct 2009; Torsten Veller metadata.xml: + Remove drizzt from metadata.xml (#149111) *rbtree-0.2.1 (21 Mar 2009) diff --git a/dev-ruby/rbtree/metadata.xml b/dev-ruby/rbtree/metadata.xml index 628faf993146..837254783903 100644 --- a/dev-ruby/rbtree/metadata.xml +++ b/dev-ruby/rbtree/metadata.xml @@ -2,10 +2,6 @@ ruby - -drizzt@gentoo.org -Timothy Redaelli - RBTree is a sorted associative collection that is implemented with Red-Black Tree. The elements of RBTree are ordered and its interface is the almost same as Hash, so simply you can consider RBTree sorted Hash. -- cgit v1.2.3-65-gdbad