- Removes the deprecated command `kubectl rolling-update` ([#88057](https://github.com/kubernetes/kubernetes/pull/88057), [@julianvmodesto](https://github.com/julianvmodesto)) [SIG Architecture, CLI and Testing]

1F641..1F642  ; valid                  ;      ; NV8    # 7.0  SLIGHTLY FROWNING FACE..SLIGHTLY SMILING FACE
1F643..1F644  ; valid                  ;      ; NV8    # 8.0  UPSIDE-DOWN FACE..FACE WITH ROLLING EYES
1F645..1F64F  ; valid                  ;      ; NV8    # 6.0  FACE WITH NO GOOD GESTURE..PERSON WITH FOLDED HANDS
1F650..1F67F  ; valid                  ;      ; NV8    # 7.0  NORTH WEST POINTING LEAF..REVERSE CHECKER BOARD

            *   Uses of `tensors()` can be replaced by calling the existing
                methods `tensors_size()` and `tensor(int)`.
            *   Uses of the non-const overload of `nodes_and_registration` can
                be replaced by calling the existing methods `nodes_size()` and
                `context()`, and then calling the `GetNodeAndRegistration`

## 0.120.3 (2025-10-30)

### Refactors

* ♻️ Reduce internal cyclic recursion in dependencies, from 2 functions calling each other to 1 calling itself. PR [#14256](https://github.com/fastapi/fastapi/pull/14256) by [@tiangolo](https://github.com/tiangolo).

     */
    Integer getSchedulerMonitorIntervalAsInteger();

    /**
     * Get the value for the key 'coordinator.poll.interval'. <br>
     * The value is, e.g. 60 <br>
     * comment: Interval (seconds) for polling heartbeats and events.
     * @return The value of found property. (NotNull: if not found, exception but basically no way)
     */
    String getCoordinatorPollInterval();

    /**

https://go.dev/issue/13907). copy(x.reset(n).limbs, T[n:]) x.maybeSubtractModulus(choice(c), m) // The following specialized cases follow the exact same algorithm, but // optimized for the sizes most used in RSA. addMulVVW is implemented in // assembly with loop unrolling depending on the architecture and bounds // checks are removed by the compiler thanks to the constant size. case 1024 / _W: const n = 1024 / _W // compiler hint T := make([]uint, n*2) var c uint for i := 0; i < n; i++ { d := bLimbs[i] c1 := addMulVVW1024(&T[i],...

https://go.dev/issue/13907). copy(x.reset(n).limbs, T[n:]) x.maybeSubtractModulus(choice(c), m) // The following specialized cases follow the exact same algorithm, but // optimized for the sizes most used in RSA. addMulVVW is implemented in // assembly with loop unrolling depending on the architecture and bounds // checks are removed by the compiler thanks to the constant size. case 1024 / _W: const n = 1024 / _W // compiler hint T := make([]uint, n*2) var c uint for i := 0; i < n; i++ { d := bLimbs[i] c1 := addMulVVW1024(&T[i],...