- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 24 for grown (0.01 sec)
-
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
* cause a concurrent read operation to see inconsistent data. This is made easier by the * nature of the read operations in Map. For example, no operation can reveal that the table * has grown but the threshold has not yet been updated, so there are no atomicity requirements * for this with respect to reads. * * As a guide, all critical volatile reads and writes to the count field are marked in code
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 90K bytes - Viewed (0) -
callbacks/create.go
} } if len(fromColumns) > 0 { db.Statement.AddClause(clause.Returning{Columns: fromColumns}) } } } } if db.Statement.SQL.Len() == 0 { db.Statement.SQL.Grow(180) db.Statement.AddClauseIfNotExists(clause.Insert{}) db.Statement.AddClause(ConvertToCreateValues(db.Statement)) db.Statement.Build(db.Statement.BuildClauses...) }
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Tue Jul 29 11:06:13 UTC 2025 - 13K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/Crc32cHashFunctionTest.java
}; assertCrc(0xd9963a56, scsiReadCommand); } // Known values from http://www.evanjones.ca/crc32c.html public void testSomeOtherKnownValues() { assertCrc(0x22620404, "The quick brown fox jumps over the lazy dog".getBytes(UTF_8)); assertCrc(0xE3069283, "123456789".getBytes(UTF_8)); assertCrc(0xf3dbd4fe, "1234567890".getBytes(UTF_8)); assertCrc(0xBFE92A83, "23456789".getBytes(UTF_8)); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 6.6K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/LongAdder.java
import java.util.concurrent.atomic.AtomicLong; /** * One or more variables that together maintain an initially zero {@code long} sum. When updates * (method {@link #add}) are contended across threads, the set of variables may grow dynamically to * reduce contention. Method {@link #sum} (or, equivalently, {@link #longValue}) returns the current * total combined across the variables maintaining the sum. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 5.6K bytes - Viewed (0) -
src/bytes/bytes_test.go
} } } func TestBufferGrowNegative(t *testing.T) { defer func() { if err := recover(); err == nil { t.Fatal("Grow(-1) should have panicked") } }() var b Buffer b.Grow(-1) } func TestBufferTruncateNegative(t *testing.T) { defer func() { if err := recover(); err == nil { t.Fatal("Truncate(-1) should have panicked") }
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Mon Jul 28 18:13:58 UTC 2025 - 62.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ImmutableSortedSetTest.java
} public void testExplicit_ordering_dupes() { SortedSet<String> set = ImmutableSortedSet.orderedBy(STRING_LENGTH) .add("in", "the", "quick", "brown", "fox", "jumped", "over", "a", "lazy", "dog") .build(); assertThat(set).containsExactly("a", "in", "the", "over", "quick", "jumped").inOrder(); } public void testExplicit_contains() {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 46.7K bytes - Viewed (0) -
src/test/java/jcifs/util/HMACT64Test.java
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 14.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
return Fingerprint2011.FINGERPRINT_2011; } /** * Assigns to {@code hashCode} a "bucket" in the range {@code [0, buckets)}, in a uniform manner * that minimizes the need for remapping as {@code buckets} grows. That is, {@code * consistentHash(h, n)} equals: * * <ul> * <li>{@code n - 1}, with approximate probability {@code 1/n} * <li>{@code consistentHash(h, n - 1)}, otherwise (probability {@code 1 - 1/n})
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Jul 17 15:26:41 UTC 2025 - 29.8K bytes - Viewed (0) -
guava/src/com/google/common/hash/Hashing.java
return Fingerprint2011.FINGERPRINT_2011; } /** * Assigns to {@code hashCode} a "bucket" in the range {@code [0, buckets)}, in a uniform manner * that minimizes the need for remapping as {@code buckets} grows. That is, {@code * consistentHash(h, n)} equals: * * <ul> * <li>{@code n - 1}, with approximate probability {@code 1/n} * <li>{@code consistentHash(h, n - 1)}, otherwise (probability {@code 1 - 1/n})
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 22:06:57 UTC 2025 - 31.1K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Booleans.java
* * @param array the source array * @param minLength the minimum length the returned array must guarantee * @param padding an extra amount to "grow" the array by if growth is necessary * @throws IllegalArgumentException if {@code minLength} or {@code padding} is negative * @return an array containing the values of {@code array}, with guaranteed minimum length {@code
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Jul 17 15:26:41 UTC 2025 - 20.5K bytes - Viewed (0)