org.mentaqueue.BlockingLinkedQueue Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of menta-queue Show documentation
Show all versions of menta-queue Show documentation
A super fast inter-thread transfer queue.
The newest version!
/*
* MentaQueue => http://mentaqueue.soliveirajr.com
* Copyright (C) 2012 Sergio Oliveira Jr. ([email protected])
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
package org.mentaqueue;
import static org.mentaqueue.util.BuilderUtils.createBuilder;
import org.mentaqueue.util.Builder;
public class BlockingLinkedQueue implements BatchingQueue {
private final static int DEFAULT_CAPACITY = 1026 * 16;
private final java.util.concurrent.LinkedBlockingQueue queue;
private final Builder builder;
@SuppressWarnings("unchecked")
private final E[] temp = (E[]) new Object[DEFAULT_CAPACITY];
private int tempPointer = 0;
public BlockingLinkedQueue(int capacity, Builder builder) {
queue = new java.util.concurrent.LinkedBlockingQueue(capacity);
this.builder = builder;
}
public BlockingLinkedQueue(Class klass) {
this(DEFAULT_CAPACITY, createBuilder(klass));
}
public BlockingLinkedQueue(Builder builder) {
this(DEFAULT_CAPACITY, builder);
}
@Override
public E nextToDispatch() {
E e = builder.newInstance();
temp[tempPointer++] = e;
return e;
}
@Override
public void flush(boolean lazySet) {
try {
for(int i = 0; i < tempPointer; i++) {
queue.put(temp[i]);
temp[i] = null;
}
tempPointer = 0;
} catch(Exception exc) {
throw new RuntimeException(exc);
}
}
@Override
public final void flush() {
flush(false);
}
@Override
public long availableToPoll() {
return queue.size();
}
@Override
public E poll() {
return queue.poll();
}
@Override
public E peek() {
return queue.peek();
}
@Override
public void donePolling(boolean lazySet) {
}
@Override
public final void donePolling() {
donePolling(false);
}
@Override
public final void rollback() {
throw new UnsupportedOperationException();
}
@Override
public final void rollback(long count) {
throw new UnsupportedOperationException();
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy