Simple B-tree in C

PROJECT UPDATE. The specifications that are attached in the ZIP file are NOT changed, but I would like to make some points clearer. What I need is a set of C functions that I will link to a Pascal program. These functions implement a B-tree index. The index can get up to and above 1.000.000 entries, with key length of 255 characters. It is therefore mandatory that the Whole tree stays on files, that are read and written but never competely loaded into memory. The key itself is 255 characters, and together with the key come two other fields (255 and 32 characters) that need to be retrieved through the index. Duplicate keys must be available. If MIGHT be better to use a B+tree instead of a B-tree, as I asked for transversal navigation in the index and that's much easier to implement in B+trees than in B-trees. I am open to suggestions, though. For what I understand, the better solution is NOT to reinvent the weel and to get an available source code and adapt it to my needs. For example, at [login to view URL] , under "Very large file" look under B-trees. There you will find an ANSI-C implementation of a B++tree (a variant of B+tree). Again, I am not a good C reader, but that seems nice: file-based, buffered pages, duplicate keys, and free for use (it says so on the first page). If you take that code, check it properly, adapt it to my needs, comment it thoroughly and assist me in interfacing with it for me it's fine. The procedures I listed in the specs are what I would have liked to call from Pascal, of course they should be properly defined. Also, please note the change in deadline. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete C source code of all work done, compilable in gcc. No dependencies on third-party tools 2) Complete ownership and distribution copyrights to all work purchased. 3) Abundant internal documentation (i.e. comments) at least 1 line of comments each 4 lines of code. File structure must also be exactly documented. Algorithms, where different from the ones shown at [login to view URL] must be explained too. Also check [login to view URL] where it speaks of B-trees ## Platform C language BETTER IF ANSI C ## Deadline information As soon as possible, short timeframes will be a plus!