<h3 id="Representation_of_values">Representation of values</h3>

<p>
Values of predeclared types (see below for the interfaces <code>any</code>
and <code>error</code>), arrays, and structs are self-contained:
Each such value contains a complete copy of all its data,
and <a href="#Variables">variables</a> of such types store the entire value.
For instance, an array variable provides the storage (the variables)

* 📝 Update comma in `docs/en/docs/async.md`. PR [#12062](https://github.com/fastapi/fastapi/pull/12062) by [@Alec-Gillis](https://github.com/Alec-Gillis).
* 📝 Update docs about serving FastAPI: ASGI servers, Docker containers, etc.. PR [#12069](https://github.com/fastapi/fastapi/pull/12069) by [@tiangolo](https://github.com/tiangolo).

pkg compress/flate, method (*Writer) Reset(io.Writer)
pkg compress/gzip, method (*Writer) Reset(io.Writer)
pkg compress/zlib, method (*Writer) Reset(io.Writer)
pkg container/heap, func Fix(Interface, int)
pkg container/list, method (*List) MoveAfter(*Element, *Element)
pkg container/list, method (*List) MoveBefore(*Element, *Element)
pkg crypto, type PublicKey interface {}
pkg crypto/cipher, func NewGCM(Block) (AEAD, error)

*   Support for reading (animated) GIFs
*   Improved support for SparseTensor
*   Added support for more probability distributions (Dirichlet, Beta,
    Bernoulli, etc.)
*   Added Python interfaces to reset resource containers.
*   Many bugfixes and performance improvements
*   Many documentation fixes

## Thanks to our Contributors

This release contains contributions from many people at Google, as well as:

// Nat represents an arbitrary natural number // // Each Nat has an announced length, which is the number of limbs it has stored. // Operations on this number are allowed to leak this length, but will not leak // any information about the values contained in those limbs. type Nat struct { // limbs is little-endian in base 2^W with W = bits.UintSize. limbs []uint } // preallocTarget is the size in bits of the numbers used to implement the most // common and most performant RSA key size. It's also enough...

// Nat represents an arbitrary natural number // // Each Nat has an announced length, which is the number of limbs it has stored. // Operations on this number are allowed to leak this length, but will not leak // any information about the values contained in those limbs. type Nat struct { // limbs is little-endian in base 2^W with W = bits.UintSize. limbs []uint } // preallocTarget is the size in bits of the numbers used to implement the most // common and most performant RSA key size. It's also enough...