On Fri, Mar 18, 2016 at 2:23 PM, Rodion Efremov <
rodio...@cs.helsinki.fi.invalid> wrote:
> Hello, all.
> I would like to announce that I have a java.util.Set implementation that
> is an order statistic tree (all non-bulk operations + select + rank in
> O(log n) time) [1]. However, it seems like
Hello, all.
I would like to announce that I have a java.util.Set implementation that is an
order statistic tree (all non-bulk operations + select + rank in O(log n) time)
[1]. However, it seems like the team on behalf of the order statistic tree
issue is rather idle [2], hence the message.
I have revived some discussion at
https://issues.apache.org/jira/browse/COLLECTIONS-479
(https://issues.apache.org/jira/browse/COLLECTIONS-479)
Basically, what interfaces an order statistic tree should implement? What comes
to the structure, will a counted AVL-tree do?
Best,
rodde
