- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 254 for good (0.02 sec)
-
pom.xml
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Sep 04 21:35:58 UTC 2025 - 23.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableMap.java
*/ @Override public ImmutableSet<K> keySet() { ImmutableSet<K> result = keySet; return (result == null) ? keySet = createKeySet() : result; } /* * This could have a good default implementation of return new ImmutableKeySet<K, V>(this), * but ProGuard can't figure out how to eliminate that default when RegularImmutableMap * overrides it. */ abstract ImmutableSet<K> createKeySet();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 41.2K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
// do n swaps, minus a delta (0 or 2 for Reversal, gcd(d, n) for Successive), so that's about // twice as many reads and writes. But benchmarking shows that they usually perform better than // Dolphin. Reversal is about as good as Successive on average, and it is much simpler, // especially since we already have a `reverse` method. checkNotNull(array); checkPositionIndexes(fromIndex, toIndex, array.length); if (array.length <= 1) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 31.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashMap.java
* * <p>{@code containsKey(k)}, {@code put(k, v)} and {@code remove(k)} are all (expected and * amortized) constant time operations. Expected in the hashtable sense (depends on the hash * function doing a good job of distributing the elements to the buckets to a distribution not far * from uniform), and amortized since some operations can trigger a hash table resize. *Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 39.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableMap.java
*/ @Override public ImmutableSet<K> keySet() { ImmutableSet<K> result = keySet; return (result == null) ? keySet = createKeySet() : result; } /* * This could have a good default implementation of return new ImmutableKeySet<K, V>(this), * but ProGuard can't figure out how to eliminate that default when RegularImmutableMap * overrides it. */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 44.3K bytes - Viewed (0) -
okhttp/src/jvmTest/kotlin/okhttp3/internal/http2/Http2Test.kt
frame.writeByte(TYPE_GOAWAY) frame.writeByte(FLAG_NONE) frame.writeInt(0) // connection-scope frame.writeInt(expectedStreamId) // last good stream. frame.writeInt(expectedError.httpCode) // Check writer sends the same bytes. assertThat(sendGoAway(expectedStreamId, expectedError, EMPTY_BYTE_ARRAY)) .isEqualTo(frame)
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Wed Mar 19 19:25:20 UTC 2025 - 28.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/base/SplitterTest.java
} /** * All of the infrastructure of split and splitToString is identical, so we do one test of * splitToString. All other cases should be covered by testing of split. * * <p>TODO(user): It would be good to make all the relevant tests run on both split and * splitToString automatically. */ public void testCharacterSimpleSplitToList() { String simple = "a,b,c";
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 29.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSetMultimap.java
* Returns a new builder with a hint for how many distinct keys are expected to be added. The * generated builder is equivalent to that returned by {@link #builder}, but may perform better if * {@code expectedKeys} is a good estimate. * * @throws IllegalArgumentException if {@code expectedKeys} is negative * @since 33.3.0 */ public static <K, V> Builder<K, V> builderWithExpectedKeys(int expectedKeys) {Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 25.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSetMultimap.java
* Returns a new builder with a hint for how many distinct keys are expected to be added. The * generated builder is equivalent to that returned by {@link #builder}, but may perform better if * {@code expectedKeys} is a good estimate. * * @throws IllegalArgumentException if {@code expectedKeys} is negative * @since 33.3.0 */ public static <K, V> Builder<K, V> builderWithExpectedKeys(int expectedKeys) {Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 25.8K bytes - Viewed (0) -
src/bytes/buffer_test.go
for _, startLen := range []int{0, 100, 1000, 10000, 100000} { xBytes := Repeat(x, startLen) buf := NewBuffer(xBytes) // If we read, this affects buf.off, which is good to test. readBytes, _ := buf.Read(tmp) yBytes := Repeat(y, growLen) allocs := testing.AllocsPerRun(100, func() { buf.Grow(growLen) buf.Write(yBytes) })
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Mon May 19 16:13:04 UTC 2025 - 18.6K bytes - Viewed (0)