package BoxTools;
// Note that if ghostsize=0, then no exchange.
/**	A <code>BoxLayoutData</code> object contains a set of distributed box-oriented objects. For most
*	of cases, it can be considered as a wrapper of the Ti array:
*			 <code>T  [1d] local single [1d] [SPACE_DIM d] local</code>,
*	or
*			 <code>T  [1d] local  [1d] local [SPACE_DIM d] local</code>.
*	In this implementation, a wrapper such as <code>BoxedArray<double></code> is used to further wrap 
*	the box-oriented Ti array, for example:
*			 <code>double [SPACE_DIM d] local</code>.
* 	Hereafter, <code>T </code> represents a general box-oriented data type. 
*	Here, TA is a two dimensional array of some box-oriented data type, where  
*	<code>TA[procID][localBoxID]</code> gives the  <code>localBoxID+1 </code>th box-oriented object
*	on processor/processes <code>procID<\code>. A <code>BoxLayoutData</code> object is defined on a 
*	<code>BoxLayout</code> object along with the sizes of ghostcells in each direction. A 
*	<code>BoxLayoutData</code> object can be null constructed first and defined later. Since Titanium 
*	currently does not support inheritance from a template class, it is impossible to implement the
*	hierarchy of 
*	@see <a href="http://davis.lbl.gov/NASA/chombomanual/classLayoutData.html">LayoutData</a>,
*	@see <a href="http://davis.lbl.gov/NASA/chombomanual/classBoxLayoutData.html">BoxLayoutData</a>, and
*	@see <a href="http://davis.lbl.gov/NASA/chombomanual/classLevelData.html">LevelData</a> as defined in
*	@see <a href="http://davis.lbl.gov/NASA/chombomanual/index.html">Chombo</a>. So currently, we have to
*	combine these three classes into one class. Note that the methods <code>exchange</code> and
*	<code>copy</code> can be used only when the underlying boxes are disjointed.
*	<p> Usage: a <code> BoxLayoutData </code> object must be declared local. 
*	@see BoxLayout,BoxedArray, DataIterator, LayoutIterator, LayoutIndex, DataIndex
*	@see <a href="http://davis.lbl.gov/NASA/chombomanual/classLayoutData.html">Chombo Specification</a>
*	@version 2.0
*		Modified on May 24, 2004. Ghost regions for exchange are cached.
*			 on Jun 21, 2004. the restriction of global pointers are cached (See BoxedArray).
*			 on Jul 09, 2004. change of syntax of foreach, see foreachLoopTest.ti.
*			 on Aug 09, 2004. add m_layoutItr.
*			 on Aug 26, 2004. the operator <<=constant covers ghost cells so as to save exchange.
*	@author Tong Wen, LBNL
*	@since 1.0
*/  

