public override int CompareTo(BTreeOnHeapDataRecord record)
{
if (record is TableContextRowID)
{
return(dwRowID.CompareTo(((TableContextRowID)record).dwRowID));
}
return(-1);
}
public override int CompareTo(BTreeOnHeapDataRecord record)
{
if (record is PropertyContextRecord)
{
ushort key = (ushort)wPropId;
ushort keyToCompare = (ushort)((PropertyContextRecord)record).wPropId;
return(key.CompareTo(keyToCompare));
}
return(-1);
}
public BTreeOnHeapLeaf(byte[] heapItemBytes)
{
int offset = 0;
while (offset < heapItemBytes.Length)
{
T record = BTreeOnHeapDataRecord.CreateInstance <T>(heapItemBytes, offset);
Records.Add(record);
offset += record.RecordLength;
}
}
// Note: The PC is simply a BTH with cbKey set to 2 and cbEnt set to 6
public List <T> GetAll()
{
List <T> result = new List <T>();
List <byte[]> leaves = new List <byte[]>();
if (BTreeHeader.bIdxLevels > 0)
{
KeyValuePairList <byte[], byte> parents = new KeyValuePairList <byte[], byte>();
parents.Add(GetHeapItem(BTreeHeader.hidRoot), BTreeHeader.bIdxLevels);
while (parents.Count > 0)
{
byte[] parentBytes = parents[0].Key;
byte level = parents[0].Value;
int offset = 0;
while (offset < parentBytes.Length)
{
HeapID hid = new HeapID(parentBytes, offset + BTreeHeader.cbKey);
byte[] bytes = GetHeapItem(hid);
if (level == 1)
{
leaves.Add(bytes);
}
else
{
parents.Add(bytes, (byte)(level - 1));
}
offset += BTreeHeader.cbKey + HeapID.Length;
}
parents.RemoveAt(0);
}
}
else
{
leaves.Add(GetHeapItem(BTreeHeader.hidRoot));
}
foreach (byte[] leafBytes in leaves)
{
int offset = 0;
while (offset < leafBytes.Length)
{
T record = BTreeOnHeapDataRecord.CreateInstance <T>(leafBytes, offset);
result.Add(record);
offset += BTreeHeader.cbKey + BTreeHeader.cbEnt;
}
}
return(result);
}