Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 60 for hossen (0.14 sec)

  1. src/main/resources/fess_indices/_aws/fess.json

    "enn", "fordi", "før", "mange", "også", "slik", "vært", "være", "båe", "begge", "siden", "dykk", "dykkar", "dei", "deira", "deires", "deim", "di", "då", "eg", "ein", "eit", "eitt", "elles", "honom", "hjå", "ho", "hoe", "henne", "hennar", "hennes", "hoss", "hossen", "ikkje", "ingi", "inkje", "korleis", "korso", "kva", "kvar", "kvarhelst", "kven", "kvi", "kvifor", "me", "medan", "mi", "mine", "mykje", "no", "nokon", "noka", "nokor", "noko", "nokre", "si", "sia", "sidan", "so", "somt", "somme", "um", "upp",...
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Jun 14 00:36:40 UTC 2025
    - 117.3K bytes
    - Viewed (0)
  2. docs/de/docs/tutorial/security/oauth2-jwt.md

    Und Ihre Benutzer könnten sich gleichzeitig über Ihre Django-Anwendung oder Ihre **FastAPI**-Anwendung anmelden.
    
    ///
    
    ## Die Passwörter hashen und überprüfen
    
    Importieren Sie die benötigten Tools aus `passlib`.
    
    Erstellen Sie einen PassLib-„Kontext“. Der wird für das Hashen und Verifizieren von Passwörtern verwendet.
    
    /// tip | Tipp
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 12.1K bytes
    - Viewed (0)
  3. docs/de/docs/how-to/custom-docs-ui-assets.md

    ## JavaScript und CSS für die Dokumentation selbst hosten
    
    Das Selbst Hosten von JavaScript und CSS kann nützlich sein, wenn Sie beispielsweise möchten, dass Ihre Anwendung auch offline, ohne bestehenden Internetzugang oder in einem lokalen Netzwerk weiter funktioniert.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Mon Apr 28 18:31:44 UTC 2025
    - 8.9K bytes
    - Viewed (0)
  4. android/guava-tests/test/com/google/common/math/MathBenchmarking.java

        } while (result.signum() == 0);
        return result;
      }
    
      /**
       * Generates a number in [0, 2^numBits) with an exponential distribution. The floor of the log2 of
       * the result is chosen uniformly at random in [0, numBits), and then the result is chosen in that
       * range uniformly at random. Zero is treated as having log2 == 0.
       */
      static BigInteger randomNonNegativeBigInteger(int numBits) {
        int digits = RANDOM_SOURCE.nextInt(numBits);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Aug 10 19:54:19 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  5. guava-tests/test/com/google/common/math/MathBenchmarking.java

        } while (result.signum() == 0);
        return result;
      }
    
      /**
       * Generates a number in [0, 2^numBits) with an exponential distribution. The floor of the log2 of
       * the result is chosen uniformly at random in [0, numBits), and then the result is chosen in that
       * range uniformly at random. Zero is treated as having log2 == 0.
       */
      static BigInteger randomNonNegativeBigInteger(int numBits) {
        int digits = RANDOM_SOURCE.nextInt(numBits);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Aug 10 19:54:19 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  6. docs/de/docs/advanced/security/oauth2-scopes.md

    Da diese Abhängigkeitsfunktion selbst keine Scope-Anforderungen hat, können wir `Depends` mit `oauth2_scheme` verwenden. Wir müssen `Security` nicht verwenden, wenn wir keine Sicherheits-Scopes angeben müssen.
    
    Wir deklarieren auch einen speziellen Parameter vom Typ `SecurityScopes`, der aus `fastapi.security` importiert wird.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 15.1K bytes
    - Viewed (0)
  7. guava-tests/test/com/google/common/hash/HashingTest.java

      private void countRemaps(long h, AtomicLongMap<Integer> map) {
        int last = 0;
        for (int shards = 2; shards <= MAX_SHARDS; shards++) {
          int chosen = Hashing.consistentHash(h, shards);
          if (chosen != last) {
            map.incrementAndGet(shards);
            last = chosen;
          }
        }
      }
    
      private static final int ITERS = 10000;
      private static final int MAX_SHARDS = 500;
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 17:27:14 UTC 2025
    - 26.4K bytes
    - Viewed (2)
  8. .github/workflows/arm-ci-extended.yml

          - v2.**
      schedule:
        - cron: '0 4 * * *'
    
    permissions:
      contents: read
    
    jobs:
      build:
        if: github.repository == 'tensorflow/tensorflow' # Don't do this in forks
        runs-on: [self-hosted, linux, ARM64]
        strategy:
          fail-fast: false
          matrix:
            pyver: ['3.9', '3.10', '3.11', '3.12']
        steps:
          - name: Stop old running containers (if any)
            shell: bash
            run: |
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Mon Sep 01 15:40:11 UTC 2025
    - 2.6K bytes
    - Viewed (0)
  9. docs/de/docs/tutorial/path-params.md

    ## Pydantic
    
    Die ganze Datenvalidierung wird hinter den Kulissen von <a href="https://pydantic-docs.helpmanual.io/" class="external-link" target="_blank">Pydantic</a> durchgeführt, Sie profitieren also von dessen Vorteilen. Und Sie wissen, dass Sie in guten Händen sind.
    
    Sie können für Typ Deklarationen auch `str`, `float`, `bool` und viele andere komplexe Datentypen verwenden.
    
    Mehrere davon werden wir in den nächsten Kapiteln erkunden.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:29:01 UTC 2025
    - 10K bytes
    - Viewed (0)
  10. guava/src/com/google/common/math/BigDecimalMath.java

       * <p>For the case of {@link RoundingMode#HALF_EVEN}, this implementation uses the IEEE 754
       * default rounding mode: if the two nearest representable values are equally near, the one with
       * the least significant bit zero is chosen. (In such cases, both of the nearest representable
       * values are even integers; this method returns the one that is a multiple of a greater power of
       * two.)
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 3K bytes
    - Viewed (0)
Back to top