trees.java

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

package test2;
import java.util.*;

public class Trees {
	public static LinkedList<Tree> roots=new LinkedList<Tree>();
	public static void contruct7()
	{
		Leaf a1=new Leaf('A'); a1.setmode(1);
		Leaf b1=new Leaf('B'); b1.setmode(0);
		Leaf c1=new Leaf('C'); c1.setmode(0);
		Sequence s11=new Sequence(); s11.setmode(1);
		Sequence s12=new Sequence(); 
		s11.setlchild(a1);
		s11.setrchild(b1);
		s12.setlchild(s11);
		s12.setrchild(c1);
		a1.addparent(s11);
		b1.addparent(s11);
		c1.addparent(s12);
		s11.addparent(s12);
		Tree tree1=new Tree("(A;B);C",s12);
		tree1.setNodes();
		tree1.getLeafnodes().addLast(a1);
		tree1.getLeafnodes().addLast(b1);
		tree1.getLeafnodes().addLast(c1);
		roots.addLast(tree1);
		
	}
	
	public static void recontruct()
	{
		Leaf a1=new Leaf('A'); a1.setmode(1);
		Leaf b1=new Leaf('B'); b1.setmode(0);
		Leaf c1=new Leaf('C'); c1.setmode(0);
		Sequence s11=new Sequence(); s11.setmode(1);
		Sequence s12=new Sequence(); 
		s11.setlchild(a1);
		s11.setrchild(b1);
		s12.setlchild(s11);
		s12.setrchild(c1);
		a1.addparent(s11);
		b1.addparent(s11);
		c1.addparent(s12);
		s11.addparent(s12);
		Tree tree1=new Tree("(A;B);C",s12);
		tree1.setNodes();
		tree1.getLeafnodes().addLast(a1);
		tree1.getLeafnodes().addLast(b1);
		tree1.getLeafnodes().addLast(c1);
		roots.addLast(tree1);
		
	}

}