TH>Borland compiles 32-bit, unless you have v3, or lower. And, don;t
TH>cut Borland too much, they have a good price/point ratio, even if
TH>they don't have every feature that other (gates) guy has.
MH>I love Borland. Wouldn't trade it for anything else. My problem
MH>though is I'm writing this program. Well, like all programs I
MH>started it for myself and now two friends of mine want an OS/2
MH>execuatable. As far as I'm aware not even version 5.01 will do
MH>this....:(
Don't know about that. I got an evaluation copy, but didn't check
that out, since I don't an OS2 machine.
TH>Anyway, you don't *have* to read in the entire file, and (in fact)
TH>you really don't want to. Just create indexes of offsets into the
TH>file and seek to it. You can have a one-to-one corespondence to
TH>entries, or one index can handle several entries. Either way the
TH>overhead is far less than loading the entire file.
MH>Well, I'm not making a nodelist compiler (might be a fun idea), but I
MH>found a way around it....:)  With minimal recoding...:)
Good.
___ Blue Wave/QWK v2.12
--- Maximus/2 3.01
---------------