-
Bug
-
Resolution: Fixed
-
P3
-
8
-
None
-
b65
| Issue | Fix Version | Assignee | Priority | Status | Resolution | Resolved In Build |
|---|---|---|---|---|---|---|
| JDK-8084909 | emb-9 | Laurent Bourgès | P3 | Resolved | Fixed | team |
| JDK-8086928 | 8u65 | Laurent Bourgès | P3 | Resolved | Fixed | b01 |
| JDK-8080810 | 8u60 | Laurent Bourgès | P3 | Resolved | Fixed | b18 |
| JDK-8138200 | emb-8u65 | Unassigned | P3 | Resolved | Fixed | b01 |
| JDK-8086209 | emb-8u60 | Laurent Bourgès | P3 | Resolved | Fixed | team |
A significant amount of time is spent allocating and copying arrays when a Path2D is grown to a large number of path elements. The current growth algorithm is linear, but other growable storage objects use a progressive growth algorithm that increases the number of new elements as the capacity grows.
- backported by
-
JDK-8080810 Path2D storage growth algorithms should be less linear
-
- Resolved
-
-
-
- Resolved
-
-
-
- Resolved
-
-
-
- Resolved
-
-
-
- Resolved
-
- relates to
-
-
- Resolved
-
(1 relates to)