@Override public E pollFirst() { synchronized (mutex) { return delegate().pollFirst(); } }
/** * Poll a {@link Channel} out of the internal storage to reuse it. This will return {@code null} if no * {@link Channel} is ready to be reused. * * Sub-classes may override {@link #pollChannel()} and {@link #offerChannel(Channel)}. Be aware that * implementations of these methods needs to be thread-safe! */ protected Channel pollChannel() { return lastRecentUsed ? deque.pollLast() : deque.pollFirst(); }
public <E> E lease(Deque<E> d) { return d.pollFirst(); } },
@Override public byte[] allocate(int size) { synchronized (this) { if (bufferQueue.isEmpty()) { return new byte[size]; } else { return bufferQueue.pollFirst(); } } }
/** * Poll a {@link Channel} out of the internal storage to reuse it. This will return {@code null} if no * {@link Channel} is ready to be reused. * * Sub-classes may override {@link #pollChannel()} and {@link #offerChannel(Channel)}. Be aware that * implementations of these methods needs to be thread-safe! */ protected Channel pollChannel() { return lastRecentUsed ? deque.pollLast() : deque.pollFirst(); }
@Override public ByteBuffer get(int size) { Deque<ByteBuffer> bufferQueue = bufferMap.get(size); if (bufferQueue == null || bufferQueue.isEmpty()) return ByteBuffer.allocate(size); else return bufferQueue.pollFirst(); }
@Override public E pollFirst() { synchronized (mutex) { return delegate().pollFirst(); } }
private void store(Level level, String msg) { buffer.addLast(new LogEvent(level, msg)); if (buffer.size() > BUFFER_SIZE) { buffer.pollFirst(); } }
/** * @return the most recently used resource and null if there are no free resources */ private ResourceInternal<T> poll() { try { mLock.lock(); return mAvailableResources.pollFirst(); } finally { mLock.unlock(); } }
/** * Complete the last request that was sent to a particular node. * @param node The node the request was sent to * @return The request */ public NetworkClient.InFlightRequest completeLastSent(String node) { NetworkClient.InFlightRequest inFlightRequest = requestQueue(node).pollFirst(); inFlightRequestCount.decrementAndGet(); return inFlightRequest; }
@Override public E pollFirst() { synchronized (mutex) { return delegate().pollFirst(); } }
/** * Complete the earliest uncompleted call with the given error. * * @return true if there was an uncompleted call to complete */ public synchronized boolean errorNext(RuntimeException e) { Completion completion = this.completions.pollFirst(); if (completion != null) { completion.complete(e); return true; } else { return false; } }
public ByteBuffer borrowBuffer() { ByteBuffer buffer = availableBuffers.pollFirst(); if (availableBuffers.size() < poolSize * 0.4) { log.warn("TransientStorePool only remain {} sheets.", availableBuffers.size()); } return buffer; }
@CanIgnoreReturnValue // TODO(cpovirk): Consider removing this? @Override public E pollFirst() { return delegate().pollFirst(); }
@Override public E pollFirst() { assertTrue(Thread.holdsLock(mutex)); return delegate.pollFirst(); }
@Override public void run() { final long uptimeMillis = SystemClock.uptimeMillis(); while (!snapshotCallbacks.isEmpty()) { snapshotCallbacks.pollFirst().onDataRendered(isMounted, uptimeMillis); } } });
/** {@inheritDoc} */ @Override public E pollLast() { E res = deque.pollFirst(); if (res != null) adder.decrement(); return res; }
@CanIgnoreReturnValue // TODO(cpovirk): Consider removing this? @Override public E pollFirst() { return delegate().pollFirst(); }
@CanIgnoreReturnValue // TODO(cpovirk): Consider removing this? @Override public E pollFirst() { return delegate().pollFirst(); }
create().removeFirst(); create().removeLast(); create().pollFirst(); create().pollLast(); create().getFirst();