Bug#728334: RFP: libtree-rb-perl: Pure-Perl implementation of red-black trees

[Ivan Shmakov <ivan@siamics.net>]

Package: wnpp
Severity: wishlist
X-Debbugs-Cc: debian-perl@lists.debian.org
Tags: rfp

* Package name    : libtree-rb-perl
  Version         : 0.500004
  Upstream Author : Arun Prasaad
* URL             : https://metacpan.org/release/ARUNBEAR/Tree-RB-0.500004
* License         : Perl (GPL-1+ or Artistic)
  Programming Lang: Perl
  Description     : Pure-Perl implementation of red-black trees

	This CPAN distribution is one of just a few implementations of
	self-balancing search trees in Perl.  Indeed, other than this
	one, I know of only Tree::AVL and Tree::RedBlack
	(libtree-redblack-perl.)  And, Tree::RB is better than either!

	Namely, this is the /only/ such implementation that allows for
	“inexact” key matching.

	Specifically, the search trees require that the keys are
	elements from an ordered set.  (Contrary to the Perl hashes, for
	instance.)  So, it feels rather natural to be able to request an
	element whose key is “either 8, or the greatest of those
	available not greater than 8.”  And this implementation provides
	such a feature.

	Other than that, the upstream maintainer appears to be
	responsive, and the package – maintained.  (FWIW, the last
	version came this September.)

	TIA.  (And hope to see this one in Debian soon.)

-- 
FSF associate member #7257