Uploaded image for project: 'JDK'
  1. JDK
  2. JDK-8078464

Path2D storage growth algorithms should be less linear

    XMLWordPrintable

Details

    • Bug
    • Status: Resolved
    • P3
    • Resolution: Fixed
    • 8
    • 9
    • client-libs
    • None
    • 2d
    • b65

    Backports

      Description

        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.

        Attachments

          Issue Links

            Activity

              People

                lbourges Laurent Bourgès
                flar Jim Graham
                Votes:
                0 Vote for this issue
                Watchers:
                4 Start watching this issue

                Dates

                  Created:
                  Updated:
                  Resolved: