216C          ; mapped                 ; 006C          # 1.1  ROMAN NUMERAL FIFTY
216D          ; mapped                 ; 0063          # 1.1  ROMAN NUMERAL ONE HUNDRED
216E          ; mapped                 ; 0064          # 1.1  ROMAN NUMERAL FIVE HUNDRED
216F          ; mapped                 ; 006D          # 1.1  ROMAN NUMERAL ONE THOUSAND
2170          ; mapped                 ; 0069          # 1.1  SMALL ROMAN NUMERAL ONE

    of the data type of the input image.
*   The image processing ops do not take `min` and `max` inputs any more,
    casting safety is handled by `saturate_cast`, which makes sure over- and
    underflows are handled before casting to data types with smaller ranges.
*   For C++ API users: `IsLegacyScalar` and `IsLegacyVector` are now gone from

* 👷 Disable MkDocs insiders social plugin while an issue in MkDocs Material is handled. PR [#11373](https://github.com/tiangolo/fastapi/pull/11373) by [@tiangolo](https://github.com/tiangolo).

- Disable watchcache for events ([#96052](https://github.com/kubernetes/kubernetes/pull/96052), [@wojtek-t](https://github.com/wojtek-t)) [SIG API Machinery]
- Disabled `LocalStorageCapacityIsolation` feature gate is honored during scheduling. ([#96140](https://github.com/kubernetes/kubernetes/pull/96140), [@Huang-Wei](https://github.com/Huang-Wei)) [SIG Scheduling]

Following the proof linked in the PR above, the changes are: // // 1. Negate [B] and [C] so they are positive. The invariant now involves a // subtraction. // 2. If step 2 (both [x] and [y] are even) runs, abort immediately. This // case needs to be handled by the caller. // 3. Subtract copies of [x] and [y] as needed in step 6 (both [u] and [v] // are odd) so coefficients stay in bounds. // 4. Replace the [u >= v] check with [u > v]. This changes the end // condition to [v = 0] rather than [u = 0]....

Following the proof linked in the PR above, the changes are: // // 1. Negate [B] and [C] so they are positive. The invariant now involves a // subtraction. // 2. If step 2 (both [x] and [y] are even) runs, abort immediately. This // case needs to be handled by the caller. // 3. Subtract copies of [x] and [y] as needed in step 6 (both [u] and [v] // are odd) so coefficients stay in bounds. // 4. Replace the [u >= v] check with [u > v]. This changes the end // condition to [v = 0] rather than [u = 0]....