生产者消费者JAVA队列实现

Java代码
class SyncQueue...{
private int head=0;//队头
private int tail=1;//队尾
public final int Num=6;//缓冲区大小
public char data[]=new char[Num];
public synchronized void inqueue(char c)...{
while((tail+1)%Num==head)...{
try...{
this.wait();
}catch(InterruptedException e)...{System.out.println(e);}

}
this.notify();

data[tail]=c;
tail=(tail+1)%Num;
System.out.println("produced:" + c );


}
public synchronized char outqueue()...{
while((head+1)%Num==tail)...{
try...{
this.wait();
}catch(InterruptedException e)...{System.out.println(e);}
}
this.notify();


head=(head+1)%Num;

System.out.println("消费:"+data[head]);
return data[head];


}
}

class SyncQueue...{
private int head=0;//队头
private int tail=1;//队尾
public final int Num=6;//缓冲区大小
public char data[]=new char[Num];
public synchronized void inqueue(char c)...{
while((tail+1)%Num==head)...{
try...{
this.wait();
}catch(InterruptedException e)...{System.out.println(e);}

}
this.notify();

data[tail]=c;
tail=(tail+1)%Num;
System.out.println("produced:" + c );


}
public synchronized char outqueue()...{
while((head+1)%Num==tail)...{
try...{
this.wait();
}catch(InterruptedException e)...{System.out.println(e);}
}
this.notify();


head=(head+1)%Num;

System.out.println("消费:"+data[head]);
return data[head];


}
}


Java代码
class Producer implements Runnable...{
SyncQueue queue;
public Producer(SyncQueue s)...{
queue=s;
}
public void run()...{
for(int i=0;i<20;i++)...{
char c=(char)(Math.random()*26+'A');
queue.inqueue(c);
try...{
Thread.sleep((int)(Math.random()*20));
}catch(InterruptedException e)...{System.out.println(e);}
}
}
}

class Producer implements Runnable...{
SyncQueue queue;
public Producer(SyncQueue s)...{
queue=s;
}
public void run()...{
for(int i=0;i<20;i++)...{
char c=(char)(Math.random()*26+'A');
queue.inqueue(c);
try...{
Thread.sleep((int)(Math.random()*20));
}catch(InterruptedException e)...{System.out.println(e);}
}
}
}


Java代码
class Customer implements Runnable...{
SyncQueue queue;
public Customer(SyncQueue s)...{
queue=s;
}
public void run()...{
for(int i=0;i<20;i++)...{
char c=queue.outqueue();
try...{
Thread.sleep((int)(Math.random()*20));
}catch(InterruptedException e)...{System.out.println(e);}
}
}
}

class Customer implements Runnable...{
SyncQueue queue;
public Customer(SyncQueue s)...{
queue=s;
}
public void run()...{
for(int i=0;i<20;i++)...{
char c=queue.outqueue();
try...{
Thread.sleep((int)(Math.random()*20));
}catch(InterruptedException e)...{System.out.println(e);}
}
}
}


Java代码
public class SyncTest...{
public static void main (String[] args) ...{
SyncQueue queue=new SyncQueue();
Runnable p=new Producer(queue);
Runnable c=new Customer(queue);
Thread t1=new Thread(p);
Thread t2=new Thread(c);
t1.start();
t2.start();

}
}

public class SyncTest...{
public static void main (String[] args) ...{
SyncQueue queue=new SyncQueue();
Runnable p=new Producer(queue);
Runnable c=new Customer(queue);
Thread t1=new Thread(p);
Thread t2=new Thread(c);
t1.start();
t2.start();

}
}

注:注意wait()和notify()的位置,否则将引者死锁的发生。
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
生产者消费者模式是一种常见的并发编程模型,队列可以作为其实现方式之一。Java中可以使用BlockingQueue来实现队列的功能,具体步骤如下: 1. 定义一个BlockingQueue对象作为生产者和消费者之间的缓冲区。 ``` BlockingQueue<Integer> queue = new LinkedBlockingQueue<>(10); ``` 2. 定义一个生产者类,该类会不断地向队列中添加数据,直到队列满为止。 ``` class Producer implements Runnable { private BlockingQueue<Integer> queue; public Producer(BlockingQueue<Integer> queue) { this.queue = queue; } public void run() { try { while (true) { int i = new Random().nextInt(); queue.put(i); System.out.println("生产生产数据:" + i); Thread.sleep(1000); } } catch (InterruptedException e) { e.printStackTrace(); } } } ``` 3. 定义一个消费者类,该类会不断地从队列中取出数据,直到队列为空为止。 ``` class Consumer implements Runnable { private BlockingQueue<Integer> queue; public Consumer(BlockingQueue<Integer> queue) { this.queue = queue; } public void run() { try { while (true) { int i = queue.take(); System.out.println("消费消费数据:" + i); Thread.sleep(1000); } } catch (InterruptedException e) { e.printStackTrace(); } } } ``` 4. 创建一个线程池,并启动生产者和消费者线程。 ``` ExecutorService executor = Executors.newFixedThreadPool(2); executor.submit(new Producer(queue)); executor.submit(new Consumer(queue)); ``` 这样就完成了生产者消费者模式的实现生产者会不断地向队列中添加数据,消费者会不断地从队列中取出数据,当队列满时,生产者会阻塞等待,当队列为空时,消费者会阻塞等待。

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值