return err
	}

	if c.AccessKey == "" {
		return jwtgo.NewValidationError("accessKey/sub missing",
			jwtgo.ValidationErrorClaimsInvalid)
	}

	return nil
}

// Map returns underlying low-level map claims.
func (c *MapClaims) Map() map[string]any {
	if c == nil {
		return nil
	}
	return c.MapClaims
}

// MarshalJSON marshals the MapClaims struct

02EE          ; valid                                  # 3.0  MODIFIER LETTER DOUBLE APOSTROPHE
02EF..02FF    ; valid                  ;      ; NV8    # 4.0  MODIFIER LETTER LOW DOWN ARROWHEAD..MODIFIER LETTER LOW LEFT ARROW
0300..033F    ; valid                                  # 1.1  COMBINING GRAVE ACCENT..COMBINING DOUBLE OVERLINE
0340          ; mapped                 ; 0300          # 1.1  COMBINING GRAVE TONE MARK

   * Shortcut for {@code newHasher().putUnencodedChars(input).hash()}. The implementation
   * <i>might</i> perform better than its longhand equivalent, but should not perform worse. Note
   * that no character encoding is performed; the low byte and high byte of each {@code char} are
   * hashed directly (in that order).
   *
   * <p><b>Warning:</b> This method will produce different output than most other languages do when

        // Verify content
        assertEquals(SmbComTransaction.TRANS2_QUERY_FS_INFORMATION, buffer[0]);
        assertEquals(0x00, buffer[1]);
        assertEquals(0x03, buffer[2]); // Low byte of 0x0103
        assertEquals(0x01, buffer[3]); // High byte of 0x0103
    }

    @DisplayName("Test toString with different information levels")
    @ParameterizedTest

        Smb2EncryptionContext context = new Smb2EncryptionContext(EncryptionNegotiateContext.CIPHER_AES128_GCM, DialectVersion.SMB311,
                encKey, decKey, sessionKey, preauthHash);

        // When - Set very low rotation limits to trigger rotation
        context.setKeyRotationBytesLimit(100); // Rotate after 100 bytes

        // Encrypt first message - should work
        byte[] plaintext1 = "Message before rotation".getBytes();

					StorageClass: "TIER-1",
				},
			},
			{
				ID:     "rule-2",
				Status: "Enabled",
				Filter: Filter{
					tagSet: true,
					Tag: Tag{
						Key:   "priority",
						Value: "low",
					},
				},
				Transition: Transition{
					Days:         TransitionDays(3),
					StorageClass: "TIER-2",
				},
			},
		},
	}

	now := time.Now().UTC()

        // Prepare buffer with specific type value
        testBuffer[0] = 0x01; // revision
        testBuffer[1] = 0x00; // padding
        testBuffer[2] = 0x04; // type low byte
        testBuffer[3] = (byte) 0x80; // type high byte (0x8004)
        // Set all offsets to 0
        for (int i = 4; i < 20; i++) {
            testBuffer[i] = 0;
        }

register, even on architectures with a hardware frame pointer.
</p>

<p>
For assembly functions with Go prototypes, <code>go</code> <code>vet</code> will check that the argument names
and offsets match.
On 32-bit systems, the low and high 32 bits of a 64-bit value are distinguished by adding
a <code>_lo</code> or <code>_hi</code> suffix to the name, as in <code>arg_lo+0(FP)</code> or <code>arg_hi+4(FP)</code>.

  /**
   * Contains the logical entries, in the range of [0, size()). The high bits of each int are the
   * part of the smeared hash of the element not covered by the hashtable mask, whereas the low bits
   * are the "next" pointer (pointing to the next entry in the bucket chain), which will always be
   * less than or equal to the hashtable mask.
   *
   * <pre>
   * hash  = aaaaaaaa
   * mask  = 00000fff

   * of values that will be added, if that knowledge is readily available. It is better to guess a
   * value slightly too high than slightly too low. If the value is not exact, the {@link
   * ImmutableLongArray} that is built will very likely occupy more memory than strictly necessary;
   * to trim memory usage, build using {@code builder.build().trimmed()}.
   */