- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 70 for Point (0.13 sec)
-
android/guava/src/com/google/common/base/Splitter.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 23.7K bytes - Viewed (0) -
guava/src/com/google/common/base/internal/Finalizer.java
* * 1) To invoke FinalizableReference.finalizeReferent() * * 2) To detect when FinalizableReference's class loader has to be garbage collected, at which * point, Finalizer can stop running */ if (!finalizableReferenceClass.getName().equals(FINALIZABLE_REFERENCE)) { throw new IllegalArgumentException("Expected " + FINALIZABLE_REFERENCE + "."); }
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Aug 23 12:54:09 GMT 2023 - 9.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/MoreExecutors.java
* <li>execution will not stop until the task queue is empty. * <li>tasks will begin execution with the thread marked as not interrupted - any interruption * applies only to the task that was running at the point of interruption. * <li>if the thread was interrupted before the SequentialExecutor's worker begins execution, * the interrupt will be restored to the thread after it completes so that its {@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 41.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
/* * Sum per-segment modCounts to avoid mis-reporting when elements are concurrently added and * removed in one segment while checking another, in which case the table was never actually * empty at any point. (The sum ensures accuracy up through at least 1<<31 per-segment * modifications before recheck.) Method containsValue() uses similar constructions for * stability checks. */ long sum = 0L;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 91.9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
* 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); if (log2 < Double.MAX_EXPONENT) { sqrt0 = sqrtApproxWithDoubles(x); } else {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/eventbus/EventBusTest.java
}); bus.post("hello"); assertEquals(1, calls.get()); } public void testPrimitiveSubscribeFails() { class SubscribesToPrimitive { @Subscribe public void toInt(int i) {} } assertThrows(IllegalArgumentException.class, () -> bus.register(new SubscribesToPrimitive())); } /** Records thrown exception information. */
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Feb 21 18:32:41 GMT 2024 - 11.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/eventbus/EventBusTest.java
}); bus.post("hello"); assertEquals(1, calls.get()); } public void testPrimitiveSubscribeFails() { class SubscribesToPrimitive { @Subscribe public void toInt(int i) {} } assertThrows(IllegalArgumentException.class, () -> bus.register(new SubscribesToPrimitive())); } /** Records thrown exception information. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 18:32:41 GMT 2024 - 11.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/IterablesTest.java
assertEquals(expected, string); if (howManyChecked++ == 5) { break; } } // We left the last iterator pointing to "b". But a new iterator should // always point to "a". for (String string : cycle) { assertEquals("a", string); break; } assertEquals("[a, b] (cycled)", cycle.toString()); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 47.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
expectedInsertions = 1; } /* * TODO(user): Put a warning in the javadoc about tiny fpp values, since the resulting size * is proportional to -log(p), but there is not much of a point after all, e.g. * optimalM(1000, 0.0000000000000001) = 76680 which is less than 10kb. Who cares! */ long numBits = optimalNumOfBits(expectedInsertions, fpp);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
// ends up at a[d], which in turn ends up at a[2d], and so on until we get back to a[0]. // (All indices taken mod n.) If d and n are mutually prime, all elements will have been // moved at that point. Otherwise, we can rotate the cycle a[1], a[1 + d], a[1 + 2d], etc, // then a[2] etc, and so on until we have rotated all elements. There are gcd(d, n) cycles // in all.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 29.7K bytes - Viewed (0)