commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Rodion Efremov (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (COLLECTIONS-479) An Order Statistic Tree
Date Tue, 16 Feb 2016 15:01:18 GMT

    [ https://issues.apache.org/jira/browse/COLLECTIONS-479?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15148762#comment-15148762
] 

Rodion Efremov commented on COLLECTIONS-479:
--------------------------------------------

I am more or less done with a Set-implementation that provides methods get(int index) and
indexOf(T element); both run in O(log N). See here: https://github.com/coderodde/OrderStatisticTree

However, if a Map is required, please tell me, should not take much time to refactor.

Best,
rodde

> An Order Statistic Tree
> -----------------------
>
>                 Key: COLLECTIONS-479
>                 URL: https://issues.apache.org/jira/browse/COLLECTIONS-479
>             Project: Commons Collections
>          Issue Type: New Feature
>            Reporter: Ajo Fod
>            Priority: Minor
>             Fix For: 4.x
>
>         Attachments: COLLECTIONS-479.patch, NodeExistsException.java, RedBlackBST.java
>
>
> An order statistic tree http://en.wikipedia.org/wiki/Order_statistic_tree provides two
useful properties. The ability to rank arbitrary keys relative to keys existing in the tree
AND the ability to retrieve elements from the tree with the given rank.
> This can be used to find the percentile rank of a key for example.
> This functionality is not yet provided yet by any of the major libraries AFAIK.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)

Mime
View raw message