CartDecomposition.hpp 52.4 KB
Newer Older
incardon's avatar
incardon committed
1 2 3 4 5 6 7 8 9 10 11 12
/*
 * CartDecomposition.hpp
 *
 *  Created on: Aug 15, 2014
 *      Author: Pietro Incardona
 */

#ifndef CARTDECOMPOSITION_HPP
#define CARTDECOMPOSITION_HPP

#include "config.h"
#include "Decomposition.hpp"
incardon's avatar
incardon committed
13
#include "Vector/map_vector.hpp"
incardon's avatar
incardon committed
14 15 16 17 18 19 20
#include <vector>
#include "global_const.hpp"
#include <initializer_list>
#include "SubdomainGraphNodes.hpp"
#include "metis_util.hpp"
#include "dec_optimizer.hpp"
#include "Space/Shape/Box.hpp"
incardon's avatar
incardon committed
21
#include "Space/Shape/Point.hpp"
incardon's avatar
incardon committed
22
#include "NN/CellList/CellDecomposer.hpp"
incardon's avatar
incardon committed
23 24
#include <unordered_map>
#include "NN/CellList/CellList.hpp"
incardon's avatar
incardon committed
25
#include "Space/Ghost.hpp"
incardon's avatar
incardon committed
26 27 28 29 30 31 32 33 34 35

/**
 * \brief This class decompose a space into subspaces
 *
 * \tparam dim is the dimensionality of the physical domain we are going to decompose.
 * \tparam T type of the space we decompose, Real, Integer, Complex ...
 * \tparam layout to use
 * \tparam Memory Memory factory used to allocate memory
 * \tparam Domain Structure that contain the information of your physical domain
 *
36 37
 * Given an N-dimensional space, this class decompose the space into a Cartesian grid of small
 * sub-sub-domain. At each sub-sub-domain is assigned  an id that identify which processor is
incardon's avatar
incardon committed
38
 * going to take care of that part of space (in general the space assigned to a processor is
39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57
 * simply connected), a second step merge several sub-sub-domain with same id into bigger region
 *  sub-domain with the id. Each sub-domain has an extended space called ghost part
 *
 * Assuming that VCluster.getProcessUnitID(), equivalent to the MPI processor rank, return the processor local
 * processor id, we define
 *
 * * local sub-domain: all the sub-domain with id == local processor
 * * external ghost box: (or ghost box) are the boxes that compose the ghost space of the processor, or the
 *   boxes produced expanding every local sub-domain by the ghost extension and intersecting with the sub-domain
 *   of the other processors
 * * Near processors are the processors adjacent to the local processor, where with adjacent we mean all the processor
 *   that has a non-zero intersection with the ghost part of the local processor, or all the processors that
 *   produce non-zero external boxes with the local processor, or all the processor that should communicate
 *   in case of ghost data synchronization
 * * internal ghost box: is the part of ghost of the near processor that intersect the space of the
 *       processor, or the boxes produced expanding the sub-domain of the near processors with the local sub-domain
 * * Near processor sub-domain: is a sub-domain that live in the a near (or contiguous) processor
 * * Near processor list: the list of all the near processor of the local processor (each processor has a list
 *                        of the near processor)
incardon's avatar
incardon committed
58
 * * Local ghosts interal or external are all the ghosts that does not involve inter-processor communications
59 60
 *
 * \see calculateGhostBoxes() for a visualization of internal and external ghost boxes
incardon's avatar
incardon committed
61
 *
incardon's avatar
incardon committed
62 63
 */

incardon's avatar
incardon committed
64
template<unsigned int dim, typename T, template<typename> class device_l=openfpm::device_cpu, typename Memory=HeapMemory, template<unsigned int, typename> class Domain=Box>
incardon's avatar
incardon committed
65 66
class CartDecomposition
{
incardon's avatar
incardon committed
67 68
	struct N_box
	{
69
		// id of the processor in the nn_processor list (local processor id)
incardon's avatar
incardon committed
70 71 72 73 74 75
		size_t id;

		// Near processor sub-domains
		typename openfpm::vector<::Box<dim,T>> bx;
	};

incardon's avatar
incardon committed
76 77 78
	struct Box_proc
	{
		// Intersection between the local sub-domain enlarged by the ghost and the contiguous processor
incardon's avatar
incardon committed
79
		// sub-domains (External ghost)
incardon's avatar
incardon committed
80 81 82
		openfpm::vector<::Box<dim,T>> bx;

		// Intersection between the contiguous processor sub-domain enlarged by the ghost with the
incardon's avatar
incardon committed
83
		// local sub-domain (Internal ghost)
incardon's avatar
incardon committed
84 85 86 87 88 89 90
		openfpm::vector<::Box<dim,T>> nbx;


		// processor
		size_t proc;
	};

91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116
	/*! It contain a box definition and from witch sub-domain it come from (in the local processor)
	 * and an unique across adjacent processors (for communication)
	 *
	 * If the box come from the intersection of an expanded sub-domain and a sub-domain
	 *
	 * Assuming we are considering the adjacent processor i (0 to getNNProcessors())
	 *
	 * ### external ghost box
	 *
	 * id = id_exp + N_non_exp + id_non_exp
	 *
	 * id_exp = the id in the vector proc_adj_box.get(i) of the expanded sub-domain
	 *
	 * id_non_exp = the id in the vector nn_processor_subdomains[i] of the sub-domain
	 *
	 * ### internal ghost box
	 *
	 * id = id_exp + N_non_exp + id_non_exp
	 *
	 * id_exp = the id in the vector nn_processor_subdomains[i] of the expanded sub-domain
	 *
	 * id_non_exp = the id in the vector proc_adj_box.get(i) of the sub-domain
	 *
	 */
	/*
	*/
117
	struct Box_sub : public Box<dim,T>
118 119 120
	{
		// Domain id
		size_t sub;
incardon's avatar
incardon committed
121

122 123 124
		// Id
		size_t id;

incardon's avatar
incardon committed
125 126 127 128 129 130
		Box_sub operator=(const Box<dim,T> & box)
		{
			::Box<dim,T>::operator=(box);

			return *this;
		}
131 132


133 134
	};

135
	//! Particular case for local internal ghost boxes
136
	struct Box_sub_k : public Box<dim,T>
incardon's avatar
incardon committed
137 138 139 140 141 142 143 144 145 146 147 148 149
	{
		// Domain id
		size_t sub;

		//! k \see getLocalGhostIBoxE
		long int k;

		Box_sub_k operator=(const Box<dim,T> & box)
		{
			::Box<dim,T>::operator=(box);

			return *this;
		}
150 151

		// encap interface to make compatible with OpenFPM_IO
incardon's avatar
incardon committed
152
		template <int i> auto get() -> decltype( std::declval<Box<dim,T> *>()->template get<i>())
153 154 155
		{
			return ::Box<dim,T>::template get<i>();
		}
incardon's avatar
incardon committed
156 157
	};

158 159 160 161
	struct Box_dom
	{
		// Intersection between the local sub-domain enlarged by the ghost and the contiguous processor
		// sub-domains (External ghost)
incardon's avatar
incardon committed
162
		openfpm::vector_std< Box_sub > ebx;
163 164 165

