Usemos las herramientas proporcionadas por **FastAPI** para manejar la seguridad.

## Cómo se ve { #how-it-looks }

Primero solo usemos el código y veamos cómo funciona, y luego volveremos para entender qué está sucediendo.

## Crea `main.py` { #create-main-py }

Copia el ejemplo en un archivo `main.py`:

Vamos usar as ferramentas fornecidas pelo **FastAPI** para lidar com segurança.

## Como Parece { #how-it-looks }

Vamos primeiro usar o código e ver como funciona, e depois voltaremos para entender o que está acontecendo.

## Crie um `main.py` { #create-main-py }

Copie o exemplo em um arquivo `main.py`:

   * by applying the given {@code AsyncFunction} to the result of the original {@code Future}.
   * Example usage:
   *
   * {@snippet :
   * FluentFuture<RowKey> rowKeyFuture = FluentFuture.from(indexService.lookUp(query));
   * ListenableFuture<QueryResult> queryFuture =
   *     rowKeyFuture.transformAsync(dataService::readFuture, executor);
   * }
   *

     */
    boolean isDfsStrictView();

    /**
     *
     * Property {@code jcifs.smb.client.dfs.disabled} (boolean, default false)
     *
     * @return whether DFS lookup is disabled
     */
    boolean isDfsDisabled();

    /**
     * Enable hack to make kerberos auth work with DFS sending short names
     *

         * Probably is not worth it, but here I make sure I restore request
         * to its original state.
         */
        try {
            LocalArtifactRepository ideWorkspace =
                    plexus.lookup(LocalArtifactRepository.class, LocalArtifactRepository.IDE_WORKSPACE);

            if (request.getLocalRepository() instanceof DelegatingLocalArtifactRepository delegatingLocalRepository) {

        DfsReferralDataInternal dr = rootDr;
        String link;

        if (path == null || path.length() <= 1) {
            /*
             * Lookup the domain based DFS root target referral. Note the
             * path is just "\" and not "\example.com\root".
             */
            link = "\\";
        } else if (path.charAt(path.length() - 1) == '\\') {

   *   <li>{@code ImmutableList.of(2, "C")}
   * </ul>
   *
   * <p>The result is guaranteed to be in the "traditional", lexicographical order for Cartesian
   * products that you would get from nesting for loops:
   *
   * {@snippet :
   * for (B b0 : lists.get(0)) {
   *   for (B b1 : lists.get(1)) {
   *     ...
   *     ImmutableList<B> tuple = ImmutableList.of(b0, b1, ...);
   *     // operate on tuple
   *   }

    /**
     * Decodes a multiline string that contains both a [certificate][certificatePem] and a
     * [private key][privateKeyPkcs8Pem], both [PEM-encoded][rfc_7468]. A typical input string looks
     * like this:
     *
     * ```
     * -----BEGIN CERTIFICATE-----
     * MIIBYTCCAQegAwIBAgIBKjAKBggqhkjOPQQDAjApMRQwEgYDVQQLEwtlbmdpbmVl
     * cmluZzERMA8GA1UEAxMIY2FzaC5hcHAwHhcNNzAwMTAxMDAwMDA1WhcNNzAwMTAx

        ReferenceQueue<Object> queue,
        PhantomReference<Object> frqRef) {
      Finalizer.startFinalizer(finalizableReferenceClass, queue, frqRef);
    }
  }

  /** Looks up Finalizer.startFinalizer(). */
  static Method getStartFinalizer(Class<?> finalizer) {
    try {
      return finalizer.getMethod(
          "startFinalizer", Class.class, ReferenceQueue.class, PhantomReference.class);

    }
    throw new AssertionError();
  }

  private static int log10Floor(int x) {
    /*
     * Based on Hacker's Delight Fig. 11-5, the two-table-lookup, branch-free implementation.
     *
     * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))), we