org.mentaqueue.test.sample.SampleCode 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.test.sample;
import org.mentaqueue.AtomicQueue;
import org.mentaqueue.BatchingQueue;
public class SampleCode {
private static int MESSAGES = 1000 * 1000 * 10;
public static class Entry {
long sequence;
StringBuilder message = new StringBuilder(256);
}
public static void main(String[] args) throws Exception {
final BatchingQueue queue = new AtomicQueue(1024 * 8, Entry.class);
//// CONSUMER
Thread t = new Thread() {
@Override
public void run() {
boolean running = true;
long expectedSequence = 1;
while(running) {
long x = queue.availableToPoll();
if (x > 0) {
for(int i = 0; i < x; i++) {
Entry entry = queue.poll();
if (entry.sequence == expectedSequence) {
// do whatever you want with entry.sequence and entry.message
// you probably do not want to call toString() on entry.message
// you can always print to system.out or write to a file one char at a time
// without creating any garbage for the GC
if (entry.sequence == MESSAGES) {
running = false; // bye
} else {
expectedSequence++;
}
} else {
throw new IllegalStateException("This should NEVER happen!");
}
}
queue.donePolling(true);
} else {
// nothing available so now you have to wait
// you can use a WaitStrategy for that or just busy spin
// refer to the section on wait strategies...
}
}
}
};
long start = System.currentTimeMillis();
t.start();
//// PRODUCER
for(int i = 1; i <= MESSAGES; i++) {
Entry entry = queue.nextToDispatch();
if (entry == null) {
// consumer is very slow! Maybe it is even dead...
// again you can use a WaitStrategy here or just busy spin
// refer to the section on wait strategies...
i--; // try again! (don't forget that!)
} else {
entry.sequence = i;
entry.message.append("message_").append(entry.sequence);
queue.flush(true);
}
}
t.join();
long time = System.currentTimeMillis() - start;
System.out.println("DONE in " + time + " millis");
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy