Hi Morgan.
You should read the book:
Introduction to Algorithms
by Cormen, Leiserson & Rivest
In particular, chapter 15 "Augmenting Data Structures" exposes
techniques to decorate balanced binary trees with auxiliary data. The
book both explains the algorithms and the detailed time complexity
analysis.
While these algorithms are quite interesting, the "official" JDK API
documentation does not define any class that provide their
functionality. In other words, you shouldn't encode such an algorithm
in java.util.TreeMap, as the additional functionality is not part of the
specification.
I am not really involved in the Classpath project, so you can take my
opinion for what it is: an opinion. I do not mean that these algorithm
should not be part of Classpath, just that they should probably be
provided in the gnu.util package (or org.gnu.util, or whatever;-).
Have fun!
Etienne
Morgan Schweers wrote:
>
> I want to proffer an algorithm that I came up with (but may not be
> original!), that I'm not completely sure of. I'm not sure of it because
> of two things, one is a general unease about how good my own skills at
> creating new algorithms are, and the second is that it seems 'obvious'
> enough that having not seen it *anywhere* else makes me worried.
>...
--
----------------------------------------------------------------------
Etienne M. Gagnon, M.Sc. e-mail: [EMAIL PROTECTED]
Author of SableCC: http://www.sable.mcgill.ca/sablecc/
----------------------------------------------------------------------
