makeLocalCache(createCacheBuilder().concurrencyLevel(1).initialCapacity(1));
    Segment<Object, Object> segment = map.segments[0];
    assertThat(segment.table.length()).isEqualTo(1);

    int count = 1024;
    for (int i = 0; i < count; i++) {
      Object key = new Object();
      Object value = new Object();
      int hash = map.hash(key);
      assertThat(segment.put(key, hash, value, false)).isNull();

        makeLocalCache(createCacheBuilder().concurrencyLevel(1).initialCapacity(1));
    Segment<Object, Object> segment = map.segments[0];
    assertThat(segment.table.length()).isEqualTo(1);

    int count = 1024;
    for (int i = 0; i < count; i++) {
      Object key = new Object();
      Object value = new Object();
      int hash = map.hash(key);
      assertThat(segment.put(key, hash, value, false)).isNull();

        assertTrue(result.contains("pipeName=null"));
    }

    @Test
    @DisplayName("Test with large data")
    void testWithLargeData() {
        // Given
        byte[] largeData = new byte[1000];
        Arrays.fill(largeData, (byte) 0x42);
        transCallNamedPipe = new TransCallNamedPipe(mockConfig, TEST_PIPE_NAME, largeData, 0, largeData.length);
        byte[] dst = new byte[2000];

        // When

            final SmbNegotiationResponse nego = transport.getNegotiateResponse();
            if (nego instanceof SmbComNegotiateResponse) {
                return ((SmbComNegotiateResponse) nego).getServerData().serverTimeZone * 1000 * 60L;
            }
            return 0;
        }
    }

    /**
     * {@inheritDoc}
     *
     * @throws SmbException
     *
     * @see jcifs.SmbTreeHandle#getOEMDomainName()

    HashBiMap<String, String> bimap = HashBiMap.create(map);
    assertEquals("dollar", bimap.get("canada"));
    assertEquals("canada", bimap.inverse().get("dollar"));
  }

  private static final int N = 1000;

  public void testBashIt() throws Exception {
    BiMap<Integer, Integer> bimap = HashBiMap.create(N);
    BiMap<Integer, Integer> inverse = bimap.inverse();

    for (int i = 0; i < N; i++) {

            boolean isSpace = false;
            int alphanumSize = 0;
            int symbolSize = 0;
            int c;
            final Set<String> termCache = new HashSet<>(1000);
            try {
                while ((c = reader.read()) != -1) {
                    if (Character.isISOControl(c) || isSpaceChar(c)) {
                        if (duplicateTermRemoved) {

         * that this will suffice. I have not even benchmarked with different size limits.
         */
        if (validClasses.size() > 1000) {
          validClasses.clear();
        }

        validClasses.add(new WeakReference<Class<? extends Exception>>(exceptionClass));
      }
    }

    /**

    }

    @Test
    @DisplayName("Should read multiple notifications from wire format")
    void testReadMultipleNotifications() throws Exception {
        // Given
        byte[] buffer = new byte[1024];
        int offset = 0;

        // Set header start position
        setHeaderStart(response, 64);

        // Write structure header
        SMBUtil.writeInt2(9, buffer, offset);

            manager.stopAsync().awaitStopped();
          }
        };
    stoppingThread.start();
    // this should be super fast since the only non-stopped service is a NoOpService
    stoppingThread.join(1000);
    assertFalse("stopAsync has deadlocked!.", stoppingThread.isAlive());
    failLeave.countDown(); // release the background thread
  }

  /**

    // Check the first 100,000 integers
    for (int i = 0; i < 100000; i++) {
      assertEquals(LongMath.isPrime(i), IntMath.isPrime(i));
    }

    // Then check 1000 deterministic pseudo-random int values.
    Random rand = new Random(1);
    for (int i = 0; i < 1000; i++) {
      int n = rand.nextInt(Integer.MAX_VALUE);
      assertEquals(LongMath.isPrime(n), IntMath.isPrime(n));
    }
  }