Pascal - 2009-09-24

I just discover this project. It is a really impressive feat.
I am trying to see if I can use this library for my DBF engine (for the index).
I have the feeling that behind the scene everyone uses the BplusTreeLong. Am I right?
<table>
<tr><td colspan="3"></td><td colspan="3">ValueType</td></tr>
<tr><td colspan="3"></td><td>Long integers</td><td>Unicode strings</td><td>Byte arrays</td></tr>
<tr><td rowspan="3">Key Size</td><td colspan="2">Fixed key size</td><td>BplusTreeLong</td><td>BPlusTree</td><td>BplusTreeBytes</td></tr>
<tr><td rowspan="2">Unbounded<br/>KeySize</td><td>Sorted</td><td> </td><td>xBplusTree</td><td>xBplusTreeBytes</td></tr>
<tr><td>Not Sorted</td><td></td><td>hBplusTree</td><td>hBplusTreeBytes</td></tr>
</table>