- Sort Score
- Num 10 results
- Language All
Results 11 - 14 of 14 for isWithin (0.04 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
android/guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
RateLimiter limiter = RateLimiter.create(5.0, stopwatch); assertThat(limiter.acquire()).isWithin(EPSILON).of(0.0); stopwatch.sleepMillis(400); assertThat(limiter.acquire()).isWithin(EPSILON).of(0.0); assertThat(limiter.acquire()).isWithin(EPSILON).of(0.0); assertThat(limiter.acquire()).isWithin(EPSILON).of(0.2); } public void testOneSecondBurst() {
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Oct 28 18:19:59 GMT 2025 - 21.9K bytes - Click Count (0) -
guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
RateLimiter limiter = RateLimiter.create(5.0, stopwatch); assertThat(limiter.acquire()).isWithin(EPSILON).of(0.0); stopwatch.sleepMillis(400); assertThat(limiter.acquire()).isWithin(EPSILON).of(0.0); assertThat(limiter.acquire()).isWithin(EPSILON).of(0.0); assertThat(limiter.acquire()).isWithin(EPSILON).of(0.2); } public void testOneSecondBurst() {
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Oct 28 18:19:59 GMT 2025 - 21.9K bytes - Click Count (0) -
guava-tests/test/com/google/common/hash/BloomFilterTest.java
assertEquals(knownNumberOfFalsePositives, numFpp); double expectedReportedFpp = (double) knownNumberOfFalsePositives / numInsertions; double actualReportedFpp = bf.expectedFpp(); assertThat(actualReportedFpp).isWithin(0.00015).of(expectedReportedFpp); } public void testCreateAndCheckBloomFilterWithKnownFalsePositives64() { int numInsertions = 1000000; BloomFilter<String> bf = BloomFilter.create(
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Oct 28 18:19:59 GMT 2025 - 22.1K bytes - Click Count (0) -
guava-tests/test/com/google/common/hash/HashTestUtils.java
} // measure probability and assert it's within margin of error for (int j = 0; j < hashBits; j++) { double prob = (double) diff[j] / (double) (diff[j] + same[j]); assertThat(prob).isWithin(epsilon).of(0.50d); } } } /** * Test for 2-bit characteristics. A characteristic is a delta in the input which is repeated inCreated: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Oct 28 18:19:59 GMT 2025 - 25.6K bytes - Click Count (0)