BoringSSL. There are exhaustive tests in TestDecompose that compare it to // a straightforward implementation of Decompose from the spec, so for our // purposes it only has to work and be constant-time. r1 := (x + 127) >> 7 r1 = (r1*1025 + (1 << 21)) >> 22 r1 &= 0b1111 return byte(r1) } // decompose32 implements Decompose from FIPS 204 for γ2 = (q - 1) / 32. // // r1 is in [0, 15]. func decompose32(r fieldElement) (r1 byte, r0 int32) { x := fieldFromMontgomery(r) r1 = highBits32(x) // r - r1 * (2 * γ2)...

      Predicate<? super K> keyPredicate) {
    return compose(keyPredicate, Entry::getKey);
  }

  static <V extends @Nullable Object> Predicate<Entry<?, V>> valuePredicateOnEntries(
      Predicate<? super V> valuePredicate) {
    return compose(valuePredicate, Entry::getValue);
  }

  /**

      Predicate<? super K> keyPredicate) {
    return compose(keyPredicate, Entry::getKey);
  }

  static <V extends @Nullable Object> Predicate<Entry<?, V>> valuePredicateOnEntries(
      Predicate<? super V> valuePredicate) {
    return compose(valuePredicate, Entry::getValue);
  }

  /**

   *     the returned future.
   * @param executor Executor to run the function in.
   * @return A future that holds result of the transformation.
   * @since 9.0 (in 2.0 as {@code compose})
   */
  public static <I extends @Nullable Object, O extends @Nullable Object>
      ListenableFuture<O> transform(
          ListenableFuture<I> input, Function<? super I, ? extends O> function, Executor executor) {

* ✏ Fix minor typos in `docs/en/docs/async.md`. PR [#5125](https://github.com/tiangolo/fastapi/pull/5125) by [@Ksenofanex](https://github.com/Ksenofanex).
* 📝 Add external link to docs: "Fastapi, Docker(Docker compose) and Postgres". PR [#5033](https://github.com/tiangolo/fastapi/pull/5033) by [@krishnardt](https://github.com/krishnardt).