detection.java

RFID复杂事件处理系统的研究实验

package test;
import java.util.*;

public class Detection implements Runnable{
	private WaitQueue waitQueue;
	private boolean isStopped=false;
	private Tree atree;
	private double delay=0;
	private long maxsize=0;
	private long resultnum=0;
	private long ts;
	private long te;
	
	Detection(WaitQueue waitQueue)
	{
		this.waitQueue=waitQueue;
	}
	void detect()
	{
		int n =0;
		int size=500;
		ts=System.nanoTime()/1000000;
		while(!isStopped)
		{
		P_Event pe=waitQueue.getEvent();		
		Leaf aleaf=atree.insert(pe);
		if(aleaf!=null){
			if(maxsize<getsize()) maxsize=getsize();
		if(aleaf.getmode()==0){
		for(int i=0;i<aleaf.getparent().size();i++)
		{
			active(aleaf.getparent().get(i),aleaf,atree);
		}
		}
		}
		n++;
		if(n==size) {
			te=System.nanoTime()/1000000;
			stopDetect();
			System.out.println("此刻延迟="+delay/500);
			System.out.println("size="+maxsize);
			System.out.println("吞吐率="+((double)size)/(te-ts));
		}
		
		}
	}
	
	void active(NonLeaf n,Node n2,Tree atree)
	{		
		C_Event ce=null;
		if(n.getoperator().equals(";"))
		{
			Sequence nn=(Sequence)n;
			ce=nn.work(n, n2);
		}
		if(ce!=null){
			long t =System.nanoTime()/1000000; 
			
		if(atree.getRoot()==n)
		{
			delay+=t-ce.gett_end();			
			resultnum++;
			//System.out.println("此刻内存中存储的最大基本事件个数="+maxsize);
			/*LinkedList<P_Event> pel=ce.getel();
			System.out.println("<<<<<<<<<<<<<<<<");
			System.out.println();
			System.out.println("产生匹配结果：");
			for(int j=0;j<pel.size();j++)
			{
				System.out.print(pel.get(j).gettype());
			    System.out.print(pel.get(j).gettimestamp()+" ");
			}
			System.out.println();
			System.out.println(">>>>>>>>>>>>>>>>");	*/
		}else{
			
			n.getmid_result().addLast(ce);
			
			if(n.getmode()==0){			
			for(int i=0;i<n.getparent().size();i++)
			{
				active(n.getparent().get(i),n,atree);
			}}else{
				if(maxsize<getsize()) maxsize=getsize();
				//System.out.println("此刻内存中存储的最大基本事件个数="+maxsize);
			}
		}
		}else{
			if(maxsize<getsize()) maxsize=getsize();
			//System.out.println("基本事件个数="+maxsize);
		}
			
	}
	
	public long getsize()
	{
		long size=0;
		for(int i=0;i<atree.getNodes().size();i++)
		{
			Node n=atree.getNodes().get(i);
			if(n.getisleaf())
			{
				size=+((Leaf)n).getevents().size();
			}else{
				for(int j=0;j<((NonLeaf)n).getmid_result().size();j++)
				{
					size=+((NonLeaf)n).getmid_result().get(j).getel().size();
				}
			}
		}
		return size;
	}
	
	public void stopDetect()
	{
		isStopped = true;
	}
	public void startDetect()
	{
		isStopped = false;
	}
	
	public void run()
	{
		detect();
	}
	public WaitQueue getWaitQueue() {
		return waitQueue;
	}
	public void setAtree(Tree atree) {
		this.atree = atree;
	}
	public long getResultnum() {
		return resultnum;
	}

}