		// Intersection between the contiguous processor sub-domain enlarged by the ghost with the
		// local sub-domain (Internal ghost)
incardon's avatar
incardon committed
166
		openfpm::vector_std< Box_sub> ibx;
167 168
	};

incardon's avatar
incardon committed
169 170 171 172 173 174 175 176 177 178 179 180
	//! Case for local ghost box
	struct lBox_dom
	{
		// Intersection between the local sub-domain enlarged by the ghost and the contiguous processor
		// sub-domains (External ghost)
		openfpm::vector_std< Box_sub > ebx;

		// Intersection between the contiguous processor sub-domain enlarged by the ghost with the
		// local sub-domain (Internal ghost)
		openfpm::vector_std< Box_sub_k> ibx;
	};

incardon's avatar
incardon committed
181
public:
incardon's avatar
incardon committed
182

incardon's avatar
incardon committed
183 184 185 186 187 188 189 190
	//! Type of the domain we are going to decompose
	typedef T domain_type;

	//! It simplify to access the SpaceBox element
	typedef SpaceBox<dim,T> Box;

private:

incardon's avatar
incardon committed
191
	//! This is the key type to access  data_s, for example in the case of vector
incardon's avatar
incardon committed
192
	//! acc_key is size_t
incardon's avatar
incardon committed
193
	typedef typename openfpm::vector<SpaceBox<dim,T>,device_l<SpaceBox<dim,T>>,Memory,openfpm::vector_grow_policy_default,openfpm::vect_isel<SpaceBox<dim,T>>::value >::access_key acc_key;
incardon's avatar
incardon committed
194 195 196 197 198

	//! the margin of the sub-domain selected
	SpaceBox<dim,T> sub_domain;

	//! the set of all local sub-domain as vector
incardon's avatar
incardon committed
199
	openfpm::vector<SpaceBox<dim,T>> sub_domains;
incardon's avatar
incardon committed
200

incardon's avatar
incardon committed
201 202 203
	//! List of near processors
	openfpm::vector<size_t> nn_processors;

204
	//! for each sub-domain (first vector), contain the list (nested vector) of the neighborhood processors
incardon's avatar
incardon committed
205
	//! and for each processor contain the boxes calculated from the intersection
206 207
	//! of the sub-domains + ghost with the near-by processor sub-domain () and the other way around
	//! \see calculateGhostBoxes
incardon's avatar
incardon committed
208 209
	openfpm::vector< openfpm::vector< Box_proc > > box_nn_processor_int;

210 211 212
	//! It store the same information of box_nn_processor_int organized by processor id
	openfpm::vector< Box_dom > proc_int_box;

incardon's avatar
incardon committed
213
	//! for each sub-domain, contain the list of the neighborhood processors
incardon's avatar
incardon committed
214 215 216
	openfpm::vector<openfpm::vector<long unsigned int> > box_nn_processor;

	// for each near-processor store the sub-domain of the near processor
incardon's avatar
incardon committed
217
	std::unordered_map<size_t, N_box> nn_processor_subdomains;
incardon's avatar
incardon committed
218

219 220 221
	// for each processor store the set of the sub-domains sent to the adjacent processors
	openfpm::vector<openfpm::vector<size_t>> proc_adj_box;

incardon's avatar
incardon committed
222
	//! it contain the internal ghosts of the local processor
incardon's avatar
incardon committed
223
	openfpm::vector<lBox_dom> loc_ghost_box;
incardon's avatar
incardon committed
224

incardon's avatar
incardon committed
225
	//! Structure that contain for each sub-sub-domain box the processor id
incardon's avatar
Add ORB  
incardon committed
226
	//! exist for efficient global communication
incardon's avatar
incardon committed
227 228
	openfpm::vector<size_t> fine_s;

incardon's avatar
incardon committed
229 230
	//! Structure that store the cartesian grid information
	grid_sm<dim,void> gr;
incardon's avatar
incardon committed
231

incardon's avatar
incardon committed
232 233 234
	//! Structure that decompose your structure into cell without creating them
	//! useful to convert positions to CellId or sub-domain id in this case
	CellDecomposer_sm<dim,T> cd;
incardon's avatar
incardon committed
235 236 237 238 239 240 241 242 243 244

	//! rectangular domain to decompose
	Domain<dim,T> domain;

	//! Box Spacing
	T spacing[dim];

