visit.java

本人历尽千辛万苦找的clustream中的jar包

package org.osu.ogsa.stream.util;

import java.util.*;
import java.io.*;
import java.net.URL;
import java.net.URI;
import javax.swing.tree.DefaultMutableTreeNode;
import org.apache.commons.logging.Log;
import org.apache.commons.logging.LogFactory;

public class Visit {
	public int no;
	public String strStages;
	public int numStages;
	public int myStage1;
	public int myStage2;
	//int globalNumStages;
	public int [] visitnodeIndex = new int[50];
	public int [] placementIndex = new int[50];
	public String [] strPlacements = new String[50];
	public String [] strConnections = new String[50];
	public DefaultMutableTreeNode treenode;

        static Log log = LogFactory.getLog(Visit.class.getName());
	public Visit(DefaultMutableTreeNode tn, int no, int myStage1, int myStage2)//, int globalNumStages)
	{
		this.treenode = tn;
		this.no = no;
		this.myStage1 = myStage1;
		this.myStage2 = myStage2;
//		this.globalNumStages = globalNumStages;

		numStages = myStage2 - myStage1 + 1;
		strStages = "";
		for(int i = myStage2; i >= myStage1; i --)
			strStages += i;
		for(int i = 0; i < numStages; i ++)
			visitnodeIndex[i] = no;
	}
	
	public boolean Match(Visit v)
	{
		int index, i, j;
		log.debug(strStages);
		log.debug(v.strStages);
		if(strStages.equals(v.strStages) && treenode.equals(v.treenode))
		{
			for(i = 0; i < numStages; i ++)
			{
				visitnodeIndex[i] = v.no;
//				placementIndex[i] = i;
//				strPlacements[i] = v.strPlacements[i];
//				strConnections[i] = v.strConnections[i];
				log.debug("visitnodeIndex:"+i+ " v.no:" +  v.no); 
			}
			log.debug("match!!!"+ v.no); 
			return true;
		}
		else if(strStages.length() > v.strStages.length())
		//it is impossible that the two strings are not equal and the lengths are same
		{
			index = strStages.indexOf(v.strStages);
			if(index == 0)
			{
				j = strStages.length() - 1 ;
				for(i = v.strStages.length() - 1; i >= 0; i --, j--)
				{
//					visitnodeIndex[i] = v.no;
					visitnodeIndex[j] = v.visitnodeIndex[i];
					log.debug("visitnodeIndex:"+j+ ": v.visitnodeIndex:" +  i); 
//					placementIndex[i] = i;
				}
/*				for(i = v.strStages.length(); i < numStages; i ++)
				{
					visitnodeIndex[i] = no;
//					placementIndex[i] = i;
				} */
				log.debug("match!!!"+ v.no); 
				return true;

			}
		}
		else if(strStages.length() <  v.strStages.length())
		{
			index = v.strStages.indexOf(strStages);
			if(index == 0)
			{
				i = v.strStages.length() -1;
				for(j = strStages.length() - 1; j >= 0 ; j --, i--)
					visitnodeIndex[j] = v.visitnodeIndex[i];
				return true;
			}
		}
		/*else if(strStages.length() ==  v.strStages.length() 
				&&
			strStages.length() == 1
				&&
			myStage1 > globalNumStages
				&&
			v.myStage1 > globalNumStages)
		{
			visitnodeIndex[0] = v.no;
			return true;
		}*/
		return false;
	}
}