nonleaf.java

来自「RFID复杂事件处理系统的研究实验」· Java 代码 · 共 180 行

package test2;
import java.util.*;

public class NonLeaf extends Node {
	public static char commontype='z';
	protected int during=Integer.MAX_VALUE;
	protected int tl=0;
	protected int th=Integer.MAX_VALUE;;
	protected boolean isnew=true;
	protected String operator;
	protected Node lchild=null;
	protected Node rchild=null;
	protected LinkedList<C_Event> mid_result=new LinkedList<C_Event>();
	
	
	public NonLeaf()
	{
		super(commontype--);
		isleaf=false;
	}
	public NonLeaf(NonLeaf n,int t){
		super(commontype--);
		isleaf=false;
		lchild=n.getlchild();
		rchild=n.getrchild();
		during=t;
		tl=n.gettl();
		th=n.getth();
		operator=n.getoperator();
	}
	public NonLeaf(String o)
	{
		super(commontype--);
		isleaf=false;
		operator=new String(o);
	}
	public NonLeaf(NonLeaf n){
		super(n);
		this.lchild=n.getlchild();
		this.rchild=n.getrchild();		
		isleaf=false;
		tl=n.tl;
		th=n.th;
		during=n.getduring();
		operator=new String(n.operator);
		mid_result=new LinkedList<C_Event>();
	}
	
	
	public LinkedList<C_Event> getmid_result()
	{
		return mid_result;
	}
	public String getoperator()
	{
		return operator;
	}
	public int getduring()
	{
		return during;
	}
	public int gettl()
	{
		return tl;
	}
	public int getth()
	{
		return th;
	}
	public Node getlchild()
	{
		return lchild;
	}
	public Node getrchild()
	{
		return rchild;
	}
	public boolean getisnew()
	{
		return isnew;
	}
	
	
	
	
	void setoperator(String s)
	{
		operator=new String(s);
	}
	void setduring(int t)
	{
		during=t;
	}
	void settl(int t)
	{
		tl=t;
	}
	void setth(int t)
	{
		th=t;
	}
	void setlchild(Node n)
	{
		lchild=n;
	}
	void setrchild(Node n)
	{
		rchild=n;
	}
	void resetisnew()
	{
		isnew=false;
	}
	
	
	int add_mr(C_Event c)
	{
		int i;
		for(i=0;i<mid_result.size();i++)
			if(mid_result.get(i).gett_start()>c.gett_start()) break;
		if(i==mid_result.size()) 
		{
			mid_result.addLast(c);
		}
		else  mid_result.add(i,c);
		return i;
	}	
	void delete(P_Event e)
	{
		for(int i=0;i<mid_result.size();i++)
		{
			if(mid_result.get(i).checkhHave(e));
			{
				mid_result.remove(i);
				i--;
			}
		}
	}
	
	boolean checkin(int t1,int t2)
	{
		for(int i=0;i<mid_result.size();i++)
			if(mid_result.get(i).checkIn(t1, t2)) return true;
	    return false;
	}
	
	int checkeffect(C_Event ce)
	{
		if(ce.getel().size()==2){
		int k;
		for(k=0;k<mid_result.size();k++)
			if(mid_result.get(k).getel().getFirst().gettype()==ce.getel().getFirst().gettype()
					&& mid_result.get(k).getel().getFirst().gettimestamp()==ce.getel().getFirst().gettimestamp()
					|| mid_result.get(k).getel().get(1).gettype()==ce.getel().get(1).gettype()
					&& mid_result.get(k).getel().get(1).gettimestamp()==ce.getel().get(1).gettimestamp())
				break;
		if(k!=mid_result.size()) return k;
		else return Integer.MAX_VALUE;
		}else{
			int k;
			for(k=0;k<mid_result.size();k++)
				if(mid_result.get(k).getel().getFirst().gettype()==ce.getel().getFirst().gettype()
						&& mid_result.get(k).getel().getFirst().gettimestamp()==ce.getel().getFirst().gettimestamp()
						|| mid_result.get(k).getel().get(1).gettype()==ce.getel().get(1).gettype()
						&& mid_result.get(k).getel().get(1).gettimestamp()==ce.getel().get(1).gettimestamp()
						|| mid_result.get(k).getel().get(2).gettype()==ce.getel().get(2).gettype()
						&& mid_result.get(k).getel().get(2).gettimestamp()==ce.getel().get(2).gettimestamp())
					break;
			if(k!=mid_result.size()) return k;
			else return Integer.MAX_VALUE;
		}
	}
	
	//LinkedList<C_Event> work(int m,NonLeaf n1,Node n2){return null;}
	//C_Event work(Node n2,NonLeaf n1){return null;}
	//boolean work(int m,NonLeaf n){return false;}
	//boolean work(NonLeaf n){return false;}
}