### Refactors

* 🎨 Fix typing annotation for semi-internal `FastAPI.add_api_route()`. PR [#10240](https://github.com/fastapi/fastapi/pull/10240) by [@ordinary-jamie](https://github.com/ordinary-jamie).
* ⬆️ Upgrade version of Ruff and reformat. PR [#12032](https://github.com/fastapi/fastapi/pull/12032) by [@tiangolo](https://github.com/tiangolo).

### Docs

*   Large cleanup to add second order gradient for ops with C++ gradients and
    improve existing gradients such that most ops can now be differentiated
    multiple times.
*   Added a solver for ordinary differential equations,
    `tf.contrib.integrate.odeint`.
*   New contrib module for tensors with named axes, `tf.contrib.labeled_tensor`.
*   Visualization of embeddings in TensorBoard.

00A8          ; disallowed_STD3_mapped ; 0020 0308     # 1.1  DIAERESIS
00A9          ; valid                  ;      ; NV8    # 1.1  COPYRIGHT SIGN
00AA          ; mapped                 ; 0061          # 1.1  FEMININE ORDINAL INDICATOR
00AB..00AC    ; valid                  ;      ; NV8    # 1.1  LEFT-POINTING DOUBLE ANGLE QUOTATION MARK..NOT SIGN
00AD          ; ignored                                # 1.1  SOFT HYPHEN

i+1 < len(shiftedLimbs) { xLimbs[i] |= shiftedLimbs[i+1] << (_W - shift) } } return x } // BitLenVarTime returns the actual size of x in bits. // // The actual size of x (but nothing more) leaks through timing side-channels. // Note that this is ordinarily secret, as opposed to the announced size of x. func (x *Nat) BitLenVarTime() int { // Eliminate bounds checks in the loop. size := len(x.limbs) xLimbs := x.limbs[:size] for i := size - 1; i >= 0; i-- { if xLimbs[i] != 0 { return i*_W + bitLen(xLimbs[i])...

i+1 < len(shiftedLimbs) { xLimbs[i] |= shiftedLimbs[i+1] << (_W - shift) } } return x } // BitLenVarTime returns the actual size of x in bits. // // The actual size of x (but nothing more) leaks through timing side-channels. // Note that this is ordinarily secret, as opposed to the announced size of x. func (x *Nat) BitLenVarTime() int { // Eliminate bounds checks in the loop. size := len(x.limbs) xLimbs := x.limbs[:size] for i := size - 1; i >= 0; i-- { if xLimbs[i] != 0 { return i*_W + bitLen(xLimbs[i])...