They certainly reduce the infrastructure overhead (number of pointers), but the last time I used b-tree was ~20 years ago, and my memory of them is ***AAAAAAAAAAAAARGGGG!***.
We were using a library purchased from a 3rd party company that went to the wall and needed to move from 16 to 32-bit compiles.
We had the source code and thought it would be reasonably easy, till we looked. It was a nightmare. The algorithms are really quite involved.
In reply to Re^2: Heap structure for lookup?
by BrowserUk
in thread Heap structure for lookup?
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |