nqueue.java

来自「PEPA模型性能分析工具」· Java 代码 · 共 79 行

package trans;

public class NQueue {
	public Node first;
	public Node last;
	private int number;
	
	public NQueue()
	{
		first=null;
		last=null;
		number=0;
	}
	public void copy(NQueue nq)
	{
		this.first=nq.first;
		this.last=nq.last;
		this.number=nq.number;
	}
	public void clear()
	{
		first=null;
		last=null;
		number=0;
	}
	public boolean isEmpty()
	{
		if(number==0) return true;
		else return false;
	}
	public boolean isSingle()
	{
		if(number==1) return true;
		else return false;
	}
	public void concat(NQueue nq)
	{
		 if (nq.first != null) {
	         if (this.first == null) {
	            this.first = nq.first;
	            this.last = nq.last;
	         } else {
	            this.last.setNext(nq.first);
	            this.last = nq.last;
	         }
	         this.number += nq.number;
	         nq.clear();
	      }
	}
	public void push(Object o)
	{
		if(isEmpty())
		{
			this.first=new Node(o);
			this.last=this.first;
		}else
		{
			this.last.setNext(new Node(o));
			this.last=this.last.getNext();
		}
		this.number++;
	}
	public Object pop()
	{
		Node n=this.first;
		if(isSingle())
		{
			this.first=null;
			this.last=null;
		}
		else
		{
			this.first=this.first.getNext();
		}
		this.number--;
		return n.getValue();
	}
}