[
https://issues.apache.org/jira/browse/CASSANDRA-8988?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14370302#comment-14370302
]
Branimir Lambov commented on CASSANDRA-8988:
--------------------------------------------
I had the impression that the extra search can happen for many nodes on the
tree, but on closer analysis I don't think that's really possible. I'm happy
with your analysis, your version of the code should be more efficient in the
worst case as well as on average.
+1 to the patch.
I'm curious why you aren't using enum methods instead of switches for
selecti/result in AsymmetricOrdering.
> Optimise IntervalTree
> ---------------------
>
> Key: CASSANDRA-8988
> URL: https://issues.apache.org/jira/browse/CASSANDRA-8988
> Project: Cassandra
> Issue Type: Improvement
> Components: Core
> Reporter: Benedict
> Assignee: Benedict
> Priority: Minor
> Fix For: 3.0
>
> Attachments: 8988.txt
>
>
> We perform a lot of unnecessary comparisons in
> IntervalTree.IntervalNode.searchInternal.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