	//! Runtime virtual cluster machine
	Vcluster & v_cl;

incardon's avatar
incardon committed
245
	//! Cell-list that store the geometrical information of the internal ghost boxes
incardon's avatar
incardon committed
246 247
	CellList<dim,T,FAST> geo_cell;

incardon's avatar
incardon committed
248 249 250
	//! Cell-list that store the geometrical information of the local internal ghost boxes
	CellList<dim,T,FAST> lgeo_cell;

incardon's avatar
incardon committed
251

incardon's avatar
incardon committed
252 253 254 255 256 257 258 259 260 261 262 263 264 265 266
	/*! \brief Create internally the decomposition
	 *
     * \param v_cl Virtual cluster, used internally to handle or pipeline communication
	 *
	 */
	void CreateDecomposition(Vcluster & v_cl)
	{
		// Calculate the total number of box and and the spacing
		// on each direction
		// Get the box containing the domain
		SpaceBox<dim,T> bs = domain.getBox();

		for (unsigned int i = 0; i < dim ; i++)
		{
			// Calculate the spacing
incardon's avatar
incardon committed
267
			spacing[i] = (bs.getHigh(i) - bs.getLow(i)) / gr.size(i);
incardon's avatar
incardon committed
268 269 270 271
		}

		// Here we use METIS
		// Create a cartesian grid graph
incardon's avatar
incardon committed
272
		CartesianGraphFactory<dim,Graph_CSR<nm_part_v,nm_part_e>> g_factory_part;
incardon's avatar
incardon committed
273 274

		// Processor graph
incardon's avatar
incardon committed
275
		Graph_CSR<nm_part_v,nm_part_e> gp = g_factory_part.template construct<NO_EDGE,T,dim-1>(gr.getSize(),domain);
incardon's avatar
incardon committed
276 277 278 279 280 281 282 283

		// Get the number of processing units
		size_t Np = v_cl.getProcessingUnits();

		// Get the processor id
		long int p_id = v_cl.getProcessUnitID();

		// Convert the graph to metis
incardon's avatar
incardon committed
284
		Metis<Graph_CSR<nm_part_v,nm_part_e>> met(gp,Np);
incardon's avatar
incardon committed
285 286

		// decompose
incardon's avatar
incardon committed
287
		met.decompose<nm_part_v::id>();
incardon's avatar
incardon committed
288

incardon's avatar
Add ORB  
incardon committed
289
		// fill the structure that store the processor id for each sub-domain
incardon's avatar
incardon committed
290
		fine_s.resize(gr.size());
incardon's avatar
Add ORB  
incardon committed
291

incardon's avatar
incardon committed
292 293
		// Optimize the decomposition creating bigger spaces
		// And reducing Ghost over-stress
incardon's avatar
incardon committed
294
		dec_optimizer<dim,Graph_CSR<nm_part_v,nm_part_e>> d_o(gp,gr.getSize());
incardon's avatar
incardon committed
295 296 297 298

		// set of Boxes produced by the decomposition optimizer
		openfpm::vector<::Box<dim,size_t>> loc_box;

incardon's avatar
incardon committed
299
		// optimize the decomposition
incardon's avatar
incardon committed
300 301
		d_o.template optimize<nm_part_v::sub_id,nm_part_v::id>(gp,p_id,loc_box,box_nn_processor);

incardon's avatar
incardon committed
302 303
		// produce the list of the contiguous processor (nn_processors) and link nn_processor_subdomains to the
		// processor list
incardon's avatar
incardon committed
304 305 306 307 308 309 310 311 312 313 314 315
		for (size_t i = 0 ;  i < box_nn_processor.size() ; i++)
		{
			for (size_t j = 0 ; j < box_nn_processor.get(i).size() ; j++)
			{
				nn_processors.add(box_nn_processor.get(i).get(j));
			}
		}

		// make the list sorted and unique
	    std::sort(nn_processors.begin(), nn_processors.end());
	    auto last = std::unique(nn_processors.begin(), nn_processors.end());
	    nn_processors.erase(last, nn_processors.end());
incardon's avatar
incardon committed
316

incardon's avatar
incardon committed
317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337
		// produce the list of the contiguous processor (nn_processors) and link nn_processor_subdomains to the
		// processor list
		for (size_t i = 0 ;  i < box_nn_processor.size() ; i++)
		{
			for (size_t j = 0 ; j < box_nn_processor.get(i).size() ; j++)
			{
				// processor id near to this sub-domain
				size_t proc_id = box_nn_processor.get(i).get(j);

				size_t k = 0;
				// search inside near processor list
				for (k = 0 ; k < nn_processors.size() ; k++)
					if (nn_processors.get(k) == proc_id)	break;

				nn_processor_subdomains[proc_id].id = k;
			}
		}

		// Initialize ss_box and bbox
		if (loc_box.size() >= 0)
		{
338 339
			SpaceBox<dim,size_t> sub_dc = loc_box.get(0);
			SpaceBox<dim,T> sub_d(sub_dc);
incardon's avatar
incardon committed
340 341 342
			sub_d.mul(spacing);
			sub_d.expand(spacing);

343 344 345 346 347 348 349 350 351 352 353 354 355
			// Fixing sub-domains to cover all the domain

			// Fixing sub_d
			// if (loc_box) is a the boundary we have to ensure that the box span the full
			// domain (avoiding rounding off error)
			for (size_t i = 0 ; i < dim ; i++)
			{
				if (sub_dc.getHigh(i) == cd.getGrid().size(i) - 1)
				{
					sub_d.setHigh(i,domain.getHigh(i));
				}
			}

incardon's avatar
incardon committed
356 357 358 359 360 361 362
			// add the sub-domain
			sub_domains.add(sub_d);

			ss_box = sub_d;
			bbox = sub_d;
		}

incardon's avatar
incardon committed
363
		// convert into sub-domain
incardon's avatar
incardon committed
364
		for (size_t s = 1 ; s < loc_box.size() ; s++)
incardon's avatar
incardon committed
365
		{
366 367
			SpaceBox<dim,size_t> sub_dc = loc_box.get(s);
			SpaceBox<dim,T> sub_d(sub_dc);
incardon's avatar
incardon committed
368

incardon's avatar
incardon committed
369 370 371
			// re-scale and add spacing (the end is the starting point of the next domain + spacing)
			sub_d.mul(spacing);
			sub_d.expand(spacing);
incardon's avatar
incardon committed
372

373 374 375 376 377 378 379 380 381 382 383 384 385
			// Fixing sub-domains to cover all the domain

			// Fixing sub_d
			// if (loc_box) is a the boundary we have to ensure that the box span the full
			// domain (avoiding rounding off error)
			for (size_t i = 0 ; i < dim ; i++)
			{
				if (sub_dc.getHigh(i) == cd.getGrid().size(i) - 1)
				{
					sub_d.setHigh(i,domain.getHigh(i));
				}
			}

incardon's avatar
incardon committed
386 387
			// add the sub-domain
			sub_domains.add(sub_d);
incardon's avatar
incardon committed
388 389 390 391 392 393

			// Calculate the bound box
			bbox.enclose(sub_d);

			// Create the smallest box contained in all sub-domain
			ss_box.contained(sub_d);
incardon's avatar
incardon committed
394
		}
incardon's avatar
incardon committed
395 396

		// fill fine_s structure
incardon's avatar
incardon committed
397 398 399
		// fine_s structure contain the processor id for each sub-sub-domain
		// with sub-sub-domain we mean the sub-domain decomposition before
		// running dec_optimizer (before merging sub-domains)
incardon's avatar
incardon committed
400 401 402 403 404 405 406 407 408 409 410
		auto it = gp.getVertexIterator();

		while (it.isNext())
		{
			size_t key = it.get();

			// fill with the fine decomposition
			fine_s.get(key) = gp.template vertex_p<nm_part_v::id>(key);

			++it;
		}
411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430

		// Get the smallest sub-division on each direction
		::Box<dim,T> unit = getSmallestSubdivision();
		// Get the processor bounding Box
		::Box<dim,T> bound = getProcessorBounds();

		// calculate the sub-divisions (0.5 for rounding error)
		size_t div[dim];
		for (size_t i = 0 ; i < dim ; i++)
			div[i] = (size_t)((bound.getHigh(i) - bound.getLow(i)) / unit.getHigh(i) + 0.5);

		// Create shift
		Point<dim,T> orig;

		// p1 point of the Processor bound box is the shift
		for (size_t i = 0 ; i < dim ; i++)
			orig.get(i) = bound.getLow(i);

		// Initialize the geo_cell structure
		geo_cell.Initialize(domain,div,orig);
incardon's avatar
incardon committed
431
		lgeo_cell.Initialize(domain,div,orig);
incardon's avatar
incardon committed
432 433
	}

incardon's avatar
incardon committed
434 435 436
	// Save the ghost boundaries
	Ghost<dim,T> ghost;

incardon's avatar
incardon committed
437 438 439 440 441 442 443
	/*! \brief Create the external local ghost boxes
	 *
	 * \param ghost margin to enlarge
	 *
	 */
	void create_loc_ghost_ebox(Ghost<dim,T> & ghost)
	{
incardon's avatar
incardon committed
444 445 446
		// Save the ghost
		this->ghost = ghost;

incardon's avatar
incardon committed
447 448 449 450 451
		loc_ghost_box.resize(sub_domains.size());

		// For each sub-domain
		for (size_t i = 0 ; i < sub_domains.size() ; i++)
		{
incardon's avatar
incardon committed
452 453 454 455
			SpaceBox<dim,T> sub_with_ghost = sub_domains.get(i);

			// enlarge the sub-domain with the ghost
			sub_with_ghost.enlarge(ghost);
incardon's avatar
incardon committed
456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472

			// intersect with the other local sub-domains
			for (size_t j = 0 ; j < sub_domains.size() ; j++)
			{
				if (i == j)
					continue;

				::Box<dim,T> bi;

				bool intersect = sub_with_ghost.Intersect(::SpaceBox<dim,T>(sub_domains.get(j)),bi);

				if (intersect == true)
				{
					Box_sub b;
					b.sub = j;
					b = bi;

incardon's avatar
incardon committed
473 474 475 476 477 478 479 480 481 482 483 484
					// local external ghost box
					loc_ghost_box.get(i).ebx.add(b);

					// search this box in the internal box of the sub-domain j
					for (size_t k = 0; k < loc_ghost_box.get(j).ibx.size() ; k++)
					{
						if (loc_ghost_box.get(j).ibx.get(k).sub == i)
						{
							loc_ghost_box.get(j).ibx.get(k).k = loc_ghost_box.get(i).ebx.size()-1;
							break;
						}
					}
incardon's avatar
incardon committed
485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507
				}
			}
		}
	}

