Search Options

Results per page
Sort
Preferred Languages
Advance

Results 101 - 110 of 159 for rank (0.04 sec)

  1. okhttp/src/commonJvmAndroid/kotlin/okhttp3/MultipartReader.kt

            boundaryIndex != -1L -> boundaryIndex // We found the boundary.
            source.buffer.size >= toIndex -> minOf(toIndex, maxByteCount) // No boundary before toIndex.
            else -> throw EOFException() // We ran out of data before we found the required boundary.
          }
        }
    
        @Throws(IOException::class)
        override fun close() {
          if (closed) return
          closed = true
          currentPart = null
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Wed May 28 02:11:14 UTC 2025
    - 7.3K bytes
    - Viewed (0)
  2. docs/de/docs/tutorial/security/oauth2-jwt.md

    Um einen sicheren zufälligen geheimen Schlüssel zu generieren, verwenden Sie den folgenden Befehl:
    
    <div class="termy">
    
    ```console
    $ openssl rand -hex 32
    
    09d25e094faa6ca2556c818166b7a9563b93f7099f6f0f4caa6cf63b88e8d3e7
    ```
    
    </div>
    
    Und kopieren Sie die Ausgabe in die Variable `SECRET_KEY` (verwenden Sie nicht die im Beispiel).
    
    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/es/docs/tutorial/security/oauth2-jwt.md

    Crea una clave secreta aleatoria que se usará para firmar los tokens JWT.
    
    Para generar una clave secreta segura al azar usa el comando:
    
    <div class="termy">
    
    ```console
    $ openssl rand -hex 32
    
    09d25e094faa6ca2556c818166b7a9563b93f7099f6f0f4caa6cf63b88e8d3e7
    ```
    
    </div>
    
    Y copia el resultado a la variable `SECRET_KEY` (no uses la del ejemplo).
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 10.9K bytes
    - Viewed (0)
  4. cmd/erasure-healing_test.go

    	data := make([]byte, 1*humanize.MiByte)
    	length := int64(len(data))
    	_, err = rand.Read(data)
    	if err != nil {
    		t.Fatal(err)
    	}
    
    	oi1, err := obj.PutObject(ctx, bucket, object, mustGetPutObjReader(t, bytes.NewReader(data), length, "", ""), ObjectOptions{})
    	if err != nil {
    		t.Fatal(err)
    	}
    	// 2nd version.
    	_, _ = rand.Read(data)
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 48.5K bytes
    - Viewed (0)
  5. docs/de/docs/tutorial/testing.md

    # Testen
    
    Dank <a href="https://www.starlette.io/testclient/" class="external-link" target="_blank">Starlette</a> ist das Testen von **FastAPI**-Anwendungen einfach und macht Spaß.
    
    Es basiert auf <a href="https://www.python-httpx.org" class="external-link" target="_blank">HTTPX</a>, welches wiederum auf der Grundlage von requests konzipiert wurde, es ist also sehr vertraut und intuitiv.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Mon Nov 18 02:25:44 UTC 2024
    - 6.9K bytes
    - Viewed (0)
  6. src/bufio/scan_test.go

    				break
    			}
    			runeCount++
    			got, _ := utf8.DecodeRune(s.Bytes())
    			if got != expect {
    				t.Errorf("#%d: %d: expected %q got %q", n, i, expect, got)
    			}
    		}
    		if s.Scan() {
    			t.Errorf("#%d: scan ran too long, got %q", n, s.Text())
    		}
    		testRuneCount := utf8.RuneCountInString(test)
    		if runeCount != testRuneCount {
    			t.Errorf("#%d: termination expected at %d; got %d", n, testRuneCount, runeCount)
    		}
    		err := s.Err()
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Fri Sep 22 16:22:42 UTC 2023
    - 14.3K bytes
    - Viewed (0)
  7. cmd/erasure-server-pool-decom.go

    		go func() {
    			// Resume decommissioning of pools, but wait 3 minutes for cluster to stabilize.
    			if err := sleepContext(ctx, 3*time.Minute); err != nil {
    				return
    			}
    			r := rand.New(rand.NewSource(time.Now().UnixNano()))
    			for {
    				if err := z.Decommission(ctx, poolIndices...); err != nil {
    					if errors.Is(err, errDecommissionAlreadyRunning) {
    						// A previous decommission running found restart it.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 42.1K bytes
    - Viewed (1)
  8. cmd/data-scanner.go

    	scannerExcessFolders                 = uatomic.NewInt64(50000)
    )
    
    // initDataScanner will start the scanner in the background.
    func initDataScanner(ctx context.Context, objAPI ObjectLayer) {
    	go func() {
    		r := rand.New(rand.NewSource(time.Now().UnixNano()))
    		// Run the data scanner in a loop
    		for {
    			runDataScanner(ctx, objAPI)
    			duration := max(time.Duration(r.Float64()*float64(scannerCycle.Load())),
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 45.5K bytes
    - Viewed (0)
  9. cmd/iam.go

    	globalServerConfigMu.RLock()
    	s := globalServerConfig
    	globalServerConfigMu.RUnlock()
    
    	sys.Lock()
    	sys.iamRefreshInterval = iamRefreshInterval
    	sys.Unlock()
    
    	r := rand.New(rand.NewSource(time.Now().UnixNano()))
    
    	var (
    		openidInit bool
    		ldapInit   bool
    		authNInit  bool
    		authZInit  bool
    	)
    
    	stsTLSConfig, err := xtls.Lookup(s[config.IdentityTLSSubSys][config.Default])
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 75.3K bytes
    - Viewed (0)
  10. android/guava-tests/test/com/google/common/math/IntMathTest.java

        for (int i = 0; i < 100000; i++) {
          assertEquals(LongMath.isPrime(i), IntMath.isPrime(i));
        }
    
        // Then check 1000 deterministic pseudo-random int values.
        Random rand = new Random(1);
        for (int i = 0; i < 1000; i++) {
          int n = rand.nextInt(Integer.MAX_VALUE);
          assertEquals(LongMath.isPrime(n), IntMath.isPrime(n));
        }
      }
    
      public void testSaturatedAbs() {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 24.1K bytes
    - Viewed (0)
Back to top