}

        // Skip padding
        bufferIndex += 2;

        // Read flags
        this.flags = SMBUtil.readInt4(buffer, bufferIndex);
        bufferIndex += 4;

        // Validate remaining buffer size for algorithms
        if (len < 8 + (compressionCount * 2)) {
            throw new SMBProtocolDecodingException("Buffer too small for compression algorithms");
        }

  public static <E extends Comparable<? super E>> ImmutableSortedMultiset<E> of(
      E e1, E e2, E e3, E e4, E e5, E e6, E... remaining) {
    int size = remaining.length + 6;
    List<E> all = Lists.newArrayListWithCapacity(size);
    Collections.addAll(all, e1, e2, e3, e4, e5, e6);
    Collections.addAll(all, remaining);
    return copyOf(Ordering.natural(), all);
  }

  /**

		if tc, ok := r.Context().Value(mcontext.ContextTraceKey).(*mcontext.TraceCtxt); ok {
			tc.FuncName = "s3.MaxClients"
		}

		w.Header().Set("X-RateLimit-Limit", strconv.Itoa(cap(pool)))
		w.Header().Set("X-RateLimit-Remaining", strconv.Itoa(cap(pool)-len(pool)))

		ctx := r.Context()
		select {
		case pool <- struct{}{}:
			defer func() { <-pool }()
			globalHTTPStats.addRequestsInQueue(-1)
			if contextCanceled(ctx) {

        Configuration mockConfig = mock(Configuration.class);
        Smb2TreeDisconnectRequest request = new Smb2TreeDisconnectRequest(mockConfig);
        byte[] buffer = new byte[10];
        int offset = 8; // Only 2 bytes remaining, need 4

        // When & Then
        assertThrows(ArrayIndexOutOfBoundsException.class, () -> {
            request.writeBytesWireFormat(buffer, offset);
        });
    }

    @Test

    void testReadBytesWireFormatOffsetTooLarge() {
        // Given
        byte[] buffer = new byte[10];
        int offset = 9; // Only 1 byte remaining, need at least 2 for structure size

        // When & Then
        assertThrows(ArrayIndexOutOfBoundsException.class, () -> {
            response.readBytesWireFormat(buffer, offset);
        });
    }

            assertEquals(1024, req.getMaxCount(), "Named pipe maxCount should be 1024");
            assertEquals(1024, req.getRemaining(), "Named pipe remaining should be 1024");
        }
    }

    @Nested
    @DisplayName("Lifecycle and exception mapping")
    class LifecycleAndExceptions {

        @Test

  // array. The top bits of this value are the remaining bits of the hash value that were not used
  // in the short hash. We saw that a mask of 0x7f would keep the 7-bit value 0x6f from a full
  // hashcode of 0x89abcdef. The imaginary `hash` value would then be the remaining top 25 bits,
  // 0x89abcd80. To this is added (or'd) the `next` value, which is an index within `entries`

      keyValues.next();
      keyValues.set(newValues.next());
    }

    // Remove remaining old values, if any.
    while (keyValues.hasNext()) {
      keyValues.next();
      keyValues.remove();
    }

    // Add remaining new values, if any.
    while (newValues.hasNext()) {
      keyValues.add(newValues.next());
    }

    return oldValues;
  }

    void testInitialDataLength() {
        // Then
        assertEquals(0, response.getDataLength());
    }

    @Test
    @DisplayName("Should initially have zero data remaining")
    void testInitialDataRemaining() {
        // Then
        assertEquals(0, response.getDataRemaining());
    }

    @Test
    @DisplayName("Should write empty bytes to wire format")

            return getProjectAExecutionPlan();
        }
        if (project.equals(ProjectDependencyGraphStub.B)) {
            return getProjectBExecutionPlan();
        }
        // The remaining are basically "for future expansion"
        List<MojoExecution> me = new ArrayList<>();
        me.add(createMojoExecution("resources", "default-resources", PROCESS_RESOURCES));