SortedSet could then depend on it properly instead of the voodoo code that =
ships with Ruby atm.

Konstantin

On Oct 6, 2011, at 13:22 , B Kelly wrote:

>=20
> Issue #2348 has been updated by B Kelly.
>=20
>=20
> I wholeheartedly agree about the usefulness of the data structure.
>=20
> I'm hesitant to type this, because I don't want to impede RBTree's path t=
oward first-class citizenship.
>=20
> But last time I checked there appeared to be some API deficiencies that s=
ignificantly limited RBTree's potential usefulness:
>=20
> http://blade.nagaokaut.ac.jp/cgi-bin/scat.rb/ruby/ruby-core/28860
> http://blade.nagaokaut.ac.jp/cgi-bin/scat.rb/ruby/ruby-core/28879
>=20
> Although I suppose it's possible these could be addressed at a later date=
?
>=20
>=20
> Regards,
>=20
> Bill
>=20
> ----------------------------------------
> Feature #2348: RBTree Should be Added to the Standard Library
> http://redmine.ruby-lang.org/issues/2348
>=20
> Author: James Gray
> Status: Assigned
> Priority: Normal
> Assignee: Yukihiro Matsumoto
> Category: lib
> Target version: 1.9.x
>=20
>=20
> =3Dbegin
> The merits of this library have been discussed on Ruby core, with the str=
engths best summarized by this post:
>=20
> http://blade.nagaokaut.ac.jp/cgi-bin/scat.rb/ruby/ruby-core/26602
>=20
> RBTree has now been fixed to run on Ruby 1.9:
>=20
> http://github.com/skade/rbtree
>=20
> I think we should now give serious consideration to bringing it into the =
standard library.
> =3Dend
>=20
>=20
>=20
> --=20
> http://redmine.ruby-lang.org
>=20