- Sort Score
- Result 10 results
- Languages All
Results 1 - 9 of 9 for Bates (0.17 sec)
-
android/guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
* we change the rate. */ public void testWeNeverGetABurstMoreThanOneSec() { RateLimiter limiter = RateLimiter.create(1.0, stopwatch); int[] rates = {1000, 1, 10, 1000000, 10, 1}; for (int rate : rates) { int oneSecWorthOfWork = rate; stopwatch.sleepMillis(rate * 1000); limiter.setRate(rate); long burst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random());
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* only become known via CAS failures, convergence can be slow, * and because threads are typically not bound to CPUS forever, * may not occur at all. However, despite these limitations, * observed contention rates are typically low in these cases. * * It is possible for a Cell to become unused when threads that * once hashed to it terminate, as well as in the case where * doubling the table causes no thread to hash to it under
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/BloomFilterTest.java
double actualReportedFpp = bf.expectedFpp(); assertEquals(expectedReportedFpp, actualReportedFpp, 0.00033); } /** Sanity checking with many combinations of false positive rates and expected insertions */ public void testBasic() { for (double fpr = 0.0000001; fpr < 0.1; fpr *= 10) { for (int expectedInsertions = 1; expectedInsertions <= 10000; expectedInsertions *= 10) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
* we change the rate. */ public void testWeNeverGetABurstMoreThanOneSec() { RateLimiter limiter = RateLimiter.create(1.0, stopwatch); int[] rates = {1000, 1, 10, 1000000, 10, 1}; for (int rate : rates) { int oneSecWorthOfWork = rate; stopwatch.sleepMillis(rate * 1000); limiter.setRate(rate); long burst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random());
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
src/main/java/jcifs/pac/PacLogonInfo.java
try { PacDataInputStream pacStream = new PacDataInputStream(new DataInputStream(new ByteArrayInputStream(data))); // Skip firsts pacStream.skipBytes(20); // Dates this.logonTime = pacStream.readFiletime(); this.logoffTime = pacStream.readFiletime(); this.kickOffTime = pacStream.readFiletime(); this.pwdLastChangeTime = pacStream.readFiletime();
Java - Registered: Sun Apr 28 00:10:09 GMT 2024 - Last Modified: Sun Jul 01 13:12:10 GMT 2018 - 11.4K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
* only become known via CAS failures, convergence can be slow, * and because threads are typically not bound to CPUS forever, * may not occur at all. However, despite these limitations, * observed contention rates are typically low in these cases. * * It is possible for a Cell to become unused when threads that * once hashed to it terminate, as well as in the case where * doubling the table causes no thread to hash to it under
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/BloomFilterTest.java
double actualReportedFpp = bf.expectedFpp(); assertEquals(expectedReportedFpp, actualReportedFpp, 0.00033); } /** Sanity checking with many combinations of false positive rates and expected insertions */ public void testBasic() { for (double fpr = 0.0000001; fpr < 0.1; fpr *= 10) { for (int expectedInsertions = 1; expectedInsertions <= 10000; expectedInsertions *= 10) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* only become known via CAS failures, convergence can be slow, * and because threads are typically not bound to CPUS forever, * may not occur at all. However, despite these limitations, * observed contention rates are typically low in these cases. * * It is possible for a Cell to become unused when threads that * once hashed to it terminate, as well as in the case where * doubling the table causes no thread to hash to it under
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* thoroughly as possible. * <li><b>bit-dispersing:</b> masking out any <i>single bit</i> from a hash code should yield only * the expected <i>twofold</i> increase to all collision rates. Informally, the "information" * in the hash code should be as evenly "spread out" through the hash code's bits as possible. * The result is that, for example, when choosing a bucket in a hash table of size 2^8,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 25 18:22:59 GMT 2021 - 10.9K bytes - Viewed (0)