	/*! \brief Create the internal local ghost boxes
	 *
	 * \param ghost margin to enlarge
	 *
	 */
	void create_loc_ghost_ibox(Ghost<dim,T> & ghost)
	{
		loc_ghost_box.resize(sub_domains.size());

		// For each sub-domain
		for (size_t i = 0 ; i < sub_domains.size() ; i++)
		{
			// intersect with the others local sub-domains
			for (size_t j = 0 ; j < sub_domains.size() ; j++)
			{
				if (i == j)
					continue;

incardon's avatar
incardon committed
508 509 510 511
				SpaceBox<dim,T> sub_with_ghost = sub_domains.get(j);
				// enlarge the sub-domain with the ghost
				sub_with_ghost.enlarge(ghost);

incardon's avatar
incardon committed
512 513
				::Box<dim,T> bi;

incardon's avatar
incardon committed
514
				bool intersect = sub_with_ghost.Intersect(::SpaceBox<dim,T>(sub_domains.get(i)),bi);
incardon's avatar
incardon committed
515 516 517

				if (intersect == true)
				{
incardon's avatar
incardon committed
518
					Box_sub_k b;
incardon's avatar
incardon committed
519 520
					b.sub = j;
					b = bi;
incardon's avatar
incardon committed
521
					b.k = -1;
incardon's avatar
incardon committed
522 523 524 525 526 527 528

					loc_ghost_box.get(i).ibx.add(b);
				}
			}
		}
	}

incardon's avatar
incardon committed
529 530 531 532 533 534 535 536 537
	/*! \brief Create the subspaces that decompose your domain
	 *
	 * Create the subspaces that decompose your domain
	 *
	 */

