throw new IOException("transport closed in negotiate");
            }
            final int size = Encdec.dec_uint16be(sbuf, 2) & 0xFFFF;
            if (size < 33 || 4 + size > sbuf.length) {
                throw new IOException("Invalid payload size: " + size);
            }
            readn(in, sbuf, 4 + 32, size - 32);
            resp.decode(sbuf, 4);

            if (LogStream.level >= 4) {

        new ImmutableMap.Builder<>(mapEntries.size());
    int size = 0;

    for (Entry<? extends K, ? extends Collection<? extends V>> entry : mapEntries) {
      K key = entry.getKey();
      Collection<? extends V> values = entry.getValue();
      ImmutableSet<V> set = valueSet(valueComparator, values);
      if (!set.isEmpty()) {
        builder.put(key, set);
        size += set.size();
      }
    }

        count,
        getMultiset().count(element));

    int size = 0;
    for (Multiset.Entry<E> entry : getMultiset().entrySet()) {
      size += entry.getCount();
    }
    assertEquals(
        "multiset.size() should be the sum of the counts of all entries",
        size,
        getMultiset().size());
  }

  /** Call the {@code setCount()} method under test, and check its return value. */

        if (stemmerOverrideItemList == null) {
            reload(null);
        }

        if (offset >= stemmerOverrideItemList.size() || offset < 0) {
            return new PagingList<>(Collections.<StemmerOverrideItem> emptyList(), offset, size, stemmerOverrideItemList.size());
        }

        int toIndex = offset + size;

    @ValidateTypeFailure
    public Integer crudMode;

    /** URL expression pattern to match documents for boosting */
    @Required
    @Size(max = 10000)
    public String urlExpr;

    /** Boost expression to apply to matching documents */
    @Required
    @Size(max = 10000)
    public String boostExpr;

    /** Sort order for displaying boost configurations */
    @Required
    @Min(value = 0)

        });
    assertThat(cache.size()).isAtMost(1);
  }

  public void testCompute() {
    cache.put(key, "1");
    // simultaneous deletion
    doParallelCacheOp(
        count,
        n -> {
          cache.asMap().compute(key, (k, v) -> null);
        });
    assertEquals(0, cache.size());
  }

  public void testComputeWithLoad() {

        assertTrue(response instanceof Smb2ChangeNotifyResponse);
    }

    @Test
    @DisplayName("Should calculate correct size")
    void testSize() {
        // When
        int size = request.size();

        // Then
        // Size should be aligned to 8 bytes: SMB2_HEADER_LENGTH + 32
        int expectedSize = Smb2Constants.SMB2_HEADER_LENGTH + 32;

        assertEquals(0, executionOrder.size());

        ComponentUtil.doInitProcesses(Runnable::run);

        assertEquals(2, executionOrder.size());
        assertEquals("first", executionOrder.get(0));
        assertEquals("second", executionOrder.get(1));

        ComponentUtil.processAfterContainerInit(() -> executionOrder.add("third"));
        assertEquals(2, executionOrder.size());
    }

  // Represents how tightly we can pack things, as a maximum.
  private static final double DESIRED_LOAD_FACTOR = 0.5;

  /**
   * Returns an array size suitable for the backing array of a hash table that uses open addressing
   * with linear probing in its implementation. The returned size is the smallest power of two that
   * can hold setSize elements with the desired load factor.
   */
  @VisibleForTesting

    /**
     * Gets the maximum buffer size for IO operations
     *
     * @return the maximum size of IO buffers, limits the maximum message size
     */
    int getMaximumBufferSize();

    /**
     *
     * Property {@code jcifs.smb.client.transaction_buf_size} (int, default 65535)
     *
     * @return maximum data size for SMB transactions
     */
    int getTransactionBufferSize();