List<String> cmdList = Arrays.asList("echo", "hello");
        Consumer<ProcessBuilder> pbCall = pb -> {
            pb.redirectErrorStream(true);
        };

        try {
            // Test that multiple calls to startProcess with same sessionId work correctly
            JobProcess jobProcess1 = processHelper.startProcess(sessionId, cmdList, pbCall);
            JobProcess jobProcess2 = processHelper.startProcess(sessionId, cmdList, pbCall);

        // Set fail counts (addr1 has more failures, addr2 has fewer)
        pool.failCounts.put("10.0.0.1", 5);
        pool.failCounts.put("10.0.0.2", 1);

        // Create spy to intercept calls
        SmbTransportPoolImpl poolSpy = spy(pool);
        when(ctx.getTransportPool()).thenReturn(poolSpy);

        // Mock transports
        SmbTransportImpl trans1 = mock(SmbTransportImpl.class);

    }

    /**
     * Validates that a given file is safe and does not attempt path traversal attacks.
     * <p>
     * This is a convenience method that converts File objects to Path and calls
     * {@link #isPathSafe(Path, Path)}.
     * </p>
     *
     * @param fileToCheck the file to validate (must not be {@literal null})

     * is because this method is used to determine applicable methods for
     * an actual parameter list, and primitive types are represented by
     * their object duals in reflective method calls.
     *
     * @param formal the formal parameter type to which the actual
     *               parameter type should be convertible
     * @param actual the actual parameter type.

        // When
        iterator.next(); // Move to first element
        iterator.remove();

        // Then
        verify(mockDelegate).remove();
    }

    /**
     * Test multiple calls to hasNext without calling next.
     */
    @Test
    void testMultipleHasNextCalls() {
        // Given
        when(mockDelegate.hasNext()).thenReturn(true, false);

		}
	}

	healEntrySkipped := func(sz uint64) healEntryResult {
		return healEntryResult{
			bytes:   sz,
			skipped: true,
		}
	}

	// Collect updates to tracker from concurrent healEntry calls
	results := make(chan healEntryResult, 1000)
	quitting := make(chan struct{})
	defer func() {
		close(results)
		<-quitting
	}()

	go func() {
		for res := range results {
			if res.entryDone {

		Context: context,
	})
}

// Save calls to C.xxx for later processing.
func (f *File) saveCall(call *ast.CallExpr, context astContext) {
	sel, ok := call.Fun.(*ast.SelectorExpr)
	if !ok {
		return
	}
	if l, ok := sel.X.(*ast.Ident); !ok || l.Name != "C" {
		return
	}
	c := &Call{Call: call, Deferred: context == ctxDefer}
	f.Calls = append(f.Calls, c)
}

    before.assertRun();
    after.assertRun();
  }

  @SuppressWarnings("nullness") // test of a bogus call
  public void testNullListener() {
    assertThrows(NullPointerException.class, () -> future.addListener(null, directExecutor()));
  }

  @SuppressWarnings("nullness") // test of a bogus call
  public void testNullExecutor() {
    assertThrows(NullPointerException.class, () -> future.addListener(doNothing(), null));

 *
 * <p>This uses the same efficient implementation as {@link Ordering#leastOf(Iterable, int)},
 * offering expected O(n + k log k) performance (worst case O(n log k)) for n calls to {@link
 * #offer} and a call to {@link #topK}, with O(k) memory. In comparison, quickselect has the same
 * asymptotics but requires O(n) memory, and a {@code PriorityQueue} implementation takes O(n log

            // Given
            long capacity = 1000L;
            long free = 500L;
            TestAllocInfo allocInfo = new TestAllocInfo(capacity, free);

            // When - multiple calls should return same values
            long firstCapacityCall = allocInfo.getCapacity();
            long secondCapacityCall = allocInfo.getCapacity();
            long firstFreeCall = allocInfo.getFree();