I'm trying to use H5S_select_elements to implement a parallel code that only
reads in the elements that are in the current partition. This works fine
when the number of elements in a partition is small but due to the linked
list implementation of the point selection, destruction of the dataspace
takes forever when I have on the order of 1 million+ point selections. Does
anyone have any ideas how I can speed this up? The pattern of points is
completely arbitrary and has no pattern in general.