// in a recursive loop.  Sneaky.
    if (level == stimuli.length) {
      // We've filled the array.
      compareResultsForThisListOfStimuli();
    } else {
      // Keep recursing to fill the array.
      for (Stimulus<E, ? super I> stimulus : getStimulusValues()) {
        stimuli[level] = stimulus;
        recurse(level + 1);
      }
    }
  }

        .isEqualTo("Could not create BloomFilter of 3327428144502 bits");
  }

  @AndroidIncompatible // OutOfMemoryError
  public void testLargeNumberOfInsertions() {
    // We use horrible FPPs here to keep Java from OOM'ing
    BloomFilter<String> unused =
        BloomFilter.create(Funnels.unencodedCharsFunnel(), Integer.MAX_VALUE / 2, 0.30);

      @SuppressWarnings({"rawtypes", "unchecked"})
      Supplier<List<V>> result = (Supplier) INSTANCE;
      return result;
    }

    @Override
    // We recommend against linkedListValues but need to keep it for compatibility.
    @SuppressWarnings("JdkObsolete")
    public List<?> get() {
      return new LinkedList<>();
    }
  }

  private static final class HashSetSupplier<V extends @Nullable Object>

      @SuppressWarnings({"rawtypes", "unchecked"})
      Supplier<List<V>> result = (Supplier) INSTANCE;
      return result;
    }

    @Override
    // We recommend against linkedListValues but need to keep it for compatibility.
    @SuppressWarnings("JdkObsolete")
    public List<?> get() {
      return new LinkedList<>();
    }
  }

  private static final class HashSetSupplier<V extends @Nullable Object>

                    wagon.removeTransferListener(md5ChecksumObserver);
                    wagon.removeTransferListener(sha1ChecksumObserver);
                }

                if (downloaded) {
                    // keep the checksum files from showing up on the download monitor...
                    if (downloadMonitor != null) {
                        wagon.removeTransferListener(downloadMonitor);
                    }

	// is too large we are basically just thrashing the CPU D-cache.
	// So if the result length is larger than an empirically-found
	// limit (8KB), we stop growing the source string once the limit
	// is reached and keep reusing the same source string - that
	// should therefore be always resident in the L1 cache - until we
	// have completed the construction of the result.
	// This yields significant speedups (up to +100%) in cases where

			d, ok := decl.(*ast.GenDecl)
			if !ok {
				continue
			}
			for _, spec := range d.Specs {
				if s, ok := spec.(*ast.ImportSpec); ok && s.Path.Value == `"C"` {
					// Replace "C" with _ "unsafe", to keep program valid.
					// (Deleting import statement or clause is not safe if it is followed
					// in the source by an explicit semicolon.)
					f.Edit.Replace(f.offset(s.Path.Pos()), f.offset(s.Path.End()), `_ "unsafe"`)
				}

    final Service service;
    // We store the state in a weak reference to ensure that if something went wrong while
    // constructing the ServiceManager we don't pointlessly keep updating the state.
    final WeakReference<ServiceManagerState> state;

    ServiceListener(Service service, WeakReference<ServiceManagerState> state) {
      this.service = service;
      this.state = state;
    }

            if (lastUnderscore > 0) {
                try {
                    long window = Long.parseLong(key.substring(lastUnderscore + 1));
                    return window < currentWindow - 2; // Keep current and previous window
                } catch (NumberFormatException e) {
                    return true; // Remove invalid entries
                }
            }
            return true;
        });

            currentMax = maxResponseTime.get();
        }

        // Add to history for percentile calculation
        responseTimeHistory.addLast(responseTimeMs);
        if (responseTimeHistory.size() > 1000) { // Keep last 1000 measurements
            responseTimeHistory.removeFirst();
        }

        // Calculate moving average (simple approach)
        if (!responseTimeHistory.isEmpty()) {