- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 237 for Number (0.34 sec)
-
android/guava-tests/test/com/google/common/util/concurrent/AtomicDoubleArrayTest.java
} } } if (done) { break; } } } } /** * Multiple threads using same array of counters successfully update a number of times equal to * total count */ public void testCountingInMultipleThreads() throws InterruptedException { final AtomicDoubleArray aa = new AtomicDoubleArray(SIZE); for (int i = 0; i < SIZE; i++) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 10K bytes - Viewed (0) -
android/guava/src/com/google/common/io/ByteStreams.java
* into {@code b[off+1]}, and so on. The number of bytes read is, at most, equal to {@code len}. * * @param in the input stream to read from * @param b the buffer into which the data is read * @param off an int specifying the offset into the data * @param len an int specifying the number of bytes to read * @return the number of bytes read * @throws IOException if an I/O error occurs
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jan 17 18:59:58 GMT 2024 - 29.7K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
* independent of N (but depends on the quantiles being computed). When calling {@link * ScaleAndIndex#computeInPlace computeInPlace} (in {@linkplain ScaleAndIndexes#computeInPlace * either form}), only the overhead is required. The number of object allocations is independent of * N in both cases. * * @author Pete Gillin * @since 20.0 */ @J2ktIncompatible @GwtIncompatible @ElementTypesAreNonnullByDefault
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ConcurrentHashMultiset.java
} } /** * Removes a number of occurrences of the specified element from this multiset. If the multiset * contains fewer than this number of occurrences to begin with, all occurrences will be removed. * * @param element the element whose occurrences should be removed * @param occurrences the number of occurrences of the element to remove
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 20.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* "permits" gives time, i.e., integrals on this function (which is what storedPermitsToWaitTime() * computes) correspond to minimum intervals between subsequent requests, for the specified number * of requested permits. * * Here is an example of storedPermitsToWaitTime: If storedPermits == 10.0, and we want 3 permits,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 19.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashCode.java
* hexadecimal number in lower case. * * <p>Note that if the output is considered to be a single hexadecimal number, whether this string * is big-endian or little-endian depends on the byte order of {@link #asBytes}. This may be * surprising for implementations of {@code HashCode} that represent the number in big-endian
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 20 18:43:59 GMT 2021 - 12.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
* href="http://mathworld.wolfram.com/PrimeNumber.html">prime number</a>: an integer <i>greater * than one</i> that cannot be factored into a product of <i>smaller</i> positive integers. * Returns {@code false} if {@code n} is zero, one, or a composite number (one which <i>can</i> be * factored into smaller positive integers). * * <p>To test larger numbers, use {@link BigInteger#isProbablePrime}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multiset.java
// Query Operations /** * Returns the total number of all occurrences of all elements in this multiset. * * <p><b>Note:</b> this method does not return the number of <i>distinct elements</i> in the * multiset, which is given by {@code entrySet().size()}. */ @Override int size(); /** * Returns the number of occurrences of an element in this multiset (the <i>count</i> of the
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 19.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AbstractAbstractFutureTest.java
} @J2ktIncompatible @GwtIncompatible // threads public void testOverflowTimeout() throws Exception { // First, sanity check that naive multiplication would really overflow to a negative number: long nanosPerSecond = NANOSECONDS.convert(1, SECONDS); assertThat(nanosPerSecond * Long.MAX_VALUE).isLessThan(0L); // Check that we wait long enough anyway (presumably as long as MAX_VALUE nanos):
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 13 14:28:25 GMT 2024 - 15.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/eventbus/EventBusTest.java
futures.add(executor.submit(new Registrator(bus, catchers))); } for (int i = 0; i < numberOfCatchers; i++) { futures.get(i).get(); } assertEquals("Unexpected number of catchers in the list", numberOfCatchers, catchers.size()); bus.post(EVENT); List<String> expectedEvents = ImmutableList.of(EVENT); for (StringCatcher catcher : catchers) { assertEquals(
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)