CollectionFeature.RESTRICTS_ELEMENTS,
            CollectionSize.ANY)
        .suppressing(suppressForEnumSet())
        .createTestSuite();
  }

  /**
   * Tests regular NavigableSet behavior of synchronizedNavigableSet(treeSet); does not test the
   * fact that it's synchronized.
   */
  public Test testsForSynchronizedNavigableSet() {
    return NavigableSetTestSuiteBuilder.using(

            // Available if context is established and integrity is supported
            return this.established && this.integrity;
        }
    }

    @Nested
    @DisplayName("Happy path behavior")
    class HappyPath {
        @Test
        @DisplayName("All getters return configured values and MIC roundtrips")
        void testAllMethodsHappyPath() throws Exception {
            // Arrange

import org.mockito.junit.jupiter.MockitoExtension;

import jcifs.CIFSContext;
import jcifs.Configuration;

/**
 * Integration tests for witness protocol implementation.
 * Uses mock services to simulate witness behavior.
 */
@ExtendWith(MockitoExtension.class)
public class WitnessIntegrationTest {

    @Mock
    private CIFSContext mockContext;

    @Mock
    private Configuration mockConfig;

 *
 * <p>{@code Network}s built by this class also guarantee that each collection-returning accessor
 * returns a <b>(live) unmodifiable view</b>; see <a
 * href="https://github.com/google/guava/wiki/GraphsExplained#accessor-behavior">the external
 * documentation</a> for details.
 *
 * <p>Examples of use:
 *
 * {@snippet :
 * // Building a mutable network
 * MutableNetwork<String, Integer> network =

 *
 * <p>{@code ValueGraph}s built by this class also guarantee that each collection-returning accessor
 * returns a <b>(live) unmodifiable view</b>; see <a
 * href="https://github.com/google/guava/wiki/GraphsExplained#accessor-behavior">the external
 * documentation</a> for details.
 *
 * <p>Examples of use:
 *
 * {@snippet :
 * // Building a mutable value graph
 * MutableValueGraph<String, Double> graph =

import com.google.common.annotations.VisibleForTesting;

/**
 * Implementation of Geoff Pike's fingerprint2011 hash function. See {@link Hashing#fingerprint2011}
 * for information on the behaviour of the algorithm.
 *
 * <p>On Intel Core2 2.66, on 1000 bytes, fingerprint2011 takes 0.9 microseconds compared to
 * fingerprint at 4.0 microseconds and md5 at 4.5 microseconds.
 *

        assertNotNull(retrieved);
        assertEquals(engine, retrieved);
    }

    // Test concurrent-like scenario (sequential but simulating concurrent behavior)
    public void test_add_multipleSameNameSequential() {
        TestScriptEngine engine1 = new TestScriptEngine("v1");
        TestScriptEngine engine2 = new TestScriptEngine("v2");

  }

  @Test fun binarySearchEmptyRange() {
    assertEquals(-1, binarySearch(0, 0) { error("unexpected call") })
  }

  /** Confirm the compact table has the exact same behavior as the plain table. */
  @Test fun comparePlainAndCompactTables() {
    val buffer = Buffer()
    for (codePoint in 0..0x10ffff) {
      val allowedByTable = table.map(codePoint, buffer)

    SmbFileHandleImpl fd;
    @Mock
    Configuration config;

    private SmbPipeInputStream newStreamWithInit(boolean smb2) throws CIFSException {
        when(handle.getPipe()).thenReturn(pipe);
        // init(th) behavior inside SmbFileInputStream constructor
        when(tree.isSMB2()).thenReturn(smb2);
        when(tree.getReceiveBufferSize()).thenReturn(4096);
        when(tree.getMaximumBufferSize()).thenReturn(65535);

          delegateIndex = i + 1;
          return;
        }
      }
      // If all the delegates were complete, no reason for the next listener to have to
      // go through the whole list. Avoids O(n^2) behavior when the entire output list is
      // cancelled.
      delegateIndex = delegates.size();
    }

    @SuppressWarnings("Interruption") // We are propagating an interrupt from a caller.