tree.java

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

package test;
import java.util.*;

public class Tree {
	private String patterns;	
	private NonLeaf root;
	private LinkedList<Leaf> leafnodes=new LinkedList<Leaf>();
	private LinkedList<Node> nodes=new LinkedList<Node>();
	
	public LinkedList<Leaf> getLeafnodes() {
		return leafnodes;
	}

	public void setLeafnodes(LinkedList<Leaf> leafnodes) {
		this.leafnodes = leafnodes;
	}

	public String getPatterns() {
		return patterns;
	}

	public void setPatterns(String patterns) {
		this.patterns = patterns;
	}

	public NonLeaf getRoot() {
		return root;
	}

	public void setRoot(NonLeaf root) {
		this.root = root;
	}

	public Tree(String patterns, NonLeaf root) {
		super();
		this.patterns = patterns;
		this.root = root;
	}
	
	public Leaf insert(P_Event e)
	{
		int i;
		for(i=0;i<leafnodes.size();i++)
		{
			if(leafnodes.get(i).gettype()==e.gettype())
				break;
		}
		if(i!=leafnodes.size())
		{
			/*if(e.gettype()=='B'){
				return leafnodes.get(i);
			}else{*/
				leafnodes.get(i).insert(e);
				return leafnodes.get(i);
			//}	
		}else return null;
		
	}

	public LinkedList<Node> getNodes() {
		return nodes;
	}

	public void setNodes() {
		nodes.addLast(root);		
		for(int i=0;i<nodes.size();i++)
		{
			if(!nodes.get(i).getisleaf()){
			NonLeaf n=(NonLeaf)nodes.get(i);
			if(n.getrchild()!=null && !nodes.contains(n.getrchild()))
				nodes.addLast(n.getrchild());
			if(n.getlchild()!=null && !nodes.contains(n.getlchild()))
				nodes.addLast(n.getlchild());		
			}
		}
	}
}