Skip to content

Consider reducing ImmutableList array copying #1033

Open
@ben-manes

Description

This is simply an observation and not a problem, so you are welcome to close as won't fix. I profiled a test build task to see if there its doing anything dumbly inefficient for a faster CI run. Overall it seems fine and GC pauses are okay, but I did notice that the majority of allocations comes from SubjectUtils building ImmutableList instances. See the attached jfr recording and the JMC and JProfiler screenshots below for the cpu and memory hotspots.

A few obvious optimizations might be,

  • concat is often called by methods with names like prependNameIfAny that pass an empty collection. Since ImmutableList.copyOf is given a wrapped iterator it must always copy, even if the only populated iterator is an ImmutableList.
  • append is called with a known size of elements, but the builder is not presized so it must grow to accommodate.
  • It's not clear if ImmutableList is a benefit here as internal data that does not appear to be further modified. You might consider using lightweight wrappers (Arrays.asList, Collections.unmodifiableList) if a safe and non-intrusive change.

Screen Shot 2022-10-23 at 4 33 28 PM

Screen Shot 2022-10-23 at 4 46 52 PM

Screen Shot 2022-10-23 at 4 33 57 PM

Screen Shot 2022-10-23 at 4 46 18 PM

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Assignees

No one assigned

    Labels

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions