trees.java

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

package test;
import java.util.*;

public class Trees {
	public static LinkedList<Tree> roots=new LinkedList<Tree>();
	public static void contruct61()
	{
		Leaf a1=new Leaf('A');  a1.setmode(1);
		Leaf b1=new Leaf('B');  b1.setmode(0);
		Leaf c1=new Leaf('C');  c1.setmode(0);
		Leaf d1=new Leaf('D');  d1.setmode(0);
		Leaf e1=new Leaf('E');  e1.setmode(0);
		Leaf f1=new Leaf('F');  f1.setmode(0);
		Sequence s11=new Sequence();  s11.setmode(1);
		Sequence s12=new Sequence();  s12.setmode(1);
		Sequence s13=new Sequence();  s13.setmode(1);
		Sequence s14=new Sequence();  s14.setmode(1);
		Sequence s15=new Sequence();  
		s11.setlchild(a1);
		s11.setrchild(b1);
		s12.setlchild(s11);
		s12.setrchild(c1);
		s13.setlchild(s12);
		s13.setrchild(d1);
		s14.setlchild(s13);
		s14.setrchild(e1);
		s15.setlchild(s14);
		s15.setrchild(f1);
		a1.addparent(s11);
		b1.addparent(s11);
		c1.addparent(s12);
		d1.addparent(s13);
		e1.addparent(s14);
		f1.addparent(s15);
		s11.addparent(s12);
		s12.addparent(s13);
		s13.addparent(s14);
		s14.addparent(s15);
		Tree tree1=new Tree("A;B;C;D;E;F",s15);
		tree1.setNodes();
		System.out.println(tree1.getNodes().size());
		tree1.getLeafnodes().addLast(a1);
		tree1.getLeafnodes().addLast(b1);
		tree1.getLeafnodes().addLast(c1);
		tree1.getLeafnodes().addLast(d1);
		tree1.getLeafnodes().addLast(e1);
		tree1.getLeafnodes().addLast(f1);
		roots.addLast(tree1);
	}
	public static void contruct62()
	{	
		Leaf a2=new Leaf('A');  a2.setmode(1);
		Leaf b2=new Leaf('B');  b2.setmode(0);
		Leaf c2=new Leaf('C');  c2.setmode(0);
		Leaf e2=new Leaf('E');  e2.setmode(0);
		Leaf f2=new Leaf('F');  f2.setmode(0);
		Leaf d2=new Leaf('D');  d2.setmode(0);
		Sequence s21=new Sequence();  s21.setmode(1);
		Sequence s22=new Sequence();  s22.setmode(1);
		Between s23=new Between();  
		Sequence s24=new Sequence();  s24.setmode(1);
		Sequence s25=new Sequence();  s25.setmode(0);
		s21.setlchild(a2);
		s21.setrchild(b2);
		s22.setlchild(s21);
		s22.setrchild(c2);		
		s24.setlchild(s22);
		s24.setrchild(e2);
		s25.setlchild(s24);
		s25.setrchild(f2);
		s23.setlchild(s25);
		s23.setrchild(d2);
		a2.addparent(s21);
		b2.addparent(s21);
		c2.addparent(s22);
		d2.addparent(s23);
		e2.addparent(s24);
		f2.addparent(s25);
		s21.addparent(s22);
		s22.addparent(s24);
		s24.addparent(s25);
		s25.addparent(s23);
		Tree tree2=new Tree("A;B;C;E;F^D",s23);
		tree2.setNodes();
		System.out.println(tree2.getNodes().size());
		tree2.getLeafnodes().addLast(a2);
		tree2.getLeafnodes().addLast(b2);
		tree2.getLeafnodes().addLast(c2);
		tree2.getLeafnodes().addLast(d2);
		tree2.getLeafnodes().addLast(e2);
		tree2.getLeafnodes().addLast(f2);
		roots.addLast(tree2);
				
	}

}