I would like an order - statistics tree, Which behaves with the same running times as a standard red-black binary search tree.
The Java TreeSet and TreeMap are both red-black trees based on the algorithm from CLRS (Corman Leiserson Rivest Stein), however in looking at the code, it would not be easy to extend these creatures to do what I want (Unless I am missing Something). Most of their underlying left and right rotate methods are private, and could not be extended or augmented with data (such as order stats) easily. However Chapter 14 of [ CLRS ] has the algorithm to do this. 1. Are there any plans to do something like this in either the Math, or Collections sections of Commons? 2. If so how could we get this prioritized, etc. Bryce ____________________________________________________________ Enter for a chance to win one year's supply of allergy relief! http://ad.doubleclick.net/clk;6413623;3807821;f?http://mocda3.com/1/c/563632/125699/307982/307982 This offer applies to U.S. Residents Only --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