	void CreateSubspaces()
	{
		// Create a grid where each point is a space
538
		grid_sm<dim,void> g(div);
incardon's avatar
incardon committed
539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566

		// create a grid_key_dx iterator
		grid_key_dx_iterator<dim> gk_it(g);

		// Divide the space into subspaces
		while (gk_it.isNext())
		{
			//! iterate through all subspaces
			grid_key_dx<dim> key = gk_it.get();

			//! Create a new subspace
			SpaceBox<dim,T> tmp;

			//! fill with the Margin of the box
			for (int i = 0 ; i < dim ; i++)
			{
				tmp.setHigh(i,(key.get(i)+1)*spacing[i]);
				tmp.setLow(i,key.get(i)*spacing[i]);
			}

			//! add the space box
			sub_domains.add(tmp);

			// add the iterator
			++gk_it;
		}
	}

567 568 569 570 571 572 573 574 575 576 577 578 579 580
	/*! \brief Create the box_nn_processor_int (bx part)  structure
	 *
	 * This structure store for each sub-domain of this processors enlarged by the ghost size the boxes that
	 *  come from the intersection with the near processors sub-domains (External ghost box)
	 *
	 * \param ghost margins
	 *
	 * \note Are the G8_0 G9_0 G9_1 G5_0 boxes in calculateGhostBoxes
	 * \see calculateGhostBoxes
	 *
	 */
	void create_box_nn_processor_ext(Ghost<dim,T> & ghost)
	{
		box_nn_processor_int.resize(sub_domains.size());
581
		proc_int_box.resize(getNNProcessors());
582 583 584 585 586 587 588 589 590

		// For each sub-domain
		for (size_t i = 0 ; i < sub_domains.size() ; i++)
		{
			SpaceBox<dim,T> sub_with_ghost = sub_domains.get(i);

			// enlarge the sub-domain with the ghost
			sub_with_ghost.enlarge(ghost);

incardon's avatar
incardon committed
591
			// resize based on the number of adjacent processors
592 593
			box_nn_processor_int.get(i).resize(box_nn_processor.get(i).size());

incardon's avatar
incardon committed
594
			// For each processor adjacent to this sub-domain
595 596 597 598 599
			for (size_t j = 0 ; j < box_nn_processor.get(i).size() ; j++)
			{
				// Contiguous processor
				size_t p_id = box_nn_processor.get(i).get(j);

600 601 602
				// store the box in proc_int_box storing from which sub-domain they come from
				Box_dom & proc_int_box_g = proc_int_box.get(ProctoID(p_id));

incardon's avatar
incardon committed
603
				// get the set of sub-domains of the adjacent processor p_id
604
				openfpm::vector< ::Box<dim,T> > & nn_processor_subdomains_g = nn_processor_subdomains[p_id].bx;
605 606

				// near processor sub-domain intersections
607
				openfpm::vector< ::Box<dim,T> > & box_nn_processor_int_gg = box_nn_processor_int.get(i).get(j).bx;
608 609

				// for each near processor sub-domain intersect with the enlarged local sub-domain and store it
610
				for (size_t b = 0 ; b < nn_processor_subdomains_g.size() ; b++)
611 612 613
				{
					::Box<dim,T> bi;

614
					bool intersect = sub_with_ghost.Intersect(::Box<dim,T>(nn_processor_subdomains_g.get(b)),bi);
615 616 617 618 619 620 621 622 623

					if (intersect == true)
					{
						struct p_box pb;

						pb.box = bi;
						pb.proc = p_id;
						pb.lc_proc = ProctoID(p_id);

624 625 626 627 628 629 630 631 632 633
						//
						// Updating
						//
						// vb_ext
						// box_nn_processor_int
						// proc_int_box
						//
						// They all store the same information but organized in different ways
						// read the description of each for more information
						//
634
						vb_ext.add(pb);
635 636
						box_nn_processor_int_gg.add(bi);
						proc_int_box_g.ebx.add();
incardon's avatar
incardon committed
637 638
						proc_int_box_g.ebx.last() = bi;
						proc_int_box_g.ebx.last().sub = i;
639 640 641 642 643 644 645 646 647 648 649 650 651

						// Search for the correct id
						size_t k = 0;
						size_t p_idp = ProctoID(p_id);
						for (k = 0 ; k < proc_adj_box.get(p_idp).size() ; k++)
						{
							if (proc_adj_box.get(p_idp).get(k) == i)
								break;
						}
						if (k == proc_adj_box.get(p_idp).size())
							std::cerr << "Error: " << __FILE__ << ":" << __LINE__ << " sub-domain not found\n";

						proc_int_box_g.ebx.last().id = (k * nn_processor_subdomains_g.size() + b) * v_cl.getProcessingUnits() + p_id;
652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709
					}
				}
			}
		}
	}

	/*! \brief Create the box_nn_processor_int (nbx part) structure, the geo_cell list and proc_int_box
	 *
	 * This structure store for each sub-domain of this processors the boxes that come from the intersection
	 * of the near processors sub-domains enlarged by the ghost size (Internal ghost box). These boxes
	 * fill a geometrical cell list. The proc_int_box store the same information ordered by near processors
	 *
	 * \param ghost margins
	 *
	 * \note Are the B8_0 B9_0 B9_1 B5_0 boxes in calculateGhostBoxes
	 * \see calculateGhostBoxes
	 *
	 */
	void create_box_nn_processor_int(Ghost<dim,T> & ghost)
	{
		box_nn_processor_int.resize(sub_domains.size());
		proc_int_box.resize(getNNProcessors());

		// For each sub-domain
		for (size_t i = 0 ; i < sub_domains.size() ; i++)
		{
			// For each processor contiguous to this sub-domain
			for (size_t j = 0 ; j < box_nn_processor.get(i).size() ; j++)
			{
				// Contiguous processor
				size_t p_id = box_nn_processor.get(i).get(j);

				// get the set of sub-domains of the contiguous processor p_id
				openfpm::vector< ::Box<dim,T> > & nn_p_box = nn_processor_subdomains[p_id].bx;

				// get the local processor id
				size_t lc_proc = nn_processor_subdomains[p_id].id;

				// For each near processor sub-domains enlarge and intersect with the local sub-domain and store the result
				for (size_t k = 0 ; k < nn_p_box.size() ; k++)
				{

					// enlarge the near-processor sub-domain
					::Box<dim,T> n_sub = nn_p_box.get(k);

					// local sub-domain
					::SpaceBox<dim,T> l_sub = sub_domains.get(i);

					// Create a margin of ghost size around the near processor sub-domain
					n_sub.enlarge(ghost);

					// Intersect with the local sub-domain
					p_box b_int;
					bool intersect = n_sub.Intersect(l_sub,b_int.box);

					// store if it intersect
					if (intersect == true)
					{
710
						// the box fill with the processor id
711 712 713 714 715
						b_int.proc = p_id;

						// fill the local processor id
						b_int.lc_proc = lc_proc;

716 717 718 719 720 721 722 723 724 725 726 727
						//
						// Updating
						//
						// vb_int
						// box_nn_processor_int
						// proc_int_box
						//
						// They all store the same information but organized in different ways
						// read the description of each for more information
						//

						// add the box to the near processor sub-domain intersections
728 729 730 731
						openfpm::vector< ::Box<dim,T> > & p_box_int = box_nn_processor_int.get(i).get(j).nbx;
						p_box_int.add(b_int.box);
						vb_int.add(b_int);

732
						// store the box in proc_int_box storing from which sub-domain they come from
733
						Box_dom & pr_box_int = proc_int_box.get(ProctoID(p_id));
734
						Box_sub sb;
incardon's avatar
incardon committed
735
						sb = b_int.box;
736
						sb.sub = i;
incardon's avatar
incardon committed
737

738 739 740 741 742 743 744 745 746 747 748 749 750
						// Search for the correct id
						size_t s = 0;
						size_t p_idp = ProctoID(p_id);
						for (s = 0 ; s < proc_adj_box.get(p_idp).size() ; s++)
						{
							if (proc_adj_box.get(p_idp).get(s) == i)
								break;
						}
						if (s == proc_adj_box.get(p_idp).size())
							std::cerr << "Error: " << __FILE__ << ":" << __LINE__ << " sub-domain not found\n";

						sb.id = (k * proc_adj_box.get(p_idp).size() + s) * v_cl.getProcessingUnits() + v_cl.getProcessUnitID();

751
						pr_box_int.ibx.add(sb);
752 753 754

						// update the geo_cell list

incardon's avatar
incardon committed
755
						// get the cells this box span
756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775
						const grid_key_dx<dim> p1 = geo_cell.getCellGrid(b_int.box.getP1());
						const grid_key_dx<dim> p2 = geo_cell.getCellGrid(b_int.box.getP2());

						// Get the grid and the sub-iterator
						auto & gi = geo_cell.getGrid();
						grid_key_dx_iterator_sub<dim> g_sub(gi,p1,p2);

						// add the box-id to the cell list
						while (g_sub.isNext())
						{
							auto key = g_sub.get();
							geo_cell.addCell(gi.LinId(key),vb_int.size()-1);
							++g_sub;
						}
					}
				}
			}
		}
	}

incardon's avatar
incardon committed
776 777 778 779 780 781 782 783 784 785 786 787 788 789 790
	// Heap memory receiver
	HeapMemory hp_recv;

