- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 326 for Hafner (0.66 sec)
-
android/guava/src/com/google/common/io/ByteStreams.java
* returned {@code ByteArrayDataOutput} and new data will be appended to any existing content. * * <p>Note that if the given output stream was not empty or is modified after the {@code * ByteArrayDataOutput} is created, the contract for {@link ByteArrayDataOutput#toByteArray} will * not be honored (the bytes returned in the byte array may not be exactly what was written via
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Jan 17 18:59:58 UTC 2024 - 29.7K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleMath.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
guava/src/com/google/common/math/DoubleMath.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/FeatureSpecificTestSuiteBuilder.java
@CanIgnoreReturnValue public B named(String name) { if (name.contains("(")) { throw new IllegalArgumentException( "Eclipse hides all characters after " + "'('; please use '[]' or other characters instead of parentheses"); } this.name = name; return self(); } public String getName() { return name; }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 26 19:46:10 UTC 2024 - 10.2K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/google/SortedMultisetTestSuiteBuilder.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 26 19:46:10 UTC 2024 - 11.9K bytes - Viewed (0) -
android/guava/src/com/google/common/io/BaseEncoding.java
public OutputStream openStream() throws IOException { return encodingStream(encodedSink.openStream()); } }; } // TODO(lowasser): document the extent of leniency, probably after adding ignore(CharMatcher) private static byte[] extract(byte[] result, int length) { if (length == result.length) { return result; } byte[] trunc = new byte[length];
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Mar 15 16:33:32 UTC 2024 - 41.7K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/LocalCache.java
/** Weigher to weigh cache entries. */ final Weigher<K, V> weigher; /** How long after the last access to an entry the map will retain that entry. */ final long expireAfterAccessNanos; /** How long after the last write to an entry the map will retain that entry. */ final long expireAfterWriteNanos; /** How long after the last write an entry becomes a candidate for refresh. */ final long refreshNanos;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat May 18 03:24:34 UTC 2024 - 143.6K bytes - Viewed (0) -
guava/src/com/google/common/base/Equivalence.java
import org.checkerframework.checker.nullness.qual.Nullable; /** * A strategy for determining whether two instances are considered equivalent, and for computing * hash codes in a manner consistent with that equivalence. Two examples of equivalences are the * {@linkplain #identity() identity equivalence} and the {@linkplain #equals "equals" equivalence}. * * @author Bob Lee * @author Ben Yu
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 14.1K bytes - Viewed (0) -
guava/src/com/google/common/hash/BloomFilter.java
long bitSize = bits.bitSize(); long bitCount = bits.bitCount(); /** * Each insertion is expected to reduce the # of clear bits by a factor of * `numHashFunctions/bitSize`. So, after n insertions, expected bitCount is `bitSize * (1 - (1 - * numHashFunctions/bitSize)^n)`. Solving that for n, and approximating `ln x` as `x - 1` when x * is close to 1 (why?), gives the following formula. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 26.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
continue; // Slot is now non-empty } } collide = false; } else if (!wasUncontended) // CAS already known to fail wasUncontended = true; // Continue after rehash else if (a.cas(v = a.value, fn(v, x))) break; else if (n >= NCPU || cells != as) collide = false; // At max size or stale else if (!collide) collide = true;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0)