// This appears to be a bug in the implementation, but we test the actual behavior
            assertEquals(6, encodedSize); // actual encoded size: 2 bytes count + 2*2 bytes for ciphers
            assertEquals(2, buffer[0]); // cipher count (little endian)
            assertEquals(0, buffer[1]);
            assertEquals(1, buffer[2]); // AES128_CCM (little endian)
            assertEquals(0, buffer[3]);

   * The count is accessible via {@link #getCount}.
   */
  static class CountingLoader extends CacheLoader<Object, Object> {
    private final AtomicInteger count = new AtomicInteger();

    @Override
    public Object load(Object from) {
      count.incrementAndGet();
      return new Object();
    }

    public int getCount() {

            modelValueSource2 = new ProblemDetectingValueSource(modelValueSource2, "", "project.", problems);
        }

        // NOTE: Order counts here!
        List<ValueSource> valueSources = new ArrayList<>(9);

        if (projectDir != null) {
            ValueSource basedirValueSource = new PrefixedValueSourceWrapper(

     * This method applies search conditions from the pager and updates the pager with
     * pagination information including page numbers and result counts.
     *
     * @param fileConfigPager the pager containing search criteria and pagination settings
     * @return a list of file configurations matching the criteria
     */

    @ParameterizedTest
    @DisplayName("Test decode with various ACE counts")
    @ValueSource(ints = { 0, 1, 10, 100, 1000, 4096 })
    void testDecodeWithVariousAceCounts(int aceCount) throws SMBProtocolDecodingException {
        // This test is theoretical as we can't create huge buffers
        // but tests the boundary conditions
        if (aceCount <= 10) { // Only test small counts practically
            byte[] buffer = new byte[2048];

        raf.writeShort(1);
        raf.writeChar('A');
        raf.writeInt(1);
        raf.writeLong(1L);
        raf.writeFloat(1.0f);
        raf.writeDouble(1.0);

        // Verify length counts - using times() to check exact counts
        verify(raf, times(2)).write(any(byte[].class), anyInt(), eq(2)); // short and char
        verify(raf, times(2)).write(any(byte[].class), anyInt(), eq(4)); // int and float

        }

        @ParameterizedTest
        @DisplayName("Should encode with different hash algorithm counts")
        @ValueSource(ints = { 0, 1, 2, 5, 10 })
        void testEncodeWithDifferentHashAlgoCounts(int count) {
            int[] hashAlgos = new int[count];
            for (int i = 0; i < count; i++) {
                hashAlgos[i] = i + 1;
            }
            byte[] salt = new byte[16];

        .Builder()
        .add("foo: bar")
        .add(" foo: baz") // Name leading whitespace is trimmed.
        .add("foo : bak") // Name trailing whitespace is trimmed.
        .add("\tkey\t:\tvalue\t") // '\t' also counts as whitespace
        .add("ping:  pong  ") // Value whitespace is trimmed.
        .add("kit:kat") // Space after colon is not required.
        .build()

   * becomes {@code count}.
   *
   * @return the count of {@code element} in the multiset before this call
   * @throws IllegalArgumentException if {@code count} is negative
   */
  @CanIgnoreReturnValue
  @Override
  public int setCount(E element, int count) {
    checkNotNull(element);
    checkNonnegative(count, "count");
    while (true) {

    /** Constructs an instance with all counts initialized to zero. */
    public SimpleStatsCounter() {}

    /**
     * @since 11.0
     */
    @Override
    public void recordHits(int count) {
      hitCount.add(count);
    }

    /**
     * @since 11.0
     */
    @Override
    public void recordMisses(int count) {
      missCount.add(count);
    }