/** * toArray contains all elements in FIFO order */ public void testToArray() { LinkedBlockingQueue q = populatedQueue(SIZE); Object[] o = q.toArray(); for (int i = 0; i < o.length; i++) assertSame(o[i], q.poll()); }
/** * toArray(incompatible array type) throws ArrayStoreException */ public void testToArray1_BadArg() { LinkedBlockingQueue q = populatedQueue(SIZE); try { q.toArray(new String[10]); shouldThrow(); } catch (ArrayStoreException success) {} }
/** * toArray(a) contains all elements in FIFO order */ public void testToArray2() throws InterruptedException { LinkedBlockingQueue<Integer> q = populatedQueue(SIZE); Integer[] ints = new Integer[SIZE]; Integer[] array = q.toArray(ints); assertSame(ints, array); for (int i = 0; i < ints.length; i++) assertSame(ints[i], q.poll()); }
if(notificationQueue !=null){ LinkedBlockingQueue<SimpleApnsPushNotification> queue = ( LinkedBlockingQueue<SimpleApnsPushNotification> )notificationQueue; Object[] objectMess = queue.toArray(); //get messages still in queue for(Object o : objectMess){ if(o instanceof SimpleApnsPushNotification) {
public <E> E[] toArray(E[] a) { return delegate.toArray(a); }
java.util.concurrent.LinkedBlockingQueue.toArray()
public <T> T[] toArray(T[] a) { return m_queue.toArray(a); }
public <T> T[] toArray(final T[] a) { return blockingQueue.toArray(a); }
public Object[] toArray() { return delegate.toArray(); }
public Object[] toArray() { return m_queue.toArray(); }
public <T> T[] toArray(T[] a) { return m_queue.toArray(a); }
public Object[] toArray() { return m_queue.toArray(); }
public Object[] toArray() { return blockingQueue.toArray(); }
public void close() { Object[] tuple2Arr = transFormFuture.toArray(); for (Object obj : tuple2Arr) { Future<ElasticsearchMetadata> future = (Future<ElasticsearchMetadata>) obj; future.cancel(true); } }
private List<Message> getMessages() { return Arrays.asList(this.messages.toArray(new Message[this.messages.size()])); }
@Override public void execute(Runnable command) { if (tasks.size() > 100) { log.warn("User thread saturated, memory exhaustion may occur."); log.warn("Check for deadlocked or slow event handlers. Sample tasks:"); for (Object task : tasks.toArray()) log.warn(task.toString()); } Uninterruptibles.putUninterruptibly(tasks, command); } }
/** * {@inheritDoc} */ @Override public byte[] getBytes() { return toPrimitiveType( _datagramQueue.toArray( new Byte[_datagramQueue.size()] ) ); }
/** * {@inheritDoc} */ @Override public byte[] getBytes() { return toPrimitiveType( _datagramQueue.toArray( new Byte[_datagramQueue.size()] ) ); }
protected boolean processBufferedMessages(Event event) throws AvpDataException { if (listeners.size() == 0) { try { buffer.add(event); } catch (IllegalStateException e) { // FIXME : requires JDK6 : buffer.removeLast(); Event[] tempBuffer = buffer.toArray(new Event[buffer.size()]); buffer.remove(tempBuffer[tempBuffer.length - 1]); buffer.add(event); } return false; } else { return true; } }
public <T> T[] toArray(T[] a) { if (isRunning()) { return q.toArray(a); } else { return new LinkedBlockingQueue<T>(0).toArray(a); } }