* explanation.
 *
 * @param <K> the most general key type this builder will be able to create caches for. This is
 *     normally {@code Object} unless it is constrained by using a method like {@link
 *     #removalListener}. Cache keys may not be null.
 * @param <V> the most general value type this builder will be able to create caches for. This is
 *     normally {@code Object} unless it is constrained by using a method like {@link

            assertEquals(currentTime - 1000, lastAccess, "Should return correct last access time");
            assertEquals(currentTime - 2000, createTime, "Should return correct create time");
            assertTrue(createTime <= lastAccess, "Create time should be before or equal to last access");
            assertTrue(lastAccess <= lastModified, "Last access should be before or equal to last modified");
        }

        @Test

# Header Parameter Models { #header-parameter-models }

If you have a group of related **header parameters**, you can create a **Pydantic model** to declare them.

This would allow you to **re-use the model** in **multiple places** and also to declare validations and metadata for all the parameters at once. 😎

/// note

This is supported since FastAPI version `0.115.0`. 🤓

///

 * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data.
 *
 * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as
 * breadth first traversal) that only need a way of accessing the successors of a node in a graph.
 *
 * <h3>Usage</h3>
 *
 * Given an algorithm, for example:
 *
 * {@snippet :

 * which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger
 * than {@code size()}. Furthermore, this structure only depends on a fixed number of arrays; {@code
 * add(x)} operations <i>do not</i> create objects for the garbage collector to deal with, and for
 * every element added, the garbage collector will have to traverse {@code 1.5} references on
 * average, in the marking phase, not {@code 5.0} as in {@code java.util.HashSet}.

     * @param input the protected word input
     */
    public ProtwordsItem(final long id, final String input) {
        this.id = id;
        this.input = input;

        if (id == 0) {
            // create
            newInput = input;
        }
    }

    /**
     * Gets the new input value for this item.
     * @return the new input value
     */
    public String getNewInput() {
        return newInput;

    private int minVersion;
    private int maxVersion;
    private int creditsRequested;
    private int preferredSendSize;
    private int maxReceiveSize;
    private int maxFragmentedSize;

    /**
     * Create new RDMA negotiation request
     */
    public RdmaNegotiateRequest() {
        // Initialize with default values
        this.minVersion = 0x0100; // SMB Direct 1.0
        this.maxVersion = 0x0100; // SMB Direct 1.0

import jcifs.internal.smb2.persistent.HandleGuid;
import jcifs.internal.smb2.persistent.HandleType;
import jcifs.internal.smb2.persistent.Smb2HandleCapabilities;

/**
 * Test class for durable handle create context implementations
 */
public class DurableHandleContextTest {

    @Test
    public void testDurableHandleRequest() {
        DurableHandleRequest request = new DurableHandleRequest();

  @CollectionSize.Require(absent = ZERO)
  public void testAdd_supportedNullPresent() {
    E[] array = createArrayWithNullElement();
    collection = getSubjectGenerator().create(array);
    assertTrue("add(nullPresent) should return true", getList().add(null));

    List<E> expected = copyToList(array);
    expected.add(null);
    expectContents(expected);
  }

  /**

 * </ul>
 *
 * <p>For internal session operations, the trace typically contains {@code *Request} objects
 * that represent the current processing state. Client code can also create traces with
 * application-specific data to provide context when invoking session methods.</p>
 *
 * <p>This trace information is particularly useful for:</p>
 * <ul>
 *   <li>Debugging and troubleshooting request flows</li>