- Sort Score
- Num 10 results
- Language All
Results 951 - 960 of 1,102 for Yellow (0.04 seconds)
-
android/guava-tests/test/com/google/common/base/PreconditionsTest.java
IllegalArgumentException.class, () -> checkArgument(false, "A %s C", (Object) null)); assertThat(e).hasMessageThat().isEqualTo("A null C"); } @J2ktIncompatible // TODO(b/319404022): Allow passing null array as varargs public void testCheckArgument_singleNullArray_failure() { IllegalArgumentException e = assertThrows(
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 19K bytes - Click Count (0) -
guava/src/com/google/common/base/FinalizableReferenceQueue.java
* {@link FinalizableReference#finalizeReferent()} on them. Java 9+ users should prefer {@link * java.lang.ref.Cleaner Cleaner}; see example <a href="#cleaner">below</a>. * * <p>Keep a strong reference to this object until all of the associated referents have been * finalized. If this object is garbage collected earlier, the backing thread will not invoke {@codeCreated: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Sat Aug 09 01:14:59 GMT 2025 - 14.7K bytes - Click Count (0) -
android/guava/src/com/google/common/primitives/Chars.java
* for sorting user-visible strings as the ordering may not match the conventions of the user's * locale. That is, it compares, using {@link #compare(char, char)}), the first pair of values * that follow any common prefix, or when one array is a prefix of the other, treats the shorter * array as the lesser. For example, {@code [] < ['a'] < ['a', 'b'] < ['b']}. *
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 24.2K bytes - Click Count (0) -
android/guava/src/com/google/common/primitives/Shorts.java
* href="http://en.wikipedia.org/wiki/Lexicographical_order">lexicographically</a>. That is, it * compares, using {@link #compare(short, short)}), the first pair of values that follow any * common prefix, or when one array is a prefix of the other, treats the shorter array as the * lesser. For example, {@code [] < [(short) 1] < [(short) 1, (short) 2] < [(short) 2]}. *
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Oct 22 18:14:49 GMT 2025 - 25.7K bytes - Click Count (0) -
guava/src/com/google/common/primitives/Shorts.java
* href="http://en.wikipedia.org/wiki/Lexicographical_order">lexicographically</a>. That is, it * compares, using {@link #compare(short, short)}), the first pair of values that follow any * common prefix, or when one array is a prefix of the other, treats the shorter array as the * lesser. For example, {@code [] < [(short) 1] < [(short) 1, (short) 2] < [(short) 2]}. *
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Oct 22 18:14:49 GMT 2025 - 25.7K bytes - Click Count (0) -
docs/es/docs/help-fastapi.md
* Noticias sobre FastAPI y amigos 🚀 * Guías 📝 * Funcionalidades ✨ * Cambios importantes 🚨 * Consejos y trucos ✅ ## Sigue a FastAPI en X (Twitter) { #follow-fastapi-on-x-twitter } <a href="https://x.com/fastapi" class="external-link" target="_blank">Sigue a @fastapi en **X (Twitter)**</a> para obtener las últimas noticias sobre **FastAPI**. 🐦Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Wed Dec 17 10:15:01 GMT 2025 - 14.8K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
int oneSecWorthOfWork = rate; stopwatch.sleepMillis(rate * 1000); limiter.setRate(rate); long burst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random()); // we allow one second worth of work to go in a burst (i.e. take less than a second) assertThat(burst).isAtMost(1000); long afterBurst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random());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
int oneSecWorthOfWork = rate; stopwatch.sleepMillis(rate * 1000); limiter.setRate(rate); long burst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random()); // we allow one second worth of work to go in a burst (i.e. take less than a second) assertThat(burst).isAtMost(1000); long afterBurst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random());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) -
fess-crawler/src/test/java/org/codelibs/fess/crawler/CrawlerContextTest.java
assertEquals(1L, crawlerContext.getAccessCount()); assertEquals(0L, crawlerContext.decrementAndGetAccessCount()); assertEquals(0L, crawlerContext.getAccessCount()); // Test decrement below zero assertEquals(-1L, crawlerContext.decrementAndGetAccessCount()); assertEquals(-1L, crawlerContext.getAccessCount()); } /** * Test concurrent access count operations */
Created: Sat Dec 20 11:21:39 GMT 2025 - Last Modified: Sat Sep 06 04:15:37 GMT 2025 - 25.6K bytes - Click Count (0) -
cmd/object-api-listobjects_test.go
} } if testCase.resultL.IsTruncated != resultL.IsTruncated { // Allow an extra continuation token. if !resultL.IsTruncated || len(resultL.Objects) == 0 {Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Oct 10 18:57:03 GMT 2025 - 76.1K bytes - Click Count (0)