- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 1,249 for iterations (0.07 sec)
-
guava/src/com/google/common/math/BigIntegerMath.java
* with each iteration, so this algorithm takes O(log(digits)) iterations. * * We start out with a double-precision approximation, which may be higher or lower than the * true value. Therefore, we perform at least one Newton iteration to get a guess that's * definitely >= floor(sqrt(x)), and then continue the iteration until we reach a fixed point. */ BigInteger sqrt0; int log2 = log2(x, FLOOR);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 18.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/BloomFilterTest.java
BloomFilter<Object> bf = BloomFilter.create(HashTestUtils.BAD_FUNNEL, 10, 0.03); double fpp = bf.expectedFpp(); assertThat(fpp).isEqualTo(0.0); // usually completed in less than 200 iterations while (fpp != 1.0) { boolean changed = bf.put(new Object()); double newFpp = bf.expectedFpp(); // if changed, the new fpp is strictly higher, otherwise it is the same
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 22K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/BloomFilterTest.java
BloomFilter<Object> bf = BloomFilter.create(HashTestUtils.BAD_FUNNEL, 10, 0.03); double fpp = bf.expectedFpp(); assertThat(fpp).isEqualTo(0.0); // usually completed in less than 200 iterations while (fpp != 1.0) { boolean changed = bf.put(new Object()); double newFpp = bf.expectedFpp(); // if changed, the new fpp is strictly higher, otherwise it is the same
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 22K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/HashingTest.java
HashTestUtils.assertInvariants(Hashing.fingerprint2011()); assertEquals("Hashing.fingerprint2011()", Hashing.fingerprint2011().toString()); } @AndroidIncompatible // slow TODO(cpovirk): Maybe just reduce iterations under Android. public void testGoodFastHash() { for (int i = 1; i < 200; i += 17) { HashFunction hasher = Hashing.goodFastHash(i); assertTrue(hasher.bits() >= i);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue May 13 17:27:14 UTC 2025 - 26.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/cache/CacheLoadingTest.java
CacheBuilder.newBuilder().weakValues().build(countingLoader); ConcurrentMap<Object, Object> map = cache.asMap(); int iterations = 10; WeakReference<Object> ref = new WeakReference<>(null); int expectedComputations = 0; for (int i = 0; i < iterations; i++) { // The entry should get garbage collected and recomputed. Object oldValue = ref.get(); if (oldValue == null) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 85.7K bytes - Viewed (0) -
doc/go_spec.html
a single byte in the string. </li> <li> The iteration order over maps is not specified and is not guaranteed to be the same from one iteration to the next. If a map entry that has not yet been reached is removed during iteration, the corresponding iteration value will not be produced. If a map entry is created during iteration, that entry may be produced during the iteration or
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Tue May 06 19:12:15 UTC 2025 - 286.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
* read operations anyway: * * - All (unsynchronized) read operations must first read the "count" field, and should not * look at table entries if it is 0. * * - All (synchronized) write operations should write to the "count" field after structurally * changing any bin. The operations must not take any action that could even momentarily
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 90K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterators.java
* Returns an iterator over the merged contents of all given {@code iterators}, traversing every * element of the input iterators. Equivalent entries will not be de-duplicated. * * <p>Callers must ensure that the source {@code iterators} are in non-descending order as this * method does not sort its input. * * <p>For any equivalent elements across all {@code iterators}, it is undefined which element is * returned first.
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 50.5K bytes - Viewed (0) -
lib/fips140/v1.0.0.zip
non-trivial square root Result = Composite W = 41 B = 2c # End of iteration Result = Composite W = 41 B = 16 # End of iteration Result = Composite W = 41 B = 14 # End of iteration Result = Composite W = 41 B = 2 # End of iteration Result = Composite W = 41 B = 3a # End of iteration Result = Composite W = 55 B = 40 # End of iteration Result = Composite W = 55 B = 7 # End of iteration Result = Composite W = 55 B = 23 # End of iteration Result = Composite W = 55 B = 2e # End of iteration Result = Composite...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0) -
.github/workflows/iam-integrations.yaml
Harshavardhana <******@****.***> 1744208919 -0700
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Wed Apr 09 14:28:39 UTC 2025 - 5.3K bytes - Viewed (0)