JDK-8091067 : SortedList possible optimizations
  • Type: Enhancement
  • Component: javafx
  • Sub-Component: base
  • Affected Version: fx2.0
  • Priority: P4
  • Status: Open
  • Resolution: Unresolved
  • Submitted: 2011-04-01
  • Updated: 2018-09-05
The Version table provides details related to the release that this issue/RFE will be addressed.

Unresolved : Release in which this issue/RFE will be addressed.
Resolved: Release in which this issue/RFE has been resolved.
Fixed : Release in which this issue/RFE has been fixed. The release containing this fix may be available for download as an Early Access Release or a General Availability Release.

To download the current JDK release, click here.
Other
tbdUnresolved
Related Reports
Relates :  
JDK-8103045 - Improve performance of SortedList over FilteredList when FilteredList predicate changes
Description
- data structure for storing current sorted state can be transfered into a tree. This would lower the complexity of a single change from O(n*log(n)) to O(log(n)), but raise random access from O(1) to O(log(n)).
- several common operations could be optimized, e.g. clear can removes everything in one notification
- set some threshold when a complete resort would be faster than one-by-one insert sort
-
Comments
Change issue type from the deprecated "Optimization" (which should no longer be used) to "Tweak"
11-09-2013