- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 285 for Queue (0.16 sec)
-
guava/src/com/google/common/cache/LocalCache.java
/** * A queue of elements currently in the map, ordered by write time. Elements are added to the * tail of the queue on write. */ @GuardedBy("this") final Queue<ReferenceEntry<K, V>> writeQueue; /** * A queue of elements currently in the map, ordered by access time. Elements are added to the * tail of the queue on access (note that writes count as accesses).
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 150.3K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
* formally, removes an element {@code e} such that {@code o.equals(e)}, if this queue contains * one or more such elements. Returns {@code true} if and only if this queue contained the * specified element (or equivalently, if this queue changed as a result of the call). * * @param o element to be removed from this queue, if present
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 19.5K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
/** * A bounded {@linkplain BlockingQueue blocking queue} backed by an array. This queue orders * elements FIFO (first-in-first-out). The head of the queue is that element that has been * on the queue the longest time. The tail of the queue is that element that has been on * the queue the shortest time. New elements are inserted at the tail of the queue, and the queue * retrieval operations obtain elements at the head of the queue.
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/cache/CacheTesting.java
* getting a bunch of different keys), then makes sure all the items in the cache are also in the * eviction queue. It will invoke the given {@code operation} on the first element in the eviction * queue, and then reverify that all items in the cache are in the eviction queue, and verify that * the head of the eviction queue has changed as a result of the operation. */ static void checkRecency(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 16.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/EvictingQueue.java
import java.util.Collection; import java.util.Queue; /** * A non-blocking queue which automatically evicts elements from the head of the queue when * attempting to add new elements onto the queue and it is full. This queue orders elements FIFO * (first-in-first-out). This data structure is logically equivalent to a circular buffer (i.e., * cyclic buffer or ring buffer). *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri May 12 17:52:55 GMT 2023 - 4.6K bytes - Viewed (0) -
samples/crawler/src/main/java/okhttp3/sample/Crawler.java
*/ public final class Crawler { private final OkHttpClient client; private final Set<HttpUrl> fetchedUrls = Collections.synchronizedSet(new LinkedHashSet<>()); private final LinkedBlockingQueue<HttpUrl> queue = new LinkedBlockingQueue<>(); private final ConcurrentHashMap<String, AtomicInteger> hostnames = new ConcurrentHashMap<>(); public Crawler(OkHttpClient client) { this.client = client; }
Java - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Thu Aug 12 07:26:27 GMT 2021 - 4.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/UninterruptiblesTest.java
private final BlockingQueue<String> queue; public EnableWrites(BlockingQueue<String> queue, long tMinus) { super(tMinus); assertFalse(queue.isEmpty()); assertFalse(queue.offer("shouldBeRejected")); this.queue = queue; } @Override protected void doAction() { assertNotNull(queue.remove()); } }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 09 22:57:07 GMT 2022 - 30.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ConsumingQueueIterator.java
private final Queue<T> queue; ConsumingQueueIterator(Queue<T> queue) { this.queue = checkNotNull(queue); } @Override @CheckForNull protected T computeNext() { // TODO(b/192579700): Use a ternary once it no longer confuses our nullness checker. if (queue.isEmpty()) { return endOfData(); } return queue.remove(); }
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Sat Jan 21 14:48:03 GMT 2023 - 1.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ListenerCallQueue.java
} private void enqueueHelper(Event<L> event, Object label) { checkNotNull(event, "event"); checkNotNull(label, "label"); synchronized (listeners) { for (PerListenerQueue<L> queue : listeners) { queue.add(event, label); } } } /** * Dispatches all events enqueued prior to this call, serially and in order, for every listener. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Dec 13 19:45:20 GMT 2023 - 8.2K bytes - Viewed (0) -
internal/s3select/csv/reader.go
if !utf8.Valid(next) { return errInvalidTextEncodingError() } // Create queue r.queue = make(chan *queueItem, runtime.GOMAXPROCS(0)) r.input = make(chan *queueItem, runtime.GOMAXPROCS(0)) r.readerWg.Add(1) // Start splitter go func() { defer close(r.input) defer close(r.queue) defer r.readerWg.Done() for { q := queueItem{ input: next,
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Feb 22 06:26:06 GMT 2024 - 8.9K bytes - Viewed (0)