trees.java

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

package test;
import java.util.*;

public class Trees {
	public static LinkedList<Tree> roots=new LinkedList<Tree>();
	public static void contruct1()
	{
		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);
		
		Leaf a2=new Leaf('A'); a2.setmode(1);
		Leaf b2=new Leaf('B'); b2.setmode(1);
		Leaf c2=new Leaf('C'); c2.setmode(0);
		Sequence s21=new Sequence();
		Sequence s22=new Sequence(); s22.setmode(0);
		s22.setlchild(b2);
		s22.setrchild(c2);
		s21.setlchild(a2);
		s21.setrchild(s22);
		a2.addparent(s21);
		b2.addparent(s22);
		c2.addparent(s22);
		s22.addparent(s21);		
		Tree tree2=new Tree("A;(B;C)",s21);
		tree2.setNodes();
		tree2.getLeafnodes().addLast(a2);
		tree2.getLeafnodes().addLast(b2);
		tree2.getLeafnodes().addLast(c2);
		roots.addLast(tree2);
		
		
	}

}