Re: [collections] An AVL-tree based sorted set implementing get by index and indexOf by key

Hi Gary, I can’t follow the source code of the 2 DS you mentioned. Could you, please, explain how, say, TreeSet can be used for O(log N) select/rank? I, however, noticed that JDK Sets rely internally on corresponding Maps thus wasting a reference per element in a Set. Best regards, rodde ke

Re: [collections] An AVL-tree based sorted set implementing get by index and indexOf by key

Hi Rodde, Why would a user use this implementation instead of a ConcurrentSkipListSet or a TreeSet? IMO, we need to consider users first, IOW, what is the use case? Gary On Wed, Jul 13, 2022 at 1:48 AM Rodion Efremov wrote: > > Hello, > > I have an order statistic tree implemented [1]. I am

[collections] An AVL-tree based sorted set implementing get by index and indexOf by key

Hello, I have an order statistic tree implemented [1]. I am aware of a red/black BST version of the sama ADT [2]. However, [1] implements the Set interface; [2] implements none. What do you think about it? Best regards, rodde [1] https://github.com/coderodde/OrderStatisticTree [2]