This is a tool to evaluate building and searching a sorted list.
Since the list is divided into blocks it has many similarities to a binary tree.
It should be an easy task to save the blocks to disk instead of memory.
If this is done it can be used as a key file to search random access files.
Suggestions / improvements welcome.
KetilO
Since the list is divided into blocks it has many similarities to a binary tree.
It should be an easy task to save the blocks to disk instead of memory.
If this is done it can be used as a key file to search random access files.
Suggestions / improvements welcome.
KetilO
Hi KetilO
Nice and useful code! 8)
Some time ago I have written the implementation of dbase index files that uses the same aproach but on file.
Biterider
Nice and useful code! 8)
Some time ago I have written the implementation of dbase index files that uses the same aproach but on file.
Biterider