// Verify structure
            assertEquals(48, SMBUtil.readInt2(buffer, 0)); // Structure size
            assertEquals(1, SMBUtil.readInt2(buffer, 2)); // Lock count

            // Verify lock sequence (bits 4-7 are sequence number, bits 0-27 are index)
            int lockSequence = SMBUtil.readInt4(buffer, 4);
            assertEquals(0, lockSequence); // Default values

            // Verify file ID

 *
 * While [onReset] may occur at any time, the following callbacks are expected in order,
 * correlated by stream ID.
 *
 *  * [onRequest]
 *  * [onHeaders] (unless canceled)
 *  * [onData] (optional sequence of data frames)
 *
 * As a stream ID is scoped to a single HTTP/2 connection, implementations which target multiple
 * connections should expect repetition of stream IDs.
 *

        ),
      ).assertLogMatch(
        Regex(
          """callFailed: \S+(?:SSLProtocolException|SSLHandshakeException|TlsFatalAlert): .*(?:Unexpected handshake message: client_hello|Handshake message sequence violation, 1|Read error|Handshake failed|unexpected_message\(10\)).*""",
        ),

User-agent: SpecialCharBot
Disallow: /path with spaces/
Disallow: /path%20encoded/
Disallow: /path?query=value
Disallow: /path#fragment
Allow: /unicode/日本語/

# Case 10: Multiple User-agents in sequence
User-agent: Bot1
User-agent: Bot2
User-agent: Bot3
Disallow: /shared/

# Case 11: Sitemap with various formats
Sitemap: http://example.com/sitemap.xml
sitemap: http://example.com/sitemap2.xml

         */
        public short time_hi_and_version;
        /**
         * The high field of the clock sequence multiplexed with the variant.
         */
        public byte clock_seq_hi_and_reserved;
        /**
         * The low field of the clock sequence.
         */
        public byte clock_seq_low;
        /**
         * The spatially unique node identifier (6 bytes).
         */

                    throw new IOException("Invalid UTF-8 sequence");
                }
                uni[ui] |= (ch & 0x3F) << 6;
                ch = src[si++] & 0xFF;
                uni[ui] |= ch & 0x3F;
                if ((ch & 0xC0) != 0x80 || uni[ui] < 0x800) {
                    throw new IOException("Invalid UTF-8 sequence");
                }
            } else {

            assertEquals(0, top.getTagNo(), "Top-level tag number should be 0");
            assertTrue(top.getBaseObject() instanceof ASN1Sequence, "Base object should be a sequence");
            ASN1Sequence seq = (ASN1Sequence) top.getBaseObject();
            assertEquals(2, seq.size(), "Sequence should contain OID and [0] NegTokenInit");
            assertTrue(seq.getObjectAt(0) instanceof ASN1ObjectIdentifier, "First element should be OID");

            normalized[i] = parts[i].replaceFirst("^0+(?!$)", "");
            if (normalized[i].isEmpty()) {
                normalized[i] = "0";
            }
        }

        // Find longest sequence of consecutive zeros
        int longestStart = -1;
        int longestLength = 0;
        int currentStart = -1;
        int currentLength = 0;

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

        /** The high field of the timestamp multiplexed with the version number */
        public short time_hi_and_version;
        /** The high field of the clock sequence multiplexed with the variant */
        public byte clock_seq_hi_and_reserved;
        /** The low field of the clock sequence */
        public byte clock_seq_low;
        /** The spatially unique node identifier */
        public byte[] node;

        @Override

   *
   * @throws IllegalStateException if there has been a call to {@link #peek()} since the most recent
   *     call to {@link #next()} and this implementation does not support this sequence of calls
   *     (optional)
   */
  @Override
  void remove();