package BoxTools;
/** A:destination; B: source
*    Modified on Nov 01, 2004 to eliminate the use of DataIndex so that allocation
*			cost can be saved.		
**/

template<class T>  public class Copier{
	private final static int SPACE_DIM=Util.SPACE_DIM;
	private final static int SORT_DIM=Util.SORT_DIM;
	private BoxLayout local  single m_layoutA, m_layoutB;
	private int m_procID=Ti.thisProc();
	private int m_numOfProcs=Ti.numProcs();
	private int m_numOfBoxesA;
	private boolean m_defined;

	LayoutIterator local m_layoutItrA, m_layoutItrB;
	boolean m_IsLayoutABSame;
	//DataIndex local [] local [] local m_ABRelation;
	int [] local [] local m_ABRelation;

	T local boxedDataA_l, boxedDataB_l;
 	T boxedDataB;
	RectDomain<SPACE_DIM> boxA,boxB;
	//DataIndex local DI;
	
	
	public Copier(BoxLayout local single a_layoutA, BoxLayout local single a_layoutB){
		PrivateRegion local region =new PrivateRegion();
		//DataIndex local [] local buffer;
		int  [] local buffer;
		m_layoutA=a_layoutA;m_layoutB=a_layoutB;
		if (!m_layoutA.m_disjointed || !m_layoutB.m_disjointed){
		 Util.printErrMsg("Copier::Copier(): at least one of the BoxLayouts is not disjointed!");
		 m_defined=false;
		 return;
		}
		m_layoutItrA=new LayoutIterator(m_layoutA);
		m_layoutItrB=new LayoutIterator(m_layoutB);
		m_numOfBoxesA=m_layoutA.numBoxesAt(m_procID);
		m_IsLayoutABSame=(m_layoutA==m_layoutB);
		m_defined=true;
		
		if (!m_IsLayoutABSame){	
	 		m_ABRelation=new int  [m_numOfBoxesA] local [] local;
			buffer=new(region) int  [m_layoutB.size()] local;
			boolean sorted=m_layoutB.m_sorted;
			int i,j,k;
			int gIdx, lIdx;
			for (i=0;i<m_numOfBoxesA;i++){
				boxA=m_layoutItrA.access();
				j=0;m_layoutItrB.Reset();gIdx=0;
				while (!m_layoutItrB.IsEnded()){
					boxB=m_layoutItrB.Access();
					if ((boxA.upb())[SORT_DIM]<(boxB.lwb())[SORT_DIM] && sorted && m_numOfProcs==1) break;
					if (Util.isJointed(boxA,boxB)){
						//buffer[j]=m_layoutItrB.GetDataIndex();
						buffer[j]=gIdx;
						j++;
					}
					m_layoutItrB.Advance();gIdx++;
				}
				m_ABRelation[i]=new int [j];
				for (k=0;k<j;k++) m_ABRelation[i][k]=buffer[k];
				m_layoutItrA.advance();
			}
		}
		try{
			region.delete();
		}
		catch (RegionInUse oops){
			Util.printErrMsg("Copier::Copier(): failed to delete PrivateRegion region!");
		}
	}

	public final local single void copy(template BoxLayoutData<T > local single a_BLDA, template BoxLayoutData<T > local single a_BLDB){
		if ((boolean single)(m_layoutA!=a_BLDA.boxLayout() || m_layoutB!=a_BLDB.boxLayout() || !m_defined))
			Util.printErrMsg("Copier::copy(): invalid BoxLayoutData or Copier");
		else{
			Ti.barrier();
			m_layoutItrA.reset();
			int i,j,k;
			int gIdxB,lIdxB,procIDB;

			//boolean IsLayoutABSame=(m_layoutA==m_layoutB);
			for (i=0;i<m_numOfBoxesA;i++){
				boxA=m_layoutItrA.access();	
				boxedDataA_l=(T local)a_BLDA.TA[m_procID][i];
				//if (a_ghostIncluded) boxA=boxedDataA.domain();
				if (m_IsLayoutABSame){
					boxedDataB_l=(T local)a_BLDB.TA[m_procID][i];
					boxedDataA_l.localCopy(boxedDataB_l, boxA);
				}
				else{
					k=m_ABRelation[i].length;
					for(j=0;j<k;j++){
						//DI=m_ABRelation[i][j];
						gIdxB=m_ABRelation[i][j];
						lIdxB=m_layoutB.m_localIndexes[gIdxB];
						procIDB=m_layoutB.m_procAssignments[gIdxB];
						//boxB=m_layoutB[DI];
						boxB=m_layoutB.m_boxes[gIdxB];
						if (procIDB==m_procID){
							//boxedDataB_l=a_BLDB[DI];
							boxedDataB_l=(T local)a_BLDB.TA[procIDB][lIdxB];
							//if (a_ghostIncluded) boxB=boxedDataB_l.domain();
							boxedDataA_l.localCopy(boxedDataB_l,boxB,boxA);
						}
						else{
							//boxedDataB=a_BLDB.getBoxedData(DI);
							boxedDataB=a_BLDB.TA[procIDB][lIdxB];
							//if (a_ghostIncluded) boxB=boxedDataB.domain();
							boxedDataA_l.copy(boxedDataB,boxB,boxA);
						}
					}
				}
				m_layoutItrA.advance();
			}   
			Ti.barrier();
		}
	}
}