	// vector v_proc
	openfpm::vector<size_t> v_proc;

	// Receive counter
	size_t recv_cnt;

	/*! \brief Message allocation
	 *
	 * \param message size required to receive from i
	 * \param total message size to receive from all the processors
	 * \param the total number of processor want to communicate with you
	 * \param i processor id
incardon's avatar
incardon committed
791 792
	 * \param ri request id (it is an id that goes from 0 to total_p, and is unique
	 *           every time message_alloc is called)
incardon's avatar
incardon committed
793 794 795 796 797
	 * \param ptr a pointer to the vector_dist structure
	 *
	 * \return the pointer where to store the message
	 *
	 */
incardon's avatar
incardon committed
798
	static void * message_alloc(size_t msg_i ,size_t total_msg, size_t total_p, size_t i, size_t ri, void * ptr)
incardon's avatar
incardon committed
799 800
	{
		// cast the pointer
incardon's avatar
incardon committed
801
		CartDecomposition<dim,T,device_l,Memory,Domain> * cd = static_cast< CartDecomposition<dim,T,device_l,Memory,Domain> *>(ptr);
incardon's avatar
incardon committed
802 803

		// Resize the memory
804
		cd->nn_processor_subdomains[i].bx.resize(msg_i / sizeof(::Box<dim,T>) );
incardon's avatar
incardon committed
805 806

		// Return the receive pointer
incardon's avatar
incardon committed
807
		return cd->nn_processor_subdomains[i].bx.getPointer();
incardon's avatar
incardon committed
808 809
	}

incardon's avatar
incardon committed
810 811 812 813 814 815 816
public:

	/*! \brief Cartesian decomposition copy constructor
	 *
     * \param v_cl Virtual cluster, used internally to handle or pipeline communication
	 *
	 */
incardon's avatar
incardon committed
817
	CartDecomposition(CartDecomposition<dim,T,device_l,Memory,Domain> && cd)
incardon's avatar
incardon committed
818
	:sub_domain(cd.sub_domain),gr(cd.gr),cd(cd.cd),domain(cd.domain),v_cl(cd.v_cl)
incardon's avatar
incardon committed
819
	{
incardon's avatar
incardon committed
820 821 822
		// Reset the box to zero
		bbox.zero();

incardon's avatar
incardon committed
823 824 825
		//! the set of all local sub-domain as vector
		sub_domains.swap(cd.sub_domains);

826
		for (size_t i = 0 ; i < dim ; i++)
incardon's avatar
incardon committed
827 828 829 830 831 832 833 834 835 836 837 838
		{
			//! Box Spacing
			this->spacing[i] = spacing[i];
		}
	}

	/*! \brief Cartesian decomposition constructor
	 *
     * \param v_cl Virtual cluster, used internally to handle or pipeline communication
	 *
	 */
	CartDecomposition(Vcluster & v_cl)
incardon's avatar
incardon committed
839
	:v_cl(v_cl)
incardon's avatar
incardon committed
840 841 842 843
	{
		// Reset the box to zero
		bbox.zero();
	}
incardon's avatar
incardon committed
844 845 846 847 848

	//! Cartesian decomposition destructor
	~CartDecomposition()
	{}

849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870
	// It store all the boxes of the near processors in a linear array
	struct p_box
	{
		//! Box that identify the intersection of the ghost of the near processor with the
		//! processor sub-domain
		::Box<dim,T> box;
		//! local processor id
		size_t lc_proc;
		//! processor id
		size_t proc;

		/*! \brief Check if two p_box are the same
		 *
		 * \param pb box to check
		 *
		 */
		bool operator==(const p_box & pb)
		{
			return pb.lc_proc == lc_proc;
		}
	};

incardon's avatar
incardon committed
871 872
	openfpm::vector<size_t> ids;

873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932
	/*! \brief class to select the returned id by ghost_processorID
	 *
	 */
	class box_id
	{
	public:
		/*! \brief Return the box id
		 *
		 * \param p structure containing the id informations
		 * \param b_id box_id
		 *
		 * \return box id
		 *
		 */
		inline static size_t id(p_box & p, size_t b_id)
		{
			return b_id;
		}
	};

	/*! \brief class to select the returned id by ghost_processorID
	 *
	 */
	class processor_id
	{
	public:
		/*! \brief Return the processor id
		 *
		 * \param p structure containing the id informations
		 * \param b_id box_id
		 *
		 * \return processor id
		 *
		 */
		inline static size_t id(p_box & p, size_t b_id)
		{
			return p.proc;
		}
	};

