Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 901 - 910 of 1,071 for nprend (0.1 seconds)

  1. docs/distributed/README.md

    - **Each object is written to a single EC set, and therefore is spread over no more than 16 drives.**
    - **All the nodes running distributed MinIO setup are recommended to be homogeneous, i.e. same operating system, same number of drives and same network interconnects.**
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 8.9K bytes
    - Click Count (0)
  2. docs/fr/docs/tutorial/dependencies/dependencies-with-yield.md

    # Utiliser des dépendances avec `yield` { #dependencies-with-yield }
    
    FastAPI prend en charge des dépendances qui effectuent des <dfn title='parfois aussi appelées « exit code », « cleanup code », « teardown code », « closing code », « context manager exit code », etc.'>étapes supplémentaires après l'exécution</dfn>.
    
    Pour cela, utilisez `yield` au lieu de `return`, et écrivez les étapes supplémentaires (code) après.
    
    /// tip | Astuce
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:37:13 GMT 2026
    - 13.9K bytes
    - Click Count (0)
  3. internal/jwt/parser.go

    type HashBorrower struct {
    	pool     *bpool.Pool[hash.Hash]
    	borrowed []hash.Hash
    }
    
    // Borrow a single hasher.
    func (h *HashBorrower) Borrow() hash.Hash {
    	hasher := h.pool.Get()
    	h.borrowed = append(h.borrowed, hasher)
    	hasher.Reset()
    	return hasher
    }
    
    // ReturnAll will return all borrowed hashes.
    func (h *HashBorrower) ReturnAll() {
    	for _, hasher := range h.borrowed {
    		h.pool.Put(hasher)
    	}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 14.1K bytes
    - Click Count (0)
  4. android/guava/src/com/google/common/collect/FluentIterable.java

       * {@code Iterator} supports it.
       *
       * <p><b>{@code Stream} equivalent:</b> {@link Stream#concat}.
       *
       * @since 18.0
       */
      public final FluentIterable<E> append(Iterable<? extends E> other) {
        return FluentIterable.concat(getDelegate(), other);
      }
    
      /**
       * Returns a fluent iterable whose iterators traverse first the elements of this fluent iterable,
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Apr 02 14:49:41 GMT 2026
    - 34.7K bytes
    - Click Count (0)
  5. guava/src/com/google/common/collect/FluentIterable.java

       * {@code Iterator} supports it.
       *
       * <p><b>{@code Stream} equivalent:</b> {@link Stream#concat}.
       *
       * @since 18.0
       */
      public final FluentIterable<E> append(Iterable<? extends E> other) {
        return FluentIterable.concat(getDelegate(), other);
      }
    
      /**
       * Returns a fluent iterable whose iterators traverse first the elements of this fluent iterable,
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Apr 02 14:49:41 GMT 2026
    - 34.7K bytes
    - Click Count (0)
  6. docs/fr/docs/tutorial/first-steps.md

    Cette syntaxe `@something` en Python est appelée un « décorateur ».
    
    Vous la mettez au-dessus d’une fonction. Comme un joli chapeau décoratif (j’imagine que c’est de là que vient le terme 🤷🏻‍♂).
    
    Un « décorateur » prend la fonction en dessous et fait quelque chose avec.
    
    Dans notre cas, ce décorateur indique à **FastAPI** que la fonction en dessous correspond au **chemin** `/` avec une **opération** `get`.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:37:13 GMT 2026
    - 15.1K bytes
    - Click Count (0)
  7. guava/src/com/google/common/collect/RegularImmutableMap.java

          ImmutableMapEntry<K, V> effectiveEntry =
              checkNoConflictInKeyBucket(key, value, keyBucketHead, throwIfDuplicateKeys);
          if (effectiveEntry == null) {
            // prepend, not append, so the entries can be immutable
            effectiveEntry =
                (keyBucketHead == null)
                    ? makeImmutable(entry, key, value)
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Dec 26 20:08:09 GMT 2025
    - 15.7K bytes
    - Click Count (0)
  8. src/test/java/org/codelibs/fess/llm/AbstractLlmClientTest.java

                // Capture the system message
                for (final LlmMessage msg : request.getMessages()) {
                    if ("system".equals(msg.getRole())) {
                        captured.append(msg.getContent());
                    }
                }
                callback.onChunk("response", true);
            });
    
            client.generateSummaryResponse("summarize", documents, history, (chunk, done) -> {});
    
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Thu Mar 19 07:04:54 GMT 2026
    - 53K bytes
    - Click Count (0)
  9. cmd/encryption-v1.go

    				ETag, err := etag.Parse(object.ETag)
    				if err != nil {
    					continue
    				}
    				if ETag.IsEncrypted() {
    					SSES3SinglePartObjects[i] = true
    					metadata = append(metadata, object.UserDefined)
    					buckets = append(buckets, object.Bucket)
    					names = append(names, object.Name)
    				}
    			}
    		}
    
    		// If there are no SSE-S3 single-part objects
    		// we can skip the decryption process. However,
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 38K bytes
    - Click Count (0)
  10. cmd/bucket-replication.go

    	if opts == nil {
    		opts = &validateReplicationDestinationOptions{}
    	}
    	var arns []string
    	if rCfg.RoleArn != "" {
    		arns = append(arns, rCfg.RoleArn)
    	} else {
    		for _, rule := range rCfg.Rules {
    			arns = append(arns, rule.Destination.String())
    		}
    	}
    	var sameTarget bool
    	for _, arnStr := range arns {
    		arn, err := madmin.ParseARN(arnStr)
    		if err != nil {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 118.2K bytes
    - Click Count (0)
Back to Top