}
    }

    public void test_rethrowWithWrapping() {
        // Test rethrowing with wrapping
        String originalMessage = "Original theme error";
        String wrapperMessage = "Failed to process theme";

        try {
            try {
                throw new ThemeException(originalMessage);
            } catch (ThemeException e) {

        NtlmMessage.writeSecurityBuffer(buf, 0, 8, payload);
        byte[] extracted = NtlmMessage.readSecurityBuffer(buf, 0);
        assertArrayEquals(payload, extracted, "Payload should match original");
    }

    @Test
    @DisplayName("readSecurityBuffer throws when array is too short")
    void testReadSecurityBufferShort() {
        byte[] a = new byte[] { 0x01 };

    }
  }

  private static <K extends Enum<K>, V> ImmutableMap<K, ? extends V> copyOfEnumMap(
      EnumMap<?, ? extends V> original) {
    @SuppressWarnings("unchecked") // the best we could do to make copyOf(Map) compile
    EnumMap<K, V> copy = new EnumMap<>((EnumMap<K, ? extends V>) original);
    for (Entry<K, V> entry : copy.entrySet()) {
      checkEntryNotNull(entry.getKey(), entry.getValue());
    }

        }

        @Test
        @DisplayName("Should handle encode-decode roundtrip correctly")
        void testUuidTEncodeDecodeRoundtrip() throws NdrException {
            // Given: An original UUID with specific values
            rpc.uuid_t originalUuid = new rpc.uuid_t();
            originalUuid.time_low = 0x87654321;
            originalUuid.time_mid = (short) 0x4321;

        CharMappingItem item = new CharMappingItem(1L, new String[] { "a" }, "output");
        item.setNewInputs(null);

        // Should not throw exception
        item.sort();

        // Original inputs should still be sorted
        assertEquals("a", item.getInputs()[0]);
    }

    public void test_hashCode() {
        String[] inputs1 = { "a", "b" };
        String[] inputs2 = { "a", "b" };

   * immutable list is returned.)
   *
   * <p><b>Note:</b> in almost all circumstances, the returned {@link ImmutableList} retains a
   * strong reference to {@code this}, which may prevent the original list from being garbage
   * collected. If you want the original list to be eligible for garbage collection, you should
   * create and use a copy of the sub list (e.g., {@code
   * ImmutableList.copyOf(originalList.subList(...))}).
   */
  @Override

 * "Foo&lt;Bar&gt;"} to prevent {@code "<Bar>"} from being confused with an XML tag. When the
 * resulting XML document is parsed, the parser API will return this text as the original literal
 * string {@code "Foo<Bar>"}.
 *
 * <p>A {@code CharEscaper} instance is required to be stateless, and safe when used concurrently by
 * multiple threads.
 *

   * That is, this method behaves exactly as {@code Iterables.cycle(Lists.newArrayList(elements))}.
   * The iterator's {@code hasNext} method returns {@code true} until all of the original elements
   * have been removed.
   *
   * <p><b>Warning:</b> Typical uses of the resulting iterator may produce an infinite loop. You

			}
			pi, err := z.PutObjectPart(ctx, bucket, oi.Name, res.UploadID,
				part.Number,
				NewPutObjReader(hr),
				ObjectOptions{
					PreserveETag: part.ETag, // Preserve original ETag to ensure same metadata.
					IndexCB: func() []byte {
						return part.Index // Preserve part Index to ensure decompression works.
					},
					NoAuditLog: true,
				})
			if err != nil {

   *
   * <p>After calling this method, you may not call {@link #finishToFuture()}, {@link
   * #finishToValueAndCloser(ValueAndCloserConsumer, Executor)}, or any other derivation method on
   * the original {@code ClosingFuture} instance.
   *
   * @param function transforms the value of this step to the value of the derived step
   * @param executor executor to run the function in
   * @return the derived step