	/*! \brief class to select the returned id by ghost_processorID
	 *
	 */
	class lc_processor_id
	{
	public:
		/*! \brief Return the near processor id
		 *
		 * \param p structure containing the id informations
		 * \param b_id box_id
		 *
		 * \return local processor id
		 *
		 */
		inline static size_t id(p_box & p, size_t b_id)
		{
			return p.lc_proc;
		}
	};

933 934 935 936 937 938 939 940 941 942 943
	/*! /brief Given a point it return the set of boxes in which the point fall
	 *
	 * \param p Point to check
	 * \return An iterator with the id's of the internal boxes in which the point fall
	 *
	 */
	auto getInternalIDBoxes(Point<dim,T> & p) -> decltype(geo_cell.getIterator(geo_cell.getCell(p)))
	{
		return geo_cell.getIterator(geo_cell.getCell(p));
	}

944 945 946 947

#define UNIQUE 1
#define MULTIPLE 2

incardon's avatar
incardon committed
948
	/*! \brief Given a position it return if the position belong to any neighborhood processor ghost
incardon's avatar
incardon committed
949
	 * (Internal ghost)
incardon's avatar
incardon committed
950
	 *
951
	 * \tparam id type of if to get box_id processor_id lc_processor_id
incardon's avatar
incardon committed
952
	 * \param p Particle position
953 954 955
	 * \param opt intersection boxes of the same processor can overlap, so in general the function
	 *        can produce more entry with the same processor, the UNIQUE option eliminate double entries
	 *        (UNIQUE) is for particle data (MULTIPLE) is for grid data [default MULTIPLE]
incardon's avatar
incardon committed
956 957 958 959
	 *
	 * \param return the processor ids
	 *
	 */
960
	template <typename id> inline const openfpm::vector<size_t> ghost_processorID(Point<dim,T> & p, const int opt = MULTIPLE)
incardon's avatar
incardon committed
961 962 963
	{
		ids.clear();

964
		// Check with geo-cell if a particle is inside one Cell containing boxes
incardon's avatar
incardon committed
965

966
		auto cell_it = geo_cell.getIterator(geo_cell.getCell(p));
incardon's avatar
incardon committed
967 968

		// For each element in the cell, check if the point is inside the box
969
		// if it is, store the processor id
incardon's avatar
incardon committed
970 971 972 973 974 975
		while (cell_it.isNext())
		{
			size_t bid = cell_it.get();

			if (vb_int.get(bid).box.isInside(p) == true)
			{
976
				ids.add(id::id(vb_int.get(bid),bid));
incardon's avatar
incardon committed
977
			}
978 979

			++cell_it;
incardon's avatar
incardon committed
980 981
		}

982 983 984 985
		// Make the id unique
		if (opt == UNIQUE)
			ids.unique();

incardon's avatar
incardon committed
986 987 988 989
		return ids;
	}

