- Sort Score
- Num 10 results
- Language All
Results 311 - 320 of 456 for computed (0.16 seconds)
-
guava-tests/test/com/google/common/math/IntMathTest.java
assertEquals(expectedMean, IntMath.mean(x, y)); assertEquals( "The mean of x and y should equal the mean of y and x", expectedMean, IntMath.mean(y, x)); } /** * Computes the mean in a way that is obvious and resilient to overflow by using BigInteger * arithmetic. */ private static int computeMeanSafely(int x, int y) { BigInteger bigX = BigInteger.valueOf(x);
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Aug 11 19:31:30 GMT 2025 - 24.1K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/Ordering.java
} /** * Returns an ordering that compares objects according to the order in which they appear in the * given list. Only objects present in the list (according to {@link Object#equals}) may be * compared. This comparator imposes a "partial ordering" over the type {@code T}. Subsequent * changes to the {@code valuesInOrder} list will have no effect on the returned comparator. Null * values in the list are not supported. *
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Sep 23 17:50:58 GMT 2025 - 39.5K bytes - Click Count (0) -
guava/src/com/google/common/collect/TreeRangeMap.java
put(range, value); return; } Range<K> coalescedRange = coalescedRange(range, checkNotNull(value)); put(coalescedRange, value); } /** Computes the coalesced range for the given range+value - does not mutate the map. */ private Range<K> coalescedRange(Range<K> range, V value) { Range<K> coalescedRange = range; Entry<Cut<K>, RangeMapEntry<K, V>> lowerEntry =
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Sep 23 17:50:58 GMT 2025 - 26.5K bytes - Click Count (0) -
docs/en/docs/release-notes.md
* ๐ Sync German docs. PR [#14367](https://github.com/fastapi/fastapi/pull/14367) by [@nilslindemann](https://github.com/nilslindemann). ## 0.123.4 ### Fixes * ๐ Fix OpenAPI schema support for computed fields when using `separate_input_output_schemas=False`. PR [#13207](https://github.com/fastapi/fastapi/pull/13207) by [@vgrafe](https://github.com/vgrafe). ### Docs
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Sat Dec 27 19:06:15 GMT 2025 - 586.7K bytes - Click Count (0) -
docs/en/docs/contributing.md
Whatโs changing now: * ๐ซ Weโre no longer accepting new community-submitted translation PRs. * โณ Existing open PRs will be reviewed and can still be merged if completed within the next 3 weeks (since July 11 2025). * ๐ In the future, we will only support languages where at least three active native speakers are available to review and maintain translations.
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Sun Sep 21 11:29:04 GMT 2025 - 15.1K bytes - Click Count (0) -
cmd/object-api-errors.go
type ReplicationPermissionCheck struct{} func (e ReplicationPermissionCheck) Error() string { return "Replication permission validation requests cannot be completed" } func isReplicationPermissionCheck(err error) bool { _, ok := err.(ReplicationPermissionCheck) return ok } // DataMovementOverwriteErr - captures the error when a data movement activityCreated: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Aug 09 02:05:14 GMT 2024 - 22.1K bytes - Click Count (0) -
guava-tests/test/com/google/common/hash/BloomFilterTest.java
} public void testExpectedFpp() { BloomFilter<Object> bf = BloomFilter.create(HashTestUtils.BAD_FUNNEL, 10, 0.03); double fpp = bf.expectedFpp(); assertThat(fpp).isEqualTo(0.0); // usually completed in less than 200 iterations while (fpp != 1.0) { boolean changed = bf.put(new Object()); double newFpp = bf.expectedFpp(); // if changed, the new fpp is strictly higher, otherwise it is the same
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Oct 28 18:19:59 GMT 2025 - 22.1K bytes - Click Count (0) -
guava/src/com/google/common/graph/ValueGraph.java
/** * An interface for <a * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data, * whose edges have associated non-unique values. * * <p>A graph is composed of a set of nodes and a set of edges connecting pairs of nodes. * * <p>There are three primary interfaces provided to represent graphs. In order of increasing
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 16K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/Network.java
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Oct 07 15:57:03 GMT 2025 - 17.7K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/FluentFuture.java
* of {@link java.util.concurrent.CompletableFuture#thenAccept} and {@link * java.util.concurrent.CompletableFuture#thenAcceptAsync}. * * @param callback The callback to invoke when this {@code Future} is completed. * @param executor The executor to run {@code callback} when the future completes. */ public final void addCallback(FutureCallback<? super V> callback, Executor executor) {Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 19.7K bytes - Click Count (0)