B-plus indexing code probs.

[phs424l at vaxc.cc.monash.edu.au]

Howdy,

Some of the definitions for file and memory operations change with model in
some compilers.  I have found that you need to explicitle typecast all the
pointers to near or far, or else you end up with a mixture of each, which
chokes the code to death :-)

I am currently using these routines with a few mods (as described in 'The C
Toolbox - Serious code for C programmers') and they are working fine.  I did
have to modify a few things though, but can't remember what now.  Once I got
them to run I wacked them in a library and forgot about them.

Try to get your hands on the book, it supplies a wealth of additional info on
the theory and code, and gives you hints and examples of how to generalise the
algos even further.  My stuff dynamically allocates tree levels and handles
arbitrary keys via user compare and size functions, and automatically detects
what type of key is used in any index ( it will perform properly on any
standard type key, and will expect user supplied compare and size functions if
it finds an unknown key type, but a magic number type will select one of your
predefined user keys)

cheers,
Daf.
-- 
-------------------------------------------------------------------------------
Davyd Norris		:	"Strange people physicists... In my opinion
Physics Dept.		:	 those that aren't already dead are in some
Monash University,	:        way very, very sick." - Douglas Adams,
Vic, Australia.		:	 "The Long Dark Tea-time Of The Soul"     
-------------------------------------------------------------------------------