	/*! \brief Given a position it return if the position belong to any neighborhood processor ghost
incardon's avatar
incardon committed
990
	 * (Internal ghost)
incardon's avatar
incardon committed
991
	 *
992
	 * \tparam id type of if to get box_id processor_id lc_processor_id
incardon's avatar
incardon committed
993 994 995 996 997
	 * \param p Particle position
	 *
	 * \param return the processor ids
	 *
	 */
998
	template<typename id, typename Mem> inline const openfpm::vector<size_t> ghost_processorID(const encapc<1,Point<dim,T>,Mem> & p, const int opt = MULTIPLE)
incardon's avatar
incardon committed
999 1000 1001 1002 1003
	{
		ids.clear();

		// Check with geo-cell if a particle is inside one Cell containing boxes

incardon's avatar
incardon committed
1004
		auto cell_it = geo_cell.getIterator(geo_cell.getCell(p));
incardon's avatar
incardon committed
1005 1006 1007 1008 1009 1010 1011 1012 1013

		// For each element in the cell, check if the point is inside the box
		// if it is, store the processor id
		while (cell_it.isNext())
		{
			size_t bid = cell_it.get();

			if (vb_int.get(bid).box.isInside(p) == true)
			{
1014
				ids.add(id::id(vb_int.get(bid),bid));
incardon's avatar
incardon committed
1015
			}
1016 1017

			++cell_it;
incardon's avatar
incardon committed
1018 1019
		}

1020 1021 1022 1023
		// Make the id unique
		if (opt == UNIQUE)
			ids.unique();

incardon's avatar
incardon committed
1024 1025 1026
		return ids;
	}

1027 1028
	// External ghost boxes for this processor, indicated with G8_0 G9_0 ...
	openfpm::vector<p_box> vb_ext;
incardon's avatar
incardon committed
1029

1030
	// Internal ghost boxes for this processor domain, indicated with B8_0 B9_0 ..... in the figure
incardon's avatar
incardon committed
1031
	// below as a linear vector
incardon's avatar
incardon committed
1032
	openfpm::vector<p_box> vb_int;
incardon's avatar
incardon committed
1033

incardon's avatar
incardon committed
1034
	/*! It calculate the internal ghost boxes
incardon's avatar
incardon committed
1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065
	 *
	 * Example: Processor 10 calculate
	 * B8_0 B9_0 B9_1 and B5_0
	 *
	 *
+----------------------------------------------------+
|                                                    |
|                 Processor 8                        |
|                 Sub-domain 0                       +-----------------------------------+
|                                                    |                                   |
|                                                    |                                   |
++--------------+---+---------------------------+----+        Processor 9                |
 |              |   |     B8_0                  |    |        Subdomain 0                |
 |              +------------------------------------+                                   |
 |              |   |                           |    |                                   |
 |              |   |  XXXXXXXXXXXXX XX         |B9_0|                                   |
 |              | B |  X Processor 10 X         |    |                                   |
 | Processor 5  | 5 |  X Sub-domain 0 X         |    |                                   |
 | Subdomain 0  | _ |  X              X         +----------------------------------------+
 |              | 0 |  XXXXXXXXXXXXXXXX         |    |                                   |
 |              |   |                           |    |                                   |
 |              |   |                           |    |        Processor 9                |
 |              |   |                           |B9_1|        Subdomain 1                |
 |              |   |                           |    |                                   |
 |              |   |                           |    |                                   |
 |              |   |                           |    |                                   |
 +--------------+---+---------------------------+----+                                   |
                                                     |                                   |
                                                     +-----------------------------------+

       and also
incardon's avatar
incardon committed
1066
       G8_0 G9_0 G9_1 G5_0 (External ghost boxes)
incardon's avatar
incardon committed
1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114

+----------------------------------------------------+
|                                                    |
|                 Processor 8                        |
|                 Sub-domain 0                       +-----------------------------------+
|           +---------------------------------------------+                              |
|           |         G8_0                           |    |                              |
++--------------+------------------------------------+    |   Processor 9                |
 |          |   |                                    |    |   Subdomain 0                |
 |          |   |                                    |G9_0|                              |
 |          |   |                                    |    |                              |
 |          |   |      XXXXXXXXXXXXX XX              |    |                              |
 |          |   |      X Processor 10 X              |    |                              |
 | Processor|5  |      X Sub-domain 0 X              |    |                              |
 | Subdomain|0  |      X              X              +-----------------------------------+
 |          |   |      XXXXXXXXXXXXXXXX              |    |                              |
 |          | G |                                    |    |                              |
 |          | 5 |                                    |    |   Processor 9                |
 |          | | |                                    |    |   Subdomain 1                |
 |          | 0 |                                    |G9_1|                              |
 |          |   |                                    |    |                              |
 |          |   |                                    |    |                              |
 +--------------+------------------------------------+    |                              |
            |                                        |    |                              |
            +----------------------------------------+----+------------------------------+


	 *
	 *
	 *
	 * \param ghost margins for each dimensions (p1 negative part) (p2 positive part)
	 *
                ^ p2[1]
                |
                |
           +----+----+
           |         |
           |         |
p1[0]<-----+         +----> p2[0]
           |         |
           |         |
           +----+----+
                |
                v  p1[1]

	 *
	 *
	 */
incardon's avatar
incardon committed
1115
	void calculateGhostBoxes()
incardon's avatar
incardon committed
1116 1117 1118 1119 1120 1121 1122
	{
#ifdef DEBUG
		// the ghost margins are assumed to be smaller
		// than one sub-domain

		for (size_t i = 0 ; i < dim ; i++)
		{
incardon's avatar
incardon committed
1123
			if (ghost.template getLow(i) >= domain.template getHigh(i) / gr.size(i) || ghost.template getHigh(i)  >= domain.template getHigh(i) / gr.size(i))
incardon's avatar
incardon committed
1124
			{
1125
				std::cerr << "Error " << __FILE__ << ":" << __LINE__  << " : Ghost are bigger than one domain" << "\n";
incardon's avatar
incardon committed
1126 1127 1128 1129
			}
		}
#endif

incardon's avatar
incardon committed
1130 1131
		// create a buffer with the sub-domains of this processor, the informations ( the boxes )
		// of the sub-domains contiguous to the processor A are sent to the processor A and
incardon's avatar
incardon committed
1132 1133
		// the information of the contiguous sub-domains in the near processors are received
		//
1134
		proc_adj_box.resize(getNNProcessors());
incardon's avatar
incardon committed
1135
		openfpm::vector< openfpm::vector< ::SpaceBox<dim,T>> > boxes(nn_processors.size());
incardon's avatar
incardon committed
1136 1137 1138 1139 1140 1141 1142

		for (size_t b = 0 ; b < box_nn_processor.size() ; b++)
		{
			for (size_t p = 0 ; p < box_nn_processor.get(b).size() ; p++)
			{
				size_t prc = box_nn_processor.get(b).get(p);

incardon's avatar
incardon committed
1143 1144 1145 1146 1147
				// id of the processor in the processor list
				// [value between 0 and the number of the near processors]
				size_t id = nn_processor_subdomains[prc].id;

				boxes.get(id).add(sub_domains.get(b));
1148
				proc_adj_box.get(id).add(b);
incardon's avatar
incardon committed
1149 1150 1151 1152 1153 1154
			}
		}

		// Intersect all the local sub-domains with the sub-domains of the contiguous processors

		// Get the sub-domains of the near processors
incardon's avatar
incardon committed
1155
		v_cl.sendrecvMultipleMessagesNBX(nn_processors,boxes,CartDecomposition<dim,T,device_l,Memory,Domain>::message_alloc, this ,NEED_ALL_SIZE);
incardon's avatar
incardon committed
1156

incardon's avatar
incardon committed
1157
		// create the internal structures that store ghost information
1158 1159
		create_box_nn_processor_ext(ghost);
		create_box_nn_processor_int(ghost);
incardon's avatar
incardon committed
1160
		// ebox must come after ibox (in this case)
incardon's avatar
incardon committed
1161
		create_loc_ghost_ibox(ghost);
incardon's avatar
incardon committed
1162
		create_loc_ghost_ebox(ghost);
incardon's avatar
incardon committed
1163 1164
	}

incardon's avatar
incardon committed
1165 1166 1167 1168 1169 1170
	/*! \brief processorID return in which processor the particle should go
	 *
	 * \return processorID
	 *
	 */

incardon's avatar
incardon committed
1171
	template<typename Mem> size_t inline processorID(encapc<1, Point<dim,T>, Mem> p)
incardon's avatar
incardon committed
1172
	{
incardon's avatar
incardon committed
1173
		return fine_s.get(cd.getCell(p));
incardon's avatar
incardon committed
1174 1175
	}

incardon's avatar
incardon committed
1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188
	// Smallest subdivision on each direction
	::Box<dim,T> ss_box;

	/*! \brief Get the smallest subdivision of the domain on each direction
	 *
	 * \return a box p1 is set to zero
	 *
	 */
	const ::Box<dim,T> & getSmallestSubdivision()
	{
		return ss_box;
	}

incardon's avatar
incardon committed
1189 1190 1191 1192 1193 1194
	/*! \brief processorID return in which processor the particle should go
	 *
	 * \return processorID
	 *
	 */

1195
	size_t inline processorID(const T (&p)[dim]) const
incardon's avatar
incardon committed
1196
	{
incardon's avatar
incardon committed
1197
		return fine_s.get(cd.getCell(p));
incardon's avatar
incardon committed
1198 1199
	}

incardon's avatar
incardon committed
1200 1201
	/*! \brief Set the parameter of the decomposition
	 *
incardon's avatar
incardon committed
1202
     * \param div_ storing into how many domain to decompose on each dimension
incardon's avatar
incardon committed
1203 1204 1205
     * \param domain_ domain to decompose
	 *
	 */
incardon's avatar
incardon committed
1206
	void setParameters(const size_t (& div_)[dim], Domain<dim,T> domain_, Ghost<dim,T> ghost = Ghost<dim,T>())
incardon's avatar
incardon committed
1207
	{
incardon's avatar
incardon committed
1208 1209
		// set the ghost
		this->ghost = ghost;
incardon's avatar
incardon committed
1210 1211
		// Set the decomposition parameters

incardon's avatar
incardon committed
1212
		gr.setDimensions(div_);
incardon's avatar
incardon committed
1213
		domain = domain_;
incardon's avatar
incardon committed
1214
		cd.setDimensions(domain,div_,0);
incardon's avatar
incardon committed
1215 1216 1217 1218