📄 7_02_030421217.java
字号:
//书本的太难做不出来
//做了个生产者-消费者同步访问队列里临界资源的例子
class Test
{
public static void main(String[] args)
{
Queue q = new Queue();
Producer p = new Producer(q);
Consumer c = new Consumer(q);
new Thread(p).start();
new Thread(c).start();
}
}
class Queue
{
//int value;
int value1,value2,value3;
boolean bFull = false;
public synchronized void put(int i)
{
if(!bFull)
{
value1 = i;
bFull = true;
notify();
}
try
{
wait();
}
catch(Exception e)
{
e.printStackTrace();
}
}
public synchronized int get()
{
if(!bFull)
{
try
{
wait();
}
catch(Exception e)
{
e.printStackTrace();
}
}
bFull = false;
notify();
return value1;
}
}
class Producer extends Thread
{
Queue q;
Producer(Queue q)
{
this.q = q;
}
public void run()
{
for(int i=0;i<5;i++)
{
q.put(i);
System.out.println("Producer:"+getName()+" put "+i);
}
}
}
class Consumer extends Thread
{
Queue q;
Consumer(Queue q)
{
this.q = q;
}
public void run()
{
while(true)
System.out.println("Consumer:"+getName()+" get "+q.get());
}
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -