1. 模拟Queue

package com.gf.conn009;

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

/**
 * 模拟Queue
 * @author huanchu
 *
 */
public class MyQueue {
	
	private final LinkedList<Object> list = new LinkedList<Object>();
	
	private final AtomicInteger count = new AtomicInteger(0);
	
	private final int maxSize;
	
	private final int minSize = 0;
	
	private final Object lock = new Object();
	
	public MyQueue(int maxSize){
		this.maxSize = maxSize;
	}
	
	public void put(Object obj){
		synchronized (lock) {
			while (count.get() == maxSize) {
				
				try {
					lock.wait();
				} catch (InterruptedException e) {
					e.printStackTrace();
				}
			}
			
			list.add(obj);
			count.incrementAndGet();
			System.out.println(" 元素 " + obj + " 被添加");
			
			lock.notify();
		}
	}
	
	public Object take(){
		Object temp = null;
		synchronized (lock) {
			while (count.get() == minSize) {
				try {
					lock.wait();
				} catch (InterruptedException e) {
					e.printStackTrace();
				}
			}
			
			count.decrementAndGet();
			temp = list.removeFirst();
			System.out.println(" 元素" + temp + "被消费");
			lock.notify();
		}
		return temp;
	}
	
	public int size(){
		return count.get();
	}
	
	public static void main(String[] args) throws InterruptedException {
		
		final MyQueue m = new MyQueue(5);
		m.put("a");
		m.put("b");
		m.put("c");
		m.put("d");
		m.put("e");
		System.out.println("当前元素的个数:" + m.size());
		
		Thread t1 = new Thread(new Runnable() {
			
			@Override
			public void run() {
				m.put("h");
				m.put("i");
			}
		},"t1");
		
		Thread t2 = new Thread(new Runnable() {
			
			@Override
			public void run() {
				try {
					Thread.sleep(1000);
					Object t1 = m.take();
					
					Thread.sleep(1000);
					Object t2 = m.take();
				} catch (InterruptedException e) {
					e.printStackTrace();
				}
				
			}
		},"t2");
		
		t1.start();
		Thread.sleep(1000);
		t2.start();
		
	}
	
}

关注我的公众号,精彩内容不能错过

原文地址:https://www.cnblogs.com/huanchupkblog/p/8038155.html