2075          ; mapped                 ; 0035          # 1.1  SUPERSCRIPT FIVE
2076          ; mapped                 ; 0036          # 1.1  SUPERSCRIPT SIX
2077          ; mapped                 ; 0037          # 1.1  SUPERSCRIPT SEVEN
2078          ; mapped                 ; 0038          # 1.1  SUPERSCRIPT EIGHT
2079          ; mapped                 ; 0039          # 1.1  SUPERSCRIPT NINE

* `tf.data`
    * Add optional `synchronous` argument to `map`, to specify that the `map` should run synchronously, as opposed to be parallelizable when `options.experimental_optimization.map_parallelization=True`. This saves memory compared to setting `num_parallel_calls=1`.

### CSI Volume health monitoring
 

* 📝 Fix typos in code comments. PR [#14364](https://github.com/fastapi/fastapi/pull/14364) by [@Edge-Seven](https://github.com/Edge-Seven).
* 📝 Add docs for using FastAPI Cloud. PR [#14359](https://github.com/fastapi/fastapi/pull/14359) by [@tiangolo](https://github.com/tiangolo).

## 0.121.2 (2025-11-13)

### Fixes

borders.\n  // This isn't needed for `.input-group-text` since it shares the same border-color\n  // as our inputs.\n  .btn {\n    position: relative;\n    z-index: 2;\n\n    &:focus {\n      z-index: 5;\n    }\n  }\n}\n\n\n// Textual addons\n//\n// Serves as a catch-all element for any text or radio/checkbox input you wish\n// to prepend or append to an input.\n\n.input-group-text {\n  display: flex;\n  align-items: center;\n  padding: $input-group-addon-padding-y $input-group-addon-padding-x;\n  @include...

.input-group-text,\n  .input-group-text + .btn {\n    margin-left: -$input-border-width;\n  }\n}\n\n.input-group-prepend { margin-right: -$input-border-width; }\n.input-group-append { margin-left: -$input-border-width; }\n\n\n// Textual addons\n//\n// Serves as a catch-all element for any text or radio/checkbox input you wish\n// to prepend or append to an input.\n\n.input-group-text {\n  display: flex;\n  align-items: center;\n  padding: $input-padding-y $input-padding-x;\n  margin-bottom: 0; // Allow...

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]. This saves an extra // subtraction due to which coefficients were negated. // 5. Rename x and y to a and n, to capture that one is a modulus. // 6. Rearrange steps 4 through 6 slightly. Merge the loops in steps 4 and // 5 into the main loop (step 7's goto), and...

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]. This saves an extra // subtraction due to which coefficients were negated. // 5. Rename x and y to a and n, to capture that one is a modulus. // 6. Rearrange steps 4 through 6 slightly. Merge the loops in steps 4 and // 5 into the main loop (step 7's goto), and...