template<class T>  public class BoxLayoutData{
	private final static int SPACE_DIM=Util.SPACE_DIM;
	private final static int SORT_DIM=Util.SORT_DIM;
	private BoxLayout local  single m_layout;
	private int single m_numOfProcs=Ti.numProcs();
	private int m_procID=Ti.thisProc();
	/**The box oriented data of type <code>T</code> in <code>TA<\code> can reside on any processor/process. */
	protected  T  [1d] local [1d] local   TA;
	/**The array stores local <code>T</code>s. Each <code>BoxLayoutData<code> is only responsible
	 * for constructing local <code>T</code>s. Then the pointers to local data are exchanged.
	 */
	//private T  local [1d] local  m_data;
	private boolean single m_constructed=false;
	private int m_numOfBoxes;
	private boolean single m_disjointed=false;
	private boolean single m_sorted=false;	
	private int single m_ghostSize;
	private LayoutIterator local m_layoutItr;

	protected int [] local [] local m_neighbors;
	//protected RectDomain<SPACE_DIM> [] local [] local m_ExchangeGhostRegion;// Jun 21, 2004 Exchange Version 2.
	

	boolean m_regionUsed=false;
	PrivateRegion local m_region;
	
	Timer TM=new Timer();
	Timer TMCopy=new Timer();
	Timer TMCopyL=new Timer();

	public  inline BoxLayoutData(){
		TA=new T [0:m_numOfProcs-1] [1d] local;
	}
	/**Jun 21, 2004 Exchange Version 2.
	private final local void fillExchangeGhostRegion(){
		if (m_ghostSize>1)
			m_neighbors=m_layout.findNeighbors(m_ghostSize);
		else{ 
			if (!m_layout.m_neighborsFound) m_layout.findNeighbors();
			m_neighbors=m_layout.m_neighbors;
		}
		m_ExchangeGhostRegion=new RectDomain<SPACE_DIM> [m_numOfBoxes] local [] local;
		int i,j,size,gIdx;
		RectDomain<SPACE_DIM> box;
		for (i=0;i<m_numOfBoxes;i++){
			gIdx=m_layout.m_boxAssignments[m_procID][i];
			size=m_neighbors[gIdx].length;
			m_ExchangeGhostRegion[i]=new RectDomain<SPACE_DIM> [size] local;
			box=TA[m_procID][i].domain();
			for (j=0;j<size;j++){
				m_ExchangeGhostRegion[i][j]=box*m_layout.m_boxes[m_neighbors[gIdx][j]];
			}			
		}
		return;
	}
	*/
	/**Exchange version 3*/
	private final single local void cacheExchangeInfo(){
		if (m_ghostSize>1)
			m_neighbors=m_layout.findNeighbors(m_ghostSize);
		else{ 
			if (!m_layout.m_neighborsFound) m_layout.findNeighbors();
			m_neighbors=m_layout.m_neighbors;
		}
		
		int i,j,size,gIdxA, gIdxB, lIdxB, procIDB;
		RectDomain<SPACE_DIM> boxA, boxB;
		T local boxedDataA;

 		boolean [] local procsInUse=new boolean [m_numOfProcs];
		int l,m, procs;

		for (i=0;i<m_numOfBoxes;i++){
			gIdxA=m_layout.m_boxAssignments[m_procID][i];
			size=m_neighbors[gIdxA].length;
			boxedDataA=(T local)TA[m_procID][i];
			boxA=boxedDataA.domain();
			boxedDataA.buildNeighborInfoCache(size);
			for (j=0;j<size;j++){
				gIdxB=m_neighbors[gIdxA][j];
				boxB=boxA*m_layout.m_boxes[gIdxB];
				procIDB=m_layout.m_procAssignments[gIdxB];
				lIdxB=m_layout.m_localIndexes[gIdxB];
				
				if (m_procID==procIDB)
				  boxedDataA.fillNeighborInfoCache(TA[procIDB][lIdxB], boxB, j, true);
				else
				  boxedDataA.fillNeighborInfoCache(TA[procIDB][lIdxB], boxB, j, false);
				procsInUse[procIDB]=true;
			}

			for(l=0,m=0;l<m_numOfProcs;l++) if (procsInUse[l]) {m++;procsInUse[l]=false;}
			if (m>procs) procs=m;
						
		}
		
		//Util.printMsg("Exchange: max num of procs for exchange "+Reduce.max(procs));
		return;
	}

	public final local single  void define( BoxLayout local  single a_layout, int single a_ghostSize){
		if (m_constructed) {
			Util.printErrMsg("BoxLayoutData::define( ): this BoxLayoutData has already been defined!");
			return;
		    }
		else{
			m_ghostSize=(int single)Math.abs(a_ghostSize);
			int i;
			m_layout=a_layout;
			m_numOfBoxes=m_layout.numBoxesAt(m_procID);
			for (i=0;i<m_numOfProcs;i++) TA[i]=new T [0:m_layout.numBoxesAt(i)-1];
			//LayoutIterator local lit=new LayoutIterator(m_layout);
			m_layoutItr=new LayoutIterator(m_layout);//Aug 09, 2004
			LayoutIterator local lit=m_layoutItr; 
			i=0;
			RectDomain<SPACE_DIM>   box;
			Point<SPACE_DIM> stride;
			if (!lit.isEnded()) stride=lit.access().stride();
			lit.reset();
			//Timer TM=new Timer();TM.start();
			
			if (m_ghostSize==0)
				while (!lit.isEnded()){
					box=lit.access();
					if (m_regionUsed)
						TA[m_procID][i] = new T(box,m_region);
					else
						TA[m_procID][i] = new T(box);
					lit.advance();i++;
				}
			else{
				while (!lit.isEnded()){
					box=lit.access();
					if (m_regionUsed)
						TA[m_procID][i] = new T(box.accrete(m_ghostSize,stride), m_region);
					else
						TA[m_procID][i] = new T(box.accrete(m_ghostSize,stride));
					lit.advance();i++;
				}
				// fillExchangeGhostRegion();// June 21, 2004 Exchange Version 2.
			}
			//Ti.barrier(); redundant?
			//TM.stop(); System.out.println("Time to construct local data with "+ghostSize+" ghost size: "+TM.millis());
			//TA.exchange(m_data);
			int single j,k;
			for (k=0;k<m_numOfProcs;k++)
				for (j=0;j<(int single)m_layout.numBoxesAt(k);j++)
					TA[k][j]=broadcast TA[k][j] from k;
			//m_data=(T  local [1d] local)TA[m_procID];
			if (m_ghostSize>0) {
				cacheExchangeInfo();// Exchange Version 3
			}
			m_constructed=true;
			m_disjointed=a_layout.isDisjointed();
			m_sorted=a_layout.isSorted();
			return;
		}
	}
	public  BoxLayoutData(BoxLayout local  single a_layout,int single a_ghostSize, boolean single a_useRegion){
		this();
		m_regionUsed=a_useRegion;
		if (m_regionUsed) m_region=new PrivateRegion();
		//TA=new(m_region) T [0:m_numOfProcs-1] [1d] local;
		define(a_layout,a_ghostSize);	
	}
	public  BoxLayoutData(BoxLayout local  single a_layout,int single a_ghostSize){
		this();
		define(a_layout,a_ghostSize);	
	}
	
	
	public final inline local  BoxLayout local single boxLayout(){
		if (m_constructed)
			return m_layout;
		else
			return null;
	}
	public final inline local LayoutIterator local layoutIterator(){
		m_layoutItr.reset();m_layoutItr.Reset();return m_layoutItr;
	}
	public final inline local boolean single isDisjointed(){return m_disjointed;}
	public final inline local boolean single isConstructed(){return m_constructed;}
	public final inline local  RectDomain<SPACE_DIM>  getBox(DataIndex local a_DI){
		if (m_constructed)
			return m_layout.getBox(a_DI);
		else
			return Util.NULL_BOX;
	}
	public final inline local T local op[](DataIndex local a_DI){
		if (m_constructed)
			if ((m_procID==a_DI.m_procID) && (m_layout.getRoot()==a_DI.m_root))
				return (T local)TA[m_procID][a_DI.m_dataIndex];
			else{
				Util.printErrMsg("BoxLayoutData::op[]: invalid DataIndex!");	
				return null;
			} 
		else
			return null;
	}
	/**operations on <code>BoxLayoutData</code> are local and only applied on valid data (no data on ghost region).
	 * Therefore, we do not put "single" here. For each operation defined here, it is required that there is a 
	 * corresponding one of class <code>T</code>.
	 */ 
	public final local template BoxLayoutData<T >  local single op+=(template BoxLayoutData<T >  local single a_BLD){
		if (m_constructed && a_BLD.isConstructed())
			if (m_layout==a_BLD.boxLayout()){
				T local BoxedData1, BoxedData2;
				for (int i=0;i<TA[m_procID].domain().size();i++){
					BoxedData1=(T local)TA[m_procID][i];
					BoxedData2=(T local)a_BLD.TA[m_procID][i];
					BoxedData1.op+=(BoxedData2);
				}
			}
			else
				Util.printErrMsg("BoxLayoutData::op+=(.): the layouts must be the same!");	

		else
			Util.printErrMsg("BoxLayoutData::op+=(.): unconstructed BoxLayoutData!");

		return this;
	}

	public final local template BoxLayoutData<T >  local single op-=(template BoxLayoutData<T >  local single a_BLD){
		if (m_constructed && a_BLD.isConstructed())
			if (m_layout==a_BLD.boxLayout()){
				T local BoxedData1, BoxedData2;
				for (int i=0;i<TA[m_procID].domain().size();i++){
					BoxedData1=(T local)TA[m_procID][i];
					BoxedData2=(T local)a_BLD.TA[m_procID][i];
					BoxedData1.op-=(BoxedData2);
				}
			}
			else
				Util.printErrMsg("BoxLayoutData::op-=(.): the layouts must be the same!");	

		else
			Util.printErrMsg("BoxLayoutData::op-=(.): unconstructed BoxLayoutData!");
	
		return this;
	}

	public final local template BoxLayoutData<T >  local single op*=(double single a_db){
		if (m_constructed){
			T local BoxedData;
			for (int i=0;i<TA[m_procID].domain().size();i++){
				BoxedData=(T local)TA[m_procID][i];
				BoxedData.op*=(a_db);
			}
		    }		
		else
			Util.printErrMsg("BoxLayoutData::op*=(.): unconstructed BoxLayoutData!");
		return this;
	}
	public final local template BoxLayoutData<T >  local single op<<=(double single a_db){
		if (m_constructed){
			T local BoxedData;
			for (int i=0;i<TA[m_procID].domain().size();i++){
				BoxedData=(T local)TA[m_procID][i];
				BoxedData<<=a_db;
				//if (a_ghostIncluded) 
				//	BoxedData<<=a_db;
				//else
				//	BoxedData.setByDouble(a_db,m_layout.m_boxes[m_layout.m_boxAssignments[m_procID][i]]);
			}
		    }		
		else
			Util.printErrMsg("BoxLayoutData::op<<=(.): unconstructed BoxLayoutData!");
		return this;
	}

	public final local template BoxLayoutData<T >  local single op<<=(template BoxLayoutData<T >  local single a_BLD){
		if (m_constructed && a_BLD.isConstructed())
			if (m_layout==a_BLD.boxLayout()){
				T local BoxedData1, BoxedData2;
				for (int i=0;i<TA[m_procID].domain().size();i++){
					BoxedData1=(T local)TA[m_procID][i];
					BoxedData2=(T local)a_BLD.TA[m_procID][i];
					//if (a_ghostIncluded) 
					//	BoxedData1<<=BoxedData2;
					//else
						BoxedData1.localCopy(BoxedData2,m_layout.m_boxes[m_layout.m_boxAssignments[m_procID][i]]);
				}
			}
			else
				Util.printErrMsg("BoxLayoutData::op<<=(.,.): the layouts must be the same!");	

		else
			Util.printErrMsg("BoxLayoutData::op<<=(.,.): unconstructed BoxLayoutData!");
		return this;
	}

	public final local void setBySum(template BoxLayoutData<T >  local single a_BLD1, template BoxLayoutData<T >  local single a_BLD2){
		if (m_constructed && a_BLD1.isConstructed() && a_BLD2.isConstructed())
			if ((m_layout==a_BLD1.boxLayout()) && (m_layout==a_BLD2.boxLayout())){
				T local BoxedData1, BoxedData2, BoxedData3;
				for (int i=0;i<TA[m_procID].domain().size();i++){
					BoxedData1=(T local)TA[m_procID][i];
					BoxedData2=(T local)a_BLD1.TA[m_procID][i];
					BoxedData3=(T local)a_BLD2.TA[m_procID][i];
					BoxedData1.setBySum(BoxedData2, BoxedData3);
				}
			}
			else
				Util.printErrMsg("BoxLayoutData::op+=(.,.): the layouts must be the same!");	
		else
			Util.printErrMsg("BoxLayoutData::op+=(.,.): unconstructed BoxLayoutData!");
	}

	public final local void setByRemainder(template BoxLayoutData<T >  local single a_BLD1, template BoxLayoutData<T >  local single a_BLD2){
		if (m_constructed && a_BLD1.isConstructed() && a_BLD2.isConstructed())
			if ((m_layout==a_BLD1.boxLayout()) && (m_layout==a_BLD2.boxLayout())){
				T local BoxedData1, BoxedData2, BoxedData3;
				for (int i=0;i<TA[m_procID].domain().size();i++){
					BoxedData1=(T local)TA[m_procID][i];
					BoxedData2=(T local)a_BLD1.TA[m_procID][i];
					BoxedData3=(T local)a_BLD2.TA[m_procID][i];
					BoxedData1.setByRemainder(BoxedData2, BoxedData3);
				}
			}
			else
				Util.printErrMsg("BoxLayoutData::setByRemainder(.,.): the layouts must be the same!");	
		else
			Util.printErrMsg("BoxLayoutData::setByRemainder(.,.): unconstructed BoxLayoutData!");
	}

	public final inline local T getBoxedData(DataIndex local a_DI){
		if (m_constructed)
			if  (m_layout.getRoot()==a_DI.m_root)
				return TA[a_DI.m_procID][a_DI.m_dataIndex];
			else{
				Util.printErrMsg("LayoutData::getBoxedData( ): invalid DataIndex!");	
				return null;
			} 
		else
			return null;
	}
	/**@see <a href="http://davis.lbl.gov/NASA/chombomanual/classLevelData.html">LevelData</a>*/
	/*
	public final local single void exchange(){
		if (m_constructed)
			if (m_disjointed){
				LayoutIterator local LIT=new LayoutIterator(m_layout);
				LayoutIterator local LIT=m_layoutItr;//Aug 09, 2004
				RectDomain<SPACE_DIM> boxA,boxB;
				T local boxedDataA;
				T boxedDataB;
				DataIndex local DI;
				LIT.reset();
				for (int i=0;i<m_numOfBoxes;i++){
					boxA=LIT.access();
					LIT.Reset();
					boxedDataA=(T local)TA[m_procID][i];
					while (!LIT.IsEnded()){
						boxB=LIT.Access();
						if ((boxA!=boxB) && Util.isJointed(boxedDataA.domain(),boxB)){
							DI=LIT.GetDataIndex();
							boxedDataB=TA[DI.m_procID][DI.m_dataIndex];
							boxedDataA.copy(boxedDataB, boxB, boxedDataA.domain());
						}
						LIT.Advance();
					}
					LIT.advance();
				}	
			}
			else{
				Util.printErrMsg("BoxLayoutData::exchange(): the underlying layout must be disjointed!");	
			}
	}
	*/
	/*public final local single void exchange(){
		if (m_constructed)
			if (m_disjointed){
				//TM.reset();TM.start();
				if (m_layout.m_neighbors==null) m_layout.findNeighbors(1);
				//TM.stop();System.out.println("Time to find neighbors (mills):"+TM.millis());
				//LayoutIterator local LIT=new LayoutIterator(m_layout);
				LayoutIterator local LIT=m_layoutItr;//Aug 09, 2004
				RectDomain<SPACE_DIM> boxA,boxB;
				RectDomain<SPACE_DIM> [] local neighbors;
				T local boxedDataA;
				T boxedDataB;
				DataIndex local DI;
				DataIndex local [] local neighborIdxes;
				int i,j;
				LIT.reset();
				for (i=0;i<m_numOfBoxes;i++){
					boxA=LIT.access(); DI=LIT.getDataIndex();
					neighborIdxes=m_layout.getNeighborIdxes(DI);
					neighbors=m_layout.getNeighbors(DI);
					boxedDataA=(T local)TA[m_procID][i];
					for (j=0;j<neighborIdxes.length;j++){
						boxedDataB=TA[neighborIdxes[j].m_procID][neighborIdxes[j].m_dataIndex];
						boxB=neighbors[j]*boxedDataA.domain();
						//boxedDataA.copy(boxedDataB, neighbors[j], boxedDataA.domain());
						boxedDataA.copy(boxedDataB, boxB, boxB);
					}
					LIT.advance();
				}	
			}
			else{
				Util.printErrMsg("BoxLayoutData::exchange(): the underlying layout must be disjointed!");	
			}
	}*/
	/** Exchange Version 1.
	public final local single void exchange(){
		TM.start();
		Ti.barrier();
		if (m_constructed && m_ghostSize!=0)
			if (m_disjointed){
				//LayoutIterator local LIT=new LayoutIterator(m_layout);
				LayoutIterator local LIT=m_layoutItr;//Aug 09, 2004
				RectDomain<SPACE_DIM> [] local neighbors;
				T local boxedDataA; 
				T boxedDataB;T local boxedDataB_l;
				DataIndex local DI;
				DataIndex local [] local neighborIdxes;
				int i,j;
				LIT.reset();
				for (i=0;i<m_numOfBoxes;i++){
					DI=LIT.getDataIndex();
					neighborIdxes=m_layout.getNeighborIdxes(DI);
					neighbors=m_layout.getNeighbors(DI);
					boxedDataA=(T local)TA[m_procID][i];
					for (j=0;j<neighborIdxes.length;j++){
						if (neighborIdxes[j].m_procID==m_procID){
							boxedDataB_l=(T local)TA[m_procID][neighborIdxes[j].m_dataIndex];
							boxedDataA.localCopy(boxedDataB_l,neighbors[j]);
						}
						else{			
							boxedDataB=TA[neighborIdxes[j].m_procID][neighborIdxes[j].m_dataIndex];
							boxedDataA.copy(boxedDataB, neighbors[j]);
						}
						
					}
					LIT.advance();
				}	
			}
			else{
				Util.printErrMsg("BoxLayoutData::exchange(): the underlying layout must be disjointed!");	
			}
		Ti.barrier();TM.stop();Util.countCopy+=TM.millis();TM.reset();
	}
	*/
	/**On May 24, 2004. The ghost Region is cached.	Exchange Version 2		
	public final local single void exchange(){
		TM.reset();TMCopy.reset();TMCopyL.reset();
		TM.start();
		Ti.barrier();
		if (m_constructed && m_ghostSize!=0)
			if (m_disjointed){
				T local boxedDataA; 
				T boxedDataB;T local boxedDataB_l;
				int i,j,gIdxA,gIdxB,procIDB;
				for (i=0;i<m_numOfBoxes;i++){
					
					gIdxA=m_layout.m_boxAssignments[m_procID][i];
					boxedDataA=(T local)TA[m_procID][i];
					
					for (j=0;j<m_neighbors[gIdxA].length;j++){
						
						gIdxB=m_neighbors[gIdxA][j];
						procIDB=m_layout.m_procAssignments[gIdxB];
						
						if (procIDB==m_procID){
							boxedDataB_l=(T local)TA[procIDB][m_layout.m_localIndexes[gIdxB]];
							TMCopyL.start();boxedDataA.localCopy(boxedDataB_l,m_ExchangeGhostRegion[i][j]);TMCopyL.stop();
							Util.countNum++;
						}
						else{			
							boxedDataB=TA[procIDB][m_layout.m_localIndexes[gIdxB]];
							TMCopy.start();boxedDataA.copy(boxedDataB, m_ExchangeGhostRegion[i][j]);TMCopy.stop();
						}
					}
				}	
			}
			else{
				Util.printErrMsg("BoxLayoutData::exchange(): the underlying layout must be disjointed!");	
			}	
		Ti.barrier();
		TM.stop();
		Util.countExchange+=TM.millis();
		Util.countCopy+=TMCopy.millis();
		Util.countLocalCopy+=TMCopyL.millis();
		//TM.reset();
	}
	*/

	/** On June 21, 2004. The restriction is cached at the level of T. Exchange Version 3*/
	public final local single void exchange(){
		TM.reset();//TMCopyL.reset();
		TM.start();
		Ti.barrier();
		if (m_constructed && m_ghostSize!=0)
			if (m_disjointed){
				T local boxedDataA; 
				for (int i=0;i<m_numOfBoxes;i++){	
					boxedDataA=(T local)TA[m_procID][i];
					//TMCopyL.start();boxedDataA.exchange();TMCopyL.stop();
					boxedDataA.exchange();
				}	
			}
			else{
				Util.printErrMsg("BoxLayoutData::exchange(): the underlying layout must be disjointed!");	
			}	
		Ti.barrier();
		TM.stop();
		Util.countExchange+=TM.millis();
		//Util.countLocalCopy+=TMCopyL.millis();
	}
	
	/**@see <a href="http://davis.lbl.gov/NASA/chombomanual/classLevelData.html">LevelData</a>*/
	// To add another case when the two have the same layout.
	/* version 1 (before Nov 01, 2004)
	public final local single void copy(template BoxLayoutData<T > local single a_BLDsrc, boolean single a_ghostIncluded){
		Ti.barrier();
		if (m_constructed && a_BLDsrc.isConstructed())
			if (a_BLDsrc.isDisjointed()){
				PrivateRegion local region=new PrivateRegion();
				//LayoutIterator local LITA=new LayoutIterator(m_layout);
				LayoutIterator local LITA=m_layoutItr;//Aug 09, 2004
				//LayoutIterator local LITB=new(region) LayoutIterator(a_BLDsrc.m_layout);
				LayoutIterator local LITB=a_BLDsrc.LayoutIterator();//Aug 09, 2004
				RectDomain<SPACE_DIM> boxA,boxB;
				T local boxedDataA;
				T boxedDataB; T local boxedDataB_l;
				DataIndex local DI;
				LITA.reset();
			   if (m_layout==a_BLDsrc.m_layout){
				for (int i=0;i<m_numOfBoxes;i++){
					boxA=LITA.access();	
					boxedDataA=(T local)TA[m_procID][i];
					if (a_ghostIncluded) boxA=boxedDataA.domain();
					boxedDataB_l=(T local)a_BLDsrc.TA[m_procID][i];
					boxedDataA.localCopy(boxedDataB_l, boxA);
					//boxedDataA.copy(a_BLDsrc.TA[m_procID][i], boxA);
					LITA.advance();
				}

			   }
			   else{
				boolean sorted=a_BLDsrc.m_sorted;
				for (int i=0;i<m_numOfBoxes;i++){
					boxedDataA=(T local)TA[m_procID][i];
					boxA=LITA.access();
					LITB.Reset();
					while (!LITB.IsEnded()){
						boxB=LITB.Access();
					        if ((boxA.upb())[SORT_DIM]<(boxB.lwb())[SORT_DIM] && sorted && m_numOfProcs==1) break;
						if (Util.isJointed(boxA,boxB)){
							DI=LITB.GetDataIndex();
							if (DI.m_procID==m_procID){
								boxedDataB_l=a_BLDsrc[DI];
								if (a_ghostIncluded) boxB=boxedDataB_l.domain();
								boxedDataA.localCopy(boxedDataB_l,boxB,boxA);
							}
							else{
								boxedDataB=a_BLDsrc.getBoxedData(DI);
								if (a_ghostIncluded) boxB=boxedDataB.domain();
								boxedDataA.copy(boxedDataB,boxB,boxA);
							}
						}
						LITB.Advance();
					}
					LITA.advance();
				}
			  }
				try{
					region.delete();
				}
				catch (RegionInUse oops){
					Util.printErrMsg("BoxLayoutData::copy(): failed to delete PrivateRegion region");
				}		
			}
			else{
				Util.printErrMsg("BoxLayoutData::copy( ): the underlying layout of the source must be disjointed!");	
			}
		Ti.barrier();
	}
	*/
	// To reduce the allocation cost, new statments are removed. Internal datastructures are used.
	public final local single void copy(template BoxLayoutData<T > local single a_BLDsrc, boolean single a_ghostIncluded){
		Ti.barrier();
		if (m_constructed && a_BLDsrc.isConstructed())
			if (a_BLDsrc.isDisjointed()){
				BoxLayout local BLB=a_BLDsrc.m_layout;
				LayoutIterator local LITA=m_layoutItr;//Aug 09, 2004
				LayoutIterator local LITB=a_BLDsrc.m_layoutItr;//Nov 01, 2004
				RectDomain<SPACE_DIM> boxA,boxB;
				T local boxedDataA;
				T boxedDataB; T local boxedDataB_l;
				//DataIndex local DI;
				int i,j,gIdxB,lIdxB,procIDB;
				LITA.reset();
			   if (m_layout==BLB){
				for (i=0;i<m_numOfBoxes;i++){
					boxA=LITA.access();	
					boxedDataA=(T local)TA[m_procID][i];
					if (a_ghostIncluded) boxA=boxedDataA.domain();
					boxedDataB_l=(T local)a_BLDsrc.TA[m_procID][i];
					boxedDataA.localCopy(boxedDataB_l, boxA);
					//boxedDataA.copy(a_BLDsrc.TA[m_procID][i], boxA);
					LITA.advance();
				}

			   }
			   else{
				boolean sorted=a_BLDsrc.m_sorted;
				for (i=0;i<m_numOfBoxes;i++){
					boxedDataA=(T local)TA[m_procID][i];
					boxA=LITA.access();
					LITB.Reset();gIdxB=0;
					while (!LITB.IsEnded()){
						boxB=LITB.Access();
					        if ((boxA.upb())[SORT_DIM]<(boxB.lwb())[SORT_DIM] && sorted && m_numOfProcs==1) break;
						if (Util.isJointed(boxA,boxB)){
							//DI=LITB.GetDataIndex();
							procIDB=BLB.m_procAssignments[gIdxB];
							lIdxB=BLB.m_localIndexes[gIdxB];
							if (procIDB==m_procID){
								//boxedDataB_l=a_BLDsrc[DI];
								boxedDataB_l=(T local)a_BLDsrc.TA[procIDB][lIdxB];
								if (a_ghostIncluded) boxB=boxedDataB_l.domain();
								boxedDataA.localCopy(boxedDataB_l,boxB,boxA);
							}
							else{
								//boxedDataB=a_BLDsrc.getBoxedData(DI);
								boxedDataB=a_BLDsrc.TA[procIDB][lIdxB];
								if (a_ghostIncluded) boxB=boxedDataB.domain();
								boxedDataA.copy(boxedDataB,boxB,boxA);
							}
						}
						LITB.Advance();gIdxB++;
					}
					LITA.advance();
				}
			  }
	
			}
			else{
				Util.printErrMsg("BoxLayoutData::copy( ): the underlying layout of the source must be disjointed!");	
			}
		Ti.barrier();
	}
	

	public local void myprint(){
		T local BD;
		RectDomain<SPACE_DIM> box;
		//Double.setPrecision(3);
		for (int i=0;i<m_numOfBoxes;i++){
			BD=(T local)TA[m_procID][i];
			box=BD.domain();
			if (SPACE_DIM!=2){
			  foreach (point in box) System.out.print(" "+point.toString()+" "+BD[point]);
			  System.out.print("\n");System.out.flush();
			}
			else{
			  Point<SPACE_DIM> size=box.max()-box.min()+Point<SPACE_DIM>.all(1);
			  int counter=0;
			  System.out.println("Domain is "+box.toString());
			  foreach (point in box){
				  System.out.print(" "+BD[point]);
				  counter++;
				  if (counter==size[2]){
			  	    System.out.print("\n");System.out.flush();
				    counter=0;
				  }	
			  }
			}

		}
		//Double.setPrecision(0);
	}
}