*
   * <p><b>Warning:</b> this cache may not be recording statistical data. For example, a cache
   * created using {@link CacheBuilder} only does so if the {@link CacheBuilder#recordStats} method
   * was called. If statistics are not being recorded, a {@code CacheStats} instance with zero for
   * all values is returned.
   *
   */
  CacheStats stats();

  /**

     *            The return type of the method
     * @param method
     *            The method. Cannot be {@literal null}
     * @param target
     *            The object on which the underlying method is to be called. {@literal null} for {@literal static} methods
     * @param args
     *            The arguments used for the method call
     * @return The result of dispatching the method to the object using the parameters {@code args}

            byte[] actualFileId = new byte[16];
            System.arraycopy(buffer, 80, actualFileId, 0, 16);
            assertArrayEquals(testFileId, actualFileId);

            // Verify that info.encode was called
            verify(mockInfo, times(1)).encode(any(byte[].class), anyInt());

            // Verify total bytes written
            assertTrue(bytesWritten > 32); // At least the fixed part plus some info

![Editor Unterstützung](https://fastapi.tiangolo.com/img/pycharm-completion.png)

Sie bekommen sogar Autovervollständigung an Stellen, an denen Sie dies vorher nicht für möglich gehalten hätten. Zum Beispiel der `price` Schlüssel in einem JSON Datensatz (dieser könnte auch verschachtelt sein), der aus einem Request kommt.

            // Arrange
            SID sid = new SID("S-1-5-21-1");

            // Act
            sid.resolve("server.example", mockCtx);

            // Assert: resolver.resolveSids called with this SID
            ArgumentCaptor<jcifs.SID[]> captor = ArgumentCaptor.forClass(jcifs.SID[].class);
            verify(mockResolver, times(1)).resolveSids(same(mockCtx), eq("server.example"), captor.capture());

   * fluent iterable.
   *
   * <p>That iterator supports {@code remove()} if {@code iterable.iterator()} does. After {@code
   * remove()} is called, subsequent cycles omit the removed element, which is no longer in this
   * fluent iterable. The iterator's {@code hasNext()} method returns {@code true} until this fluent
   * iterable is empty.
   *

  //
  // Essentially, then, `table[h]` gives us the start of a linked list in `entries`, where every
  // element of the list has the short hash value h.
  //
  // A wrinkle here is that the value 0 (called UNSET in the code) is used as the equivalent of a
  // null pointer. If `table[h] == 0` that means there are no keys in the map whose short hash is h.

   * fluent iterable.
   *
   * <p>That iterator supports {@code remove()} if {@code iterable.iterator()} does. After {@code
   * remove()} is called, subsequent cycles omit the removed element, which is no longer in this
   * fluent iterable. The iterator's {@code hasNext()} method returns {@code true} until this fluent
   * iterable is empty.
   *

import java.util.Collection;
import java.util.Map;
import java.util.Objects;
import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * A collection that associates an ordered pair of keys, called a row key and a column key, with a
 * single value. A table may be sparse, with only a small fraction of row key / column key pairs
 * possessing a corresponding value.
 *

     * where this is needed - however, functionality
     * like this is needed.
     *
     * @param methodName name of method
     * @param args       the actual arguments with which the method is called
     * @return the most specific applicable method, or null if no
     *         method is applicable.
     * @throws AmbiguousException if there is more than one maximally