Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1421 - 1430 of 1,858 for hata (0.07 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. docs/en/docs/advanced/async-tests.md

    Let's look at how we can make that work.
    
    ## pytest.mark.anyio { #pytest-mark-anyio }
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Dec 17 20:41:43 GMT 2025
    - 4K bytes
    - Click Count (0)
  2. guava/src/com/google/common/graph/MapIteratorCache.java

    import java.util.AbstractSet;
    import java.util.Iterator;
    import java.util.Map;
    import java.util.Map.Entry;
    import java.util.Set;
    import org.jspecify.annotations.Nullable;
    
    /**
     * A map-like data structure that wraps a backing map and caches values while iterating through
     * {@link #unmodifiableKeySet()}. By design, the cache is cleared when this structure is mutated. If
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 4.6K bytes
    - Click Count (0)
  3. guava/src/com/google/common/graph/PredecessorsFunction.java

    import com.google.common.annotations.Beta;
    import com.google.errorprone.annotations.DoNotMock;
    
    /**
     * A functional interface for <a
     * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data.
     *
     * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as
     * topological sort) that only need a way of accessing the predecessors of a node in a graph.
     *
     * <h3>Usage</h3>
     *
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 4K bytes
    - Click Count (0)
  4. internal/config/storageclass/storage-class_test.go

    		}
    		// Set env var for test case 6
    		if i+1 == 6 {
    			scfg.Standard.Parity = 7
    		}
    		parity := scfg.GetParityForSC(tt.sc)
    		if (tt.drivesCount - parity) != tt.expectedData {
    			t.Errorf("Test %d, Expected data drives %d, got %d", i+1, tt.expectedData, tt.drivesCount-parity)
    			continue
    		}
    		if parity != tt.expectedParity {
    			t.Errorf("Test %d, Expected parity drives %d, got %d", i+1, tt.expectedParity, parity)
    		}
    	}
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue Aug 15 23:04:20 GMT 2023
    - 4.3K bytes
    - Click Count (0)
  5. cmd/api-errors.go

    	},
    	ErrCastFailed: {
    		Code:           "CastFailed",
    		Description:    "Attempt to convert from one data type to another using CAST failed in the SQL expression.",
    		HTTPStatusCode: http.StatusBadRequest,
    	},
    	ErrInvalidCast: {
    		Code:           "InvalidCast",
    		Description:    "Attempt to convert from one data type to another using CAST failed in the SQL expression.",
    		HTTPStatusCode: http.StatusBadRequest,
    	},
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Wed Apr 16 07:34:24 GMT 2025
    - 93K bytes
    - Click Count (3)
  6. okhttp/src/jvmTest/kotlin/okhttp3/internal/publicsuffix/PublicSuffixListGenerator.kt

        if (trim { it <= ' ' }.isEmpty() || startsWith("//")) return null
        if (contains(WILDCARD_CHAR)) {
          assertWildcardRule(this)
        }
        return encodeUtf8()
      }
    
      data class ImportResults(
        val sortedRules: SortedSet<ByteString>,
        val sortedExceptionRules: SortedSet<ByteString>,
        val totalRuleBytes: Int,
        val totalExceptionRuleBytes: Int,
      ) {
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Wed Aug 06 05:33:11 GMT 2025
    - 6.1K bytes
    - Click Count (0)
  7. compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolver.java

                            res.getEntry().getMd().setWhy("This is a graph entry point. No links.");
                        }
                    } else {
                        // fill in domain md with actual version data
                        ArtifactMetadata md = v.getMd();
                        ArtifactMetadata newMd = new ArtifactMetadata(
                                md.getGroupId(),
                                md.getArtifactId(),
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Wed Jul 23 17:27:08 GMT 2025
    - 7.4K bytes
    - Click Count (0)
  8. docs/es/docs/advanced/async-tests.md

    # Tests Asíncronos { #async-tests }
    
    Ya has visto cómo probar tus aplicaciones de **FastAPI** usando el `TestClient` proporcionado. Hasta ahora, solo has visto cómo escribir tests sincrónicos, sin usar funciones `async`.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Dec 17 20:41:43 GMT 2025
    - 4.2K bytes
    - Click Count (0)
  9. docs/es/docs/tutorial/response-status-code.md

    `status_code` también puede recibir un `IntEnum`, como por ejemplo el <a href="https://docs.python.org/3/library/http.html#http.HTTPStatus" class="external-link" target="_blank">`http.HTTPStatus`</a> de Python.
    
    ///
    
    Esto hará:
    
    * Devolver ese código de estado en el response.
    * Documentarlo como tal en el esquema de OpenAPI (y por lo tanto, en las interfaces de usuario):
    
    <img src="/img/tutorial/response-status-code/image01.png">
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Dec 17 20:41:43 GMT 2025
    - 4.4K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/collect/EvictingQueue.java

    /**
     * A non-blocking queue which automatically evicts elements from the head of the queue when
     * attempting to add new elements onto the queue and it is full. This queue orders elements FIFO
     * (first-in-first-out). This data structure is logically equivalent to a circular buffer (i.e.,
     * cyclic buffer or ring buffer).
     *
     * <p>An evicting queue must be configured with a maximum size. Each time an element is added to a
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Feb 13 17:34:21 GMT 2025
    - 4.6K bytes
    - Click Count (0)
Back to Top