assertNull(message.getRawPayload(), "rawPayload should be null initially");

        // Set a new payload and verify
        byte[] payload1 = "test_payload_1".getBytes();
        message.setRawPayload(payload1);
        assertArrayEquals(payload1, message.getRawPayload(), "getRawPayload should return the set payload");

        // Set another payload and verify
        byte[] payload2 = new byte[] { 1, 2, 3, 4, 5 };

# Set to true to add reviewers to pull requests
addReviewers: false

# Set to true to add assignees to pull requests
addAssignees: author

# A number of assignees to add to the pull request
# Set to 0 to add all of the assignees.
# Uses numberOfReviewers if unset.

    assertThat(cacheControl.mustRevalidate).isFalse()
  }

  @Test
  @Throws(Exception::class)
  fun parseEmpty() {
    val cacheControl =
      parse(
        Headers.Builder().set("Cache-Control", "").build(),
      )
    assertThat(cacheControl.toString()).isEqualTo("")
    assertThat(cacheControl.noCache).isFalse()
    assertThat(cacheControl.noStore).isFalse()

    /**
     * Get the minimum SMB Direct protocol version
     *
     * @return minimum protocol version
     */
    public int getMinVersion() {
        return minVersion;
    }

    /**
     * Set the minimum SMB Direct protocol version
     *
     * @param minVersion minimum protocol version
     */
    public void setMinVersion(int minVersion) {
        this.minVersion = minVersion;
    }

    /**

    } finally {
      function = null;
    }

    /*
     * If set()/setValue() throws an Error, we let it propagate. Why? The most likely Error is a
     * StackOverflowError (from deep transform(..., directExecutor()) nesting), and calling
     * setException(stackOverflowError) would fail:
     *
     * - If the stack overflowed before set()/setValue() could even store the result in the output

import java.util.Collection;
import java.util.Set;
import java.util.SortedMap;
import java.util.SortedSet;
import org.jspecify.annotations.Nullable;

/**
 * Basic implementation of a {@link SortedSetMultimap} with a sorted key set.
 *
 * <p>This superclass allows {@code TreeMultimap} to override methods to return navigable set and

package com.google.common.collect.testing;

import com.google.common.annotations.GwtCompatible;
import java.util.List;
import org.jspecify.annotations.NullMarked;
import org.jspecify.annotations.Nullable;

/**
 * Creates sets, containing sample elements, to be tested.
 *
 * @author Kevin Bourrillion
 */
@GwtCompatible
@NullMarked
public interface TestListGenerator<E extends @Nullable Object> extends TestCollectionGenerator<E> {
  @Override

			return association.Error
		}

		// set old associations's foreign key to null
		switch rel.Type {
		case schema.BelongsTo:
			if len(values) == 0 {
				updateMap := map[string]interface{}{}
				switch reflectValue.Kind() {
				case reflect.Slice, reflect.Array:
					for i := 0; i < reflectValue.Len(); i++ {

        generator = new TestThumbnailGenerator();

        // Default value
        assertEquals(5, generator.directoryNameLength);

        // Set new value
        generator.setDirectoryNameLength(10);
        assertEquals(10, generator.directoryNameLength);

        // Set zero
        generator.setDirectoryNameLength(0);
        assertEquals(0, generator.directoryNameLength);
    }

    } else {
      // An optimization for the undirected case: for every node B reachable from node A,
      // node A and node B have the same reachability set.
      Set<N> visitedNodes = new HashSet<>();
      for (N node : graph.nodes()) {
        if (!visitedNodes.contains(node)) {
          Set<N> reachableNodes = reachableNodes(graph, node);
          visitedNodes.addAll(reachableNodes);