- Sort Score
- Result 10 results
- Languages All
Results 261 - 270 of 336 for cuns (1.07 sec)
-
guava/src/com/google/common/collect/ImmutableSet.java
builder = builder.add(elements[i]); } return builder.review().build(); } } ImmutableSet() {} /** Returns {@code true} if the {@code hashCode()} method runs quickly. */ boolean isHashCodeFast() { return false; } @Override public boolean equals(@Nullable Object object) { if (object == this) { return true; }
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Fri Nov 07 16:09:47 UTC 2025 - 35.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Tables.java
* * <p>Lookups by row key are often faster than lookups by column key, because the data is stored * in a {@code Map<R, Map<C, V>>}. A method call like {@code column(columnKey).get(rowKey)} still * runs quickly, since the row key is provided. However, {@code column(columnKey).size()} takes * longer, since an iteration across all row keys occurs. *Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Sep 22 18:35:44 UTC 2025 - 24.9K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/AbstractPackageSanityTests.java
import java.util.TreeMap; import java.util.logging.Level; import java.util.logging.Logger; import junit.framework.TestCase; import org.jspecify.annotations.NullMarked; import org.junit.Test; /** * Automatically runs sanity checks against top level classes in the same package of the test that * extends {@code AbstractPackageSanityTests}. Currently sanity checks include {@linkRegistered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue May 13 17:27:14 UTC 2025 - 17.9K bytes - Viewed (0) -
docs/de/docs/python-types.md
Aber leider erhalten Sie nichts Nützliches: <img src="/img/python-types/image01.png"> ### Typen hinzufügen { #add-types } Lassen Sie uns eine einzelne Zeile aus der vorherigen Version ändern. Wir ändern den folgenden Teil, die Parameter der Funktion, von: ```Python first_name, last_name ``` zu: ```Python
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Wed Dec 17 20:41:43 UTC 2025 - 17.9K bytes - Viewed (1) -
docs/de/docs/async.md
### Parallele Hamburger { #parallel-burgers } Stellen wir uns jetzt vor, dass es sich hierbei nicht um „nebenläufige Hamburger“, sondern um „parallele Hamburger“ handelt. Sie gehen los mit Ihrem Schwarm, um paralleles Fast Food zu bekommen.Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sat Sep 20 15:10:09 UTC 2025 - 27.9K bytes - Viewed (0) -
docs/en/docs/tutorial/sql-databases.md
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Tue Dec 02 05:06:56 UTC 2025 - 15.8K bytes - Viewed (0) -
docs/en/docs/advanced/behind-a-proxy.md
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Wed Dec 17 20:41:43 UTC 2025 - 16.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/BloomFilterTest.java
assertTrue( "BitArray.bitSize() must return a positive number, but was " + bitArray.bitSize(), bitArray.bitSize() > 0); // Ideally we would also test the bitSize() overflow of this BF, but it runs out of heap space // BloomFilter.create(Funnels.unencodedCharsFunnel(), 244412641, 1e-11); } /** * Asserts that {@link BloomFilter#approximateElementCount} is within 1 percent of the expected * value.
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Oct 28 18:19:59 UTC 2025 - 22.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/ValueGraph.java
* subtype of {@code ValueGraph} that provides methods for adding and removing nodes and edges. If * you do not need to mutate a graph (e.g. if you write a method than runs a read-only algorithm on * the graph), you should use the non-mutating {@link ValueGraph} interface, or an {@link * ImmutableValueGraph}. * * <p>You can create an immutable copy of an existing {@code ValueGraph} using {@linkRegistered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 16K bytes - Viewed (0) -
internal/lru/lru.go
// // Size parameter set to 0 makes cache of unlimited size, e.g. turns LRU mechanism off. // // Providing 0 TTL turns expiring off. // // Delete expired entries every 1/100th of ttl value. Goroutine which deletes expired entries runs indefinitely. func NewLRU[K comparable, V any](size int, onEvict EvictCallback[K, V], ttl time.Duration) *LRU[K, V] { if size < 0 { size = 0 } if ttl <= 0 { ttl = noEvictionTTL } res := LRU[K, V]{
Registered: Sun Dec 28 09:35:17 UTC 2025 - Last Modified: Fri Apr 25 08:22:26 UTC 2025 - 12.5K bytes - Viewed (0)