- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 408 for Threads (0.17 sec)
-
okhttp/src/main/kotlin/okhttp3/internal/concurrent/TaskRunner.kt
/** * When we need a new thread to run tasks, we call [Backend.execute]. A few microseconds later we * expect a newly-started thread to call [Runnable.run]. We shouldn't request new threads until * the already-requested ones are in service, otherwise we might create more threads than we need. * * We use [executeCallCount] and [runCallCount] to defend against starting more threads than we
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Apr 29 00:33:04 GMT 2024 - 10.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/base/SuppliersTest.java
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 18.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/base/SuppliersTest.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 18.1K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we * search for this mapping by randomly varying the hash codes of * colliding threads. Because search is random, and collisions * only become known via CAS failures, convergence can be slow, * and because threads are typically not bound to CPUS forever, * may not occur at all. However, despite these limitations,
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we * search for this mapping by randomly varying the hash codes of * colliding threads. Because search is random, and collisions * only become known via CAS failures, convergence can be slow, * and because threads are typically not bound to CPUS forever, * may not occur at all. However, despite these limitations,
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/MoreExecutors.java
} /** * Add a shutdown hook to wait for thread completion in the given {@link ExecutorService service}. * This is useful if the given service uses daemon threads, and we want to keep the JVM from * exiting immediately on shutdown, instead giving these daemon threads a chance to terminate * normally. * * @param service ExecutorService which uses daemon threads
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) -
src/main/java/org/codelibs/fess/app/web/api/admin/stats/ApiAdminStatsAction.java
return jvmGcObj; }).toArray(n -> new JvmGcObj[n]); final Threads threads = jvmStats.getThreads(); final JvmThreadsObj jvmThreadsObj = new JvmThreadsObj(); jvmObj.threads = jvmThreadsObj; jvmThreadsObj.count = threads.getCount(); jvmThreadsObj.peak = threads.getPeakCount(); final Classes classes = jvmStats.getClasses();
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 12.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/CallablesTest.java
public @Nullable Void call() throws Exception { assertEquals(Thread.currentThread().getName(), newName.get()); return null; } }; Callables.threadRenaming(callable, newName).call(); assertEquals(oldName, Thread.currentThread().getName()); } @J2ktIncompatible @GwtIncompatible // threads public void testRenaming_exceptionalReturn() throws Exception {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 13 14:28:25 GMT 2024 - 5.4K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
* there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we * search for this mapping by randomly varying the hash codes of * colliding threads. Because search is random, and collisions * only become known via CAS failures, convergence can be slow, * and because threads are typically not bound to CPUS forever, * may not occur at all. However, despite these limitations,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/timer/SystemMonitorTarget.java
return b.toString(); }).collect(Collectors.joining(","))); buf.append("},"); final Threads threads = jvmStats.getThreads(); buf.append("\"threads\":{"); append(buf, "count", () -> threads.getCount()).append(','); append(buf, "peak", () -> threads.getPeakCount()); buf.append("},"); final Classes classes = jvmStats.getClasses();
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 7.5K bytes - Viewed (0)