Searched defs:concurrent (Results 76 - 92 of 92) sorted by relevance
1234
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | ThreadLocalRandom.java | 7 package java.util.concurrent; 12 import java.util.concurrent.atomic.AtomicInteger; 13 import java.util.concurrent.atomic.AtomicLong; 28 * than shared {@code Random} objects in concurrent programs will 68 * application-level overhead and footprint of most concurrent
|
H A D | ArrayBlockingQueue.java | 7 package java.util.concurrent; 18 import java.util.concurrent.locks.Condition; 19 import java.util.concurrent.locks.ReentrantLock; 939 * iterator to track concurrent updates completely accurately,
|
H A D | ConcurrentLinkedDeque.java | 7 package java.util.concurrent; 26 * An unbounded concurrent {@linkplain Deque deque} based on linked nodes. 31 * Like most other concurrent collection implementations, this class 52 * <p>Memory consistency effects: As with other concurrent collections, 69 * This is an implementation of a concurrent lock-free deque 164 * other concurrent collection classes. The idea is to replace 1077 * useful in concurrent applications.
|
H A D | ForkJoinTask.java | 7 package java.util.concurrent; 16 import java.util.concurrent.locks.ReentrantLock; 110 * returns a {@link java.util.concurrent.CancellationException}); and 114 * {@link java.util.concurrent.CancellationException}.
|
H A D | LinkedBlockingDeque.java | 7 package java.util.concurrent; 15 import java.util.concurrent.locks.Condition; 16 import java.util.concurrent.locks.ReentrantLock;
|
H A D | LinkedTransferQueue.java | 7 package java.util.concurrent; 17 import java.util.concurrent.locks.LockSupport; 48 * <p>Memory consistency effects: As with other concurrent 1229 * {@link java.util.concurrent.BlockingQueue#offer(Object,long,TimeUnit) 1492 * {@link java.util.concurrent.BlockingQueue#remainingCapacity()
|
H A D | ScheduledThreadPoolExecutor.java | 7 package java.util.concurrent; 9 import static java.util.concurrent.TimeUnit.MILLISECONDS; 10 import static java.util.concurrent.TimeUnit.NANOSECONDS; 18 import java.util.concurrent.atomic.AtomicLong; 19 import java.util.concurrent.locks.Condition; 20 import java.util.concurrent.locks.ReentrantLock;
|
H A D | SynchronousQueue.java | 8 package java.util.concurrent; 16 import java.util.concurrent.locks.LockSupport; 17 import java.util.concurrent.locks.ReentrantLock; 454 * s. If there are multiple concurrent calls to clean, we
|
H A D | ThreadPoolExecutor.java | 7 package java.util.concurrent; 14 import java.util.concurrent.atomic.AtomicInteger; 15 import java.util.concurrent.locks.AbstractQueuedSynchronizer; 16 import java.util.concurrent.locks.Condition; 17 import java.util.concurrent.locks.ReentrantLock; 68 * number of concurrent tasks. Most typically, core and maximum pool 438 * While we could use a concurrent set of some sort, it turns out
|
H A D | CompletableFuture.java | 7 package java.util.concurrent; 9 import java.util.concurrent.locks.LockSupport;
|
H A D | ConcurrentSkipListMap.java | 7 package java.util.concurrent; 37 * A scalable concurrent {@link ConcurrentNavigableMap} implementation. 42 * <p>This class implements a concurrent variant of <a 76 * interfaces. Like most other concurrent collections, this class does 122 * deleted nodes when deleting to avoid conflicts with concurrent 158 * concurrent replace vs delete operations -- an attempted replace 1599 * useful in concurrent applications.
|
H A D | ForkJoinPool.java | 7 package java.util.concurrent; 18 import java.util.concurrent.locks.ReentrantLock; 19 import java.util.concurrent.locks.LockSupport; 104 * <li>{@code java.util.concurrent.ForkJoinPool.common.parallelism} 106 * <li>{@code java.util.concurrent.ForkJoinPool.common.threadFactory} 108 * <li>{@code java.util.concurrent.ForkJoinPool.common.exceptionHandler} 110 * <li>{@code java.util.concurrent.ForkJoinPool.common.maximumSpares} 1402 * "java.util.concurrent.ForkJoinPool.common.maximumSpares" system 3459 ("java.util.concurrent.ForkJoinPool.common.maximumSpares"); 3487 ("java.util.concurrent [all...] |
H A D | ConcurrentHashMap.java | 7 package java.util.concurrent; 24 import java.util.concurrent.atomic.AtomicReference; 25 import java.util.concurrent.locks.LockSupport; 26 import java.util.concurrent.locks.ReentrantLock; 66 * such as {@code putAll} and {@code clear}, concurrent retrievals may 75 * useful only when a map is not undergoing concurrent updates in other threads. 110 * java.util.concurrent.atomic.LongAdder} values and initializing via 243 * concurrent readability (typically method get(), but also 406 * frequently during concurrent access. To avoid reading so often, 2140 * there are concurrent insertion [all...] |
/libcore/luni/src/main/java/java/util/concurrent/locks/ |
H A D | ReentrantReadWriteLock.java | 7 package java.util.concurrent.locks; 10 import java.util.concurrent.TimeUnit;
|
H A D | AbstractQueuedLongSynchronizer.java | 7 package java.util.concurrent.locks; 12 import java.util.concurrent.TimeUnit; 13 import java.util.concurrent.locks.AbstractQueuedSynchronizer.Node;
|
H A D | StampedLock.java | 7 package java.util.concurrent.locks; 9 import java.util.concurrent.TimeUnit;
|
H A D | AbstractQueuedSynchronizer.java | 7 package java.util.concurrent.locks; 12 import java.util.concurrent.TimeUnit; 156 * {@link java.util.concurrent.atomic atomic} classes, your own custom 229 * {@link java.util.concurrent.CountDownLatch CountDownLatch} 341 * in simple (non-concurrent) linked queues because they are
|
Completed in 590 milliseconds
1234