package fdl.test.debug;

import java.nio.ByteBuffer;

public class TreeProperty {
	public boolean  rightFlag = true, leftFlag = true;
	public int treeCounter = 0, treeLoopNum = 100;
	public long startTime, endTime;
	public NodeProperty np;
	
	public TreeProperty(NodeProperty np) {
		this.np = np;
	}
	
	public void startTree(ByteBuffer reply) {
		Routing r;
		// 子があるならば、子にタプルを伝搬
		if (np.nodes.containsKey(TupleId.TREERIGHT)) {
			r = np.nodes.get(TupleId.TREERIGHT);
			r.linda.out(r.dstId, reply);
			rightFlag = false;
		}
		if (np.nodes.containsKey(TupleId.TREELEFT)) {
			r = np.nodes.get(TupleId.TREELEFT);
			r.linda.out(r.dstId, reply);
			leftFlag = false;
		}
	}
}