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 13.7.2022 klo 15.12 Gary Gregory <garydgreg...@gmail.com> kirjoitti: > 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 <codero...@gmail.com> > wrote: > > > > 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] > > > https://issues.apache.org/jira/projects/COLLECTIONS/issues/COLLECTIONS-479 > > --------------------------------------------------------------------- > To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org > For additional commands, e-mail: dev-h...@commons.apache.org > >
