*/
        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).
         */

 *
 * @author mbechler
 */
public interface SMBSigningDigest {

    /**
     * Performs MAC signing of the SMB. This is done as follows.
     * The signature field of the SMB is overwritten with the sequence number;
     * The MD5 digest of the MAC signing key + the entire SMB is taken;
     * The first 8 bytes of this are placed in the signature field.
     *
     * @param data
     *            The data.

                    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 {

        /** 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

            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++) {

 */
public class EditForm extends CreateForm {

    /** Unique identifier for the search list entry */
    public String id;

    /** Sequence number for ordering search list entries */
    @ValidateTypeFailure
    public Long seqNo;

    /** Primary term value for search list configuration */
    @ValidateTypeFailure
    public Long primaryTerm;

        // When
        messageBlock.reset();

        // Then
        verify(messageBlock).reset();
    }

    @Test
    @DisplayName("Test multiple operations in sequence")
    void testMultipleOperationsInSequence() {
        // Given
        long mid = 123L;
        int command = 0x73;
        int uid = 500;
        long sessionId = 999L;

            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");

        }
        duplicateHostList.add(duplicateHost);
    }

    /**
     * Converts a URL using all configured duplicate host rules.
     * Applies each duplicate host rule in sequence to transform the URL
     * according to the configured patterns.
     *
     * @param url the URL to convert
     * @return the converted URL after applying all duplicate host rules,

        try (ASN1InputStream der = new ASN1InputStream(token)) {
            ASN1TaggedObject tagged = (ASN1TaggedObject) der.readObject();
            final ASN1Sequence sequence = ASN1Sequence.getInstance(tagged, true);
            final Enumeration<?> fields = sequence.getObjects();
            while (fields.hasMoreElements()) {
                tagged = (ASN1TaggedObject) fields.nextElement();
                switch (tagged.getTagNo()) {