import java.util.function.BiFunction;
import java.util.function.Function;
import java.util.stream.Collector;
import org.jspecify.annotations.Nullable;

/**
 * A {@link RangeMap} whose contents will never change, with many other important properties
 * detailed at {@link ImmutableCollection}.
 *
 * @author Louis Wasserman
 * @since 14.0
 */
@GwtIncompatible // NavigableMap

  public void removeAllZeros() {
    map.values().removeIf(x -> x == 0);
  }

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

    return statsCounterSupplier;
  }

  /**
   * Builds a cache, which either returns an already-loaded value for a given key or atomically
   * computes or retrieves it using the supplied {@code CacheLoader}. If another thread is currently
   * loading the value for this key, simply waits for that thread to finish and returns its loaded
   * value. Note that multiple threads can concurrently load values for distinct keys.
   *

	}
	ctx = lkctx.Context()
	defer locker.Unlock(lkctx)

	// Load healing tracker in this disk
	tracker, err := loadHealingTracker(ctx, disk)
	if err != nil {
		// A healing tracker may be deleted if another disk in the
		// same erasure set with same healing-id successfully finished
		// healing.
		if errors.Is(err, errFileNotFound) {
			return nil
		}

					return
				}
				goto sendResp
			}
		case <-pingTimer:
			if !m.doPing(respHandler) {
				return
			}
		}
	}
}

// doPing checks last ping time and sends another ping.
func (m *muxClient) doPing(respHandler chan<- Response) (ok bool) {
	m.respMu.Lock()
	if m.closed {
		m.respMu.Unlock()
		// Already closed. This is not an error state;

    // array slot is read and written exactly once. However, it can have very poor memory locality:
    // benchmarking shows it can take 7 times longer than the other two in some cases. The other two
    // do n swaps, minus a delta (0 or 2 for Reversal, gcd(d, n) for Successive), so that's about
    // twice as many reads and writes. But benchmarking shows that they usually perform better than

/**
 * Executes the Maven build plan in a concurrent manner, handling the lifecycle phases and plugin executions.
 * This executor implements a weave-mode build strategy, where builds are executed phase-by-phase rather than
 * project-by-project.
 *
 * <h2>Key Features:</h2>
 * <ul>
 *   <li>Concurrent execution of compatible build steps across projects</li>
 *   <li>Thread-safety validation for plugins</li>

    // as the end result should be the same either way
    thirdSignal.await();
    Thread.yield();

    // Expand!
    CacheTesting.forceExpandSegment(cache, key);

    // start another waiting thread
    new Thread() {
      @Override
      public void run() {
        fourthSignal.countDown();
        result.set(2, cache.getUnchecked(key));
        doneSignal.countDown();
      }

                        .inactiveRequiredProjects(MODULE_A)
                        .expectResult(MavenExecutionException.class, "empty reactor"),
                scenario("Selected and excluded same project, but also selected another project")
                        .activeRequiredProjects(MODULE_A, MODULE_B)
                        .inactiveRequiredProjects(MODULE_A)
                        .expectResult(MODULE_B),

        doNothing().when(response).setCommand(command);
        when(response.getCommand()).thenReturn(command);
        response.setCommand(command);
        assertEquals(command, response.getCommand());

        // Test other setter methods
        doNothing().when(response).setUid(1000);
        response.setUid(1000);
        verify(response).setUid(1000);

        doNothing().when(response).setExtendedSecurity(true);