模拟消息队列的生产者消费者模式
package day09;
import java.util.LinkedList;
public class Test_09 {
public static void main(String[] args) {
MessageQueue queue = new MessageQueue(2);
for (int i = 0; i < 3; i++) {
int id = i;
new Thread(() ->{
queue.put(new Message(id , "id :"+id));
} , "生产者" + i).start();
}
new Thread(()->{
while (true){
try {
Thread.sleep(1000);
} catch (InterruptedException e) {
e.printStackTrace();
}
queue.take();
}
},"消费者 ").start();
}
}
//消息队列类
class MessageQueue{
private LinkedList<Message> list = new LinkedList<>();
private int capcity;
public MessageQueue(int capcity){
this.capcity = capcity;
}
//生产者
public void put(Message msg){
synchronized (list){
while (list.size() >= capcity){
try {
System.out.println("容量满了 ... 没办法生产了");
list.wait();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
System.out.println("生产的是 : "+msg.toString());
list.addLast(msg);
list.notifyAll(); //唤醒
}
}
//消费者
public Message take(){
synchronized (list){
while (list.isEmpty() ){
try {
System.out.println("一个都没有...没办法消费");
list.wait();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
System.out.println("来了..来了..");
list.notifyAll();
return list.removeFirst();
}
}
}
class Message{
private int id;
private Object value;
@Override
public String toString() {
return "Message{" +
"id=" + id +
", value=" + value +
'}';
}
public int getId() {
return id;
}
public Object getValue() {
return value;
}
public Message(int id, Object value) {
this.id = id;
this.value = value;
}
}
生产的是 : Message{id=1, value=id :1}
生产的是 : Message{id=0, value=id :0}
容量满了 ... 没办法生产了
来了..来了..
生产的是 : Message{id=2, value=id :2}
来了..来了..
来了..来了..
一个都没有...没办法消费