-
Enhancement
-
Resolution: Unresolved
-
P4
-
fx2.0
- use a tree instead of int mapping ( data change O(n*log(n)) -> O(log(n)), random access O(1)->O(log(n)) ).
- bigger replacements can use only one data structure shift
-
- bigger replacements can use only one data structure shift
-
- blocks
-
JDK-8090921 Use FilteredList for Parent.unmodifiableManagedChildren
- Open
- relates to
-
JDK-8103045 Improve performance of SortedList over FilteredList when FilteredList predicate changes
- Resolved