[jira] [Updated] (CASSANDRA-9473) Introduce BTreeSet with support for in-place reversal

2015-07-18 Thread Aleksey Yeschenko (JIRA)

 [ 
https://issues.apache.org/jira/browse/CASSANDRA-9473?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
 ]

Aleksey Yeschenko updated CASSANDRA-9473:
-
Fix Version/s: (was: 3.x)

 Introduce BTreeSet with support for in-place reversal
 -

 Key: CASSANDRA-9473
 URL: https://issues.apache.org/jira/browse/CASSANDRA-9473
 Project: Cassandra
  Issue Type: Improvement
  Components: Core
Reporter: Benedict
Assignee: Paulo Motta
Priority: Minor

 Follow up to CASSANDRA-8099.
 We use TreeSet in a lot of places unnecessarily. This is especially a concern 
 now that we store the set of rows we're searching for in both forward and 
 (potentially) reverse order, which we have to construct twice. A very simple 
 wrapper around BTree (which we had previously, but did not employ) would 
 permit us to reverse this collection without any extra work, can be built 
 more cheaply, consumes less memory, and supports the SearchIterator 
 interface, so can be iterated more efficiently.



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


[jira] [Updated] (CASSANDRA-9473) Introduce BTreeSet with support for in-place reversal

2015-07-01 Thread Jonathan Ellis (JIRA)

 [ 
https://issues.apache.org/jira/browse/CASSANDRA-9473?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
 ]

Jonathan Ellis updated CASSANDRA-9473:
--
Assignee: Paulo Motta  (was: Benedict)

 Introduce BTreeSet with support for in-place reversal
 -

 Key: CASSANDRA-9473
 URL: https://issues.apache.org/jira/browse/CASSANDRA-9473
 Project: Cassandra
  Issue Type: Improvement
  Components: Core
Reporter: Benedict
Assignee: Paulo Motta
Priority: Minor
 Fix For: 3.x


 Follow up to CASSANDRA-8099.
 We use TreeSet in a lot of places unnecessarily. This is especially a concern 
 now that we store the set of rows we're searching for in both forward and 
 (potentially) reverse order, which we have to construct twice. A very simple 
 wrapper around BTree (which we had previously, but did not employ) would 
 permit us to reverse this collection without any extra work, can be built 
 more cheaply, consumes less memory, and supports the SearchIterator 
 interface, so can be iterated more efficiently.



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