java发编程【一个demo 学习--queue(七)】

package com.study.thread;

import java.util.LinkedList;
import java.util.concurrent.atomic.AtomicInteger;

public class MyQueueTest {

    private final static LinkedList<Object> list = new LinkedList<Object>();
    private final AtomicInteger count = new AtomicInteger();
    private int minSize = 0;
    private int maxSize;
    private Object lock = new Object();

    public MyQueueTest(int maxSize){
        this.maxSize = maxSize;
    }

    public void put(Object object){
        synchronized (lock){
            while (count.get()==this.maxSize){
                try {
                    lock.wait();
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }
            list.add(object);
            count.incrementAndGet();
            lock.notify();
        }
    }

    public Object take(){
        Object object = null;
        synchronized (lock){
            while (count.get()==this.minSize){
                try {
                    lock.wait();
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }
            object = list.removeFirst();
            count.decrementAndGet();
            lock.notify();
        }
        return object;
    }

    public static void main(String[] args) {
        MyQueueTest myQueueTest = new MyQueueTest(4);
        myQueueTest.put("a");
        myQueueTest.put("b");
        myQueueTest.put("c");
        myQueueTest.put("d");
        System.out.println(myQueueTest.count);

        new Thread(new Runnable() {
            @Override
            public void run() {
                myQueueTest.put("e");
                System.out.println("---------ok------------");
            }
        }).start();

        new Thread(new Runnable() {
            @Override
            public void run() {
                System.out.println(myQueueTest.take().toString());
            }
        }).start();

    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值