- Kubelet(dra): correctly handles multiple ResourceClaims...

### Other (Cleanup or Flake)

* 🔧 Update docs setup with latest configs and plugins. PR [#11953](https://github.com/fastapi/fastapi/pull/11953) by [@tiangolo](https://github.com/tiangolo).
* 🔇 Ignore warning from attrs in Trio. PR [#11949](https://github.com/fastapi/fastapi/pull/11949) by [@tiangolo](https://github.com/tiangolo).

## 0.112.0 (2024-08-02)

### Breaking Changes

!important;\n    }\n\n    a {\n      &:not(.btn) {\n        text-decoration: underline;\n      }\n    }\n\n    // Bootstrap specific; comment the following selector out\n    //a[href]::after {\n    //  content: \" (\" attr(href) \")\";\n    //}\n\n    abbr[title]::after {\n      content: \" (\" attr(title) \")\";\n    }\n\n    // Bootstrap specific; comment the following selector out\n    //\n    // Don't show links that are fragment identifiers,\n    // or use the `javascript:` pseudo protocol\n    //\n\n...

pkg encoding/xml, type MarshalerAttr interface, MarshalXMLAttr(Name) (Attr, error)
pkg encoding/xml, type Unmarshaler interface { UnmarshalXML }
pkg encoding/xml, type Unmarshaler interface, UnmarshalXML(*Decoder, StartElement) error
pkg encoding/xml, type UnmarshalerAttr interface { UnmarshalXMLAttr }
pkg encoding/xml, type UnmarshalerAttr interface, UnmarshalXMLAttr(Attr) error
pkg flag, type Getter interface { Get, Set, String }

================================================================

github.com/pkg/xattr
https://github.com/pkg/xattr
----------------------------------------------------------------
Copyright (c) 2012 Dave Cheney. All rights reserved.
Copyright (c) 2014 Kuba Podgórski. All rights reserved.

herit!important}.visible{visibility:visible!important}.invisible{visibility:hidden!important}@media print{*,::after,::before{text-shadow:none!important;box-shadow:none!important}a:not(.btn){text-decoration:underline}abbr[title]::after{content:" (" attr(title) ")"}pre{white-space:pre-wrap!important}blockquote,pre{border:1px solid #adb5bd;page-break-inside:avoid}img,tr{page-break-inside:avoid}h2,h3,p{orphans:3;widows:3}h2,h3{page-break-after:avoid}@page{size:a3}body{min-width:992px!important}.cont...

Appendix A.4.2 makes us check x <= N - 2 and then return // x + 1. Note that it follows that 0 < x + 1 < N. Instead, SetBytes // checks that k < N, and we explicitly check 0 != k. Since k can't be // negative, this is strictly equivalent. None of this matters anyway // because the chance of selecting zero is cryptographically negligible. if k, err := bigmod.NewNat().SetBytes(b, c.N); err == nil && k.IsZero() == 0 { p, err := c.newPoint().ScalarBaseMult(k.Bytes(c.N)) return k, p, err } if testingOnlyRejection...

Appendix A.4.2 makes us check x <= N - 2 and then return // x + 1. Note that it follows that 0 < x + 1 < N. Instead, SetBytes // checks that k < N, and we explicitly check 0 != k. Since k can't be // negative, this is strictly equivalent. None of this matters anyway // because the chance of selecting zero is cryptographically negligible. if k, err := bigmod.NewNat().SetBytes(b, c.N); err == nil && k.IsZero() == 0 { p, err := c.newPoint().ScalarBaseMult(k.Bytes(c.N)) return k, p, err } if testingOnlyRejection...