protected int dataOffset;
    /** Displacement of these data bytes from the start of the total data block */
    protected int dataDisplacement;
    /** Number of setup words in this response */
    protected int setupCount;
    /** Start position of parameter data in the buffer */
    protected int bufParameterStart;
    /** Start position of data bytes in the buffer */

        response = new SmbComNegotiateResponse(serverData);
    }

    @Test
    void testReadParameterWordsWireFormat() {
        // Prepare a byte array with sample parameter words
        ByteBuffer buffer = ByteBuffer.allocate(34);
        buffer.order(ByteOrder.LITTLE_ENDIAN);
        buffer.putShort((short) 0); // dialectIndex

        assertEquals(expectedTime, response.getLastAccessTime());
    }

    @Test
    void testReadParameterWordsWireFormatWithData() {
        // Test reading parameter words from wire format
        response = new SmbComQueryInformationResponse(mockConfig, 0L);

        // Prepare test data
        byte[] buffer = new byte[256];
        int bufferIndex = 0;

I think `Union[SomeType, None]` is more explicit about what it means.

It's just about the words and names. But those words can affect how you and your teammates think about the code.

            return FormatType.LABEL;
        }
        if ("popular-words".equals(type)) {
            return FormatType.POPULARWORD;
        }
        if ("favorites".equals(type)) {
            return FormatType.FAVORITES;
        }
        if ("health".equals(type)) {
            return FormatType.PING;
        }
        if ("suggest-words".equals(type)) {
            return FormatType.SUGGEST;
        }

            response.setTid(0xFFFF);
            assertFalse(response.isValidTid(), "TID 0xFFFF should be invalid");
        }

        @Test
        @DisplayName("Should decode parameter words correctly")
        void testReadParameterWordsWireFormat() throws Exception {
            // Given - Buffer with flags
            byte[] buffer = new byte[2];

   * Object) reachable} from node A.
   *
   * <p>This is a "snapshot" based on the current topology of {@code graph}, rather than a live view
   * of the transitive closure of {@code graph}. In other words, the returned {@link Graph} will not
   * be updated after modifications to {@code graph}.
   *
   * @since 33.1.0 (present with return type {@code Graph} since 20.0)
   */

   * Object) reachable} from node A.
   *
   * <p>This is a "snapshot" based on the current topology of {@code graph}, rather than a live view
   * of the transitive closure of {@code graph}. In other words, the returned {@link Graph} will not
   * be updated after modifications to {@code graph}.
   *
   * @since 33.1.0 (present with return type {@code Graph} since 20.0)
   */

        mergedItem.emptySource = item2.emptySource;

        return mergedItem;
    }

    /**
     * Checks if the suggest item contains any of the given bad words.
     * @param badWords The array of bad words.
     * @return True if the item contains a bad word, false otherwise.
     */
    public boolean isBadWord(final String[] badWords) {
        for (final String badWord : badWords) {
            if (text.contains(badWord)) {

concat_lines() {
  if [ -f "$1" ]; then
    # First convert all CR to LF using tr
    tr '\r' '\n' < "$1" | \
    sed -e '/^$/d' -e 's/#.*$//' | \
    # Replace LF with NUL for xargs
    tr '\n' '\0' | \
    # Split into words and process each argument
    # Use -0 with NUL to avoid special behaviour on quotes
    xargs -n 1 -0 | \
    while read -r arg; do
      # Replace variables first
      arg=$(echo "$arg" | sed \