HTreeEntry
- ((uint8*)root->count_limit - secondBlock)) / sizeof(HTreeEntry));
HTreeEntry* htreeEntry = (HTreeEntry*)root->count_limit;
HTreeEntry* entries = (HTreeEntry*)block;
uint16 firstEntry = offset % fBlockSize / sizeof(HTreeEntry);
offset + count * sizeof(HTreeEntry));
offset + count * sizeof(HTreeEntry));
HTreeEntry entries[0];
if (fLimit != maxSize / sizeof(HTreeEntry) - fFirstEntry) {
(uint32)(maxSize / sizeof(HTreeEntry) - fFirstEntry), fBlockNum);
HTreeEntry* start = (HTreeEntry*)block + fCurrentEntry + 1;
HTreeEntry* end = (HTreeEntry*)block + fCount + fFirstEntry - 1;
HTreeEntry* middle = start;
middle = (HTreeEntry*)((end - start) / 2
fCurrentEntry = ((uint8*)start - block) / sizeof(HTreeEntry);
HTreeEntry* entry = &((HTreeEntry*)block)[fCurrentEntry];
const HTreeEntry* entries = (const HTreeEntry*)blockData;
HTreeEntry* entries = (HTreeEntry*)blockData;
HTreeEntry* secondBlockEntries = (HTreeEntry*)secondBlockData;
(count - count / 2) * sizeof(HTreeEntry));
(count + fFirstEntry - fCurrentEntry - 1) * sizeof(HTreeEntry));
HTreeEntry* entries = (HTreeEntry*)block;
(fFirstEntry + fCount) * sizeof(HTreeEntry));
fFirstEntry = offset / sizeof(HTreeEntry);
&((HTreeEntry*)block)[fFirstEntry]);