Hi Quincey:
Im just starting to look at the H5Fsuper.c (its been a while since i coded in
C).
Meanwhile i have another question on a different topic:
The B-tree nodes I assume are sorted on the keys. Is this a simple sort on the
byte values, or something else? For example, are nodes of chunked data sorted
on chunk size, then filter mask, then chunk offset? Or do you just use the
chunk offset? When sorting the chunk offset, can i assume you sort on offset
for slowest dimension (0), then offset for dimension 1, etc
==============================================================================
To unsubscribe netcdf-hdf, visit:
http://www.unidata.ucar.edu/mailing-list-delete-form.html
==============================================================================
