assertEquals(8388608, response.getTotalBytesWritten()); // 8MB total
        }

        @Test
        @DisplayName("Should create multiple independent instances")
        void testMultipleInstances() throws SMBProtocolDecodingException {
            SrvCopyChunkCopyResponse response1 = new SrvCopyChunkCopyResponse();

```toml
[tool.fastapi]
entrypoint = "my_app.main:app"
```

### Use `fastapi` with a path

When adding the entrypoint to `pyproject.toml` is not possible, or the user explicitly asks not to, or it's running an independent small app, you can pass the app file path to the `fastapi` command:

```bash
fastapi dev my_app/main.py
```

Prefer to set the entrypoint in `pyproject.toml` when possible.

## Use `Annotated`

        assertTrue(result.length() > "TransPeekNamedPipeResponse[]".length());
    }

    @Test
    @DisplayName("Multiple instances should be independent")
    void testMultipleInstances() {
        // Arrange
        TransPeekNamedPipeResponse response1 = new TransPeekNamedPipeResponse(mockConfig);

This was changed in FastAPI 0.106.0 with the intention to not hold resources while waiting for the response to travel through the network.

/// tip

Additionally, a background task is normally an independent set of logic that should be handled separately, with its own resources (e.g. its own database connection).

So, this way you will probably have cleaner code.

///

Esto cambió en FastAPI 0.106.0 con la intención de no retener recursos mientras se espera a que la response viaje por la red.

/// tip | Consejo

Adicionalmente, una tarea en segundo plano normalmente es un conjunto independiente de lógica que debería manejarse por separado, con sus propios recursos (por ejemplo, su propia conexión a la base de datos).

Así, probablemente tendrás un código más limpio.

///

    cache.put(1, 10);
    cache.put(2, 20);
    cache.put(3, 30);
    cache.put(4, 40);
    cache.put(5, 50);

    assertThat(cache.getIfPresent(10)).isNull();
    // Order required to remove dependence on access order / write order constraint.
    assertThat(cache.getIfPresent(2)).isEqualTo(20);
    assertThat(cache.getIfPresent(3)).isEqualTo(30);
    assertThat(cache.getIfPresent(4)).isEqualTo(40);

 * independent of N (but depends on the quantiles being computed). When calling {@link
 * ScaleAndIndex#computeInPlace computeInPlace} (in {@linkplain ScaleAndIndexes#computeInPlace
 * either form}), only the overhead is required. The number of object allocations is independent of
 * N in both cases.
 *
 * @author Pete Gillin
 * @since 20.0
 */

    cache.put(1, 10);
    cache.put(2, 20);
    cache.put(3, 30);
    cache.put(4, 40);
    cache.put(5, 50);

    assertThat(cache.getIfPresent(10)).isNull();
    // Order required to remove dependence on access order / write order constraint.
    assertThat(cache.getIfPresent(2)).isEqualTo(20);
    assertThat(cache.getIfPresent(3)).isEqualTo(30);
    assertThat(cache.getIfPresent(4)).isEqualTo(40);

   * This means that dynamically loaded web applications and OSGi bundles can't be unloaded.
   *
   * If the library is loaded in an application class loader, we try to break the cycle by loading
   * Finalizer in its own independent class loader:
   *
   * System class loader -> Application class loader -> ReferenceMap -> FinalizableReferenceQueue ->
   * etc. -> Decoupled class loader -> Finalizer
   *

  }

  /**
   * Builds a thread-safe map. This method does not alter the state of this {@code MapMaker}
   * instance, so it can be invoked again to create multiple independent maps.
   *
   * <p>The bulk operations {@code putAll}, {@code equals}, and {@code clear} are not guaranteed to
   * be performed atomically on the returned map. Additionally, {@code size} and {@code