if (!timings.isEmpty()) {
                double avgTime = timings.stream().mapToLong(Long::longValue).average().orElse(0.0);
                long maxTime = timings.stream().mapToLong(Long::longValue).max().orElse(0L);
                long minTime = timings.stream().mapToLong(Long::longValue).min().orElse(0L);

                double variance = (maxTime - minTime) / avgTime;

        // 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);

  }

  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);

        if (!responseTimeHistory.isEmpty()) {
            long sum = responseTimeHistory.stream().mapToLong(Long::longValue).sum();
            avgResponseTime.set(sum / responseTimeHistory.size());

            // Calculate 95th percentile
            long[] sortedTimes = responseTimeHistory.stream().mapToLong(Long::longValue).sorted().toArray();
            int p95Index = (int) Math.ceil(0.95 * sortedTimes.length) - 1;

 *   <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

    assertThat(stats.min()).isEqualTo(MEGA_STREAM_MIN);
    assertThat(stats.max()).isEqualTo(MEGA_STREAM_MAX);
  }

  public void testOfPrimitiveLongStream() {
    Stats stats = Stats.of(megaPrimitiveDoubleStream().mapToLong(x -> (long) x));
    assertThat(stats.count()).isEqualTo(MEGA_STREAM_COUNT);
    assertThat(stats.mean()).isWithin(ALLOWED_ERROR * MEGA_STREAM_COUNT).of(MEGA_STREAM_MEAN);
    assertThat(stats.populationVariance())

        } else {
            stats.errors.incrementAndGet();
        }
    }
    
    public double getAggregatedThroughput() {
        return channelStats.values().stream()
            .mapToLong(ChannelStatistics::getThroughput)
            .sum();
    }
}
```

## 9. Security Considerations

### 9.1 Channel Binding Security
```java
public class SecureChannelBinding {