LIP_CREATE_HILBERT_DISTRIBUTION_OOC

LIP_CREATE_HILBERT_DISTRIBUTION_OOC(datamap, new_datamap, coordinatesX_File, coordinatesY_File, coordinatesZ_File, count,page_size, vertex, edge, minedge, sample_count)

IN	datamap	current distribution (handle)
OUT	new_datamap	new, irregular distribution (handle)
IN	coordinatesX_File	X coordinates of points in data file(MPI_File)
IN	coordinatesY_File	Y coordinates of points in data file (MPI_File)
IN	coordinatesZ_File	Z coordinates of points in data file
		can be null in 2D case (MPI_File)
IN	count	size of the coordinates array (integer)
IN	page_size	size of memory buffer (integer)
IN	vertex	the coordinates of the vertex needed for counting
		Hilbert's indices (handle)
IN	edge	the length of edge of the square 2D (or cube 3D)
		needed for counting Hilbert indices (double)
IN	minedge	resolution of the indexing scheme
		(the length of the minimal distance between points
		that are distinguished by Hilbert's
		indexing scheme)
IN	sample_count	the quantity of the sample
		needed for counting Hilbert indices (integer)

C syntax:

int LIP_create_hilbert_distribution_ooc (LIP_Datamap datamap, LIP_Datamap * new_datamap, MPI_File XFILE, MPI_File YFILE, MPI_File ZFILE, int count, int page_size, int sample_count, void* vertex, double edge, double minedge)

Java syntax:
Class Datmap:

public void create_hilbert_distribution_ooc (Datamap datamap, mpi.File xfile, mpi.File yfile, mpi.File zfile, int count, int page size, int samplecount, VDouble vertex, double edge, double minedge)

LIP_CREATE_HILBERT_DISTRIBUTION_OOC creates object new_datamap which contains the translation table that describes how a data array is partitioned among processors. Only one part of the translation table is filled - the ranks of processors that are the new owners of the data are written to the new_datamap. The input data and this part of the translation table are stored OOC. To obtain the local indices of the data one should call remap function (see below).