</div>

Und kopieren Sie die Ausgabe in die Variable `SECRET_KEY` (verwenden Sie nicht die im Beispiel).

Erstellen Sie eine Variable `ALGORITHM` für den Algorithmus, der zum Signieren des JWT-Tokens verwendet wird, und setzen Sie sie auf `"HS256"`.

Erstellen Sie eine Variable für das Ablaufdatum des Tokens.

     * @return the home directory path
     */
    public String getHomeDirectory() {
        return this.homeDirectory;
    }

    /**
     * Returns the user's home drive letter.
     * @return the home drive
     */
    public String getHomeDrive() {
        return this.homeDrive;
    }

    /**
     * Returns the name of the server that authenticated the user.

Um beispielsweise noch etwas Leistung herauszuholen, können Sie <a href="https://github.com/ijl/orjson" class="external-link" target="_blank">`orjson`</a> installieren und die Response als `ORJSONResponse` setzen.

Importieren Sie die `Response`-Klasse (Unterklasse), die Sie verwenden möchten, und deklarieren Sie sie im *Pfadoperation-Dekorator*.

{* ../../docs_src/bigger_applications/app_an_py39/routers/items.py hl[30:31] title["app/routers/items.py"] *}

/// tip | Tipp

Diese letzte Pfadoperation wird eine Kombination von Tags haben: `["items", "custom"]`.

labels.labelTypeIds=Labels
labels.lang=Taal
labels.outputs=Uitvoer
labels.pos=Woordsoort
labels.purgeJobLogDay=Vorige taaklogboeken verwijderen
labels.purgeUserInfoDay=Vorige gebruikerslogboeken verwijderen
labels.reading=Lezen
labels.roleTypeIds=Rol-ID
labels.scriptData=Script
labels.scriptResult=Resultaat
labels.scriptType=Uitvoeringstype
labels.segmentation=Segmentatie
labels.startTime=Starttijd
labels.target=Doel

errors.failed_to_upgrade_from=Kan niet upgraden vanaf {0}.
errors.failed_to_reindex=Kan herindexering van {0} naar {1} niet starten.
errors.failed_to_read_request_file=Kan verzoekbestand niet lezen: {0}
errors.invalid_header_for_request_file=Ongeldige headerregel: {0}
errors.could_not_delete_logged_in_user=Kan ingelogde gebruiker niet verwijderen.
errors.unauthorized_request=Ongeautoriseerd verzoek.

    /*
     * The striding algorithm works roughly as follows: it is universally the case that
     * CRC(x ^ y) == CRC(x) ^ CRC(y).  The approach we take is to break the message as follows,
     * with each letter representing a 4-byte word: ABCDABCDABCDABCD... and to calculate
     * CRC(A000A000A000...), CRC(0B000B000B...), CRC(00C000C000C...), CRC(000D000D000D...)

		// A is 65, a is 97
		if v >= 'a' {
			b.WriteRune(v)
			continue
		}
		// v is capital letter here
		// disregard first letter
		// add underscore if last letter is capital letter
		// add underscore when previous letter is lowercase
		// add underscore when next letter is lowercase
		if (i != 0 || i == l-1) && ((i > 0 && rune(camel[i-1]) >= 'a') ||
			(i < l-1 && rune(camel[i+1]) >= 'a')) {

     * for this entry is one, this is simply the string representation of the corresponding element.
     * Otherwise, it is the string representation of the element, followed by the three characters
     * {@code " x "} (space, letter x, space), followed by the count.
     */
    @Override
    String toString();
  }

  // Comparison and hashing

  /**

     * for this entry is one, this is simply the string representation of the corresponding element.
     * Otherwise, it is the string representation of the element, followed by the three characters
     * {@code " x "} (space, letter x, space), followed by the count.
     */
    @Override
    String toString();
  }

  /**
   * Runs the specified action for each distinct element in this multiset, and the number of