.mapToLong(StringStats::getOccurrences)
                    .sum();
            long totalMemory = stats.entrySet().stream()
                    .mapToLong(e -> e.getKey().length() * e.getValue().getOccurrences() * 2L)
                    .sum();
            long potentialSavings = stats.entrySet().stream()

        // Calculate maximum weight of downstream dependencies
        long maxDownstreamWeight = dependencyGraph.getDownstreamProjects(project, false).stream()
                .mapToLong(this::getProjectWeight)
                .max()
                .orElse(0L);

        // Weight = 1 + max downstream weight (similar to Takari Smart Builder)
        return 1L + maxDownstreamWeight;
    }

  }

  public void testAddAllPrimitiveLongStream() {
    StatsAccumulator accumulator = new StatsAccumulator();
    accumulator.addAll(megaPrimitiveDoubleStreamPart1().mapToLong(x -> (long) x));
    accumulator.addAll(megaPrimitiveDoubleStreamPart2().mapToLong(x -> (long) x));
    assertThat(accumulator.count()).isEqualTo(MEGA_STREAM_COUNT);
    assertThat(accumulator.mean()).isWithin(ALLOWED_ERROR * MEGA_STREAM_COUNT).of(MEGA_STREAM_MEAN);

  /**
   * Returns the sum of all values in this map.
   *
   * <p>This method is not atomic: the sum may or may not include other concurrent operations.
   */
  public long sum() {
    return map.values().stream().mapToLong(Long::longValue).sum();
  }

  @LazyInit private transient @Nullable Map<K, Long> asMap;

  /** Returns a live, read-only view of the map backing this {@code AtomicLongMap}. */
  public Map<K, Long> asMap() {

 *   <li>Can be queried without allocating garbage.
 *   <li>Access to {@code LongStream} features (like {@link LongStream#sum}) using {@code stream()}
 *       instead of the awkward {@code stream().mapToLong(v -> v)}.
 * </ul>
 *
 * <p>Disadvantages compared to {@code ImmutableList<Long>}:
 *
 * <ul>
 *   <li>Can't be passed directly to methods that expect {@code Iterable}, {@code Collection}, or