Hi John, On Jul 13, 2007, at 11:43 AM, John Caron wrote:
Hi Quincey:I'm 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
Yes, the B-trees are sorted on the keys. It's not a simple sort on the byte values though, each "class" of B-tree has a comparison function. For chunks we sort only on chunk offset and it's as you describe above: first on offset in the slowest dimension, then toward the fastest dimension.
Description: S/MIME cryptographic signature